Ozon Tech Challenge 2020 (Div.1 + Div.2) C. Kuroni and Impossible Calculation（抽屉原理）

原题链接：https://codeforces.com/contest/1305/problem/C

To become the king of Codeforces, Kuroni has to solve the following problem.

He is given n numbers $a1,a2,\dots ,an$. Help Kuroni to calculate $\prod 1\le i<j\le n|ai-aj|$. As result can be very big, output it modulo m.

If you are not familiar with short notation, $\prod 1\le i<j\le n|ai-aj|$ is equal to $|a1-a2|\cdot |a1-a3|\cdot \dots \cdot |a1-an|\cdot |a2-a3|\cdot |a2-a4|\cdot \dots \cdot |a2-an|\cdot \dots \cdot |an-1-an|$. In other words, this is the product of $|ai-aj|$ for all $1\le i<j\le n$.

Input
The first line contains two integers $n,m(2\le n\le 2\cdot 105,1\le m\le 1000)$ — number of numbers and modulo.

The second line contains n integers $a1,a2,\dots ,an(0\le ai\le 109)$.

Output
Output the single number — $\prod 1\le i<j\le n|ai-aj|modm$.

输入1：

2 10
8 5

输出1：

3

输入2：

3 12
1 4 5

输出2：

0

输入3：

3 7
1 4 9

输出3：

1

题意： 给一个 $n(n<=2e5)$ 个非负整数的序列，以及正整数$m(m<=1000)$，求 $\prod 1\le i<j\le n|ai-aj|modm$ 的值。

思路： 由抽屉原理可知，当 $n>m$ 时，必定存在两个 $aimodm$同余，此时答案为 0. 否则 n 小于等于 1000，可以直接暴力。

Code：

#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
const int N=2e5+100;
ll a[N],ans=1;
int main(){
    ll n,m;    cin>>n>>m;
    for(int i=0;i<n;i++)
        cin>>a[i];
    if(n>m) return cout<<0<<endl,0;
    for(int i=0;i<n;i++)
        for(int j=i+1;j<n;j++)
            ans=ans*(ll)abs(a[j]-a[i])%m;
    cout<<ans<<endl;
    return 0;
}