# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
19369 |
2016-02-24T10:49:49 Z |
polequoll |
Α (kriii4_P1) |
C++14 |
|
0 ms |
1716 KB |
//*
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <time.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <numeric>
#include <functional>
#define MOD 1000000007
#define MAX 0x3f3f3f3f
#define MAX2 0x3f3f3f3f3f3f3f3fll
#define ERR 1e-10
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#pragma warning(disable:4996)
using namespace std;
typedef long long ll;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
ll x, y;
int main()
{
int i, j, k;
cin>>x>>y;
x%=MOD;
ll ans=1;
while(y)
{
if(y%2) ans*=x, ans%=MOD;
x*=x, x%=MOD;
y/=2;
}
cout<<ans;
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 |