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 | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
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