OJ Board

i dont understand. what do you mean about "tabs" ?
Please explain me,i really dont understand,thanks.

i still get wa on this prob. Is there any input like cplusplus said that a word ends with vowel but not include to one of any loglan words? For my code ,i already posted it,please help me check it. Thank you very much for helping.

it's weird,my program gave same result as junjieliang said but it's still WA.
I used the logic that separate the sentence into pattern of words and check the structure of the pattern from the beginning of the sentence.
Looks like i should post my code here.
here it is
[cpp]
#include<iostream ...

hello everyone,
i try to solve this prob but i continously got WA. Please anyone be kind to share some important sample input so i can repair my program mistakes.
Thank you.

i use DFS recursive to find the shortest path between the odd degree nodes just for simplicity but i think dijkstra is so much better for speed.

at the first time i always get wa too,cause i construct the dp from leftside to rightside. And then my generous frient told me to reverse it. And when i contruct from rightside to leftside i got AC..
if you got the same trouble as mine, try to follow my friend's advice.
Sorry for bad english....

here is some test case
20
0.38 0.88 0.33 0.85 0.76 0.62 0.15 0.69 0.42 0.96 0.19 0.62 0.54 0.90 0.95 0.08 0.99 0.78 0.42
0.51 0.86 0.43 0.20 0.21 0.27 0.24 0.21 0.20 0.37 0.11 0.74 0.50 0.44 0.52 0.71 0.62 0.49 1.03
0.51 0.06 0.83 0.68 0.60 0.48 0.37 0.11 0.15 0.68 0.47 0.54 0.63 0.80 0.49 0.23 0 ...

try this input
...as...df..
..sd.dff.gg

the answer should be
2
3

good luck!

thank you very much for your kindness for helping me..

please help me. i dont know why i keep getting wa for this prob.
here is my code
[c]#include<stdio.h>
struct grid
{
int obstacle;
int value;
int cost;
};

struct ball
{
int px;
int py;
int d;
int life;
};

void resolve(int a,int *ax,int *ay)
{
switch(a)
{
case 0 : *ax=1; *ay=0; break ...

wow, hisoka
you're so clever. you can find where the incorrect part of my algo/code.
thanks a lot for your help and suggestion.

please help me. why did i get wa for this problem ?
here is my code.
[c]#include<stdio.h>
#include<math.h>

void generate(char flag[],long prima[])
{
long i,j,k;
for(i=0;i<50000;i++)
{
flag ='n';
prima =0;
}
prima[0]=2;
j=1;
for(i=3;i<50000;i+=2)
if(flag =='n')
{
prima[j]=i;
j++;
for(k ...

if you declare your array 5000 that means the index is between 0-4999.
if the input is 5000 then your code try to read index 5000 which is illegal.
i think thats why you got RTE.

my algo for this problem quite simple.
1.convert the input to decimal
2.try to find the roman for decimal from the given input.
3.compare the roman with the original input and bounded the decimal
below 4000.

the result runs quite fast within 0.1 second.

phew...after 20 times submit finally get ac.
the main problem is that i misunderstood the problem.
it should be print the current line till finish, but i print till find the number out of bound.
thanks anyway..