Prime Time（打表高精度）

Euler is a well-known matematician, and, among many other things, he discovered that the formula
n
2 + n + 41 produces a prime for 0 ≤ n < 40. For n = 40, the formula produces 1681, which is 41 ∗ 41.
Even though this formula doesn’t always produce a prime, it still produces a lot of primes. It’s known
that for n ≤ 10000000, there are 47,5% of primes produced by the formula!
So, you’ll write a program that will output how many primes does the formula output for a certain
interval.
Input
Each line of input will be given two positive integer a and b such that 0 ≤ a ≤ b ≤ 10000. You must
read until the end of the file.
Output
For each pair a, b read, you must output the percentage of prime numbers produced by the formula in
this interval (a ≤ n ≤ b) rounded to two decimal digits.
Sample Input
0 39
0 40
39 40
Sample Output
100.00
97.56
50.00
问通过 公式 n*n+n+41，区间 n内的素数占据的比例；

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int a[10010];
int judge(int x)
{for(int i=2;i*i<=x;i++)
if(x%i==0)
return 0;
return 1;
}
void init()
{a[0]=0;
for(int i=0;i<=10005;i++)
{if(judge(i*i+i+41)==1)
a[i+1]=a[i]+1;
else
a[i+1]=a[i];
}
}
int main()
{
int c,b;
init();
while(~scanf("%d%d",&c,&b))
{float p=(float)(a[b+1]-a[c])/(float)(b-c+1)*100.0;
printf("%.2f\n",p+0.0000001);
}
}

至于为什么是高精度，我还不会知道，知道了再写吧。