#include <stdio.h>
int power(int a,int b)
{
int res=1;
for (int i=0;i<b;i++) res*=a;
return res;
}
int main(void)
{
int pool[5]={1,1,2,6,4};
int num,pow,res=0;
scanf("%d %d",&num,&pow);
for (int i=0;i<=4;i++) if (i<=num) res+=power(pool[i],pow);
printf("%d",res%10);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '4' |
2 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '2' |
3 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '2' |
4 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '2' |
5 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '2' |
6 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '4' |
7 |
Correct |
0 ms |
1084 KB |
Output is correct - answer is '6' |
8 |
Incorrect |
0 ms |
1084 KB |
Output isn't correct - expected '1', found '0' |
9 |
Halted |
0 ms |
0 KB |
- |