#include <iostream>
#include <string>
#include <math.h>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <set>
#include <vector>
#include <stdio.h>
using namespace std;
#define ll long long
int MOD;
ll pow(int base, int exp) {
if(exp == 1) {
return base%MOD;
}
if(exp%2) {
return (base *((pow(base, exp/2) * pow(base, exp/2))%MOD))%MOD;
}
return (pow(base, exp/2) * pow(base, exp/2))%MOD;
}
int main() {
int a, k;
scanf("%d %d",&a,&k);
MOD = a + 1;
printf("%lld\n", pow(a, a));
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1672 KB |
Output is correct |
2 |
Correct |
0 ms |
1672 KB |
Output is correct |
3 |
Correct |
0 ms |
1672 KB |
Output is correct |
4 |
Correct |
0 ms |
1672 KB |
Output is correct |
5 |
Correct |
0 ms |
1672 KB |
Output is correct |
6 |
Correct |
0 ms |
1672 KB |
Output is correct |
7 |
Correct |
0 ms |
1672 KB |
Output is correct |
8 |
Correct |
0 ms |
1672 KB |
Output is correct |
9 |
Correct |
0 ms |
1672 KB |
Output is correct |
10 |
Correct |
0 ms |
1672 KB |
Output is correct |
11 |
Correct |
0 ms |
1672 KB |
Output is correct |
12 |
Correct |
0 ms |
1672 KB |
Output is correct |
13 |
Correct |
0 ms |
1672 KB |
Output is correct |
14 |
Correct |
0 ms |
1672 KB |
Output is correct |
15 |
Correct |
0 ms |
1672 KB |
Output is correct |
16 |
Correct |
0 ms |
1672 KB |
Output is correct |
17 |
Correct |
0 ms |
1672 KB |
Output is correct |
18 |
Correct |
0 ms |
1672 KB |
Output is correct |
19 |
Correct |
0 ms |
1672 KB |
Output is correct |
20 |
Correct |
0 ms |
1672 KB |
Output is correct |
21 |
Correct |
0 ms |
1672 KB |
Output is correct |
22 |
Correct |
0 ms |
1672 KB |
Output is correct |
23 |
Correct |
0 ms |
1672 KB |
Output is correct |
24 |
Correct |
0 ms |
1672 KB |
Output is correct |
25 |
Correct |
0 ms |
1672 KB |
Output is correct |
26 |
Correct |
0 ms |
1672 KB |
Output is correct |
27 |
Correct |
0 ms |
1672 KB |
Output is correct |
28 |
Correct |
0 ms |
1672 KB |
Output is correct |
29 |
Correct |
0 ms |
1672 KB |
Output is correct |
30 |
Correct |
0 ms |
1672 KB |
Output is correct |
31 |
Correct |
0 ms |
1672 KB |
Output is correct |
32 |
Correct |
0 ms |
1672 KB |
Output is correct |
33 |
Incorrect |
0 ms |
1672 KB |
Output isn't correct |
34 |
Halted |
0 ms |
0 KB |
- |