Submission #1240867


Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>

using namespace std;


int main () {
    int i;
    long long int n;
    scanf("%lld", &n);
    long long int kind[201];
    kind[2] = 1;
    for (i = 3; i <= 200; i++) {
        if (i % 2 == 0) {
            kind[i] = (kind[i - 2] + 1) * 4 - 1;
        }
        else {
            kind[i] = i * kind[i - 1];
        }
        if (kind[i] >= n)
            break;
    }
    //printf("%d ", i);
    vector<int>result;
    int length = 0;
    for (int j = i - 1; j >= 2; j--) {
        while (n >= kind[j]) {
            n -= kind[j];
            result.push_back(j);
            length += j;
        }
        if (n == 0)
            break;
    }
    printf("%d\n", length);
    while (length > 100) {
        1;
    }
    int temp = 1;
    for (int j = 0; j < result.size(); j++) {
        for (int k = 0; k < result[j]; k++)
            printf("%d ", temp);
        temp++;
    }
}

Submission Info

Submission Time
Task C - Tautonym Puzzle
User shirochan
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1028 Byte
Status TLE
Exec Time 2107 ms
Memory 256 KB

Compile Error

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

Judge Result

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