AtCoder Beginner Contest 004

Submission #3978091

Source codeソースコード

//program luogu.AT817
#include<iostream>
#include<cstdio>
using namespace std;
int a[6]={1,2,3,4,5,6},n,tmp;

int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		tmp=i%5;
		swap(a[tmp],a[tmp+1]);
	}
	for(int i=0;i<6;i++)
		printf("%d",a[i]);
	printf("\n");
	return 0;
}

Submission

Task問題 C - 入れ替え
User nameユーザ名 luogu_bot1
Created time投稿日時
Language言語 C++ (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 271 Byte
File nameファイル名
Exec time実行時間 1955 ms
Memory usageメモリ使用量 256 KB

Compiler messageコンパイルメッセージ

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

Test case

Set

Set name Score得点 / Max score Cases
Subtask1 30 / 30 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 70 / 70 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
SubTask1/00_sample_00.txt AC 1 ms 256 KB
SubTask1/00_sample_01.txt AC 1 ms 256 KB
SubTask1/00_sample_02.txt AC 1 ms 256 KB
SubTask1/rand_19.txt AC 1 ms 256 KB
SubTask1/rand_2.txt AC 1 ms 256 KB
SubTask1/rand_25.txt AC 1 ms 256 KB
SubTask1/rand_27.txt AC 1 ms 256 KB
SubTask1/rand_33.txt AC 1 ms 256 KB
SubTask1/rand_35.txt AC 1 ms 256 KB
SubTask1/rand_4.txt AC 1 ms 256 KB
SubTask1/rand_44.txt AC 1 ms 256 KB
SubTask1/rand_48.txt AC 1 ms 256 KB
SubTask1/rand_8.txt AC 1 ms 256 KB
SubTask2/00_sample_03.txt AC 197 ms 256 KB
SubTask2/max_case.txt AC 1955 ms 256 KB
SubTask2/rand_120009641.txt AC 236 ms 256 KB
SubTask2/rand_134230520.txt AC 264 ms 256 KB
SubTask2/rand_136939465.txt AC 269 ms 256 KB
SubTask2/rand_200732473.txt AC 394 ms 256 KB
SubTask2/rand_211796835.txt AC 415 ms 256 KB
SubTask2/rand_312330341.txt AC 612 ms 256 KB
SubTask2/rand_377341731.txt AC 739 ms 256 KB
SubTask2/rand_384611280.txt AC 753 ms 256 KB
SubTask2/rand_386098102.txt AC 756 ms 256 KB
SubTask2/rand_399010727.txt AC 781 ms 256 KB
SubTask2/rand_409627453.txt AC 802 ms 256 KB
SubTask2/rand_416537730.txt AC 816 ms 256 KB
SubTask2/rand_425486442.txt AC 833 ms 256 KB
SubTask2/rand_493135174.txt AC 965 ms 256 KB
SubTask2/rand_573105326.txt AC 1121 ms 256 KB
SubTask2/rand_62794810.txt AC 124 ms 256 KB
SubTask2/rand_649471654.txt AC 1273 ms 256 KB
SubTask2/rand_693017484.txt AC 1359 ms 256 KB
SubTask2/rand_729197057.txt AC 1426 ms 256 KB
SubTask2/rand_759630883.txt AC 1487 ms 256 KB
SubTask2/rand_823752210.txt AC 1611 ms 256 KB
SubTask2/rand_830399384.txt AC 1624 ms 256 KB
SubTask2/rand_893242387.txt AC 1747 ms 256 KB
SubTask2/rand_935005824.txt AC 1828 ms 256 KB
SubTask2/rand_989703310.txt AC 1943 ms 256 KB