#概率期望# Codeforces Round #341 (Div. 2) C. 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

Note

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个人围成一个圈，每个人在 l[i] 到 r[i] 之间随机出一个数，如果这个数和旁边的人出的数的乘积是p的倍数，则他得到2000奖励，让你求所有人得到的奖励的期望（注意可成环，即第n个人的下一个人为第一个人）。

 

Solution：

经典概率问题。一个区间内能整除k的数有 r/k - (l-1)/k 个，一个区间内一共有 r-l+1 个数，所以一个区间内能整除k的概率为p[i] = (r/k - (l-1)/k) / (r-l+1)，所以说满足条件的概率为 P = p[i] * p[i+1] + p[i] * (1-p[i+1]) + (1-p[i]) * p[i+1]，化简后就是 P = p[i] + p[i+1] - p[i] * p[i+1]，然后累加 P * 2000 即可（保留10位小数）。

 

代码：

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <map>
#define fi first
#define se second
#define rush() int T; scanf("%d", &T); while(T--)
#define _rush() int T; cin >> T; while(T--)
#define mst(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MaxN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const double eps = 1e-9;

double a[MaxN];

int main() 
{
	//std::ios::sync_with_stdio(false);
	//std::cin.tie(0);
	
	int n, p;
	cin >> n >> p;
	for(int i = 1; i <= n; i++) {
		int l, r;
		cin >> l >> r;
		a[i] = (double)(r/p - (l-1)/p) / (r-l+1);
	}
	a[n+1] = a[1];
	double ans = 0;
	for(int i = 1; i <= n; i++)
		ans += (a[i] + a[i+1] - a[i] * a[i+1]) * 2000;
	printf("%.10lf\n", ans);
	return 0;
}