1 solutions
-
0
C++ :
#include<cstdio> typedef long long int64; int64 n,m,k; int64 x,Num; int64 Qpow(int64 a,int64 m){ if(m==0)return 1%k; int64 r=Qpow(a,m>>1)%k; r=(r%k)*(r%k); if(m&1)r=(r%k)*(a%k); return r%k; } int main(){ scanf("%lld%lld%lld",&n,&m,&k); for(int64 i=1;i<=n;i++){ scanf("%lld",&x); if(Qpow(x,m)==0)Num++; } printf("%lld",Num); return 0; }
- 1
Information
- ID
- 17904
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By