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 |
|---|---|---|---|---|---|---|---|
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int cnta = 0, cntb = 0;
bool turn = false;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) != s.at(i + 1) && !turn)
cnta++;
else if (s.at(i) !=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int cnta = 1, cntb = 0;
bool turn = false;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) != s.at(i + 1) && !turn)
cnta++;
else if (s.at(i) !=... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 883,939 | 883,940 | u343935874 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
string S;
int main() {
cin >> S;
int p1, p2 = 0;
// 0始まり
rep(i, S.size()) {
if (i % 2 == 0 && S[i] != '0')
p1++;
if (i % 2 == 1 && S[i] != '1')
p1++;
}
// 1始まり
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
string S;
int main() {
cin >> S;
int p1 = 0, p2 = 0;
// 0始まり
rep(i, S.size()) {
if (i % 2 == 0 && S[i] != '0')
p1++;
if (i % 2 == 1 && S[i] != '1')
p1++;
}
// 1始... | [
"variable_declaration.value.change"
] | 883,941 | 883,942 | u455366471 | cpp |
p03073 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = s.size();
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; j < s.size(); j++) {
if ((j % 2 == 0) ^ (s[i] == i + '0'))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = s.size();
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; j < s.size(); j++) {
if ((j % 2 == 0) ^ (s[j] == i + '0'))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 883,943 | 883,944 | u633402865 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> s;
n = s.size();
int no, ne;
ne = n / 2;
if (n % 2 == 0)
no = n / 2;
else
no = (n / 2) + 1;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (s.at(i) == '1')
b++; //偶数番目に... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> s;
n = s.size();
int no, ne;
ne = n / 2;
if (n % 2 == 0)
no = n / 2;
else
no = (n / 2) + 1;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (s.at(i) == '1')
a++; //奇数番目に... | [
"identifier.change"
] | 883,949 | 883,950 | u013069672 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
string S;
cin >> S;
int ans = S.size();
rep(i, 2) {
int cnt = 0; // 変える必要のあるタイル... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
string S;
cin >> S;
int ans = S.size();
rep(i, 2) {
int cnt = 0; // 変える必要のあるタイル... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 883,953 | 883,954 | u976045502 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans0 = 0;
int ans1 = 0;
int ans = 0;
// 0start
string s0 = s;
if (s0[0] == '1')
ans0++;
s0.replace(0, 1, "0");
for (int i = 1; i < s.size(); i++) {
if (s0[i - 1] == s0[i]) {
ans0++;
if (s0[i] == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans0 = 0;
int ans1 = 0;
int ans = 0;
// 0start
string s0 = s;
if (s0[0] == '1')
ans0++;
s0.replace(0, 1, "0");
for (int i = 1; i < s.size(); i++) {
if (s0[i - 1] == s0[i]) {
ans0++;
if (s0[i] == ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 883,959 | 883,960 | u785334194 | cpp |
p03073 | #include <iostream>
#include <vector>
using namespace std;
int main() {
string s, c;
cin >> s;
c.resize(100000);
int sum1 = 0;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
c[i] = '0';
} else {
c[i] = '1';
}
if (s[i] == c[i]) {
sum1++;
} else {
}
}
if (... | #include <iostream>
#include <vector>
using namespace std;
int main() {
string s, c;
cin >> s;
c.resize(100000);
int sum1 = 0;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
c[i] = '0';
} else {
c[i] = '1';
}
if (s[i] == c[i]) {
sum1++;
} else {
}
}
if (... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"expression.operation.binary.remove"
] | 883,961 | 883,962 | u519899937 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, co;
string s;
cin >> s;
co = 0;
for (i = 0; i < s.size(); ++i) {
if (i == 1) {
if (s[i - 1] == s[i]) {
if (s[i - 1] == '0') {
s[i] = 1;
} else {
s[i] = 0;
}
co = co + 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, co;
string s;
cin >> s;
co = 0;
for (i = 0; i < s.size(); ++i) {
if (i == 1) {
if (s[i - 1] == s[i]) {
if (s[i - 1] == '0') {
s[i] = '1';
} else {
s[i] = '0';
}
co = co + 1;
}... | [] | 883,967 | 883,968 | u144029820 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int ok = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (i % 2 == '0') {
if (S.at... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int ok = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
if (S.at(i... | [
"control_flow.branch.if.condition.change"
] | 883,971 | 883,972 | u028572059 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
int b = 0;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] != '1') {
a++;
}
if (s[i] != '0') {
b++;
}
} else {
if (s[i] != '1') {
a++;
}
... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
int b = 0;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] != '1') {
a++;
}
if (s[i] != '0') {
b++;
}
} else {
if (s[i] != '0') {
a++;
}
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 883,985 | 883,986 | u683667335 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int res = 1 << 30;
for (int i = 0; i <= 1; i++) {
int start = i;
int count = 0;
for (int j = 0; j < s.size(); j++) {
if (s[i] - '0' != start)
count++;
start = 1 - start;
}
res = min(res, co... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int res = 1 << 30;
for (int i = 0; i <= 1; i++) {
int start = i;
int count = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] - '0' != start)
count++;
start = 1 - start;
}
res = min(res, co... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 883,991 | 883,992 | u089528214 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
//#define ONLINE_JUDGE
#define ll long long
#define PI 3.14159265359
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define pb(a) push_back(a)
//////////// Solution /////////////////////////////////
const int MAXN = 1e5 + 1;
char s1[MAXN], s2[MAXN];
void so... | #include <bits/stdc++.h>
using namespace std;
#define ONLINE_JUDGE
#define ll long long
#define PI 3.14159265359
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define pb(a) push_back(a)
//////////// Solution /////////////////////////////////
const int MAXN = 1e5 + 1;
char s1[MAXN], s2[MAXN];
void solv... | [] | 884,009 | 884,010 | u361383723 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long count_1 = 0, count_0 = 0;
string s;
cin >> s;
char b[100010];
for (int i = 0; i < s.size(); i++) {
b[i] = s[i];
if ((i % 2 == 0) && s[i] == '1') {
count_0++;
} else if ((i % 2 == 0) && s[i] == ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long count_1 = 0, count_0 = 0;
string s;
cin >> s;
char b[100010];
for (int i = 0; i < s.size(); i++) {
b[i] = s[i];
if ((i % 2 == 0) && s[i] == '1') {
count_0++;
} else if ((i % 2 == 0) && s[i] == ... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 884,013 | 884,014 | u352604942 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long count_1 = 0, count_0 = 0;
string s;
cin >> s;
char b[100010];
for (int i = 0; i < s.size(); i++) {
b[i] = s[i];
if ((i % 2 == 0) && s[i] == '1') {
count_0++;
} else if ((i % 2 == 0) && s[i] == ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long count_1 = 0, count_0 = 0;
string s;
cin >> s;
char b[100010];
for (int i = 0; i < s.size(); i++) {
b[i] = s[i];
if ((i % 2 == 0) && s[i] == '1') {
count_0++;
} else if ((i % 2 == 0) && s[i] == ... | [
"expression.unary.arithmetic.remove",
"expression.unary.arithmetic.add",
"control_flow.branch.if.add"
] | 884,015 | 884,014 | u352604942 | cpp |
p03073 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s;
cin >> s;
char exs = s[0];
if (s[0] == '0')
exs = '1';
else
exs = '0';
bool flag = false;
int c = 0;
for (const auto &i : s) {
if (flag ^ (exs == i))
c++;
if (flag)
fl... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s;
cin >> s;
char exs = s[0];
if (s[0] == '0')
exs = '1';
else
exs = '0';
bool flag = false;
int c = 0;
for (const auto &i : s) {
if (flag ^ (exs == i))
c++;
if (exs == i)
... | [
"control_flow.branch.if.condition.change"
] | 884,024 | 884,025 | u884966843 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (long long int i = 0; i <= (n); ++i)
#define rep1(i, n) for (lo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (long long int i = 0; i <= (n); ++i)
#define rep1(i, n) for (lo... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 884,036 | 884,037 | u820341516 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
#define intv vector<int>
#define llv vector<long long>
#define intvv vec... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
#define intv vector<int>
#define llv vector<long long>
#define intvv vec... | [
"variable_declaration.value.change"
] | 884,039 | 884,040 | u379440427 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
#define intv vector<int>
#define llv vector<long long>
#define intvv vec... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
#define intv vector<int>
#define llv vector<long long>
#define intvv vec... | [
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,041 | 884,040 | u379440427 | cpp |
p03073 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#define REP_1(i, n) for (int i = 1; i < n + 1; i++)
#define bitSearch(bit, n) for (int bit =... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#define REP_1(i, n) for (int i = 1; i < n + 1; i++)
#define bitSearch(bit, n) for (int bit =... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 884,052 | 884,053 | u741556152 | cpp |
p03073 | #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 n... | #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 n... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,058 | 884,059 | u019465635 | cpp |
p03073 | #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 n... | #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 n... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 884,060 | 884,059 | u019465635 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define f first
#define s second
#define all(container) container.begin(), container.end()
#define fast \
ios::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define f first
#define s second
#define all(container) container.begin(), container.end()
#define fast \
ios::sync_with_stdio(0); ... | [
"assignment.variable.change",
"identifier.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,078 | 884,079 | u153896700 | cpp |
p03073 | #include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] - '0' == i % 2)
ans1++;
else
ans2++;
}
cout << max(ans1, ans2) << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] - '0' == i % 2)
ans1++;
else
ans2++;
}
cout << min(ans1, ans2) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,082 | 884,083 | u887207211 | cpp |
p03073 | // author: Saman Mahdanian
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
const int MOD = 1e9 + 7;
int _sum(int, int);
int _mul(int, int);
int _pow(int, int);
int gcd(int, int);
int dp[N][3];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size()... | // author: Saman Mahdanian
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
const int MOD = 1e9 + 7;
int _sum(int, int);
int _mul(int, int);
int _pow(int, int);
int gcd(int, int);
int dp[N][3];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size()... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 884,086 | 884,087 | u599788181 | cpp |
p03073 | #include <algorithm>
#include <assert.h>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
/*********************Contest Template*... | #include <algorithm>
#include <assert.h>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
/*********************Contest Template*... | [
"control_flow.branch.if.condition.change"
] | 884,088 | 884,089 | u009387624 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
// 方針
// 全体として、クリアできるパターンが
// 1,白黒白黒白 パターン 10101
// 2,黒白黒白黒 パターン 01010
// の2通りしかない。
// なので、総当りでこれにすればよさそう。
// Sは高々10^5なので、O(N)ならいける。
// とりあえず1番ルートで終わる過程でforループをまわす。
// 010101010 に一致しているか一文字づつチェックして、一致していない数をカウント。
// そのカウント数nが n >= |S|/2
// で場合わけして、超えてなかったらカウントした数が答え。
/... | #include <bits/stdc++.h>
using namespace std;
// 方針
// 全体として、クリアできるパターンが
// 1,白黒白黒白 パターン 10101
// 2,黒白黒白黒 パターン 01010
// の2通りしかない。
// なので、総当りでこれにすればよさそう。
// Sは高々10^5なので、O(N)ならいける。
// とりあえず1番ルートで終わる過程でforループをまわす。
// 010101010 に一致しているか一文字づつチェックして、一致していない数をカウント。
// そのカウント数nが n >= |S|/2
// で場合わけして、超えてなかったらカウントした数が答え。
/... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,092 | 884,093 | u587857074 | cpp |
p03073 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | [
"control_flow.branch.if.condition.change"
] | 884,100 | 884,101 | u031448582 | cpp |
p03073 | #include <stdio.h>
int main(void) {
char s[100000] = {0};
int kai = 0;
int i = 0;
scanf("%s", s);
for (i = 0; i <= 100000; i++) {
if (s[i] == 'i' && i % 2 != 0) {
kai++;
}
if (s[i] == '0' && i % 2 == 0) {
kai++;
}
if (s[i] == '\0') {
break;
}
}
if (kai * 2 < i) {... | #include <stdio.h>
int main(void) {
char s[100000] = {0};
int kai = 0;
int i = 0;
scanf("%s", s);
for (i = 0; i <= 100000; i++) {
if (s[i] == '1' && i % 2 != 0) {
kai++;
}
if (s[i] == '0' && i % 2 == 0) {
kai++;
}
if (s[i] == '\0') {
break;
}
}
if (kai * 2 < i) {... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 884,104 | 884,105 | u770491983 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int step = 0;
for (int i = 1; i < s.length() - 1; i++) {
if (s[i] == s[i - 1]) {
if (s[i] == '1') {
s[i] = '0';
} else {
s[i] = '1';
}
step++;
}
}
cout << step;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int step = 0;
for (int i = 1; i < s.length(); i++) {
if (s[i] == s[i - 1]) {
if (s[i] == '1') {
s[i] = '0';
} else {
s[i] = '1';
}
step++;
}
}
cout << step;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 884,119 | 884,120 | u014321021 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
char str[maxn];
int main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#endif
int n;
n = strlen(fgets(str, 100010, stdin));
int cnt = 0;
char ch = '0';
for (int i = 0; i < n; ++i) {
if (ch != str[i])
++cnt;
ch = ch ==... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
char str[maxn];
int main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#endif
int n;
n = strlen(fgets(str, 100010, stdin));
--n;
int cnt = 0;
char ch = '0';
for (int i = 0; i < n; ++i) {
if (ch != str[i])
++cnt;
ch ... | [
"expression.unary.arithmetic.add"
] | 884,124 | 884,125 | u209067041 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define fcin \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#define inf 0x3f3f3f3f
// 000 ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define fcin \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#define inf 0x3f3f3f3f
// 000 ... | [
"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"
] | 884,131 | 884,132 | u189873906 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
string s;
cin >> s;
//初期値は大きい値
int ans = s.size();
// iは最初に使う色（０か１）
for (int i = 0; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
string s;
cin >> s;
//初期値は大きい値
int ans = s.size();
// iは最初に使う色（０か１）
for (int i = 0; ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 884,138 | 884,139 | u373164102 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int color_exchanged = 0;
int odd_color_white = 0;
int odd_color_brack = 0;
for (int i = 0; i < S.size() / 2 + S.size() % 2; i++) {
if (S.at(2 * i) == 1) {
odd_color_white++;
} else {
odd_color_brack++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int color_exchanged = 0;
int odd_color_white = 0;
int odd_color_brack = 0;
for (int i = 0; i < S.size() / 2 + S.size() % 2; i++) {
if (S.at(2 * i) == '1') {
odd_color_white++;
} else {
odd_color_brack++;
... | [
"control_flow.branch.if.condition.change"
] | 884,144 | 884,145 | u830811818 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < sizeof(S) - 1; i++) {
if (S[i] == '0' && S[i + 1] != '1') {
S[i + 1] = '1';
count++;
} else if (S[i] == '1' && S[i + 1] != '0') {
S[i + 1] = '0';
count++;
}
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < S.length() - 1; i++) {
if (S[i] == '0' && S[i + 1] != '1') {
S[i + 1] = '1';
count++;
} else if (S[i] == '1' && S[i + 1] != '0') {
S[i + 1] = '0';
count++;
}
... | [
"control_flow.loop.for.condition.change",
"call.add"
] | 884,146 | 884,147 | u006721330 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count_z = 0;
int count_o = 0;
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 1) {
if (S.at(i) == '0')
count_o++;
else
count_z++;
} else {
if (S.at(i) == '0')
count_z++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count_z = 0;
int count_o = 0;
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 1) {
if (S.at(i) == '0')
count_o++;
else
count_z++;
} else {
if (S.at(i) == '0')
count_z++;
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,148 | 884,149 | u826764011 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
string n;
int a, b;
cin >> n;
for (int i = 0; i < n.size(); i++) {
if (i % 2 == 0) {
if (n[i] == '0') {
a++;
} else {
b++;
}
} else {
if (n[i] == '0') {
b++;
} else {
a++;... | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
string n;
int a = 0, b = 0;
cin >> n;
for (int i = 0; i < n.size(); i++) {
if (i % 2 == 0) {
if (n[i] == '0') {
a++;
} else {
b++;
}
} else {
if (n[i] == '0') {
b++;
} else {
... | [
"variable_declaration.value.change"
] | 884,157 | 884,158 | u843574076 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int b_start = 0;
int w_start = 0;
for (int i = 0; i < s.length(); i++) {
if (i % 2) {
if (s[i] == '0') {
b_start++;
} else {
w_start++;
}... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int b_start = 0;
int w_start = 0;
for (int i = 0; i < s.length(); i++) {
if (i % 2) {
if (s[i] == '0') {
b_start++;
} else {
w_start++;
}... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 884,163 | 884,164 | u412550879 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int c1, c2;
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
if (S.at(i) != '0')
c1++;
if (S.at(i) != '1')
c2++;
} else {
if (S.at(i) != '1')
c1++;
if (S.at(i) != '0')
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int c1 = 0, c2 = 0;
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
if (S.at(i) != '0')
c1++;
if (S.at(i) != '1')
c2++;
} else {
if (S.at(i) != '1')
c1++;
if (S.at(i) !... | [
"variable_declaration.value.change"
] | 884,167 | 884,168 | u127361799 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int c1, c2;
for (int i = 0; i < S.size(); i++) {
if (i % 2 != 0) {
if (S.at(i) != '0')
c1++;
if (S.at(i) != '1')
c2++;
} else {
if (S.at(i) != '1')
c1++;
if (S.at(i) != '0')
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int c1 = 0, c2 = 0;
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
if (S.at(i) != '0')
c1++;
if (S.at(i) != '1')
c2++;
} else {
if (S.at(i) != '1')
c1++;
if (S.at(i) !... | [
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,169 | 884,168 | u127361799 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
string S;
cin >> S;
x = 0;
n = S.size();
for (int i = 0; i < n / 2; i++) {
if (S.at(2 * i) == '1') {
x++;
}
if (S.at(2 * i + 1) == '0') {
x++;
}
}
if (n % 2 == 1) {
if (S.at(n - 1) = '1') {
x++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
string S;
cin >> S;
x = 0;
n = S.size();
for (int i = 0; i < n / 2; i++) {
if (S.at(2 * i) == '1') {
x++;
}
if (S.at(2 * i + 1) == '0') {
x++;
}
}
if (n % 2 == 1) {
if (S.at(n - 1) == '1') {
x++;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 884,178 | 884,179 | u201743726 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.length();
int ans_a = 0;
int ans_b = 0;
//奇数0,偶数1
for (int i = 0; i < n; i++) {
if (i % 2 == 1) {
if (s[i] == '0') {
ans_a++;
}
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.length();
int ans_a = 0;
int ans_b = 0;
//奇数0,偶数1
for (int i = 0; i < n; i++) {
if (i % 2 == 1) {
if (s[i] == '0') {
ans_a++;
}
}
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,186 | 884,187 | u407416173 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int black = 48;
const int white = 49;
int main() {
string S;
cin >> S;
int N = S.length();
int ans_w = 0;
for (int i = 0; i < N; ++i) {
int _01 = (i / 2 == 0 ? white : black);
if (S[i] != _01) {
ans_w++;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int black = 48;
const int white = 49;
int main() {
string S;
cin >> S;
int N = S.length();
int ans_w = 0;
for (int i = 0; i < N; ++i) {
int _01 = (i % 2 == 0 ? white : black);
if (S[i] != _01) {
ans_w++;
... | [
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 884,212 | 884,213 | u128142352 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
int sum = 0, ans = 0;
string a;
cin >> a;
for (int i = 1; i <= a.size() - 1; i++) {
if (i % 2 == 0 && a[i] == '1') {
sum++;
} else if (i % 2 == 1 && a[i] == '0') {
sum++;
}
}
for (int i = 1; i <= a.size() - 1; i++) {
if (i % 2... | #include <iostream>
using namespace std;
int main() {
int sum = 0, ans = 0;
string a;
cin >> a;
for (int i = 0; i <= a.size() - 1; i++) {
if (i % 2 == 0 && a[i] == '1') {
sum++;
} else if (i % 2 == 1 && a[i] == '0') {
sum++;
}
}
for (int i = 0; i <= a.size() - 1; i++) {
if (i % 2... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,228 | 884,229 | u526508003 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
int sum = 0, ans = 0;
string a;
cin >> a;
for (int i = 1; i < a.size() - 1; i++) {
if (i % 2 == 0 && a[i] == '1') {
sum++;
} else if (i % 2 == 1 && a[i] == '0') {
sum++;
}
}
for (int i = 0; i < a.size() - 1; i++) {
if (i % 2 =... | #include <iostream>
using namespace std;
int main() {
int sum = 0, ans = 0;
string a;
cin >> a;
for (int i = 0; i <= a.size() - 1; i++) {
if (i % 2 == 0 && a[i] == '1') {
sum++;
} else if (i % 2 == 1 && a[i] == '0') {
sum++;
}
}
for (int i = 0; i <= a.size() - 1; i++) {
if (i % 2... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"identifier.change",
"call.func... | 884,230 | 884,229 | u526508003 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; j < s.size(); j++) {
if (s[i] != (char)('0' + (j + i) % 2))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] != (char)('0' + (j + i) % 2))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
return 0;... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 884,233 | 884,234 | u426657245 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int l = S.length();
int a = 0, b = 0;
for (int i = 0; i < l; ++i) {
if (i % 2 == 0) {
if (S[i] == 0) {
++b;
} else {
++a;
}
} else {
if (S[i] == 0) {
++a;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int l = S.length();
int a = 0, b = 0;
for (int i = 0; i < l; ++i) {
if (i % 2 == 0) {
if (S[i] == '0') {
++b;
} else {
++a;
}
} else {
if (S[i] == '0') {
++a;
} e... | [
"control_flow.branch.if.condition.change"
] | 884,235 | 884,236 | u430974466 | cpp |
p03073 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 884,239 | 884,240 | u601825761 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | [
"assignment.add"
] | 884,256 | 884,257 | u888717396 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | [
"assignment.add",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 884,258 | 884,257 | u888717396 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
int n = s.size();
int c1 = 0;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
c1++;
if (s.at(i) == '0') {
s.at(i + 1) = '1';
} else {
s.at(i + 1) = '0';
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
t = s;
int n = s.size();
int c1 = 0;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
c1++;
if (s.at(i) == '0') {
s.at(i + 1) = '1';
} else {
s.at(i + 1) = '0';
}
... | [
"assignment.add"
] | 884,264 | 884,265 | u704064492 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a = 0;
int S_size;
string S;
cin >> S;
rep(i, S.size()) {
if (S[i] % 2) {
a++;
}
}
S_size = S.size();
cout << min(a, S_size - a) ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a = 0;
int S_size;
string S;
cin >> S;
rep(i, S.size()) {
if ((S[i] - i) % 2) {
a++;
}
}
S_size = S.size();
cout << min(a, S_size... | [
"control_flow.branch.if.condition.change"
] | 884,266 | 884,267 | u352228045 | cpp |
p03073 | #include <iostream>
#include <string>
int main(void) {
int start_1 = 0;
int start_0 = 0;
std::string str;
std::cin >> str;
bool trans = true;
for (int i = 0; i < str.size(); ++i) {
if (trans) {
if (str[i] == '0')
++start_1;
if (str[i] == '1')
++start_0;
} else {
if... | #include <iostream>
#include <string>
int main(void) {
int start_1 = 0;
int start_0 = 0;
std::string str;
std::cin >> str;
bool trans = true;
for (int i = 0; i < str.size(); ++i) {
if (trans) {
if (str[i] == '0')
++start_1;
if (str[i] == '1')
++start_0;
} else {
if... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 884,272 | 884,273 | u481584122 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> restr1(s.size(), '1');
for (int i = 0; i < s.size(); i++)
if (i % 2 == 1)
restr1.at(i) == '0';
vector<char> restr0(s.size(), '0');
for (int i = 0; i < s.size(); i++)
if (i % 2 == 1)
restr0.at(i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> restr1(s.size(), '1');
for (int i = 0; i < s.size(); i++)
if (i % 2 == 1)
restr1.at(i) = '0';
vector<char> restr0(s.size(), '0');
for (int i = 0; i < s.size(); i++)
if (i % 2 == 1)
restr0.at(i) ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 884,281 | 884,282 | u716917908 | cpp |
p03073 | #include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
const int N = S.length();
int ans = (int)1e9;
for (int i = 0; i < 2; i++) {
int pre = 0;
for (int j = 0; j < N; j++) {
const char cur = '0' + (i + j) % 2;
if (cur != S[i])
pre++;
}
ans = min(an... | #include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
const int N = S.length();
int ans = (int)1e9;
for (int i = 0; i < 2; i++) {
int pre = 0;
for (int j = 0; j < N; j++) {
const char cur = '0' + (i + j) % 2;
if (cur != S[j])
pre++;
}
ans = min(an... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 884,300 | 884,301 | u443010331 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int z = 0, o = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != ('0' + i % 2)) {
z++;
}
if (s[i] != ('1' - i % 2)) {
o++;
}
}
cout << max(z, o) << endl;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int z = 0, o = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != ('0' + i % 2)) {
z++;
}
if (s[i] != ('1' - i % 2)) {
o++;
}
}
cout << min(z, o) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,304 | 884,305 | u159335277 | cpp |
p03073 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <c... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <c... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,308 | 884,309 | u199371251 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, s1, x, x1;
cin >> s;
s1 = s;
int h = 0;
for (int i = 0; i < s.size(); i++) {
x += (char)(h % 2 + '0');
x1 += (char)(h % 2 + 1 + '0');
h++;
}
int ans = 0, ans1 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != x[i])
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, s1, x, x1;
cin >> s;
s1 = s;
int h = 0;
for (int i = 0; i < s.size(); i++) {
x += (char)(h % 2 + '0');
x1 += (char)(1 ^ h % 2 + '0');
h++;
}
int ans = 0, ans1 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != x[i])
... | [
"assignment.change",
"expression.operation.binary.remove"
] | 884,310 | 884,311 | u265392294 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int answer_w = 0;
int answer_b = 0;
string S;
cin >> S;
REP(i, S.size()) {
if (i % 2 == 1) {
if (S[i] == '1') {
answer_w++;
} else {
answer_b++;
}
} else {
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int answer_w = 0;
int answer_b = 0;
string S;
cin >> S;
REP(i, S.size()) {
if (i % 2 == 1) {
if (S[i] == '0') {
answer_w++;
} else {
answer_b++;
}
} else {
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 884,322 | 884,323 | u973995516 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.siz... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.siz... | [
"assignment.add"
] | 884,328 | 884,329 | u303059352 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a, b;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 1) {
if (s.at(i) == '0')
b++;
else
a++;
} else {
if (s.at(i) == '0')
a++;
else
b++;
}
}
if (a > b)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a = 0, b = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 1) {
if (s.at(i) == '0')
b++;
else
a++;
} else {
if (s.at(i) == '0')
a++;
else
b++;
}
}
if (... | [
"variable_declaration.value.change"
] | 884,332 | 884,333 | u952865396 | cpp |
p03073 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int sl = s.length();
string hoge = "";
string fuga = "";
for (int i = 0; i < sl; i++) {
if (i % 2 == 0) {
hoge += "0";
} else {
hoge += "1";
}
}
for (int i = 0; i < sl; i++) {
if... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int sl = s.length();
string hoge = "";
string fuga = "";
for (int i = 0; i < sl; ++i) {
if (i % 2 == 0) {
hoge += "0";
} else {
hoge += "1";
}
}
for (int i = 0; i < sl; ++i) {
if... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,343 | 884,344 | u947071639 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans1, ans2;
for (int i = 0; i < S.length(); ++i) {
if (S[i] - '0' != i % 2)
ans1++;
if (S[i] - '0' != (i + 1) % 2)
ans2++;
}
cout << min(ans1, ans2);
}
| #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < S.length(); ++i) {
if (S[i] - '0' != i % 2)
ans1++;
if (S[i] - '0' != (i + 1) % 2)
ans2++;
}
cout << min(ans1, ans2);
}
| [
"variable_declaration.add"
] | 884,345 | 884,346 | u494284451 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans1, ans2;
for (int i = 0; i < S.length(); ++i) {
if (S[i] - '0' != i % 2)
ans1++;
if (S[i] - '0' != (i + 1) % 2)
ans2++;
}
cout << min(ans1, ans2);
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < S.length(); ++i) {
if (S[i] - '0' != i % 2)
ans1++;
if (S[i] - '0' != (i + 1) % 2)
ans2++;
}
cout << min(ans1, ans2);
}
| [
"variable_declaration.add"
] | 884,347 | 884,346 | u494284451 | cpp |
p03073 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char *gen_10_bits(int len) {
int i;
char *bit_s;
bit_s = (char *)malloc(sizeof(char) * len);
for (i = 0; i < len; i++) {
bit_s[i] = i % 2 == 0 ? '1' : '0';
}
return bit_s;
}
char *gen_01_bits(int len) {
int i;
char *bi... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char *gen_10_bits(int len) {
int i;
char *bit_s;
bit_s = (char *)malloc(sizeof(char) * len);
for (i = 0; i < len; i++) {
bit_s[i] = i % 2 == 0 ? '1' : '0';
}
return bit_s;
}
char *gen_01_bits(int len) {
int i;
char *bi... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,350 | 884,351 | u231798544 | cpp |
p03073 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char *gen_10_bits(int len) {
int i;
char *bit_s;
bit_s = (char *)malloc(sizeof(char) * len);
for (i = 0; i < len; i++) {
bit_s[i] = i % 2 == 0 ? '1' : '0';
}
return bit_s;
}
char *gen_01_bits(int len) {
int i;
char *bi... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char *gen_10_bits(int len) {
int i;
char *bit_s;
bit_s = (char *)malloc(sizeof(char) * len);
for (i = 0; i < len; i++) {
bit_s[i] = i % 2 == 0 ? '1' : '0';
}
return bit_s;
}
char *gen_01_bits(int len) {
int i;
char *bi... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,352 | 884,351 | u231798544 | cpp |
p03073 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^=... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^=... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,358 | 884,359 | u040251933 | cpp |
p03073 | #include <iostream>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main(void) {
int a[2], sw = 0;
a[0] = a[1] = 0;
string S;
cin >> S;
int length = S.length();
char before = S[0];
a[0]++;
for (int i = 1; i < length; i++) {
if (S[i] != before) {
a[sw]++;
} ... | #include <iostream>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main(void) {
int a[2], sw = 0;
a[0] = a[1] = 0;
string S;
cin >> S;
int length = S.length();
char before = S[0];
a[0]++;
for (int i = 1; i < length; i++) {
if (S[i] != before) {
a[sw]++;
} ... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 884,364 | 884,365 | u130128796 | cpp |
p03073 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
ret... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
ret... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 884,366 | 884,367 | u496074393 | cpp |
p03073 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >... | [
"variable_declaration.value.change"
] | 884,373 | 884,374 | u696415377 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int p = 0, b = 1;
int s1 = 0, s2 = 0;
for (int i = 1; i < s.size(); ++i) {
p ^= 1;
b ^= 1;
if (s[i] - '0' != p)
++s1;
if (s[i] - '0' != b)
++s2;
}
printf("%d", min(s1, s2));
// cout<<s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int p = 0, b = 1;
int s1 = 0, s2 = 0;
for (int i = 0; i < s.size(); ++i) {
p ^= 1;
b ^= 1;
if (s[i] - '0' != p)
++s1;
if (s[i] - '0' != b)
++s2;
}
printf("%d", min(s1, s2));
// cout<<s;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,375 | 884,376 | u761827806 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int n = a.size();
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (a[i] == 0) {
ans1++;
} else {
ans2++;
}
} else {
if (a[i] == 0) {
ans2++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int n = a.size();
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (a[i] == '0') {
ans1++;
} else {
ans2++;
}
} else {
if (a[i] == '0') {
ans2+... | [
"control_flow.branch.if.condition.change"
] | 884,379 | 884,380 | u942393279 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
string s;
int dp[100005][2];
int main() {
ios::sync_with_stdio(false);
cin >> s;
memset(dp, 0x3f, sizeof(dp));
dp[0][0] = 0;
dp[0][1] = 1;
for (int i = 1; i < s.length(); i++) {
if (s[i] == s[i - 1])
dp[i][1] = min(dp[i][1], dp[i - 1][0] + 1),
dp... | #include <bits/stdc++.h>
using namespace std;
string s;
int dp[100005][2];
int main() {
ios::sync_with_stdio(false);
cin >> s;
memset(dp, 0x3f, sizeof(dp));
dp[0][0] = 0;
dp[0][1] = 1;
for (int i = 1; i < s.length(); i++) {
if (s[i] == s[i - 1])
dp[i][1] = min(dp[i][1], dp[i - 1][0] + 1),
dp... | [
"assignment.change"
] | 884,383 | 884,384 | u777892860 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
string s;
int dp[100005][2];
int main() {
ios::sync_with_stdio(false);
cin >> s;
memset(dp, 0, sizeof(dp));
dp[0][0] = 0;
dp[0][1] = 1;
for (int i = 1; i < s.length(); i++) {
if (s[i] == s[i - 1])
dp[i][1] = min(dp[i][1], dp[i - 1][0] + 1),
dp[i]... | #include <bits/stdc++.h>
using namespace std;
string s;
int dp[100005][2];
int main() {
ios::sync_with_stdio(false);
cin >> s;
memset(dp, 0x3f, sizeof(dp));
dp[0][0] = 0;
dp[0][1] = 1;
for (int i = 1; i < s.length(); i++) {
if (s[i] == s[i - 1])
dp[i][1] = min(dp[i][1], dp[i - 1][0] + 1),
dp... | [
"call.arguments.change",
"assignment.change"
] | 884,385 | 884,384 | u777892860 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
// string current;
char current;
char begin;
// string begin;
begin = '0';
current = begin;
// vector<string> A(N);
int ans_a = 0;
for (int i = 1; i < N; ++i) {
if (S[i] == current) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
// string current;
char current;
char begin;
// string begin;
begin = '0';
current = begin;
// vector<string> A(N);
int ans_a = 0;
for (int i = 0; i < N; ++i) {
if (S[i] == current) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,395 | 884,396 | u307834890 | cpp |
p03073 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace s... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace s... | [
"variable_declaration.value.change"
] | 884,403 | 884,404 | u375619974 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int n;
n = s.size();
int count_0 = 0;
int count_1 = 0;
for (int i = 0; i < n; i++) {
int b = i % 2;
if (b == 0) {
if (s[i] == '0')
count_1++;
else
count_0++... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int n;
n = s.size();
int count_0 = 0;
int count_1 = 0;
for (int i = 0; i < n; i++) {
int b = i % 2;
if (b == 0) {
if (s[i] == '0')
count_1++;
else
count_0++... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 884,405 | 884,406 | u189404681 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = n - 1; i >= 0; --i)
#define pb push_back
typedef long long ll;
int main() {
string s;
cin >> s;
int ans1 = 0;
int ans2 = 0;
// ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = n - 1; i >= 0; --i)
#define pb push_back
typedef long long ll;
int main() {
string s;
cin >> s;
int ans1 = 0;
int ans2 = 0;
// ... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 884,407 | 884,408 | u349293635 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = n - 1; i >= 0; --i)
#define pb push_back
typedef long long ll;
int main() {
string s;
cin >> s;
int ans1 = 0;
int ans2 = 0;
// ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = n - 1; i >= 0; --i)
#define pb push_back
typedef long long ll;
int main() {
string s;
cin >> s;
int ans1 = 0;
int ans2 = 0;
// ... | [
"literal.number.change",
"call.arguments.change",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 884,409 | 884,408 | u349293635 | cpp |
p03073 | #include <algorithm>
#include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
// cout << "dbg " << i << ", " << S.at(i) << " ";
if (i % 2) {
if (S.at(i) == '0')
ans++;
// cout << ans << e... | #include <algorithm>
#include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
// cout << "dbg " << i << ", " << S.at(i) << " ";
if (i % 2) {
if (S.at(i) == '0')
ans++;
// cout << ans << e... | [] | 884,414 | 884,415 | u641922479 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (long long i = 0; i < (n); i++)
int main() {
string S;
cin >> S;
string St = S;
int ans = 0;
if (St[0] == '1') {
ans++;
St[0] = '0';
}
for (int i = 1; i < St.size(); ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (long long i = 0; i < (n); i++)
int main() {
string S;
cin >> S;
string St = S;
int ans = 0;
if (St[0] == '1') {
ans++;
St[0] = '0';
}
for (int i = 1; i < St.size(); ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 884,422 | 884,423 | u353542198 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (long long i = 0; i < (n); i++)
int main() {
string S;
cin >> S;
string St = S;
int ans = 0;
if (St[0] == '1') {
ans++;
St[0] = '0';
}
for (int i = 1; i < St.size(); i... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (long long i = 0; i < (n); i++)
int main() {
string S;
cin >> S;
string St = S;
int ans = 0;
if (St[0] == '1') {
ans++;
St[0] = '0';
}
for (int i = 1; i < St.size(); ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"identifier.change"
] | 884,424 | 884,423 | u353542198 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100007;
int n, m, k, ans1, ans2;
bool h[maxn];
char str[maxn];
int main() {
// freopen("in.txt","r",stdin);
scanf("%s", str);
int len = strlen(str);
ans1 = ans2 = 0;
char bef, aft;
if (len == 1) {
printf("0\n");
return 0;
}
bef = s... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100007;
int n, m, k, ans1, ans2;
bool h[maxn];
char str[maxn];
int main() {
// freopen("in.txt","r",stdin);
scanf("%s", str);
int len = strlen(str);
ans1 = ans2 = 0;
char bef, aft;
if (len == 1) {
printf("0\n");
return 0;
}
bef = s... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 884,425 | 884,426 | u069164832 | cpp |
p03073 | #include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
constexpr int WALL = 1000000007;
struct Point {
int x;
int y;
Poin... | #include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
constexpr int WALL = 1000000007;
struct Point {
int x;
int y;
Poin... | [
"assignment.add"
] | 884,427 | 884,428 | u577747009 | cpp |
p03073 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int sum[2] = {0, 0};
for (int j = 0; j <= 1; j++) {
int start = j;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
if (start == 1)
sum[j]++;
}
if (s[i] == '1') {
... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int sum[2] = {0, 0};
for (int j = 0; j <= 1; j++) {
int start = j;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
if (start == 1)
sum[j]++;
}
if (s[i] == '1') {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,429 | 884,430 | u128456980 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rer(i, l, u) for (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rer(i, l, u) for (... | [
"call.arguments.change"
] | 884,433 | 884,434 | u484962958 | cpp |
p03073 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 999999999
#define llong long long
using namespace std;
int main() {
string s;
cin >> s;
int c1 = 0;
int c2 = 0;
int N = s.size(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 999999999
#define llong long long
using namespace std;
int main() {
string s;
cin >> s;
int c1 = 0;
int c2 = 0;
int N = s.size(... | [
"control_flow.branch.if.condition.change"
] | 884,435 | 884,436 | u831416184 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
int sum2 = 0;
for (int i = 1; i < s.size(); i += 2) {
if (s[i - 1] == '1')
sum++;
if (i > s.size())
break;
if (s[i] == '0')
sum++;
}
for (int i = 1; i < s.size(); i += 2) {
if (s[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
int sum2 = 0;
for (int i = 1; i <= s.size(); i += 2) {
if (s[i - 1] == '1')
sum++;
if (i >= s.size())
break;
if (s[i] == '0')
sum++;
}
for (int i = 1; i <= s.size(); i += 2) {
if (... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 884,439 | 884,440 | u876558178 | cpp |
p03073 | #define REP(i, n) for (int i = 0; i < n; i++)
#define INF 2e9
#define ll long long
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ALL(v) v.begin(), v.end()
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
int dy[] = {0, 0, 1, -1};
... | #define REP(i, n) for (int i = 0; i < n; i++)
#define INF 2e9
#define ll long long
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ALL(v) v.begin(), v.end()
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
int dy[] = {0, 0, 1, -1};
... | [] | 884,443 | 884,444 | u128196936 | cpp |
p03073 | #include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
auto p = s.front();
int n1 = 0;
for (int i = 0; i < s.size(); i += 2) {
if (s[i] != '0') {
n1++;
}
}
int n2 = 0;
for (int i = 1; i < s.size(); i += 2) {
if (s[i] != '0') {
n2++;
}
}
auto n1... | #include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
auto p = s.front();
int n1 = 0;
for (int i = 0; i < s.size(); i += 2) {
if (s[i] != '0') {
n1++;
}
}
int n2 = 0;
for (int i = 1; i < s.size(); i += 2) {
if (s[i] != '0') {
n2++;
}
}
auto n1... | [
"assignment.change"
] | 884,445 | 884,446 | u099124596 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt","r",stdin);
string s, sc;
cin >> s;
sc = s;
int l = s.length();
int cnt1 = 0, cnt2 = 0;
for (int i = 1; i < l; i++) {
if (s[i] == s[i - 1]) {
cnt1++;
if (s[i] == '1')
s[i] = '0';
else
s[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt","r",stdin);
string s, sc;
cin >> s;
sc = s;
int l = s.length();
int cnt1 = 0, cnt2 = 1;
for (int i = 1; i < l; i++) {
if (s[i] == s[i - 1]) {
cnt1++;
if (s[i] == '1')
s[i] = '0';
else
s[i]... | [
"literal.number.change",
"variable_declaration.value.change"
] | 884,451 | 884,452 | u202078305 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N;
N = S.size();
int count = 0;
for (int i = 1; i < S.size() - 1; i++) {
if (S.at(i) == '1' && S.at(i + 1) == '1') {
S.at(i + 1) = 0;
count = count + 1;
} else if (S.at(i) == '0' && S.at(i + 1) == '0') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N;
N = S.size();
int count = 0;
for (int i = 0; i < S.size() - 1; i++) {
if (S.at(i) == '1' && S.at(i + 1) == '1') {
S.at(i + 1) = '0';
count = count + 1;
} else if (S.at(i) == '0' && S.at(i + 1) == '0') {... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,457 | 884,458 | u028061225 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
cin >> s;
int cnt1 = 0, cnt2 = 0;
rep(i, s.size()) {
if (i % 2 == 0)
if (s[i] == '0')
cnt1++;
else if (s[i] == '1')
cnt1++;
}
rep(i, s.size()) {
if (i % 2 ==... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
cin >> s;
int cnt1 = 0, cnt2 = 0;
rep(i, s.size()) {
if (i % 2 == 0) {
if (s[i] == '0')
cnt1++;
} else {
if (s[i] == '1')
cnt1++;
}
}
rep(i, s.size()) {
... | [] | 884,461 | 884,462 | u083190434 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<string> VS;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
string S;
cin >> S;
int len = S.l... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<string> VS;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
string S;
cin >> S;
int len = S.l... | [
"call.arguments.change"
] | 884,463 | 884,464 | u594140666 | cpp |
p03073 | #include <algorithm>
#include <iostream>
using namespace std;
int h[100005][3] = {0};
int main() {
int n = 0;
for (int i = 1; i <= 100004; i++) {
if (i % 2 == 0) {
h[i][1] = 1;
h[i][2] = 0;
} else {
h[i][1] = 0;
h[i][2] = 1;
}
}
char a;
while (cin >> a) {
n++;
if ... | #include <algorithm>
#include <iostream>
using namespace std;
int h[100005][3] = {0};
int main() {
int n = 0;
for (int i = 1; i <= 100004; i++) {
if (i % 2 == 0) {
h[i][1] = 1;
h[i][2] = 0;
} else {
h[i][1] = 0;
h[i][2] = 1;
}
}
char a;
while (cin >> a) {
n++;
if ... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 884,465 | 884,466 | u791146764 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define MD 1000000007
typedef long long int ll;
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
string s;
cin >> s;
i... | #include <bits/stdc++.h>
using namespace std;
#define MD 1000000007
typedef long long int ll;
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
string s;
cin >> s;
i... | [
"assignment.add"
] | 884,490 | 884,491 | u287060310 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
for (int a = 1; a < s.size(); a++) {
if (s.at(a - 1) + s.at(a) - '0' - '0' != 1) {
if (s.at(a) = '0')
s.at(a)++;
else
s.at(a)--;
ans++;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
for (int a = 1; a < s.size(); a++) {
if (s.at(a - 1) + s.at(a) - '0' - '0' != 1) {
if (s.at(a) == '0')
s.at(a)++;
else
s.at(a)--;
ans++;
}
}
cout << ans;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 884,494 | 884,495 | u250952439 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
for (int a = 1; a < s.size(); a++) {
if (s.at(a - 1) + s.at(a) - '0' - '0' != 0) {
if (s.at(a) = '0')
s.at(a)++;
else
s.at(a)--;
ans++;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
for (int a = 1; a < s.size(); a++) {
if (s.at(a - 1) + s.at(a) - '0' - '0' != 1) {
if (s.at(a) == '0')
s.at(a)++;
else
s.at(a)--;
ans++;
}
}
cout << ans;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 884,496 | 884,495 | u250952439 | cpp |
p03073 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).... |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).... | [
"literal.number.change",
"assignment.value.change"
] | 884,501 | 884,502 | u165567408 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
const int INF = 1 << 30, MOD = 1000000007;
const ll LINF = 1ll << 60;
#define _ol3(_1, _2, _3, name, ...) na... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
const int INF = 1 << 30, MOD = 1000000007;
const ll LINF = 1ll << 60;
#define _ol3(_1, _2, _3, name, ...) na... | [
"call.arguments.change"
] | 884,507 | 884,508 | u502709453 | cpp |
p03073 |
#include <stdio.h>
int main(void) {
char s[100000];
scanf("%s", s);
int counta = 0, countb = 0;
for (int i = 0; i < 100000; i++) {
if (s[i] != '\0') {
if (i % 2 == 0 && s[i] == '1')
counta++;
if (i % 2 == 1 && s[i] == '0')
counta++;
if (i % 2 == 0 && s[i] == '0')
c... |
#include <stdio.h>
int main(void) {
char s[100000];
scanf("%s", s);
int counta = 0, countb = 0;
for (int i = 0; i < 100000; i++) {
if (s[i] != '\0') {
if (i % 2 == 0 && s[i] == '1')
counta++;
if (i % 2 == 1 && s[i] == '0')
counta++;
if (i % 2 == 0 && s[i] == '0')
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,511 | 884,512 | u872031579 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.