Submission #1531852


Source Code Expand

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath> 

using namespace std;

int main(void) {
    int j, N;
    int a[6] = {1, 2, 3, 4, 5, 6};
    
    cin >> N;
    N = N%30;
    
    for(int i=0; i<N; i++) {
        j = i%5;
        swap(a[j],a[j+1]);

    }

    //display
    for(int i=0; i<6; i++) {
        cout << a[i] << " ";
    }
    cout << endl;
    
    return 0;
}

Submission Info

Submission Time
Task C - 入れ替え
User manu_gino
Language C++14 (GCC 5.4.1)
Score 0
Code Size 429 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 0 / 30 0 / 70
Status
WA × 13
WA × 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 WA 1 ms 256 KB
SubTask1/00_sample_01.txt WA 1 ms 256 KB
SubTask1/00_sample_02.txt WA 1 ms 256 KB
SubTask1/rand_19.txt WA 1 ms 256 KB
SubTask1/rand_2.txt WA 1 ms 256 KB
SubTask1/rand_25.txt WA 1 ms 256 KB
SubTask1/rand_27.txt WA 1 ms 256 KB
SubTask1/rand_33.txt WA 1 ms 256 KB
SubTask1/rand_35.txt WA 1 ms 256 KB
SubTask1/rand_4.txt WA 1 ms 256 KB
SubTask1/rand_44.txt WA 1 ms 256 KB
SubTask1/rand_48.txt WA 1 ms 256 KB
SubTask1/rand_8.txt WA 1 ms 256 KB
SubTask2/00_sample_03.txt WA 1 ms 256 KB
SubTask2/max_case.txt WA 1 ms 256 KB
SubTask2/rand_120009641.txt WA 1 ms 256 KB
SubTask2/rand_134230520.txt WA 1 ms 256 KB
SubTask2/rand_136939465.txt WA 1 ms 256 KB
SubTask2/rand_200732473.txt WA 1 ms 256 KB
SubTask2/rand_211796835.txt WA 1 ms 256 KB
SubTask2/rand_312330341.txt WA 1 ms 256 KB
SubTask2/rand_377341731.txt WA 1 ms 256 KB
SubTask2/rand_384611280.txt WA 1 ms 256 KB
SubTask2/rand_386098102.txt WA 1 ms 256 KB
SubTask2/rand_399010727.txt WA 1 ms 256 KB
SubTask2/rand_409627453.txt WA 1 ms 256 KB
SubTask2/rand_416537730.txt WA 1 ms 256 KB
SubTask2/rand_425486442.txt WA 1 ms 256 KB
SubTask2/rand_493135174.txt WA 1 ms 256 KB
SubTask2/rand_573105326.txt WA 1 ms 256 KB
SubTask2/rand_62794810.txt WA 1 ms 256 KB
SubTask2/rand_649471654.txt WA 1 ms 256 KB
SubTask2/rand_693017484.txt WA 1 ms 256 KB
SubTask2/rand_729197057.txt WA 1 ms 256 KB
SubTask2/rand_759630883.txt WA 1 ms 256 KB
SubTask2/rand_823752210.txt WA 1 ms 256 KB
SubTask2/rand_830399384.txt WA 1 ms 256 KB
SubTask2/rand_893242387.txt WA 1 ms 256 KB
SubTask2/rand_935005824.txt WA 1 ms 256 KB
SubTask2/rand_989703310.txt WA 1 ms 256 KB