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 |
|---|---|---|---|---|---|---|---|
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
int H = 0;
int M;
for (int i = 0; i < N; i++) {
cin >> M;
if (M >= H) {
H = M;
sum++;
} else {
break;
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
int H = 0;
int M;
for (int i = 0; i < N; i++) {
cin >> M;
if (M >= H) {
H = M;
sum++;
} else {
}
}
cout << sum << endl;
}
| [] | 883,468 | 883,469 | u180399266 | cpp |
p03072 | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#de... | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#de... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,478 | 883,479 | u764234894 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 883,485 | 883,486 | u334351654 | cpp |
p03072 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n;
cin >> n;
int ans = 1;
int a;
cin >> a;
for (int i = 0; i < n; i++) {
int b;
cin >> b;
if (a <= b) {
ans++;
}
a = max(a, b);
}
... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n;
cin >> n;
int ans = 1;
int a;
cin >> a;
for (int i = 1; i < n; i++) {
int b;
cin >> b;
if (a <= b) {
ans++;
}
a = max(a, b);
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 883,489 | 883,490 | u483156389 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
vector<int> h(n);
cin >> n;
rep(i, n) { cin >> h[i]; }
int max = 0, cnt = 0;
rep(i, n) {
if (h[i] >= max) {
cnt++;
max = h[i];
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
int h[20];
cin >> n;
rep(i, n) { cin >> h[i]; }
int max = 0, cnt = 0;
rep(i, n) {
if (h[i] >= max) {
cnt++;
max = h[i];
}
}
cout << cnt << endl;
}
| [] | 883,491 | 883,492 | u532086793 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int m;
int ans;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (h >= m) {
ans++;
m = h;
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int m = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (h >= m) {
ans++;
m = h;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 883,499 | 883,500 | u090436701 | cpp |
p03072 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n;
int h[20];
int max;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (h[i] >= max) {
ans++;
max = h[i];
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n;
int h[20];
int max = 0;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (h[i] >= max) {
ans++;
max = h[... | [
"variable_declaration.value.change"
] | 883,501 | 883,502 | u516922881 | cpp |
p03072 | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <memory>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbe... | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <memory>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbe... | [
"variable_declaration.value.change"
] | 883,503 | 883,504 | u039805629 | cpp |
p03072 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n)... | [
"assignment.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 883,505 | 883,506 | u136378781 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* define const */
const long long INF = (... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* define const */
const long long INF = (... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,507 | 883,508 | u218759384 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int maxH = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (maxH < h) {
maxH = h;
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int maxH = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (maxH <= h) {
maxH = h;
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,509 | 883,510 | u506320030 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int array[N];
for (int i = 0; i < N; i++) {
cin >> array[i];
}
int y = 1;
for (int i = 1; i < N; i++) {
int flag = 0;
for (int j = 0; j < i; j++) {
if (array[i] <= array[... | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int array[N];
for (int i = 0; i < N; i++) {
cin >> array[i];
}
int y = 1;
for (int i = 1; i < N; i++) {
int flag = 0;
for (int j = 0; j < i; j++) {
if (array[i] < array[j... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,516 | 883,517 | u366036376 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int a, b = 0, c, count = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> c;
if (b < c) {
count++;
b = c;
}
}
cout << count << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b = 0, c, count = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> c;
if (b <= c) {
count++;
b = c;
}
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,523 | 883,524 | u805131136 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int nWatch = 1;
vector<int> Hotels;
for (int i = 0; i < N; ++i) {
bool canWatch = true;
int nHigh;
cin >> nHigh;
for (int j = 0; j < i; ++j) {
if (nHigh < Hotels[j]) {
canWatch = false;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int nWatch = 0;
vector<int> Hotels;
for (int i = 0; i < N; ++i) {
bool canWatch = true;
int nHigh;
cin >> nHigh;
for (int j = 0; j < i; ++j) {
if (nHigh < Hotels[j]) {
canWatch = false;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 883,540 | 883,541 | u919919505 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n, h[20], look, result = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (i >= 1) {
look = 0;
for (int j = 0; j < i - 1; j++)
if (h[i] < h[j])
look = 1;
if (look == 0)
result++;
}
}
co... | #include <iostream>
using namespace std;
int main() {
int n, h[20], look, result = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (i >= 1) {
look = 0;
for (int j = 0; j < i; j++)
if (h[i] < h[j])
look = 1;
if (look == 0)
result++;
}
}
cout <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 883,542 | 883,543 | u953095464 | cpp |
p03072 | #include <stdio.h>
int main() {
int N;
int H;
scanf("%d", &N);
int i;
int hight = 0;
int counter = 0;
for (i = 0; i < N; i++) {
scanf("%d", &H);
if (H >= hight)
counter++;
}
printf("%d", counter);
return 0;
} | #include <stdio.h>
int main() {
int N;
int H;
scanf("%d", &N);
int i;
int hight = 0;
int counter = 0;
for (i = 0; i < N; i++) {
scanf("%d", &H);
if (H >= hight) {
counter++;
hight = H;
}
}
printf("%d", counter);
return 0;
}
| [
"assignment.add"
] | 883,548 | 883,549 | u174028570 | cpp |
p03072 | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i;
int N;
int H[100];
int num;
int max;
scanf("%d", &N);
// printf("%d\n", N);
for (i = 0; i < N; i++) {
scanf("%d", H + i);
// printf("%d\n", H[i]);
}
num = 1;
max = H[0];
for (i = 1; i < N - 1; i++) {
if (max <= H[i + 1... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i;
int N;
int H[100];
int num;
int max;
scanf("%d", &N);
// printf("%d\n", N);
for (i = 0; i < N; i++) {
scanf("%d", H + i);
// printf("%d\n", H[i]);
}
num = 1;
max = H[0];
for (i = 0; i < N - 1; i++) {
if (max <= H[i + 1... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 883,556 | 883,557 | u147305315 | cpp |
p03072 | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i;
int N;
int H[100];
int num;
int max;
scanf("%d", &N);
// printf("%d\n", N);
for (i = 0; i < N; i++) {
scanf("%d", H + i);
// printf("%d\n", H[i]);
}
num = 1;
max = H[0];
for (i = 1; i < N - 1; i++) {
if (max <= H[i + 1... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i;
int N;
int H[100];
int num;
int max;
scanf("%d", &N);
// printf("%d\n", N);
for (i = 0; i < N; i++) {
scanf("%d", H + i);
// printf("%d\n", H[i]);
}
num = 1;
max = H[0];
for (i = 0; i < N - 1; i++) {
if (max <= H[i + 1... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 883,558 | 883,557 | u147305315 | cpp |
p03072 | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i;
int N;
int H[100];
int num;
int max;
scanf("%d", &N);
// printf("%d\n", N);
for (i = 0; i < N; i++) {
scanf("%d", H + i);
// printf("%d\n", H[i]);
}
num = 1;
max = H[0];
for (i = 1; i < N - 1; i++) {
if (max <= H[i + 1... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i;
int N;
int H[100];
int num;
int max;
scanf("%d", &N);
// printf("%d\n", N);
for (i = 0; i < N; i++) {
scanf("%d", H + i);
// printf("%d\n", H[i]);
}
num = 1;
max = H[0];
for (i = 0; i < N - 1; i++) {
if (max <= H[i + 1... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 883,559 | 883,557 | u147305315 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// for (int i = 0; i < N; i++){}
// for (int i = 0; i < N; i++){}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 1; i < N; i++) {
cin... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// for (int i = 0; i < N; i++){}
// for (int i = 0; i < N; i++){}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 883,563 | 883,564 | u085853565 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mt(n);
for (int i = 0; i < n; i++) {
int l_i;
cin >> l_i;
mt[i] = l_i;
}
int sum = 1;
for (int i = 1; i < n; i++) {
bool check = true;... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mt(n);
for (int i = 0; i < n; i++) {
int l_i;
cin >> l_i;
mt[i] = l_i;
}
int sum = 1;
for (int i = 1; i < n; i++) {
bool check = true;... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 883,569 | 883,570 | u976439457 | cpp |
p03072 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tup... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tup... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,575 | 883,576 | u399527088 | cpp |
p03072 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, max = 0, maxcount;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
if (max <= h[i]) {
max = h[i];
maxcount++;
}
}
cout << maxcount << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, max = 0, maxcount = 0;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
if (max <= h[i]) {
max = h[i];
maxcount++;
}
}
cout << maxcount << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 883,577 | 883,578 | u762917276 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long long N = S.size();
long long zero_even = 0, zero_odd = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0 && S.at(i) == 0) {
zero_even++;
} else if (i % 2 == 1 && S.at(i) == 0) {
zero_odd++;
}
}
long l... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long long N = S.size();
long long zero_even = 0, zero_odd = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0 && S.at(i) == '0') {
zero_even++;
} else if (i % 2 == 1 && S.at(i) == '0') {
zero_odd++;
}
}
lo... | [
"control_flow.branch.if.condition.change"
] | 883,579 | 883,580 | u793154675 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long long N = S.size();
long long zero_even = 0, zero_odd = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0 && S.at(i) == 0) {
zero_even++;
} else if (i % 2 == 1 && S.at(i) == 0) {
zero_odd++;
}
}
long l... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long long N = S.size();
long long zero_even = 0, zero_odd = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0 && S.at(i) == '0') {
zero_even++;
} else if (i % 2 == 1 && S.at(i) == '0') {
zero_odd++;
}
}
lo... | [
"control_flow.branch.if.condition.change"
] | 883,581 | 883,582 | u201304522 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1]) {
if (s[i] == '0')
s[i + 1] == '1';
else
s[i + 1] = '0';
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1]) {
if (s[i] == '0')
s[i + 1] = '1';
else
s[i + 1] = '0';
ans++;
}
}
cout << ans << endl;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 883,583 | 883,584 | u528258842 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1]) {
if (s[i] == '0')
s[i + 1] == '1';
else
s[i + 1] = '1';
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1]) {
if (s[i] == '0')
s[i + 1] = '1';
else
s[i + 1] = '0';
ans++;
}
}
cout << ans << endl;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"literal.string.change",
"assignment.value.change"
] | 883,585 | 883,584 | u528258842 | cpp |
p03073 | #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>;
int main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
rep(i, s.size()) {
if (i % 2 == 0 && s[i] == '0')
ans1++;
if (i % 2 != 0 && s[i] == '1')
ans... | #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>;
int main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
rep(i, s.size()) {
if (i % 2 == 0 && s[i] == '0')
ans1++;
if (i % 2 != 0 && s[i] == '1')
ans... | [
"identifier.change"
] | 883,588 | 883,589 | u005006157 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
int ans = 0;
cin >> N;
for (int i = 1; i < N.size(); i++) {
if (N[i - 1] == N[i] && N[i - 1] == '1') {
N[i] = '1';
ans++;
} else if (N[i - 1] == N[i] && N[i - 1] == '0') {
N[i] = '1';
ans++;
}
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
int ans = 0;
cin >> N;
for (int i = 1; i < N.size(); i++) {
if (N[i - 1] == N[i] && N[i - 1] == '1') {
N[i] = '0';
ans++;
} else if (N[i - 1] == N[i] && N[i - 1] == '0') {
N[i] = '1';
ans++;
}
}
cout <<... | [
"literal.string.change",
"assignment.value.change"
] | 883,592 | 883,593 | u187772564 | cpp |
p03073 | #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() {
string s;
cin >> s;
int a = 0, b = 0;
for (int i = 0; i < (int)s.size(); i++) {
... | #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() {
string s;
cin >> s;
int a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (... | [
"control_flow.loop.for.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 883,594 | 883,595 | u033937898 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; j < s.size(); j++) {
if (j % 2 == 0 && s.at(j) != (char)(i + '0')) {
cnt++;
}
if (j % 2 == 1 && s.at(j) == (char)(i + '0')) {
... | #include <bits/stdc++.h>
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.at(j) != (char)(i + '0')) {
cnt++;
}
if (j % 2 == 1 && s.at(j) == (char)(i + '0... | [
"identifier.replace.add",
"literal.replace.remove",
"call.add"
] | 883,598 | 883,599 | u856957535 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> st(s.size());
for (int i = 0; i < s.size(); i++) {
st.at(i) = s.at(i);
}
int cnt = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (st.at(i) == st.at(i + 1)) {
if (st.at(i + 1) == '0') {
st.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> st(s.size());
for (int i = 0; i < s.size(); i++) {
st.at(i) = s.at(i);
}
int cnt = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (st.at(i) == st.at(i + 1)) {
if (st.at(i + 1) == '0') {
st.at... | [] | 883,602 | 883,603 | u191114518 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string s;
cin >> s;
vector<char> mihon1(s.size());
vector<char> mihon2(s.size());
int now = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (now == 0) {
mihon1[i] = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string s;
cin >> s;
vector<char> mihon1(s.size());
vector<char> mihon2(s.size());
int now = 0;
for (int i = 0; i < s.size(); i++) {
if (now == 0) {
mihon1[i] = '0';... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 883,606 | 883,607 | u436660228 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = 0;
for (int i = 0; i < s.size(); i += 2) {
if (s[i] == '0') {
left++;
} else if (s[i] == '1') {
right++;
}
}
for (int i = 1; i < s.size(); i += 2) {
if (s[i] == '1') {
righ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = 0;
for (int i = 0; i < s.size(); i += 2) {
if (s[i] == '0') {
left++;
} else if (s[i] == '1') {
right++;
}
}
for (int i = 1; i < s.size(); i += 2) {
if (s[i] == '1') {
left... | [
"identifier.change"
] | 883,608 | 883,609 | u834753207 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = 0;
for (int i = 0; i < s.size(); i += 2) {
if (s[i] == '0') {
left++;
} else if (s[i - 1] == '1') {
left++;
}
}
for (int i = 1; i < s.size(); i += 2) {
if (s[i] == '1') {
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = 0;
for (int i = 0; i < s.size(); i += 2) {
if (s[i] == '0') {
left++;
} else if (s[i] == '1') {
right++;
}
}
for (int i = 1; i < s.size(); i += 2) {
if (s[i] == '1') {
left... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change"
] | 883,610 | 883,609 | u834753207 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc124_c.txt"); ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc124_c.txt"); ... | [
"assignment.change"
] | 883,611 | 883,612 | u513083943 | cpp |
p03073 | #include <iostream>
using namespace std;
int main(void) {
string s;
cin >> s;
int l = s.size();
int ans1, ans2;
for (int i = 0; i < l; i++) {
if (i % 2 == 0 ^ s[i] == '0') {
ans1++;
}
}
for (int i = 0; i < l; i++) {
if (i % 2 == 0 ^ s[i] == '1') {
ans2++;
}
}
if (ans1 > a... | #include <iostream>
using namespace std;
int main(void) {
string s;
cin >> s;
int l = s.size();
int ans1 = 0, ans2 = 0;
for (int i = 0; i < l; i++) {
if (i % 2 == 0 ^ s[i] == '0') {
ans1++;
}
}
for (int i = 0; i < l; i++) {
if (i % 2 == 0 ^ s[i] == '1') {
ans2++;
}
}
if (... | [
"variable_declaration.value.change"
] | 883,619 | 883,620 | u520276780 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define cinsc \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define all(con... | #include <bits/stdc++.h>
using namespace std;
#define cinsc \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define all(con... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 883,624 | 883,625 | u106491311 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using Map = map<ll, ll>;
using T = tuple<ll, ll, ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout << v << endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using Map = map<ll, ll>;
using T = tuple<ll, ll, ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout << v << endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 883,629 | 883,630 | u575802441 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int ans1 = 0, ans2 = 0;
for (int i = 0; i < len; i++) {
if (i % 2 == 0) {
if (s[i] == '0')
ans1++;
else
ans2++;
} else {
if (s[i] == '1')
ans1++;
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int ans1 = 0, ans2 = 0;
for (int i = 0; i < len; i++) {
if (i % 2 == 0) {
if (s[i] == '0')
ans1++;
else
ans2++;
} else {
if (s[i] == '1')
ans1++;
else
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 883,635 | 883,636 | u494609869 | cpp |
p03073 | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b... | [
"assignment.change"
] | 883,646 | 883,647 | u879674287 | cpp |
p03073 | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b... | [] | 883,648 | 883,647 | u879674287 | cpp |
p03073 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
if (s.length() == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
ans++;
if (s[i] == '0') {
s[i + 1] == '1';
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
if (s.length() == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
ans++;
if (s[i] == '0') {
s[i + 1] = '1';
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 883,652 | 883,653 | u401900157 | cpp |
p03073 | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
// vector<vector<ll>> piyo(tate,vector<ll> (yoko));
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1000000000
#define ll long long
#define ln cout << endl;
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define double long double
#define REP(i... | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
// vector<vector<ll>> piyo(tate,vector<ll> (yoko));
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1000000000
#define ll long long
#define ln cout << endl;
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define double long double
#define REP(i... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 883,654 | 883,655 | u683769494 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
string S;
cin >> S;
int ans = S.size();
for (int i = 0; i < 2; i++) {
int cnt = 0;
rep(j, S.size()) {
if (j % 2 == 0 && S[j] != (char)(i + '0')) {
cnt++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
string S;
cin >> S;
int ans = S.size();
//(0 or 1)
for (int i = 0; i < 2; i++) {
int cnt = 0;
rep(j, S.size()) {
// (char)(0 + '0') -> '0'
// (char)(1 + '0') ->... | [] | 883,656 | 883,657 | u636018568 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <vector>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b)... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <vector>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b)... | [
"literal.number.change",
"variable_declaration.value.change"
] | 883,671 | 883,672 | u376578635 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int counter = 0;
for (int i = 1; i < s.size() - 1; i++) {
if (s[i] == s[i - 1]) {
if (s[i] == '1')
s[i] = '0';
else
s[i] = '1';
counter++;
}
}
cout << counter << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int counter = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1]) {
if (s[i] == '1')
s[i] = '0';
else
s[i] = '1';
counter++;
}
}
cout << counter << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 883,679 | 883,680 | u837843177 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i--)
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
string s = S;
int l = s.size();
int res = 0;
rep(i, l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i--)
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
string s = S;
int l = s.size();
int res = 0;
rep(i, l... | [
"assignment.change"
] | 883,681 | 883,682 | u297398560 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int y = s.size();
int cnt = 0;
rep(i, y - 1) {
if (s[i] == '0' && s[i + 1] == '0') {
cnt++;
s[i + 1] == '1';
}
if (s[i] == '1' && s[i + 1] == '1') {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int y = s.size();
int cnt = 0;
rep(i, y - 1) {
if (s[i] == '0' && s[i + 1] == '0') {
cnt++;
s[i + 1] = '1';
// cout << i << endl;
}
if (s[i] == '1' ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 883,683 | 883,684 | u525560003 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int y = s.size();
int cnt = 0;
rep(i, y - 1) {
if (s[i] == '0' && s[i + 1] == 0) {
cnt++;
s[i + 1] == '1';
}
if (s[i] == '1' && s[i + 1] == '1') {
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int y = s.size();
int cnt = 0;
rep(i, y - 1) {
if (s[i] == '0' && s[i + 1] == '0') {
cnt++;
s[i + 1] = '1';
// cout << i << endl;
}
if (s[i] == '1' ... | [
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 883,685 | 883,684 | u525560003 | cpp |
p03073 | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int... | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 883,695 | 883,696 | u789157713 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
string s;
cin >> s;
string t = s;
int ans1 = 0, ans2 = 0;
rep(i, s.size() - 1) {
if (s[i] != s[i + 1])
continue;
s[i] == '0' ? s[i + 1] = '1' : s[i +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
string s;
cin >> s;
string t = s;
int ans1 = 0, ans2 = 1;
rep(i, s.size() - 1) {
if (s[i] != s[i + 1])
continue;
s[i] == '0' ? s[i + 1] = '1' : s[i +... | [
"literal.number.change",
"variable_declaration.value.change"
] | 883,699 | 883,700 | u018372223 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < (s.size() - 1); i++) {
if (s[i] == s[i + 1]) {
ans++;
s[i + 1] = char(1 - s[i] + '0');
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < (s.size() - 1); i++) {
if (s[i] == s[i + 1]) {
ans++;
s[i + 1] = char('1' - s[i] + '0');
}
}
cout << ans << endl;
} | [
"call.arguments.change"
] | 883,701 | 883,702 | u697968316 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
void solve() {
string s;
cin >> s;
int ans = 0, ans2 = 0;
for (int i = 0; i < s.length() - 1; i++) {
if (i % 2 == 0) {
if (s[i] != '0')
ans++;
else
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
void solve() {
string s;
cin >> s;
int ans = 0, ans2 = 0;
for (int i = 0; i < s.length(); i++) {
if (i % 2 == 0) {
if (s[i] != '0')
ans++;
else
ans2... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 883,703 | 883,704 | u489302942 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string inputStr;
cin >> inputStr;
int n = inputStr.length();
int colorChangeTileCountFirstFix = 0;
char prevTile = inputStr.at(0);
for (int i = 1; i < n; ++i) {
if (inputStr.at(i) == prevTile) {
++colorChangeTileCountFirstFix;
pr... | #include <bits/stdc++.h>
using namespace std;
int main() {
string inputStr;
cin >> inputStr;
int n = inputStr.length();
int colorChangeTileCountFirstFix = 0;
char prevTile = inputStr.at(0);
for (int i = 1; i < n; ++i) {
if (inputStr.at(i) == prevTile) {
++colorChangeTileCountFirstFix;
pr... | [
"literal.number.change",
"variable_declaration.value.change"
] | 883,705 | 883,706 | u584797714 | cpp |
p03073 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
const ll MOD = 1000000007LL;
int main() {
string s;
cin >> s;
... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
const ll MOD = 1000000007LL;
int main() {
string s;
cin >> s;
... | [
"variable_declaration.value.change"
] | 883,707 | 883,708 | u614128939 | cpp |
p03073 | #include <iostream>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string t;
t = s;
int ans_1 = 0, ans_2 = 0;
if (s[0] == '0') {
rep(i, 1, s.size()) {
if (s[i] == s[i - 1]) {
... | #include <iostream>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string t;
t = s;
int ans_1 = 0, ans_2 = 0;
if (s[0] == '0') {
rep(i, 1, s.size()) {
if (s[i] == s[i - 1]) {
... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 883,709 | 883,710 | u602267597 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> s1(n);
rep(i, n) { s1[i] = s[i] - '0'; }
vector<int> s2 = s1;
int cnt1 = 0;
int cnt2 = 0;
rep(i, n - 1) {
if (s1[i] =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> s1(n);
rep(i, n) { s1[i] = s[i] - '0'; }
vector<int> s2 = s1;
int cnt1 = 0;
int cnt2 = 0;
rep(i, n - 1) {
if (s1[i] =... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_access.subscript.index.change",
"assignment.variable.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 883,713 | 883,714 | u131625544 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (i % 2) {
if (s[i] == '1')
a++;
else
b+... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (i % 2) {
if (s[i] == '1')
a++;
else
b+... | [
"expression.unary.arithmetic.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 883,715 | 883,716 | u724012411 | cpp |
p03073 | #include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
ll ans = 0;
for (int i = 1; i < s.size(); i++) {
if (s.at(i) == s.at(i - 1)) {
ans++;
if (s.at(i == '1'))
s.at(i) = '0';
else
s.at(i) = '1';
}
}
cout <... | #include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
ll ans = 0;
for (int i = 1; i < s.size(); i++) {
if (s.at(i) == s.at(i - 1)) {
ans++;
if (s.at(i) == '1')
s.at(i) = '0';
else
s.at(i) = '1';
}
}
cout <... | [
"control_flow.branch.if.condition.change"
] | 883,725 | 883,726 | u993074316 | cpp |
p03073 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
if (S.at(0) == 0) {
for (int i = 0; i < S.size(); i++) {
if (S.at(i) % 2 != i % 2) {
a++;
}
}
} else {
for (int i = 0; i < S.size(); i++) {
if (S.at(i) % 2 != (i +... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
if (S.at(0) == '0') {
for (int i = 0; i < S.size(); i++) {
if (S.at(i) % 2 != i % 2) {
a++;
}
}
} else {
for (int i = 0; i < S.size(); i++) {
if (S.at(i) % 2 != (i... | [
"control_flow.branch.if.condition.change"
] | 883,729 | 883,730 | u387371565 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#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++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_I... | #include <bits/stdc++.h>
using namespace std;
#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++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_I... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 883,733 | 883,734 | u170513117 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
typedef long long ll;
const int INF = 100100;
int main() {
string S;
cin >> S;
int n = S.length();
int ans = INF;
for (int i = 0; i < 2; i++) {
int tmp = 0;
int k = i;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
typedef long long ll;
const int INF = 100100;
int main() {
string S;
cin >> S;
int n = S.length();
int ans = INF;
for (int i = 0; i < 2; i++) {
int tmp = 0;
int k = i;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 883,735 | 883,736 | u468440139 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 10;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { re... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 10;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { re... | [
"variable_declaration.value.change"
] | 883,737 | 883,738 | u835629653 | cpp |
p03073 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
int main() {
string s;
cin >> s;
int ans = 0;
bitset<100000> ss(s);
for (int i = 0; i < s.size() - 1; i++) {
if (ss[i + 1] ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
int main() {
string s;
cin >> s;
int ans = 0;
bitset<100000> ss(s);
for (int i = 0; i < s.size() - 1; i++) {
if (ss[i + 1] ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 883,743 | 883,744 | u506910932 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// max=({});
//条件式が真ならwhileの中身を回し続ける
bool flag[1050000];
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// max=({});
//条件式が真ならwhileの中身を回し続ける
bool flag[1050000];
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() ... | [
"variable_declaration.value.change"
] | 883,747 | 883,748 | u631558039 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int i;
int a = 0;
int b = 0;
int c = 0;
int d = 0;
cin >> S;
for (i = 1; i <= S.size(); i++) {
if (i % 2 == 1) {
if (S[i] == '1') {
a++;
} else {
b++;
}
} else {
if (S[i] == '0') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int i;
int a = 0;
int b = 0;
int c = 0;
int d = 0;
cin >> S;
for (i = 0; i < S.size(); i++) {
if (i % 2 == 1) {
if (S[i] == '1') {
a++;
} else {
b++;
}
} else {
if (S[i] == '0') {
... | [
"literal.number.change",
"assignment.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"
] | 883,753 | 883,754 | u012131682 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define INF 1e9
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
string s;
cin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define INF 1e9
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
string s;
cin... | [
"variable_declaration.add"
] | 883,755 | 883,756 | u328179672 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define f first
#define sec second
#define pb push_back
#define pf push_front
#define pbb pop_back
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define pi pair<ll, ll>
#define map map<ll, ll>
#define set set<ll>
const int m = 1e9 + 7;
int main()... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define f first
#define sec second
#define pb push_back
#define pf push_front
#define pbb pop_back
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define pi pair<ll, ll>
#define map map<ll, ll>
#define set set<ll>
const int m = 1e9 + 7;
int main()... | [
"identifier.change"
] | 883,762 | 883,763 | u675040086 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define f first
#define sec second
#define pb push_back
#define pf push_front
#define pbb pop_back
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define pi pair<ll, ll>
#define map map<ll, ll>
#define set set<ll>
const int m = 1e9 + 7;
int main()... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define f first
#define sec second
#define pb push_back
#define pf push_front
#define pbb pop_back
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define pi pair<ll, ll>
#define map map<ll, ll>
#define set set<ll>
const int m = 1e9 + 7;
int main()... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change"
] | 883,764 | 883,763 | u675040086 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
string s;
cin >> s;
int ans = s.size(), n = s.size();
rep(i, 2) {
int cnt = 0;
rep(j, n) {
if (j % 2 == 0 && s[i] != (char)(i + '0'))
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
string s;
cin >> s;
int ans = s.size(), n = s.size();
rep(i, 2) {
int cnt = 0;
rep(j, n) {
if (j % 2 == 0 && s[j] != (char)(i + '0'))
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 883,768 | 883,769 | u587622858 | cpp |
p03073 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX... | [
"literal.string.change",
"assignment.value.change",
"literal.number.change",
"variable_declaration.value.change"
] | 883,774 | 883,775 | u511096055 | cpp |
p03073 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
string S;
cin >> S;
int ans = 0;
for (int i = 1; i < S.size(); i++) {
if (S[i] != S[i - 1]) {
if (S[i] == '1')
S[i] = '0';
else
S[i] = '1';
ans++;
}
}
printf("%d\n", an... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
string S;
cin >> S;
int ans = 0;
for (int i = 1; i < S.size(); i++) {
if (S[i] == S[i - 1]) {
if (S[i] == '1')
S[i] = '0';
else
S[i] = '1';
ans++;
}
}
printf("%d\n", an... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,776 | 883,777 | u684448032 | cpp |
p03073 | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//... | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 883,778 | 883,779 | u825601908 | cpp |
p03073 | #include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
string s;
cin >> s;
int ans = s.size();
rep(i, 2) {
int cnt = 0;
rep(j, s.size()) {
if ((j % 2 == 0) ^ (s[i] != (char)(i + '0')))
cnt++;
}
ans = min(ans, cnt);
... | #include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
string s;
cin >> s;
int ans = s.size();
rep(i, 2) {
int cnt = 0;
rep(j, s.size()) {
if ((j % 2 == 0) ^ (s[j] != (char)(i + '0')))
cnt++;
}
ans = min(ans, cnt);
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 883,780 | 883,781 | u702118111 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | [
"expression.operation.binary.remove"
] | 883,782 | 883,783 | u876953939 | cpp |
p03073 | #include <cstdio>
#include <iostream>
using namespace std;
int read() {
int x;
scanf("%d", &x);
return x;
}
string s;
int main() {
cin >> s;
int x, y;
for (int i = 0; i <= s.size() - 1; i++) {
if (i % 2 == 0) {
if (s[i] != '0') {
x++;
}
} else if (i % 2 != 0) {
if (s[i]... | #include <cstdio>
#include <iostream>
using namespace std;
int read() {
int x;
scanf("%d", &x);
return x;
}
string s;
int main() {
cin >> s;
int x = 0, y = 0;
for (int i = 0; i <= s.size() - 1; i++) {
if (i % 2 == 0) {
if (s[i] != '0') {
x++;
}
} else if (i % 2 != 0) {
... | [
"variable_declaration.value.change"
] | 883,791 | 883,792 | u863370423 | cpp |
p03073 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; // 10^9
int main() {
string ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; // 10^9
int main() {
string ... | [
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 883,804 | 883,805 | u296989351 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AA = 0;
int BB = 0;
string S;
cin >> S;
vector<char> A(S.size());
for (int X = 0; X < S.size(); X++) {
if (X % 2 == 0) {
A.at(X) = 1;
} else {
A.at(X) = 0;
}
}
for (int X = 0; X < S.size(); X++) {
if (S.at(X) == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int AA = 0;
int BB = 0;
string S;
cin >> S;
vector<char> A(S.size());
for (int X = 0; X < S.size(); X++) {
if (X % 2 == 0) {
A.at(X) = '1';
} else {
A.at(X) = '0';
}
}
for (int X = 0; X < S.size(); X++) {
if (S.at(X)... | [] | 883,806 | 883,807 | u740002394 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main() {
string s;
cin >> s;
int ans, memo;
int now = 0;
int n = s.size();
rep(i, n) {
if (s[i] - '0' != now)
ans++;
now = 1 - n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main() {
string s;
cin >> s;
int ans = 0, memo = 0;
int now = 0;
int n = s.size();
rep(i, n) {
if (s[i] - '0' != now)
ans++;
now... | [
"variable_declaration.value.change"
] | 883,810 | 883,811 | u354281482 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 883,816 | 883,817 | u981759938 | 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 a = 0;
int b = 0;
if (s[0] == 1)
a++;
for (int i = 1; i < s.size(); i++) {
if (i % 2 == 1) {
if (s[i] == '0') {
a++;
}
} else {
if (s[i] == '... | #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 a = 0;
int b = 0;
if (s[0] == '1')
a++;
for (int i = 1; i < s.size(); i++) {
if (i % 2 == 1) {
if (s[i] == '0') {
a++;
}
} else {
if (s[i] =... | [
"control_flow.branch.if.condition.change"
] | 883,834 | 883,835 | u469451657 | 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 a = 0;
int b = 0;
if (s[0] == 1)
a++;
for (int i = 1; i < s.size(); i++) {
if (i % 2 == 1) {
if (s[i] == '0') {
a++;
}
} else {
if (s[i] == '... | #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 a = 0;
int b = 0;
if (s[0] == '1')
a++;
for (int i = 1; i < s.size(); i++) {
if (i % 2 == 1) {
if (s[i] == '0') {
a++;
}
} else {
if (s[i] =... | [
"control_flow.branch.if.condition.change"
] | 883,836 | 883,835 | u469451657 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int n = s.size();
string ref1, ref2;
int ans1 = 0, ans2 = 0;
REP(i, n) {
if (i % 2 == 0)
ref1.push_back('1');
else
ref1.push_back('0');
if (s[i] != ref... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int n = s.size();
string ref1, ref2;
int ans1 = 0, ans2 = 0;
REP(i, n) {
if (i % 2 == 0)
ref1.push_back('1');
else
ref1.push_back('0');
if (s[i] != ref... | [
"identifier.change"
] | 883,839 | 883,840 | u590000849 | cpp |
p03073 | #include <algorithm>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, ... | #include <algorithm>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 883,843 | 883,844 | u433195318 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int ans1 = 0, ans2 = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int ans1 = 0, ans2 = ... | [
"assignment.add"
] | 883,849 | 883,850 | u480831358 | cpp |
p03073 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 1, tmp = 1;
for (int i = 0; i < s.length(); i++) {
if (tmp % 2 == s[i] - '0')
ans1++;
tmp++;
}
tmp = 1;
for (int i = 0; i < s.length(); i++) {
if (tmp % ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0, tmp = 1;
for (int i = 0; i < s.length(); i++) {
if (tmp % 2 == s[i] - '0')
ans1++;
tmp++;
}
tmp = 1;
for (int i = 0; i < s.length(); i++) {
if (tmp % ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 883,855 | 883,856 | u110383054 | cpp |
p03073 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
char c;
for (int i = 0; i < s.size(); i++) {
if (s[i] != c)
a++;
else
b++;
if (c == '1')
c = '0';
else
c = '1';
}
if (a < b)
cout << a << endl;
else
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
char c = '1';
for (int i = 0; i < s.size(); i++) {
if (s[i] != c)
a++;
else
b++;
if (c == '1')
c = '0';
else
c = '1';
}
if (a < b)
cout << a << endl;
... | [
"variable_declaration.value.change"
] | 883,857 | 883,858 | u073522991 | cpp |
p03073 | #include <algorithm>
#include <cstdio>
char s[100001];
int count(char d) {
const char digit[] = "010";
const char *check = digit + 1;
int r = 0;
for (int i = 0; s[i]; ++i) {
if (s[i] != check[i & 1])
++r;
}
return r;
}
int main() {
scanf("%s", s);
printf("%d\n", std::min(count(0), count(1))... | #include <algorithm>
#include <cstdio>
char s[100001];
int count(char d) {
const char digit[] = "010";
const char *check = digit + d;
int r = 0;
for (int i = 0; s[i]; ++i) {
if (s[i] != check[i & 1])
++r;
}
return r;
}
int main() {
scanf("%s", s);
printf("%d\n", std::min(count(0), count(1))... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 883,864 | 883,865 | u931819817 | cpp |
p03073 | #include <bits/stdc++.h>
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] != (char)(i + '0'))
cnt++;
if (j % 2 == 1 && S[j] == (char)(i + '0'))
c... | #include <bits/stdc++.h>
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] != (char)(i + '0'))
cnt++;
if (j % 2 == 1 && S[j] == (char)(i + '0'))
c... | [
"call.add"
] | 883,868 | 883,869 | u591755251 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
string S;
cin >> S;
int count = 0;
int length = S.length();
if (length == 1) {
cout << count << endl;
return 0;
}
if (length == 2) {
if (S[0] == S[1]) {
c... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
string S;
cin >> S;
int count = 0;
int length = S.length();
if (length == 1) {
cout << count << endl;
return 0;
}
if (length == 2) {
if (S[0] == S[1]) {
c... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 883,874 | 883,875 | u973630705 | cpp |
p03073 | #include <bits/stdc++.h>
#define int long long
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, m) for (int(i) = (m); (i) >= 0; (i)--)
#define REPONE(i, n) FOR(i, 1, n + 1)
#define ALL(a) (a).begin(), (a).end()
#define MP make_pair
using namespace std;
using P =... | #include <bits/stdc++.h>
#define int long long
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, m) for (int(i) = (m); (i) >= 0; (i)--)
#define REPONE(i, n) FOR(i, 1, n + 1)
#define ALL(a) (a).begin(), (a).end()
#define MP make_pair
using namespace std;
using P =... | [
"expression.operation.binary.remove"
] | 883,882 | 883,883 | u481767096 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
string s;
cin >> s;
ll sum = 0;
ll ans = INF;
char now = '0';
for (int i = 0; i < s.size(); i++) {
if (now != s[i]) {
sum++;
}
if (now == '0') {
now = '1';
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
string s;
cin >> s;
ll sum = 0;
ll ans = 0;
char now = '0';
for (int i = 0; i < s.size(); i++) {
if (now != s[i]) {
sum++;
}
if (now == '0') {
now = '1';
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 883,888 | 883,889 | u166378830 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
int x, y;
rep(i, S.size()) {
if ((i + 1) % 2 != 0) {
if (S[i] == '0')
y++;
else if (S[i] == '1')
x++;
} else if ((i + 1) % 2 == 0) {
if (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
int x = 0;
int y = 0;
rep(i, S.size()) {
if ((i + 1) % 2 != 0) {
if (S[i] == '0')
y++;
else if (S[i] == '1')
x++;
} else if ((i + 1) % 2 == 0... | [
"variable_declaration.add"
] | 883,890 | 883,891 | u319179101 | cpp |
p03073 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,901 | 883,902 | u843739531 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[1000000];
cin >> s;
int x = 0, y = 0;
for (int i = 0; i < strlen(s); i++) {
if (i % 2 == 0) {
if (s[i] = '0') {
x++;
}
}
if (i % 2 == 1) {
if (s[i] = '1') {
x++;
}
}
}
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[1000000];
cin >> s;
int x = 0, y = 0;
for (int i = 0; i < strlen(s); i++) {
if (i % 2 == 0) {
if (s[i] == '0') {
x++;
}
}
if (i % 2 == 1) {
if (s[i] == '1') {
x++;
}
}
}
for (int i = 0; ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 883,903 | 883,904 | u222643545 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); i++)
using namespace std;
int ans = 0;
string S;
int main() {
cin >> S;
int n = S.length();
string T = S;
int cnt = 0;
rep(i, n - 1) {
if (T[i] == T[i + 1]) {
T[i + 1] = (T[i + 1] == '0' ? '1' : '0');
cnt++;
}
}
a... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); i++)
using namespace std;
int ans = 0;
string S;
int main() {
cin >> S;
int n = S.length();
string T = S;
int cnt = 0;
rep(i, n - 1) {
if (T[i] == T[i + 1]) {
T[i + 1] = (T[i + 1] == '0' ? '1' : '0');
cnt++;
}
}
a... | [
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 883,905 | 883,906 | u385825353 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
using namespace std;
typedef long long ll;
int main() {
char s[110000];
int ss[110000];
int res = 0;
cin >> s;
int N = strlen(s);
rep(i, N) ss[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
using namespace std;
typedef long long ll;
int main() {
char s[110000];
int ss[110000];
int res = 0;
cin >> s;
int N = strlen(s);
rep(i, N) ss[i]... | [
"literal.number.change",
"variable_declaration.value.change"
] | 883,907 | 883,908 | u411427373 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int dif_S0 = 0;
int dif_S1 = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
if (S.at(i) == '1') {
dif_S0++;
}
} else {
if (S.at(i) == '0') {
dif_S0++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int dif_S0 = 0;
int dif_S1 = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
if (S.at(i) == '1') {
dif_S0++;
}
} else {
if (S.at(i) == '0') {
dif_S0++;
}
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 883,914 | 883,915 | u615258936 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
string s;
int ans;
int main() {
cin >> s;
char icolor = s.at(0);
for (int i = 1; i < s.size() - 1; i++) {
if (icolor == s.at(i + 1)) {
ans++;
if (icolor == '0')
s.at(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
string s;
int ans;
int main() {
cin >> s;
char icolor = s.at(0);
for (int i = 0; i < s.size() - 1; i++) {
if (icolor == s.at(i + 1)) {
ans++;
if (icolor == '0')
s.at(i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 883,932 | 883,933 | u335384647 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.