2019牛客暑期多校训练营（第一场） B.Integration

B Integration

Problem Description

链接：https://ac.nowcoder.com/acm/contest/881/B
来源：牛客网
Bobo knows that $${\int }_0^{\infty }\frac{1}{1+x^2}\mathrm{d}x=\frac{\pi }{2}$$Given $n$ distinct positive integers $a_1,a_2,\dots ,a_n$, find the value of $$\frac{1}{\pi }{\int }_0^{\infty }\frac{1}{{\prod }_{i=1}^n(a_i^2+x^2)}\mathrm{d}x$$It can be proved that the value is a rational number $\frac{p}{q}$.
Print the result as $(p\cdot q^{-1})\mathrm{m}\mathrm{o}\mathrm{d}(10^9+7)$.

Input

The input consists of several test cases and is terminated by end-of-file.
The first line of each test case contains an integer $n$.
The second line contains $n$ integers $a_1,a_2,\dots ,a_n$.

• $1\le n\le 10^3$.
• $1\le a_i\le 10^9$.
• { a 1 , a 2 , … , a n } \{a_1, a_2, \dots, a_n\} {a1​,a2​,…,an​} are distinct.
• The sum of $n^2$ does not exceed $10^7$.

Output

For each test case, print an integer which denotes the result.

Sample Input

1
1
1
2
2
1 2

Sample Output

500000004
250000002
83333334

题意

已知公式$${\int }_0^{\infty }\frac{1}{1+x^2}\mathrm{d}x=\frac{\pi }{2}$$现有$n$个不同数数$a_i$，求$(p\cdot q^{-1})\mathrm{m}\mathrm{o}\mathrm{d}(10^9+7)$的值，其中$$\frac{1}{\pi }{\int }_0^{\infty }\frac{1}{{\prod }_{i=1}^n(a_i^2+x^2)}\mathrm{d}x=\frac{p}{q}$$

思路

捂脸，居然没有想到是裂项。以下为推导过程：
由于定积分具有性质${\int }_a^b[f(x)\pm g(x)]\mathrm{d}x={\int }_a^{b}f(x)\mathrm{d}x\pm {\int }_a^{b}g(x)\mathrm{d}x$
所以我们假设
$$\frac{1}{{\prod }_{i=1}^n(a_i^2+x^2)}=\sum _{i=1}^n\frac{c_i}{(a_i^2+x^2)}$$
将其约分得到
$$\sum _{i=1}^n\frac{c_i}{(a_i^2+x^2)}=\frac{{\sum }_{i=1}^n(c_i\ast {\prod }_{j=1,j不等于i}^n(a_j^2+x^2))}{{\prod }_{i=1}^n(a_i^2+x^2)}$$
$$⟹\frac{1}{{\prod }_{i=1}^n(a_i^2+x^2)}=\frac{{\sum }_{i=1}^n(c_i\ast {\prod }_{j=1,j不等于i}^n(a_j^2+x^2))}{{\prod }_{i=1}^n(a_i^2+x^2)}$$
$$⟹\sum _{i=1}^n(c_i\ast \prod _{j=1,j不等于i}^n(a_j^2+x^2))=1$$
可以利用$n$次上述公式，每一次令$x^2=-a_i^2$，就可以得到（因为除去第i项，其他的$n-1$项中的$(a_j^2+x^2)$必定有一项为$(a_i^2-a_i^2)=0$，所以其他$n-1$项均可消去）
$$c_i\ast \prod _{j=1,j不等于i}^n(a_j^2-a_i^2)=1$$
$$⟹c_i=\frac{1}{{\prod }_{j=1,j不等于i}^n(a_j^2-a_i^2)}$$
所以得出
$$原式=\frac{1}{\pi }{\int }_0^{\infty }\frac{1}{{\prod }_{i=1}^n(a_i^2+x^2)}\mathrm{d}x=\frac{1}{\pi }\sum _{i=1}^n(c_i\ast {\int }_0^{\infty }\frac{1}{(a_i^2+x^2)}\mathrm{d}x)$$
$$将{\int }_0^{\infty }\frac{1}{(a_i^2+x^2)}\mathrm{d}x=\frac{\pi }{2a_i}代入$$
$$⟹原式=\sum _{i=1}^n\frac{c_i}{2a_i}=\sum _{i=1}^n\frac{1}{2a_i\ast {\prod }_{j=1,j不等于i}^n(a_j^2-a_i^2)}$$

代码

#include <bits/stdc++.h>
#define pi acos(-1.0)
#define ll long long
#define esp 1e-9
#define inf 0x3f3f3f3f
 
using namespace std;
 
const ll N = 1e3+5, mod = 1e9+7;
ll n, ans, a[N];

ll qmod(ll a, ll b){//快速幂
    ll ans = 1;
    a %= mod;
    while (b){
        if(b & 1){
        	ans = ((ans%mod)*(a%mod))%mod;
		}
        a = ((a%mod)*(a%mod))%mod;
        b >>= 1;
    }
    return ans%mod;
}

ll inv(ll a){//逆元
    return qmod(a, mod-2)%mod;
}

int main(){
    ios::sync_with_stdio(false);
    while (cin>>n){
    	ans = 0;
    	for (ll i = 1; i <= n; i++){
    		cin>>a[i];
		}
		for (ll i = 1; i <= n; i++){
			ll t = 1;
			for (ll j = 1; j <= n; j++){//计算c_i
				if (j != i){
					ll tt = ((a[j]*a[j]-a[i]*a[i])%mod+mod)%mod;
					t = ((t%mod)*(tt%mod))%mod;
				}
			}
			t = (((2*a[i])%mod)*(t%mod))%mod;
			ans = (ans%mod+inv(t)%mod)%mod;
		}
		cout<<ans%mod<<endl;
	}
    
    return 0;
}