답안 #4461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
4461	2013-10-07T05:38:40 Z	yourID	입력숫자 (KOI13_mystery)	C++	100 / 100	0 ms	1088 KB

mystery

#include <stdio.h>

int main(void)
{
	int NUM[50];
	int res[50] = {0,};
	int n;

	scanf("%d", &n);
	int i;
	for(i = 0; i < n; i++)
		scanf("%d", &NUM[i]);

	int count = 0, from = 0, value;
	
	while(count < n)
	{
		while(res[from] != 0)
		{
			from = (from+1)%n;
		}
		res[from] = NUM[count];
		count++;
		from = (res[from]+from) % n;
	}

	printf("%d\n", n);
	for(i = 0; i < n; i++)
		printf("%d ", res[i]);
		
	return 0;
}

Subtask #1

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1088 KB	Output is correct
2	Correct	0 ms	1088 KB	Output is correct
3	Correct	0 ms	1088 KB	Output is correct
4	Correct	0 ms	1088 KB	Output is correct
5	Correct	0 ms	1088 KB	Output is correct
6	Correct	0 ms	1088 KB	Output is correct

Subtask #2

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1088 KB	Output is correct
2	Correct	0 ms	1088 KB	Output is correct
3	Correct	0 ms	1088 KB	Output is correct
4	Correct	0 ms	1088 KB	Output is correct
5	Correct	0 ms	1088 KB	Output is correct
6	Correct	0 ms	1088 KB	Output is correct
7	Correct	0 ms	1088 KB	Output is correct

Subtask #3

29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1088 KB	Output is correct
2	Correct	0 ms	1088 KB	Output is correct
3	Correct	0 ms	1088 KB	Output is correct
4	Correct	0 ms	1088 KB	Output is correct
5	Correct	0 ms	1088 KB	Output is correct
6	Correct	0 ms	1088 KB	Output is correct
7	Correct	0 ms	1088 KB	Output is correct
8	Correct	0 ms	1088 KB	Output is correct

Subtask #4

35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1088 KB	Output is correct
2	Correct	0 ms	1088 KB	Output is correct
3	Correct	0 ms	1088 KB	Output is correct
4	Correct	0 ms	1088 KB	Output is correct
5	Correct	0 ms	1088 KB	Output is correct
6	Correct	0 ms	1088 KB	Output is correct
7	Correct	0 ms	1088 KB	Output is correct
8	Correct	0 ms	1088 KB	Output is correct
9	Correct	0 ms	1088 KB	Output is correct
10	Correct	0 ms	1088 KB	Output is correct