OJ Board

The white squares of first row or column are "eligible". Problem statement is not so clear.

I got AC, just for clarity:
You need't to print a space after scores which less than 100;
You need't to add an epsilon to output money, just using setprecision(2) is fine for C++ user.
The test data on UVa OJ cotains non tricky input, make sure your algorithm is right.

Five times of P.E. The sampe output in problem statement PDF is wrong. Correct ouput format(if the number of routes is 1, you should output "1 routes", after every streetcorner just print ONE space): CASE 1: 1 2 3 4 6 1 2 3 5 6 1 2 4 3 5 6 1 2 4 6 1 3 2 4 6 1 3 4 6 1 3 5 6 There are 7 rout...

I think the answer is negative. You should code a custom compare function as parameter for sort.

I got AC. yeah!

I found my mistake, DFS is not proper for finding cycle in directed graph.

Thanks for your hints, I got AC.

WA, can anyone give me some critical test data? #include <iostream> #include <vector> #include <algorithm> using namespace std; const int INPUT = 0, OUTPUT = 1, SYN = 2, ASYN = 3; const string typeText = "iosa"; struct vertex { int index, delay, type; }; vector < vertex > verties; vector <...

I found my bug by myself.

Same to me.

WA again and again. Could anyone point out my error? #include <iostream> #include <iomanip> #include <map> #include <cmath> using namespace std; const double EPSILON = 1E-7; const double PI = 3.14159265358979323846; const double HALF_PI = PI / 2.0; map < char, double > paras; map < char, bool > defi...

mf is right, the operators are right-associative. After several failed attempts, I got AC, and for clarity, "play each strategy against each other strategy 10 times" means: a b c 1: clear the memory, a plays with b 10 times, clear the memory, a plays with c 10 times, output the scores of a...

The solution of UVa 171 on uDebug is WRONG. For test data given by DIR EN GREY in thread: https://uva.onlinejudge.org/board/viewtopic.php?f=1&t=2711, the output of soludtion is different from the right output in thread. At first, I tried to solve this problem according the "right answer&quo...

nooooo!!! I found my mistake... I'm stupid... and get accept. I got wa many times, and I made many test cases. I'll show that here, I wish these help someone... last case is very critical data for my code... jesus... good luck I spent some days on this problem but always WA. At first, I compared ou...

I'm confused with this problem completely, according to Per, you may turn any direction as you like at nine intersections, leave the througways by truning left(sharp left in the case of boulevards), but according to uDebug(https://www.udebug.com/UVa/163, Solution by brianfry713): test case 1: INPUT:...