problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | [
"control_flow.loop.for.update.change"
] | 885,640 | 885,641 | u414877092 | cpp |
p03074 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma warning(disable : 4996)
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <s... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma warning(disable : 4996)
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <s... | [] | 885,648 | 885,649 | u455067221 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,652 | 885,653 | u863279562 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,654 | 885,653 | u863279562 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d[100001], a[100001], sum[100001];
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
char c;
cin >> c;
d[i] = c - '0';
}
for (int i = 1; i <= n; i++) {
a[i] = d[i - 1] ^ d[i];
}
sum[0] = 0;
for (int i = 1; i <= n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int d[100001], a[100001], sum[100001];
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
char c;
cin >> c;
d[i] = c - '0';
}
for (int i = 1; i <= n; i++) {
a[i] = d[i - 1] ^ d[i];
}
sum[0] = 0;
for (int i = 1; i <= n; i++... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,659 | 885,660 | u597691811 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d[100001], a[100001], sum[100001];
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
char c;
cin >> c;
d[i] = c - '0';
}
for (int i = 1; i <= n; i++) {
a[i] = d[i - 1] ^ d[i];
}
sum[0] = 0;
for (int i = 1; i <= n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int d[100001], a[100001], sum[100001];
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
char c;
cin >> c;
d[i] = c - '0';
}
for (int i = 1; i <= n; i++) {
a[i] = d[i - 1] ^ d[i];
}
sum[0] = 0;
for (int i = 1; i <= n; i++... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,665 | 885,660 | u597691811 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d[100001], a[100001], sum[100001];
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
char c;
cin >> c;
d[i] = c - '0';
}
for (int i = 1; i <= n; i++) {
a[i] = d[i - 1] ^ d[i];
}
sum[0] = 0;
for (int i = 1; i <= n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int d[100001], a[100001], sum[100001];
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
char c;
cin >> c;
d[i] = c - '0';
}
for (int i = 1; i <= n; i++) {
a[i] = d[i - 1] ^ d[i];
}
sum[0] = 0;
for (int i = 1; i <= n; i++... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,665 | 885,667 | u597691811 | cpp |
p03070 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
template <class T> static inline std::vector<T> ndvec(size_t &&n, T val) {
return std::vector<T>(n, std::forward<T>(val));
}
template <class... Tail> static... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
template <class T> static inline std::vector<T> ndvec(size_t &&n, T val) {
return std::vector<T>(n, std::forward<T>(val));
}
template <class... Tail> static... | [
"expression.operation.binary.remove"
] | 885,682 | 885,683 | u852585808 | cpp |
p03070 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define... | [
"control_flow.loop.for.initializer.change"
] | 885,702 | 885,703 | u450832845 | cpp |
p03070 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; i++)
#define rep(i, n) for (ll ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; i++)
#define rep(i, n) for (ll ... | [
"assignment.change"
] | 885,718 | 885,719 | u434662823 | cpp |
p03070 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; i++)
#define rep(i, n) for (ll ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; i++)
#define rep(i, n) for (ll ... | [
"literal.number.change",
"call.arguments.change"
] | 885,720 | 885,719 | u434662823 | cpp |
p03070 | #include <algorithm>
#include <iostream>
using namespace std;
using lli = long long int;
lli a[301] = {};
lli A[301][300 * 302] = {};
lli B[301][300 * 302] = {};
const lli mod = 998244353;
int main(void) {
lli N;
cin >> N;
lli total = 1, sum = 0;
for (lli i = 0; i < N; i++) {
cin >> a[i];
total *... | #include <algorithm>
#include <iostream>
using namespace std;
using lli = long long int;
lli a[301] = {};
lli A[301][300 * 303] = {};
lli B[301][300 * 303] = {};
const lli mod = 998244353;
int main(void) {
lli N;
cin >> N;
lli total = 1, sum = 0;
for (lli i = 0; i < N; i++) {
cin >> a[i];
total *... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 885,730 | 885,731 | u155216115 | cpp |
p03070 | #include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long n, long long mod) {
if (n == 0)
return 1;
if (n == 1)
return a % mod;
if (n % 2 == 0) {
long long half = modpow(a, n / 2, mod) % mod;
return half * half % mod;
} else
return modpow(a, 1, mod) * modpow(a,... | #include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long n, long long mod) {
if (n == 0)
return 1;
if (n == 1)
return a % mod;
if (n % 2 == 0) {
long long half = modpow(a, n / 2, mod) % mod;
return half * half % mod;
} else
return modpow(a, 1, mod) * modpow(a,... | [
"expression.operation.binary.remove"
] | 885,749 | 885,750 | u465233477 | cpp |
p03070 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 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; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 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; }
/* attention
long longのシフト演算には気をつけよう
... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 885,755 | 885,756 | u052332717 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
#define ll long long
#define MOD 1000000007
#define MAX 10000000
using namespace std;
vector<int> white(MAX);
vector<int> black(MAX);
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int w = 0, b = 0;
for (int i = 0; i < n; i++) {
if (s[i... | #include <iostream>
#include <string>
#include <vector>
#define ll long long
#define MOD 1000000007
#define MAX 10000000
using namespace std;
vector<int> white(MAX);
vector<int> black(MAX);
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int w = 0, b = 0;
for (int i = 0; i < n; i++) {
if (s[i... | [
"assignment.change"
] | 885,769 | 885,770 | u139300044 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 885,785 | 885,786 | u839397805 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 885,802 | 885,803 | u277556971 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#includ... | [
"call.add",
"call.arguments.add"
] | 885,822 | 885,823 | u092650292 | cpp |
p03074 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define PI acos(-1)
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define srt(a) sort(all(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define f first
#define s second
#define MOD ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define PI acos(-1)
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define srt(a) sort(all(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define f first
#define s second
#define MOD ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 885,824 | 885,825 | u736250852 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | [
"call.add"
] | 885,826 | 885,827 | u995725911 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n, k;
string s;
int acc[MAX_N];
int ans;
int main(void) {
// Here your code !
scanf("%d %d", &n, &k);
cin >> s;
if (s[0] == '0') {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n, k;
string s;
int acc[MAX_N];
int ans;
int main(void) {
// Here your code !
scanf("%d %d", &n, &k);
cin >> s;
if (s[0] == '0') {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 885,837 | 885,838 | u497422208 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
// 0,2,4,,番目に連続する1の個数を、1,3,5,,,番目に連続する0の個数をpush_backする
if (S[0] == '0') {
vec.push_back(0);
} //最初の連続する1の個数は０
int head = 0;
while (head < N) {
// headは0(または１）の連続する個数を数える... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
// 0,2,4,,番目に連続する1の個数を、1,3,5,,,番目に連続する0の個数をpush_backする
if (S[0] == '0') {
vec.push_back(0);
} //最初の連続する1の個数は０
int head = 0;
while (head < N) {
// headは0(または１）の連続する個数を数える... | [
"control_flow.loop.condition.change"
] | 885,841 | 885,842 | u904123392 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define N 1000010
int a[N], b[N], ca = 0, cb = 0;
char s[100010];
int main() {
int n, k;
scanf("%d%d", &n, &k);
scanf("%s", s + 1);
int flag1 = 0, flag0 = 0,... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define N 1000010
int a[N], b[N], ca = 0, cb = 0;
char s[100010];
int main() {
int n, k;
scanf("%d%d", &n, &k);
scanf("%s", s + 1);
int flag1 = 0, flag0 = 0,... | [
"assignment.change"
] | 885,845 | 885,846 | u820628270 | cpp |
p03074 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 885,852 | 885,853 | u324303263 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,856 | 885,857 | u348670055 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,865 | 885,866 | u318785595 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define inf 1000000000
#define pb push_back
#define mp make_pair
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define inf 1000000000
#define pb push_back
#define mp make_pair
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"assignment.change"
] | 885,867 | 885,868 | u653046450 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define inf 1000000000
#define pb push_back
#define mp make_pair
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define inf 1000000000
#define pb push_back
#define mp make_pair
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"assignment.change"
] | 885,869 | 885,868 | u653046450 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<long long> a;
int cnt = 0;
char bef = '1';
for (int i = 0; i < n; i++) {
if (bef == s[i]) {
cnt++;
} else {
a.push_back(cnt);
cnt = ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<long long> a;
int cnt = 0;
char bef = '1';
for (int i = 0; i < n; i++) {
if (bef == s[i]) {
cnt++;
} else {
a.push_back(cnt);
cnt = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
... | 885,876 | 885,877 | u990764614 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<long long> a;
int cnt = 0;
char bef = '1';
for (int i = 0; i < n; i++) {
if (bef == s[i]) {
cnt++;
} else {
a.push_back(cnt);
cnt = ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<long long> a;
int cnt = 0;
char bef = '1';
for (int i = 0; i < n; i++) {
if (bef == s[i]) {
cnt++;
} else {
a.push_back(cnt);
cnt = ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access... | 885,878 | 885,877 | u990764614 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<long long> a;
int cnt = 0;
char bef = '1';
for (int i = 0; i < n; i++) {
if (bef == s[i]) {
cnt++;
} else {
a.push_back(cnt);
cnt = ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<long long> a;
int cnt = 0;
char bef = '1';
for (int i = 0; i < n; i++) {
if (bef == s[i]) {
cnt++;
} else {
a.push_back(cnt);
cnt = ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 885,879 | 885,877 | u990764614 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<long long> a;
int cnt = 0;
char bef = '1';
for (int i = 0; i < n; i++) {
if (bef == s[i]) {
cnt++;
} else {
a.push_back(cnt);
cnt = ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<long long> a;
int cnt = 0;
char bef = '1';
for (int i = 0; i < n; i++) {
if (bef == s[i]) {
cnt++;
} else {
a.push_back(cnt);
cnt = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 885,880 | 885,877 | u990764614 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> b(N);
for (int i = 0; i < N; ++i) {
if (S.at(i) == '0') {
b.at(i) = 0;
} else {
b.at(i) = 1;
}
}
vector<int> change;
change.push_back(0);
for (int i = 1; i < N... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> b(N);
for (int i = 0; i < N; ++i) {
if (S.at(i) == '0') {
b.at(i) = 0;
} else {
b.at(i) = 1;
}
}
vector<int> change;
change.push_back(0);
for (int i = 1; i < N... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 885,889 | 885,890 | u036192637 | cpp |
p03074 | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n, k, count0 = 0, count1 = 0, sum = 0, size = 0;
string s;
cin >> ... | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n, k, count0 = 0, count1 = 0, sum = 0, size = 0;
string s;
cin >> ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,891 | 885,892 | u276796245 | cpp |
p03074 | // besmellah
#include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
vector<long long> dp;
vector<long long> PS;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, k;
cin >> n >> k;
dp.push_back(1);
string s;
cin >> s;
for (long long i = 1; i < n; i++) {
if (s[i] != s[i... | // besmellah
#include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
vector<long long> dp;
vector<long long> PS;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, k;
cin >> n >> k;
dp.push_back(1);
string s;
cin >> s;
for (long long i = 1; i < n; i++) {
if (s[i] != s[i... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 885,893 | 885,894 | u170407818 | cpp |
p03074 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define UL unsigned long long
int main(void) {
IOS int n, k;
cin >> n >>... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define UL unsigned long long
int main(void) {
IOS int n, k;
cin >> n >>... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,895 | 885,896 | u330661451 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,897 | 885,898 | u649310245 | cpp |
p03074 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
typed... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
typed... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,907 | 885,908 | u924406834 | cpp |
p03074 | #define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
// 左端が逆立ちか否かを表すフラグ変数
bool flag_le_hand = (S[0] == '1');
vector<int> hand(N, 0);
vector<int> stand(N, 0);
int h_idx = 0;
int s_idx = 0;
... | #define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
bool flag_le_hand = (S[0] == '1');
vector<int> hand(N, 0);
vector<int> stand(N, 0);
int h_idx = 0;
int s_idx = 0;
char p = S[0];
int nu... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 885,913 | 885,914 | u518206537 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int b = (s[0] == '0' ? 0 : 1);
a.push_back(1);
for (int i = 1; i < n; ++i) {
if (s[i] == s[i - 1]) {
++a.back();
} else {
a.push_ba... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int b = (s[0] == '0' ? 0 : 1);
a.push_back(1);
for (int i = 1; i < n; ++i) {
if (s[i] == s[i - 1]) {
++a.back();
} else {
a.push_ba... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 885,933 | 885,934 | u986399983 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, count, p = 0;
string S;
vector<int> group(0);
string check = "10";
cin >> N >> K >> S;
int i = 0;
while (p < S.size()) {
count = 0;
while (p < S.size() && S.at(p) == check.at(i % 2)) {
p++;
count++;
}
group.p... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, count, p = 0;
string S;
vector<int> group(0);
string check = "10";
cin >> N >> K >> S;
int i = 0;
while (p < S.size()) {
count = 0;
while (p < S.size() && S.at(p) == check.at(i % 2)) {
p++;
count++;
}
group.p... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 885,939 | 885,940 | u825376369 | cpp |
p03074 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <s... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <s... | [] | 885,952 | 885,953 | u434662823 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | [
"expression.operation.binary.add"
] | 885,958 | 885,955 | u007637377 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
string s;
cin >> n >> k >> s;
vector<int> man0(50010);
vector<int> man1(50010);
int a = 0;
int b = 0;
for (i = 0; i < n; i++) {
if (s.at(i) == '0') {
man0.at(a)++;
}
if (s.at(i) == '1') {
man1.at(b)++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
string s;
cin >> n >> k >> s;
vector<int> man0(50010);
vector<int> man1(50010);
int a = 0;
int b = 0;
for (i = 0; i < n; i++) {
if (s.at(i) == '0') {
man0.at(a)++;
}
if (s.at(i) == '1') {
man1.at(b)++;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,966 | 885,967 | u989336028 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
string s;
cin >> n >> k >> s;
vector<int> man0(50010);
vector<int> man1(50010);
int a = 0;
int b = 0;
for (i = 0; i < n; i++) {
if (s.at(i) == '0') {
man0.at(a)++;
}
if (s.at(i) == '1') {
man1.at(b)++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
string s;
cin >> n >> k >> s;
vector<int> man0(50010);
vector<int> man1(50010);
int a = 0;
int b = 0;
for (i = 0; i < n; i++) {
if (s.at(i) == '0') {
man0.at(a)++;
}
if (s.at(i) == '1') {
man1.at(b)++;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,968 | 885,967 | u989336028 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long int ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for (int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long int ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for (int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 885,973 | 885,974 | u261243803 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long int ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for (int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long int ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for (int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 885,975 | 885,974 | u261243803 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
bool one_start = (S.at(0) == '1');
vector<int> arr(N + 2);
int idx = 0;
char pre = '1';
if (S.at(0) == '0') { // 0スタートだった
idx++;
arr.at(0) = 0; // 1が0個あることにする
pre ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
bool one_start = (S.at(0) == '1');
vector<int> arr(1000000);
int idx = 0;
char pre = '1';
if (S.at(0) == '0') { // 0スタートだった
idx++;
arr.at(0) = 0; // 1が0個あることにする
pr... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,980 | 885,979 | u701743518 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ll long long
#def... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ll long long
#def... | [
"identifier.change",
"call.arguments.change"
] | 885,986 | 885,987 | u190234543 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int maxi(int a, int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int maxi(int a, int ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 885,993 | 885,994 | u620242073 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int maxi(int a, int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int maxi(int a, int ... | [
"expression.operation.binary.remove"
] | 885,995 | 885,994 | u620242073 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define forN(n, N) for (int n = 0; n < N; n++)
#define res_out(ans) cout << ans << "\n";
#define ll long long
int zero[int(1e6)], one[int(1e6)];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
int N, K, i = 0;
cin >> N >> K >> S;
forN(n, N) {
... | #include <bits/stdc++.h>
using namespace std;
#define forN(n, N) for (int n = 0; n < N; n++)
#define res_out(ans) cout << ans << "\n";
#define ll long long
int zero[int(1e6)], one[int(1e6)];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
int N, K, i = 0;
cin >> N >> K >> S;
forN(n, N) {
... | [
"expression.operation.binary.add"
] | 885,998 | 885,999 | u382251756 | cpp |
p03074 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> stand;
vector<int> reverse;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
count++;
} else {
if (count... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> stand;
vector<int> reverse;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
count++;
} else {
if (count... | [
"assignment.add"
] | 886,006 | 886,007 | u270681687 | cpp |
p03074 | //
// Created by 江口慎悟 on 2019-04-13.
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void a() {
int A, B;
cin >> A >> B;
int ans = 0;
if (A > B) {
ans += A;
A--;
} else {
ans += B;
B--;
}
if (A > B) {
ans += A;
A--;
} else {
ans += B;
... | //
// Created by 江口慎悟 on 2019-04-13.
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void a() {
int A, B;
cin >> A >> B;
int ans = 0;
if (A > B) {
ans += A;
A--;
} else {
ans += B;
B--;
}
if (A > B) {
ans += A;
A--;
} else {
ans += B;
... | [
"expression.operation.binary.remove",
"assignment.change"
] | 886,013 | 886,014 | u040092786 | cpp |
p03074 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void a() {
int A, B;
cin >> A >> B;
int ans = 0;
if (A > B) {
ans += A;
A--;
} else {
ans += B;
B--;
}
if (A > B) {
ans += A;
A--;
} else {
ans += B;
B--;
}
cout << ans;
}
void b() {
... | //
// Created by 江口慎悟 on 2019-04-13.
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void a() {
int A, B;
cin >> A >> B;
int ans = 0;
if (A > B) {
ans += A;
A--;
} else {
ans += B;
B--;
}
if (A > B) {
ans += A;
A--;
} else {
ans += B;
... | [
"expression.operation.binary.remove",
"assignment.change"
] | 886,015 | 886,014 | u040092786 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
vector<int> v;
cin >> N >> K >> S;
char now = '1';
int cnt = 0;
for (int i = 0; i < N; i++) {
if (no... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
vector<int> v;
cin >> N >> K >> S;
char now = '1';
int cnt = 0;
for (int i = 0; i < N; i++) {
if (no... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 886,028 | 886,029 | u394033362 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
vector<int> v;
cin >> N >> K >> S;
char now = '1';
int cnt = 0;
for (int i = 0; i < N; i++) {
if (no... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
vector<int> v;
cin >> N >> K >> S;
char now = '1';
int cnt = 0;
for (int i = 0; i < N; i++) {
if (no... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 886,030 | 886,029 | u394033362 | cpp |
p03074 | #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);
int n, k;
cin >> n >> k;
string s;
cin ... | #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);
int n, k;
cin >> n >> k;
string s;
cin ... | [
"assignment.change"
] | 886,037 | 886,038 | u480831358 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
int n, k;
cin >> n >> k;
cin >> s;
s = "@" + s;
int tmp = k;
int r = 1;
for (int i = 1; i <= n; i++) {
if (s[r] == '0' && s[r - 1] == '1') {
if (tmp) {
tmp--;
r++;
} else
break;
} else {
... | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
int n, k;
cin >> n >> k;
cin >> s;
s = "1" + s;
int tmp = k;
int r = 1;
for (int i = 1; i <= n; i++) {
if (s[r] == '0' && s[r - 1] == '1') {
if (tmp) {
tmp--;
r++;
} else
break;
} else {
... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 886,049 | 886,050 | u358988638 | cpp |
p03074 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
// cout << fixed << setprecision(10);
string str;
long long int n, m, res[200001] = {}, x, h[30... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
// cout << fixed << setprecision(10);
string str;
long long int n, m, res[300101] = {}, x, h[30... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 886,053 | 886,054 | u018872912 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
t... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
t... | [
"assignment.change"
] | 886,059 | 886,060 | u997325490 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sta... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sta... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 886,061 | 886,062 | u587248350 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
struct Node {
int l, r;
} a[100005];
int n, m, k;
string s;
int main() {
m = 0;
scanf("%d%d", &n, &k);
cin >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == '0') {
a[m].l = i;
while (s[++i] == '0') {
}
i--;
a[m++].r = i;
}
}
... | #include <bits/stdc++.h>
using namespace std;
struct Node {
int l, r;
} a[100005];
int n, m, k;
string s;
int main() {
m = 0;
scanf("%d%d", &n, &k);
cin >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == '0') {
a[m].l = i;
while (s[++i] == '0') {
}
i--;
a[m++].r = i;
}
}
... | [
"expression.operation.binary.remove"
] | 886,065 | 886,066 | u318486253 | cpp |
p03074 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | [
"control_flow.loop.for.initializer.change"
] | 886,071 | 886,072 | u905715926 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
u... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 886,073 | 886,074 | u711985352 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v, w;
int now = 0;
char c = s[0];
for (int i = 0; i < s.size(); i++) {
if (s[i] == c) {
now++;
} else {
if (c == '0') {
v.push_back(now);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v, w;
int now = 0;
char c = s[0];
for (int i = 0; i < s.size(); i++) {
if (s[i] == c) {
now++;
} else {
if (c == '0') {
v.push_back(now);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 886,077 | 886,078 | u357265888 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
int main() {
int ... | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
int main() {
int ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 886,086 | 886,087 | u504322356 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pp;
typedef long long ll;
#define sz(x) (int)x.size()
int const N = 3e5 + 10, oo = 1e9;
ll const OO = 2e18;
double const eps = 1e-8, PI = acos(-1);
int mod = oo + 7;
int n, k;
string s;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pp;
typedef long long ll;
#define sz(x) (int)x.size()
int const N = 3e5 + 10, oo = 1e9;
ll const OO = 2e18;
double const eps = 1e-8, PI = acos(-1);
int mod = oo + 7;
int n, k;
string s;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >>... | [
"assignment.change",
"expression.operation.binary.remove"
] | 886,088 | 886,089 | u151534880 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | [
"assignment.change"
] | 886,094 | 886,095 | u788341294 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incII(i, l, r) for (int i = (l); i <= (r); ++i)
#define incID(i, l, r) for (int i = (l); i < (r); ++i)
#define decII(i, l, r) for (int i = (r); i >= (l); --i)
#define decID(i, l, r) for (int i = (r)... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incII(i, l, r) for (int i = (l); i <= (r); ++i)
#define incID(i, l, r) for (int i = (l); i < (r); ++i)
#define decII(i, l, r) for (int i = (r); i >= (l); --i)
#define decID(i, l, r) for (int i = (r)... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 886,098 | 886,099 | u568652083 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// cout << fixed << setprecision(15);
vector<int> forintinput(int n) {
vector<int> x;
for (int i = 0; i < n; i++) {
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// cout << fixed << setprecision(15);
vector<int> forintinput(int n) {
vector<int> x;
for (int i = 0; i < n; i++) {
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,100 | 886,101 | u025223061 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> V;
typedef vector<V> VV;
int main() {
// Happy hacking!
ll n, k;
string s;
cin >> n >> k;
cin >> s;
V blk_size;
V blk_dist;
ll t_size = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> V;
typedef vector<V> VV;
int main() {
// Happy hacking!
ll n, k;
string s;
cin >> n >> k;
cin >> s;
V blk_size;
V blk_dist;
ll t_size = 0;
... | [
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 886,102 | 886,103 | u315265093 | cpp |
p03074 | #include <iostream>
#include <vector>
using namespace std;
void update(int *c, int *p, int *a, int *head, int *size, int a_size, long *sum,
long *max) {
// cout << "add:" << *c << endl;
// push
if (*size < a_size) {
// cout << "size:" << *size<< endl;
a[*head + *size] = *c;
*sum += *c;... | #include <iostream>
#include <vector>
using namespace std;
void update(long *c, int *p, int *a, int *head, int *size, int a_size,
long *sum, long *max) {
// cout << "add:" << *c << endl;
// push
if (*size < a_size) {
// cout << "size:" << *size<< endl;
a[*head + *size] = *c;
*sum += *c... | [
"variable_declaration.type.primitive.change",
"assignment.value.change"
] | 886,110 | 886,111 | u199912250 | cpp |
p03074 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
#define MAX_NK 100000
using namespace std;
int N, K;
string S;
vector<int> sct;
int solve() {
if (S[0] == '0')
sct.push_back(0);
char prev... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
#define MAX_NK 100000
using namespace std;
int N, K;
string S;
vector<int> sct;
int solve() {
if (S[0] == '0')
sct.push_back(0);
char prev... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change"
] | 886,114 | 886,115 | u777137418 | cpp |
p03074 | #include <bits/stdc++.h>
#define MB template <class T>
#define Fur(i, x, y) for (int i = x; i <= y; i++)
#define fcin ios::sync_with_stdio(false)
MB T MAX(T x, T y) { return x > y ? x : y; }
using namespace std;
#define N 400000
char ch[N];
int n, k, a[N], d = 1, ans = 0, t;
int main() {
fcin;
cin >> n >> k >> ch;
... | #include <bits/stdc++.h>
#define MB template <class T>
#define Fur(i, x, y) for (int i = x; i <= y; i++)
#define fcin ios::sync_with_stdio(false)
MB T MAX(T x, T y) { return x > y ? x : y; }
using namespace std;
#define N 400000
char ch[N];
int n, k, a[N], d = 1, ans = 0, t;
int main() {
fcin;
cin >> n >> k >> ch;
... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"call.add",
"call.arguments.add"
] | 886,118 | 886,119 | u871414721 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | [
"expression.unary.arithmetic.add"
] | 886,120 | 886,121 | u986276444 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
class Stand {
public:
int r;
int num;
};
int mai... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
class Stand {
public:
int r;
int num;
};
int mai... | [] | 886,139 | 886,140 | u830782448 | cpp |
p03074 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toStrin... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toStrin... | [
"control_flow.branch.if.condition.change"
] | 886,159 | 886,160 | u335278042 | cpp |
p03074 | // long time no ac
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << " :: " << x << "\n";
#define debug2(x, y) \
cout << #x << " :: " << x << "\t" << #y << " :: " << y << "\n";
#define debug3(x, y, z) ... | // long time no ac
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << " :: " << x << "\n";
#define debug2(x, y) \
cout << #x << " :: " << x << "\t" << #y << " :: " << y << "\n";
#define debug3(x, y, z) ... | [] | 886,168 | 886,169 | u355198744 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
string s;
cin >> s;
int ans = 0, l = 0, r = 0;
int cnt = 0;
queue<int> q;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
while (r < n &... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
string s;
cin >> s;
int ans = 0, l = 0, r = 0;
int cnt = 0;
queue<int> q;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
while (r < n &... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 886,170 | 886,171 | u344122377 | cpp |
p03074 | #include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define pri 10000000007
using namespace std;
void run() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll maxi = 0, oldo = 0, oldn = 0;
ll ro = 0, rz = 0;
ll preze[n + 1] = {0}, preon[... | #include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define pri 10000000007
using namespace std;
void run() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll maxi = 0, oldo = 0, oldn = 0;
ll ro = 0, rz = 0;
ll preze[n + 1] = {0}, preon[... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 886,176 | 886,177 | u874786170 | cpp |
p03074 | #include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define pri 10000000007
using namespace std;
void run() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll maxi = 0, oldo = 0, oldn = 0;
ll ro = 0, rz = 0;
ll preze[n + 1] = {0}, preon[... | #include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define pri 10000000007
using namespace std;
void run() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll maxi = 0, oldo = 0, oldn = 0;
ll ro = 0, rz = 0;
ll preze[n + 1] = {0}, preon[... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 886,178 | 886,177 | u874786170 | cpp |
p03074 | #include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define pri 10000000007
using namespace std;
void run() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll maxi = 0, oldo = 0, oldn = 0;
ll ro = 0, rz = 0;
ll preze[n + 1] = {0}, preon[... | #include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define pri 10000000007
using namespace std;
void run() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll maxi = 0, oldo = 0, oldn = 0;
ll ro = 0, rz = 0;
ll preze[n + 1] = {0}, preon[... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change"
] | 886,179 | 886,177 | u874786170 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define clr(ar, val) memset(ar, val, sizeof(ar))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define clr(ar, val) memset(ar, val, sizeof(ar))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 886,184 | 886,185 | u617380180 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string s;
cin >> N >> K;
cin >> s;
//最後にN=1を考慮を
if (N == 1) {
cout << 1 << endl;
return 0;
}
int sz = 1;
for (int i = 0; i < N - 1; i++) {
if (s[i] != s[i + 1]) {
sz++;
}
}
if (s[0] == 48)
sz++;
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string s;
cin >> N >> K;
cin >> s;
//最後にN=1を考慮を
if (N == 1) {
cout << 1 << endl;
return 0;
}
int sz = 1;
for (int i = 0; i < N - 1; i++) {
if (s[i] != s[i + 1]) {
sz++;
}
}
if (s[0] == 48)
sz++;
if (... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 886,186 | 886,187 | u837951457 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; ... | [
"expression.operation.binary.remove"
] | 886,188 | 886,189 | u228214259 | cpp |
p03075 | #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++)
int main() {
int a[5];
int k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
rep(i, 5) {
rep2(j, i + 1, 4) {
if (abs(a[j] - a[i]) > k) {
... | #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++)
int main() {
int a[5];
int k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
rep(i, 4) {
rep2(j, i + 1, 5) {
// cout<<a[j]<<" "<<a[i]<<" "<<a... | [
"literal.number.change",
"call.arguments.change"
] | 886,291 | 886,292 | u406647332 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,293 | 886,294 | u037675438 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k)
cout << "Yey!" << endl;
else
cout << ":(" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 886,295 | 886,294 | u037675438 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
int k;
int i, j, han;
for (i = 0; i < 5; i++) {
cin >> a.at(i);
}
cin >> k;
han = 0;
for (i = 0; i < 4; i++) {
for (j = i + 1; j < 4; j++) {
if (abs(a.at(i) - a.at(j)) > k) {
han++;
}
}
}
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
int k;
int i, j, han;
for (i = 0; i < 5; i++) {
cin >> a.at(i);
}
cin >> k;
han = 0;
for (i = 0; i < 4; i++) {
for (j = i + 1; j < 5; j++) {
if (abs(a.at(i) - a.at(j)) > k) {
han++;
}
}
}
if... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 886,301 | 886,302 | u764118909 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (k - a > 18)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 886,309 | 886,310 | u896726004 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
... | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
... | [
"literal.string.change",
"expression.operation.binary.change"
] | 886,313 | 886,314 | u207235471 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
... | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
... | [
"literal.string.change",
"expression.operation.binary.change"
] | 886,315 | 886,314 | u207235471 | cpp |
p03075 | // 123 A
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
string ans;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 4; j++) {
if (a[j... | // 123 A
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
string ans;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 886,320 | 886,321 | u448922807 | cpp |
p03075 | // 123 A
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
string ans;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 4; j++) {
if (a[j... | // 123 A
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
string ans;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,322 | 886,321 | u448922807 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> code;
for (int i = 0; i < 5; i++) {
cin >> code.at(i);
}
int K;
cin >> K;
int dif;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 5; j++) {
dif = code.at(j) - code.at(i);
if (dif > K) {
cout << ":(" << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> code(5);
for (int i = 0; i < 5; i++) {
cin >> code.at(i);
}
int K;
cin >> K;
int dif;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 5; j++) {
dif = code.at(j) - code.at(i);
if (dif > K) {
cout << ":(" <... | [
"call.arguments.add"
] | 886,323 | 886,324 | u726957641 | cpp |
p03075 | #include <iostream>
using namespace std;
int main(void) {
int f[5], k;
cin >> f[0] >> f[1] >> f[2] >> f[3] >> f[4] >> k;
int max = f[0], min = f[0];
for (int i = 1; i < 5; i++) {
if (max < f[i]) {
max = f[i];
}
if (min > f[i]) {
max = f[i];
}
}
if ((max - min) < k) {
puts... | #include <iostream>
using namespace std;
int main(void) {
int f[5], k;
cin >> f[0] >> f[1] >> f[2] >> f[3] >> f[4] >> k;
int max = f[0], min = f[0];
for (int i = 1; i < 5; i++) {
if (max < f[i]) {
max = f[i];
}
if (min > f[i]) {
max = f[i];
}
}
if ((max - min) <= k) {
put... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,325 | 886,326 | u793856757 | cpp |
p03075 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) < k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 886,329 | 886,330 | u848339218 | cpp |
p03075 | #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() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int l = e - a;
string ans;
if (l < k)
ans = "Yay!";
else
ans = ":(";
cout << ans << e... | #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() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int l = e - a;
string ans;
if (l <= k)
ans = "Yay!";
else
ans = ":(";
cout << ans << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,336 | 886,337 | u053990350 | cpp |
p03075 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"control_flow.branch.if.condition.change"
] | 886,338 | 886,339 | u516525290 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.