Hi guys. I started practicing CSES problemset but I am stuck in the problem below.
https://cses.fi/problemset/task/1082
How to deal with cases like n>10e6?
No need for a straight up answer just a hint
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | atcoder_official | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
Need a help for a question
Hi guys. I started practicing CSES problemset but I am stuck in the problem below.
https://cses.fi/problemset/task/1082
How to deal with cases like n>10e6?
No need for a straight up answer just a hint
Name |
---|