poj 1305

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <iostream>
 4 #include <stack>
 5 #include <queue>
 6 #include <map>
 7 #include <algorithm>
 8 #include <vector>
 9 #include <cmath>
10 
11 using namespace std;
12 
13 const int maxn = 1000001;
14 
15 typedef long long LL;
16 
17 bool flag[maxn];
18 
19 int gcd(int a,int b)
20 {
21     if(b == 0) return a;
22     else return gcd(b,a%b);
23 }
24 void solve(int t)
25 {
26     int temp,m,i,j,k,n,ans1,ans2,x,y,z;
27     memset(flag,0,sizeof(flag));
28     temp = sqrt(t+0.0);
29     ans1 = ans2 = 0;
30     for( i=1;i<=temp;i++){
31         for(j = i+1;j<=temp;j++){
32             if(i*i + j*j > t) break;
33             if((i%2) != (j%2)){
34                 if(gcd(i,j) == 1){
35                     x = j*j - i*i;
36                     y = 2*i*j;
37                     z = j*j + i*i;
38                     ans1++;
39                     for( k=1;;k++){
40                         if( k*z > t) break;
41                         flag[k*x] = 1;
42                         flag[k*y] = 1;
43                         flag[k*z] = 1;
44                     }
45                 }
46             }
47         }
48     }
49     for(int i=1;i<=t;i++){
50         if(!flag[i]) ans2++;
51     }
52     printf("%d %d\n",ans1,ans2);
53 }
54 int main()
55 {
56     int n;
57     while(scanf("%d",&n)!=EOF){
58         solve(n);
59     }
60     return 0;
61 }