text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int x = s.length();
int y = x;
x = x / 2;
for (int i = s.length() - 1; i > 0; i--) {
if (s[i] == '1') {
x++;
if (y % 2 == 0) {
x--;
}
break;
}
}
cout << x;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const int maxn = 1e5 + 10;
string s;
int main() {
cin >> s;
int len = s.length(), ans = len / 2;
if (len & 1) {
for (int i = 1; i < len; ++i)
if (s[i] == '1') {
++ans;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < s.size(); ++i) cnt += s[i] == '1';
if (s.size() % 2) {
if (cnt > 1)
cout << (s.size()) / 2 + 1 << "\n";
else
cout << (s.size()) / 2 << "\n";
} else {
cout << s.size() / 2 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long modl = 1000000007;
int farr[1000000];
int pre[1000000];
int cum[1000000];
unsigned long long poow(int base, int po);
void swaap(int *a, int *b);
long long gcd(long long a, long long b);
void mul_big_int(string s1, string s2);
int cnt_prime(int n);
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
string s;
cin >> s;
reverse(s.begin(), s.end());
int cnttr = 0;
int len = s.length();
for (int i = 0; i < len - 1; i++)
if (s[i] == '1') cnttr++;
len--;
int trains = 0, cntr = 0;
if (!cnttr) {
for (int i = 0; i < len; i += 2) {
cntr++;
}
} else {
for (int i = 0; i <= len; i += 2) {
cntr++;
}
}
cout << cntr;
return 0;
}
unsigned long long poow(int base, int po) {
if (po == 0) return 1;
if (po == 1) return base;
unsigned long long ans = poow(base, po / 2);
ans = (ans * ans);
if (po & 1) return (ans * base);
return ans;
}
void swaap(int *a, int *b) {
int temp;
temp = *a;
*a = *b;
*b = temp;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
void mul_big_int(string s1, string s2) {
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
int mul[1000];
memset(mul, 0, sizeof(mul));
long long ln1 = s1.length(), ln2 = s2.length();
for (int i = 0; i < ln1; i++) {
for (int j = 0; j < ln2; j++) {
mul[i + j] += ((s1[i] - '0') * (s2[j] - '0'));
}
}
for (int i = 0; i < 1000; i++) {
mul[i + 1] += mul[i] / 10;
mul[i] %= 10;
}
int i = 999;
while (i > 0 && mul[i] == 0) i--;
for (; i >= 0; i--) {
cout << mul[i];
}
cout << endl;
}
int cnt_prime(int n) {
vector<bool> prime(n + 1, true);
prime[0] = false;
prime[1] = false;
for (long long i = 2; i * i <= n; i++) {
if (prime[i]) {
for (int j = i * i; j <= n; j += i) prime[j] = 0;
}
}
int cntr = 0;
for (int i = 0; i < (int)prime.size(); i++) {
if (prime[i]) cntr++;
}
return cntr;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
bitset<64> bt = 64;
ios::sync_with_stdio(0);
string str;
cin >> str;
long long tmp = str.size();
long long ans = (tmp + 1) / 2;
bool fuck = true;
for (string::iterator it = str.begin() + 1, ed = str.end(); it != ed; ++it) {
if (*it == '1') {
fuck = false;
}
}
if (fuck && tmp % 2) ans--;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
char s[105];
int main() {
scanf("%s", s);
int i;
bool flag = true;
for (i = 1; s[i]; ++i)
if (s[i] == '1') flag = false;
if (!flag) ++i;
printf("%d\n", i / 2);
return 0;
}
|
#include <bits/stdc++.h>
char a[200];
int main() {
int i, n, sum;
scanf("%s", a);
n = strlen(a);
sum = n / 2;
if (n % 2 == 1) {
for (i = n - 1; i >= 1; i--)
if (a[i] == '1') {
sum++;
break;
}
}
printf("%d\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
string str;
cin >> str;
int n = str.length(), ones = 0, ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (str[i] - '0') ones++;
}
if (!ones)
cout << 0;
else {
int i;
for (i = n - 1; i >= 0; i -= 2) ans++;
if (i == -2 && ones == 1) ans--;
cout << ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long ans = s.length() / 2;
if (s.length() % 2 == 1) {
for (int i = 1; i < s.length(); i++) {
if (s[i] == '1') {
ans++;
break;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int m = n.length();
for (int i = n.length() - 1; i > 0; i--) {
if (n[i] == '1') {
m++;
break;
}
}
cout << m / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
if (s == "11") {
cout << 1 << endl;
} else if (s == "10") {
cout << 1 << endl;
} else if (s == "0") {
cout << 0 << endl;
} else if (s == "1") {
cout << 0 << endl;
} else {
long long sb = 0;
long long n = s.length();
for (long long i = 0; i < n; i++)
if (s[i] == '1') sb++;
long long ans = n / 2;
if (sb > 1 && n % 2) ans++;
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "0") {
printf("0\n");
return 0;
}
int ans = 1;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '1') {
ans += (s.length() - i - 1) / 2;
break;
}
}
if (s[0] == '1') {
int flg = 0;
for (int i = s.length() - 1; i >= 1; i--) {
if (s[i] == '1') {
flg = 1;
break;
}
}
if (!flg && (s.length() % 2)) {
ans--;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int f[107];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
int k = s.size();
int c = 0;
for (int i = 0; i <= k - 1; ++i) c += (s[i] == '1');
if (k == 1)
cout << 0;
else if (c == 1)
cout << k / 2;
else
cout << (k + 1) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int k;
int main() {
cin >> s;
for (int i = 0; i < s.length(); i++)
if (s[i] == '1') k++;
if (k > 1)
cout << (s.length() + 1) / 2 << endl;
else
cout << s.length() / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
string str;
cin >> str;
int size = str.size() - 1;
int n = size / 2;
if (size > (n * 2)) {
++n;
cout << n << endl;
return 0;
}
for (int i = str.size() - 1; i > 0; --i) {
if (str[i] == '1') {
++n;
cout << n << endl;
return 0;
}
}
cout << n << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int count = 0;
cin >> s;
long long int l;
l = s.size();
long long int i;
for (i = l - 1; i > 0; i--) {
if (s[i] == '1') {
count++;
break;
}
}
if (l % 2 == 1 && count == 0) {
cout << (l - 1) / 2 << endl;
} else if (l % 2 == 0 && count == 0) {
cout << l / 2 << endl;
} else if (l % 2 == 1 && count == 1) {
cout << (l - 1) / 2 + count << endl;
} else if (l % 2 == 0 && count == 1) {
cout << l / 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
bool is = 0;
for (int i = 1; i < len; ++i) {
if (s[i] == '1') is = 1;
}
if (is) {
cout << 1 + (len - 1) / 2 << endl;
} else {
if ((len - 1) % 2 == 0) {
cout << (len - 1) / 2 << endl;
} else {
cout << 1 + (len - 1) / 2 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int i, n, t;
string s;
cin >> s;
int l = s.length();
int ans = (l - 1) / 2 + 1;
int ok = 1;
for (i = 1; i < l; i++)
if (s[i] == '1') {
ok = 0;
break;
}
if (l % 2 == 1 && ok) ans--;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long int n = s.size();
n = n - 1;
long long int ans = 0;
long long int sum = 0;
for (int i = 0; s[i] != '\0'; i++) {
sum += s[i] - 48;
}
if (n == 0)
ans = 0;
else if (n % 2 == 0 && sum == 1)
ans = n / 2;
else
ans = n / 2 + 1;
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
string s;
int main() {
cin >> s;
int i = 1;
int n = s.length();
int fffff = 1;
int aa = 0;
for (int i = 1; i < n; i++) {
if (s[i] != '0') {
fffff = 0;
}
}
while (i <= n) {
aa++;
i += 2;
}
if (fffff == 1 && n % 2) aa--;
cout << aa << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
int a = 0;
for (int i = 1; i < n; i++) {
if (s[i] == '1') {
a = 1;
break;
}
}
if (a == 0) {
if (n % 2 == 1) {
cout << (n - 1) / 2 << endl;
} else {
cout << (n - 1) / 2 + 1 << endl;
}
} else {
if (n % 2 == 1) {
cout << n / 2 + 1 << endl;
} else {
cout << n / 2 << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int l = str.length();
str = str.substr(1, l - 1);
int flag = 0;
if (str.find('1') != str.npos) flag = 1;
if (flag == 1)
cout << (l - 1) / 2 + 1;
else
cout << (l) / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int ones = 0;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '1') ones++;
}
if (s == "0")
cout << 0;
else if (s.length() % 2 == 1 && ones == 1)
cout << s.length() / 2;
else if (s.length() % 2 == 1)
cout << s.length() / 2 + 1;
else
cout << s.length() / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.length();
if (s.length() < 3) {
if (s.length() == 1) {
cout << "0" << endl;
return 0;
}
cout << "1" << endl;
return 0;
}
int f = 0;
int i = s.length() - 1;
while (i >= 1) {
if (s[i] == '1') f = 1;
i--;
}
if (len % 2 == 0) f = 0;
cout << len / 2 + f << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool is_integer(long double k) { return std::floor(k) == k; }
int main() {
long long i, j = 0;
string s;
cin >> s;
if (s.length() == 1 && s[0] == '0') {
cout << 0;
return 0;
}
int c = 0;
for (i = (s.length() - 1); i >= 0; i--) {
if (s[i] == '1') {
c++;
}
}
if (c == 1) {
cout << floor(s.length() / 2.0);
} else {
cout << ceil(s.length() / 2.0);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int ck = 0;
for (int i = 1; i < l; i++) {
if (s[i] == '1') {
ck = 1;
break;
}
}
if (ck)
cout << (l + 1) / 2 << endl;
else
cout << l / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isprime(long long int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
vector<long long int> prime;
void sieve(long long int n) {
bool bakh[n + 1];
memset(bakh, true, sizeof(bakh));
for (long long int p = 2; p * p <= n; p++) {
if (bakh[p] == true) {
for (long long int i = p * p; i <= n; i += p) bakh[i] = false;
}
}
for (long long int p = 2; p <= n; p++)
if (bakh[p]) prime.push_back(p);
}
long long int eulertotient(long long int z) {
long long int fac = z;
for (long long int i = 0; prime[i] * prime[i] <= z; i++) {
if (z % prime[i] == 0) {
fac -= (fac / prime[i]);
while (z % prime[i] == 0) z /= prime[i];
}
}
if (z > 1) fac -= (fac / z);
return fac;
}
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long int gcd(long long int a, long long int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
long long int g = gcd(a, b);
long long int ans = (a * b) / g;
return ans;
}
long long int modInverse(long long int a, long long int m) {
long long int hvf = gcd(a, m);
if (hvf == 1) return power(a, m - 2, m);
return -1;
}
void multiply(long long int F[2][2], long long int M[2][2]) {
long long int x = F[0][0] * M[0][0] + F[0][1] * M[1][0];
long long int y = F[0][0] * M[0][1] + F[0][1] * M[1][1];
long long int z = F[1][0] * M[0][0] + F[1][1] * M[1][0];
long long int w = F[1][0] * M[0][1] + F[1][1] * M[1][1];
F[0][0] = x;
F[0][1] = y;
F[1][0] = z;
F[1][1] = w;
}
void powermat(long long int F[2][2], long long int n) {
if (n == 0 || n == 1) return;
long long int M[2][2] = {{1, 1}, {1, 0}};
powermat(F, n / 2);
multiply(F, F);
if (n % 2 != 0) multiply(F, M);
}
long long int fib(long long int n) {
long long int F[2][2] = {{1, 1}, {1, 0}};
if (n == 0) return 0;
powermat(F, n - 1);
return F[0][0];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
string st;
cin >> st;
long long int p = st.size();
bool flag = 0;
for (long long int i = 1; i < p; i++) {
if (st[i] == '1') flag = 1;
}
long long int ans = p / 2;
if (flag && p % 2 == 1) ans += 1;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int num = 0;
char s[110];
scanf("%s", s);
int len = strlen(s);
for (int i = 1; i < len; i++) {
if (s[i] == '1') num++;
}
if (len % 2 == 0)
printf("%d\n", len / 2);
else {
if (num)
printf("%d\n", len / 2 + 1);
else
printf("%d\n", len / 2);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
string s;
cin >> s;
int o = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
o++;
}
}
int ans = 0;
if (o > 1 || s.size() % 2 == 0) {
++ans;
}
ans = ans + (s.size() - 1) / 2;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char ch[110];
int ans, cnt;
int main() {
scanf("%s", ch + 1);
int len = strlen(ch + 1);
for (int i = 1; i <= len; i++) cnt += ch[i] - '0';
if (cnt == 0) {
puts("0");
return 0;
} else if (cnt == 1)
ans = len / 2;
else
ans = (len + 1) / 2;
printf("%d \n", ans);
return 0;
}
|
#include <bits/stdc++.h>
long long read() {
long long ret = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') ret = ret * 10 + c - '0', c = getchar();
return ret;
}
char S[105];
int main() {
scanf("%s", S + 1);
int L = strlen(S + 1), i;
bool flag = 0;
for (i = 2; i <= L; ++i)
if (S[i] != '0') flag = 1;
if (!flag && (L & 1))
printf("%d", L / 2);
else
printf("%d", (L + 1) / 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length(), c = 0;
for (int i = n - 1; i > 0; i--) {
if (s[i] == '1') c++;
}
if (n % 2 == 0) {
cout << n / 2;
} else if (c == 0)
cout << (n - 1) / 2;
else
cout << (n - 1) / 2 + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
if (s.size() == 1) {
cout << 0;
return 0;
}
reverse((s).begin(), (s).end());
long long ans = 0;
bool add = false;
for (int i = 0; i < s.size() - 1; ++i) {
if (s[i] == '1') add = true;
}
if (s.size() % 2 == 1) ans += add;
for (int i = 0; i < s.size() - 1; ++i) {
if (i % 2 == 0) ans++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int res = (s.length() - 1) / 2;
string s1 = s.substr(0, s.length() - 2 * res);
string s2 = s;
s2.erase(0, s1.length());
if (s1 == "1") {
if (count(s2.begin(), s2.end(), '1')) res++;
} else
res++;
if (s == "0") res = 0;
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long q = 239017;
const long long mod = 1e9 + 7;
const long long mod2 = 1e9 + 13;
const long long MAXN = 2e4 + 100;
const long long MAXM = 5e4 + 100;
void $main() {
string s;
cin >> s;
long long n = s.size(), ct = (n + 1) / 2;
bool fl = (s[0] == '1' && (n % 2));
for (long long i = 1; i < n; ++i) {
if (s[i] != '0') {
fl = 0;
break;
}
}
if (n == 1 && s[0] == '0')
cout << 0;
else
cout << ct - fl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
$main();
return 0;
}
|
#include <bits/stdc++.h>
namespace ZZ {}
using namespace ZZ;
using namespace std;
const int maxn = 200;
char s[maxn];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
int ans = (n - 1) / 2;
int fg = 0;
for (int i = 1; i <= n; i++) {
if ((n - i) != ((n - 1) / 2 * 2) && s[i] == '1') fg = 1;
}
printf("%d\n", ans + fg);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, d, e, f, g, h, i;
string A;
cin >> A;
b = 0;
c = A.length();
for (a = (A.length() - 1); a > 0; a--) {
if (A[a] == '1') {
b = 1;
break;
}
}
if (c % 2 == 0) {
d = c / 2;
} else {
if (b == 1) {
d = c / 2 + 1;
} else {
d = c / 2;
}
}
cout << d << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int i = 0;
if (s.size() == 0 && s == "0")
ans = 0;
else {
if (s.size() % 2 == 0) {
ans += (s.size()) / 2;
} else {
ans += (s.size()) / 2;
for (i = 1; i < s.size(); i++)
if (s[i] == '1') {
ans++;
break;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> letter[1000000];
long long len;
int main() {
ios_base::sync_with_stdio(0);
string s;
cin >> s;
string curr = "1";
int ans = 0;
while (s.length() > curr.length() ||
(s.length() == curr.length() && s > curr)) {
ans++, curr += "00";
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
template <class T>
int gmax(T &a, T b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
template <class T>
int gmin(T &a, T b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
int main() {
string s;
while (cin >> s) {
if (s == string("0")) {
printf("0\n");
continue;
}
int len = s.length();
int ans = (len + 1) / 2;
int cnt = 0;
for (int i = 0; i < len; ++i) {
if (s[i] == '1') cnt++;
}
if (cnt == 1 && len % 2 == 1) ans--;
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int i, flag = 0;
for (i = 1; i < a.size(); i++) {
if (a[i] == '1') {
flag = 1;
break;
}
}
i = (a.size()) / 2;
if (flag == 1 && a.size() % 2 == 1) i++;
cout << i;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sz = s.size();
if (sz % 2 == 0)
cout << sz / 2;
else {
for (int i = 1; i < sz; i++)
if (s[i] == '1') {
cout << sz / 2 + 1;
return 0;
}
cout << sz / 2;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 6;
bool choto(string &s1, string &s2) {
if (s1.size() < s2.size()) return true;
if (s1.size() > s2.size()) return false;
for (int i = 0; i < s1.size(); i++) {
if (s1[i] == '0' && s2[i] == '1') return true;
}
return false;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string str;
cin >> str;
int n = str.size();
string ss = "1";
int ans = 0;
while (choto(ss, str)) {
ss += "00";
ans++;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("-Ofast")
using namespace std;
const int mod = 1e7 + 7;
const long long INF = 1e18;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
bool isfound = false;
for (int i = 1; i < s.length(); i++) {
if (s[i] == '1') {
isfound = true;
break;
}
}
long long ans = s.length() - 1;
ans = ceil(double(ans) / 2.0);
if (isfound && (s.length() - 1) % 2 == 0) ans++;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long count = 0;
bool found = false;
count = (s.length() / 2) + (s.length() % 2);
if ((s.length() % 2)) {
for (int i = s.length() - 1; i > 0; i--) {
if (s[i] - 48) {
found = true;
}
}
count -= !found;
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int k = s.size();
for (string::iterator i = s.begin() + 1; i != s.end(); i++)
if (*i == '1') {
k++;
break;
}
printf("%d\n", k / 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
cin >> s;
long long int cnt1 = 0, l = s.length(), i;
for (i = 0; i < l; i++)
if (s[i] == '1') cnt1++;
if (l == 1 && s[0] == '0') {
cout << 0;
return;
}
if (cnt1 == 1)
cout << (l) / 2;
else
cout << (l + 1) / 2;
}
int main() {
long long int t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool islower(string a, string b) {
if (a.size() < b.size()) return 1;
if (a.size() > b.size()) return 0;
return (a < b);
}
int main() {
string s;
cin >> s;
string a = "1";
int ans = 0;
while (islower(a, s)) {
ans++;
a += "00";
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s;
vector<int> v1;
int kol1 = 0;
while (cin.get(s)) {
if (s != '\n') {
v1.push_back(s - '0');
if (s == '1') ++kol1;
}
}
int num4 = v1.size() / 2 + v1.size() % 2;
if (v1.size() % 2 == 1 && kol1 <= 1) {
--num4;
}
cout << num4;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = std::vector<int>;
using vll = std::vector<long long>;
using vull = std::vector<unsigned long long>;
void setIO(const std::string &name = "") {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
if (!name.empty()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
class Timer {
std::chrono::time_point<std::chrono::high_resolution_clock> m_beg;
public:
Timer() : m_beg(std::chrono::high_resolution_clock::now()) {}
void reset() { m_beg = std::chrono::high_resolution_clock::now(); }
[[nodiscard]] long double elapsed() const {
return std::chrono::duration_cast<
std::chrono::duration<long double, std::ratio<1>>>(
std::chrono::high_resolution_clock::now() - m_beg)
.count();
}
};
constexpr int MAXN = 1e9 + 1;
constexpr int MOD = 1000000007;
int main(int argc, char *argv[]) {
setIO();
string s;
cin >> s;
int j = s.size() / 2;
if (find(s.begin() + 1, s.end(), '1') != s.end() && (s.size() & 1)) j++;
cout << j;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
bool strict = 1;
for (int i = 1; i <= n - 1; i++)
if (s[i] == '1') {
strict = 0;
break;
}
if (!strict) n++;
cout << n / 2 << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
if (n > 1 && n % 2 == 1) {
bool ok = false;
for (int i = 1; i < n; i++)
if (s[i] == '1') ok = true;
cout << n / 2 + ok << endl;
} else {
cout << n / 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
while (cin >> str) {
int last1 = -1, cnt1s = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '1') {
if (last1 == -1) last1 = i;
cnt1s += 1;
}
}
if (cnt1s == 0) {
cout << 0 << "\n";
continue;
}
last1 = str.length() - last1 - 1;
if (last1 % 2 == 1) last1 += 1, cnt1s = 0;
last1 = last1 / 2;
if (cnt1s > 1) last1 += 1;
cout << last1 << "\n";
break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int cnt1 = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '1') {
cnt1 += 1;
}
}
if (cnt1 == 1)
ans = (s.size()) / 2;
else
ans = (s.size() - 1) / 2 + 1;
if (cnt1 == 0) ans = 0;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
void very_fast() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long binary_exponentation(long long a, long long b) {
long long ret = 1;
while (b) {
if (b & 1) ret = (ret * a) % mod;
b >>= 1;
a = (a * a) % mod;
}
return ret;
}
int32_t main() {
very_fast();
{
string s;
cin >> s;
long long cnt = 0;
long long n = s.length();
for (long long i = 0; i < n; i++) {
if (s[i] == '1') cnt++;
}
if (s.length() % 2 == 0)
cout << n / 2 << endl;
else {
if (cnt == 0)
cout << 0 << endl;
else if (cnt == 1)
cout << n / 2 << endl;
else
cout << (n / 2) + 1 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long maxx = 1000000007;
bool sortbyfir(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.first < b.first || (a.first == b.first && a.second < b.second));
}
long long inline power(long long a, long long b, long long p) {
a %= p;
long long ans = 1;
while (b > 0) {
if (b & 1) ans = ans * a % p;
a = a * a % p;
b >>= 1;
}
return ans;
}
long long inv(long long n, long long p) { return power(n, p - 2, p); }
inline vector<long long> allinv(long long n, long long p) {
vector<long long> arr(n);
arr[1] = 1;
for (long long i = (2); i < (n); i += 1) {
arr[i] = (p - (p / i) * arr[p % i] % p) % p;
}
return arr;
}
long long max3(long long a, long long b, long long c) {
return max(max(a, b), c);
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
bool inline isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
void prt(int i) { i ? cout << "YES\n" : cout << "NO\n"; }
long long getSum(long long n) {
long long sum = 0;
while (n != 0) {
sum = sum + n % 10;
n = n / 10;
}
return sum;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long test = 1;
while (test--) {
string s;
long long c = 0;
cin >> s;
long long n = s.size();
for (long long i = 0; i < n; i++) {
if (s[i] == '1') c++;
}
if (n % 2) {
if (c > 1) {
cout << ceil(double(n) / 2) << "\n";
continue;
}
cout << n / 2 << "\n";
continue;
}
cout << n / 2 << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int l = s.size();
for (int i = l - 1; i > 0; i--) {
if (s[i] == '1') {
l++;
break;
}
}
cout << l / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool miss(vector<bool>& a, int k) {
if (k + 1 & a[k]) {
for (int i = k + 1; i < a.size(); i++) {
if (a[i] == 1) return 1;
}
for (int i = k - 1; i >= 0; i--) {
if (a[i] == 1) return 1;
}
return 0;
} else {
for (int i = k + 1; i < a.size(); i++) {
if (a[i] == 1) return 1;
}
return 0;
}
}
int main() {
string a;
cin >> a;
vector<bool> num;
for (int i = a.length() - 1; i >= 0; i--) {
if (a[i] == '1')
num.push_back(1);
else
num.push_back(0);
}
int counter = 0;
for (int k = 0; 1; k += 2) {
if (k >= num.size())
break;
else if (miss(num, k))
counter++;
else
break;
}
cout << counter;
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
char minutes[150];
int n = 0;
scanf("%s", minutes);
int l = strlen(minutes);
for (int i = 0; i < l; i++) {
if (minutes[i] == (1 + '0')) n += 1;
if (n > 1) break;
}
if (n == 0)
printf("0");
else if (n == 1) {
if (l % 2 == 0)
printf("%d", l / 2);
else
printf("%d", (l - 1) / 2);
} else
printf("%d", (l + 1) / 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool f = false;
int len = s.size();
for (int i = 1; i < len; i++)
if (s[i] == '1') f = true;
if (len % 2 == 1 && f)
cout << len / 2 + 1 << endl;
else
cout << len / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long base, long long exp) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) res = (res * base);
base = (base * base);
exp /= 2;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
long long n = s.length();
long long n1 = n;
long long cnt = 0;
for (long long i = 0; i < n1; i++) {
if (s[i] == '1') {
cnt++;
}
}
if (cnt == 0) {
cout << 0 << "\n";
} else {
if (cnt == 1) {
n--;
}
if (n % 2 == 0) {
cout << n / 2 << "\n";
} else {
cout << (n / 2) + 1 << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() % 2 == 0) {
cout << s.size() / 2 << "\n";
return 0;
}
long long ok = 0;
for (unsigned long long i = 1; i < s.size(); i++) {
if (s[i] == '1') {
ok = 1;
break;
}
}
if (ok == 1) {
cout << s.size() / 2 + 1 << "\n";
}
if (ok == 0) {
cout << s.size() / 2 << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long ans;
long long l = s.length();
if (l % 2 == 0)
ans = l / 2;
else {
int one = 0, f = 0;
for (int i = 0; i < l; i++) {
if (s[i] == '1') one++;
if (one > 1) {
f = 1;
break;
}
}
if (f == 0) {
ans = l / 2;
} else
ans = l / 2 + 1;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string str;
cin >> str;
bool check = true;
int n = str.size();
for (int i = 1; i < n; i++)
if (str[i] != '0') check = false;
if (!check)
cout << (n + 1) / 2 << "\n";
else
cout << n / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int w = 0;
for (int i = 0; i < (int)s.length(); i++)
if (s[i] == '1') w++;
if ((int)s.length() == 1) {
cout << 0 << endl;
exit(0);
}
int ans = 1 + ((int)s.length() - 1) / 2;
if (((int)s.length() - 1) % 2 == 0 && w == 1) ans--;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int siz = s.size();
for (int i = 0; i < siz; i++) {
if (s[i] == '1') {
for (int x = i + 1; x < siz; x++)
if (s[x] == '1') {
cout << (siz + 1) / 2 << endl;
return 0;
}
cout << siz / 2;
return 0;
}
}
cout << siz / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 1) {
cout << "0";
} else {
int ocount = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '1') ocount++;
}
if (ocount == 1) {
cout << (s.size() / 2);
} else {
cout << (s.size() + 1) / 2;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, m = 0;
cin >> s;
n = s.size() - 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') m++;
}
if (m > 1)
cout << n / 2 + 1 << endl;
else
cout << (n + 1) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int M = 1e9 + 7;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
int o = 0;
if (s == "0") return cout << 0, 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') o++;
}
int k = int(s.size()) - 1;
int ans = k / 2;
if (o != 1 || k & 1) ans++;
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
bool com(string a, string b) {
if (a.size() == b.size()) {
return (a < b);
}
return (a.size() < b.size());
}
int main() {
string s;
cin >> s;
string curr = "1";
int ans = 0;
while (com(curr, s)) {
ans++;
curr = curr + "00";
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string b;
cin >> b;
int n = b.size() - 1, p = 0;
for (int i = 1; i < b.size(); i++)
if (b[i] == '1') {
p = 1;
break;
}
if (n % 2 != 0)
cout << (n / 2) + 1;
else {
if (p == 0)
cout << (n / 2);
else
cout << (n / 2) + 1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, a, b, c, ans, f, l, r;
char d;
int main() {
string s;
cin >> s;
if (s.length() % 2 == 0)
c = (s.length()) / 2;
else {
c = (s.length() - 1) / 2;
for (int i = 1; i < s.length(); ++i) {
if (s[i] == '1') {
c++;
break;
}
}
}
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int main() {
char s[110];
cin >> s;
int len = strlen(s);
int flag = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '1') flag++;
}
int tmp = len - 1;
int ans;
if (tmp % 2 == 0) {
ans = tmp / 2;
if (flag > 1) ans++;
} else {
ans = tmp / 2 + 1;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxx = 4e2 + 19;
string s;
int32_t main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> s;
long long n = s.size();
if (n % 2) {
long long one = 0;
for (auto i : s)
if (i == '1') one++;
if (one > 1)
cout << n / 2 + 1;
else
cout << n / 2;
} else
cout << n / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str1, str2 = "1";
cin >> str1;
int ans = 0;
int len = str1.size();
int len2 = str2.size();
if (str1 == "0") {
cout << 0 << endl;
return 0;
}
while (len2 <= len && str1 != str2) {
str2 += "00";
len2 = str2.size();
ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long bigmod(long long base, long long power, long long mod) {
if (power == 0)
return 1;
else if (power % 2 == 1) {
long long value1 = base % mod;
long long value2 = (bigmod(base, power - 1, mod)) % mod;
return (value1 * value2) % mod;
} else {
long long value1 = (bigmod(base, power / 2, mod)) % mod;
return (value1 * value1) % mod;
}
}
int main() {
string str;
cin >> str;
int SIZE = str.size();
for (int i = SIZE - 1; i > 0; i--) {
if (str[i] == '1') {
SIZE++;
break;
}
}
cout << SIZE / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string b;
cin >> b;
int c = 0;
for (int i = 1; i <= b.size(); i++) {
if (b[i] == '1') {
c = 1;
}
}
cout << (b.size() + c) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int i, cnt = 0;
cin >> s;
for (i = 0; i < s.size(); i++) {
if (s[i] == '1') cnt++;
}
if (cnt >= 2)
cout << (s.size() + 1) / 2 << endl;
else
cout << s.size() / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[150];
int main() {
scanf("%s", s);
int l1 = strlen(s);
int ans = (l1 - 1) / 2;
if (l1 % 2 == 0) {
ans++;
} else {
for (int i = 1; i < l1; i++) {
if (s[i] != '0') {
ans++;
break;
}
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
int main(int argc, char *argv[]) {
char minutes[102];
scanf("%s", minutes);
unsigned short nMissedTrains = 0;
unsigned long nDigits = strlen(minutes);
if (nDigits % 2 == 0) {
printf("%ld", (strlen(minutes) / 2));
return 0;
} else {
nMissedTrains = (strlen(minutes) / 2);
}
unsigned short nOnes, i;
nOnes = i = 0;
while (nOnes <= 1 && minutes[i] != '\0') {
if (minutes[i] == '1') nOnes++;
i++;
}
if (nOnes > 1) nMissedTrains++;
printf("%d", nMissedTrains);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string str;
unsigned long long int i;
unsigned long long int sum = 0;
int k = 0;
cin >> str;
unsigned long long int length = str.size();
for (i = length - 1; i > 0; i--) {
if (str[i] == '1') {
length++;
break;
}
}
cout << length / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[105];
int main() {
bool bo = 0;
int i, len;
cin >> str;
len = strlen(str);
for (i = 1; i <= len - 1; i++) bo |= str[i] == '1';
if (len == 1)
putchar('0');
else
cout << (--len >> 1) + (len & 1 ? 1 : bo);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char s[105], t[105];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
if (n % 2 == 0)
printf("%d\n", n / 2);
else {
int j;
for (j = 2; j <= n; j++)
if (s[j] != '0') break;
if (j != n + 1)
printf("%d\n", (n + 1) / 2);
else
printf("%d\n", n / 2);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
bool zero = true;
for (int i = 1; i < s.length(); i++) {
if (s[i] != '0') zero = false;
}
long long int n = s.length();
if (zero) {
if (n % 2 == 0) {
cout << n / 2 << "\n";
} else {
cout << (n + 1) / 2 - 1 << "\n";
}
} else {
if (n % 2 == 0) {
cout << n / 2 << "\n";
} else {
cout << (n + 1) / 2 << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string bits;
cin >> bits;
int l = bits.length();
if (!(l & 1)) {
cout << (l / 2);
return 0;
}
for (int i = l; i > 0; --i) {
if (bits[i] == '1') {
cout << ((l / 2) + 1);
return 0;
}
}
cout << (l / 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long base, long long exp) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) res = (res * base);
base = (base * base);
exp /= 2;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
long long n = s.length();
long long n1 = n;
long long cnt = 0;
for (long long i = 0; i < n1; i++) {
if (s[i] == '1') {
cnt++;
}
}
if (cnt <= 1) {
n--;
}
if (n % 2 == 0) {
cout << n / 2 << "\n";
} else {
cout << n / 2 + 1 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300000;
const long long INF = 1e18;
const int sqrtConst = 550;
const int alphabet = 26;
const long long mod = 998244353;
void solve() {
string s;
cin >> s;
bool has1 = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] == '1') {
has1 = true;
break;
}
}
int cnt = (s.size() + 1) / 2;
if (!has1 && (s.size() % 2)) cnt--;
cout << cnt;
}
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
cout << setprecision(6) << fixed;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
int i, j, k;
string s;
cin >> s;
for (i = 0; i < s.length(); i++) {
if (s[i] == '1') k++;
}
if (k > 1)
cout << (s.length() + 1) / 2;
else
cout << (s.length()) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size() - 1;
int ans = n / 2 + n % 2;
for (int i = 1; i <= n && !(n % 2); ++i) {
if (s[i] == '1') {
++ans;
break;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[110];
int main() {
cin >> s + 1;
int n = strlen(s + 1);
if (s[1] == '0') return cout << 0 << endl, 0;
int cnt = 0;
for (int i = n; i >= 1; i--) {
if (s[i] == '0')
cnt++;
else
break;
}
int ans = n / 2 + n % 2;
if (n % 2 == 1) {
if (cnt == n - 1) ans--;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool ok(string s) {
for (int i = 1; i < s.size(); i++) {
if (s[i] == '1') return false;
}
return true;
}
int main() {
string s;
cin >> s;
if (s.size() % 2 != 0 && ok(s)) {
cout << (s.size()) / 2 << endl;
} else {
cout << (s.size() + 1) / 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void action() {
string s;
cin >> s;
reverse(s.begin(), s.end());
long long c = 0, f = 0, j;
for (long long i = 0; i < s.length(); i++) {
if (s[i] == '1') {
f++;
}
if (i % 2 == 0) c++;
}
if (f > 1)
cout << c;
else {
if ((s.length()) % 2 == 0)
cout << c;
else
cout << c - 1;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
action();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long min(long long a, long long b) {
if (a > b) return b;
return a;
}
long long max(long long a, long long b) {
if (a > b) return a;
return b;
}
int32_t main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
long long count = 0;
long long prev1 = 0;
if (s.length() == 1) {
cout << "0";
return 0;
}
for (long long i = 0; i < s.length(); i++) {
if (i % 2 == 0) {
if (s[i] == '0') {
count++;
}
if (s[i] == '1') {
if (i == s.length() - 1) {
if (prev1) count++;
} else {
count++;
}
}
}
if (s[i] == '1') prev1 = 1;
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string st;
int main() {
cin >> st;
if (st == "1") {
puts("0");
return 0;
}
bool flg = 0;
for (int i = 1; i < st.size(); i++)
if (st[i] == '1') flg = 1;
int t = st.size() / 2;
if (st.size() % 2) t++;
if (flg)
cout << t << endl;
else
cout << st.size() / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int l, i;
char s[101];
scanf("%s", s);
l = strlen(s);
for (i = 1; i < l; i++)
if (s[i] == '1') {
l++;
break;
}
printf("%d\n", l / 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string st;
cin >> st;
long long dem = 0, cnt = 0;
for (int i = st.size() - 1; i >= 1; i -= 2) cnt++;
for (int i = st.size() - 1; i >= 1; i--)
if (st[i] == '1') {
dem++;
break;
}
if ((st.size() - 1) % 2 == 0)
cout << cnt + dem;
else
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
string s;
cin >> s;
int k = s.size();
int c = 0;
for (int i = 0; i < k; i++) {
if (s[i] == '1') c++;
}
if (c <= 1 || k % 2 == 0)
cout << k / 2 << endl;
else
cout << (k / 2 + 1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool is = false;
for (int i = 1; i < s.size(); i++)
if (s[i] == '1') is = true;
int ans = (s.size() + 1) / 2;
if (s.size() % 2 == 0)
cout << ans << endl;
else if (s.size() % 2 == 1 && is)
cout << ans << endl;
else
cout << ans - 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int cnt;
int main() {
cin >> s;
for (int i = 0; i < s.size(); i += 2) {
cnt++;
}
bool f = true;
for (int i = 1; i < s.size(); i++) {
if (s[i] != '0') {
f = false;
break;
}
}
if (f && s.size() % 2) cnt--;
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPow2(string src) {
for (long long i = 0; i < src.length(); i++) {
if (!i) continue;
if (src[i] != '0') return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string src;
cin >> src;
long long len = src.length();
long long ans = floor(double((len - 1) / 2)) + 1;
if (isPow2(src) && (len - 1) % 2 == 0) {
ans--;
}
cout << ans << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.