Submission #691219
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
ll mod_pow(ll x,ll n,ll mod){
if(n == 0) return 1;
ll res = mod_pow(x * x % mod,n / 2,mod);
if(n & 1) res = res * x % mod;
return res;
}
void Main() {
ll n,m,p;
cin >> n >> m >> p;
pr(mod_pow(n,p,m));
}
int main() {
ios::sync_with_stdio(0);cin.tie(0);
Main();return 0;
}
Submission Info
Submission Time |
|
Task |
B - n^p mod m |
User |
kzyKT |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1391 Byte |
Status |
AC |
Exec Time |
106 ms |
Memory |
764 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
AC
|
|
Set Name |
Test Cases |
Sample |
|
All |
001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt |
Case Name |
Status |
Exec Time |
Memory |
001.txt |
AC |
106 ms |
764 KB |
002.txt |
AC |
4 ms |
256 KB |
003.txt |
AC |
4 ms |
256 KB |
004.txt |
AC |
4 ms |
256 KB |
005.txt |
AC |
4 ms |
256 KB |
006.txt |
AC |
4 ms |
256 KB |
007.txt |
AC |
4 ms |
256 KB |
008.txt |
AC |
4 ms |
256 KB |
009.txt |
AC |
4 ms |
256 KB |
010.txt |
AC |
4 ms |
256 KB |
011.txt |
AC |
4 ms |
256 KB |
012.txt |
AC |
4 ms |
256 KB |
013.txt |
AC |
4 ms |
256 KB |
014.txt |
AC |
4 ms |
256 KB |
015.txt |
AC |
4 ms |
256 KB |
016.txt |
AC |
4 ms |
256 KB |
017.txt |
AC |
4 ms |
256 KB |
018.txt |
AC |
4 ms |
256 KB |
019.txt |
AC |
4 ms |
256 KB |
020.txt |
AC |
4 ms |
256 KB |
021.txt |
AC |
4 ms |
256 KB |
022.txt |
AC |
4 ms |
256 KB |
023.txt |
AC |
4 ms |
256 KB |
024.txt |
AC |
4 ms |
256 KB |
025.txt |
AC |
4 ms |
256 KB |
026.txt |
AC |
4 ms |
256 KB |
027.txt |
AC |
4 ms |
256 KB |
sample_01.txt |
AC |
4 ms |
256 KB |
sample_02.txt |
AC |
4 ms |
256 KB |