Double Squares（Python版）

Description:

A double-square number is an integer X which can be expressed as the sum of two perfect squares. For example, 10 is a double-square because 10 = 3^2 + 1^2. Your task in this problem is, given X, determine the number of ways in which it can be written as the sum of two squares. For example, 10 can only be written as 3^2 + 1^2 (we don't count 1^2 + 3^2 as being different). On the other hand, 25 can be written as 5^2 + 0^2 or as 4^2 + 3^2. 
NOTE: Do NOT attempt a brute force approach. It will not work. The following constraints hold: 
0 <= X <= 2147483647
1 <= N <= 100

Input sample:

You should first read an integer N, the number of test cases. The next N lines will contain N values of X.

5
10
25
3
0
1

Output sample:

e.g.

1
2
0
1
1

解题方案：

import sys

if __name__ == "__main__":
        argv = sys.argv
        inf = open(argv[1],'r')
        line = inf.readline()
        while True:
                line = inf.readline()
                if len(line) == 0:
                        break
                N = int(line)
                if N == 0:
                        print 1
                        continue
                #print N
                dic = {}
                n = int(N**0.5) + 1
                r = 0
                for i in range(0,n):
                        p = N - i**2
                        pp = p ** 0.5
                        #print i,pp
                        if pp == int(pp):
                                #print i,pp
                                r += 1
                r /= 2
                print r