OJ Board

wrong output for the third sample case :oops: Note: I'm changing the strings with numbers starting from 0 then I'm doing normal dfs. so the case of not being relations between drinks are handled :) #include<map> #include<deque> #include<queue> #include<stack> #include<sstream> #include<iostream> #in...

I don't completely understand the problem :3 but this is my code, please if someone can tell what is wrong My Approach: 1) make an edge from every character in the string to character before it, I made the map "hs" to exchange the characters with numbers ("id" variable) so that w...

thanks.. that was helpful

why I'm getting wrong answer? #include<iostream> #include<vector> #include<stdio.h> #include<string.h> using namespace std; bool prime[1005]; vector<int>primeNum(170); int sizePrimeNum; void seive() { memset(prime, true ,sizeof prime); prime[0] = 0; for(int i=2; i*i<1005;i++) if(prime[i]) for(int j=...

My code #include<stdio.h> using namespace std; int main() { int t; scanf("%d",&t); while(t--) { long long x,rev_x=0,y,rev_y=0,sum,rev_sum=0; scanf("%d %d",&x,&y); while(x>0) { rev_x *= 10; rev_x += x%10; x=x/10; } while(y>0) { rev_y *= 10; rev_y += y%10; y=y/10; } sum...

My code is AC in SPOJ and POJ, but in UVA it is WA??
Why is that heppens to the same code ??

I don't get the point of coming back ??
I sort them then I check the difference between them, every test case I run in my program is correct, so why I got WA?