UVa OJ Board

Why WA!!! Please give me, some input & output. #include<stdio.h> long A[1009],B[1009],C[1009]; long d[40],v[40],x[40],y[40]; long t,w,n,i,j,max,count,k,flag; int main() { while(scanf("%ld %ld",&t,&w)==2) { scanf("%ld",&n); for(i=0;i<n;i++) { scanf("%ld %ld",&d[i],&v[i]); x[i] = w * d[i] * 3; y[i]=0;...

I also got WA. But why??? #include<stdio.h> long B[109][109],n,cas,cas1,count,i,j; char A[109][109]; void make(long x,long y,long z,long z1) { B[x][y]=1; if(z+1<=n/2) { if((z1==0 ||z1==1)&&x-1>=0&&('x'==A[x-1][y]||'@'==A[x-1][y])&&B[x-1][y]==0) make(x-1,y,z+1,1); else if((z1==0 ||z1==1)&&x+1<n&&('x'...

Why WA!!! Please, some one check my outputs & say what is the problem in my triples. Thanks #include<stdio.h> #include<math.h> long P[1009],A[1009]; long sam1[1009],sam2[1009],sam3[1009],n,sam; void make(long h1,long h2,long h3) { long long x1,x2,x3,x4,i,v1,v2; x1 = h3 - h1; x2 = (h3 * 10000)/h1; x3...

I think this problem is similar of 296. But i do not understood the output of: 567 0 1 & 91543 0 5.
How the output will be 234 & 44.
My program gave output 216 & 1024.
Please, any one discuss how output is 44 for 91543 0 5 ?

Why WA!!! Please help, give me some test case which my code fail. I Think my code is ok :( #include<stdio.h> #include<string.h> long x[709],y[709],cas,cas1,n,N,max; long long X[709],Y[709],C[709],left[709],right[709]; long long t1,t2,p1,p2,i,j,root; char temp[109]; int main() { gets(temp); sscanf(te...

Why WA!!! Please give me some sample input & output to make my code AC. Thanks. #include<stdio.h> #include<string.h> unsigned long long count,tc1; long n,i,j,next,l,st,k,p,cas1,pp1; long value[4000009],index1[4000009],brother[4000009]; char temp[1009]; char Ch[4000009]; int main() { while(1) { scanf...

Why WA!!!!!!!! I have checked all the input & output of the board but still WA. Please give me some sample input & output to make my solution AC. Thanks #include<stdio.h> #include<string.h> char result[509],output[509]; char A[109][3][509]; void mul(char h1[509], long h2) { long l,i,hate; l = strlen...

Why WA!!! I used BFS. Please give me some input & output which my code can not cover. Thanks

Why WA!!! Please give me some test case. Thanks.

To MRH Your input is wrong according to the statement -> "no two nodes are directly connected by more than one edge." I know about MST but i want to solve this problem in different way & my solution was not MST. If no two nodes are directly connected by more than one edge then my solution is ok, i t...

I got WA. But i think my solution is ok. So, please give me some critical sample input & output.

To : zhouerjin
Change only one line & i hope that will make you AC.
change to -> Because if u & v two are -1 then u*v>0

Why i WA? I test all the inputs in the board. But WA. Please, someone give me some test case that fail my code. Thanks. #include<stdio.h> #include<string.h> char s[13][13],sam[13][13]; long n,yes,sa[19]; void make(long x,long y,long z) { if(x==n) yes = 1; else { long flag,i,j,i1; flag=1; for(i=0;i<7...

Why WA???

Why WA???