Here's the list of problems that we have considered. See the additional list below for other problems of interest to us. The problem numbers are those that are found on the Online Judging site at the Universidad de Valladolid.
Note: According to the programming
contest rules, your programs must be written to read from the standard
input and write to standard output in order to be correctly accepted.
What makes a problem interesting (to us, at least)? Some problems we select here (or later) might involve:
- Use of mathematical techniques and known algorithms, such as dynamic programming, finding shortest paths in graphs, the Euclidean algorithm, etc.;
- Elementary (or maybe not-so-elementary) probabilistic analysis;
- Combinatorial functions and methods, such as binomial coefficients, Catalan numbers, the principle of inclusion/exclusion, etc.;
- Recursion (although this can often be reformulated in a non-recursive fashion);
- A method/class for handling big integers (such as the Java BigInteger class);
- A backtracking routine to find the solution (i.e. some guided trial-and-error, if you like);
- Ad hoc methods for the solution;
- Etc.
| 10037 | Bridge | 8 Oct 2008 |
| 10003 | Cutting Sticks | 12 Mar 2008 |
| 10131 | Is Bigger Smarter? | 5 Mar 2008 |
| 10069 | Distinct Subsequences | 27 Feb 2008 |
| 10077 | The Stern-Brocot Number System | 13 Feb 2008 |
| 10125 | Sumsets | 30 Jan 2008 |
| 10128 | Queue | 12 Dec 2007 |
| 10110 | Light, More Light | 5 Dec 2007 |
| 263 | Number Chains | 21 Nov 2007 |
| 105 | The Skyline Problem | 14 Nov 2007 |
| 10025 | The ? 1 ? 2 ? ... ? n = k problem | 7 Nov 2007 |
| 10288 | Coupons | 31 Oct 2007 |
| 177 | Paper Folding | 24 Oct 2007 |
| 10315 | Poker Hands | 10 Oct 2007 |
| 120 | Stacks of Flapjacks | 3 Oct 2007 |
| 10254 | The Priest Mathematician | 2 May 2007 |
| 412 | Pi | 25 Apr 2007 |
| 299 | Train Swapping | 21 Mar 2007 |
| 10127 | Ones | 28 Feb 2007 |
| 10205 | Stack 'em Up | 21 Feb 2007 |
| 10189 | Minesweeper | 14 Feb 2007 |
| 10038 | Jolly Jumpers | 7 Feb 2007 |
| 100 | The 3n+1 problem | 31 Jan 2007 |
Some more advanced problems are given below if you fancy giving them a try. These
are problems that we will likely (eventually) get to at some point, especially
since some of them require more ingenuity in their solution.
Note: For some of these problems, we may not have devised our own solution to
them (yet), but they seem interesting in some way or another.
| 674 | Coin Change |
| 834 | Continued Fractions |
| 855 | Lunch in Grid City |
| 882 | The Mailbox Manufacturers Problem |
| 10001 | Garden of Eden |
| 10007 | Count the Trees |
| 10018 | Reverse and Add |
| 10026 | Shoemaker's Problem |
| 10033 | Interpreter |
| 10036 | Divisibility |
| 10042 | Smith Numbers |
| 10049 | Self-describing Sequence |
| 10056 | What is the Probability? |
| 10094 | Place the Guards (aka The n Queens Problem) |
| 10105 | Polynomial Coefficients |
| 10196 | Check the Check |
| 10202 | Pairsumonious Numbers |
| 10225 | Discrete Logging |
| 10258 | Contest Scoreboard |
| 10261 | Ferry Loading |
| 10271 | Chopsticks |
| 10487 | Closest Sums |
| 10719 | Quotient Polynomial |
| 10900 | So you want to be a 2^n-aire? |
| 10931 | Parity |
Our solutions
(Do it first yourself!)
Last modified 22 September 2008.
Got a comment or question?
Email us!