→ Pay attention
Before contest
Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round)
21:40:27
Register now »
Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round)
21:40:27
Register now »
*has extra registration
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | -is-this-fft- | 162 |
| 3 | maomao90 | 159 |
| 3 | atcoder_official | 159 |
| 5 | cry | 158 |
| 5 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/05/2024 11:24:34 (k3).
Desktop version, switch to mobile version.
Supported by
I'm curious. I've never seen using monte carlo for exact problems. Can it applicable for what kind of problems? In contests, is it common that solvable with monte carlo?
FYI: an example.
Codeforces Round #213 (Div. 1) — Problem D
http://codeforces.net/contest/364/problem/D