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 9
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
#define pb push_back
#define mp make_pair
#define F first
#define S second
#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 RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX_N = 5e5 + 5;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
ll inv[MAX_N], fac[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
inline ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1LL;
}
return c;
}
inline void _nCr() {
fac[0] = 1;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
inline ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
inline void PRI(ll n) {
bool a[n + 1];
for (int i = 0; i < n + 1; i++) {
a[i] = 1;
}
for (int i = 2; i < n + 1; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
typedef pair<int, pair<int, int>> edge;
signed main() {
int n;
cin >> n;
int h[n];
REP(i, n) cin >> h[i];
int ans = 1;
int ma = h[0];
FOR(i, 1, n) {
if (h[i] > ma)
ans++;
ma = max(ma, h[i]);
}
cout << ans << endl;
}
| /*#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
#define pb push_back
#define mp make_pair
#define F first
#define S second
#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 RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX_N = 5e5 + 5;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
ll inv[MAX_N], fac[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
inline ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1LL;
}
return c;
}
inline void _nCr() {
fac[0] = 1;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
inline ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
inline void PRI(ll n) {
bool a[n + 1];
for (int i = 0; i < n + 1; i++) {
a[i] = 1;
}
for (int i = 2; i < n + 1; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
typedef pair<int, pair<int, int>> edge;
signed main() {
int n;
cin >> n;
int h[n];
REP(i, n) cin >> h[i];
int ans = 1;
int ma = h[0];
FOR(i, 1, n) {
if (h[i] >= ma)
ans++;
ma = max(ma, h[i]);
}
cout << ans << endl;
}
| [
"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)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
int main() {
cin.tie(0);
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int cnt = 0;
int ma = 0;
for (int i = 0; i < n; ++i) {
if (h[i] < ma)
break;
cnt++;
ma = max(ma, h[i]);
}
cout << cnt << endl;
}
| #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)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
int main() {
cin.tie(0);
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int cnt = 0;
int ma = 0;
for (int i = 0; i < n; ++i) {
if (h[i] < ma)
continue;
cnt++;
ma = max(ma, h[i]);
}
cout << cnt << endl;
}
| [
"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);
}
cout << ans << endl;
} | #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);
}
cout << ans << endl;
} | [
"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];
}
}
cout << ans << endl;
return 0;
} | #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[i];
}
}
cout << ans << endl;
return 0;
}
| [
"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, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin); (LoopVariable) < (numberOFend); \
(LoopVariable)++)
#define DEFOR(LoopVariable, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin)-1; (LoopVariable) >= (numberOFend); \
(LoopVariable)--)
#define REP(LoopVariable, numberOFend) \
for (int LoopVariable = 0; (LoopVariable) < (numberOFend); LoopVariable++)
constexpr long long int linf = numeric_limits<long long int>::max() - 5;
constexpr int inf = numeric_limits<int>::max() - 5;
constexpr long long int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
int max_h, result = 1;
FOR(i, 1, n) {
max_h = max(max_h, v[i - 1]);
if (v[i] >= max_h) {
result++;
}
}
cout << result << endl;
return 0;
}
| #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, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin); (LoopVariable) < (numberOFend); \
(LoopVariable)++)
#define DEFOR(LoopVariable, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin)-1; (LoopVariable) >= (numberOFend); \
(LoopVariable)--)
#define REP(LoopVariable, numberOFend) \
for (int LoopVariable = 0; (LoopVariable) < (numberOFend); LoopVariable++)
constexpr long long int linf = numeric_limits<long long int>::max() - 5;
constexpr int inf = numeric_limits<int>::max() - 5;
constexpr long long int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
int max_h = -1, result = 1;
FOR(i, 1, n) {
max_h = max(max_h, v[i - 1]);
if (v[i] >= max_h) {
result++;
}
}
cout << result << endl;
return 0;
}
| [
"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) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define eb emplace_back
#define F first
#define S second
#define all(obj) (obj).begin(), (obj).end()
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
typedef unordered_map<ll, ll> mpll;
typedef unordered_map<char, ll> mpcl;
typedef unordered_map<string, ll> mpsl;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
ll inl() {
ll x;
cin >> x;
return (x);
}
string ins() {
string x;
cin >> x;
return (x);
}
int main() {
#ifdef MY_DEBUG
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wmissing-noreturn"
while (true) {
#pragma clang diagnostic pop
#endif
ll n = inl();
vl h(n);
rep(i, n) cin >> h[i];
vl d(n + 1);
d[0] = 0;
rep(i, n) { d[i] = max(d[i - 1], h[i]); }
ll ans = 0;
rep(i, n) {
if (d[i] == h[i])
ans++;
}
cout << ans << endl;
#ifdef MY_DEBUG
}
#endif
return 0;
} | #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) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define eb emplace_back
#define F first
#define S second
#define all(obj) (obj).begin(), (obj).end()
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
typedef unordered_map<ll, ll> mpll;
typedef unordered_map<char, ll> mpcl;
typedef unordered_map<string, ll> mpsl;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
ll inl() {
ll x;
cin >> x;
return (x);
}
string ins() {
string x;
cin >> x;
return (x);
}
int main() {
#ifdef MY_DEBUG
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wmissing-noreturn"
while (true) {
#pragma clang diagnostic pop
#endif
ll n = inl();
vl h(n);
rep(i, n) cin >> h[i];
vl d(n + 1);
d[0] = 0;
rep(i, n) { d[i + 1] = max(d[i], h[i]); }
ll ans = 0;
rep(i, n) {
if (d[i + 1] == h[i])
ans++;
}
cout << ans << endl;
#ifdef MY_DEBUG
}
#endif
return 0;
} | [
"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 = (1LL << 60);
/* end defineing */
int main() {
int n;
int h[100];
int count = 1;
int highest = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
highest = h[0];
for (int i = 1; i < n; i++) {
if (h[i] > highest) {
count++;
highest = h[i];
}
}
cout << count << endl;
}
| #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 = (1LL << 60);
/* end defineing */
int main() {
int n;
int h[100];
int count = 1;
int highest = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
highest = h[0];
for (int i = 1; i < n; i++) {
if (h[i] >= highest) {
count++;
highest = h[i];
}
}
cout << count << endl;
}
| [
"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[j]) {
flag = 1;
break;
}
if (flag == 0) {
y++;
}
}
}
cout << y << "\n";
} | #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]) {
flag = 1;
break;
}
}
if (flag == 0) {
y++;
}
}
cout << y << "\n";
} | [
"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;
break;
}
}
if (canWatch)
++nWatch;
Hotels.push_back(nHigh);
}
cout << nWatch;
return 0;
} | #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;
break;
}
}
if (canWatch)
++nWatch;
Hotels.push_back(nHigh);
}
cout << nWatch;
return 0;
} | [
"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++;
}
}
cout << result << endl;
return 0;
} | #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 << result << endl;
return 0;
} | [
"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]) {
num += 1;
max = H[i + 1];
} else {
// break;
}
}
printf("%d\n", num);
fflush(stdout);
return 0;
}
| #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]) {
num += 1;
max = H[i + 1];
} else {
// break;
}
}
printf("%d\n", num);
fflush(stdout);
return 0;
}
| [
"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]) {
num += 1;
max = H[i];
} else {
// break;
}
}
printf("%d\n", num);
fflush(stdout);
return 0;
}
| #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]) {
num += 1;
max = H[i + 1];
} else {
// break;
}
}
printf("%d\n", num);
fflush(stdout);
return 0;
}
| [
"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]) {
num += 1;
max = H[i];
} else {
break;
}
}
printf("%d\n", num);
fflush(stdout);
return 0;
}
| #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]) {
num += 1;
max = H[i + 1];
} else {
// break;
}
}
printf("%d\n", num);
fflush(stdout);
return 0;
}
| [
"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 >> H[i];
}
int maxs = H[0];
int res = 0;
for (int i = 1; i < N; i++) {
// cout << H[i] << "-" << maxs << endl;
if (H[i] >= maxs) {
res++;
}
maxs = max(maxs, H[i]);
}
cout << res << endl;
} | #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 >> H[i];
}
int maxs = H[0];
int res = 1;
for (int i = 1; i < N; i++) {
// cout << H[i] << "-" << maxs << endl;
if (H[i] >= maxs) {
res++;
}
maxs = max(maxs, H[i]);
}
cout << res << endl;
} | [
"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;
for (int j = 0; j < i; j++) {
if (mt[i] < mt[j]) {
check = false;
break;
}
}
if (check = true) {
sum = sum + 1;
}
}
cout << sum << endl;
} | #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;
for (int j = 0; j < i; j++) {
if (mt[i] < mt[j]) {
check = false;
break;
}
}
if (check == true) {
sum = sum + 1;
}
}
cout << sum << endl;
} | [
"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 <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<ll> G[500005];
vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
// ll bit[500005];
//↓,→,↑,←
#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << (x) << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pd(x) cerr << "//" << (x) << endl;
#define re(i, n) \
for (i = 0; i < n; i++) \
;
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout << #x << " = " << x << endl
ll mod = 1000000007;
ll rui(ll number1, ll number2) {
if (number2 == 0) {
return 1;
} else {
ll number3 = rui(number1, number2 / 2);
number3 *= number3;
number3 %= mod;
if (number2 % 2 == 1) {
number3 *= number1;
number3 %= mod;
}
return number3;
}
}
ll gcd(ll number1, ll number2) {
if (number1 > number2) {
swap(number1, number2);
}
if (number1 == 0 || number1 == number2) {
return number2;
} else {
return gcd(number2 % number1, number1);
}
}
void YES(bool condition) {
if (condition) {
p("YES");
} else {
p("NO");
}
return;
}
void Yes(bool condition) {
if (condition) {
p("Yes");
} else {
p("No");
}
return;
}
ll n, m, num, sum, ans, a, b, c, d, e, g, h, w, i, j, k, q, l, r;
ll x[500005], y[500005], z[500005];
ll dp[500005][6], sc[500005][6];
// bool check[5005];
// char s[500005],t[500005];
bool flag, dame;
ll fact[400005];
ll rfact[400005];
void c3_init() {
fact[0] = rfact[0] = 1;
for (ll i = 1; i < 400000; i++) {
fact[i] = (fact[i - 1] * i) % mod;
rfact[i] = rui(fact[i], mod - 2);
}
}
ll c3(ll n, ll r) {
return (((fact[n] * rfact[r]) % mod) * rfact[n - r]) % mod;
}
int main() {
cin >> n;
num = -INF;
for (i = 0; i < n; i++) {
cin >> x[i];
if (x[i] > num)
ans++;
num = max(num, x[i]);
}
p(ans);
return 0;
} | #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 <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<ll> G[500005];
vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
// ll bit[500005];
//↓,→,↑,←
#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << (x) << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pd(x) cerr << "//" << (x) << endl;
#define re(i, n) \
for (i = 0; i < n; i++) \
;
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout << #x << " = " << x << endl
ll mod = 1000000007;
ll rui(ll number1, ll number2) {
if (number2 == 0) {
return 1;
} else {
ll number3 = rui(number1, number2 / 2);
number3 *= number3;
number3 %= mod;
if (number2 % 2 == 1) {
number3 *= number1;
number3 %= mod;
}
return number3;
}
}
ll gcd(ll number1, ll number2) {
if (number1 > number2) {
swap(number1, number2);
}
if (number1 == 0 || number1 == number2) {
return number2;
} else {
return gcd(number2 % number1, number1);
}
}
void YES(bool condition) {
if (condition) {
p("YES");
} else {
p("NO");
}
return;
}
void Yes(bool condition) {
if (condition) {
p("Yes");
} else {
p("No");
}
return;
}
ll n, m, num, sum, ans, a, b, c, d, e, g, h, w, i, j, k, q, l, r;
ll x[500005], y[500005], z[500005];
ll dp[500005][6], sc[500005][6];
// bool check[5005];
// char s[500005],t[500005];
bool flag, dame;
ll fact[400005];
ll rfact[400005];
void c3_init() {
fact[0] = rfact[0] = 1;
for (ll i = 1; i < 400000; i++) {
fact[i] = (fact[i - 1] * i) % mod;
rfact[i] = rui(fact[i], mod - 2);
}
}
ll c3(ll n, ll r) {
return (((fact[n] * rfact[r]) % mod) * rfact[n - r]) % mod;
}
int main() {
cin >> n;
num = -INF;
for (i = 0; i < n; i++) {
cin >> x[i];
if (x[i] >= num)
ans++;
num = max(num, x[i]);
}
p(ans);
return 0;
}
| [
"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 long a_1, a_2;
a_1 = N / 2 + N % 2 - zero_even + zero_odd;
a_2 = zero_even + N / 2 - zero_odd;
cout << min(a_1, a_2) << endl;
} | #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 long a_1, a_2;
a_1 = N / 2 + N % 2 - zero_even + zero_odd;
a_2 = zero_even + N / 2 - zero_odd;
cout << min(a_1, a_2) << endl;
}
| [
"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 long a_1, a_2;
a_1 = (N + 1) / 2 - zero_even + zero_odd; // 010...
a_2 = zero_even + N / 2 - zero_odd; // 101...
cout << min(a_1, a_2) << endl;
}
| #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 long a_1, a_2;
a_1 = (N + 1) / 2 - zero_even + zero_odd; // 010...
a_2 = zero_even + N / 2 - zero_odd; // 101...
cout << min(a_1, a_2) << endl;
}
| [
"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')
ans1++;
}
rep(i, s.size()) {
if (i % 2 == 0 && s[i] == '1')
ans1++;
if (i % 2 != 0 && s[i] == '0')
ans1++;
}
int ans = min(ans1, ans2);
cout << ans << endl;
return 0;
} | #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')
ans1++;
}
rep(i, s.size()) {
if (i % 2 == 0 && s[i] == '1')
ans2++;
if (i % 2 != 0 && s[i] == '0')
ans2++;
}
int ans = min(ans1, ans2);
cout << ans << endl;
return 0;
} | [
"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 << ans << endl;
}
| #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 << ans << endl;
}
| [
"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++) {
if (i % 2) {
if (s[i] == '0')
a++;
else
b++;
} else {
if (s[i] = '1')
a++;
else
b++;
}
}
cout << min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (i % 2) {
if (s[i] == '0')
a++;
else
b++;
} else {
if (s[i] == '1')
a++;
else
b++;
}
}
cout << min(a, b) << endl;
return 0;
}
| [
"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')) {
cnt++;
}
}
ans = min(ans, cnt);
}
cout << ans << endl;
}
| #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')) {
cnt++;
}
}
ans = min(ans, cnt);
}
cout << ans << endl;
}
| [
"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(i + 1) = 1;
} else {
st.at(i + 1) = 0;
}
cnt++;
}
}
cout << cnt << endl;
} | #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(i + 1) = '1';
} else {
st.at(i + 1) = '0';
}
cnt++;
}
}
cout << cnt << endl;
}
| [] | 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] = '0';
mihon2[i] = '1';
now += 1;
} else {
mihon1[i] = '1';
mihon2[i] = '0';
now -= 1;
}
}
int one = 0;
int two = 0;
rep(i, s.size()) {
if (s[i] != mihon1[i])
one += 1;
else if (s[i] != mihon2[i])
two += 1;
}
cout << min(one, two) << endl;
}
| #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';
mihon2[i] = '1';
now += 1;
} else {
mihon1[i] = '1';
mihon2[i] = '0';
now -= 1;
}
}
int one = 0;
int two = 0;
rep(i, s.size()) {
if (s[i] != mihon1[i])
one += 1;
else if (s[i] != mihon2[i])
two += 1;
}
cout << min(one, two) << endl;
}
| [
"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') {
right++;
} else if (s[i] == '0') {
left++;
}
}
cout << min(left, right) << endl;
}
| #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++;
} else if (s[i] == '0') {
right++;
}
}
cout << min(left, right) << endl;
}
| [
"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') {
right++;
} else if (s[i - 1] == '0') {
right++;
}
}
cout << min(left, right) << endl;
} | #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++;
} else if (s[i] == '0') {
right++;
}
}
cout << min(left, right) << endl;
}
| [
"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"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
ll solve(vector<int> &c) {
vector<int> d(c.begin(), c.end());
ll ret = 0;
rep(i, c.size() - 1) {
if (d[i] == d[i + 1]) {
d[i + 1] = !d[i];
ret++;
}
}
return ret;
}
int main() {
INPUT_FILE CIN_OPTIMIZE;
string S;
cin >> S;
int N = S.size();
vector<int> c(N);
rep(i, N) { c[i] = S[i] - '0'; }
ll ans = solve(c);
c[0] = !c[0];
ans = min(ans, solve(c));
cout << ans << endl;
} | #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"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
ll solve(vector<int> &c) {
vector<int> d(c.begin(), c.end());
ll ret = 0;
rep(i, c.size() - 1) {
if (d[i] == d[i + 1]) {
d[i + 1] = !d[i];
ret++;
}
}
return ret;
}
int main() {
INPUT_FILE CIN_OPTIMIZE;
string S;
cin >> S;
int N = S.size();
vector<int> c(N);
rep(i, N) { c[i] = S[i] - '0'; }
ll ans = solve(c);
c[0] = !c[0];
ans = min(ans, solve(c) + 1);
cout << ans << endl;
} | [
"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 > ans2) {
ans1 = ans2;
}
cout << ans1;
}
| #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 (ans1 > ans2) {
ans1 = ans2;
}
cout << ans1;
}
| [
"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(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i, k, n) for (int64 i = k; i < (int)n; i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert(B <= A && A <= C)
#define MP make_pair
#define PB push_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define SQ(x) ((x) * (x))
const double pi = acos(-1.0);
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int, int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
// ONLINE_JUDGE LOCAL
int64 powr(int64 x, int64 y, int64 p) {
int res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void in_o() {
#ifndef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cinsc;
}
int main() {
// in_o();
string s;
cin >> s;
int a = 0, b = 0;
FOR(i, 0, s.length()) {
if (i % 2) {
if (s[i] == '0')
a++;
else
b++;
} else {
if (s[i] == 'b')
a++;
else
b++;
}
}
cout << min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define cinsc \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i, k, n) for (int64 i = k; i < (int)n; i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert(B <= A && A <= C)
#define MP make_pair
#define PB push_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define SQ(x) ((x) * (x))
const double pi = acos(-1.0);
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int, int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
// ONLINE_JUDGE LOCAL
int64 powr(int64 x, int64 y, int64 p) {
int res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void in_o() {
#ifndef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cinsc;
}
int main() {
// in_o();
string s;
cin >> s;
int a = 0, b = 0;
FOR(i, 0, s.length()) {
if (i % 2) {
if (s[i] == '0')
a++;
else
b++;
} else {
if (s[i] == '1')
a++;
else
b++;
}
}
cout << min(a, b) << endl;
return 0;
}
| [
"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)
#define th(v) get<2>(v)
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
int main() {
string S;
cin >> S;
ll ans1 = 0;
ll ans2 = 0;
for (ll i = 0; i < S.size(); i++) {
if (i % 2 && S[i] == '0')
ans1++;
else if (1 % 2 == 0 && S[i] == '1')
ans1++;
}
for (ll i = 0; i < S.size(); i++) {
if (i % 2 == 0 && S[i] == '0')
ans2++;
else if (1 % 2 && S[i] == '1')
ans2++;
}
print(min(ans1, ans2)) return 0;
}
| #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)
#define th(v) get<2>(v)
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
int main() {
string S;
cin >> S;
ll ans1 = 0;
ll ans2 = 0;
for (ll i = 0; i < S.size(); i++) {
if (i % 2 && S[i] == '0')
ans1++;
else if (i % 2 == 0 && S[i] == '1')
ans1++;
}
for (ll i = 0; i < S.size(); i++) {
if (i % 2 == 0 && S[i] == '0')
ans2++;
else if (i % 2 && S[i] == '1')
ans2++;
}
print(min(ans1, ans2)) return 0;
}
| [
"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
ans2++;
}
}
cout << max(ans1, ans2) << endl;
} | #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
ans2++;
}
}
cout << min(ans1, ans2) << endl;
} | [
"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); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
const ll INF = 1LL << 60;
int main() {
string S;
cin >> S;
// vector<int> odd(S.size() / 2, 0), even(S.size() / 2);
int odd = 0, even = 0;
int half = S.size() / 2;
rep(i, S.size()) {
if ((i + 1) % 2 == 1) {
if (S[i] == '0')
odd++;
} else {
if (S[i] == '0')
even++;
}
}
int a, b;
if (S.size() % 2 == 1) {
a = odd + (half + 1) - even;
b = half - odd + even;
} else {
a = odd + half - even;
b = half - odd + even;
}
cout << min(a, b) << endl;
} | // #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); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
const ll INF = 1LL << 60;
int main() {
string S;
cin >> S;
// vector<int> odd(S.size() / 2, 0), even(S.size() / 2);
int odd = 0, even = 0;
int half = S.size() / 2;
rep(i, S.size()) {
if ((i + 1) % 2 == 1) {
if (S[i] == '0')
odd++;
} else {
if (S[i] == '0')
even++;
}
}
int a, b;
if (S.size() % 2 == 1) {
a = odd + half - even;
b = half + 1 - odd + even;
} else {
a = odd + half - even;
b = half - odd + even;
}
cout << min(a, b) << endl;
} | [
"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); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
const ll INF = 1LL << 60;
int main() {
string S;
cin >> S;
// vector<int> odd(S.size() / 2, 0), even(S.size() / 2);
int odd = 0, even = 0;
int half = S.size() / 2;
rep(i, S.size()) {
if ((i + 1) % 2 == 1) {
if (S[i] == '0')
odd++;
} else {
if (S[i] == '0')
even++;
}
}
int a, b;
if (S.size() % 2 == 1) {
a = odd + (half + 1) - even;
b = (half + 1) - odd + even;
} else {
a = odd + half - even;
b = half - odd + even;
}
cout << min(a, b) << endl;
} | // #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); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
const ll INF = 1LL << 60;
int main() {
string S;
cin >> S;
// vector<int> odd(S.size() / 2, 0), even(S.size() / 2);
int odd = 0, even = 0;
int half = S.size() / 2;
rep(i, S.size()) {
if ((i + 1) % 2 == 1) {
if (S[i] == '0')
odd++;
} else {
if (S[i] == '0')
even++;
}
}
int a, b;
if (S.size() % 2 == 1) {
a = odd + half - even;
b = half + 1 - odd + even;
} else {
a = odd + half - even;
b = half - odd + even;
}
cout << min(a, b) << endl;
} | [] | 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';
} else {
s[i + 1] == '0';
}
} else {
ans += 0;
}
}
cout << ans << endl;
}
| #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';
} else {
s[i + 1] = '0';
}
} else {
ans += 0;
}
}
cout << ans << endl;
}
| [
"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, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll maxi = 0, f = 0, mini = INF, sum = 0;
string str, str2;
ll h, w;
ll n, x, m;
ll a, b, d;
multiset<int> s;
cin >> str;
rep(i, str.length()) {
if (i % n && str[i] == '0')
sum++;
else if (i % n == 0 && str[i] == '1')
sum++;
}
rep(i, str.length()) {
if (i % n && str[i] == '1')
f++;
else if (i % n == 0 && str[i] == '0')
f++;
}
cout << min(sum, f);
}
| // 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, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll maxi = 0, f = 0, mini = INF, sum = 0;
string str, str2;
ll h, w;
ll n, x, m;
ll a, b, d;
multiset<int> s;
cin >> str;
rep(i, str.length()) {
if (i % 2 && str[i] == '0')
sum++;
else if (i % 2 == 0 && str[i] == '1')
sum++;
}
rep(i, str.length()) {
if (i % 2 && str[i] == '1')
f++;
else if (i % 2 == 0 && str[i] == '0')
f++;
}
cout << min(sum, f);
}
| [
"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++;
}
if (j % 2 == 1 && S[j] == (char)(i + '0')) {
cnt++;
}
ans = min(ans, cnt);
}
}
cout << ans << endl;
return 0;
} | #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') -> '1'
if (j % 2 == 0 && S[j] != (char)(i + '0')) {
cnt++;
}
if (j % 2 == 1 && S[j] == (char)(i + '0')) {
cnt++;
}
}
ans = min(ans, cnt);
}
cout << ans << endl;
return 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) {
if (a > b) {
a = b;
return true;
}
return false;
}
using namespace std;
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD = 1000000007;
// const int MOD=998244353;
const int INTMAX = 1001001000;
const ll LLMAX = 1010010010010010000;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S;
cin >> S;
string S2 = S;
ll ans1 = 0;
for (ll i = 1; i < S.size(); i++) {
if (S[i] == S[i - 1]) {
if (S[i] == '0')
S[i] = '1';
else
S[i] = '0';
ans1++;
}
}
if (S2[0] == '0')
S2[0] = '1';
else
S2[0] = '0';
ll ans2 = 0;
for (ll i = 1; i < S2.size(); i++) {
if (S2[i] == S2[i - 1]) {
if (S2[i] == '0')
S2[i] = '1';
else
S2[i] = '0';
ans2++;
}
}
cout << min(ans1, ans2) << endl;
return 0;
}
| #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) {
if (a > b) {
a = b;
return true;
}
return false;
}
using namespace std;
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD = 1000000007;
// const int MOD=998244353;
const int INTMAX = 1001001000;
const ll LLMAX = 1010010010010010000;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S;
cin >> S;
string S2 = S;
ll ans1 = 0;
for (ll i = 1; i < S.size(); i++) {
if (S[i] == S[i - 1]) {
if (S[i] == '0')
S[i] = '1';
else
S[i] = '0';
ans1++;
}
}
if (S2[0] == '0')
S2[0] = '1';
else
S2[0] = '0';
ll ans2 = 1;
for (ll i = 1; i < S2.size(); i++) {
if (S2[i] == S2[i - 1]) {
if (S2[i] == '0')
S2[i] = '1';
else
S2[i] = '0';
ans2++;
}
}
cout << min(ans1, ans2) << endl;
return 0;
}
| [
"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 - 1) {
if (s[i] == '0' && s[i + 1] == '0') {
s[i + 1] = '1';
res++;
} else if (s[i] == '1' && s[i + 1] == '1') {
s[i + 1] = '0';
res++;
}
}
int ans = 0;
repr(i, l - 1) {
if (S[i] == '0' && S[i - 1] == '0') {
S[i] = '1';
ans++;
} else if (S[i] == '1' && S[i - 1] == '1') {
S[i] = '0';
ans++;
}
}
cout << min(res, ans) << endl;
}
| #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 - 1) {
if (s[i] == '0' && s[i + 1] == '0') {
s[i + 1] = '1';
res++;
} else if (s[i] == '1' && s[i + 1] == '1') {
s[i + 1] = '0';
res++;
}
}
int ans = 0;
repr(i, l - 1) {
if (S[i] == '0' && S[i - 1] == '0') {
S[i - 1] = '1';
ans++;
} else if (S[i] == '1' && S[i - 1] == '1') {
S[i - 1] = '0';
ans++;
}
}
cout << min(res, ans) << endl;
}
| [
"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') {
cnt++;
s[i + 1] == '0';
}
}
cout << cnt << endl;
}
| #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' && s[i + 1] == '1') {
cnt++;
s[i + 1] = '0';
// cout << i << endl;
}
}
cout << cnt << endl;
}
| [
"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') {
cnt++;
s[i + 1] == '0';
}
}
cout << cnt << endl;
}
| #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' && s[i + 1] == '1') {
cnt++;
s[i + 1] = '0';
// cout << i << endl;
}
}
cout << cnt << endl;
}
| [
"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 inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
char s[maxn], t[maxn];
int main() {
scanf("%s", s);
int res = 0, ans = 0, n = strlen(s);
for (int i = 0; i < n; i++)
t[i] = s[i];
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1])
s[i] = (s[i] - '0' + 1) % 2 + '0', res++;
}
for (int i = n - 2; i >= 0; i--) {
if (t[i] == t[i + 1])
t[i] = (t[i] - '0' + 1) % 2 + '0', ans++;
}
printf("%d\n", max(res, ans));
return 0;
}
| #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 inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
char s[maxn], t[maxn];
int main() {
scanf("%s", s);
int res = 0, ans = 0, n = strlen(s);
for (int i = 0; i < n; i++)
t[i] = s[i];
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1])
s[i] = (s[i] - '0' + 1) % 2 + '0', res++;
}
for (int i = n - 2; i >= 0; i--) {
if (t[i] == t[i + 1])
t[i] = (t[i] - '0' + 1) % 2 + '0', ans++;
}
printf("%d\n", min(res, ans));
return 0;
}
| [
"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 + 1] = '0';
ans1++;
}
t[0] == '0' ? t[0] = '1' : t[0] = '0';
rep(i, t.size()) {
if (t[i] != t[i + 1])
continue;
t[i] == '0' ? t[i + 1] = '1' : t[i + 1] = '0';
ans2++;
}
cout << min(ans1, ans2);
}
| #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 + 1] = '0';
ans1++;
}
t[0] == '0' ? t[0] = '1' : t[0] = '0';
rep(i, t.size()) {
if (t[i] != t[i + 1])
continue;
t[i] == '0' ? t[i + 1] = '1' : t[i + 1] = '0';
ans2++;
}
cout << min(ans1, ans2);
}
| [
"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
ans2++;
} else {
if (s[i] != '1')
ans++;
else
ans2++;
}
}
cout << min(ans, ans2) << endl;
return;
}
int main() {
solve();
return 0;
}
| #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++;
} else {
if (s[i] != '1')
ans++;
else
ans2++;
}
}
cout << min(ans, ans2) << endl;
return;
}
int main() {
solve();
return 0;
}
| [
"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;
prevTile = (inputStr.at(i) == '0' ? '1' : '0');
} else {
prevTile = inputStr.at(i);
}
}
int colorChangeTileCountFirstChange = 0;
prevTile = (inputStr.at(0) == '0' ? '1' : '0');
for (int i = 1; i < n; ++i) {
if (inputStr.at(i) == prevTile) {
++colorChangeTileCountFirstChange;
prevTile = (inputStr.at(i) == '0' ? '1' : '0');
} else {
prevTile = inputStr.at(i);
}
}
cout << min(colorChangeTileCountFirstFix, colorChangeTileCountFirstChange)
<< endl;
} | #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;
prevTile = (inputStr.at(i) == '0' ? '1' : '0');
} else {
prevTile = inputStr.at(i);
}
}
int colorChangeTileCountFirstChange = 1;
prevTile = (inputStr.at(0) == '0' ? '1' : '0');
for (int i = 1; i < n; ++i) {
if (inputStr.at(i) == prevTile) {
++colorChangeTileCountFirstChange;
prevTile = (inputStr.at(i) == '0' ? '1' : '0');
} else {
prevTile = inputStr.at(i);
}
}
cout << min(colorChangeTileCountFirstFix, colorChangeTileCountFirstChange)
<< endl;
} | [
"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;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0 && s[i] == '1')
ans++;
if (i % 2 == 1 && s[i] == '0')
ans++;
}
int anss;
for (int i = 0; i < n; i++) {
if (i % 2 == 1 && s[i] == '1')
anss++;
if (i % 2 == 0 && s[i] == '0')
anss++;
}
cout << min(ans, anss) << endl;
} | //#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;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0 && s[i] == '1')
ans++;
if (i % 2 == 1 && s[i] == '0')
ans++;
}
int anss = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 1 && s[i] == '1')
anss++;
if (i % 2 == 0 && s[i] == '0')
anss++;
}
cout << min(ans, anss) << endl;
} | [
"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]) {
ans_1++;
if (s[i] == '0') {
s[i] = '1';
} else {
s[i] = '0';
}
}
}
} else if (s[0] == '1') {
ans_1++;
s[0] = '0';
rep(i, 1, s.size()) {
if (s[i] == s[i - 1]) {
ans_1++;
if (s[i] == '0') {
s[i] = '1';
} else {
s[i] = '0';
}
}
}
}
if (t[0] == '1') {
rep(i, 1, t.size()) {
if (t[i] == t[i - 1]) {
ans_2++;
if (t[i] == '0') {
t[i] = '1';
} else {
t[i] = '0';
}
}
}
} else if (t[0] == '0') {
ans_2++;
s[0] = '1';
rep(i, 1, t.size()) {
if (s[i] == s[i - 1]) {
ans_2++;
if (t[i] == '0') {
t[i] = '1';
} else {
t[i] = '0';
}
}
}
}
// cout << ans_1 << ans_2 << endl;
cout << min(ans_1, ans_2) << endl;
return 0;
}
| #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]) {
ans_1++;
if (s[i] == '0') {
s[i] = '1';
} else {
s[i] = '0';
}
}
}
} else if (s[0] == '1') {
ans_1++;
s[0] = '0';
rep(i, 1, s.size()) {
if (s[i] == s[i - 1]) {
ans_1++;
if (s[i] == '0') {
s[i] = '1';
} else {
s[i] = '0';
}
}
}
}
if (t[0] == '1') {
rep(i, 1, t.size()) {
if (t[i] == t[i - 1]) {
ans_2++;
if (t[i] == '0') {
t[i] = '1';
} else {
t[i] = '0';
}
}
}
} else if (t[0] == '0') {
ans_2++;
t[0] = '1';
rep(i, 1, t.size()) {
if (t[i] == t[i - 1]) {
ans_2++;
if (t[i] == '0') {
t[i] = '1';
} else {
t[i] = '0';
}
}
}
}
// cout << ans_1 << ans_2 << endl;
cout << min(ans_1, ans_2) << endl;
return 0;
}
| [
"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] == s1[i + 1]) {
s1[i + 1] = 1 - s1[i + 1];
cnt1++;
}
if (s2[n - i] == s2[n - i - 1]) {
s2[n - i - 1] = 1 - s2[n - i - 1];
cnt2++;
}
}
cout << min(cnt1, cnt2) << endl;
return 0;
} | #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] == s1[i + 1]) {
s1[i + 1] = 1 - s1[i + 1];
cnt1++;
}
if (s2[n - i - 1] == s2[n - i - 2]) {
s2[n - i - 2] = 1 - s2[n - i - 2];
cnt2++;
}
}
cout << min(cnt1, cnt2) << endl;
return 0;
} | [
"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++;
} else {
if (s[i] == '0')
b++;
else
a++;
}
}
cout << s.size() - max(a, 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++;
} else {
if (s[i] == '0')
a++;
else
b++;
}
}
cout << s.size() - max(a, 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 << ans << endl;
}
| #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 << ans << endl;
}
| [
"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 + 1) % 2) {
a++;
}
}
}
cout << a << endl;
} | #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 + 1) % 2) {
a++;
}
}
}
cout << a << endl;
} | [
"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_INF 9223372036854775807 + 1
#define sosuu 1000000007
int main() {
int hyp1 = 0;
int hyp2 = 0;
string S;
cin >> S;
rep(i, S.size()) {
if (i % 2 == 0 && S[i] == '0')
hyp1++;
if (i % 2 == 1 && S[i] == '1')
hyp1++;
}
rep(i, S.size()) {
if (i % 2 == 1 && S[i] == '1')
hyp2++;
if (i % 2 == 0 && S[i] == '0')
hyp2++;
}
cout << min(hyp1, hyp2) << endl;
}
| #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_INF 9223372036854775807 + 1
#define sosuu 1000000007
int main() {
int hyp1 = 0;
int hyp2 = 0;
string S;
cin >> S;
rep(i, S.size()) {
if (i % 2 == 0 && S[i] == '0')
hyp1++;
if (i % 2 == 1 && S[i] == '1')
hyp1++;
}
rep(i, S.size()) {
if (i % 2 == 1 && S[i] == '0')
hyp2++;
if (i % 2 == 0 && S[i] == '1')
hyp2++;
}
cout << min(hyp1, hyp2) << endl;
}
| [
"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;
for (int j = 0; j < n; j++) {
if ((S[j] - '0') != i)
tmp++;
k = 1 - k;
}
ans = min(tmp, ans);
}
cout << ans << endl;
return 0;
} | #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;
for (int j = 0; j < n; j++) {
if ((S[j] - '0') != k)
tmp++;
k = 1 - k;
}
ans = min(tmp, ans);
}
cout << ans << endl;
return 0;
} | [
"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) { return b ? gcd(b, a % b) : a; }
int main() {
int a, b;
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (i % 2 == 0) {
if (s[i] == '0') {
++a;
} else {
++b;
}
} else {
if (s[i] == '0') {
++b;
} else {
++a;
}
}
}
if (a < b) {
cout << a << endl;
} else {
cout << b << endl;
}
} | #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) { return b ? gcd(b, a % b) : a; }
int main() {
int a = 0, b = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (i % 2 == 0) {
if (s[i] == '0') {
++a;
} else {
++b;
}
} else {
if (s[i] == '0') {
++b;
} else {
++a;
}
}
}
if (a < b) {
cout << a << endl;
} else {
cout << b << endl;
}
} | [
"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] == ss[i]) {
ss[i + 1].flip();
ans++;
}
}
reverse(all(s));
int ans2 = 0;
bitset<100000> sss(s);
for (int i = 0; i < s.size() - 1; i++) {
if (ss[i + 1] == sss[i]) {
sss[i + 1].flip();
ans2++;
}
}
cout << min(ans, ans2) << endl;
}
| #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] == ss[i]) {
ss[i + 1].flip();
ans++;
}
}
reverse(all(s));
int ans2 = 0;
bitset<100000> sss(s);
for (int i = 0; i < s.size() - 1; i++) {
if (sss[i + 1] == sss[i]) {
sss[i + 1].flip();
ans2++;
}
}
cout << min(ans, ans2) << endl;
}
| [
"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() {
string s;
cin >> s;
int n;
int ans = 0;
for (int i = 0; i < n - 1; ++i) {
if (s[i] == s[i + 1]) {
ans++;
if (s[i + 1] == '0')
s[i + 1] = '1';
else
s[i + 1] = '0';
}
}
cout << ans << endl;
return 0;
}
| #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() {
string s;
cin >> s;
int n = s.length();
int ans = 0;
for (int i = 0; i < n - 1; ++i) {
if (s[i] == s[i + 1]) {
ans++;
if (s[i + 1] == '0')
s[i + 1] = '1';
else
s[i + 1] = '0';
}
}
cout << ans << endl;
return 0;
}
| [
"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') {
a++; // 0
} else {
b++;
}
}
}
cout << min(a, b) << endl;
} | #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') {
a++; // 0
} else {
b++;
}
}
}
cout << min(a, b) << endl;
} | [
"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 >> s;
string s0, s1;
rep(i, s.size() / 2) {
s0 += '0';
s0 += '1';
}
if (s.size() % 2 == 1)
s0 += '0';
rep(i, s.size() / 2) {
s1 += '1';
s1 += '0';
}
if (s.size() % 2 == 1)
s1 += '1';
int c0, c1;
rep(i, s.size()) {
if (s.at(i) != s0.at(i)) {
c0++;
}
if (s.at(i) != s1.at(i)) {
c1++;
}
}
cout << min(c0, c1) << endl;
return 0;
}
| #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 >> s;
string s0, s1;
rep(i, s.size() / 2) {
s0 += '0';
s0 += '1';
}
if (s.size() % 2 == 1)
s0 += '0';
rep(i, s.size() / 2) {
s1 += '1';
s1 += '0';
}
if (s.size() % 2 == 1)
s1 += '1';
int c0 = 0;
int c1 = 0;
rep(i, s.size()) {
if (s.at(i) != s0.at(i)) {
c0++;
}
if (s.at(i) != s1.at(i)) {
c1++;
}
}
cout << min(c0, c1) << endl;
return 0;
}
| [
"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() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int count1 = 0, count2 = 0;
for (int i = 0; i < int(s.length()); i++) {
if (i % 2 == 0) {
if (s[i] == '1')
count2++;
if (s[i] == '0')
count1++;
} else {
if (s[i] == '0')
count1++;
if (s[i] == '1')
count2++;
}
}
cout << min(count1, count2) << endl;
}
| #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() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int count1 = 0, count2 = 0;
for (int i = 0; i < int(s.length()); i++) {
if (i % 2 == 0) {
if (s[i] == '1')
count2++;
if (s[i] == '0')
count1++;
} else {
if (s[i] == '0')
count2++;
if (s[i] == '1')
count1++;
}
}
cout << min(count1, count2) << endl;
}
| [
"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() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int count1 = 0, count2 = 0;
for (int i = 0; i < int(s.length()); i++) {
if (i % 2 == 0) {
if (s[i] == '1')
count2++;
if (s[i + 1] == '0')
count1++;
} else {
if (s[i] == '0')
count1++;
if (s[i + 1] == '1')
count2++;
}
}
cout << min(count1, count2) << endl;
}
| #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() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int count1 = 0, count2 = 0;
for (int i = 0; i < int(s.length()); i++) {
if (i % 2 == 0) {
if (s[i] == '1')
count2++;
if (s[i] == '0')
count1++;
} else {
if (s[i] == '0')
count2++;
if (s[i] == '1')
count1++;
}
}
cout << min(count1, count2) << endl;
}
| [
"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'))
cnt++;
if (j % 2 == 1 && s[i] == (char)(i + '0'))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
} | #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'))
cnt++;
if (j % 2 == 1 && s[j] == (char)(i + '0'))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
} | [
"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(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
int main() {
int N;
string S, S1, S2;
cin >> S;
N = S.length();
S1 = S;
S2 = S;
if (S2[0] == '0')
S2[0] = '1';
else
S2[0] = '1';
int res = 0, pos = 0, ans;
REP(i, N - 1) {
if (S1[i] == S1[i + 1]) {
res++;
if (S1[i + 1] == '0')
S1[i + 1] = '1';
else
S1[i + 1] = '0';
}
}
REP(i, N - 1) {
if (S2[i] == S2[i + 1]) {
pos++;
if (S2[i + 1] == '0')
S2[i + 1] = '1';
else
S2[i + 1] = '0';
}
}
ans = min(res, pos);
cout << ans << endl;
} | #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(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
int main() {
int N;
string S, S1, S2;
cin >> S;
N = S.length();
S1 = S;
S2 = S;
if (S2[0] == '0')
S2[0] = '1';
else
S2[0] = '0';
int res = 0, pos = 1, ans;
REP(i, N - 1) {
if (S1[i] == S1[i + 1]) {
res++;
if (S1[i + 1] == '0')
S1[i + 1] = '1';
else
S1[i + 1] = '0';
}
}
REP(i, N - 1) {
if (S2[i] == S2[i + 1]) {
pos++;
if (S2[i + 1] == '0')
S2[i + 1] = '1';
else
S2[i + 1] = '0';
}
}
ans = min(res, pos);
cout << ans << endl;
} | [
"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", ans);
return 0;
}
| #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", ans);
return 0;
}
| [
"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>
//---------------------------------------------------------------
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1000000000000000LL
#define all(x) x.begin(), x.end()
using pint = pair<int, int>;
using vec = vector<int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
//---------------------------------------------------------------
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//---------------------------------------------------------------
//↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string n;
cin >> n;
int ans1 = 0;
for (int i = 0; i < n.size(); i++) {
if (i % 2 == 0 && n.at(i) != '0')
ans1++;
if (i % 2 == 1 && n.at(i) != '-1')
ans1++;
}
int ans2 = 0;
for (int i = 0; i < n.size(); i++) {
if (i % 2 == 0 && n.at(i) != '-1')
ans2++;
if (i % 2 == 1 && n.at(i) != '0')
ans2++;
}
int ans = min(ans1, ans2);
cout << ans << endl;
} | //---------------------------------------------------------------
#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>
//---------------------------------------------------------------
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1000000000000000LL
#define all(x) x.begin(), x.end()
using pint = pair<int, int>;
using vec = vector<int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
//---------------------------------------------------------------
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//---------------------------------------------------------------
//↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string n;
cin >> n;
int ans1 = 0;
for (int i = 0; i < n.size(); i++) {
if (i % 2 == 0 && n.at(i) != '0')
ans1++;
if (i % 2 == 1 && n.at(i) != '1')
ans1++;
}
int ans2 = 0;
for (int i = 0; i < n.size(); i++) {
if (i % 2 == 0 && n.at(i) != '1')
ans2++;
if (i % 2 == 1 && n.at(i) != '0')
ans2++;
}
int ans = min(ans1, ans2);
cout << ans << endl;
} | [
"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);
}
cout << ans << endl;
} | #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);
}
cout << ans << endl;
} | [
"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;
}
return false;
}
using P = pair<long long, long long>;
#define rep(i, n) for (long long i = 0; i < (long long)n; i++)
#define req(i, n) for (long long i = n - 1; i >= 0; i--)
#define range(i, a, b) for (long long i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((long long)(x).size())
#define COUT(x) cout << x << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define onBoard(y, x) (y >= 0 && y < h && x >= 0 && x < w)
#define vint vector<int>
#define pri_que priority_queue
#define vvint vector<vector<int>>
#define vstr vector<string>
#define vp vector<pair<int, int>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define show(x) cout << #x << "=" << x << endl;
#define SUM(x) accumulate(x.begin(), x.end(), 0)
#define MAX(x) *max_element(x.begin(), x.end())
#define MIN(x) *min_element(x.begin(), x.end())
#define couty cout << "Yes" << endl
#define coutn cout << "No" << endl
#define coutY cout << "YES" << endl
#define coutN cout << "NO" << endl
#define yn(x) cout << (x ? "Yes" : "No") << endl
#define YN(x) cout << (x ? "YES" : "NO") << endl
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const long long dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const long long dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const long long INF = 1e12;
const long long MOD = 1e9 + 7;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
string s;
cin >> s;
int n = sz(s);
int res = 0;
int s1 = 0, s0 = 0;
rep(i, n - 1) {
if (i % 2 == 0 && s[i] != '1')
s1++;
if (i % 2 == 1 && s[i] != '0')
s1++;
}
rep(i, n - 1) {
if (i % 2 == 0 && s[i] != '0')
s0++;
if (i % 2 == 1 && s[i] != '1')
s0++;
}
cout << min(s0, s1) << endl;
}
| #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;
}
return false;
}
using P = pair<long long, long long>;
#define rep(i, n) for (long long i = 0; i < (long long)n; i++)
#define req(i, n) for (long long i = n - 1; i >= 0; i--)
#define range(i, a, b) for (long long i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((long long)(x).size())
#define COUT(x) cout << x << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define onBoard(y, x) (y >= 0 && y < h && x >= 0 && x < w)
#define vint vector<int>
#define pri_que priority_queue
#define vvint vector<vector<int>>
#define vstr vector<string>
#define vp vector<pair<int, int>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define show(x) cout << #x << "=" << x << endl;
#define SUM(x) accumulate(x.begin(), x.end(), 0)
#define MAX(x) *max_element(x.begin(), x.end())
#define MIN(x) *min_element(x.begin(), x.end())
#define couty cout << "Yes" << endl
#define coutn cout << "No" << endl
#define coutY cout << "YES" << endl
#define coutN cout << "NO" << endl
#define yn(x) cout << (x ? "Yes" : "No") << endl
#define YN(x) cout << (x ? "YES" : "NO") << endl
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const long long dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const long long dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const long long INF = 1e12;
const long long MOD = 1e9 + 7;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
string s;
cin >> s;
int n = sz(s);
int res = 0;
int s1 = 0, s0 = 0;
rep(i, n) {
if (i % 2 == 0 && s[i] != '1')
s1++;
if (i % 2 == 1 && s[i] != '0')
s1++;
}
rep(i, n) {
if (i % 2 == 0 && s[i] != '0')
s0++;
if (i % 2 == 1 && s[i] != '1')
s0++;
}
cout << min(s0, s1) << endl;
}
| [
"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] != '1') {
x++;
}
}
}
for (int i = 0; i <= s.size() - 1; i++) {
if (i % 2 == 0) {
if (s[i] != '1') {
y++;
}
} else {
if (s[i] != '0') {
y++;
}
}
}
if (x > y)
cout << y << endl;
else
cout << x << endl;
return 0;
}
| #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) {
if (s[i] != '1') {
x++;
}
}
}
for (int i = 0; i <= s.size() - 1; i++) {
if (i % 2 == 0) {
if (s[i] != '1') {
y++;
}
} else {
if (s[i] != '0') {
y++;
}
}
}
if (x > y)
cout << y << endl;
else
cout << x << endl;
return 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 s;
cin >> s;
int ans = inf;
for (int i = 0; i <= 1; i++) {
int a = i;
int count = 0;
for (int j = 0; j < s.size(); j++) {
if (s[i] - '0' != a)
count++;
a = 1 - a;
}
ans = min(ans, count);
}
cout << ans << endl;
return 0;
} | #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 s;
cin >> s;
int ans = 1 << 29;
for (int i = 0; i <= 1; i++) {
int a = i;
int count = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] - '0' != a)
count++;
a = 1 - a;
}
ans = min(ans, count);
}
cout << ans << endl;
return 0;
} | [
"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) == A.at(X)) {
AA++;
} else {
BB++;
}
}
if (AA >= BB) {
cout << BB << endl;
} else {
cout << AA << endl;
}
}
| #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) == A.at(X)) {
AA++;
} else {
BB++;
}
}
if (AA >= BB) {
cout << BB << endl;
} else {
cout << AA << endl;
}
} | [] | 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 - now;
}
now = 1;
rep(i, n) {
if (s[i] - '0' != now)
memo++;
now = 1 - now;
}
ans = min(ans, memo);
cout << ans << endl;
return 0;
} | #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 = 1 - now;
}
now = 1;
rep(i, n) {
if (s[i] - '0' != now)
memo++;
now = 1 - now;
}
ans = min(ans, memo);
cout << ans << endl;
return 0;
} | [
"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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
string s;
cin >> s;
int ans = 999999;
rep(i, 2) {
int cnt = 0;
rep(j, s.size()) {
if (j % 2 == 0 && s[i] == (char)(i + '0'))
cnt++;
if (j % 2 == 1 && s[i] != (char)(i + '0'))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
}
| #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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
string s;
cin >> s;
int ans = 999999;
rep(i, 2) {
int cnt = 0;
rep(j, s.size()) {
if (j % 2 == 0 && s[j] == (char)(i + '0'))
cnt++;
if (j % 2 == 1 && s[j] != (char)(i + '0'))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
}
| [
"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] == '1') {
a++;
}
}
}
if (s[0] == 0)
b++;
for (int i = 1; i < s.size(); i++) {
if (i % 2 == 1) {
if (s[i] == '1') {
b++;
}
} else {
if (s[i] == '0') {
b++;
}
}
}
cout << min(a, b);
return 0;
}
| #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] == '1') {
a++;
}
}
}
if (s[0] == '0')
b++;
for (int i = 1; i < s.size(); i++) {
if (i % 2 == 1) {
if (s[i] == '1') {
b++;
}
} else {
if (s[i] == '0') {
b++;
}
}
}
cout << min(a, b);
return 0;
}
| [
"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] == '1') {
a++;
}
}
}
if (s[0] == 1)
b++;
for (int i = 1; i < s.size(); i++) {
if (i % 2 == 1) {
if (s[i] == '1') {
b++;
}
} else {
if (s[i] == '0') {
b++;
}
}
}
cout << min(a, b);
return 0;
}
| #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] == '1') {
a++;
}
}
}
if (s[0] == '0')
b++;
for (int i = 1; i < s.size(); i++) {
if (i % 2 == 1) {
if (s[i] == '1') {
b++;
}
} else {
if (s[i] == '0') {
b++;
}
}
}
cout << min(a, b);
return 0;
}
| [
"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] != ref1[i])
ans1++;
}
REP(i, n) {
if (i % 2 != 0)
ref1.push_back('1');
else
ref1.push_back('0');
if (s[i] != ref2[i])
ans2++;
}
cout << min(ans1, ans2) << endl;
}
| #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] != ref1[i])
ans1++;
}
REP(i, n) {
if (i % 2 != 0)
ref2.push_back('1');
else
ref2.push_back('0');
if (s[i] != ref2[i])
ans2++;
}
cout << min(ans1, ans2) << endl;
}
| [
"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, 1, -1};
const int c_Dy[4] = {1, -1, 0, 0};
const int c_div = 1000000007; // 10^9 + 7
int main() {
char S[100005];
scanf("%s", S);
int odd = 0; // 1010101
int even = 0; // 010101
int size = 0;
for (int i = 0; i < 100005; i++) {
if (S[i] == '\0') {
size = i;
}
}
for (int i = 0; i < size; i++) {
if (i % 2 == 1) { //奇数番目
if (S[i] == '1') {
even++;
} else {
odd++;
}
} else {
if (S[i] == '0') {
even++;
} else {
odd++;
}
}
}
printf("%d\n", min(odd, even));
}
| #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, 1, -1};
const int c_Dy[4] = {1, -1, 0, 0};
const int c_div = 1000000007; // 10^9 + 7
int main() {
char S[1000005];
scanf("%s", S);
int odd = 0; // 1010101
int even = 0; // 010101
int size = 0;
for (int i = 0; i < 1000005; i++) {
if (S[i] == '\0') {
size = i;
break;
}
}
for (int i = 0; i < size; i++) {
if (i % 2 == 1) { //奇数番目
if (S[i] == '1') {
even++;
} else {
odd++;
}
} else {
if (S[i] == '0') {
even++;
} else {
odd++;
}
}
}
printf("%d\n", min(odd, even));
}
| [
"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 = 0;
bool flg = true;
rep(i, s.size()) {
if (flg) {
if (s.at(i) == '1')
ans1++;
flg = false;
} else {
if (s.at(i) == '0')
ans1++;
flg = true;
}
}
rep(i, s.size()) {
if (flg) {
if (s.at(i) == '0')
ans2++;
flg = false;
} else {
if (s.at(i) == '1')
ans2++;
flg = true;
}
}
cout << min(ans1, ans2) << endl;
}
| #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 = 0;
bool flg = true;
rep(i, s.size()) {
if (flg) {
if (s.at(i) == '1')
ans1++;
flg = false;
} else {
if (s.at(i) == '0')
ans1++;
flg = true;
}
}
flg = true;
rep(i, s.size()) {
if (flg) {
if (s.at(i) == '0')
ans2++;
flg = false;
} else {
if (s.at(i) == '1')
ans2++;
flg = true;
}
}
cout << min(ans1, ans2) << endl;
}
| [
"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 % 2 != s[i] - '0')
ans2++;
tmp++;
}
cout << min(ans1, ans2) << endl;
return 0;
} | #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 % 2 != s[i] - '0')
ans2++;
tmp++;
}
cout << min(ans1, ans2) << endl;
return 0;
} | [
"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
cout << b << endl;
return 0;
} | #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;
else
cout << b << endl;
return 0;
} | [
"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)));
return 0;
} | #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)));
return 0;
} | [
"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'))
cnt++;
}
ans = (ans, cnt);
}
cout << ans << endl;
}
| #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'))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
}
| [
"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]) {
cout << count + 1 << endl;
} else {
cout << count << endl;
}
return 0;
}
for (int i = 1; i < length - 1; i++) {
if (S[i - 1] == S[i]) {
count++;
if (S[i - 1] == '0')
S[i] = '1';
else
S[i] = '0';
}
}
cout << count << endl;
}
| #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]) {
cout << count + 1 << endl;
} else {
cout << count << endl;
}
return 0;
}
for (int i = 1; i < length; i++) {
if (S[i - 1] == S[i]) {
count++;
if (S[i - 1] == '0')
S[i] = '1';
else
S[i] = '0';
}
}
cout << count << endl;
}
| [
"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 = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e18;
const int MOD = 1e9 + 7;
signed main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
REP(i, s.size() - 1) {
if (i % 2 == 0) {
if (s[i] == '0')
ans1++;
else
ans2++;
} else {
if (s[i] == '0')
ans2++;
else
ans1++;
}
}
cout << min(ans1, ans2) << endl;
}
| #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 = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e18;
const int MOD = 1e9 + 7;
signed main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
REP(i, s.size()) {
if (i % 2 == 0) {
if (s[i] == '0')
ans1++;
else
ans2++;
} else {
if (s[i] == '0')
ans2++;
else
ans1++;
}
}
cout << min(ans1, ans2) << endl;
}
| [
"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';
} else {
now = '0';
}
}
now = '1';
for (int i = 0; i < s.size(); i++) {
if (now != s[i]) {
ans++;
}
if (now == '0') {
now = '1';
} else {
now = '0';
}
}
cout << min(ans, sum); // your code goes here
return 0;
} | #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';
} else {
now = '0';
}
}
now = '1';
for (int i = 0; i < s.size(); i++) {
if (now != s[i]) {
ans++;
}
if (now == '0') {
now = '1';
} else {
now = '0';
}
}
cout << min(ans, sum); // your code goes here
return 0;
} | [
"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 (S[i] == '0')
x++;
else if (S[i] == '1')
y++;
}
}
cout << min(x, y) << endl;
return 0;
} | #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) {
if (S[i] == '0')
x++;
else if (S[i] == '1')
y++;
}
}
cout << min(x, y) << endl;
return 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 all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
string s;
cin >> s;
int cnt1 = 0;
int cnt2 = 0;
char x = '1';
for (int i = 1; i < s.size(); i++) {
if (x == s[i])
cnt1++;
if (x == '1')
x = '0';
else
x = '1';
}
x = '0';
for (int i = 1; i < s.size(); i++) {
if (x == s[i])
cnt2++;
if (x == '1')
x = '0';
else
x = '1';
}
cout << min(cnt1, cnt2);
} | #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 all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
string s;
cin >> s;
int cnt1 = 0;
int cnt2 = 0;
char x = '1';
for (int i = 0; i < s.size(); i++) {
if (x != s[i])
cnt1++;
if (x == '1')
x = '0';
else
x = '1';
}
x = '0';
for (int i = 0; i < s.size(); i++) {
if (x != s[i])
cnt2++;
if (x == '1')
x = '0';
else
x = '1';
}
cout << min(cnt1, cnt2);
} | [
"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 < strlen(s); i++) {
if (i % 2 == 0) {
if (s[i] = '1') {
y++;
}
}
if (i % 2 == 1) {
if (s[i] = '0') {
y++;
}
}
}
if (y < x) {
x = y;
}
cout << x;
}
| #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 < strlen(s); i++) {
if (i % 2 == 0) {
if (s[i] == '1') {
y++;
}
}
if (i % 2 == 1) {
if (s[i] == '0') {
y++;
}
}
}
if (y < x) {
x = y;
}
cout << x;
}
| [
"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++;
}
}
ans = cnt;
T = S;
cnt = 0;
for (int i = n - 2; i >= 0; i--) {
if (T[i] == T[i + 1]) {
T[i + 1] = (T[i + 1] == '0' ? '1' : '0');
cnt++;
}
}
ans = min(ans, cnt);
cout << ans << endl;
return 0;
} | #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++;
}
}
ans = cnt;
T = S;
cnt = 0;
for (int i = n - 2; i >= 0; i--) {
if (T[i] == T[i + 1]) {
T[i] = (T[i] == '0' ? '1' : '0');
cnt++;
}
}
ans = min(ans, cnt);
cout << ans << endl;
return 0;
} | [
"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] = s[i] - '0';
// s[0]=1
int prev = ss[0];
FOR(i, 1, N - 1) {
if (prev == ss[i]) {
prev = 1 - ss[i];
res++;
} else
prev = ss[i];
}
prev = 1 - ss[0];
int cnt = 0;
FOR(i, 1, N - 1) {
if (prev == ss[i]) {
prev = 1 - ss[i];
cnt++;
} else
prev = ss[i];
}
res = min(res, cnt);
cout << res << endl;
}
| #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] = s[i] - '0';
int prev = ss[0];
FOR(i, 1, N - 1) {
if (prev == ss[i]) {
prev = 1 - ss[i];
res++;
} else
prev = ss[i];
}
prev = 1 - ss[0];
int cnt = 1;
FOR(i, 1, N - 1) {
if (prev == ss[i]) {
prev = 1 - ss[i];
cnt++;
} else
prev = ss[i];
}
res = min(res, cnt);
cout << res << endl;
}
| [
"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++;
}
}
}
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
if (S.at(i) == '1') {
dif_S1++;
}
} else {
if (S.at(i) == '0') {
dif_S1++;
}
}
}
cout << min(dif_S0, dif_S1) << endl;
} | #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++;
}
}
}
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
if (S.at(i) == '0') {
dif_S1++;
}
} else {
if (S.at(i) == '1') {
dif_S1++;
}
}
}
cout << min(dif_S0, dif_S1) << endl;
}
| [
"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 + 1) = '1';
else
s.at(i + 1) = '0';
}
icolor = s.at(i + 1);
}
cout << ans << endl;
} | #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 + 1) = '1';
else
s.at(i + 1) = '0';
}
icolor = s.at(i + 1);
}
cout << ans << endl;
} | [
"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.