http://codeforces.com/contest/621/problem/C:
There are n sharks who grow flowers for Wet Shark. They are all sitting around the table, such that sharks i and i + 1 are neighbours for all i from 1 to n - 1. Sharks n and 1 are neighbours too.
Each shark will grow some number of flowers si. For i-th shark value si is random integer equiprobably chosen in range from li to ri. Wet Shark has it's favourite prime number p, and he really likes it! If for any pair of neighbouring sharks i and j the product si·sj is divisible by p, then Wet Shark becomes happy and gives 1000 dollars to each of these sharks.
At the end of the day sharks sum all the money Wet Shark granted to them. Find the expectation of this value.
The first line of the input contains two space-separated integers n and p (3 ≤ n ≤ 100 000, 2 ≤ p ≤ 109) — the number of sharks and Wet Shark's favourite prime number. It is guaranteed that p is prime.
The i-th of the following n lines contains information about i-th shark — two space-separated integers li and ri (1 ≤ li ≤ ri ≤ 109), the range of flowers shark i can produce. Remember that si is chosen equiprobably among all integers from li to ri, inclusive.
Print a single real number — the expected number of dollars that the sharks receive in total. You answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if .
3 2 1 2 420 421 420420 420421
4500.0
3 5 1 4 2 3 11 14
0.0
蛙泳50米纪念= =
第一次做数学期望:
#include<cstdio>
using namespace std;
double p[100000];
int main()
{
int n,prime,l,r;
double res=0;
scanf("%d%d",&n,&prime);
for(int i=0;i<n;i++){
scanf("%d%d",&l,&r);
int tmp;
tmp=r/prime-l/prime;//tmp是l和r之间可以被tmp整除的数的数量
if(l%prime==0)
tmp++;
p[i]=1-(double)(tmp)/(r-l+1);//p[i]是不可以被整除的概率
}
for(int i=0;i<n-1;i++){
res+=(1-p[i]*p[i+1])*2000;
}
res+=(1-p[0]*p[n-1])*2000;
printf("%.6f\n",res);
return 0;
}