OJ Board

is my approach right ????

i have changed the for loop to
but now i get WA

hi all. why TLE ???? # include <iostream> # include <cmath> using namespace std; int main() { long long x; while(cin>>x) { if(x==-1) return 0; if(x == 0){ cout<<"0 = 0 + ... + 0\n"; continue; } unsigned long long c = x*2; for(long long i=1;i<=x;i++) { long long b = 2*i-1; double y = sqrt(b...

plz help me ........... y WA ????

for the following i/p should i print 1 or 0 ???

now i am getting WA with my code .
plz help

(have posted the WA code above)

have posted working code now.
pls help me out.

when exactly doesnt it return ???
could you please give me a test case for that
thanks

what r the limits for this problem ????
i think many ppl have solved this using dfs

still cant figure out

what is the reason for RE ???

please help me

why RE ??? # include <iostream> # include <algorithm> # include <cstring> # include <cstdlib> # include <cstdio> using namespace std; char arr[1010][1010]; int r,c,seen[1010][1010]; void ff(int i,int j,int n,char x) { arr[i][j]=n; seen[i][j]=1; //up if(i-1>=0 && arr[i-1][j]==x && ! s...

please give me some test cases

why WA ?????

well i got AC . but again time is very bad 1.4 s
as far as implementation goes i use a look up table. thats much faster.
should i go in for optimizations or is there any other algo available ????