oj.uz

답안 #21159

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
21159 2017-04-06T08:57:18 Z jayceking 팩토리얼 세제곱들의 합 (YDX14_fact) C++14
0 / 1
 0 ms 1116 KB 
#include<cstdio>

int pow(int a, int b, int c) {
	if (b == 0) return c;
	pow(a, b - 1, a*c);
}

int main() {
	int n, k;
	scanf("%d %d", &n, &k);
	int d = 0;
	int arr[5] = { 1,1,2,6,24 };
	if (n > 4) {
		for (int i = 0;i <= 4;++i) {
			d += pow(arr[i], k, 1);
		}
	}
	else {
		for (int i = 0;i <= n;++i) {
			d += pow(arr[i], k, 1);
		}
	}
	while (d % 10==0) {
		d /= 10;
	}
	printf("%d", d % 10);
}

Compilation message

fact.cpp: In function 'int pow(int, int, int)':
fact.cpp:6:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
fact.cpp: In function 'int main()':
fact.cpp:10:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
                        ^

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1116 KB answer is '4'
2 Correct 0 ms 1116 KB answer is '2'
3 Correct 0 ms 1116 KB answer is '2'
4 Correct 0 ms 1116 KB answer is '2'
5 Correct 0 ms 1116 KB answer is '2'
6 Correct 0 ms 1116 KB answer is '4'
7 Correct 0 ms 1116 KB answer is '6'
8 Correct 0 ms 1116 KB answer is '1'
9 Correct 0 ms 1116 KB answer is '2'
10 Correct 0 ms 1116 KB answer is '6'
11 Correct 0 ms 1116 KB answer is '4'
12 Correct 0 ms 1116 KB answer is '5'
13 Correct 0 ms 1116 KB answer is '2'
14 Correct 0 ms 1116 KB answer is '3'
15 Correct 0 ms 1116 KB answer is '4'
16 Correct 0 ms 1116 KB answer is '5'
17 Incorrect 0 ms 1116 KB expected '6', found '5'
18 Halted 0 ms 0 KB -