/* Author : ~swim~ Date : 6-Jun-2018 Description : [ASSIGNMENT] : Transform To Prime TASK: Given a List[ ] of n integers, find minimum number to be inserted in a list, so that sum of all elements of list should equal the closest prime number. NOTE! - List size is at least 2. - List's numbers will only positives (n > 0). - Repeatition of numbers in the list could occur. - The newer list's sum should equal the closest prime number. Example #1 minimumNumber({3, 1, 2}) --> return (1) Explanation: Since, the sum of the list's elements equal to (6), the minimum number to be inserted to transform the sum to prime number is (1), which will make the sum of the List equal the closest prime number (7). Example #2 minimumNumber({2,12,8,4,6})-->return (5) Explanation: Since, the sum of the list's elements equal to (32), the minimum number to be inserted to transform the sum to prime number is (5), which will make the sum of the List equal the closest prime number (37). HappyCodings!:) https://code.sololearn.com/WBTmxnVI7fYR/?ref=app Input: Enter 2 or positive numbers separated by space */ #include #include #include #include using namespace std; // standard prime number checker bool isPrime(uint64_t num) { if(num < 2) return false; if(2 == num) return true; uint64_t limit = sqrt(num)+1; for(uint64_t i=2; i<=limit; i++) if(!(num%i)) return false; return true; } uint64_t make_sum_prime(uint64_t sum) { //check if sum is already prime if(isPrime(sum)) return 0; // if sum == 0 return 2 to make prime // if sum == 1 return 1 to make prime if(0==sum) return 2; else if(1==sum) return 1; // if the sum is even make it odd uint64_t nsum = (sum%2)==1 ? sum : sum+1; // check if new sum is prime, if // not keep adding 2 till it become // prime while(!isPrime(nsum)) nsum += 2; // the number to be added is the // difference between nsum and sum return nsum - sum; } // calculate the sum of sequence auto Sum = [](auto const& seq) { uint64_t sum{0}; for(auto const& e:seq) sum += e; return sum; }; // display the sequence auto Display = [](auto const& seq) { for(auto i=0;iint { vector seq; uint64_t t; while(cin >> t && cin.good()) seq.emplace_back(t); if(seq.size() >= 2 ) { cout << "\nyou entered :\n"; Display(seq); auto val = Sum(seq); cout << "Sum = " << val << endl; val = make_sum_prime(val); if(val != 0) cout << "Add " << val << " to make sum Prime\n\n"; else cout<< "Sum is already Prime\n\n"; } else { cout << "Error, enter at least 2" << " or more numbers\n\n"; } // test data vector> Testdata{ {0,0,0,0,0}, {0,0,0,1}, {1,1,1,1,1}, {2,5,11,62,43,21}, {5,5,5,7,7,7,11,11,11} }; cout << "Displaying results for" " test data\n\n"; for(auto const& v : Testdata) { Display(v); auto val = Sum(v); cout << "Sum = " << val << endl; val = make_sum_prime(val); if(val != 0) cout << "Add " << val << " to make sum Prime\n"; else cout<< "Sum is already Prime\n"; cout << endl; } }

Transform to Prime.cpp