Submission #1201427


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int a[500], nr = 0;
long long n;

void get_ans(long long k, int id1, int id2)
{
    if(k==1)
    {
        int i;
        cout << 2*nr << '\n';
        for(i=1; i<id1; ++i) cout << a[i] << ' ';
        for(i=id2+1; i<=100; ++i) cout << a[i] << ' ';

        for(i=nr; i; --i) cout << i << ' ';
        cout << '\n';
        return;
    }

    if(k&1LL)
    {
        a[id1] = ++nr;
        get_ans(k-1, id1+1, id2);
    }
    else
    {
        a[id2] = ++nr;
        get_ans(k/2, id1, id2-1);
    }
}

int main()
{
    cin >> n; nr = 0;
    get_ans(n+1, 1, 100);

    return 0;
}

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 32
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 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 AC 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 1 ms 256 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 1 ms 256 KB
29.txt AC 1 ms 256 KB
30.txt AC 1 ms 256 KB