# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16931 | taehoon1018 | 팩토리얼 세제곱들의 합 (YDX14_fact) | C++98 | 0 ms | 1084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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,24};
int num,pw,res=0;
scanf("%d %d",&num,&pw);
if (pw==0) {
res=num+1;
goto fin;
}
for (int i=0;i<=4;i++) if (i<=num) res+=power(pool[i],pw);
fin:
for (;;) {
if (res%10==0) res=res/10;
else break;
}
printf("%d",res%10);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |