Submission #5172459


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<int> build(ll n) {
    vector<int> r;

    if (n > 1) {
        if (n & 1) {
            r = build(n - 1);
            r.insert(r.begin(), int(r.size()) + 1);
        } else {
            r = build(n / 2);
            r.push_back(int(r.size()) + 1);
        }
    }

    return r;
}

int main() {
    ll n;
    scanf("%lld", &n);

    auto p = build(n + 1);
    int m = int(p.size());
    for (int i = 1; i <= m; i++) {
        p.push_back(i);
    }

    assert(p.size() <= 200);
    printf("%d\n", int(p.size()));
    for (int x: p) {
        printf("%d ", x);
    }
    printf("\n");
}

Submission Info

Submission Time
Task C - Tautonym Puzzle
User hfccccccccccccc
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 701 Byte
Status
Exec Time 1 ms
Memory 256 KB

Compile Error

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

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_example_01.txt, 00_example_02.txt
All 1000 / 1000 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt
Case Name Status Exec Time Memory
00_example_01.txt 1 ms 256 KB
00_example_02.txt 1 ms 256 KB
01.txt 1 ms 256 KB
02.txt 1 ms 256 KB
03.txt 1 ms 256 KB
04.txt 1 ms 256 KB
05.txt 1 ms 256 KB
06.txt 1 ms 256 KB
07.txt 1 ms 256 KB
08.txt 1 ms 256 KB
09.txt 1 ms 256 KB
10.txt 1 ms 256 KB
11.txt 1 ms 256 KB
12.txt 1 ms 256 KB
13.txt 1 ms 256 KB
14.txt 1 ms 256 KB
15.txt 1 ms 256 KB
16.txt 1 ms 256 KB
17.txt 1 ms 256 KB
18.txt 1 ms 256 KB
19.txt 1 ms 256 KB
20.txt 1 ms 256 KB
21.txt 1 ms 256 KB
22.txt 1 ms 256 KB
23.txt 1 ms 256 KB
24.txt 1 ms 256 KB
25.txt 1 ms 256 KB
26.txt 1 ms 256 KB
27.txt 1 ms 256 KB
28.txt 1 ms 256 KB
29.txt 1 ms 256 KB
30.txt 1 ms 256 KB