Felix Halim .NET :: Statistics Comparer

It is good to have a "rival" in any competitions. This makes you and your rivals improve a lot faster than those who don't have rivals. You probably have some rivals in solving UVA Problems : "You can solve any problems that your rivals solves, to prove that you are superior than your rivals". This can be a GREAT motivation for you to improve yourself. If you don't have any rival, please find one, and try to surpass your rival. If you managed, then find another superior rival, and try to surpass him/her. Until you are on the TOP! (at this time, find other rivals on other online-judges :D)

Now, the problem arise again. It is tedious to compare your statistics and your rivals manually. Also it is more tiring if you have a lot of rivals :D (you've to compare many statistics). Moreover, probably you have 2 groups of rivals and you want to compare the groups statistics it is even more confusing.

For the sake of good motivation in rivalry, I made a script to compare statistics easily. Using this script, you can compare your statistics with your rivals. Not only that, you can merge your statistics with your friends and compare it with other groups of rivals :D interesting, isn't it? How is that possible? This is as easy as Set manipulations. For example your statistics is represented as a set A and your rivals each represented as set B, C, D, E.

To know what are the the problems you have solved but your rivals does not, just execute a Set operation: A-B-C-D-E or A-(B+C+D+E), that's easy.
Suppose you have your "gang" (A,C) and have a rivals of another "gang" (B,E). To see what problems that your gang hasn't solved but your rival has, execute this Set operation: (A+C)-(B+E).
Now if you want to know what are the problems that your gang and your rivals' gang have not solved, there is a special set S which contains all problems in UVA. So you can do Set operation: S-(A+C)-(B+E) or S-(A+C+B+E) or S-A-C-B-E.
And by request, now available a new special set, V which contains all available problem. The special set V is basically the same with special set S which problems with no submissions removed. So, another advantage is that you can query problems that has no submission by doing set operation S - V.

To use this script, just input the UVA user_id for A, B, C, D, and E (it is not mandatory to fill all of them). Then click "Compare" button