can anyone tell why i am getting TLE in question this question 1804C - Вращайте барабан!
my code:197184238
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 151 |
9 | maroonrk | 151 |
can anyone tell why i am getting TLE in question this question 1804C - Вращайте барабан!
my code:197184238
Name |
---|
The loop
for(int a=1;a<=p;a++)
is doingp
iterations in the worst case. Asp
can be up to $$$10^9$$$ and there can be up to $$$10^4$$$ testcases, the loop will do $$$10^{13}$$$ operations in the worst case. As a rough estimate, anything above $$$10^9$$$ will never fit in a time limit of 1 second. This will clearly TLE.In case of recursion?
I don't understand what you are trying to say. If you did this with recursion, it wouldn't be any faster without extra optimizations (which you could implement in the current approach as well).