Submission #1676463
Source Code Expand
#include <iostream> #include <cstdio> #include <map> #include <set> #include <queue> #include <vector> #include <cstring> #include <cstdlib> #include <algorithm> #define rep(i,a,b) for(int i = a; i <= b; i++) #define dep(i,a,b) for(int i = a; i >= b; i--) #define Rep(i,a) for(int i = 0; i < a; i++) #define pb(a) push_back(a) #define mp(a,b) make_pair(a,b) #define ab(x) ((x) < 0 ? -(x) : (x)) using namespace std; typedef long long LL; typedef map<int, int>::iterator mit; typedef set<int>::iterator sit; typedef pair<int, int> pii; #define x first #define y second LL n; string str(int x) { string s = ""; while (x) s = char(x % 10 + '0') + s, x /= 10; return s; } int main() { cin >>n; n++; string s = ""; bool flag = false; int cnt = 0; dep(i,40,0) if ((1LL << (i + 1)) <= n) { if (s.length()) s = str(i + 1) + ' ' + s + ' ' + str(i + 1); else s = str(i + 1) + ' ' + str(i + 1); cnt += 2; if (n >> i & 1) s = s + ' ' + str(45 + i), cnt++; } cout <<cnt<<endl; cout <<s<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tautonym Puzzle |
User | WuHongxun |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1060 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
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 | AC | 1 ms | 256 KB |
29.txt | WA | 1 ms | 256 KB |
30.txt | WA | 1 ms | 256 KB |