Submission #1195707
Source Code Expand
#ifdef DEBUG #define _GLIBCXX_DEBUG #endif #include <bits/stdc++.h> using namespace std; #define mp make_pair #define pb push_back #define sz(s) ((int) ((s).size())) #ifdef DEBUG #define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr) #else #define eprintf(...) ; #endif typedef long long ll; typedef long double ld; const int inf = (int) 1.01e9; const ld eps = 1e-11; const ld pi = acos(-1.0L); mt19937 mrand(random_device{} ()); int rnd(int x) { return mrand() % x; } const int mod = (int) 1e9 + 7; void add(int & x, int y) { if ((x += y) >= mod) { x -= mod; } } int sum(int x, int y) { add(x, y); return x; } int mult(int x, int y) { return (ll) x * y % mod; } int power(int x, ll p) { int res = 1; while (p) { if (p & 1) { res = mult(res, x); } x = mult(x, x); p >>= 1; } return res; } int inv(int x) { return power(x, mod - 2); } void precalc() { } ll n; bool read() { if (scanf("%lld", &n) < 1) { return false; } return true; } void solve() { n++; vector<int> ans; int mx = -1; for (int i = 40; i >= 0; i--) { if (n & (1ll << i)) { if (mx == -1) { mx = i; } else { ans.pb(i + 41); } } if (mx != -1 && i) { ans.pb(i); } } for (int i = 0; i <= 40; i++) { ans.pb(i + 41); } for (int i = mx; i >= 1; i--) { ans.pb(i); } printf("%d\n", sz(ans)); for (int i = 0; i < sz(ans); i++) { printf("%d%c", ans[i], " \n"[i == sz(ans) - 1]); } } int main() { precalc(); #ifdef DEBUG assert(freopen("text.in", "r", stdin)); assert(freopen("text.out", "w", stdout)); #endif while (read()) { solve(); #ifdef DEBUG eprintf("Time: %.3f\n", (double) clock() / CLOCKS_PER_SEC); #endif } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tautonym Puzzle |
User | StanislavErshov |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1901 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 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 | 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 |