OJ Board

Tested all I/O found on udebug... don't know where is the problem. Still getting WA. Please help!! #include<bits/stdc++.h> using namespace std; #define ms(x,val) memset(x,val,sizeof(x)) #define scan(x) scanf("%d",&x) #define print(x) printf("debug= %d\n",x) #define ull unsign...

Need some hints about the solution method...No Idea...

I used KMP algorithm... but getting WA... tried every test cases I can think of... :( #include<bits/stdc++.h> using namespace std; #define ms(x,val) memset(x,val,sizeof(x)) #define ull unsigned long long #define iii long long #define pi acos(-1) #define pb push_back #define PII pair<int,int> #define...

What is the algorithm for solving this kind of problem? Can this be solved using Binary Indexed Tree?

Getting TLE please help. here is my code: #include<bits/stdc++.h> using namespace std; #define ms(x,val) memset(x,val,sizeof(x)) #define ull unsigned long long #define iii long long #define pi acos(-1) #define repi(i,a,n) for(int i=a;i<n;i++) #define pb push_back #define PII pair<int,int> #define MP...

brianfry713 wrote:That is AC code

I am surprised. I did not cleared the vector. But after clearing I din't submit it. So sorry. That is an AC code.

I was trying to say that the problem statement is contradictory...

Getting Wrong answer please help: here is my code:

There is no blank line after the last dataset. So be careful about EOF to avoid TLE.

prooblem: Domino ID:11504 Why getting wrong answer?? Please help... #include<iostream> #include<cstdio> #include<vector> #include<queue> #include<map> #include<cstring> using namespace std; int main() { int cases,len,n,count,l,m,temp,temp2,top; vector<int>v[100010]; vector<int> done; bool color[1000...

Thanks brianfry...

As the problem statement is a prime number has only two divisors (1 and itself) , 1 should not be added to the list of prime numbers....

Nice problem... Got ac . I solved this using Prim's algorithm. BUT my runtime is very bad. Any suggestion about optimizing my code will be appreciated. Thanks.

thanks... brainfry... got AC...

It is so annoying...why this is like it????

int this problem: 10220 (I love big integers) it gives WA when i was using... but it is AC when i changed it to scan until EOF. Be careful about that...