/* Author : ~swim~ Date : 24-May-2018 Description : [ASSIGNMENT] : The Sum Of Prime Distance We define the Prime Distance between two even numbers as : 》The number of primes between two even numbers!《 TASK : Given an integer array. Calculate the sum of the Prime Distance of each pair of elements in the array. NOTE! All elements in the array are unique even numbers and they are arranged in ascending order! Example : For arr = [ 4, 6, 12 ] the output should be 6 prime distance of (4, 6) --> 1 prime distance of (6,12) --> 2 prime distance of (4,12) --> 3 https://code.sololearn.com/W60Cek9HX6lW/?ref=app Input : Input numbers of the range separated by space and press submit */ #include #include #include #include #include using namespace std; using bignum = unsigned int; using Pair = pair; using VP = vector; // Standard Sieve for generating prime. // Returns an array of true or false // indicating if the number is prime or not auto generate_primes(bignum high) { vector primes(high,true); primes[0] = primes[1] = false; for(bignum x=2;x<=high; x+=1) { if(primes[x]) { // set all multiples to zero for(bignum j=2*x;j<=high; j+=x) primes[j]=false; } }// end for return primes; }// end Gen_primes // calculate the sum between the pairs in // the range auto Distance(vector const& Primes, vector const& vp_r) { auto rtot{0}; for_each(vp_r.begin(), vp_r.end(), [&](Pair const& p) { cout << endl; cout << "pair("<> tmp) { ss << tmp << " "; range.emplace_back(tmp); }// while(cin >> tmp) ss << "] = "; // various range validations if(range.size() < 2) { cout << "error, enter at least two numbers to form a range\n"; return -1; } // check for odd number if(any_of(range.begin(), range.end(), [](auto n) { return (n<0||(n&1)); })) { cout << ss.str() << endl; cout << "error, range cannot have" " odd number\n" "or negative" " number\n"; return 1; } // check if range is sorted if(!is_sorted(range.begin(),range.end())) { cout << ss.str() << endl; cout << "error, input range is" " not sorted\n"; return 2; } // check if range contains unique nos. if(auto it = unique(begin(range), end(range)) != end(range)) { cout << ss.str() << endl; cout << "error, input range does not\n" "contain unique elements\n"; return 3; } // generate the list of primes up to // max value in the range auto const& primes = generate_primes(range.back()+1); cout << "Prime Distance\n"; cout << ss.str(); auto total = Distance(primes, gen_pairs(range)); cout << "Total = " << total << endl; return 0; }// end main

[Assignment] Prime_Distance.cpp