Submission #691246
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
EACH(x,vec) is >> x;
return is;
}
/*
template<class... T>
ostream& operator<<(ostream& os, tuple<T...>& t) {
for (size_t i = 0; i < tuple_size< tuple<T...> >::value; ++i) {
if (i) os << " ";
os << get<0>(t);
}
return os;
}
*/
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
REP(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
REP(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
ll mod = 1e9+7;
ll mul(ll a, ll b) {
return a * b % mod;
}
ll power(ll x, ll n) {
ll res = 1;
for (ll i = 1; i <= n; i <<= 1) {
if (i & n) {
res = mul(res, x);
}
x = mul(x, x);
}
return res;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
ll N, M, P; cin >> N >> M >> P;
mod = M;
cout << power(N, P) << endl;
}
Submission Info
Submission Time |
|
Task |
B - n^p mod m |
User |
drafear |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1596 Byte |
Status |
AC |
Exec Time |
6 ms |
Memory |
256 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 |
4 ms |
256 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 |
5 ms |
256 KB |
010.txt |
AC |
6 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 |