| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Codeforces Round 313 Problem A: Currency System in Geraldion
How to solve if we rephrase the problem statement to find " Minimum unfortunate sum that is greater than 1 "?
If the input notes denomination includes "1", obviously there won't be any "unfortunate sum".
Are you from the future?
What's wrong ?
Wrong round number, Twice
You can make everything with 2 and 3
the answer is that with a banknote of value 1 you can make any sum you want,if you don't have value 1 then this is smallest value that cannot me made.
The problem statement was bad, took me 5 minutes to understand the ubove statement, which is very bad.
I think I didn't figure it out the ultra-simple idea in the contest. So solving it with a normal dp up to 10^7 would solve it. You just search for the first sum in the dp array which is not formed.