problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pp pair<int, int>
// int 2×10の9乗
int main() {
string s;
cin >> s;
int b = 0, r = 0;
rep(i, s.size()) {
if (s[i] == '0')
r++;
else
b++;
}
int ansk = min(b, r);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pp pair<int, int>
// int 2×10の9乗
int main() {
string s;
cin >> s;
int b = 0, r = 0;
rep(i, s.size()) {
if (s[i] == '0')
r++;
else
b++;
}
int ansk = min(b, r);
... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 916,973 | 916,974 | u510383220 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << min(count(s.begin(), s.end(), '0'), count(s.begin(), s.end(), '1'));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << min(count(s.begin(), s.end(), '0'), count(s.begin(), s.end(), '1')) *
2;
} | [] | 916,975 | 916,976 | u047554023 | cpp |
p03107 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int s[100010];
for (int i = 0; i < N; i++) {
if (S.at(i) == '0')
s[i] = 0;
if (S.at(i) == '1')
s[i] = 1;
}
int sum_0 = 0, sum_1 = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int s[100010];
for (int i = 0; i < N; i++) {
if (S.at(i) == '0')
s[i] = 0;
if (S.at(i) == '1')
s[i] = 1;
}
int sum_0 = 0, sum_1 = 0;
for (int i = 0; i < N; i++) {
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 916,987 | 916,988 | u508571192 | cpp |
p03107 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 10... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 10... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 916,997 | 916,998 | u614128939 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = aco... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = aco... | [
"expression.operation.binary.add"
] | 916,999 | 917,000 | u722535636 | cpp |
p03107 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ans = 0;
stack<string> s;
string w, t;
cin >> w;
s.push(w.substr(0, 1));
for (int i = 0; i < w.length(); i++) {
if (!s.empty()) {
t = s.top();
}
s.push(w.subst... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ans = 0;
stack<string> s;
string w, t;
cin >> w;
s.push(w.substr(0, 1));
for (int i = 1; i < w.length(); i++) {
if (!s.empty()) {
t = s.top();
}
s.push(w.subst... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 917,005 | 917,006 | u573909039 | cpp |
p03107 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
template <class T> bool chmin(... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
template <class T> bool chmin(... | [
"expression.operation.binary.add"
] | 917,007 | 917,008 | u492030100 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int count0, count1;
for (int i = 0; i < N; i++) {
if (S[i] == '0') {
count0 += 1;
} else {
count1 += 1;
}
}
if (count0 <= count1) {
cout << 2 * count0 << endl;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int count0 = 0, count1 = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0') {
count0 += 1;
} else {
count1 += 1;
}
}
if (count0 <= count1) {
cout << 2 * count0 <<... | [
"variable_declaration.value.change"
] | 917,016 | 917,017 | u280096880 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int l = S.length();
int count0, count1 = 0;
for (int i = 0; i < l; i++) {
if (strncmp("0", &S.at(i), 1) == 0) {
count0++;
} else {
count1++;
}
}
cout << 2 * min(count0, count1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int l = S.length();
int count0 = 0;
int count1 = 0;
for (int i = 0; i < l; i++) {
if (strncmp("0", &S.at(i), 1) == 0) {
count0++;
} else {
count1++;
}
}
cout << 2 * min(count0, count1) << endl;
} | [
"variable_declaration.add"
] | 917,023 | 917,024 | u537507471 | cpp |
p03107 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 917,029 | 917,030 | u538125576 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#define repn(i, n) for (... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#define repn(i, n) for (... | [
"expression.operation.binary.add"
] | 917,041 | 917,042 | u386769326 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | [
"expression.operation.binary.add"
] | 917,043 | 917,044 | u902149880 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | [
"control_flow.branch.if.condition.change"
] | 917,045 | 917,044 | u902149880 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 917,046 | 917,044 | u902149880 | cpp |
p03107 | #include <bits/stdc++.h>
#define Size 1e5
using namespace std;
//スタックでやってみる
int main() {
vector<char> sta(Size);
string s;
cin >> s;
int ans = 0, top = 0;
for (int i = 0; i < s.size(); i++) {
if (top == 0 || sta[top] == s[i])
s[++top];
else {
ans += 2;
top--;
}
}
cout <<... | #include <bits/stdc++.h>
#define Size 1e5
using namespace std;
//スタックでやってみる
int main() {
vector<char> sta(Size);
string s;
cin >> s;
int ans = 0, top = 0;
for (int i = 0; i < s.size(); i++) {
if (top == 0 || sta[top] == s[i])
sta[++top] = s[i];
else {
ans += 2;
top--;
}
}
... | [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 917,047 | 917,048 | u843292252 | cpp |
p03107 | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <bits/stdc++.h>
#include <cmath> //切り上げceil(値)
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#... | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <bits/stdc++.h>
#include <cmath> //切り上げceil(値)
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#... | [] | 917,053 | 917,054 | u667375816 | cpp |
p03107 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000000 + 7
#define INF 1000000000
#define rep(i, rept) for (ll i = 0; i < rept; i++)... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000000 + 7
#define INF 1000000000
#define rep(i, rept) for (ll i = 0; i < rept; i++)... | [
"expression.operation.binary.add"
] | 917,055 | 917,056 | u635557235 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long int a, b;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
a++;
else
b++;
}
cout << 2 * min(a, b);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long int a, b;
a = b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
a++;
else
b++;
}
cout << 2 * min(a, b);
}
| [
"assignment.add"
] | 917,057 | 917,058 | u825781600 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count_0 = 0, count_1 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
count_0++;
else
count_1++;
}
cout << min(count_1, count_0) << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count_0 = 0, count_1 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
count_0++;
else
count_1++;
}
cout << 2 * min(count_1, count_0) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 917,059 | 917,060 | u110383054 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define MAX_N 10000000
#define ll int64_t
#define all(v) (v).begin(), (v).end()
#define P pair<int, int>
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define MAX_N 10000000
#define ll int64_t
#define all(v) (v).begin(), (v).end()
#define P pair<int, int>
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, b... | [
"expression.operation.binary.add"
] | 917,063 | 917,064 | u532401120 | cpp |
p03107 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.length() - 1; i++) {
if (S[i] == '0')
r++;
else
b++;
}
if (r < b)
cout << r << endl;
else
cout << b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == '0')
r++;
else
b++;
}
if (r < b)
cout << r * 2 << endl;
else
cout << b * 2 << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 917,067 | 917,068 | u204523044 | cpp |
p03107 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int ans = 0;
string S;
int zcnt = 0;
int ocnt = 0;
cin >> S;
for (int i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int ans = 0;
string S;
int zcnt = 0;
int ocnt = 0;
cin >> S;
for (int i... | [
"expression.operation.binary.add"
] | 917,071 | 917,072 | u699835930 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int a = 0;
int b = 0;
rep(i, s.length()) {
if (s[i] == '0') {
a++;
} else {
b++;
}
}
int ans = min(a, b);
cout << ans << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int a = 0;
int b = 0;
rep(i, s.length()) {
if (s[i] == '0') {
a++;
} else {
b++;
}
}
int ans = min(a, b) * 2;
cout << ans << endl;... | [
"assignment.change"
] | 917,073 | 917,074 | u905170328 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
int j = 0;
int a = 0, b = 0;
cin >> s;
n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
a++;
} else {
b++;
}
}
if (a == b) {
cout << a;
} else if (a < b) {
cout << a * 2;
} ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
int j = 0;
int a = 0, b = 0;
cin >> s;
n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
a++;
} else {
b++;
}
}
if (a == b) {
cout << a * 2;
} else if (a < b) {
cout << a * 2;
... | [
"expression.operation.binary.add"
] | 917,075 | 917,076 | u503095551 | cpp |
p03107 | #include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int x = 0, y = 0;
for (int i = 1; i < S.size(); i++) {
if (S[i] == '0') {
x++;
}
if (S[i] == '1') {
y++;
}
}
cout << 2 * (x > y ? y : x) << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int x = 0, y = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0') {
x++;
}
if (S[i] == '1') {
y++;
}
}
cout << 2 * (x > y ? y : x) << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 917,077 | 917,078 | u087313098 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
ll mod = 1000000007ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a ... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
ll mod = 1000000007ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 917,079 | 917,080 | u575653048 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
tmp++;
}
}
int ans;
if (tmp < s.size() / 2) {
ans = tmp * 2;
} else {
ans = (s.size() - tmp) * 2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
tmp++;
}
}
int ans;
if (tmp <= s.size() / 2) {
ans = tmp * 2;
} else {
ans = (s.size() - tmp) * 2;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,081 | 917,082 | u593459816 | cpp |
p03107 | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
#define lrep(i, n) for (long l... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
#define lrep(i, n) for (long l... | [
"control_flow.branch.if.condition.change"
] | 917,087 | 917,088 | u379440427 | cpp |
p03107 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"expression.operation.binary.add"
] | 917,091 | 917,092 | u266346465 | cpp |
p03107 | #include <iostream>
#include <string>
#include <vector>
int main() {
std::string S;
std::cin >> S;
int c = 0;
std::vector<char> B(S.length());
int ans = 0;
for (int i = 0; i < S.length(); i++) {
if (i != S.length() && S[i] != S[i + 1]) {
i++;
ans++;
continue;
}
if (c == 0 |... | #include <iostream>
#include <string>
#include <vector>
int main() {
std::string S;
std::cin >> S;
int c = 0;
std::vector<char> B(S.length());
int ans = 0;
for (int i = 0; i < S.length(); i++) {
if (i != S.length() - 1 && S[i] != S[i + 1]) {
i++;
ans++;
continue;
}
if (c ==... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 917,097 | 917,098 | u922974720 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int ... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int ... | [] | 917,101 | 917,102 | u073486874 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define ELEM(array) (sizeof(array) / sizeof *(array))
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
rep(i, s.size() - 1) { s[i] == '1' ? a++ : b++; }
cout << mi... | #include <bits/stdc++.h>
using namespace std;
#define ELEM(array) (sizeof(array) / sizeof *(array))
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
rep(i, s.size()) { s[i] == '1' ? a++ : b++; }
cout << min(a,... | [
"expression.operation.binary.remove"
] | 917,105 | 917,106 | u342813305 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int zero = 0;
int one = 1;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '0')
++zero;
else
++one;
}
int ans = 2 * min(zero, one);
cout <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int zero = 0;
int one = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '0')
++zero;
else
++one;
}
int ans = 2 * min(zero, one);
cout <... | [
"literal.number.change",
"variable_declaration.value.change"
] | 917,112 | 917,113 | u631558039 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
int b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
int b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0') {
a++;
} else {
b++;
}
}
cout << 2 * min(a, b) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 917,114 | 917,115 | u426572476 | cpp |
p03097 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> solve(ll n, ll a, ll b) {
if (n == 1)
return {a, b};
ll bit = 1 << (n - 1);
if ((a & bit) != (b & bit)) {
auto v1 = solve(n - 1, a, a ^ 1);
auto v2 = solve(n - 1, (a ^ 1) ^ bit, b);
v1.insert(v1.end(), v2.begin(), v2.en... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> solve(ll n, ll a, ll b) {
if (n == 1)
return {a, b};
ll bit = 1 << (n - 1);
if ((a & bit) != (b & bit)) {
auto v1 = solve(n - 1, a, a ^ 1);
auto v2 = solve(n - 1, (a ^ 1) ^ bit, b);
v1.insert(v1.end(), v2.begin(), v2.en... | [
"call.function.change",
"call.arguments.change"
] | 917,122 | 917,123 | u740916051 | cpp |
p03097 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"call.add",
"call.exit0.add"
] | 917,131 | 917,132 | u293523151 | cpp |
p03097 | //#pragma GCC optimize ("-O3","unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(... | //#pragma GCC optimize ("-O3","unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 917,135 | 917,136 | u859396346 | cpp |
p03097 | #include <bits/stdc++.h>
using namespace std;
vector<int> gen1(int n) {
vector<int> bs1, bs2, bs3;
bs1 = {0, 1, 3, 2};
bs2 = {2, 0, 1, 3};
bs3 = {3, 1, 0, 2};
vector<int> res = {0, 1}, temp;
for (int x = 1; x < n; x += 2) {
temp.clear();
for (int high : bs1)
temp.push_back(high << x | res[0]);... | #include <bits/stdc++.h>
using namespace std;
vector<int> gen1(int n) {
vector<int> bs1, bs2, bs3;
bs1 = {0, 1, 3, 2};
bs2 = {2, 0, 1, 3};
bs3 = {3, 1, 0, 2};
vector<int> res = {0, 1}, temp;
for (int x = 1; x < n; x += 2) {
temp.clear();
for (int high : bs1)
temp.push_back(high << x | res[0]);... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 917,137 | 917,138 | u366089652 | cpp |
p03097 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// x の下から key 番目 (0-indexed) の bit を消す
int erase_bit(int x, int key) {
int mask = pow(2, key);
int low = x & (mask - 1);
x = (x / (mask * 2)) * mask;
return x + low;
}
// x の下から key 番目 (0-indexed) に bit を挿入
int insert_bit(int x, int key, int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// x の下から key 番目 (0-indexed) の bit を消す
int erase_bit(int x, int key) {
int mask = pow(2, key);
int low = x & (mask - 1);
x = (x / (mask * 2)) * mask;
return x + low;
}
// x の下から key 番目 (0-indexed) に bit を挿入
int insert_bit(int x, int key, int ... | [
"literal.string.change",
"io.output.change"
] | 917,141 | 917,142 | u590088474 | cpp |
p03097 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// x の下から key 番目 (0-indexed) の bit を消す
int erase_bit(int x, int key) {
int mask = pow(2, key);
int low = x & (mask - 1);
x = (x / (mask * 2)) * mask;
return x + low;
}
// x の下から key 番目 (0-indexed) に bit を挿入
int insert_bit(int x, int key, int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// x の下から key 番目 (0-indexed) の bit を消す
int erase_bit(int x, int key) {
int mask = pow(2, key);
int low = x & (mask - 1);
x = (x / (mask * 2)) * mask;
return x + low;
}
// x の下から key 番目 (0-indexed) に bit を挿入
int insert_bit(int x, int key, int ... | [] | 917,143 | 917,142 | u590088474 | cpp |
p03097 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [] | 917,144 | 917,145 | u222293734 | cpp |
p03097 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define all(a) a.begin(), a.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define all(a) a.begin(), a.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (... | [
"control_flow.branch.if.condition.change"
] | 917,146 | 917,147 | u807998890 | cpp |
p03097 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); ... | [
"identifier.change",
"function.return_value.change"
] | 917,148 | 917,149 | u722777218 | cpp |
p03097 | #define DEBUG 0
/**
* File : C2.cpp
* Author : Kazune Takahashi
* Created : 2019-5-29 17:31:56
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include... | #define DEBUG 0
/**
* File : C2.cpp
* Author : Kazune Takahashi
* Created : 2019-5-29 17:31:56
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 917,152 | 917,153 | u521272340 | cpp |
p03097 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define mt make_tuple
#define iv inline void
#define ii inline in... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define mt make_tuple
#define iv inline void
#define ii inline in... | [
"control_flow.branch.if.condition.change"
] | 917,154 | 917,155 | u542025675 | cpp |
p03097 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int n, a, b;
vector<int> ret;
void dfs(int l, int r, int mask) {
if (mask & (mask - 1) == 0) {
ret.pb(l);
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int n, a, b;
vector<int> ret;
void dfs(int l, int r, int mask) {
if ((mask & (mask - 1)) == 0) {
ret.pb(l);
... | [
"control_flow.branch.if.condition.change"
] | 917,166 | 917,167 | u526367939 | cpp |
p03097 | //#pragma GCC optimize ("-O3")
#include <bits/stdc++.h>
using namespace std;
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} __initon;
//衝突対策
#define ws ___ws
//@必須構造
stru... | //#pragma GCC optimize ("-O3")
#include <bits/stdc++.h>
using namespace std;
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} __initon;
//衝突対策
#define ws ___ws
//@必須構造
stru... | [
"control_flow.branch.if.condition.change"
] | 917,168 | 917,169 | u986437843 | cpp |
p03097 | #include <algorithm>
#include <cstdio>
using namespace std;
int gi() {
int x = 0, w = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
w = 0, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
retur... | #include <algorithm>
#include <cstdio>
using namespace std;
int gi() {
int x = 0, w = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
w = 0, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
retur... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 917,180 | 917,181 | u755542878 | cpp |
p03097 | #include <cstdio>
#include <ctime>
#include <random>
using namespace std;
void swap(int &l, int &r) {
int tmp = l;
l = r;
r = tmp;
}
int insert_at(int pos, int bit, int n) {
int mask = ((1 << (pos + 1)) - 1);
int n_ = (n << 1) ^ ((n << 1) & mask);
n_ |= bit << pos;
n_ |= n & (mask >> 1);
return n_;
}... | #include <cstdio>
#include <ctime>
#include <random>
using namespace std;
void swap(int &l, int &r) {
int tmp = l;
l = r;
r = tmp;
}
int insert_at(int pos, int bit, int n) {
int mask = ((1 << (pos + 1)) - 1);
int n_ = (n << 1) ^ ((n << 1) & mask);
n_ |= bit << pos;
n_ |= n & (mask >> 1);
return n_;
}... | [
"expression.operation.binary.remove"
] | 917,182 | 917,183 | u146562833 | cpp |
p03097 | #include <iostream>
#include <vector>
using namespace std;
int N, A, B;
vector<int> ans;
vector<int> dfs(int start, int goal, int len) {
if (len == 1)
return (vector<int>){start, goal};
int x = 0;
for (int i = 0; i < len; i++) {
if ((start xor goal) & (1 << i)) {
x = i;
break;
}
}
in... | #include <iostream>
#include <vector>
using namespace std;
int N, A, B;
vector<int> ans;
vector<int> dfs(int start, int goal, int len) {
if (len == 1)
return (vector<int>){start, goal};
int x = 0;
for (int i = 0; i < len; i++) {
if ((start xor goal) & (1 << i)) {
x = i;
break;
}
}
in... | [
"control_flow.branch.if.condition.change"
] | 917,192 | 917,193 | u623954643 | cpp |
p03097 | #include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int N, A, B;
vector<int> ans;
vector<int> dfs(int start, int goal, int len) {
if (len == 1)
return (vector<int>){start, goal};
int x = 0;
for (int i = 0; i < len; i++) {
if ((start ^ goal) & (1 << i)) {
x = i;
brea... | #include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int N, A, B;
vector<int> ans;
vector<int> dfs(int start, int goal, int len) {
if (len == 1)
return (vector<int>){start, goal};
int x = 0;
for (int i = 0; i < len; i++) {
if ((start ^ goal) & (1 << i)) {
x = i;
brea... | [
"control_flow.branch.if.condition.change"
] | 917,194 | 917,195 | u623954643 | cpp |
p03097 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
vector<int> solve(int n, int A, int B) {
if (n == 1) {
vector<int> ret;
ret.push_back(A);
ret.push_back(B);
return ret... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
vector<int> solve(int n, int A, int B) {
if (n == 1) {
vector<int> ret;
ret.push_back(A);
ret.push_back(B);
return ret... | [
"control_flow.branch.if.condition.change"
] | 917,196 | 917,197 | u243961437 | cpp |
p03097 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN 200005
#define eps 1e-12
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN 200005
#define eps 1e-12
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef ... | [
"call.arguments.change",
"call.arguments.add"
] | 917,200 | 917,201 | u845980916 | cpp |
p03097 | #include <bits/stdc++.h>
using namespace std;
int n;
int dfs(int pos, int cnt, int a, int bit, vector<int> &tmp) {
int keta = (pos + cnt) % n;
if (cnt == 0) {
if ((bit >> cnt) & 1)
return a;
else {
a ^= (1 << keta);
tmp.push_back(a);
return a;
}
} else {
if ((bit >> cnt) &... | #include <bits/stdc++.h>
using namespace std;
int n;
int dfs(int pos, int cnt, int a, int bit, vector<int> &tmp) {
int keta = (pos + cnt) % n;
if (cnt == 0) {
if ((bit >> cnt) & 1)
return a;
else {
a ^= (1 << keta);
tmp.push_back(a);
return a;
}
} else {
if ((bit >> cnt) &... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 917,206 | 917,207 | u283229916 | cpp |
p03097 | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
LL N;
LL erase_bit(LL n, LL m) {
LL upper = (n >> (m + 1)) << m, lower = n % (1LL << m);
return upper + lower;
}
LL push_bit(LL n, LL m, LL k) {
LL upper = (n - n % (1LL << ... | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
LL N;
LL erase_bit(LL n, LL m) {
LL upper = (n >> (m + 1)) << m, lower = n % (1LL << m);
return upper + lower;
}
LL push_bit(LL n, LL m, LL k) {
LL upper = (n - n % (1LL << ... | [
"control_flow.branch.if.condition.change"
] | 917,208 | 917,211 | u660613376 | cpp |
p03097 | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define ll1 1ll
#define ONE 1ll
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; ... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define ll1 1ll
#define ONE 1ll
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; ... | [
"control_flow.branch.if.condition.change"
] | 917,219 | 917,220 | u570522509 | cpp |
p03097 | #include <bits/stdc++.h>
using namespace std;
#ifndef d
#define d(...)
#endif
#define st first
#define nd second
#define pb push_back
#define siz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
typedef long long LL;
typedef long double LD;
constexpr int INF = 1e9 + 7;
constexpr LL INFL = 1e18;
template <class ... | #include <bits/stdc++.h>
using namespace std;
#ifndef d
#define d(...)
#endif
#define st first
#define nd second
#define pb push_back
#define siz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
typedef long long LL;
typedef long double LD;
constexpr int INF = 1e9 + 7;
constexpr LL INFL = 1e18;
template <class ... | [
"control_flow.branch.if.condition.change"
] | 917,221 | 917,222 | u790287353 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length(), ans = 0;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '1')
a++;
else
b++;
}
ans = min(a, b);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length(), ans = 0;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '1')
a++;
else
b++;
}
ans = min(a, b) * 2;
cout << ans << endl;
}
| [
"assignment.change"
] | 917,234 | 917,235 | u198693633 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | [
"control_flow.branch.if.condition.change"
] | 917,244 | 917,245 | u790461875 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; i < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
vector<ll> v(2, 0);
rep(i, s.size()) v[s[i]]++;
if (v[0] == 0 || v[1] =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; i < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
vector<int> v(2, 0);
rep(i, s.size()) v[s[i] - '0']++;
if (v[0] == 0 ||... | [
"expression.operation.binary.add"
] | 917,248 | 917,249 | u894339989 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; i < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
vector<ll> v(2, 0);
rep(i, s.size()) v[s[i]]++;
if (v[0] == 0 || v[1] =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; i < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
vector<int> v(2, 0);
rep(i, s.size()) v[s[i] - '0']++;
if (v[0] == 0 ||... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 917,250 | 917,249 | u894339989 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef ve... | [
"variable_declaration.value.change"
] | 917,271 | 917,272 | u703214333 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int maru = 0, bou = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0') {
maru++;
}
if (s.at(i) == '1') {
bou++;
}
}
cout << min(maru, bou) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int maru = 0, bou = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0') {
maru++;
}
if (s.at(i) == '1') {
bou++;
}
}
cout << min(maru, bou) * 2 << endl;
} | [
"expression.operation.binary.add"
] | 917,282 | 917,283 | u442754977 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a = 0, b = 0;
for (int i = 0; i < s.length(); i++) {
a += s[i] == '1';
b += s[i] == '0';
}
cout << min(a, b) * 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a = 0, b = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
a += s[i] == '1';
b += s[i] == '0';
}
cout << min(a, b) * 2;
return 0;
} | [] | 917,284 | 917,285 | u541786453 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c0 = 0, c1 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
c0++;
c1++;
}
cout << 2 * min(c0, c1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c0 = 0, c1 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
c0++;
} else {
c1++;
}
}
cout << 2 * min(c0, c1) << endl;
} | [
"control_flow.branch.else.add"
] | 917,286 | 917,287 | u091665287 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
// double speed(double a);
int main(void) {
int x = 0, y = 0;
string str;
cin >> str;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '0')
x++;
else if (str[i] == '1')
y++;
}
printf("%d", min(x, y));
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
// double speed(double a);
int main(void) {
int x = 0, y = 0;
string str;
cin >> str;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '0')
x++;
else if (str[i] == '1')
y++;
}
printf("%d", 2 * min(x, y)... | [
"expression.operation.binary.add"
] | 917,288 | 917,289 | u337845373 | cpp |
p03107 | #include <iostream>
#include <stack>
using namespace std;
int main() {
string S;
cin >> S;
stack<char> st;
int res = 0;
for (int i = 0; i < S.size(); i++) {
if (st.empty())
st.push(S[i]);
if ((st.top() == '0' && S[i] == '1') || (st.top() == '1' && S[i] == '0')) {
st.pop();
res += ... | #include <iostream>
#include <stack>
using namespace std;
int main() {
string S;
cin >> S;
stack<char> st;
int res = 0;
for (int i = 0; i < S.size(); i++) {
if (st.empty()) {
st.push(S[i]);
} else {
if ((st.top() == '0' && S[i] == '1') ||
(st.top() == '1' && S[i] == '0')) {
... | [
"control_flow.branch.else.add"
] | 917,292 | 917,293 | u188117876 | cpp |
p03107 | #include <iostream>
int A[] = {0, 0};
int main(void) {
while (true) {
char c = getchar();
if (c == EOF)
break;
A[c - '0']++;
}
printf("%d\n", (A[0] > A[1] ? A[1] : A[0]) << 1);
return 0;
} | #include <iostream>
int A[] = {0, 0};
int main(void) {
while (true) {
char c = getchar();
if (c == '\n')
break;
A[c - '0']++;
}
printf("%d\n", (A[0] > A[1] ? A[1] : A[0]) << 1);
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 917,310 | 917,311 | u394853232 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cou0 = 0, cou1 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
cou0++;
else
cou1++;
}
cout << min(cou0, cou1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cou0 = 0, cou1 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
cou0++;
else
cou1++;
}
cout << 2 * min(cou0, cou1) << endl;
} | [
"expression.operation.binary.add"
] | 917,320 | 917,321 | u415916075 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
int main() {
string s;
cin >> s;
stack<char> amari;
char prev = 'n';
int ans = 0;
rep(i, s.size()) {
if (prev == 'n') {
prev = s[i];
continue;
}
if (prev != s[i])... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
int main() {
string s;
cin >> s;
stack<char> amari;
char prev = 'n';
int ans = 0;
rep(i, s.size()) {
if (prev == 'n') {
prev = s[i];
continue;
}
if (prev != s[i])... | [
"control_flow.branch.if.condition.change"
] | 917,331 | 917,332 | u200509145 | cpp |
p03107 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
signed main() {
string a;
cin >> a;
int b, c;
rep(i, a.size()) {
if (a.at(i) == '0')
c++;
... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
signed main() {
string a;
cin >> a;
int b = 0, c = 0;
rep(i, a.size()) {
if (a.at(i) == '0')
... | [
"variable_declaration.value.change"
] | 917,333 | 917,334 | u341447450 | cpp |
p03107 | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, z = 0, o = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
z++;
else
o++;
}
cout << 2 * min(z... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, z = 0, o = 0;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
z++;
else
o++;
}
cout << 2 * min(z, o) << endl... | [] | 917,339 | 917,340 | u476534289 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// ABC120C - Unification
// https://atcoder.jp/contests/abc120/tasks/abc120_c
void ABC120C() {
string S;
cin >> S;
/*
消した時点で上からキューブが落ちて来る
→ 消したら一つだけ戻れば良い
落ちてきても消せない場合は、スタート地点がどんどん上になっていく
*/
int a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// ABC120C - Unification
// https://atcoder.jp/contests/abc120/tasks/abc120_c
void ABC120C() {
string S;
cin >> S;
int ans = 0;
int i = 0;
while (i < S.size()) {
// cout << "S.size() : " << S.size() << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,343 | 917,344 | u725069695 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
string s;
int one, zero;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
one++;
else
zero++;
}
cout << min(one, zero) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int one, zero;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
one++;
else
zero++;
}
cout << min(one, zero) * 2 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 917,345 | 917,346 | u961846252 | cpp |
p03107 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N, M, H, W, K, A, B;
string S;
string alph... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N, M, H, W, K, A, B;
string S;
string alph... | [
"expression.operation.binary.add"
] | 917,349 | 917,350 | u016531517 | cpp |
p03107 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int redcnt = 0;
int bluecnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
redcnt++;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int redcnt = 0;
int bluecnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
redcnt++;... | [
"expression.operation.binary.add"
] | 917,353 | 917,354 | u947304300 | cpp |
p03107 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"variable_declaration.value.change"
] | 917,363 | 917,364 | u419390395 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int red;
int blue;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0') {
++red;
} else {
++blue;
}
}
int ans = min(red, blue) * 2;
cout << ans ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int red = 0;
int blue = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0') {
++red;
} else {
++blue;
}
}
int ans = min(red, blue) * 2;
cout... | [
"variable_declaration.value.change"
] | 917,367 | 917,368 | u894555185 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
int N, cnt, c1, c0;
cnt = c1 = c0 = 0;
cin >> S;
N = S.size();
for (int i = 0; i < N - 1; ++i) {
if (S[i] == '1')
c1++;
else
c0++;
}
if (c1 >= c0)
cnt = 2 * ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
int N, cnt, c1, c0;
cnt = c1 = c0 = 0;
cin >> S;
N = S.size();
for (int i = 0; i < N; ++i) {
if (S[i] == '1')
c1++;
else
c0++;
}
if (c1 >= c0)
cnt = 2 * c0;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 917,371 | 917,372 | u954253447 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
int b = 0;
for (auto &s : S) {
if (s == '0') {
a++;
} else {
b++;
}
cout << min(a, b) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
int b = 0;
for (auto &s : S) {
if (s == '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) * 2 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 917,373 | 917,374 | u471342385 | cpp |
p03107 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"control_flow.branch.if.condition.change"
] | 917,380 | 917,381 | u135572611 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int main() {
string x;
cin >>... | #include <algorithm>
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int main() {
string x;
cin >>... | [
"literal.number.change",
"variable_declaration.value.change"
] | 917,390 | 917,391 | u759162415 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int main() {
string x;
cin >>... | #include <algorithm>
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int main() {
string x;
cin >>... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change"
] | 917,392 | 917,391 | u759162415 | cpp |
p03107 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000009;
using namespace std;
int gcd(int a, int b) {
while (a % b != 0) {
int c = 0;
c = a % b;
a = b;
b = c;
}
return b;
}
string c... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000009;
using namespace std;
int gcd(int a, int b) {
while (a % b != 0) {
int c = 0;
c = a % b;
a = b;
b = c;
}
return b;
}
string c... | [
"expression.operation.binary.add"
] | 917,393 | 917,394 | u019465635 | cpp |
p03107 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MOD 1000000007;
int main() {
stack<char> st;
char c;
int ans = 0;
while (cin >> c) ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MOD 1000000007;
int main() {
stack<char> st;
char c;
int ans = 0;
while (cin >> c) ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,397 | 917,398 | u608258653 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
string s;
cin >> s;
int c0 = 0, c1 = 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
c0++;
else
c1++;
}
cout << 2 * min(c0, c1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
string s;
cin >> s;
int c0 = 0, c1 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
c0++;
else
c1++;
}
cout << 2 * min(c0, c1);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 917,401 | 917,402 | u129667379 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt1 = 0;
int cnt2 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0') {
cnt1++;
} else if (S[i] == '0') {
cnt2++;
}
}
cout << 2 * min(cnt1, cnt2) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt1 = 0;
int cnt2 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0') {
cnt1++;
} else if (S[i] == '1') {
cnt2++;
}
}
cout << 2 * min(cnt1, cnt2) << endl;
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 917,406 | 917,407 | u904123392 | cpp |
p03107 | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
char s[100002];
int len, i, count = 0;
len = strlen(s);
for (i = 0; i < len; i++) {
if (s[i] == '0')
count++;
}
cout << 2 * min(count, len - count);
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
char s[100002];
cin >> s;
int len, i, count = 0;
len = strlen(s);
for (i = 0; i < len; i++) {
if (s[i] == '0')
count++;
}
cout << 2 * min(count, len - count);
return 0;
} | [] | 917,414 | 917,415 | u340494803 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
main() {
string S;
cin >> S;
int cnta = 0, cntb = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
cnta++;
else
cntb++;
}
cout << S.size() - min(cnta, cntb) * 2 << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
main() {
string S;
cin >> S;
int cnta = 0, cntb = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
cnta++;
else
cntb++;
}
cout << min(cnta, cntb) * 2 << endl;
}
| [
"expression.operation.binary.remove"
] | 917,416 | 917,417 | u157322125 | cpp |
p03107 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const int mod = 1e9 + 7;
#define lol(i, n) for (int i = 0; i < n; i++)
#define tot(i, n) for (int i = 1; i <= n; i++)
using namespace std;
string s;
int main() {
cin >... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const int mod = 1e9 + 7;
#define lol(i, n) for (int i = 0; i < n; i++)
#define tot(i, n) for (int i = 1; i <= n; i++)
using namespace std;
string s;
int main() {
cin >... | [
"variable_declaration.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 917,422 | 917,423 | u190066528 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a, b;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) * 2 << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) * 2 << endl;
} | [
"variable_declaration.value.change"
] | 917,426 | 917,427 | u130834452 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int counta = 0, countb = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'O') {
counta++;
}
}
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '1') {
countb++;
}
}
cout << min(counta, co... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int counta = 0, countb = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0') {
counta++;
}
}
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '1') {
countb++;
}
}
cout << min(counta, co... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 917,431 | 917,432 | u593555034 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int ones = 0;
for (int i = 0; i < (int)str.size(); ++i) {
if (str[i] == '1') {
ones++;
}
}
int res = min(ones, (int)str.size() - ones);
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int ones = 0;
for (int i = 0; i < (int)str.size(); ++i) {
if (str[i] == '1') {
ones++;
}
}
int res = min(ones, (int)str.size() - ones) * 2;
cout << res << "\n";
return 0;
}
| [
"assignment.change"
] | 917,437 | 917,438 | u210162517 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int C_0 = 0, C_1 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
C_0++;
if (S[i] == '1')
C_1++;
}
cout << min(C_0, C_1) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int C_0 = 0, C_1 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
C_0++;
if (S[i] == '1')
C_1++;
}
cout << 2 * min(C_0, C_1) << endl;
return 0;
... | [
"expression.operation.binary.add"
] | 917,450 | 917,451 | u382176401 | cpp |
p03107 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
cin >> s;
int z = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
cin >> s;
int z = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
... | [] | 917,452 | 917,453 | u769062455 | cpp |
p03107 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
int main() {
string s;
cin >> s;
int count = 0, res = 0;
char now;
for (int i = 1; ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
int main() {
string s;
cin >> s;
int count = 0, res = 0;
char now;
for (int i = 0; ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 917,456 | 917,457 | u521389909 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a, b, ans = 0;
for (int i = 0; i < (int)s.length(); ++i) {
if (s[i] == '0')
a++;
else {
b++;
}
}
cout << 2 * min(a, b);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0, ans = 0;
for (int i = 0; i < (int)s.length(); ++i) {
if (s[i] == '0')
a++;
else {
b++;
}
}
cout << 2 * min(a, b);
} | [
"variable_declaration.value.change"
] | 917,458 | 917,459 | u709810602 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n = 0;
cin >> s;
for (int i = 0; i < s.size();) {
if (s.substr(i, 2) == "01" || s.substr(i, 2) == "10") {
n += 2;
s.erase(i, 2);
if (i != 1)
i--;
} else {
i++;
}
}
cout << n ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n = 0;
cin >> s;
for (int i = 0; i < s.size();) {
if (s.substr(i, 2) == "01" || s.substr(i, 2) == "10") {
n += 2;
s.erase(i, 2);
if (i != 0)
i--;
} else {
i++;
}
}
cout << n ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 917,460 | 917,461 | u493122449 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n = 0;
cin >> s;
for (int i = 0; i < s.size();) {
if (s.substr(i, 2) == "01" || s.substr(i, 2) == "10") {
n += 2;
s.erase(i, 2);
if (i > 1)
i -= 2;
} else {
i++;
}
}
cout << ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n = 0;
cin >> s;
for (int i = 0; i < s.size();) {
if (s.substr(i, 2) == "01" || s.substr(i, 2) == "10") {
n += 2;
s.erase(i, 2);
if (i != 0)
i--;
} else {
i++;
}
}
cout << n ... | [
"control_flow.loop.for.condition.change"
] | 917,462 | 917,461 | u493122449 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int main() {
string S;
cin >> S;
int cnt0 = 0, cnt... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int main() {
string S;
cin >> S;
int cnt0 = 0, cnt... | [
"literal.number.change",
"variable_declaration.value.change"
] | 917,463 | 917,464 | u906880177 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.