题目地址:http://poj.org/problem?id=1305
#include <iostream>
#include <string>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
#define INF 0x3ffffffffLL
#define MAX(a,b) a>b?a:b
#define MIN(a,b) a>b?b:a
#define N 1000005
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} //欧几里得
int flag[N];
void solve(ll t)
{
ll x,y,z,i,j,k;
memset(flag,0,sizeof(flag));
ll ans0=0,ans1=0;
ll temp=sqrt(t+0.5);
for(ll i=1;i<=temp;i++)
for(j=i+1;j<=temp;j++)
{
if(i*i+j*j>t) break;
if(((i&1)==(j&1))||gcd(j,i)!=1) continue;
x=j*j-i*i;//先构造出本原解,然后进行倍数标记
y=i*j*2;
z=j*j+i*i;
ans0++;
for(k=1;;k++)
{
if(k*z>t) break;
flag[k*x]=1;
flag[k*y]=1;
flag[k*z]=1;
}
}
for(i=1;i<=t;i++)
if(!flag[i]) ans1++;
cout<<ans0<<" "<<ans1<<endl;
}
int main()
{
ll n;
while(cin>>n)
{
solve(n);
}
return 0;
}