English version
Find all prime numbers between N and M, with 0 < N < M < 1025.
A further classification said that the time limit is 1 second and M - N < 109.
I'm wondering if there is a solution for this problem.
# | 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 | 153 |
10 | maroonrk | 152 |
A hard problem from Vietnam Olympiad in Informatics for 9-grader
English version
Find all prime numbers between N and M, with 0 < N < M < 1025.
A further classification said that the time limit is 1 second and M - N < 109.
I'm wondering if there is a solution for this problem.
Name |
---|