oj.uz

답안 #19376

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19376 2016-02-24T10:56:00 Z golala123 Α (kriii4_P1) C++
100 / 100
 0 ms 1720 KB 
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
long long a, x;
long long ans = 1;
int temp = 1;
vector<long long> m;
vector< pair<int , int > > two;
const int MOD = 1000000007;
int main(){
	cin >> a >> x;
	a %= MOD;
	long long temp = 1;
	int i = 0;
	m.push_back(a);
	while (temp < x){
		long long aa = 1;
		aa = m[i] % MOD * m[i] % MOD;
		aa %= MOD;
		m.push_back(aa%MOD);
		temp *= 2;
		i++;
	}
	int j = 0;
	while (x != 0){
		if (x%2 == 1)
			two.push_back({ j, x % 2 });
		x /= 2;
		j++;
	}
	for (int i = 0; i < two.size(); i++){
		if (two[i].second == 1){
			ans = ans*m[two[i].first] % MOD;
			ans %= MOD;
		}
	}
	cout << ans % MOD;
}

Subtask #1
100.0 / 100.0

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