ZOJ 3483 简单if-else

提醒：答案要约分，不然会错！

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;
const int MAXSIZE = 2000000;
int prime[MAXSIZE];
void init_prim(){
    for (int i=2;i<MAXSIZE;i++)
        prime[i]=1;
    prime[0]=0; prime[1]=0;
    for (int i=1;i<MAXSIZE;i++){
        if (prime[i]==1)
            for (int j=i*2;j<MAXSIZE;j+=i)
                prime[j]=0;
    }
}
int gcd(int a,int b){
    return b==0 ? a : gcd(b,a%b);
}
int main(){
    int t,i,j,x1,x2,y1,y2;
    int cnt,ans;
    init_prim();
    scanf("%d",&t);
    while(t--){
        cnt = 0;
        ans = 0;
        scanf("%d%d%d%d",&x1,&x2,&y1,&y2);
        for(i=y1;i<=y2;i++){
            for(j=x1;j<=x2;j++){
                if((i == 0 && j != 0) || (i != 0 && j == 0))
                    if((abs(i+j)-3) % 4 == 0 && prime[abs(i+j)])  ans++;
                if(i != 0 && j != 0 && ((i*i + j*j) - 3) % 4 != 0 && prime[i*i + j*j])
                    ans++;
                cnt++;
            }
        }
        //if(ans == 0)    cnt = 1;
        printf("%d/%d
",ans/gcd(ans,cnt),cnt/gcd(ans,cnt));
    }
    return 0;
}