Problem link: https://codeforces.me/contest/1423/problem/K
submission link: https://codeforces.me/contest/1423/submission/97905194
I don't understand why I am getting TLE can anyone help?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Problem link: https://codeforces.me/contest/1423/problem/K
submission link: https://codeforces.me/contest/1423/submission/97905194
I don't understand why I am getting TLE can anyone help?
Название |
---|
Instead of running an upper bound for each case, maybe try keeping an array where a[i] is the number of primes till i.
Ok, get it. Thanks.
Replace cout with printf. std::cout is too slow for printing.
That's a myth. With non-synchronisation with stdio, cout is as fast as printf, if not faster.
First of all,
cout.tie(NULL)
doesn't do anything (literally).Your code gets TLE because
endl
is slow (and unnecessary here).Thank you very much. Now I understand why it was giving TLE. After replacing endl with "\n" now it is giving ac.