文章标题HDU 4355：codeforces 621C：Wet Shark and Flowers（水）

Wet Shark and Flowers

Description

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.

Input

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.

Output

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 .

Sample Input

Input
3 2
1 2
420 421
420420 420421

Output
4500.0

Input
3 5
1 4
2 3
11 14

Output
0.0

Hint

A prime number is a positive integer number that is divisible only by 1 and itself. 1 is not considered to be prime.

Consider the first sample. First shark grows some number of flowers from 1 to 2, second sharks grows from 420 to 421 flowers and third from 420420 to 420421. There are eight cases for the quantities of flowers (s0, s1, s2) each shark grows:
1.(1, 420, 420420): note that s0·s1 = 420, s1·s2 = 176576400, and s2·s0 = 420420. For each pair, 1000 dollars will be awarded to each shark. Therefore, each shark will be awarded 2000 dollars, for a total of 6000 dollars.
2.(1, 420, 420421): now, the product s2·s0 is not divisible by 2. Therefore, sharks s0 and s2 will receive 1000 dollars, while shark s1 will receive 2000. The total is 4000.
3.(1, 421, 420420): total is 4000
4.(1, 421, 420421): total is 0.
5.(2, 420, 420420): total is 6000.
6.(2, 420, 420421): total is 6000.
7.(2, 421, 420420): total is 6000.
8.(2, 421, 420421): total is 4000.

The expected value is .

In the second sample, no combination of quantities will garner the sharks any money.

题意：有n只鲨鱼会，围成一个圈坐着，每只鲨鱼拥有x朵鲜花，鲜花在区间 [L,R] 之间（每个数字概率相等），如果相邻两只鲨鱼的鲜花乘积能整除素数 p ，这两只鲨鱼就能获得1000，现在求能获得的最大奖金。
分析：首先可先求出每只鲨鱼能拥有整除 p 的鲜花的概率，即先用 t=（R/p-(L-1)p) 求出数的个数，然后求出概率 F= t /(R-L+1);然后求相邻的区间能整除 p 的期望即 x+y-x*y (x,y为两区间的概率）；
最后将期望加起来乘以2000即可。
代码：

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<math.h>
#include<queue> 
#include<algorithm>
using namespace std;
int n,p;
struct shark{
    int left,right;
}; 
shark a[100005];
double f[100005];
int main ()
{
    while (scanf ("%d%d",&n,&p)!=EOF){
        memset (f,0,sizeof (f));
        for (int i=0;i<n;i++){
            scanf ("%d%d",&a[i].left ,&a[i].right);
        }
        for (int i=0;i<n;i++){//每个区间中能除 p 的概率 
            int temp1=a[i].right/p - (a[i].left-1)/p;
            int temp2=a[i].right - a[i].left + 1;
            f[i]=((double)temp1/(double)temp2);
        }
        double sum=0;
        for (int i=0;i<n-1;i++){
            double temp;
            temp=f[i]+f[i+1]-f[i]*f[i+1];
            sum+=temp*2000;
        } 
        double t;
        if (n>2){
            t=f[n-1]+f[0]-f[n-1]*f[0];
            sum+=t*2000;
        }

        printf ("%f\n",sum); 
    }
    return 0;
}

注意：题干说的保留6位小数，不要被样例的一位小数给骗了。。。