oj.uz

Submission #16408

# Submission time Handle Problem Language Result Execution time Memory
16408 2015-08-22T15:49:12 Z jun6873 팩토리얼 세제곱들의 합 (YDX14_fact) C++
0 / 1
 0 ms 1084 KB 
#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);

    if (pow==0) {
        printf("%d",(num+1)%10);
        return 0;
    }

    for (int i=0;i<=4;i++) if (i<=num) res+=power(pool[i],pow);
    printf("%d",res%10);

    return 0;
}

Subtask #1
0.0 / 1.0

# Verdict Execution time Memory 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 -