题目
https://www.luogu.org/problemnew/show/P1297
思路
不难啊,很明显,这道题正确的期望是1/max(a[i],a[i-1])
因为正确的答案在这两个集合的∩中,交集其实就是min(a[i],a[i-1]),而他选择的范围是a[i],所以答案是sigma(1/max(a[i],a[i-1]))
代码
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,A,B,C,a[10000005];
double ass=0;
int main()
{
scanf("%d%d%d%d%d",&n,&A,&B,&C,a+1);
for (int i=2;i<=n;i++)
a[i] =(long long) ((long long)a[i-1] * A + B) % 100000001;
for (int i=1;i<=n;i++)
a[i] =(long long) a[i] % C + 1;
if(n==1)
{
printf("1.000"); return 0;
}
a[n+1]=a[1];
for(int i=2; i<=n+1; i++)
{
ass+=(double)1/max(a[i],a[i-1]);
}
printf("%.3lf",ass);
}