### 1472: The minimum square sum

[状态] [讨论版] [提交] [命题人:]

Given a prime p (p<10^8),you are to find min{x^2+y^2},where x and y belongs to positive integer, so that x^2+y^2=0 (mod p).

Every line is a p. No more than 10001 test cases.

The minimum square sum as described above.

2
3
5


2
18
5