OJ Board

@Brianfry sir,
Is these valid input?
I got this input from your given sample input output.
3
Y U X Y 5
M B A Y 10
Y B X Y 10
X A
2
Y U A B 10
Y U A B 100
A B
For first test case, Young_energy[X][Y] = 5 ,Young_energy[X][Y] = 10
there are different cost for direct path of X to Y.
Little bit confused ...

Thanks brianfry713.got AC

I have passed all test case from forum.But I get always WA.
Could you please help me to find out my mistake?
Already got 3 WA :(
Here is my code:

/*UVa 401-Palindromes
Time-*/
#include<stdio.h>
#include<string.h>
const char* GetReverse(char inp[25])
{
char str[25];
int i,len=strlen(inp);
for(i ...

Thnaks lbv,got it your point.

Could you please tell me why 1 1 or 1 2 is a jolly.Since it has only one element so that we will not find any difference,then how to check this condition "the absolute values of the difference between successive elements take on all the values 1 through n-1".
I don't understand this things for 1 1 ...