Something like Div 2. A or B. Sometimes they can be fun to solve :P
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Something like Div 2. A or B. Sometimes they can be fun to solve :P
Название |
---|
From recent contests I've liked this. =)
I think this is a good one :D
My favourite: you need to make the correct romanian equation, and you can transport only one stick, e.g.:
III+II=III
→III+I=IIII
.Is "IIII" a valid roman number though? Shouldn't it be IV? :D
And also Roman equation, not Romanian equation :)
You better take me a link to this problem, which I can't find :P . There will be more explained and some restrictions declared; And about Roman numbers — I don't know, but one day I have read about Roman numerals in here in project Euler, and IIII seems to be valid, although not the shortest.
fun to solve !
man, people like me struggle to solve them (:`|)
CEOI 2007 — Ministry
ioi 2013-WOMBATS is good one :)
Even though you're probably joking with it, it's actually a pretty sweet problem! If you check out the solution it ain't that bad and combines some awesome techniques :P
That's the best problem I've ever seen :p
My favorite is Hexadecimal's theorem. I think it's the easiest problem in CF. And problem setter wrote a hint in the problem statement and I quote:
(Which means there is always an answer to each test!)
Interesting fact about this problem is you can solve it with 13 characters (including spaces) in some languages like Ruby. And still there are a lot of users who solve it with complex solution while it has a straight-forward solution :D