Submission #1476770
Source Code Expand
#include <cstdio> #include <deque> #include <stack> #define repeat(i, n) for (int i = 0; (i) < int(n); ++(i)) #define whole(x) begin(x), end(x) using ll = long long; using namespace std; int main() { ll n; scanf("%lld", &n); stack<bool> stk; for (ll i = n; i; i >>= 1) stk.push(i & 1); deque<int> x, y; int next = 1; while (not stk.empty()) { bool i = stk.top(); stk.pop(); x.push_back(next); y.push_back(next); ++ next; if (i) { x.push_front(next); y.push_back(next); ++ next; } } x.insert(x.end(), whole(y)); printf("%d\n", int(x.size())); repeat (i, x.size()) { printf("%d%c", x[i], i + 1 == x.size() ? '\n' : ' '); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tautonym Puzzle |
User | kimiyuki |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 806 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:10:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] ll n; scanf("%lld", &n); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1000 | ||||
Status |
|
|
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 | WA | 1 ms | 256 KB |
00_example_02.txt | WA | 1 ms | 256 KB |
01.txt | WA | 1 ms | 256 KB |
02.txt | WA | 1 ms | 256 KB |
03.txt | WA | 1 ms | 256 KB |
04.txt | WA | 1 ms | 256 KB |
05.txt | WA | 1 ms | 256 KB |
06.txt | WA | 1 ms | 256 KB |
07.txt | WA | 1 ms | 256 KB |
08.txt | WA | 1 ms | 256 KB |
09.txt | WA | 1 ms | 256 KB |
10.txt | WA | 1 ms | 256 KB |
11.txt | WA | 1 ms | 256 KB |
12.txt | WA | 1 ms | 256 KB |
13.txt | WA | 1 ms | 256 KB |
14.txt | WA | 1 ms | 256 KB |
15.txt | WA | 1 ms | 256 KB |
16.txt | WA | 1 ms | 256 KB |
17.txt | WA | 1 ms | 256 KB |
18.txt | WA | 1 ms | 256 KB |
19.txt | WA | 1 ms | 256 KB |
20.txt | WA | 1 ms | 256 KB |
21.txt | WA | 1 ms | 256 KB |
22.txt | WA | 1 ms | 256 KB |
23.txt | WA | 1 ms | 256 KB |
24.txt | WA | 1 ms | 256 KB |
25.txt | WA | 1 ms | 256 KB |
26.txt | WA | 1 ms | 256 KB |
27.txt | WA | 1 ms | 256 KB |
28.txt | WA | 1 ms | 256 KB |
29.txt | WA | 1 ms | 256 KB |
30.txt | WA | 1 ms | 256 KB |