Prime Sum Hackerrank C++ Solution
Below is the solution for Prime sum question on Hackerank. #include<bits/stdc++.h> using namespace std; #define REP(i,a,b) for(i=a;i<b;i++) #define rep(i,n) REP(i,0,n) […]
GFG POTD Latest Solution
Below is the solution for Prime sum question on Hackerank. #include<bits/stdc++.h> using namespace std; #define REP(i,a,b) for(i=a;i<b;i++) #define rep(i,n) REP(i,0,n) […]