bzoj1041: [HAOI2008]圆上的整点

设a=m^2-n^2,b=2*m*n,c=m^2+n^2,则已经满足a^2+b^2=c^2,枚举m，n（m>n），只统计一个象限的答案，最后答案乘以4

LL r, n, m;
typedef pair<int, int> II;
set<II> S;

inline void Cal(int d) {
	LL r = ::r / d;
	for(n = 1, m = 1; sqr(m) < r; m++);
	while(n < m) {
		while(n < m && sqr(n) + sqr(m) > r) m--;
		if(n >= m) break;
		if(sqr(n) + sqr(m) == r) {
			int a = sqr(m) - sqr(n), b = 2 * m * n;
			S.insert(II(a * d, b * d)), S.insert(II(b * d, a * d));
		}
		n++;
	}
}
inline void Solve() {
	cin >> r;
	int d;
	for(d = 1; sqr(d) < r; d++)
		if(r % d == 0) Cal(r / d), Cal(d);
	if(sqr(d) == r) Cal(d);
	cout << S.size() * 4 + 4 << endl;
}

int main() {
	Solve();
	return 0;
}