Codeforces Round #572 (Div. 2)

**E. Count Pairs

theme:给定n个数，质数p,与k，问有多少对(ai,aj)满足i<j且 ? (2≤n≤3⋅10^5, 2≤p≤10^9, 0≤k≤p−1)

solution：(ai-aj)*(ai+aj)*(ai^2+aj^2)%p=(ai-aj)*k%p化简得(ai^4-aj^4)%p=(ai-aj)*k%p,所以即(ai^4-k*ai)%p=(aj^4-k*aj)%p,所以可以构造一个数组b[i]=(ai^4-k*ai)%p,这样只要找到b中长度为2且相等的子序列个数即为所求。

#include<bits/stdc++.h>
using namespace std;
#define far(i,t,n) for(int i=t;i<n;++i)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

ll a[300030],b[300030];
unordered_map<ll,ll>um;

int main()
{
    int n,p,k;
    cin>>n>>p>>k;
    far(i,0,n)
        scanf("%I64d",&a[i]);
    ll ans=0;
    far(i,0,n)
    {
        b[i]=1;
        far(j,0,4)
            b[i]=b[i]*a[i]%p;
        b[i]=(b[i]-k*a[i]%p+p)%p;
        um[b[i]]++;
        ans+=um[b[i]]-1;
    }
    cout<<ans<<endl;
}