UVa OJ Board

Actually, this is indeed a horrible problem. That is because the judge doesn't have valid input for it. As per problem text: Each input line will contain no more than 1024 ASCII characters Actually there are lines with more than 65535 characters in the judgement data set. I am slightly annoyed by th...

Hello all,

The input for this is wrong. The problem states: "There will be at least one, and no more than 300 orderings consistent with the contraints in a specification. "

The last input in this set produces more than 1100 orderings.

Best Regards,
at5anpo3

Hello all,

The pdf description of this problem contains in Output section: "Characters on a line are separated by whitespace." This doesn't appear in the text description. The right way is to printf("%c", whatever) without any whitespace.

Best Regards,
at5anpo3

The example above should be missing ":" from The output file MUST end with a \n, or else you fail the judge! (had to find it the hard way).

Best Regards,
at5anpo3

apparently, some time around 2008 (look for "new judge" in these boards), the computer which measures the execution time was changed. as per 2012, I find peculiarities around 0.004 - 0.0040 seconds, code which "clearly" is faster doesn't get a faster execution time. "clearly" = for me clearly, as in...

the example with Fat and Dude is wrong.

as per text "All names are lower-case letters". Therefore, it should be fat and dude.

Best Regards,
at5anpo3

Bringing in my small contribution for all the people who are getting WA at this problem. - names can (and WILL) contain '-' character. Therefore '-' should not be considered a delimiter of names but rather a character just as 'a'...'z', '.' are. I found this the very hard way while scouting the inte...