2020ICPC·小米 网络选拔赛热身赛 I-Integration

传送门： https://ac.nowcoder.com/acm/contest/8409/I

题意

$$求解{\int }_0^{+\infty }\frac{1}{{\prod }_{i=1}^n(a_i^2+x^2)}dx$$

思路

$想要用分部积分求该定积分是非常非常困难的，而题目给出了{\int }_0^{+\infty }\frac{1}{1+x^2}dx=\frac{\pi }{2}，所以我们就想办法把这个连乘变成连加，这样就好求了。$

$当n=1时：$

$${\int }_0^{+\infty }\frac{1}{a^2+x^2}dx=\frac{1}{a^2}arctan(\frac{x}{a}){|}_0^{+\infty }=\frac{\pi }{2a}$$

$当n=2时：$

$只看让式子分解的部分：$

$$\frac{1}{a^2+x^2}\frac{1}{b^2+x^2}=\frac{\alpha }{a^2+x^2}+\frac{\beta }{b^2+x^2}=\frac{\alpha b^2+\beta a^2+x^2(\alpha +\beta )}{(a^2+x^2)(b^2+x^2)}$$

$则$$$\{\begin{array}{ccc}\alpha b^2+\beta a^2& =1& \\ \alpha +\beta & =1& \end{array}$$

$解得：$
$$\{\begin{array}{ccc}\alpha & =\frac{1}{b^2-a^2}& \\ \beta & =\frac{1}{a^2-b^2}& \end{array}$$

$转化为：$

$${\int }_0^{+\infty }(\frac{1}{b^2-a^2})(\frac{1}{a^2+x^2})+(\frac{1}{a^2-b^2})(\frac{1}{b^2+x^2})dx=\frac{1}{b^2-a^2}\ast \frac{1}{2a}+\frac{1}{a^2-b^2}\ast \frac{1}{2b}$$

$当n=3时：$

$$\frac{1}{a^2+x^2}\frac{1}{b^2+x^2}\frac{1}{c^2+x^2}=\frac{\alpha }{a^2+x^2}+\frac{\beta }{b^2+x^2}+\frac{\gamma }{c^2+x^2}$$
$$=\frac{\alpha b^2{c}^2+\beta a^2{c}^2+\gamma a^2{b}^2+x^2(\alpha (b^2+c^2)+\beta (a^2+c^2)+\gamma (a^2+b^2))+x^4(\alpha +\beta +\gamma )}{(a^2+x^2)(b^2+x^2)(c^2+x^2)}$$
$即求解：$

$$\{\begin{array}{ccc}\alpha +\beta +\gamma & =& 0\\ \alpha b^2{c}^2+\beta a^2{c}^2+\gamma a^2{b}^2& =& 1\\ \alpha (b^2+c^2)+\beta (a^2+c^2)+\gamma (a^2+b^2)& =& 0\end{array}$$

$需要增广矩阵求解，求得：$

$$\{\begin{array}{ccc}\alpha & =& \frac{1}{(b^2-a^2)(c^2-a^2)}\\ \beta & =& \frac{1}{(a^2-b^2)(c^2-b^2)}\\ \gamma & =& \frac{1}{(a^2-c^2)(b^2-c^2)}\end{array}$$

$${\int }_0^{+\infty }\frac{1}{(a^2+x^2)(b^2+x^2)(c^2+x^2)}dx$$
$$=\frac{1}{(b^2-a^2)(c^2-a^2)}\frac{1}{2a}+\frac{1}{(a^2-b^2)(c^2-b^2)}\frac{1}{2b}+\frac{1}{(a^2-c^2)(b^2-c^2)}\frac{1}{2c}$$

$根据上面的列举，大大推断出该式子的规律，即对于$

$${\int }_0^{+\infty }\frac{1}{{\prod }_{i=1}^n(a_i^2+x^2)}dx$$

$$ans=\sum _{i=1}^n\frac{1}{2a_i}\left(\prod _{j=1j\ne i}^n\frac{1}{a_j^2-a_i^2}\right)$$

Code

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pdd;

#define INF 0x3f3f3f3f
#define lowbit(x) x & (-x)
#define mem(a, b) memset(a , b , sizeof(a))
#define FOR(i, x, n) for(int i = x;i <= n; i++)

// const ll mod = 998244353;
 const ll mod = 1e9 + 7;
// const double eps = 1e-6;
// const double PI = acos(-1);
// const double R = 0.57721566490153286060651209;

const int N = 105;

double dis(double x1, double y1, double x2, double y2) {
    return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}

ll quick_pow(ll a, ll b) {
    ll ans = 1;
    while(b) {
        if(b & 1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans % mod;
}

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

signed main() {
    ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);
#ifdef FZT_ACM_LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    signed test_index_for_debug = 1;
    char acm_local_for_debug = 0;
    do {
        if (acm_local_for_debug == '$') exit(0);
        if (test_index_for_debug > 20)
            throw runtime_error("Check the stdin!!!");
        auto start_clock_for_debug = clock();
        solve();
        auto end_clock_for_debug = clock();
        cout << "Test " << test_index_for_debug << " successful" << endl;
        cerr << "Test " << test_index_for_debug++ << " Run Time: "
             << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
        cout << "--------------------------------------------------" << endl;
    } while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
    solve();
#endif
    return 0;
}