#include #include using namespace std; class primePairs { public: primePairs(int inp1) { vector pair1, pair2 ; findPairs( &pair1, &pair2, inp1) ; printPairs( &pair1, &pair2, inp1) ; } ~primePairs() { } void findPairs( vector *vec1, vector *vec2, int inp1) { int count1, count2 ; int label1, label2 ; for (int i=1; i<=inp1; i++) { count1 = 0 ; for (int j=1; j<=i; j++) { //if() if((i%j)==0) count1++ ; } if(count1>2) label1 = 0 ; else label1 = 1 ; count2 = 0 ; for (int j=1; j<=(inp1-i); j++) { if(((inp1-i)%j)==0) count2++ ; } if(count2>2) label2 = 0 ; else label2 = 1 ; if( (label1==1) && (label2==1) ) { vec1->push_back(i) ; vec2->push_back(inp1-i) ; } } } void printPairs( vector *vec1, vector *vec2, int inp1) { cout << "All pair number with sum equal to " << inp1 << " are : " << endl ; for( int i=1; i<=vec1->size(); i++) { if(vec1->back()!=1 && vec2->back()!=1) cout << " " << vec1->back() << " , " << vec2->back() << endl ; vec1->pop_back() ; vec2->pop_back() ; } } private: //int firs, seco ; }; int main() { int inp ; cin >> inp ; primePairs pair(inp) ; return 0 ; }

Print all prime number pairs that their sum equals to the number given by the user