LEGRENDS - Legendre symbol
Given 2 integers a and p (1 ≤ a, p ≤ 1000000, p is prime) calculate the Legendre symbol (a/p).
Input
In the first line the number of test cases t < 100000. Then t lines with the 2 integers a and p.
Output
t lines with the Legendre symbol (a/p).
Example
Input: 4
2 7
5 7
14 7
3 2 Output: 1
-1
0
1
hide comments
Michael T:
2011-07-23 10:27:23
@HWK: It definitely does. Problem is en.wiki states: "let p be an odd prime number" in definition. So maybe you should have used mathworld instead. Where p-odd-prime is only an "if". Last edit: 2011-07-21 10:15:58 |
|
HWK:
2011-07-23 10:27:23
For the participants which understand German: http://de.wikipedia.org/wiki/Legendre-Symbol
|
|
Hagen von Eitzen:
2011-07-23 10:27:23
In the wikipedia article the problem links to, the Legendre symbol is *explicitly* not defined for p=2.
|
|
Noszály Csaba:
2011-07-23 10:27:23
i don't know that my solution fails only on p=2 or not, but i am curious what is the definition of (a/2), considering that
|
|
HWK:
2011-07-23 10:27:23
@anubhav gupta: Rethink your calculation for the even prime. ;-) Last edit: 2011-07-14 19:58:35 |
|
anubhav gupta:
2011-07-23 10:27:23
@HWK for even prime if have calculated the value but still wa |
|
HWK:
2011-07-23 10:27:23
@anubhav gupta: Think of an even prime. ;-) |
|
anubhav gupta:
2011-07-23 10:27:23
@HWK can u check soution id 5377398. its giving wa. can u tel me why?? |
|
shinoda:
2011-07-23 10:27:23
@HWK why i'm getting WA?? i've tested some test cases and is working fine... can you see my last submissions?
|
|
HWK:
2011-07-23 10:27:23
@Problem Solver: Thank you. :-)
|
Added by: | HWK |
Date: | 2011-07-11 |
Time limit: | 3.049s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |