Integration

 https://ac.nowcoder.com/acm/contest/881/B

思路：ci就是把x^2=-a[i]^2化简

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;

#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e3+9;
const int mod=1e9+7;


ll a[maxn];
ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}
int main()
{
    FAST_IO;

    int n;
    while(cin>>n)
    {
        for(int i=1;i<=n;i++) cin>>a[i];
        ll ans=0;
        for(int i=1;i<=n;i++)
        {
            ll tmp=1;
            for(int j=1;j<=n;j++)
            {
                if(i==j) continue;
                tmp=(tmp*((a[j]*a[j]%mod-a[i]*a[i]%mod+mod)%mod))%mod;
            }
            ans=(ans+(power(a[i]*2,mod-2)*power(tmp,mod-2))%mod)%mod;
        }
        cout<<ans<<endl;
    }
    return 0;
}