UVa OJ Board

Try these Input: output: Hope you find mistake.

Try this case also:
Input::: output:::

To jainal, compare your code with below code segment See the change to take input of gets()// gets is very dangerous so I prefer scanf() char str[10000],max,*p,tmp[10]; scanf("%d",&test); gets(str); gets(str); for(int i = 0; i < test; i++){ if(i ) printf("\n"); scanf("%s",&tmp); max=tmp[0]; nV = max...

I solve it using BFS....
keeping how many node are traveled and their minimum cost.
So which algorithm you are using are not matter.

Dear Ankit,
Read below statement.

Output an empty line between cases

I am little bit confused about description and sample input. The input file contains several lines of input. Each line contains two integers n(n<=61) and back(back<=60). But sample input Sample Input 3 3 4 4 5 5 6 6 7 7 8 8 9 9 61 61 ----- back is greater than 60 The output for 60 60 is: 17293822569...

if(casno > 1)
puts("");

Problem Statement say:

Print a blank line after each test case

Not between two test case.

your code is- #include<stdio.h> #include<string.h> #include<stdlib.h> long int index,i,a,num,x,sum,res[10000]={0},dum,tot,flag; char ish[10000],temp[10000]; void main() { // freopen("h:\\392.txt","r",stdin); // freopen("h:\\out.txt","w",stdout); while(gets(ish)) { x=strlen(ish); i=-1;index=-1;dum=0;...

please use long int .

it is not so difficult;
adding reverse but no need to reverse;
add two string from left side to right side normal
print then canceling first 0 digit

input:-

101
99
out put -
2

[/code][/b][/list][/list]

this is my code pls find worng answer #include<stdio.h> void main() { out: int a,x,p,i=0,j,tm1,tm2,y=0,k[128]={0},l[128]={0}; char m; while((char)(m=getchar())!=EOF) { if(m=='\n'||m=='\r') goto end; a=(int)m; if(a<32||a>=128) goto out; for(j=0;j<=i;j++) if(a==k[j]) { l[j]++; y--; break; } else if(j=...

why time limit exceed?