Submission #3978363


Source Code Expand

#include <stdio.h>
int main(void){
    long int how_many;
    int cards[6] = {1, 2, 3, 4, 5, 6}, temp;
    scanf("%ld", &how_many);
    
    for(int i=0; i<how_many; i++){
        int n = i % 5;
        
        temp = cards[n];
        cards[n] = cards[n+1];
        cards[n+1] = temp;
    }
    
    for(int i=0; i<6; i++){
        printf("%d", cards[i]);
    }
    printf("\n");
    
    return 0;
}

Submission Info

Submission Time
Task C - 入れ替え
User n0ma_ru
Language C (GCC 5.4.1)
Score 30
Code Size 424 Byte
Status TLE
Exec Time 2103 ms
Memory 128 KB

Compile Error

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

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 30 / 30 0 / 70
Status
AC × 13
AC × 17
TLE × 10
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 331 ms 128 KB
SubTask2/max_case.txt TLE 2103 ms 128 KB
SubTask2/rand_120009641.txt AC 398 ms 128 KB
SubTask2/rand_134230520.txt AC 444 ms 128 KB
SubTask2/rand_136939465.txt AC 453 ms 128 KB
SubTask2/rand_200732473.txt AC 665 ms 128 KB
SubTask2/rand_211796835.txt AC 701 ms 128 KB
SubTask2/rand_312330341.txt AC 1033 ms 128 KB
SubTask2/rand_377341731.txt AC 1248 ms 128 KB
SubTask2/rand_384611280.txt AC 1274 ms 128 KB
SubTask2/rand_386098102.txt AC 1278 ms 128 KB
SubTask2/rand_399010727.txt AC 1327 ms 128 KB
SubTask2/rand_409627453.txt AC 1365 ms 128 KB
SubTask2/rand_416537730.txt AC 1379 ms 128 KB
SubTask2/rand_425486442.txt AC 1407 ms 128 KB
SubTask2/rand_493135174.txt AC 1631 ms 128 KB
SubTask2/rand_573105326.txt AC 1894 ms 128 KB
SubTask2/rand_62794810.txt AC 208 ms 128 KB
SubTask2/rand_649471654.txt TLE 2103 ms 128 KB
SubTask2/rand_693017484.txt TLE 2103 ms 128 KB
SubTask2/rand_729197057.txt TLE 2103 ms 128 KB
SubTask2/rand_759630883.txt TLE 2103 ms 128 KB
SubTask2/rand_823752210.txt TLE 2103 ms 128 KB
SubTask2/rand_830399384.txt TLE 2103 ms 128 KB
SubTask2/rand_893242387.txt TLE 2103 ms 128 KB
SubTask2/rand_935005824.txt TLE 2103 ms 128 KB
SubTask2/rand_989703310.txt TLE 2103 ms 128 KB