621C. Wet Shark and Flowers【概率】

题目链接

http://codeforces.com/problemset/problem/621/C

思路

设$f_i\in [l_i,r_i]$,$f_j\in [l_j,r_j]$,$j=i+1$,如果$f_i\times f_j$不能被$p$整除,那么因为$p$是素数,则$f_i$和$f_j$都不能被$p$整除.
$[1,x]$范围内能被$p$整除的整数个数是$\frac x p$,故$[l_i,r_i]$内能被$p$整除的整数个数为$a_i=\frac {r_i} p-\frac {l_i-1} p$,不能被$p$整除的个数$b_i=\frac {r_i-l_i+1-a_i} {r_i-l_i+1}$.
最后求$\sum^{n}_{i=1}({1-b_i\times b_{i+1}})\times 2000$即可(注意$i=n$时取$i+1=1$).

AC代码

#include <iostream>
#include <cstdio>
using namespace std;

int l[100000+100],r[100000+100];
int main()
{
    int n,p;
    scanf("%d%d",&n,&p);
    for(int i=1 ; i<=n ; ++i)
    {
        scanf("%d%d",&l[i],&r[i]);
    }
    double sum=0;
    for(int i=1 ; i<=n ; ++i)
    {
        int j=i+1;
        if(i==n)
            j=1;
        int ai=r[i]/p-(l[i]-1)/p,aj=r[j]/p-(l[j]-1)/p;
        sum+=(1-(double)(r[i]-l[i]+1-ai)/(r[i]-l[i]+1)
               *(double)(r[j]-l[j]+1-aj)/(r[j]-l[j]+1))*2000;
    }
    printf("%.10f\n",sum);
    return 0;
}