3 solutions
-
2
#include<bits/stdc++.h> using namespace std; long long qmi(long long a,long long b,long long p) { long long res=1%p; while(b) { if(b&1) { res=res*a%p; } a=a*a%p; b/=2; } return res; } int main() { int n; cin>>n; while(n--) { long long a,b,p; cin>>a>>b>>p; cout<<qmi(a,b,p)<<endl; } return 0; }
-
-3
#include<bits/stdc++.h> using namespace std; long long qmi(long long a,long long b,long long p) { long long res=1%p; while(b) { if(b&1) { res=res*a%p; } a=a*a%p; b/=2; } return res; } int main() { int n; cin>>n; while(n--) { long long a,b,p; cin>>a>>b>>p; cout<<qmi(a,b,p)<<endl; } return 0; }
- 1
Information
- ID
- 184
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 66
- Accepted
- 17
- Uploaded By