→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3682 |
| 2 | ecnerwala | 3603 |
| 3 | Benq | 3549 |
| 4 | Radewoosh | 3494 |
| 5 | Petr | 3452 |
| 6 | ksun48 | 3413 |
| 7 | maroonrk | 3406 |
| 8 | Miracle03 | 3314 |
| 9 | scott_wu | 3313 |
| 10 | Um_nik | 3299 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | 1-gon | 214 |
| 2 | Errichto | 188 |
| 3 | awoo | 187 |
| 3 | rng_58 | 187 |
| 5 | SecondThread | 184 |
| 6 | Um_nik | 177 |
| 7 | Ashishgup | 176 |
| 8 | maroonrk | 173 |
| 9 | antontrygubO_o | 171 |
| 10 | -is-this-fft- | 169 |
→ Find user
→ Recent actions
I've talked about a problem from today's dress rehearsal in http://petr-mitrichev.blogspot.com/2012/05/world-finals-day-2-upe-dinner.html
Here's the first tough testcase for it: http://petr-mitrichev.blogspot.com/2012/05/power-towers-problem-testcase.html
Good luck! :)
There's a live interview with me, tomek, Onufry Wojtaszczyk and Bartholomew Furrow in 25 minutes: https://plus.google.com/u/0/101571483150813305324/posts/DxaiBoikC8N
UPD. The interview is postponed, I'll write about new date and time :)
Before systest:
- tomek, problems 1 and 2.
- Petr, problems 1 and 2.
- Jacob, problem 3.
- romanandreev, problem 2.
- ACRush, problem 2.
- tomekkulczynski, problem 2.
- jakubr, problem 2.
- RAVEman, problem 2.
- Somebody, problem 3.
- gawry, problem 1.
- hos.lyric, problem 1.
- ilyakor, problem 2.
- iwiwi, problem 3.
- Po-Ru Loh, problem 1.
- vepifanov, problem 2.
- cerealguy, problem 1.
- pparys, problem 1.
- sdya, problem 1.
After systest:
- romanandreev, problem 2.
- tomek, problem 1.
- ACRush, problem 2.
- gawry, problem 1.
- hos.lyric, problem 1.
- Petr, problem 2.
- cerealguy, problem 1.
- pparys, problem 1.
Congrats romanandreev!
Preview: http://petr-mitrichev.blogspot.com/2011/09/topcoder-open-2011.html
Live coverage in 3 hours at: http://petr-mitrichev.blogspot.com/
As usual, I'll be doing live commentary on the World Finals on http://petr-mitrichev.blogspot.com/. Here are some pictures to get started.
Here's a problem that has appeared at a recent contest: We are given a 7 times 7 field where some of the cells have numbers between 0 and 8, inclusive, and all remaining cells have dots. We want to find such allocation of exactly 10 stars to the cells with dots, at most one star per cell, so that each cell with a number has exactly that number of stars in its 8 adjacent cells. Moreover, we will only consider such 7 times 7 fields where such allocation of 10 stars exists and is unique.
Can you create a testcase for this problem that will kill backtracking solutions? It seems pretty hard to do at such small field, but it is possible!
Here are the official rules of this challenge: http://killbacktrack.appspot.com/rules.jsp.
And here's the website where you can test your testcases, which also keeps a scoreboard: http://killbacktrack.appspot.com/.
I've got a pretty good testcase, but I don't want to reveal it yet :) Please tell if there's some problem or possible improvement to the website.
Can you create a testcase for this problem that will kill backtracking solutions? It seems pretty hard to do at such small field, but it is possible!
Here are the official rules of this challenge: http://killbacktrack.appspot.com/rules.jsp.
And here's the website where you can test your testcases, which also keeps a scoreboard: http://killbacktrack.appspot.com/.
I've got a pretty good testcase, but I don't want to reveal it yet :) Please tell if there's some problem or possible improvement to the website.
You can find my impressions about beta round 2 in my blog: http://petr-mitrichev.blogspot.com/2010/02/codeforces.html
Codeforces (c) Copyright 2010-2021 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/23/2021 20:22:27 (j2).
Desktop version, switch to mobile version.
Supported by
