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
##题解：给a，b两个数求他们之间的数带入i*i+i+41的公式中得到的新数是否是素数，然后统计素数占的百分比，由于自接求是否是素数部分数据太大会超，所以把1到10005打表，若带入公式得到的数是素数则把带入前的数字标记为1,。
代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
int book[11000];
void ff()
{
	int m,i,k,j;
	for(i=0; i<=10005; i++)
	{
		k=0;
		m=i*i+i+41;
		for(j=2;j<=sqrt(m);j++)
		{
			if(m%j==0)
			{
				k=1;
				break;
			}
		}
		if(k==0)
		book[i]=1;
	}
	for(i=0; i<=10005; i++)
		book[i+1]=book[i]+book[i+1];
}
int main()
{
	int a,b,i;
	memset(book,0,sizeof(book));
	ff();
	double n;
	while(~scanf("%d%d",&a,&b))
	{
//		memset(book,0,sizeof(book));
		n=book[b]-book[a-1];
		printf("%.2f\n",n/(b-a+1)*100.0+1e-8);
	}
	return 0;
}