FZU 1669 毕达哥拉斯三元组

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>

using namespace std;

int gcd(int a,int b)
{
    return b==0?a:gcd(b,a%b);
}

void solve(int t)
{
    int x,y,z,m,n,ans=0;
    int tmp=sqrt(1.0*t);
    for(n=1;n<=tmp;n++){
        for(m=n+1;m<=tmp;m++){
            if(m*m+n*n>t) break;
            if(m%2!=n%2){
                if(gcd(m,n)==1){
                    x=m*m-n*n;
                    y=2*m*n;
                    z=m*m+n*n;
                    for(int i=1;;i++)
                        if(i*(x+y+z)<=t)
                            ans++;
                        else
                            break;
                }
            }
        }
    }
    cout<<ans<<endl;
}

int main()
{
    int n;
    while(cin>>n)
        solve(n);
    return 0;
}