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
求输入所给范围内的数经过题目要求的变化后的数的素数百分比.
#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
int hh[10010]= {1};//素数打表
void dabiao()
{
for(int i=1; i<10010; i++)
{
int flag=0;
int t=i*i+i+41;
for(int j=2; j<=sqrt(t); j++)
{
if(t%j0)
{
flag=1;
}
}
if(flag0)
hh[i]=1;
}
for(int i=0; i<=10000; i++)
{
hh[i]=hh[i]+hh[i-1];
}
}
int main()
{
int a,b;
dabiao();
while(scanf("%d%d",&a,&b)!=EOF)
{
double x=hh[b]-hh[a-1];
printf("%.2lf\n",x/(b-a+1)*100.0+1e-8);//精度问题，需要注意！
}
return 0;
}