Submission #1134700


Source Code Expand

#include<stdio.h>

int card[] = { 1,2,3,4,5,6 };

void swap(int a, int b) {
	int temp = card[a];
	card[a] = card[b];
	card[b] = temp;
}

int main(void)
{
	int n;
	int a=0, b=0,i=0,j;

	scanf("%d",&n);

	n = n % 30;

	while (n--) {
		a = i % 5 + 1;
		b = i % 5 + 2;
		swap(a - 1, b - 1);
		i++;
	}
	for (i = 0; i < 6; i++)
		printf("%d",card[i]);
	printf("\n");
	return 0;
}

Submission Info

Submission Time
Task C - 入れ替え
User jj
Language C (GCC 5.4.1)
Score 100
Code Size 402 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:16:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ^

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 30 / 30 70 / 70
Status
AC × 13
AC × 27
Set Name Test Cases
Subtask1 SubTask1/00_sample_00.txt, SubTask1/00_sample_01.txt, SubTask1/00_sample_02.txt, SubTask1/rand_19.txt, SubTask1/rand_2.txt, SubTask1/rand_25.txt, SubTask1/rand_27.txt, SubTask1/rand_33.txt, SubTask1/rand_35.txt, SubTask1/rand_4.txt, SubTask1/rand_44.txt, SubTask1/rand_48.txt, SubTask1/rand_8.txt
Subtask2 SubTask2/00_sample_03.txt, SubTask2/max_case.txt, SubTask2/rand_120009641.txt, SubTask2/rand_134230520.txt, SubTask2/rand_136939465.txt, SubTask2/rand_200732473.txt, SubTask2/rand_211796835.txt, SubTask2/rand_312330341.txt, SubTask2/rand_377341731.txt, SubTask2/rand_384611280.txt, SubTask2/rand_386098102.txt, SubTask2/rand_399010727.txt, SubTask2/rand_409627453.txt, SubTask2/rand_416537730.txt, SubTask2/rand_425486442.txt, SubTask2/rand_493135174.txt, SubTask2/rand_573105326.txt, SubTask2/rand_62794810.txt, SubTask2/rand_649471654.txt, SubTask2/rand_693017484.txt, SubTask2/rand_729197057.txt, SubTask2/rand_759630883.txt, SubTask2/rand_823752210.txt, SubTask2/rand_830399384.txt, SubTask2/rand_893242387.txt, SubTask2/rand_935005824.txt, SubTask2/rand_989703310.txt
Case Name Status Exec Time Memory
SubTask1/00_sample_00.txt AC 1 ms 128 KB
SubTask1/00_sample_01.txt AC 0 ms 128 KB
SubTask1/00_sample_02.txt AC 1 ms 128 KB
SubTask1/rand_19.txt AC 0 ms 128 KB
SubTask1/rand_2.txt AC 0 ms 128 KB
SubTask1/rand_25.txt AC 0 ms 128 KB
SubTask1/rand_27.txt AC 0 ms 128 KB
SubTask1/rand_33.txt AC 0 ms 128 KB
SubTask1/rand_35.txt AC 0 ms 128 KB
SubTask1/rand_4.txt AC 0 ms 128 KB
SubTask1/rand_44.txt AC 0 ms 128 KB
SubTask1/rand_48.txt AC 0 ms 128 KB
SubTask1/rand_8.txt AC 0 ms 128 KB
SubTask2/00_sample_03.txt AC 0 ms 128 KB
SubTask2/max_case.txt AC 0 ms 128 KB
SubTask2/rand_120009641.txt AC 0 ms 128 KB
SubTask2/rand_134230520.txt AC 0 ms 128 KB
SubTask2/rand_136939465.txt AC 0 ms 128 KB
SubTask2/rand_200732473.txt AC 0 ms 128 KB
SubTask2/rand_211796835.txt AC 0 ms 128 KB
SubTask2/rand_312330341.txt AC 0 ms 128 KB
SubTask2/rand_377341731.txt AC 0 ms 128 KB
SubTask2/rand_384611280.txt AC 0 ms 128 KB
SubTask2/rand_386098102.txt AC 0 ms 128 KB
SubTask2/rand_399010727.txt AC 0 ms 128 KB
SubTask2/rand_409627453.txt AC 0 ms 128 KB
SubTask2/rand_416537730.txt AC 0 ms 128 KB
SubTask2/rand_425486442.txt AC 0 ms 128 KB
SubTask2/rand_493135174.txt AC 0 ms 128 KB
SubTask2/rand_573105326.txt AC 0 ms 128 KB
SubTask2/rand_62794810.txt AC 0 ms 128 KB
SubTask2/rand_649471654.txt AC 0 ms 128 KB
SubTask2/rand_693017484.txt AC 0 ms 128 KB
SubTask2/rand_729197057.txt AC 0 ms 128 KB
SubTask2/rand_759630883.txt AC 0 ms 128 KB
SubTask2/rand_823752210.txt AC 0 ms 128 KB
SubTask2/rand_830399384.txt AC 0 ms 128 KB
SubTask2/rand_893242387.txt AC 0 ms 128 KB
SubTask2/rand_935005824.txt AC 0 ms 128 KB
SubTask2/rand_989703310.txt AC 0 ms 128 KB