#include #include using namespace std; struct structResult { int numberToGoldbach; vector> sumOfPrimes; }; vector > goldbachConjecture(int input) { vector primes; vector > result; if (input % 2 != 0 || input <= 2) { throw "Argument must be an even number and must be greater than 2!"; } for (int i = 2; i < input; i++) { bool isPrime = true; for (int j = 2; j < i; j++) { if (i%j == 0) { isPrime = false; break; } } if (isPrime) { primes.push_back(i); } } for (int i = 0; i < primes.size(); i++) { for (int j = i; j >= 0; j--) { if (primes[i] + primes[j] == input) { result.push_back({ primes[i], primes[j] }); } } } return result; } vector goldbachConjecture(int rangeStart, int rangeEnd) { if (rangeStart <= 2 || rangeEnd <= 2) { throw "Arguments must be greater than 2!"; } if (rangeStart == rangeEnd) { throw "Arguments must not be equal!"; } int start, end; vector primes; vector result; if (rangeStart < rangeEnd) { start = rangeStart; end = rangeEnd; } else { start = rangeEnd; end = rangeStart; } if (start % 2 != 0) { start++; } if (end % 2 != 0) { end--; } for (int i = 2; i <= end; i++) { bool isPrime = true; for (int j = 2; j < i; j++) { if (i%j == 0) { isPrime = false; break; } } if (isPrime) { primes.push_back(i); } } for (start; start <= end; start += 2) { structResult resObj; resObj.numberToGoldbach = start; for (int i = 0; i < primes.size(); i++) { for (int j = i; j >= 0; j--) { if (primes[i] + primes[j] == start) { resObj.sumOfPrimes.push_back({ primes[i],primes[j] }); } } } result.push_back(resObj); } return result; } int main() { short version; do { cout << "Enter 1 for one number,enter 2 for range: "; cin >> version; } while (version != 1 && version != 2); if (version == 1) { int input; do { cout << "\nEnter even number greater than 2: "; cin >> input; if (input % 2 != 0) { cout << "\nYour number was not an even one!\n"; } else if (input <= 2) { cout << "\nYour number is not greater than 2!\n"; } } while (input % 2 != 0); vector > result = goldbachConjecture(input); for (int i = 0; i < result.size(); i++) { cout << input << '=' << result[i][0] << '+' << result[i][1] << endl; } } else if (version == 2) { int rangeStart, rangeEnd; do { cout << "\nEnter range: "; cin >> rangeStart >> rangeEnd; } while (rangeStart <= 2 || rangeEnd <= 2 || rangeStart == rangeEnd); vector result = goldbachConjecture(rangeStart, rangeEnd); for (int i = 0; i < result.size(); i++) { for (int j = 0; j < result[i].sumOfPrimes.size(); j++) { cout << result[i].numberToGoldbach << '=' << result[i].sumOfPrimes[j][0] << '+' << result[i].sumOfPrimes[j][1] << endl; } } } system("pause"); return 0; }

Goldbachs Conjecture [challange]