2242. Quadratic Residues

单点时限: 10.0 sec

内存限制: 256 MB

In 1801, Carl Friedrich Gauss (1777-1855) published his “Disquisitiones Arithmeticae”, which basically created modern number theory and is still being sold today. One of the many topics treated in his book was the problem of quadratic residues.

Consider a prime number p and an integer a !≡ 0 (mod p). Then a is called a quadratic residue mod p if there is an integer x such that

x2 ≡ a (mod p),

and a quadratic non residue otherwise. Lagrange (1752-1833) introduced the following notation, called the “Legendre symbol”:

For the calculation of these symbol there are the following rules, valid only for distinct odd prime numbers p, q and integers a, b not divisible by p:

The statements 1. to 3. are obvious from the definition, 4. is called the Completion Theorem, and 5. is the famous Law of Quadratic Reciprocity for which Gauss himself gave no less than six different proofs in the “Disquisitiones Arithmeticae”. Knowing these facts, one can calculate all possible Legendre symbols as in the following example:


The first line contains the number of scenarios.

For each scenario, there is one line containing the integers a and p separated by a single blank, where 2 < p < 10^9 is an odd prime, and a satisfies both a !≡ 0 (mod p) and |a| <= 10^9.


Start the output for every scenario with a line containing “Scenario #i:”, where i is the number of the scenario starting at 1. Then print a single line containing (a/p), followed by a blank line.


29 79
2 29
1 3
Scenario #1:
Scenario #2:
Scenario #3:

5 人解决,8 人已尝试。

5 份提交通过,共有 32 份提交。

7.7 EMB 奖励。

创建: 15 年,10 月前.

修改: 6 年,8 月前.

最后提交: 10 年,6 月前.

来源: TUD Programming Contest 2003, Darmstadt, Germany