-
Notifications
You must be signed in to change notification settings - Fork 0
/
1761.cpp
142 lines (134 loc) · 3.1 KB
/
1761.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <sstream>
#include <math.h>
using namespace std;
/*
string Manacher(string s)
{
string t = "$#";
for (unsigned long long i = 0; i < s.size(); ++i)
{
t += s[i];
t += "#";
}
vector<unsigned long long> p(t.size(), 0);
unsigned long long mx = 0, id = 0, resLen = 0, resCenter = 0;
for (unsigned long long i = 1; i < t.size(); ++i)
{
p[i] = mx > i ? min(p[2 * id - i], mx - i) : 1;
while (t[i + p[i]] == t[i - p[i]])
{
++p[i];
}
if (mx < i + p[i])
{
mx = i + p[i];
id = i;
}
if (resLen < p[i])
{
resLen = p[i];
resCenter = i;
}
}
return s.substr((resCenter - resLen) / 2, resLen - 1);
}
unsigned long long power(unsigned long long a, unsigned long long b)
{
long long val = 1;
for (long long i = 0; i < b; i++)
{
val *= a;
}
return val;
}
unsigned long long get_length(unsigned long long a)
{
unsigned long long length = 0;
while (a)
{
a /= 10;
length++;
}
return length;
}
unsigned long long get_value(unsigned long long a, unsigned long long i)
{
unsigned long long value;
value = a%power(10, i) / power(10, i - 1);
return value;
}
unsigned long long bi2dec(unsigned long long a)
{
unsigned long long val = 0;
for (unsigned long long i = 1; i <= get_length(a); i++)
{
val += get_value(a, i)*power(2, i - 1);
}
return val;
}
unsigned long long decToBin(unsigned long long dec)
{
unsigned long long result = 0, temp = dec, j = 1;
while (temp)
{
result = result + j*(temp % 2);
temp = temp / 2;
j = j * 10;
}
return result;
}
*/
void main()
{
char InitData[1000002];
cin.getline(InitData, 1000002);
string T = string(InitData);
int k = T.length();
if (string(InitData) == "1") cout << 1 << endl;
else if (string(InitData) == "10") cout << 2 << endl;
else if (string(InitData) == "11" || string(InitData) == "100" || string(InitData) == "101" || string(InitData) == "110") cout << 5 << endl;
else if (string(InitData) == "111" || string(InitData) == "1000" || string(InitData) == "1001" || string(InitData) == "1010") cout << 7 << endl;
else if (string(InitData) == "1011" || string(InitData) == "1100" || string(InitData) == "1101" || string(InitData) == "1110") cout << 9 << endl;
else if (string(InitData) == "1111" || string(InitData) == "10000" || string(InitData) == "10001" || string(InitData) == "10010") cout << 10 << endl;
else if (string(InitData) == "10011" || string(InitData) == "10100" || string(InitData) == "10101" || string(InitData) == "10110") cout << 11 << endl;
else
{
int p = k - 3;
int q = k;
for (k = k - 1; k >= p; k--)
{
if (InitData[k] == '1')
{
InitData[k] = '0';
}
else
{
InitData[k] = '1';
for (int n = k - 1;n >= 0;n--)
{
if (InitData[n] == '0')
{
InitData[n] = '1';
}
else
{
InitData[n] = '0';
break;
}
}
}
}
if (InitData[0] == '1')
{
cout << 10 + 3 * (q - 4);
}
else
{
cout << 10 + 3 * (q - 5);
}
}
}