Codeforces Round #341 (Div. 2) C. Wet Shark and Flowers（期望）

题意:

$给定N\le 10^5个人围成一个圈, 每个人有一个数据范围[l_i,r_i]$
$每个人选定一个数s, 若相邻的s_i*s_j能被一个素数p整除,每个人得到1000块钱$
$求最后总钱数的期望$

分析:

$考虑每一对相邻pair, 发现他俩拿钱跟别人选择啥数是没有关系的, 也就是每一对相邻pair独立$
$这个题显然不能单独算贡献了,(10^9)^{10^5}=10^{9\times10^5}, long\ double都存不下$
$根据期望的线性性, 我们可以分开算每一对, 然后加起来,即ans=\sum_{i=1}^nE_i$
$对于i,i+1这个pair：$
$被整除的数的个数cnt_i=r_i/p-(l_i-1)/p，len_i=r_i-l_i+1$
$拿钱的选择显然有can_i = cnt_i*len_{i+1}+cnt_{i+1}*len_i-cnt_i*cnt_{i+1}$
$总的选择tot_i=len_i*len_{i+1},拿钱的概率prob_i=can/tot，拿钱的期望E_i=2000*prob_i（2个人都拿钱）$
$问题得以解决$

代码:

//
//  Created by TaoSama on 2016-01-31
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, p, len[N];
typedef pair<int, int> P;
typedef long long LL;
P a[N];

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(scanf("%d%d", &n, &p) == 2) {
        for(int i = 1; i <= n; ++i) {
            scanf("%d%d", &a[i].first, &a[i].second);
            len[i] = (a[i].second - a[i].first + 1);
        }
        a[n + 1] = a[1]; len[n + 1] = len[1];
        double ans = 0;
        for(int i = 1; i <= n; ++i) {
            LL l = a[i].second / p - (a[i].first - 1) / p;
            LL r = a[i + 1].second / p - (a[i + 1].first - 1) / p;
            double tmp = l * len[i + 1] + r * len[i] - l * r;
            ans += tmp / len[i] / len[i + 1];
        }
        printf("%.20f\n", 2000 * ans);
    }
    return 0;
}