| [ Sign In ] |
| uHunt hunt problems that matter |
uHunt is a tool for UVa online-judge that keeps statistics, provide selections of problems to solve, and exposes a web API for other web developers to build upon it. See a brief history of uHunt for more.
To quickly submit your solution, use UVa Quick Submit.
Search Problem Number :
| Show : 5 | 10 | 20 | 50 | 100 Live Submissions (All Users) [UVa Link] | |||||||||
|---|---|---|---|---|---|---|---|---|---|
| # | Problem Title | User (username) | Verdict | Lang | Time | Best | Rank | Submit Time | |
| Show : 5 | 10 | 50 | 100 | 500 | ALL Last Submissions (auto update) [UVa Link] | ||||||
|---|---|---|---|---|---|---|
| Problem | Verdict | Lang | Time | Best | Rank | Submit Time |
Solved : 0, Submissions : 0
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 :)
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.
|
| |||||||||||||||||||||||
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.
| World Ranklist Show: above [ 10 | 20 | 50 | 100 ]; below [ 10 | 20 | 50 | 100 ] | |||||||
|---|---|---|---|---|---|---|---|
| Rank | Name | Username | AC | Subs | 2d | 7d | 31d |
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...
Expression1:I have published a web API for acquiring real-time UVa statistics.
Change Log:
In ACM ICPC, usually you need to solve around 7-9 problems in 5 hours. To practice yourself in that kind of contest settings, this tool allows you to pick a number of UVa problems and create a "virtual" contest. You can set the start date/time and its duration. You can invite your friends and practice together. It is also OK to generate a virtual contest just for yourself, to time your speed. For example, you are determined to solve 5 particular problems in 3 hours. Then create a virtual contest and set the duration to 3 hours using the following generator:
Tools like this is easily built using the uHunt web API. Feel free to generate as many virtual contests as you like, it is cheap. You can throw it away when the virtual contest has ended (without feeling guilty :). You can also host the virtual contest privately in your own website or internal server in your university.