#include <iostream>
#include <memory.h>
#include <map>
#include <string>
#include <functional>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 10000000;
ll n, k;
ll fa(ll a)
{
if (a == 0)
return 1;
ll res = 1;
for (ll i = 1; i <= a; i++)
res =(res* i)%mod;
return res;
}
ll po(ll a)
{
if (k == 0)
return 1;
ll res = 1;
for (int i = 0; i < k; i++)
res = (res * a)%mod;
return res;
}
int main() {
cin >> n >> k;
ll res = 0;
for (ll i = 0; i <= n; i++)
res = res + (po(fa(i)));
while (1)
{
if (res == 0)
return 0;
else if (res % 10 != 0) {
cout << res % 10 << endl;
return 0;
}
res = res / 10;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
answer is '4' |
2 |
Correct |
1 ms |
352 KB |
answer is '2' |
3 |
Correct |
2 ms |
424 KB |
answer is '2' |
4 |
Correct |
2 ms |
424 KB |
answer is '2' |
5 |
Correct |
2 ms |
460 KB |
answer is '2' |
6 |
Correct |
2 ms |
604 KB |
answer is '4' |
7 |
Correct |
1 ms |
604 KB |
answer is '6' |
8 |
Correct |
1 ms |
604 KB |
answer is '1' |
9 |
Correct |
1 ms |
604 KB |
answer is '2' |
10 |
Correct |
1 ms |
604 KB |
answer is '6' |
11 |
Correct |
1 ms |
604 KB |
answer is '4' |
12 |
Correct |
1 ms |
620 KB |
answer is '5' |
13 |
Correct |
2 ms |
620 KB |
answer is '2' |
14 |
Correct |
1 ms |
620 KB |
answer is '3' |
15 |
Correct |
1 ms |
620 KB |
answer is '4' |
16 |
Correct |
2 ms |
620 KB |
answer is '5' |
17 |
Correct |
1 ms |
620 KB |
answer is '6' |
18 |
Correct |
1 ms |
620 KB |
answer is '7' |
19 |
Correct |
1 ms |
620 KB |
answer is '8' |
20 |
Correct |
2 ms |
620 KB |
answer is '9' |
21 |
Correct |
1 ms |
620 KB |
answer is '1' |
22 |
Correct |
1 ms |
620 KB |
answer is '6' |
23 |
Correct |
2 ms |
620 KB |
answer is '3' |
24 |
Correct |
1 ms |
620 KB |
answer is '7' |
25 |
Correct |
1 ms |
620 KB |
answer is '3' |
26 |
Correct |
1 ms |
620 KB |
answer is '1' |
27 |
Correct |
1 ms |
620 KB |
answer is '2' |
28 |
Correct |
2 ms |
620 KB |
answer is '1' |
29 |
Correct |
1 ms |
620 KB |
answer is '1' |
30 |
Correct |
2 ms |
620 KB |
answer is '1' |
31 |
Correct |
1 ms |
620 KB |
answer is '4' |
32 |
Correct |
1 ms |
620 KB |
answer is '4' |
33 |
Correct |
2 ms |
620 KB |
answer is '4' |
34 |
Correct |
1 ms |
620 KB |
answer is '4' |
35 |
Correct |
2 ms |
620 KB |
answer is '4' |
36 |
Correct |
1 ms |
620 KB |
answer is '4' |
37 |
Correct |
1 ms |
620 KB |
answer is '4' |
38 |
Correct |
2 ms |
620 KB |
answer is '4' |
39 |
Correct |
1 ms |
620 KB |
answer is '4' |
40 |
Correct |
1 ms |
620 KB |
answer is '8' |
41 |
Correct |
2 ms |
620 KB |
answer is '8' |
42 |
Correct |
1 ms |
620 KB |
answer is '8' |
43 |
Correct |
2 ms |
620 KB |
answer is '8' |
44 |
Correct |
2 ms |
656 KB |
answer is '8' |
45 |
Correct |
2 ms |
656 KB |
answer is '8' |
46 |
Correct |
2 ms |
696 KB |
answer is '8' |
47 |
Correct |
2 ms |
696 KB |
answer is '8' |
48 |
Correct |
2 ms |
696 KB |
answer is '8' |
49 |
Correct |
1 ms |
696 KB |
answer is '5' |
50 |
Correct |
2 ms |
696 KB |
answer is '5' |
51 |
Correct |
2 ms |
696 KB |
answer is '5' |
52 |
Correct |
1 ms |
696 KB |
answer is '5' |
53 |
Correct |
2 ms |
696 KB |
answer is '5' |
54 |
Correct |
1 ms |
696 KB |
answer is '5' |
55 |
Correct |
1 ms |
696 KB |
answer is '5' |
56 |
Correct |
1 ms |
696 KB |
answer is '5' |
57 |
Correct |
1 ms |
696 KB |
answer is '5' |