oj.uz

답안 #19342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19342 2016-02-24T10:14:42 Z algoshipda Α (kriii4_P1) C++14
100 / 100
 0 ms 1716 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long lld;
const int MOD = 1e9 + 7;

struct Bignum;

lld fpow(lld n, lld k)
{
	if(k == 0) return 1;
	if(k % 2){
		return n * fpow(n, k - 1) % MOD;
	}
	lld half = fpow(n, k/2);
	return half * half % MOD;
}
int main()
{
	lld n, k;
	cin >> n >> k;
	cout << fpow(n % MOD, k);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1716 KB Output is correct
2 Correct 0 ms 1716 KB Output is correct
3 Correct 0 ms 1716 KB Output is correct
4 Correct 0 ms 1716 KB Output is correct
5 Correct 0 ms 1716 KB Output is correct
6 Correct 0 ms 1716 KB Output is correct
7 Correct 0 ms 1716 KB Output is correct
8 Correct 0 ms 1716 KB Output is correct
9 Correct 0 ms 1716 KB Output is correct
10 Correct 0 ms 1716 KB Output is correct
11 Correct 0 ms 1716 KB Output is correct
12 Correct 0 ms 1716 KB Output is correct
13 Correct 0 ms 1716 KB Output is correct
14 Correct 0 ms 1716 KB Output is correct
15 Correct 0 ms 1716 KB Output is correct
16 Correct 0 ms 1716 KB Output is correct
17 Correct 0 ms 1716 KB Output is correct
18 Correct 0 ms 1716 KB Output is correct
19 Correct 0 ms 1716 KB Output is correct
20 Correct 0 ms 1716 KB Output is correct