If you don't have a uHunt code yet, you can get it by sending an email to uhunt@felix-halim.net
from your UVa's registered email, with subject "generate-code" without the quotes.
uHunt is a tool for UVa online-judge that keeps track which problems you have solved and provides statistics as well as a number of selections for the next problem to solve.
Steven Halim and I recently published the Competitive Programming book which is targetted
to help regular computer science students to quickly get up and running for the
ACM ICPC as well as IOI.
The book discusses the types of problems that are frequently occurs in programming contests.
The exercises have been integrated to this uHunt tool so that you can keep track of your progress.
To get started, select a chapter from the table on the right and happy solving :)
Next Problems to Solve
You can view your unsolved/solved problems, sort them, filter by volume, etc.
If you just want to solve as many problems as quickly as possible,
it's convinient to pick problems according to the dacu (distinct accepted users) in descending order.
The bigger the dacu the easier the problem should be and the more probable
it will appear in the UVa discussion board.
Show : [
25 |
50 |
100
] View : [
unsolved |
solved |
both
]
Volume :
No
Number
Problem Title
nos
anos
%anos
dacu
best
yours
diff
rank
Volumes
World Ranklist
Below is the Author Ranklist (it is a bit different in the sorting order: ac, nos instead of ac, tried, nos). The additional columns: "2d, 7d, 31d" represents the number of (distinct) solved problems in the past 2 days, 7 days, 31 days.
It is good to have partners (or rivals) in any competitions. Rivals can give you strong motivations to improve yourself. One of the motivations can be: "to solve any problem that your rivals solves, just to stay ahead from your rivals :)". More Info...
Using set manipulations you can merge your statistics with your partners and compare it with other groups of rivals :D interesting, isn't it? See the following examples. Later on, the variables A,B,C,D,E should be replaced by the usernames of the users.
To know what are the the problems you (A) have solved but your rivals (B,C,D,E) do not, execute the following set operation: A-B-C-D-E or A-(B+C+D+E).
Suppose you and your partners form a group (A,C) and your rivals form another group (B,E). To see what problems that your group 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 group and your rivals 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.
There are other special sets: cpbook and cpbooks which contains all problems in the Competitive Programming book and the starred only.
The available operators are:
union +,
subtraction -,
intersection &,
and brackets () to force operator precedence.
27 Dec 2011 - Changed the "User Submissions" API: - removed Memory field and, - the submission time is now in unixtimestamp (previously was unixtimestamp/60).
10 Dec 2011 - Fixed the API for Problem List description (index 18 is moved to 6).
3 Oct 2011 - Fixed a bug in Statistics Comparer regarding set S.
1 Oct 2011 - Added an API to convert UVa username to UVa user ID.
25 Sep 2011 - Added an API to retrieve particular user submissions on specific problems.
25 Sep 2011 - Changed Problem API for individual problem.
Frequently Asked Questions
Q: What are the meaning of the colors on some problem numbers?
A: The problem number will will be colored
Red if it was last submitted less than 2 days ago,
Green for less than 1 week ago,
Blue for less than 1 month ago,
Orange if the problem is not yet Accepted,
otherwise, Black.
In the ChatBox and in the Live Submissions, some problem numbers will be
underlined if you have solved the problem.
The bold problem numbers in the statistics denotes that
the runtime of your submission is equal to the best runtime (rank 1 of that problem).