text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using llu = unsigned long long;
ll mod = 1e9 + 7;
ll mode = 998244353;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t, n, m, i, j, k, d;
cin >> n >> m;
ll a[n];
unordered_map<ll, ll> z;
for (i = 0; i < n; i++) cin >> a[i];
k = 0;
for (i = 0; i < n; i++) {
k += a[i];
ll ans = 0;
if (k > m) {
ll y = k;
for (j = 100; j >= 1; j--) {
if (z[j]) {
if (y - j * z[j] <= m) {
ans += (ceil((y - m) * (1.0) / j));
break;
} else {
ans += z[j];
y -= (j * z[j]);
}
}
}
}
cout << ans << " ";
z[a[i]]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> v;
priority_queue<int> h;
priority_queue<int, vector<int>, greater<int> > q;
int x = 0;
int ans = 0;
int c = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
x = x + t;
if (x <= m)
cout << ans << " ";
else {
int x1 = x - c;
if (q.empty() || q.top() >= h.top() || x1 - h.top() > m) {
while (h.empty() == false) {
if (x1 <= m) break;
ans++;
x1 -= h.top();
c += h.top();
q.push(h.top());
h.pop();
}
} else {
q.push(h.top());
x1 = x1 - h.top();
c += h.top();
h.pop();
ans++;
while (q.empty() == false) {
int x2;
x2 = x1 + q.top();
if (x2 <= m) {
x1 = x2;
ans -= 1;
c -= q.top();
h.push(q.top());
q.pop();
} else
break;
}
}
cout << ans << " ";
}
h.push(t);
}
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
const int INF = 0x3f3f3f3f;
using namespace std;
int n, t, m, arr[101], d;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> t;
for (int i = 0; i < n; ++i) {
cin >> d;
if (d <= t) {
t -= d;
arr[d]++;
cout << 0 << " ";
} else {
ll tmp = d - t;
int cnt = 0;
for (int i = 100; i; --i) {
if (tmp <= 0) {
break;
}
ll tmp2 = ((tmp + (i - 1)) / i);
cnt += min(tmp2, (ll)arr[i]);
tmp -= min(tmp2, (ll)arr[i]) * i;
}
cout << cnt << " ";
arr[d]++;
t -= d;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void ga(int N, int *A) {
for (int i(0); i < N; i++) scanf("%d", A + i);
}
int S, N, A[200005], M, F[101], T;
int main(void) {
scanf("%d%d", &N, &M), ga(N, A), S = 0;
for (int i(0); i < N; i++) {
T += A[i];
int I = 0, J = 100, t = T;
while (t > M) {
if (t - F[J] * J <= M) {
int a = (t - M) / J;
while (t - a * J > M) ++a;
t -= a * J, I += a;
} else
t -= F[J] * J, I += F[J];
--J;
}
printf("%d%c", I, i + 1 == N ? 10 : 32), ++F[A[i]];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mxn = 1e5 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t = 1;
while (t--) {
long long int i, j, k, n, m;
cin >> n >> m;
vector<long long int> t(n);
for (i = 0; i < n; i++) cin >> t[i];
long long int mp[101] = {0};
long long int s = 0;
long long int ans[n];
for (i = 0; i < n; i++) {
s += t[i];
long long int m1 = 0;
long long int tmp = s;
for (j = 100; j > 0 && tmp > m; j--)
if (mp[j]) {
if ((tmp - mp[j] * j) > m)
m1 += mp[j], tmp -= mp[j] * j;
else {
k = (tmp - m) / j;
if ((tmp - m) % j) k++;
m1 += k;
tmp -= k * j;
}
}
mp[t[i]]++;
ans[i] = m1;
}
for (auto i : ans) cout << i << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) return (gcd(b, a));
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
long long n, M, i, t, s = 0, c, z, l;
cin >> n >> M;
vector<long long> a(105, 0);
vector<long long> v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
vector<long long> p(n);
p[0] = 0;
p[1] = v[0];
for (i = 2; i < n; i++) {
p[i] = p[i - 1] + v[i - 1];
}
for (i = 0; i < n; i++) {
if ((p[i] + v[i]) <= M)
cout << 0 << " ";
else {
z = 100, l = (p[i] + v[i]), c = 0;
while (l > M) {
c = c + a[z];
l = l - z * a[z];
z--;
}
if (l == M)
cout << c << " ";
else {
c = c - (M - l) / (z + 1);
cout << c << " ";
}
}
a[v[i]]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
int t[n];
for (int i = 0; i < n; i++) {
cin >> t[i];
}
int cnt[101] = {}, res = 0;
for (int i = 0; i < n; i++) {
int now = 0, sum = t[i];
for (int j = 1; j <= 100; j++) {
int here = min((m - sum) / j, cnt[j]);
sum += here * j;
now += here;
}
cnt[t[i]]++;
cout << i - now << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = 1e6 + 5;
int a[MX];
int t[200];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += a[i];
int needsub = sum - m;
int ccc = 0;
for (int j = 100; j >= 1; j--) {
if (needsub <= 0) break;
int tt = j * t[j];
if (needsub > tt)
needsub -= tt, ccc += t[j];
else {
int zzz = needsub / j + (needsub % j != 0);
ccc += zzz;
break;
}
}
printf("%d ", ccc);
t[a[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
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 / gcd(a, b) * b; }
signed main(void) {
long long n, m;
cin >> n >> m;
vector<long long> a(n);
for (long long i = 0; i < (n); i++) cin >> a[i];
vector<long long> num(101, 0);
for (long long i = 0; i < (n); i++) {
long long sum = a[i];
long long k = 1, ans = 0;
while (k <= 100 && sum <= m) {
long long cnt = min((m - sum) / k, num[k]);
ans += cnt;
sum += num[k] * k;
k++;
}
cout << i - ans << " ";
num[a[i]]++;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
set<int> timeset;
int freq[101] = {0};
void fastscan(int &x) {
bool neg = false;
register int c;
x = 0;
c = getchar();
if (c == '-') {
neg = true;
c = getchar();
}
for (; (c > 47 && c < 58); c = getchar()) x = (x << 1) + (x << 3) + c - 48;
if (neg) x *= -1;
}
int test(int time, int sum) {
int count = 0;
int req = m - time;
while (sum > req) {
for (auto it = timeset.rbegin(); it != timeset.rend(); it++) {
int maxtime = *it;
int num = freq[*it];
if (sum - maxtime * num > req) {
sum = sum - maxtime * num;
count += num;
} else {
int num2 = ceil((1.0 * (sum - req)) / maxtime);
sum = sum - num2 * maxtime;
count += num2;
break;
}
}
}
return count;
}
int main(void) {
fastscan(n);
fastscan(m);
vector<int> ans(n);
int sum = 0;
for (int i = 0; i < n; i++) {
int time;
fastscan(time);
ans[i] = test(time, sum);
sum += time;
freq[time]++;
timeset.insert(time);
}
for (auto it : ans) cout << it << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a > b) swap(a, b);
if (a == 0) return b;
return gcd(b % a, a);
}
long long powerMod(long long x, long long y) {
long long res = 1;
x %= 998244353;
while (y > 0) {
if (y & 1) res = (res * x) % 998244353;
y = y >> 1;
x = (x * x) % 998244353;
}
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
;
map<long long, long long> mp;
set<long long, greater<long long> > s;
long long n, m, i, j, k, l, sum = 0;
cin >> n >> m;
long long a[n];
j = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
vector<long long> v;
while (sum > m) {
k = *(s.begin());
sum -= k;
mp[k]--;
if (!mp[k]) s.erase(s.begin());
j++;
v.emplace_back(k);
}
s.insert(a[i]);
mp[a[i]]++;
a[i] = j;
for (int i : v) {
sum += i;
s.insert(i);
mp[i]++;
}
j -= v.size();
while (sum > m) {
k = *(s.begin());
sum -= k;
mp[k]--;
if (!mp[k]) s.erase(s.begin());
j++;
}
}
for (i = 0; i < n; i++) cout << a[i] << " ";
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, el;
cin >> n >> m;
int freq[105] = {};
long long int cursum = 0;
for (int i = 0; i < n; i++) {
cin >> el;
cursum += el;
if (cursum <= m) {
freq[el]++;
cout << "0 ";
continue;
}
long long int temp = cursum - el;
long long int free = m - temp;
long long int ef = el - free;
long long int ans = 0;
for (int j = 100; j >= 1; j--) {
if (j * freq[j] <= ef) {
ef -= j * freq[j];
ans += freq[j];
} else {
int tim = ceil(double(ef) / j);
ans += tim;
break;
}
}
cout << ans << " ";
freq[el]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, M, sum, a[200005], h[101] = {0};
cin >> n >> M;
cin >> a[0];
sum = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
}
priority_queue<long long> q;
h[a[0]]++;
cout << "0 ";
for (int i = 1; i < n; i++) {
sum += a[i];
if (sum <= M) {
cout << "0 ";
h[a[i]]++;
continue;
}
long long req = sum - M;
long long c = 0;
for (int j = 100; req > 0 and j > 0; j--) {
if (h[j] * j <= req) {
c += h[j];
req -= h[j] * j;
} else {
if (req % j != 0) {
c += 1 + req / j;
req -= j * (1 + req / j);
} else {
c += req / j;
req -= j * (req / j);
}
}
}
cout << c << " ";
h[a[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 9;
const int mod = 1e9 + 7;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long a[200030], b[200030], c[200030];
int main() {
long long n, i, j, m, sum, k;
while (cin >> n >> m) {
priority_queue<long long, vector<long long>, less<long long>> que;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
sum = 0;
k = 0;
for (i = 0; i < n; i++) {
b[i] += k;
cin >> a[i];
if (sum + a[i] <= m) {
que.push(a[i]);
sum += a[i];
} else {
k++;
long long temp = sum, num = 0;
while (a[i] + temp > m) {
b[i]++;
c[num++] = que.top();
temp -= que.top();
que.pop();
}
while (num > 0) {
que.push(c[--num]);
}
if (a[i] < que.top()) {
sum -= que.top();
que.pop();
que.push(a[i]);
sum += a[i];
}
}
}
for (i = 0; i < n; i++) cout << b[i] << " ";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int a[n + 1];
int pre_sum[n + 1];
pre_sum[0] = 0;
set<pair<int, int>, greater<pair<int, int> > > s;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pre_sum[i] = pre_sum[i - 1] + a[i];
}
bool here_before = false;
auto prev_it = s.end();
int prev_ans = 0;
int prev_sum = 0;
for (int i = 1; i <= n; i++) {
if (pre_sum[i] <= m) {
cout << 0 << " ";
s.insert(make_pair(a[i], i));
} else {
if (here_before) {
for (int j = 1; j <= 300; j++) {
if (prev_it == s.begin()) {
prev_sum -= (prev_it->first);
prev_ans--;
break;
} else {
prev_sum -= (prev_it->first);
prev_ans--;
prev_it--;
}
}
if (prev_ans == 0) {
s.insert(make_pair(a[i - 1], i - 1));
prev_it = s.begin();
prev_ans = 0;
prev_sum = 0;
} else {
pair<int, int> val = (*prev_it);
if (make_pair(a[i - 1], i - 1) > val) {
prev_ans++;
prev_sum += a[i - 1];
}
s.insert(make_pair(a[i - 1], i - 1));
prev_it = s.find(val);
prev_it++;
}
int req = pre_sum[i] - m;
int ans = prev_sum;
if (ans >= req) {
cout << prev_ans << " ";
} else {
int cnt = prev_ans;
for (auto it = prev_it; it != s.end(); it++) {
cnt++;
ans += (it->first);
if (ans >= req) {
prev_sum = ans;
prev_it = it;
break;
}
}
prev_ans = cnt;
cout << cnt << " ";
}
} else {
int req = pre_sum[i] - m;
int ans = 0;
int cnt = 0;
for (auto it = s.begin(); it != s.end(); it++) {
cnt++;
ans += (it->first);
if (ans >= req) {
prev_sum = ans;
prev_it = it;
break;
}
}
cout << cnt << " ";
prev_ans = cnt;
here_before = true;
}
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
struct FenwickTree {
vector<Int> A;
FenwickTree(int n) : A(n) {}
Int sum(int i) {
Int sum = 0;
while (i > 0) sum += A[i], i -= ((i) & -(i));
return sum;
}
void add(int i, Int k) {
while (i < A.size()) A[i] += k, i += ((i) & -(i));
}
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> T(N);
for (auto &t : T) cin >> t;
vector<pair<int, int>> X;
for (int i = 0; i < N; i++) X.emplace_back(T[i], i);
sort(begin(X), end(X));
vector<int> I(N);
for (int i = 0; i < N; i++) I[X[i].second] = i + 1;
FenwickTree A(N + 1), B(N + 1);
for (int i = 0; i < N; i++) {
auto k = I[i];
auto limit = M - T[i];
int ok = 0, ng = N + 1;
while (ng - ok > 1) {
int mid = (ng + ok) / 2;
if (A.sum(mid) <= limit) {
ok = mid;
} else {
ng = mid;
}
}
cout << i - B.sum(ok) << ' ';
A.add(k, T[i]);
B.add(k, 1);
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = s.length();
int i = 0;
if (a % 2 == 0) {
cout << a / 2;
} else {
int count = 0, z = 0;
for (i = 1; i <= 99; i += 2) {
z++;
if (a == i) {
for (int j = 1; j < a; j++) {
if (s[j] == '0') {
count++;
}
}
if (count == a - 1) {
cout << z - 1;
break;
} else {
cout << z;
break;
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e = 0, n, i, j, k;
char s[1000];
scanf("%s", s);
n = strlen(s);
for (i = 1; i < n; i++) {
if (s[i] == '1') {
e++;
}
}
if (n % 2 == 0) {
a = n / 2;
} else {
a = n / 2 + 1;
if (e == 0) {
a--;
}
}
printf("%d", a);
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int32_t main() {
fastio();
string s;
cin >> s;
long long n = s.length(), ans = 0, ct = 0;
if (n == 1) {
cout << 0;
return 0;
}
if (n % 2 == 0)
cout << n / 2;
else {
long long fg = 0;
ans = (n + 1) / 2;
for (long long i = 1; i < n; i++) {
if (s[i] == '1') {
fg = 1;
break;
}
}
if (fg == 0) ans--;
cout << ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int req = n / 2;
if (!(n & 1)) {
cout << req << "\n";
return 0;
}
int cnt = 0;
for (int i = 1; i < n; ++i) {
cnt += (s[i] == '1') ? 1 : 0;
if (cnt > 0) break;
}
if (cnt > 0)
cout << req + 1 << "\n";
else
cout << req << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(NULL);
string s;
cin >> s;
int as = s.size() - 1, t;
t = as / 2 + 1;
if (as % 2 != 0)
cout << t;
else {
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
cnt++;
if (cnt >= 2) break;
}
}
if (cnt >= 2)
cout << t;
else
cout << t - 1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int x = 0, n, p = 0, i, j;
string s;
cin >> s;
n = s.length();
for (i = n - 1, j = 0; i >= 0; i--, j++) {
if (j % 2 == 0) {
x++;
}
if (s[i] == '1' && i != 0) {
p++;
}
}
if (p == 0 && n % 2 == 1) {
cout << x - 1;
} else {
cout << x;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "0") {
cout << 0;
return 0;
}
long long x = 0;
for (auto c : s)
if (c == '1') x++;
int ans = (s.size() - 1) / 2 + 1;
if (x == 1 && (s.size() - 1) % 2 == 0) ans--;
cout << ans;
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';
cout << (--len >> 1) + (len & 1 ? 1 : bo);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long int flag = 0;
long long int msb = s.length();
long long int ans;
for (long long int i = 1; i < msb; i++) {
if (s[i] == '1') {
flag = 1;
break;
}
}
if (msb % 2 != 0) {
if (flag)
ans = (msb + 1) / 2;
else
ans = (msb - 1) / 2;
} else
ans = msb / 2;
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "0")
cout << 0;
else {
long long int c = 0;
for (long long int i = 0; i < s.size(); i++) {
if (s[i] == '0') c++;
}
if (s.size() % 2 == 1) {
cout << s.size() / 2 + s.size() % 2 - (c == s.size() - 1);
} else
cout << s.size() / 2;
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(int lhs, int rhs) { return abs(lhs) < abs(rhs); }
int main() {
string s;
cin >> s;
int n = s.length(), i;
if ((n - 1) % 2 == 1) {
cout << (n - 1) / 2 + 1;
} else {
for (i = 1; i < n; i++) {
if (s[i] == '1') break;
}
if (i == n) {
cout << (n - 1) / 2;
} else {
cout << (n - 1) / 2 + 1;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long n, i, j = 0, k;
for (i = 1; i < s.size(); i++) {
if (s[i] == '1') {
j = 1;
break;
}
}
if (s.size() == 0 || s.size() == 1) {
cout << 0 << endl;
return 0;
} else if (s.size() == 2) {
cout << 1 << endl;
return 0;
}
k = s.size() - 1;
if (k % 2 != 0) {
cout << (k / 2) + 1 << endl;
return 0;
}
if (j == 1)
cout << (k / 2) + 1 << endl;
else
cout << k / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
float pow = (float)(s.length() - 1) / 2;
int ans;
if (pow - int(pow) > 0)
ans = pow + 1;
else
ans = pow;
for (int i = 1; s[i] != '\0'; i++) {
if (s[i] == '1') {
ans = pow + 1;
break;
}
}
cout << ans << endl;
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 if (len < 3)
putchar('1');
else {
len -= 3;
if (len & 1)
cout << (len >> 1) + 2;
else
cout << (len >> 1) + bo + 1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string inp;
int lpos = -1, oc = 0;
cin >> inp;
for (int i = 0; i < inp.size(); i++) {
if (inp[i] == '1') {
if (lpos == -1) lpos = inp.size() - i - 1;
oc++;
}
}
int c = 0, s = 0;
while (true) {
if (s > lpos)
break;
else if (s == lpos) {
if (oc > 1) c++;
break;
} else {
c++;
s += 2;
}
}
cout << c << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, ans;
string s;
cin >> s;
x = s.size();
for (int i = 1; i < x; i++) {
if (s[i] == '1') {
x++;
break;
}
}
cout << x / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long n = 0;
int flag = 0;
for (int i = s.length() - 1; i > 0; i--) {
if (s[i] == '1' && i > 0) flag = 1;
n++;
}
int ans = (n + 1) / 2;
if (flag == 1 && n % 2 == 0) ans++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char ch[1000];
scanf("%s", ch);
int n = strlen(ch);
int c = 0;
for (int i = 0; i < n; i++)
if (ch[i] == '1') c++;
if (c > 1)
cout << (n + 1) / 2 << endl;
else
cout << n / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 300 * 1000 + 7;
const long long MOD = 998244353;
const double PI = 2 * acos(0.0);
long long ans = 0;
string c;
int main(void) {
cin >> c;
long long n = c.size();
bool gg = true;
for (long long i0 = 1; i0 < n; i0++) {
if (c[i0] == '1') {
gg = false;
break;
}
}
ans = ((c.size() - 1) / 2) + 1;
if (gg && n % 2 == 1)
cout << n / 2 << endl;
else
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
const int MAXN = 100100;
char s[MAXN];
int main() {
scanf("%s", s);
int len = strlen(s), flag = 0;
for (int i = 1; i < len; ++i)
if (s[i] == '1') flag = 1;
printf("%d\n", (len + flag) >> 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long int i, ans;
if (s.size() % 2 == 1) {
ans = s.size() / 2;
for (i = 1; i < s.size(); i++) {
if (s[i] == '1') {
ans++;
break;
}
}
cout << ans << endl;
} else {
ans = 1 + ((s.size() - 1) / 2);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int res;
bool ok = 0;
int main() {
cin >> s;
for (int i = 1; i < s.length(); i++)
if (s[i] == '1') {
ok = 1;
break;
}
res = (s.length()) / 2;
if ((s.length() - 1) % 2 == 0 && ok) res++;
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1000005];
int maximumDifferenceSum(int arr[], int N) {
int dp[N][2];
for (int i = 0; i < N; i++) dp[i][0] = dp[i][1] = 0;
for (int i = 0; i < (N - 1); i++) {
dp[i + 1][0] = max(dp[i][0], dp[i][1] + abs(1 - arr[i]));
dp[i + 1][1] = max(dp[i][0] + abs(arr[i + 1] - 1),
dp[i][1] + abs(arr[i + 1] - arr[i]));
}
return max(dp[N - 1][0], dp[N - 1][1]);
}
int fact[1000010];
int mult(int n, int m) {
return ((n % 998244353) * (m % 998244353)) % 998244353;
}
int sub(int n, int m) {
return ((n % 998244353) - (m % 998244353) + 998244353) % 998244353;
}
void factorial() {
fact[0] = 1;
int i = 1;
while (i <= 1000010) {
fact[i] = ((fact[i - 1] % 998244353) * (i) % 998244353) % 998244353;
i++;
}
}
int fastpow(int n, int r) {
if (r == 0) return 1;
if (r == 1) return n;
int hr = fastpow(n, r / 2);
if (r & 1)
return (((hr * hr) % 998244353) * n) % 998244353;
else
return (hr * hr) % 998244353;
}
int inv(int n) { return fastpow(n, 998244353 - 2); }
int mat[1001][1001], b[1001][1001];
int main() {
string s;
cin >> s;
int cnt = 0;
reverse(s.begin(), s.end());
for (int i = 0; i < s.size(); i += 2) cnt++;
if (s.size() & 1) {
bool flag = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == '1') {
flag = 1;
break;
}
}
if (!flag) cnt--;
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string a;
cin >> a;
int c = 0, i;
double l;
l = a.size();
for (i = 1; i < l; i++) {
if (a[i] == '1') {
c = 1;
break;
}
}
if (c == 1)
cout << ceil(l / 2);
else
cout << ceil((l - 1) / 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double pi = acos(-1);
void Open() {}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
void PrintNumber(int n, int len) {
if (!len) return;
PrintNumber(n >> 1, len - 1);
cout << (n & 1);
}
void PrintAllSubset(int n) {
for (int i = 0; i < (1 << n); i++) {
PrintNumber(i, n);
cout << "\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string a;
cin >> a;
if (a[0] == '0') {
cout << 0;
return 0;
}
string y = "1";
int m = 0;
while (y.size() <= a.size()) {
if (y < a) m++;
y += "00";
}
cout << m;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
if (s.size() % 2 == 0) {
cout << (s.size() / 2) << endl;
} else {
if (s.size() == 1)
cout << 0 << endl;
else {
for (int i = 1; i < s.size(); i++) {
if (s[i] == '1') cnt++;
}
if (cnt > 0)
cout << (s.size() / 2) + 1 << endl;
else
cout << s.size() / 2 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l, flag = 0;
l = s.size();
int ans;
ans = (l - 1) / 2;
for (int i = 1; i < l; i++) {
int j = s[i];
if (j != 48) flag = 1;
}
if (flag == 0) {
if ((l % 2) == 1)
cout << ans;
else
cout << ans + 1;
} else
cout << ans + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int o, z;
int main() {
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '1')
o++;
else
z++;
}
o--;
if (o > 0)
cout << (s.size() - 1) / 2 + 1 << endl;
else
cout << (s.size() - 1) / 2 + (s.size() % 2 == 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string str;
cin >> str;
int n = str.size();
bool oneFound = false;
int idx = 0;
int ans = 0;
for (int i = n - 1; i > 0; i--) {
if (idx % 2 == 0) ans++;
idx++;
if (str[i] == '1') oneFound = true;
}
if (idx % 2 == 0 && oneFound) ans++;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int t = 0;
if (s.size() == 1) {
cout << 0;
return 0;
}
for (int i = 0; i < s.size(); i++)
if (s[i] == '1') t++;
int k = 0;
if (t >= 2) {
k = s.size();
} else {
k = s.size() - 1;
}
if (k % 2 == 1)
cout << k / 2 + 1 << endl;
else
cout << k / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int m = s.length();
int x = (m - 1) / 2;
int flag = 0;
for (int i = 1; i < m; i++) {
if (s[i] == '1') {
flag = 1;
break;
}
}
if (flag || (m - 1) % 2) x++;
cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxN = 1e5 + 123;
long long n;
string sss;
int32_t main() {
cin >> sss;
n = sss.size();
bool b = false;
for (long long i = 1; i < n; i++) {
if (sss[i] == '1') b = true;
}
if (b) n++;
cout << n / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string t;
cin >> t;
int sol = (t.size()) / 2;
bool one = false;
for (int i = 1; i < t.size(); i++) {
if (t[i] == '1') {
one = 1;
}
}
if (one && (t.size() - 1) % 2 == 0) {
sol++;
}
cout << sol << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
if (str.size() == 1 && (str[0] == '0' || str[0] == '1')) {
printf("0\n");
return 0;
}
if (str.size() <= 2) {
printf("1\n");
return 0;
}
int len = 1;
len += (str.size() - 1) / 2;
int n = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == '1') n++;
}
if (n == 1 && str.size() % 2 == 1) len--;
printf("%d\n", len);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
string s;
cin >> s;
int n = ((int)(s).size()), cnt = 0;
bool one = false;
for (auto i = 1; i <= (n - 1); ++i) {
if (s[i] == '1') {
one = true;
break;
}
}
if (one)
cout << ceil((double)n / 2.0);
else
cout << ceil((double)(n - 1) / 2.0);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool check = false;
int last = -1, cnts = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
if (last == -1) last = i;
cnts++;
}
}
if (cnts == 0) {
cout << 0 << endl;
check = true;
}
if (!check) {
last = s.size() - last - 1;
if (last % 2 == 1) {
last++;
cnts = 0;
}
last = last / 2;
if (cnts > 1) last++;
cout << last << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
cin >> s;
int n = s.size();
bool f = 0;
for (int i = 1; i < n; i++) {
if (s[i] == '1') {
f = 1;
break;
}
}
if (!f) {
if (s.size() % 2 == 1)
cout << (s.size() - 1) / 2;
else {
cout << (s.size() - 1) / 2 + 1;
}
} else {
cout << (s.size() - 1) / 2 + 1;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
string a;
cin >> a;
int b = -1, c = 0;
for (int i = 0; i < a.length(); i++) {
if (a[i] == '1' && b == -1) {
b = a.length() - i - 1;
} else if (a[i] == '1') {
c = 1;
}
}
if ((b % 2 != 0 || c != 0) && b != -1) {
b = b / 2;
b++;
} else {
b = b / 2;
}
cout << b;
return 0;
}
|
#include <bits/stdc++.h>
char s[105];
int main() {
scanf("%s", s);
int k = 0, l = 0;
long long sum = 0;
bool flag = false;
for (int i = strlen(s) - 1; i >= 0; i--) {
if (s[i] == '1' && i != 0) flag = true;
if (k == l && i != 0) {
sum++;
l += 2;
}
if (i == 0 && k == l && flag == true) sum++;
k++;
}
printf("%lld\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
;
string s;
cin >> s;
if (s == "0") {
cout << 0 << '\n';
return 0;
}
int ans = 0, ct = 0;
for (char c : s) ct += c - '0';
for (int i = 0; i < 55; i++) {
int j = i * 2;
if (s.size() > j + 1) {
ans++;
} else if (s.size() == j + 1 && ct != 1) {
ans++;
} else {
break;
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, a[100005], dis[125], vis[125];
set<pair<long long, long long> > edges;
vector<pair<long long, long long> > e;
vector<long long> adj[125];
map<long long, long long> m;
int main() {
string s;
cin >> s;
int ans = s.size();
if (s == "0") {
cout << 0;
return 0;
}
if (ans & 1) {
bool flag = 1;
for (int i = 1; i < s.size(); i++)
if (s[i] == '1') flag = 0;
if (flag)
cout << ans / 2;
else
cout << ans / 2 + 1;
return 0;
}
cout << ans / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
string s;
cin >> s;
int n = s.length();
int c = (n + 1) / 2;
int f = 0;
for (int i = 0; i < n; i++)
if (s[i] == '1') f++;
if (s == "0")
cout << "0";
else if (f == 1 && n % 2 == 1)
cout << c - 1;
else
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int t = (s.size() - 1) / 2 + 1;
bool ok = 1;
if (s.size() % 2 == 1) {
for (int i = 1; i < s.size(); i++)
if (s[i] == '1') {
ok = 0;
}
} else
ok = 0;
cout << t - ok;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
string a;
cin >> a;
long long int i, ans;
if (a.size() % 2 == 0) {
ans = a.size() / 2;
} else {
ans = (a.size() - 1) / 2;
for (i = 1; i < a.size(); i++) {
if (a[i] == '1') {
ans++;
break;
}
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int t;
solve();
return 0;
}
|
#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;
long long int len = s.length();
long long int cnt = 0;
for (long long int i = 0; i < len; ++i) {
if (s[i] == '1') {
cnt++;
}
}
long long int pw = len - 1;
long long int ans = 0;
if (cnt >= 1) {
ans = pw / 2;
ans++;
}
if (cnt == 1) {
if (pw % 2 == 0) {
ans--;
}
}
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 s;
cin >> s;
if (s == "0") {
cout << 0 << endl;
return 0;
}
if (s == "10") {
cout << 1 << endl;
return 0;
}
int cnt = 0;
for (auto e : s) {
if (e == '0') cnt++;
}
if (cnt == (int)s.size() - 1) {
if (cnt % 2 == 0)
cout << s.size() / 2 << endl;
else
cout << (cnt / 2) + 1 << endl;
} else {
cout << ((s.size() - 1) / 2) + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, count = 0, count2 = 0, index;
string str;
cin >> str;
reverse(str.begin(), str.end());
for (i = 0; i < str.length(); i++) {
if (str[i] == '1') count2++;
if (str[i] == '1') {
if (i % 2 == 0)
count = i / 2;
else
count = ceil(i * 1.0 / 2);
index = i;
}
}
if (count2 > 1 && index % 2 == 0) count++;
cout << count;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 100;
const int mod = 1e9 + 7;
int main() {
string s;
cin >> s;
int k = s.size();
int flag = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] == '1') {
flag = 1;
break;
}
}
int ans = (k + 1) / 2;
if (!flag && k % 2 != 0) ans--;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[200];
scanf("%s", a);
int l = strlen(a);
int sum = 0;
for (int i = 1; i < l; i++) {
if (a[i] == '1') {
sum++;
}
}
if (sum > 0 && l % 2 == 0) {
printf("%d", l / 2);
}
if (sum > 0 && l % 2 == 1) {
printf("%d", l / 2 + 1);
}
if (sum == 0 && l % 2 == 0) {
printf("%d", l / 2);
}
if (sum == 0 && l % 2 == 1) {
printf("%d", l / 2);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[200005];
int main() {
scanf("%s", s + 1);
int ok = 0;
int l = strlen(s + 1);
for (int i = 2; i <= l; i++)
if (s[i] == '1') ok = 1;
int ans = 0;
for (int i = l; i > 1; i -= 2) ans++;
if (l % 2 && ok) ans++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int p = (l + 1) / 2;
if (l % 2 == 1) {
for (int i = 1; i < l; i++) {
if (s[i] == '1')
break;
else if (i == l - 1) {
p--;
}
}
}
if (l == 1 && p == 1) {
cout << "0";
return 0;
}
cout << p;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(17);
string s;
cin >> s;
int ans = (((int)((s).size())) + 1) / 2;
if (((int)((s).size())) % 2) {
int ok = 0;
for (int i = 0; i < (((int)((s).size())) - 1); i++)
if (s[i + 1] == '1') ok = 1;
if (!ok) ans--;
}
cout << ans << endl;
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename T1>
T amax(T& a, T1 b) {
if (b > a) a = b;
return a;
}
template <typename T, typename T1>
T amin(T& a, T1 b) {
if (b < a) a = b;
return a;
}
const long long N = 200005, INF = 2000000000000000000;
void solve() {
string s;
cin >> s;
long long i = 0;
long long ans = 0;
long long f = 0, l = 0;
f = s.find_first_of('1');
l = s.find_last_of('1');
if (f == l) {
if (s.length() & 1) {
cout << (s.length() - 1) / 2;
return;
}
cout << (s.length()) / 2;
} else {
cout << (s.length() + 1) / 2;
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
unsigned long long count = s.length();
bool f = false;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '1' && i != 0) {
f = true;
break;
}
}
if (!f) {
count--;
cout << ((count % 2 == 0) ? (count / 2) : (count / 2 + 1));
} else {
cout << ((count % 2 == 0) ? (count / 2) : (count / 2 + 1));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mult_mod(long long x, long long y, long long mod) {
return (x * y - (long long)(x / (long double)mod * y + 1e-3) * mod + mod) %
mod;
}
long long pow_mod(long long a, long long b, long long p) {
long long res = 1;
while (b) {
if (b & 1) res = mult_mod(res, a, p);
a = mult_mod(a, a, p);
b >>= 1;
}
return res % p;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
int len = s.length();
if (len % 2 == 0) {
cout << len / 2 << "\n";
return 0;
}
bool flag = false;
for (int i = 1; i < len; i++)
if (s[i] == '1') flag = true;
if (flag)
cout << len / 2 + 1 << "\n";
else
cout << len / 2 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int caseno = 0;
bool sortbysec(pair<int, int> a, pair<int, int> b) {
return a.second > b.second;
}
long long gc(long long a, long long b) {
while (b) {
long long x = a % b;
a = b;
b = x;
}
return a;
}
long long lc(long long a, long long b) { return a / gc(a, b) * b; }
const int primemod = 1000003;
const long double eps = 1e-9;
int T;
int main() {
string a;
cin >> a;
int cnt = 0, index = 0, m = 0;
bool d = 1;
reverse(a.begin(), a.end());
for (int i = 0; i < a.size(); i++) {
if (a[i] == '1') {
index = i;
}
if (a[i] == '1') cnt++;
}
if (!cnt) m = 0;
m = index / 2;
if (index % 2 == 0 && cnt > 1) m++;
if (index % 2) m++;
cout << m << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string str;
cin >> str;
long long ans = -1;
for (long long i = 1; i < str.length(); i++)
if (str[i] == '1') ans = 0;
if (ans == -1 && str.length() % 2 == 0) ans = 0;
ans = ans + (str.length() + 1) / 2;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class ABowWowAndTheTimetable {
public:
int N;
string S;
void input(std::istream& in, std::ostream& out) {
ios_base::sync_with_stdio(false);
in >> S;
N = (int)(S).size();
}
void solve(std::istream& in, std::ostream& out) {
input(in, out);
int d = 0;
for (int(i) = (1); (i) < (N - 1 + 1); ++(i))
if (S[i] == '1') d = 1;
if (d == 0 and N % 2 == 0) d++;
out << (N - 1) / 2 + d << '\n';
}
};
int main() {
ABowWowAndTheTimetable solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, ans = 0;
string s;
cin >> s;
if (s[0] == '0') ans = (s.size() / 2);
if (s.size() % 2 == 0)
ans = (s.size() / 2);
else {
for (i = 1; i < s.size(); i++) {
if (s[i] == '0')
ans = s.size() / 2;
else {
ans = (s.size() / 2) + 1;
break;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxm = 1e5 + 5;
const int maxn = 1e4 + 5;
char s[10005];
int main() {
cin >> s;
int ans = 0;
int h = strlen(s);
if (h == 1) {
puts("0");
return 0;
}
int f = 0;
for (int i = h - 1; i > 0; i--)
if (s[i] == '1') f = 1;
for (int i = h - 1; i > 0; i -= 2) {
ans++;
}
if (f && (h - 1) % 2 == 0) ans++;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
bool check() {
for (long long i = s.length() - 1; i > 0; i--) {
if (s[i] == '1') return 1;
}
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long i, j, n;
cin >> s;
for (i = 0; i < s.length(); i++) {
if (s[i] == '1') break;
}
s = s.substr(i, s.length() - i);
n = s.length();
long long cnt = 0;
for (i = n - 1; i >= 0; i--) {
if ((n - i - 1) % 2 == 0 and (i || check())) cnt++;
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k = 0, l;
string s;
cin >> s;
l = s.length();
for (n = 0; n < s.length(); n++) {
if (s[n] == '1') k++;
}
if (k > 1 && l % 2 == 0)
cout << (l) / 2;
else if (k > 1)
cout << (l + 2) / 2;
else if (l % 2 == 0)
cout << (l) / 2;
else
cout << (l - 1) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
signed main() {
cin >> s;
int k = 0;
for (int i = 1; i < s.length(); i++) {
if (s[i] == '1') {
k = 1;
}
}
cout << (s.length() + k) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
bool firstOne = false, secondOne = false;
int noOfZeros = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
if (!firstOne)
firstOne = true;
else
secondOne = true;
}
}
int sure = (s.size()) / 2;
if (secondOne && (s.size() % 2)) sure++;
cout << sure << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long size, sz, count = 0;
size = s.size();
sz = floor(size) / 2;
if (size % 2 == 0) {
cout << sz << endl;
return 0;
}
for (long long i = 1; s[i]; i++) {
if (s[i] == '1') count++;
}
if (count > 0) {
count = 1;
}
long long ans = count + sz;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
if (str.size() == 1) {
cout << 0;
return 0;
}
int cnt = 0;
int j = 0;
bool flag = false;
for (int i = str.size() - 1; i >= 0; i--) {
if (j % 2 == 0) {
cnt++;
}
if (str[i] == '1' && i != 0) flag = true;
j++;
}
j--;
if (j % 2 == 0 && str[0] == '1' && flag == false) cnt--;
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int count = 0;
for (int i = s.size() - 1; i > 0; i--) {
if (s[i] == '1') count = 1;
}
if (count == 0)
count += (s.size() - 1) / 2 + (s.size() - 1) % 2;
else
count += (s.size() - 1) / 2;
cout << count << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<int, int>, vector<pair<int, int> >,
greater<pair<int, int> > >
que;
stringstream ssin;
const long long LINF = 0x7fffffffffffffffll;
const int N = 4e5 + 5, M = 4e5 + 5, mod = 1e9 + 7, INF = 0x3f3f3f3f;
char s[500];
int len;
inline long long read() {
char c = getchar();
long long x = 0, f = 1;
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
int main() {
scanf("%s", s);
len = strlen(s);
reverse(s, s + len);
int ans = 0;
int flag = 0;
int cnt = 0;
for (int i = 0; i < len; ++i) {
if (s[i] == '1') {
ans = i;
}
}
if (ans & 1) {
cout << (ans + 1) / 2 << '\n';
} else {
cnt = ans / 2;
for (int i = ans - 1; i >= 0; --i) {
if (s[i] == '1') {
cnt++;
break;
}
}
cout << cnt << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
float l = s.length();
int o = 0;
for (int i = 0; i < l; i++) {
if (s[i] == '1') o++;
}
if (o > 1)
cout << ceil(l / 2);
else
cout << ceil((l - 1) / 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;
long long n = s.size();
long long cnt = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '1') cnt++;
}
if (s == "0")
cout << "0";
else if (cnt < 2) {
cout << n / 2;
} else if (cnt >= 2) {
cout << (n + 1) / 2;
} else {
cout << n;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0, count1 = 0;
int n = s.size();
if (n % 2 == 0) {
for (int i = 0; i < n; i++) {
if (s[i] == '1')
count++;
else
count1++;
}
cout << n / 2;
} else {
for (int i = 0; i < n; i++) {
if (s[i] == '1')
count++;
else
count1++;
}
if (count <= 1)
cout << n / 2;
else
cout << (n / 2) + 1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
string s;
cin >> s;
n = s.length();
for (int i = 0; i < n; i++) {
sum += s[i] - '0';
}
if (sum == 0) {
cout << 0 << endl;
} else if (sum == 1) {
cout << n / 2 << endl;
} else {
cout << (n + 1) / 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
for (int i = 1; i < n; ++i) {
if (s[i] != '0') {
n++;
break;
}
}
cout << n / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int cnt = s.size() / 2;
if (s.size() & 1)
for (int i = 1; i < s.size(); i++)
if (s[i] == '1') {
cnt++;
break;
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 10;
int a[mx], ans = 0;
long long sum;
string s;
int main() {
cin >> s;
int p = 0;
int len = s.size();
for (int i = 1; i < len; i++) {
if (s[i] == '1') p = 1;
}
if (p == 1 || len % 2 == 0)
cout << (len - 1) / 2 + 1 << endl;
else
cout << (len - 1) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int cases = 1;
for (long long int i = 0; i <= cases - 1; i++) {
string s;
cin >> s;
long long int l = s.length(), f = 0;
if (l % 2 == 1) {
for (long long int i = 1; i <= s.length() - 1; i++) {
if (s[i] == '1') {
f = 1;
break;
}
}
if (f)
cout << (l + 1) / 2 << "\n";
else
cout << (l - 1) / 2 << "\n";
} else
cout << l / 2 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long c = 0;
for (long long i = 0; i < s.length(); i++) {
if (s[i] == '1') {
c++;
}
}
if (s == "0") {
cout << "0";
} else if (c == 1) {
if (s.length() % 2 == 1) {
cout << (s.length() - 1) / 2;
} else {
cout << (s.length() / 2);
}
} else {
long long cnt = 0;
for (long long i = s.length() - 1; i >= 0; i -= 2) {
cnt++;
}
cout << cnt;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long t;
char str[1000005];
int main() {
long long a, b, c = 0, i, j;
cin >> str;
a = strlen(str);
for (i = 1; i < a; i++)
if (str[i] == '1') c = 1;
a--;
b = a / 2;
if (a % 2 != 0)
b++;
else if (c == 1)
b++;
cout << b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0, n = s.length();
for (int i = 1; i < n; i++) {
if (s[i] == '1') {
sum++;
break;
}
}
cout << (n + sum) / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
long long n = s.size();
long long fg = 0;
for (long long i = n - 1; i > 0; i--) {
if (s[i] == '1') fg = 1;
}
if (fg == 0)
cout << n / 2 << "\n";
else
cout << ceil((long double)n / 2) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = s.size() / 2;
if (s.size() % 2 == 0) {
cout << ans << endl;
return 0;
}
for (int i = 1; i < s.size(); ++i) {
if (s[i] == '1') {
cout << ans + 1 << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
bool operator<(string a, string b) {
int lena = a.length();
int lenb = b.length();
if (lena < lenb)
return true;
else if (lena > lenb)
return false;
for (int i = 0; i <= lena; ++i) {
if (a[i] < b[i])
return true;
else if (a[i] > b[i])
return false;
}
return false;
}
int main() {
while (cin >> s) {
string base = "1";
int ans = 0;
while (base.length() <= 100) {
if (base < s) {
ans++;
} else
break;
base += "00";
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s[101];
int slen = 0;
int sum = 0;
char ch;
while ((ch = getchar()) != '\n') {
s[slen++] = (ch - '0');
sum += s[slen - 1];
}
int ans = 0;
{
ans = (slen - 1) / 2;
if (sum >= 2 || (slen % 2 == 0)) {
ans++;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char ch[110];
scanf("%s", &ch);
int n = strlen(ch);
int x, y;
x = y = n;
for (int i = 0; i < n; i++)
if (ch[i] == '1') {
if (x == n)
x = i;
else if (y == n)
y = i;
else
break;
}
if (x == n)
printf("0\n");
else {
if (y == n) {
if ((n - 1 - x) % 2 == 0)
printf("%d\n", (n - 1 - x) / 2);
else
printf("%d\n", (n - 1 - x) / 2 + 1);
} else
printf("%d\n", (n - 1 - x) / 2 + 1);
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.