UVa OJ Board

I got WA with this problem but tested with several inputs and failed to find the bug. Please help me to identify what's wrong in my code. Here it is: [cpp]#include <stdio.h> int X[50]; int s, t; void recurse(int k, int n, int sum) { int i, j, a, b, c; X[k] = n; if(k==t && sum==s) { printf("%d", X[1]...

tep, see the tree below: 0 | 1 / \ 0 2 / / | \ 1 0 0 3 now start traversing each level left to right hope it helps... but I got WA with my code :( some one please post some test cases.

I got WA with my code. some one please post some tests. or you can help me to find the bug in my program. here it is: [cpp]#include <stdio.h> char board[6][6]; char *str = "xo"; int game_over() { int i, j; for(i=0; i<4; i++) for(j=0; j<4; j++) if(board [j]=='.') return 0; return 1; } int wins(int pl...

I think the input is not a valid one.

I got WA with this problem. Please help me to find my bug. [cpp]#include <stdio.h> #include <math.h> int depth, ans; long long int serial, current; int recurse(int n, int d) { int i, tempDepth; long long int tempCurrent; if(d==depth) { if(serial==current+1) { ans = n; return 1; } else return 0; } fo...

If judge gives your program output limit exceeded. then change into and after that you may get answers other the OLE

rlatif119, I think you are making any mistake in your submission. If you change the datatype into unsigned long then your program gets accepted. You have to use %lu for unsigned data type and do not typecast into long. ( you don't need any typecast here )

thanks for output. I got it AC.

I spend a lot of time but can't get this problem AC yet. What's the problem is my code? Here is it:
[c]now AC[/c]

please help me to identify my problem...

I also got WA. My program passed all previous sample in/out s in this thread. Please help me to identify my problem. here is the code: [c]#include <stdio.h> #include <string.h> #include <stdlib.h> #define min(a, b) (a < b) ? a : b #define MAXV 105 #define MAXE 5100 int adj[MAXV][MAXV], dfn[MAXV], L[...

apply dynamic programming here:

1. first store all the answers in a table ( here two dimensional array )
2. just read input and write output

see that, if you calculate factorial of n then you must calculate factorials of 1 to n-1, hope it will help

My code got WA. Please help me to find the bug in my code:- [c]#include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> long gcd(long a, long b) { if(!b) return a; else return gcd(b, a%b); } void main() { int j, k, len, kase=1; long num, denom, g; double x, a, b; char ara[20]; wh...

I am also a student member of ACM.

jandujar, my acepted program prints the following output for your given input: