This is actually for Project Euler (Probably shouldn't be asking for help, but I want to know). I'm trying to find the sum of all prime numbers less then 1,000,000. So, I was just trying to brute force it. I've read over the code a million times, but I can't figure out whats going on.
It's returning a crazy negative number. -1104303641 to be specific.
It's very slow too. If you want to compile it you can change 'system("clear")' to what ever you like, or just take it out altogether. So, my main question is, "Why is the total coming out negative?"
using namespace std;
bool check_prime(int &num);
int total = 2; //Start at 2, because the loop starts with 3, so still needs to be accounted for.
for (int c = 3; c < 1000000; c += 2) //Increment by 2, because primes are odd.
total += c;
if (c % 729 == 0) //Get a % completion.
cout << (c / 1000000.0f) * 100.0f << "%" << endl;
cout << "done" << endl;
cout << "Total: " << total << endl;
Checks if the number given is prime...I hope.
bool check_prime(int &num)
for (int k = 2; k < num; ++k)
if (num % k == 0)