题目链接:点击这里
题目大意:
给定
n
n
n 个正整数
a
i
a_i
ai ,求它们在模
p
p
p 意义下的下式:
∑
i
=
1
n
k
i
a
i
\sum_{i=1}^n\frac{k^i}{a_i}
i=1∑naiki
题目分析:
本题主要问题是如何线性处理出
a
i
{a_i}
ai 的逆元,我们令:
s
i
=
∏
k
=
1
i
a
k
s_i=\prod_{k=1}^ia_k
si=k=1∏iak
即
s
i
s_i
si 满足:
s
i
=
s
i
−
1
a
i
s_i=s_{i-1}a_i
si=si−1ai
取倒数有:
1
s
i
=
1
s
i
−
1
1
a
i
\frac 1 {s_i}=\frac1{s_{i-1}}\frac1{a_i}
si1=si−11ai1
即:
1
a
i
=
s
i
−
1
1
s
i
\frac1{a_i}=s_{i-1}\frac 1{s_i}
ai1=si−1si1
有了此式我们就可以通过
s
i
=
s
i
−
1
a
i
s_i=s_{i-1}a_i
si=si−1ai 递推出
s
i
s_i
si 然后用费马小定理求出
s
i
s_i
si 的逆再倒着推出其所有的逆
具体细节见代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<stack>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
ll read()
{
ll res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 5e6+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
const int base = 131;
ll n,p,k,a[maxn],s[maxn],invs[maxn];
ll qpow(ll a,ll b,ll mod)
{
ll res = 1;
while(b)
{
if(b&1) res = res*a%mod;
a = a*a%mod;
b >>= 1;
}
return res;
}
int main()
{
n = read(),p = read(),k = read();
s[0] = 1;
for(int i = 1;i <= n;i++)
{
a[i] = read();
s[i] = s[i-1]*a[i]%p;
}
invs[n] = qpow(s[n],p-2,p);
for(int i = n;i;i--)
{
invs[i-1] = invs[i]*a[i]%p;
}
ll base = 1,ans = 0;
for(int i = 1;i <= n;i++)
{
base = base*k%p;
ans = (ans+base*s[i-1]%p*invs[i]%p)%p;
}
printf("%lld\n",ans);
return 0;
}