Search Results

Search found 2 results on 1 pages for 'regonics'.

Page 1/1 | 1 

• Why does the answer print out twice?

  - by rEgonicS

  I made a program that returns the product a*b*c where a,b,c are pythagorean triples and add up to 1000. The program does output the correct answer but does it twice. I was curious as to why this is so.After playing around with it a bit I found out that it prints out when a = 200 b = 375 c = 425. And once again when a = 375 b = 200 c = 425. *How do you put your code into a "code" block? It does it automatically for part of the code but as you can see the top portion and bottom line is left out. bool isPythagTriple(int a, int b, int c); int main() { for(int a = 1; a < 1000; a++) { for(int b = 1; b < 1000; b++) { for(int c = 1; c < 1000; c++) { if( ((a+b+c)==1000) && isPythagTriple(a,b,c) ) { cout << a*b*c << " "; break; } } } } return 0; } bool isPythagTriple(int a, int b, int c) { if( (a*a)+(b*b)-(c*c) == 0 ) return true; else return false; }

  Read the article

• Correct answer will not output

  - by rEgonicS

  I made a program that returns the sum of all primes under 2 million. I really have no idea what's going on with this one, I get 142891895587 as my answer when the correct answer is 142913828922. It seems like its missing a few primes in there. I'm pretty sure the getPrime function works as it is supposed to. I used it a couple times before and worked correctly than. The code is as follows: vector<int> getPrimes(int number); int main() { unsigned long int sum = 0; vector<int> primes = getPrimes(2000000); for(int i = 0; i < primes.size(); i++) { sum += primes[i]; } cout << sum; return 0; } vector<int> getPrimes(int number) { vector<bool> sieve(number+1,false); vector<int> primes; sieve[0] = true; sieve[1] = true; for(int i = 2; i <= number; i++) { if(sieve[i]==false) { primes.push_back(i); unsigned long int temp = i*i; while(temp <= number) { sieve[temp] = true; temp = temp + i; } } } return primes; }

  Read the article

1