hi. i have got wa 3 in 1790A - Polycarp and the Day of Pi. here is my submission 250262189. what is the problem? i looked at test details but i think my code works efficiently
№ | Пользователь | Рейтинг |
---|---|---|
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 |
hi. i have got wa 3 in 1790A - Polycarp and the Day of Pi. here is my submission 250262189. what is the problem? i looked at test details but i think my code works efficiently
1926C - Vlad and a Sum of Sum of Digits i couldn't find optimal solution in the contest for this problem so after the contest i looked at editorial and it was actually easy. but i tried some submissions and i get TLE 2.
247790985 please look at this submission which i get tle 2
Hello dear Codeforces community. I have a big problem about practicing competitive programming. Can someone advice me an excellent roadmap? Because I often fail doing 1100-1400 skilled problems. Thank you!
Название |
---|