As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
This problem might be well-known in some countries, but how do other countries learn about such problems if nobody poses them?
设 $p$ 为一个奇素数。计算区间 $[l, r]$ 中二次剩余的个数。
$x$ 是 $p$ 的二次剩余，当且仅当 $x^{(p-1)/2} \equiv 1 \pmod p$。
第一行包含 $p, l, r$ ($3 \le p \le 10^{11}, 1 \le l \le r < p$)。保证 $p$ 是一个奇素数。
一个整数，即答案。
11 3 8
3
998244353 11451400 919810000
454174074
96311898227 25437319919 55129361817
14846091352
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: