在下面的程序中用c++获取SIGABRT

我在spoj中提交了这个问题，这显示了runtime error(SIGABRT)。它在我的机器和Ideone.com上运行正常，但显示错误。有什么原因吗？我在这里写代码：我想做的是计算10^8阶素数，并对其进行一些运算。以下是问题链接：http://www.spoj.com/problems/CPRIME

#include<iostream>
#include<vector>
#include<cmath>
#include<cstdio>
using namespace std;
int n=100000001;
int d = 10001;//3163;
vector<int>num(100000001,0);
int main (){
    //atkin's seive for generating prime numbers of order 10^8
for (int x = 1; x <= d; x++){
        for (int y = 1; y <= d; y++){
            long long sqx=x*x,sqy=y*y;
            long long m =(3*sqx)-sqy;
             //m=m-sqx;
             if(m<n){
                 if(x>y&&m%12==11)num[m]=num[m]^1;
                 m=m+2*sqy;
                 if(m<n){
                    if(m%12==7)num[m]=num[m]^1;
                    m=m+sqx;
                    if(m<n&&(m%12==1||m%12==5))num[m]=num[m]^1;
                    }
                 }
            }
    }
   for (int i=5;i<d;i++){
       if(num[i]){
           for(int j=i*i;j<n;j+=i*i)num[j]=0;
       }
   }   //sieve finished here
    //main code start from here and for loop is for counting number of primes
    //less than or equal to that number.
    int add=2;
    num[2]=1;num[3]=2;
  for(int a=4;a<n;a++){
      if(num[a]){
          //if(a==2||a==3||a==5)cout<<num[a]<<" "<<a<<" ";
          add++;
          num[a]=add;
      }
      else num[a]=add;
  }
  //cout<<num[2]<<" "<<num[3]<<endl;
  while(1){
      int t;
      scanf("%d",&t);
      if(t==0)break;
      double ans=(num[t]-t*1.0/(log(t)))*100.0/num[t];
      if(ans<0)ans*=-1.0;
      printf("%.1lfn",ans);
  }
  return 0;

}