Problem link: https://mirror.codeforces.com/contest/1423/problem/K
submission link: https://mirror.codeforces.com/contest/1423/submission/97905194
I don't understand why I am getting TLE can anyone help?
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
29:29:11
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
29:29:11
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 12:05:50 (l2).
Десктопная версия, переключиться на мобильную.
При поддержке
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
endlis 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.