[ Contest Page | Scoreboard | Submissions | Clarifications | Help | Log In ]
| Problem | Clarification |
|---|---|
| General |
What are time/memory limits for each problem? Generally 10s for an unknown number of test cases. Use however much memory you want as long as you don't crash the judge machine (myth). 1GB should be safe. |
| A - Another Rock-Paper-Scissors Problem |
why do I have a compile error on A? It compiles locally. error: call of overloaded ‘pow(int, int&)’ is ambiguous |
| C - City Driving |
are cities numbering from 0 to N-1? Read the problem statement (yes). |
| E - Empty Triangles |
Are degenerate triangles considered empty? I.e., do three concurrent lines form an empty triangle? Read the problem statement (no three lines meet at the same point). |
| A - Another Rock-Paper-Scissors Problem |
I don't think I understand Sonny's strategy. If the moves listed are separated into blocks of nine, the first one starts with an R, then the next block starts with P, then S, and then back to P. Why does it not go back to R? Isn't R what would beat an S? Did someone read "blocks of nine" somewhere in the problem statement? |
| D - Drunken Walk |
Is it possible for two vertices to have more than one edge between them? No. |
| H - Hidden Code |
I am surprised by the fact my code for problem H gives a Runtime error and would love to hear what causes it. It looks like a string index out of bounds error. |
Ultra Cool Programming Contest Control Centre v1.8
Copyright (c) 2005-2010 by Sonny Chan