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 |
|---|---|---|---|---|---|---|---|
p03106 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 916,483 | 916,484 | u134576652 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
#define REP(n) for (LL i = 0; i < (n); i++)
#define COUT(val) cout << (val) << endl
#define CIN(val) cin >> (val)
#define SORT(vec) sort(vec.begin(), vec.end())
#define SORT_GRE(vec) sort(vec.begin(), vec.end(), greater<LL>())
int main() {
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
#define REP(n) for (LL i = 0; i < (n); i++)
#define COUT(val) cout << (val) << endl
#define CIN(val) cin >> (val)
#define SORT(vec) sort(vec.begin(), vec.end())
#define SORT_GRE(vec) sort(vec.begin(), vec.end(), greater<LL>())
int main() {
int ... | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,485 | 916,486 | u319491032 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | [
"identifier.change",
"call.function.change"
] | 916,489 | 916,490 | u462560753 | cpp |
p03106 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
#define ll long long
#define MAX 100005
#define pb push_back
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const double PI = 3.141592653589793238463;... | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
#define ll long long
#define MAX 100005
#define pb push_back
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const double PI = 3.141592653589793238463;... | [
"call.function.change",
"call.arguments.change"
] | 916,491 | 916,492 | u069935888 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | [] | 916,496 | 916,497 | u856232850 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 1;; i++) {
if (a % i == 0 && b % i == 0) {
k--;
}
if (k == 0) {
cout << i << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = a * b;; i--) {
if (a % i == 0 && b % i == 0) {
k--;
}
if (k == 0) {
cout << i << endl;
return 0;
}
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 916,504 | 916,505 | u283229916 | cpp |
p03106 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll =... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll =... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,510 | 916,511 | u525672296 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int a, b, c;
vector<int> s(10000);
cin >> a >> b >> c;
int n;
n = gcd(a, b);
int factor;
factor = 1;
int i = 0;
while (factor <= n) {
if (n % factor =... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int a, b, c;
vector<int> s(10000);
cin >> a >> b >> c;
int n;
n = gcd(a, b);
int factor;
factor = 1;
int i = 0;
while (factor <= n) {
if (n % factor =... | [
"expression.operation.binary.add"
] | 916,520 | 916,521 | u614970814 | cpp |
p03106 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
bool cmp(const int &a, const int &b) { return a > b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> vec;
for (int i = 2; i <= min(a, b); ++i)
if (a % i == 0 && b % i == 0)
vec.push_back(i);
sort(vec.begin(), vec.end(), c... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
bool cmp(const int &a, const int &b) { return a > b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> vec;
for (int i = 1; i <= min(a, b); ++i)
if (a % i == 0 && b % i == 0)
vec.push_back(i);
sort(vec.begin(), vec.end(), c... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 916,526 | 916,527 | u216160112 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[a] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i < a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << endl;
... | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[a + b] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i <= a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << en... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,535 | 916,536 | u481856377 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i < a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << endl;
... | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[a + b] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i <= a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << en... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,537 | 916,536 | u481856377 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[256] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i < a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << endl;... | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[a + b] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i <= a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << en... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,538 | 916,536 | u481856377 | cpp |
p03106 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) for (int i = (a); i > (b); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR... | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) for (int i = (a); i > (b); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR... | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,541 | 916,542 | u669551866 | cpp |
p03106 | #include <iostream>
using namespace std;
int stack[1000], top = -1;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < 1000; i++)
stack[i] = 0;
int min = (a < b) ? a : b;
for (int i = 1; i <= min; i++)
if (a % i == 0 and b % i == 0)
stack[++top] = i;
cout << stack[k - 1];
ret... | #include <iostream>
using namespace std;
int stack[1000], top = -1;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < 1000; i++)
stack[i] = 0;
int min = (a < b) ? a : b;
for (int i = 1; i <= min; i++)
if (a % i == 0 and b % i == 0)
stack[++top] = i;
cout << stack[top - k + 1];... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 916,543 | 916,544 | u624867468 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int kouyaku = 1;
for (int i = 0; i < 100; ++i) {
if (A % kouyaku == 0 && B % kouyaku == 0)
++count;
if (count == K)
break;
++kouyaku;
}
cout << kouyaku << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int kouyaku = 100;
for (int i = 0; i < 100; ++i) {
if (A % kouyaku == 0 && B % kouyaku == 0)
++count;
if (count == K)
break;
--kouyaku;
}
cout << kouyaku << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 916,566 | 916,567 | u684556267 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> d;
d.push_back(0);
int denominator = 2;
do {
if (A % denominator == 0 && B % denominator == 0) {
d.insert(d.begin(), denominator);
}
denominator++;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> d;
d.push_back(0);
int denominator = 1;
do {
if (A % denominator == 0 && B % denominator == 0) {
d.insert(d.begin(), denominator);
}
denominator++;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,601 | 916,602 | u689011083 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = 1; i < 101; ++i) {
// cout << A % i << B % i << endl;
if ((A % i == 0) && (B % i == 0)) {
// cout << i <<... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = 100; i > 0; --i) {
// cout << A % i << B % i << endl;
if ((A % i == 0) && (B % i == 0)) {
// cout << i <<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 916,608 | 916,609 | u642210599 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
vector<int> s;
cin >> A >> B >> K;
for (int i = 1; i < A; i++) {
if (A % i == 0 and B % i == 0) {
s.push_back(i);
}
}
reverse(s.begin(), s.end());
cout << s[K - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
vector<int> s;
cin >> A >> B >> K;
for (int i = 1; i <= A; i++) {
if (A % i == 0 && B % i == 0) {
s.push_back(i);
}
}
reverse(s.begin(), s.end());
cout << s[K - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 916,631 | 916,632 | u731175398 | cpp |
p03106 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int x = 1;
int i = 1;
while (x < k) {
i++;
if... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int x = 0;
int i = 101;
while (x < k) {
i--;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,638 | 916,639 | u385617244 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | [
"expression.operation.binary.remove"
] | 916,646 | 916,647 | u790171360 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a, b, k;
vector<int> gcd;
int main() {
cin >> a >> b >> k;
for (int i = 1; i < max(a, b); i++) {
if (a % i == 0 && b % i == 0)
gcd.push_back(i);
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a, b, k;
vector<int> gcd;
int main() {
cin >> a >> b >> k;
for (int i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0)
gcd.push_back(i);
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1]... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,656 | 916,657 | u340049257 | cpp |
p03106 | #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int a = 0, b = 0, k = 0, koubai[100], t = 0, n = 0;
scanf("%d %d %d", &a, &b, &k);
if (a < b) {
n = a;
} else
n = b;
for (int i = 2; i <= n; i++) {
if (a % i == 0 && b % i == 0) {
koubai[t] = i;
t++;
}... | #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int a = 0, b = 0, k = 0, koubai[100], t = 0, n = 0;
scanf("%d %d %d", &a, &b, &k);
if (a < b) {
n = a;
} else
n = b;
for (int i = 1; i <= n; i++) {
if (a % i == 0 && b % i == 0) {
koubai[t] = i;
t++;
}... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 916,660 | 916,661 | u117345342 | cpp |
p03106 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
typedef long long ll;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define fill(x, y) memset(... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
typedef long long ll;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).rbegin(), (x).rend()
#define fill(x, y) memse... | [
"preprocessor.define.value.change"
] | 916,665 | 916,666 | u950603962 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int d;
if (A > B) {
d = A;
} else {
d = B;
}
int count = 0;
while (count < K) {
if (A % d == 0 && B % d == 0) {
count++;
}
d--;
}
cout << d;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int d;
if (A > B) {
d = A;
} else {
d = B;
}
int count = 0;
while (count < K) {
if (A % d == 0 && B % d == 0) {
count++;
}
d--;
}
cout << (d + 1);
return 0;
} | [] | 916,669 | 916,670 | u100547715 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
int cnt = 0;
cin >> S;
rep(i, S.size() - 1) if (S[i] == '0') cnt++;
cout << min(cnt, int(S.size() - cnt)) * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
int cnt = 0;
cin >> S;
rep(i, S.size()) if (S[i] == '0') cnt++;
cout << min(cnt, int(S.size() - cnt)) * 2 << endl;
} | [
"expression.operation.binary.remove"
] | 916,673 | 916,674 | u749022615 | cpp |
p03107 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long count = 0;
for (long i = 1; i < S.size(); i++) {
if (S[i] == '0') {
count++;
}
}
long a = S.size() - count;
cout << min(a, count) * 2 << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long count = 0;
for (long i = 0; i < S.size(); i++) {
if (S[i] == '0') {
count++;
}
}
long a = S.size() - count;
cout << min(a, count) * 2 << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 916,677 | 916,678 | u526365587 | cpp |
p03107 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template ... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 916,681 | 916,682 | u273928723 | cpp |
p03107 | #include <bits/stdc++.h>
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++;
}
cout << min(red, blue) * 2 << endl;
} | #include <bits/stdc++.h>
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++;
}
cout << min(red, blue) * 2 << endl;
} | [
"control_flow.branch.if.condition.change"
] | 916,686 | 916,687 | u297195722 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int count0 = 0;
int count1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
count0++;
else
count1++;
}
cout << min(count0, count1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int count0 = 0;
int count1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
count0++;
else
count1++;
}
cout << min(count0, count1) * 2 << endl;
} | [
"expression.operation.binary.add"
] | 916,690 | 916,691 | u955282280 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
string s;
cin >> s;
ll n = s.size();
vector<int> vec;
rep(i, n) vec.p... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
string s;
cin >> s;
ll n = s.size();
vector<int> vec;
rep(i, n) vec.p... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 916,692 | 916,693 | u371149954 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> vec;
rep(i, n) vec.... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
string s;
cin >> s;
ll n = s.size();
vector<int> vec;
rep(i, n) vec.p... | [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.loop.condition.change"
] | 916,694 | 916,693 | u371149954 | cpp |
p03107 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | [
"call.add"
] | 916,698 | 916,699 | u154645927 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> bool chmax(T &a, c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> bool chmax(T &a, c... | [
"variable_declaration.value.change"
] | 916,700 | 916,701 | u420130252 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n, t;
for (int i = 0; i < S.size(); ++i) {
if (S.at(i) == '1') {
n++;
} else {
t++;
}
}
cout << 2 * min(n, t) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = 0, t = 0;
for (int i = 0; i < S.size(); ++i) {
if (S.at(i) == '1') {
n++;
} else {
t++;
}
}
cout << 2 * min(n, t) << endl;
} | [
"variable_declaration.value.change"
] | 916,702 | 916,703 | u629548179 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n, t;
for (int i = 0; i < S.size(); ++i) {
if (S.at(i) == '1') {
n++;
} else {
t++;
}
}
cout << 2 * (n, t) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = 0, t = 0;
for (int i = 0; i < S.size(); ++i) {
if (S.at(i) == '1') {
n++;
} else {
t++;
}
}
cout << 2 * min(n, t) << endl;
} | [
"variable_declaration.value.change",
"call.add"
] | 916,704 | 916,703 | u629548179 | cpp |
p03107 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vl... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vl... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 916,705 | 916,706 | u281876921 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
cout << abs(count(S.begin(), S.end(), '0') - count(S.begin(), S.end(), '1'))
<< "\n";
} | #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
<< "\n";
} | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 916,709 | 916,710 | u045289115 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt0 = 0, cnt1 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
cnt0++;
else
cnt1++;
}
cout << min(cnt0, cnt1) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt0 = 0, cnt1 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
cnt0++;
else
cnt1++;
}
cout << 2 * min(cnt0, cnt1) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 916,719 | 916,720 | u858670323 | cpp |
p03107 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
string s;
cin >> s;
int sn = s.size(), ze = 0, it = 0;
for (int i = 0; i < sn; i++... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
string s;
cin >> s;
int sn = s.size(), ze = 0, it = 0;
for (int i = 0; i < sn; i++... | [
"expression.operation.binary.add"
] | 916,723 | 916,724 | u261538386 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int counta = 0;
int countb = 0;
for (int i = 0; i < S.length(); i++) {
if (S.at(i) == '0') {
counta++;
} else
countb++;
}
cout << abs(counta - countb) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int counta = 0;
int countb = 0;
for (int i = 0; i < S.length(); i++) {
if (S.at(i) == '0') {
counta++;
} else
countb++;
}
cout << S.length() - abs(counta - countb) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 916,725 | 916,726 | u469315559 | cpp |
p03107 | #include <bits/stdc++.h>
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) << endl;
}
| #include <bits/stdc++.h>
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 << 2 * min(a, b) << endl;
}
| [
"expression.operation.binary.add"
] | 916,727 | 916,728 | u340228918 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int red = 0, blue = 0;
string c;
cin >> c;
for (int i = 0; i <= c.size(); i++) {
if (c[i] == '0')
red++;
else
blue++;
}
cout << 2 * min(red, blue) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int red = 0, blue = 0;
string c;
cin >> c;
for (int i = 0; i < c.size(); i++) {
if (c[i] == '0')
red++;
else
blue++;
}
// cout << red << blue << " ";
cout << 2 * min(red, blue) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,729 | 916,730 | u271153916 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
///////////////////////////
int main() {
string s;
cin >> s;
cout << min(count(s.begin(), s.end(), '0'), count(s.begin(), s.end(), '1'))
<< endl;
}
///////////////////////////
| #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
///////////////////////////
int main() {
string s;
cin >> s;
cout << min(count(s.begin(), s.end(), '0'), count(s.begin(), s.end(), '1')) *
2
<< endl;
}
//////////////////... | [] | 916,731 | 916,732 | u264265458 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
string S;
cin >> S;
int zero = 0;
int one = 0;
REP(i, S.size()) { S[i] == '0' ? zero++ : one++; }
cout << min(zero, one) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
string S;
cin >> S;
int zero = 0;
int one = 0;
REP(i, S.size()) { S[i] == '0' ? zero++ : one++; }
cout << min(zero, one) * 2 << endl;... | [
"expression.operation.binary.add"
] | 916,733 | 916,734 | u342075214 | cpp |
p03107 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF{1001002003004005006}; // ll = 9*LLINF
constexpr int INTINF{1000000000}; // int = 2*INTINF
#define rep(i, n)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF{1001002003004005006}; // ll = 9*LLINF
constexpr int INTINF{1000000000}; // int = 2*INTINF
#define rep(i, n)... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 916,735 | 916,736 | u196786099 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
vector<char> v;
string S;
cin >> S;
int N = S.size();
rep(i, N) { v.push_back(S[i]); }
int removed = 0;
int idx = 0;
int vsize = v.size();
while ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
vector<char> v;
string S;
cin >> S;
int N = S.size();
rep(i, N) { v.push_back(S[i]); }
int removed = 0;
int idx = 0;
int vsize = v.size();
while ... | [
"control_flow.loop.condition.change"
] | 916,737 | 916,738 | u900523387 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | [
"expression.operation.binary.add"
] | 916,742 | 916,743 | u126859973 | cpp |
p03107 | #include <algorithm> //next_permutation
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).be... | #include <algorithm> //next_permutation
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).be... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 916,748 | 916,749 | u937618939 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
cin.tie(0);
ios::sync_wit... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
cin.tie(0);
ios::sync_wit... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 916,752 | 916,753 | u340980616 | cpp |
p03107 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,756 | 916,757 | u965730380 | cpp |
p03107 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UINT = unsigned long long;
unsigned gcd(unsigned a, un... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UINT = unsigned long long;
unsigned gcd(unsigned a, un... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 916,760 | 916,761 | u275797573 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
int main() {
string s;
cin >> s;
stack<char> st;
int ans = 0;
rep(i, s.size()) {
if (st.empty()) {
st.push(s[i]);
}
char t = st.top();
if (t != s[i]) {
ans += 2;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
int main() {
string s;
cin >> s;
stack<char> st;
int ans = 0;
rep(i, s.size()) {
if (st.empty()) {
st.push(s[i]);
continue;
}
char t = st.top();
if (t != s[i]) {
... | [] | 916,772 | 916,773 | u702686470 | cpp |
p03107 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
for (int i = 0; i < s.size() + 1; i++) {
if (s[i] == '0')
red++;
else
blue++;
}
cout << min(red... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
red++;
else
blue++;
}
cout << min(red, bl... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 916,776 | 916,777 | u654240084 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n = (int)s.length();
int i;
int chk[2] = {0, 0};
for (i = 0; i < n; i++) {
if (s[i] == '0')
chk[0]++;
else
chk[1]++;
}
cout << min(chk[0], chk[1]);
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n = (int)s.length();
int i;
int chk[2] = {0, 0};
for (i = 0; i < n; i++) {
if (s[i] == '0')
chk[0]++;
else
chk[1]++;
}
cout << 2 * min(chk[0], chk[1]);
}
| [
"expression.operation.binary.add"
] | 916,778 | 916,779 | u523698212 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (int i = init; i < (int)(n); i++)
#define repd(i, n, init) for (int i = (int)(n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); i++)
int main() {
string S;
cin >> S;
int cnt = ... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (int i = init; i < (int)(n); i++)
#define repd(i, n, init) for (int i = (int)(n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); i++)
int main() {
string S;
cin >> S;
int cnt = ... | [
"expression.operation.binary.add"
] | 916,780 | 916,781 | u187013893 | cpp |
p03107 |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#inc... |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#inc... | [
"expression.operation.binary.add"
] | 916,782 | 916,783 | u683078179 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
int main() {
strin... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
int main() {
strin... | [
"variable_declaration.value.change"
] | 916,784 | 916,785 | u418810472 | cpp |
p03107 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [] | 916,786 | 916,787 | u700484101 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace ::std;
typedef long long lint;
typedef long double ldouble;
#define rep(i, n) for (lint i = 0; i < (lint)(n); i++)
#define repi(i, a, b) for (lint i = lint(a); i < lint(b); i++)
#define rep2(i, a, b, c) for (lint i = lint(a); i > lint(b); i += c)
#define all(x) (x).begin(), (x).... | #include <bits/stdc++.h>
using namespace ::std;
typedef long long lint;
typedef long double ldouble;
#define rep(i, n) for (lint i = 0; i < (lint)(n); i++)
#define repi(i, a, b) for (lint i = lint(a); i < lint(b); i++)
#define rep2(i, a, b, c) for (lint i = lint(a); i > lint(b); i += c)
#define all(x) (x).begin(), (x).... | [
"variable_declaration.value.change"
] | 916,788 | 916,789 | u168579419 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define itn int
int main(void) {
string t;
cin >> t;
stack<char> s;
int sum = 0;
for (int i = 0; i < t.size(); ++i) {
if (s.empty() || s.top() == t[i])
s.push(t[i]);
else {
sum += 2;
s.top();
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define itn int
int main(void) {
string t;
cin >> t;
stack<char> s;
int sum = 0;
for (int i = 0; i < t.size(); i++) {
if (s.empty() || s.top() == t[i])
s.push(t[i]);
else {
sum += 2;
s.pop();
}
}
cout << sum << endl;
} | [
"call.function.change"
] | 916,790 | 916,791 | u512624048 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define itn int
int main(void) {
string t;
cin >> t;
stack<char> s;
int sum = 0;
for (int i = 0; i < t.size(); i++) {
if (s.empty() || s.top() == t[i])
s.push(t[i]);
else {
sum += 2;
s.top();
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define itn int
int main(void) {
string t;
cin >> t;
stack<char> s;
int sum = 0;
for (int i = 0; i < t.size(); i++) {
if (s.empty() || s.top() == t[i])
s.push(t[i]);
else {
sum += 2;
s.pop();
}
}
cout << sum << endl;
} | [
"call.function.change"
] | 916,792 | 916,791 | u512624048 | cpp |
p03107 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n0, n1 = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '0')
n0++;
else
n1++;
}
int ans = s.size() - abs(n0 - n1);
cout << ans << endl;
return 0;
}
| #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n0 = 0;
int n1 = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '0')
n0++;
else
n1++;
}
int ans = s.size() - abs(n0 - n1);
cout << ans << endl;
return 0;
}
| [
"variable_declaration.add"
] | 916,793 | 916,794 | u649421008 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string N;
cin >> N;
int Z, O;
for (auto c : N) {
if (c == '0')
Z++;
else
O++;
}
cout << min(Z, O) * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string N;
cin >> N;
int Z = 0, O = 0;
for (auto c : N) {
if (c == '0')
Z++;
else
O++;
}
cout << min(Z, O) * 2 << endl;
}
| [
"variable_declaration.value.change"
] | 916,795 | 916,796 | u889173297 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define INF 1E18
int main() {
string s;
cin >> s;
int n = s.length();
int no0 = 0;
int no1 = 1;
rep(i, n) {
if (s[i] == '0')
n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define INF 1E18
int main() {
string s;
cin >> s;
int n = s.length();
int no0 = 0;
int no1 = 0;
rep(i, n) {
if (s[i] == '0')
n... | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,797 | 916,798 | u733599187 | cpp |
p03107 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
///////
int ans = 0;
int one = 0;
int zero = 0;
rep(i, n) {
if (s[i] =... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
///////
int ans = 0;
int one = 0;
int zero = 0;
rep(i, n) {
if (s[i] =... | [
"expression.operation.binary.add"
] | 916,799 | 916,800 | u531461815 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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 (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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 (a > b) {
a =... | [
"control_flow.branch.if.condition.change"
] | 916,803 | 916,804 | u917518913 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int b = 0;
int w = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == '0')
w++;
else
b++;
}
cout << min(b, w) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int b = 0;
int w = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == '0')
w++;
else
b++;
}
cout << min(b, w) * 2 << endl;
} | [
"expression.operation.binary.add"
] | 916,808 | 916,809 | u983681697 | cpp |
p03107 | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int c[2];
c[0] = c[1] = 0;
string s;
cin >> s;
rep(i, s.size()) { c[s[i] - '0']++; }
cout << min(c[0], c[1]) << endl;
}
| #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int c[2];
c[0] = c[1] = 0;
string s;
cin >> s;
rep(i, s.size()) { c[s[i] - '0']++; }
cout << 2 * min(c[0], c[1]) << endl;
}
| [
"expression.operation.binary.add"
] | 916,810 | 916,811 | u503170128 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
const int Red = '0';
const int Blue = '1';
int redCount = 0;
int blueCount = 0;
for (auto i = S.crbegin(); i != S.crend(); i++) {
if (*i == Red) {
redCount++;
} else {
blueCount++;
... | #include <algorithm>
#include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
const int Red = '0';
const int Blue = '1';
int redCount = 0;
int blueCount = 0;
for (auto i = S.crbegin(); i != S.crend(); i++) {
if (*i == Red) {
redCount++;
} else {
blueCount++;
... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 916,812 | 916,813 | u809157683 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change"
] | 916,814 | 916,815 | u874644572 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string a;
cin >> a;
ll b, c;
b = 0;
c = 0;
for (ll i = 0; i < a.size(); i++) {
if (a.at(i) == '0') {
b += 1;
} else {
c += 1;
}
}
cout << min(b, c) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string a;
cin >> a;
ll b, c;
b = 0;
c = 0;
for (ll i = 0; i < a.size(); i++) {
if (a.at(i) == '0') {
b += 1;
} else {
c += 1;
}
}
cout << min(b, c) * 2 << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 916,824 | 916,825 | u883297128 | 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 rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
string s;
cin >> s;
int zero = 0, one = 0;
int n = s.size();
rep(i, n) {
if (s[i] == '0') {... | #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 rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
string s;
cin >> s;
int zero = 0, one = 0;
int n = s.size();
rep(i, n) {
if (s[i] == '0') {... | [
"expression.operation.binary.add"
] | 916,828 | 916,829 | u318661636 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
bool f = true;
while (f) {
f = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
s.erase(i - 1, 2);
ans += 2;
i -= 2;
f = true;
}
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
bool f = true;
while (f) {
f = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
s.erase(i - 1, 2);
ans += 2;
i--;
f = true;
}
}
}
cout << ... | [] | 916,830 | 916,831 | u528258842 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
bool f = true;
while (f) {
f = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1]) {
s.erase(i - 1, 2);
ans += 2;
i -= 2;
f = true;
}
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
bool f = true;
while (f) {
f = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
s.erase(i - 1, 2);
ans += 2;
i--;
f = true;
}
}
}
cout << ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 916,832 | 916,831 | u528258842 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main() {
string s;
cin >> s;
ll o = 0;
ll z = 0;
rep(i, 0, s.size()) {
if (s[i] == '0')
z++;
else if ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main() {
string s;
cin >> s;
ll o = 0;
ll z = 0;
rep(i, 0, s.size()) {
if (s[i] == '0')
z++;
else if ... | [
"expression.operation.binary.add"
] | 916,833 | 916,834 | u829403090 | cpp |
p03107 | #include <bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template <typename T_char> T_char ToUpper(T_char cX) { return toupper(cX); }
int main() {
string s;
cin >> s;
int n = s.size();
int cnt = 0;
bool flag1 = true;
while (flag1) {
flag1 = false;
for (int i =... | #include <bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template <typename T_char> T_char ToUpper(T_char cX) { return toupper(cX); }
int main() {
string s;
cin >> s;
int n = s.size();
int cnt = 0;
bool flag1 = true;
while (flag1) {
flag1 = false;
for (int i =... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 916,837 | 916,838 | u145562832 | cpp |
p03107 | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <numeric> // accumulate(begin,end,初期値)
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");
#define all(x) (x).begin(), (x).end()
#define print(x) cout << x << e... | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <numeric> // accumulate(begin,end,初期値)
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");
#define all(x) (x).begin(), (x).end()
#define print(x) cout << x << e... | [
"assignment.change"
] | 916,845 | 916,846 | u184572586 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length(), cnt1 = 0, cnt2 = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0')
cnt1++;
else
cnt2++;
}
cout << min(cnt1, cnt2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length(), cnt1 = 0, cnt2 = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0')
cnt1++;
else
cnt2++;
}
cout << 2 * min(cnt1, cnt2) << endl;
}
| [
"expression.operation.binary.add"
] | 916,847 | 916,848 | u313403396 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int red, blue = 0;
rep(i, s.length()) {
if (s[i] == '0') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << blue * 2 << endl;
} else {
cout <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
rep(i, s.length()) {
if (s[i] == '0') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << blue * 2 << endl;
} else {
co... | [
"variable_declaration.value.change"
] | 916,849 | 916,850 | u532086793 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int red, blue = 0;
rep(i, s.length()) {
if (s[i] == '0') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << blue * 2 << endl;
} else {
cout <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
rep(i, s.length()) {
if (s[i] == '0') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << blue * 2 << endl;
} else {
co... | [
"variable_declaration.value.change"
] | 916,851 | 916,850 | u532086793 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
#defin... | [
"expression.operation.binary.remove"
] | 916,857 | 916,858 | u303297838 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 916,859 | 916,860 | u946082956 | cpp |
p03107 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ma... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ma... | [
"expression.operation.binary.add"
] | 916,861 | 916,862 | u651314218 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int zero = 0, one = 0;
string s;
cin >> s;
rep(i, s.size()) {
if (s[i] == '0')
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int zero = 0, one = 0;
string s;
cin >> s;
rep(i, s.size()) {
if (s[i] == '0')
... | [
"call.add",
"expression.operation.binary.add"
] | 916,863 | 916,864 | u033937898 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
// const int MOD = 1e9+7;
int main() {
string s;
cin >> s;
int c0 = 0, c1 = 1;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == '0')
c0++;
else
c1++;
}
cout << 2 * min... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
// const int MOD = 1e9+7;
int main() {
string s;
cin >> s;
int c0 = 0, c1 = 0;
for (int i = 0; i < (int)s.length(); ++i) {
if (s[i] == '0')
c0++;
else
c1++;
}
cout << 2 ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 916,867 | 916,868 | u324973749 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a, b, c;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0') {
a++;
} else if (s.at(i) == '1') {
b++;
}
}
c = min(a, b);
cout << c * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0, c = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0') {
a++;
} else if (s.at(i) == '1') {
b++;
}
}
c = min(a, b);
cout << c * 2 << endl;
}
| [
"variable_declaration.value.change"
] | 916,869 | 916,870 | u856957535 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
... | [] | 916,871 | 916,872 | u925478083 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
str s;
cin >> s;
int cnta = 0;
int cntb = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
cnta++;
else
cntb++;
}
cout << min(c... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
str s;
cin >> s;
int cnta = 0;
int cntb = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
cnta++;
else
cntb++;
}
cout << min(c... | [
"expression.operation.binary.add"
] | 916,876 | 916,877 | u288035794 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
FAST;
stack<char> stck;
string s;
cin >> s;
// string ans="";
for... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
FAST;
stack<char> stck;
string s;
cin >> s;
// string ans="";
for... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 916,886 | 916,887 | u089230684 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
stack<char> sc;
sc.push(s[0]);
int ans = 0;
for (size_t i = 0; i < s.size(); ++i) {
if (sc.empty())
sc.push(s[i]);
else {
if (sc.top() == s[i]) {
sc.push(s[i]);
} else {
sc.pop();
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
stack<char> sc;
sc.push(s[0]);
int ans = 0;
for (size_t i = 1; i < s.size(); ++i) {
if (sc.empty())
sc.push(s[i]);
else {
if (sc.top() == s[i]) {
sc.push(s[i]);
} else {
sc.pop();
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 916,888 | 916,889 | u863370423 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string s;
int main() {
cin >> s;
int cnt = 0;
int n = s.length();
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string s;
int main() {
cin >> s;
int cnt = 0;
int n = s.length();
fo... | [
"expression.operation.binary.add"
] | 916,890 | 916,891 | u063318293 | cpp |
p03107 |
// C - Unification
// スタックを用いた解法
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
int ans = 0;
stack<char> stk;
for (int i = 0; i < S.size(); i++) {
c... |
// C - Unification
// スタックを用いた解法
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
int ans = 0;
stack<char> stk;
for (int i = 0; i < S.size(); i++) {
c... | [] | 916,937 | 916,938 | u790272146 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
string s, t = "";
cin >> s;
int a, b;
rep(i, s.size()) {
if (s[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
string s, t = "";
cin >> s;
int a = 0, b = 0;
rep(i, s.size()) {
... | [
"variable_declaration.value.change"
] | 916,939 | 916,940 | u534923072 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string tumiki;
cin >> tumiki;
int count1 = 0;
int count2 = 0;
for (int i = 0; i < tumiki.size(); ++i) {
if (tumiki.at(i) == 0) {
count1++;
} else {
count2++;
}
}
int ans = min(count1, count2);
cout << ans * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string tumiki;
cin >> tumiki;
int count1 = 0;
int count2 = 0;
for (int i = 0; i < tumiki.size(); ++i) {
if (tumiki.at(i) == '0') {
count1++;
} else {
count2++;
}
}
int ans = min(count1, count2);
cout << ans * 2 << endl;
... | [
"control_flow.branch.if.condition.change"
] | 916,951 | 916,952 | u605833494 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string tumiki;
cin >> tumiki;
int count1 = 0;
int count2 = 0;
for (int i = 0; i < tumiki.size(); ++i) {
if (tumiki[i] == 0) {
count1++;
} else {
count2++;
}
}
int ans = min(count1, count2);
cout << ans * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string tumiki;
cin >> tumiki;
int count1 = 0;
int count2 = 0;
for (int i = 0; i < tumiki.size(); ++i) {
if (tumiki.at(i) == '0') {
count1++;
} else {
count2++;
}
}
int ans = min(count1, count2);
cout << ans * 2 << endl;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 916,953 | 916,952 | u605833494 | 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.at(i) == '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) << endl;
} | #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.at(i) == '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) * 2 << endl;
}
| [
"expression.operation.binary.add"
] | 916,954 | 916,955 | u991713078 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int aka = 0;
int ao = 0;
string S;
cin >> S;
for (int X = 0; X < S.size(); X++) {
if (S.at(X) == 0) {
aka++;
} else {
ao++;
}
}
int tou = min(ao, aka);
cout << tou * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int aka = 0;
int ao = 0;
string S;
cin >> S;
for (int X = 0; X < S.size(); X++) {
if (S.at(X) == '0') {
aka++;
} else {
ao++;
}
}
int tou = min(ao, aka);
cout << tou * 2 << endl;
} | [
"control_flow.branch.if.condition.change"
] | 916,956 | 916,957 | u740002394 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int aka = 0;
int ao = 0;
string S;
cin >> S;
for (int X = 0; X < S.size(); X++) {
if (S.at(X) = 0) {
aka++;
} else {
ao++;
}
}
int tou = min(ao, aka);
cout << tou * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int aka = 0;
int ao = 0;
string S;
cin >> S;
for (int X = 0; X < S.size(); X++) {
if (S.at(X) == '0') {
aka++;
} else {
ao++;
}
}
int tou = min(ao, aka);
cout << tou * 2 << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 916,958 | 916,957 | u740002394 | cpp |
p03107 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int main() {
string s;
cin >> s;
int count0 = 0;
int count1 = 0;
int n = s.size();
for (int i = 0; i < n; i++) {
if (... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int main() {
string s;
cin >> s;
int count0 = 0;
int count1 = 0;
int n = s.size();
for (int i = 0; i < n; i++) {
if (... | [
"control_flow.branch.if.condition.change"
] | 916,963 | 916,964 | u412057008 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
int inf = 1000001000;
ll INF = 100000000000000000;
ll MOD... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
int inf = 1000001000;
ll INF = 100000000000000000;
ll MOD... | [
"control_flow.branch.if.condition.change"
] | 916,971 | 916,972 | u510383220 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.