#include <iostream>
#include <memory.h>
#include <map>
#include <string>
#include <functional>
#include <vector>
using namespace std;
typedef long long ll;
ll n, k;
ll fa(ll a)
{
if (a == 0)
return 1;
ll res = 1;
for (int i = 1; i <= a; i++)
res *= i;
return res;
}
ll po(ll a)
{
if (k == 0)
return 1;
ll res = 1;
for (int i = 0; i < k; i++)
res = res * a;
return res;
}
int main() {
ios::sync_with_stdio(false);
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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
answer is '4' |
2 |
Correct |
1 ms |
352 KB |
answer is '2' |
3 |
Correct |
2 ms |
552 KB |
answer is '2' |
4 |
Correct |
2 ms |
552 KB |
answer is '2' |
5 |
Correct |
2 ms |
552 KB |
answer is '2' |
6 |
Correct |
2 ms |
648 KB |
answer is '4' |
7 |
Correct |
2 ms |
648 KB |
answer is '6' |
8 |
Correct |
1 ms |
648 KB |
answer is '1' |
9 |
Correct |
1 ms |
648 KB |
answer is '2' |
10 |
Correct |
2 ms |
648 KB |
answer is '6' |
11 |
Correct |
1 ms |
648 KB |
answer is '4' |
12 |
Correct |
2 ms |
648 KB |
answer is '5' |
13 |
Correct |
2 ms |
648 KB |
answer is '2' |
14 |
Correct |
1 ms |
648 KB |
answer is '3' |
15 |
Correct |
2 ms |
648 KB |
answer is '4' |
16 |
Correct |
2 ms |
740 KB |
answer is '5' |
17 |
Correct |
2 ms |
740 KB |
answer is '6' |
18 |
Correct |
2 ms |
740 KB |
answer is '7' |
19 |
Correct |
2 ms |
740 KB |
answer is '8' |
20 |
Correct |
2 ms |
740 KB |
answer is '9' |
21 |
Correct |
2 ms |
740 KB |
answer is '1' |
22 |
Correct |
2 ms |
740 KB |
answer is '6' |
23 |
Correct |
2 ms |
740 KB |
answer is '3' |
24 |
Correct |
2 ms |
740 KB |
answer is '7' |
25 |
Correct |
2 ms |
740 KB |
answer is '3' |
26 |
Correct |
2 ms |
740 KB |
answer is '1' |
27 |
Correct |
2 ms |
740 KB |
answer is '2' |
28 |
Correct |
2 ms |
740 KB |
answer is '1' |
29 |
Correct |
2 ms |
740 KB |
answer is '1' |
30 |
Correct |
2 ms |
740 KB |
answer is '1' |
31 |
Correct |
2 ms |
740 KB |
answer is '4' |
32 |
Correct |
2 ms |
740 KB |
answer is '4' |
33 |
Incorrect |
1 ms |
740 KB |
expected '4', found '6' |
34 |
Halted |
0 ms |
0 KB |
- |