| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19642 |
2016-02-25T03:15:03 Z |
sui |
Α (kriii4_P1) |
C++14 |
|
0 ms |
1716 KB |
#define _CRT_SECURE_NO_WARNINGS // scanf(), gets() (needed for Visual C++)
//#define NDEBUG
#include <cassert>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <deque>
using namespace std;
#define MEMSET(x, WITH) memset(x, (WITH), sizeof(x))
#define FOR(i, E) for(int i=0; i<(E); i++)
#define REP(i, LO, HI) for(int i=(LO); i<=(HI); i++)
#define GETINT(x) scanf("%d", &x)
#define GETDBL(x) scanf("%lf", &x)
#define GETSTR(x) scanf("%s", x)
#define NEWINT(x) int x; scanf("%d", &x)
#define NEWDBL(x) double x; scanf("%lf", &x)
#define NEWLN putchar('\n')
#ifdef _WIN32
#define popcnt __popcnt
#else
#define popcnt __builtin_popcount
#endif
typedef long long ll;
//const ll MOD = 1000000007;
//const double PI = atan(1) * 4;
const ll MOD = 1000000007;
int main() {
ll a, n; cin >> a >> n;
a = a % MOD;
ll ans = 1;
for (int i=62; i>=0; i--) {
ans = ans * ans % MOD;
if ((n>>i)&1)
ans = ans * a % MOD;
}
cout << ans << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
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 |
