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
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
5 | atcoder_official | 148 |
8 | Petr | 146 |
9 | nor | 144 |
10 | TheScrasse | 143 |
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!
Name |
---|