№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
Название |
---|
The issue is simply just that java is slower than c++. Without using some advanced factoring methods like pollard-rho, it might be impossible to solve that problem with java.
There's another blog post about Java performance when solving this particular problem: https://mirror.codeforces.com/blog/entry/110593
You can also always go to https://mirror.codeforces.com/contest/1771/status and filter the accepted solutions by the used programming language. You will see that there are some successful Java submissions. So solving it using Java is not impossible in principle.
But yes, Java users are generally at a disadvantage because of their programming language choice. Consider this as an extra challenge or try switching to a different programming language. C++ was always extremely popular in competitive programming. Rust is steadily gaining users too. And there are some other good choices.