CodeForces 621C Wet Shark and Flowers

C. Wet Shark and Flowers

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 .

Examples

input

3 2
1 2
420 421
420420 420421

output

4500.0

input

3 5
1 4
2 3
11 14

output

0.0

题目大意：有N只鲨鱼，第I只鲨鱼与第i + 1条鲨鱼是邻居，第N条鲨鱼和第一条鲨鱼也是邻居。现在他们开始种花，第i条鲨鱼种花的数量为区间[li,ri]内任意的一个整数，给出一个素数P，如果为邻居的两条鲨鱼种花数目的乘积是P的倍数，那么这两条鲨鱼都会得到1000。给出鲨鱼数量，素数P，每条鲨鱼种花数量的区间，求每条鲨鱼获得金钱的期望。

解题思路：先计算出每条鲨鱼种花区间中P倍数的个数和区间内整数的个数，然后计算互为邻居的两条鲨鱼能够获得金钱的情况总数，用这个数除以互为邻居的两条鲨鱼种花的所有情况，再乘以2000，将结果相加即可。

代码如下：

#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

typedef long long LL;

const int maxn = 100005;

LL num[maxn],len[maxn];

int main()
{
    int n,p,l,r;
    scanf("%d %d",&n,&p);
    for(int i = 0;i < n;i++){
        scanf("%d %d",&l,&r);
        num[i] = r / p - (l - 1) / p;//求出区间[l,r]中p的倍数的个数
        len[i] = r - l + 1;//区间[l,r]内有多少数
    }
    double ans = 0;
    LL sum = 0;
    for(int i = 0;i < n;i++){
        int a = i,b = (i + 1) % n;
        sum = num[a] *len[b] + num[a] * len[b] - num[a] * num[b];
        ans += sum * 2000.0 / (len[a] * len[b]);
    }
    printf("%f\n",ans);
    return 0;
}