2019年牛客多校第一场B题 Integration

思路：将进行裂项化简得：  

由于则原式等于 

求解该式即可

#include<iostream>
#include<cstdio>
#define ll long long
#define mod 1000000007
using namespace std;
ll n,a[1008611],num[1008611];
long long fast_mod(long long a,long long b) {
    long long r = 1;
    a %= mod;
    while (b) {
        if (b & 1) r = (r*a) % mod;
        a = (a*a) % mod;
        b >>= 1;
    }
    return r;
}
ll ans=0;
int main(){
    while(~scanf("%lld",&n)){
        ans=0;
        for(ll i=1;i<=n;i++){
            cin>>a[i];
        }
        for(ll i=1;i<=n;i++){
            num[i]=1;
            for(ll j=1;j<=n;j++){
                if(i!=j)
                num[i]=(num[i]*(((a[j]*a[j])%mod-(a[i]*a[i])%mod)+mod)%mod)%mod;
            }
            num[i]=(((2*a[i])%mod)*num[i])%mod;
            num[i]=fast_mod(num[i], mod-2);
            ans=((ans+num[i])%mod+mod)%mod;
        }
        cout<<ans<<endl;
    }
    return 0;
}