| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 32307 |
2017-10-08T03:48:01 Z |
TAMREF |
Α (kriii4_P1) |
C++11 |
|
0 ms |
2016 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
ll npow(ll a, ll n){
ll res = 1, pval = a%mod;
for(;n;n>>=1,pval=pval*pval%mod){
if(n&1) res = res*pval%mod;
}
return res;
}
int main(){
ll a,n;
cin>>a>>n;
cout<<npow(a,n)<<endl;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 12 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 13 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 15 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 16 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 17 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 18 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 19 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 20 |
Correct |
0 ms |
2016 KB |
Output is correct |
