Opensuse

Guyes how generate in C float number in interval -100 to 100?

Someone Help?

Guyes i generate random float number from interval but have 6 decimals and i need only 2 a = ((float)(rand() % 20001) / 100) - 100;

Guyes i generate random float number from interval but have 6 decimals and i need only 2 a = ((float)(rand() % 20001) / 100) - 100;

use <random> header if on c++

C

Well, then enjoi your rand hardcode :P

#include <algorithm> #include <algorithm> #include <iostream> #include <vector> int main() { int N, Q; std::cin >> N; int arr[N]; std::vector<int> v(N); for (int i = 0; i < N; i++) { std::cin >> arr[i]; v.push_back(arr[i]); } std::sort(arr[0], arr[N - 1]); std::cin >> Q; int arr2[Q]; std::vector<int>::iterator arr3[Q]; for (int i = 0; i < Q; i++) { std::cin >> arr2[i]; arr3[i].push_back(std::lower_bound(v.begin(), v.end(), arr2[i]) - v.begin()); } for (auto i = arr3.begin(); i != arr3.begin(); i++) { std::cout << *i; } return 0; }

#include <algorithm> #include <algorithm> #include <iostream> #include <vector> int main() { int N, Q; std::cin >> N; int arr[N]; std::vector<int> v(N); for (int i = 0; i < N; i++) { std::cin >> arr[i]; v.push_back(arr[i]); } std::sort(arr[0], arr[N - 1]); std::cin >> Q; int arr2[Q]; std::vector<int>::iterator arr3[Q]; for (int i = 0; i < Q; i++) { std::cin >> arr2[i]; arr3[i].push_back(std::lower_bound(v.begin(), v.end(), arr2[i]) - v.begin()); } for (auto i = arr3.begin(); i != arr3.begin(); i++) { std::cout << *i; } return 0; }

lmao why do you mix VLA and vectors?

vla means ??😅

Also this line of code shall not compile std::sort(arr[0], arr[N - 1]);

i actually used vector<int>::iterator

why tho?

since it has been used in the instruction of using lower_bound

std::begin(vec) too mainstream, eh?

where I have used vla ? i dont even know what it is

you can't cin >> N; and then use it as a size of a array

so should I use v.resize(N) instead of vector<int> v(N) ???

#include <algorithm> #include <algorithm> #include <iostream> #include <vector> int main() { int N, Q; std::cin >> N; int arr[N]; std::vector<int> v(N); for (int i = 0; i < N; i++) { std::cin >> arr[i]; v.push_back(arr[i]); } std::sort(arr[0], arr[N - 1]); std::cin >> Q; int arr2[Q]; std::vector<int>::iterator arr3[Q]; for (int i = 0; i < Q; i++) { std::cin >> arr2[i]; arr3[i].push_back(std::lower_bound(v.begin(), v.end(), arr2[i]) - v.begin()); } for (auto i = arr3.begin(); i != arr3.begin(); i++) { std::cout << *i; } return 0; }

Try to compile it with -std=c++17 -Wall -Wextra -pedantic-errors until you get it right

and do . is equal to ->

p->field is same as (*p).field

#include <iostream> #include <vector> int main() { using namespace std; int m, num; cin >> m; vector<int> v; for (int i = 0; i < m; i++) { cin >> num; v.push_back(num); } int n, val; cin >> n; for (int i = 0; i < n; i++) { cin >> val; vector<int>::iterator low = lower_bound(v.begin(), v.end(), val); if (v[low - v.begin()] == val) cout << "Yes " << (low - v.begin() + 1) << endl; else cout << "No " << (low - v.begin() + 1) << endl; } return 0; } // https://www.hackerrank.com/challenges/cpp-lower-bound/problem

#include <iostream> #include <vector> int main() { using namespace std; int m, num; cin >> m; vector<int> v; for (int i = 0; i < m; i++) { cin >> num; v.push_back(num); } int n, val; cin >> n; for (int i = 0; i < n; i++) { cin >> val; vector<int>::iterator low = lower_bound(v.begin(), v.end(), val); if (v[low - v.begin()] == val) cout << "Yes " << (low - v.begin() + 1) << endl; else cout << "No " << (low - v.begin() + 1) << endl; } return 0; } // https://www.hackerrank.com/challenges/cpp-lower-bound/problem

#include <iostream> #include <vector> int main() { using namespace std; int m, num; cin >> m; vector<int> v; for (int i = 0; i < m; i++) { cin >> num; v.push_back(num); } int n, val; cin >> n; for (int i = 0; i < n; i++) { cin >> val; vector<int>::iterator low = lower_bound(v.begin(), v.end(), val); if (v[low - v.begin()] == val) cout << "Yes " << (low - v.begin() + 1) << endl; else cout << "No " << (low - v.begin() + 1) << endl; } return 0; } // https://www.hackerrank.com/challenges/cpp-lower-bound/problem

what that (v[low-v.begin() +) is doing ??

Your framebuffer size is too large perhaps

void graphics_init() { uint64_t framebuffer_size = (stivale->framebuffer_height * stivale->framebuffer_width) * sizeof(struct pixel32); framebuffer_db = malloc(framebuffer_size); memset(framebuffer_db, 0, framebuffer_size); } Hi, any idea why this faults?

void graphics_init() { uint64_t framebuffer_size = (stivale->framebuffer_height * stivale->framebuffer_width) * sizeof(struct pixel32); framebuffer_db = malloc(framebuffer_size); memset(framebuffer_db, 0, framebuffer_size); } Hi, any idea why this faults?

Hi. Do compilers optimize expressions inside loops, whose terms don't change, to just a single evaluation before the loop?

You can read about what optimisations are applied on loops using different optimisation levels here: http://www.cs.columbia.edu/~ecj2122/research/x86_loop_optimizations/x86_loop_optimizations.pdf

There must be more to the error than just "faults". It writes something to output, there should be core dump or something. Did you try using a debugger?

I can't debug because this runs directly in Qemu....

Why can't you attach gdb to qemu?

Because I am too dumb

I agree.