题目
思路
就这绿题?建议降黄
设
a
n
s
i
ans_i
ansi为答对i题的期望,
p
i
p_i
pi为答对i题的概率。
那么最后的答案
A
n
s
Ans
Ans即为
∑
i
=
1
n
p
i
\sum^{n}_{i=1}p_i
∑i=1npi。
推导过程:
A
n
s
=
∑
i
=
1
n
a
n
s
i
=
∑
i
=
1
n
p
i
Ans= \sum^{n}_{i=1} ans_i=\sum^{n}_{i=1}p_i
Ans=∑i=1nansi=∑i=1npi
code:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
int n,A,B,C;
int a[10000007];
double ans;
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)a[i-1]*A+B)%100000001;
for (int i=1;i<=n;i++) a[i]=a[i]%C+1;
ans+=1.0/(double)max(a[1],a[n]);
for (int i=2;i<=n;i++) ans+=1.0/(double)max(a[i],a[i-1]);
printf("%.3lf",ans);
return 0;
}