Question here:
https://atcoder.jp/contests/abc239/tasks/abc239_d
The question for the limits is brute but what is the approach if all a,b,c,d can be upto 10**5. I could not figure anything out on that case. Please help me
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
Question here:
https://atcoder.jp/contests/abc239/tasks/abc239_d
The question for the limits is brute but what is the approach if all a,b,c,d can be upto 10**5. I could not figure anything out on that case. Please help me
Name |
---|
The maximal prime gap upto $$$2\times 10^5$$$ is about $$$100$$$. So if $$$D-C$$$ is greater than this gap, the second player wins. Otherwise brute force to find the answer.
thats genius. Thank you