UVA 106 Fermat vs. Pythagoras

#include <map>
#include <set>
#include <list>
#include <math.h>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b == 0 ? b : gcd(b, a % b);}
//毕达哥拉斯数
#define MAXN 1000001
bool vis[MAXN];
int main()
{
int N,limit,x,y;
while (scanf("%d",&N)!=EOF)
{
memset(vis,false,sizeof(vis));
limit=floor(sqrt(N));
int total=0;
for (int i=1;i<limit;i++)
for (int j=i+1;j<=limit;j+=2)
{
if (gcd(i,j)==1 && i*i+j*j<=N)
{
x=j*j-i*i;
y=2*i*j;
total++;
int z=i*i+j*j;
for (int st=1;z*st<=N;st++)
vis[st*x]=vis[st*y]=vis[st*z]=true;
}
}
int cnt=0;
for (int i=1;i<=N;i++) if (!vis[i]) cnt++;
printf("%d %d\n",total,cnt);
}
return 0;
}