Submission #1206519


Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;

int N;
int card[6];

void card_swap(){
	int index = 0;
	for(int i = 1; i <= N; i++){
		swap(card[index], card[index + 1]);
		index++;
		if(index == 5) index = 0;
	}
}

int main(void){
	for(int i = 0; i < 6; i++){
		card[i] = i + 1;
	}

	scanf("%d", &N);
	N %= 30;

	card_swap();

	for(int i = 0; i < 6; i++){
		printf("%d", card[i]);
	}
	printf("\n");

	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:22:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, 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 1 ms 128 KB
SubTask1/00_sample_02.txt AC 1 ms 128 KB
SubTask1/rand_19.txt AC 1 ms 128 KB
SubTask1/rand_2.txt AC 1 ms 128 KB
SubTask1/rand_25.txt AC 1 ms 128 KB
SubTask1/rand_27.txt AC 1 ms 128 KB
SubTask1/rand_33.txt AC 1 ms 128 KB
SubTask1/rand_35.txt AC 1 ms 128 KB
SubTask1/rand_4.txt AC 1 ms 128 KB
SubTask1/rand_44.txt AC 1 ms 128 KB
SubTask1/rand_48.txt AC 1 ms 128 KB
SubTask1/rand_8.txt AC 1 ms 128 KB
SubTask2/00_sample_03.txt AC 1 ms 128 KB
SubTask2/max_case.txt AC 1 ms 128 KB
SubTask2/rand_120009641.txt AC 1 ms 128 KB
SubTask2/rand_134230520.txt AC 1 ms 128 KB
SubTask2/rand_136939465.txt AC 1 ms 128 KB
SubTask2/rand_200732473.txt AC 1 ms 128 KB
SubTask2/rand_211796835.txt AC 1 ms 128 KB
SubTask2/rand_312330341.txt AC 1 ms 128 KB
SubTask2/rand_377341731.txt AC 1 ms 128 KB
SubTask2/rand_384611280.txt AC 1 ms 128 KB
SubTask2/rand_386098102.txt AC 1 ms 128 KB
SubTask2/rand_399010727.txt AC 1 ms 128 KB
SubTask2/rand_409627453.txt AC 1 ms 128 KB
SubTask2/rand_416537730.txt AC 1 ms 128 KB
SubTask2/rand_425486442.txt AC 1 ms 128 KB
SubTask2/rand_493135174.txt AC 1 ms 128 KB
SubTask2/rand_573105326.txt AC 1 ms 128 KB
SubTask2/rand_62794810.txt AC 1 ms 128 KB
SubTask2/rand_649471654.txt AC 1 ms 128 KB
SubTask2/rand_693017484.txt AC 1 ms 128 KB
SubTask2/rand_729197057.txt AC 1 ms 128 KB
SubTask2/rand_759630883.txt AC 1 ms 128 KB
SubTask2/rand_823752210.txt AC 1 ms 128 KB
SubTask2/rand_830399384.txt AC 1 ms 128 KB
SubTask2/rand_893242387.txt AC 1 ms 128 KB
SubTask2/rand_935005824.txt AC 1 ms 128 KB
SubTask2/rand_989703310.txt AC 1 ms 128 KB