Count Pairs(同余)

https://codeforces.com/contest/1188/problem/B

---

思路：知道同余两边可以加项减项后就可以直接做了

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=3e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
map<LL,LL>map1;
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,p,k;cin>>n>>p>>k;
   LL ans=0;
   for(LL i=1;i<=n;i++){
       LL num;cin>>num;
       LL tmp=( (num%p*num%p*num%p*num%p-k%p*num%p)%p+p)%p;
       if(map1.count(tmp)){
          ans+=map1[tmp];
       }
       map1[tmp]++;
   }
   cout<<ans<<"\n";
   return 0;
}