uva 10200 Prime Time

水题，不过有坑，在输出答案的时候加个1e-5就过了，不加就是wa

#include <iostream>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <cstdio>
using namespace std;
typedef long long ll;

const int MAXN = 10010;
bool book[MAXN];
int sum[MAXN];

bool isPrime(ll n)
{
    ll num = n*n+n+41;
    for(ll i = 2; i*i <= num; ++i)
    {
        if(num%i == 0)
            return false;
    }
    return true;
}

void init()
{
    memset(book,false,sizeof(book));
    for(int i = 0; i <= 10000; ++i)
    {
        if(isPrime(i))
            book[i] = true;
        sum[i+1] = sum[i]+book[i];
    }
}

int main()
{
    init();
    int a,b;
    while(scanf("%d %d",&a,&b) != EOF)
    {
        double res = (double)(sum[b+1]-sum[a])/(double)(b-a+1);
        cout << fixed << setprecision(2) << res*100.0+1e-5 << endl;
    }
    return 0;
}