OJ Board

using sieve approach im getting tle.. can any one give me a good algo to do it.. #include<iostream> #include<cstring> #include<cmath> #include<vector> using namespace std; #define MAX 2147483647 unsigned mark[(MAX>>5)+2]; #define checkp(x,n) (x[n>>5]&(1<<(n&31))) #define setp(x,n) (x[n>>5]|=...

getting correct answer for alla the test case but gettin WA can any one help.. #include<iostream> using namespace std; #define LL long long int LL arr[20005]; int main() { LL t,i,j,k,s,f,m,n; LL maxsum,suffixmax; freopen("1.txt","r",stdin); cin>>t; for(k=1;k<=t;k++) { scanf("...

im getting runtime error can any one help me out ??/ #include<iostream> #include<stdio.h> using namespace std; #define mx 1000001 long int r1[mx]; long int r2[mx]; int main() { long int p; long int i; long int cnt; long int x; while(scanf("%ld",&p)==1) { cnt=0; for(i=1;i<=p;i++) { cin>...