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 <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> seq;
if (s[0] == '0')
seq.push_back(0);
for (int i = 0; i < s.size(); i++) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
seq.push_back(j - i);
i = j;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> seq;
if (s[0] == '0')
seq.push_back(0);
for (int i = 0; i < s.size();) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
seq.push_back(j - i);
i = j;
}
if... | [
"control_flow.loop.for.update.change"
] | 885,132 | 885,133 | u515131769 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> di... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> di... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,149 | 885,150 | u228295160 | cpp |
p03074 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 885,154 | 885,155 | u128572736 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
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;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
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;
}... | [
"identifier.change",
"call.arguments.change"
] | 885,156 | 885,157 | u378702452 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9 + 7);
const double pi = acos(-1);
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9 + 7);
const double pi = acos(-1);
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 885,160 | 885,161 | u801513186 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#defi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#defi... | [
"expression.operation.binary.add"
] | 885,166 | 885,167 | u138062788 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#defi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#defi... | [
"expression.operation.binary.add"
] | 885,168 | 885,167 | u138062788 | cpp |
p03074 | bool DBG = false;
// #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace s... | bool DBG = false;
// #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace s... | [
"call.arguments.change"
] | 885,179 | 885,180 | u952090000 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<l... | [
"assignment.value.change",
"identifier.change"
] | 885,181 | 885,182 | u459930111 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<l... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 885,183 | 885,182 | u459930111 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
// using Graph = vector<vector<int>>;
const ll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
// using Graph = vector<vector<int>>;
const ll... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,190 | 885,189 | u207048881 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
// using Graph = vector<vector<int>>;
const ll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
// using Graph = vector<vector<int>>;
const ll... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,191 | 885,189 | u207048881 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main(void) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll ans = 0;
vector<ll> check;
check.push_back(0);
for (ll i = 0; i < ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main(void) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll ans = 0;
vector<ll> check;
check.push_back(0);
for (ll i = 0; i < ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,197 | 885,198 | u157195505 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main(void) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll ans = 0;
vector<ll> check;
check.push_back(0);
for (ll i = 0; i < ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main(void) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll ans = 0;
vector<ll> check;
check.push_back(0);
for (ll i = 0; i < ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 885,199 | 885,198 | u157195505 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int n, k, c = 0;
vector<int> a;
cin >> n >> k >> s;
rep(i, n) {
int j = i;
while (s[j + 1] == s[j] && j + 1 < n)
j++;
a.push_back(j - i + 1);
i = j;
}
reverse(a.b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int n, k, c = 0;
vector<int> a;
cin >> n >> k >> s;
rep(i, n) {
int j = i;
while (s[j + 1] == s[j] && j + 1 < n)
j++;
a.push_back(j - i + 1);
i = j;
}
reverse(a.b... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,202 | 885,203 | u298768617 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int n, k, c = 0;
vector<int> a;
cin >> n >> k >> s;
rep(i, n) {
int j = i;
while (s[j + 1] == s[j] && j + 1 < n)
j++;
a.push_back(j - i + 1);
i = j;
}
reverse(a.b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int n, k, c = 0;
vector<int> a;
cin >> n >> k >> s;
rep(i, n) {
int j = i;
while (s[j + 1] == s[j] && j + 1 < n)
j++;
a.push_back(j - i + 1);
i = j;
}
reverse(a.b... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 885,204 | 885,203 | u298768617 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | [
"control_flow.branch.if.condition.change"
] | 885,205 | 885,206 | u501163846 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 885,207 | 885,208 | u554843701 | cpp |
p03074 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define r first
#define l second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N =... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N =... | [
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 885,214 | 885,215 | u916060970 | cpp |
p03074 | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF = (ll)1e9;
const ll MOD = (ll)1e9 + 7;
const ll MAX = 510000;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
retu... | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF = (ll)1e9;
const ll MOD = (ll)1e9 + 7;
const ll MAX = 510000;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
retu... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 885,222 | 885,223 | u937275419 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[100010];
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll now = 1;
ll j = 0;
ll cnt = 0;
if (s[0] - '0' != 1) {
// cout << 2;
now = 1 - now;
a[0] = 0;
cnt = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[100010];
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll now = 1;
ll j = 0;
ll cnt = 0;
if (s[0] - '0' != 1) {
// cout << 2;
now = 1 - now;
a[0] = 0;
cnt = 1... | [
"assignment.value.change",
"call.arguments.change",
"assignment.change"
] | 885,227 | 885,228 | u166378830 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int res = 1;
s[n] = (s[n - 1] + 1) % 2;
if (s[0] == '0')
a.pb(0);
rep(i, n) {
if (s[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int res = 1;
s[n] = (s[n - 1] + 1) % 2;
if (s[0] == '0')
a.pb(0);
rep(i, n) {
if (s[... | [
"assignment.change"
] | 885,234 | 885,235 | u314917898 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | [
"assignment.change"
] | 885,236 | 885,237 | u328811800 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, add = 1, ans = 0, now = 0;
cin >> N >> K;
string S;
cin >> S;
vector<int> sum;
bool zero;
if (S[0] == '0') {
zero = true;
} else {
zero = false;
}
for (int i = 1; i < N; i++) {
if (zero) {
if (S[i] == '0') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, add = 1, ans = 0, now = 0;
cin >> N >> K;
string S;
cin >> S;
vector<int> sum;
bool zero;
if (S[0] == '0') {
zero = true;
} else {
zero = false;
}
for (int i = 1; i < N; i++) {
if (zero) {
if (S[i] == '0') {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 885,241 | 885,242 | u926416331 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | [
"expression.operation.binary.add"
] | 885,253 | 885,254 | u828388155 | cpp |
p03074 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
ll n, k;
cin >> n >> k;
string str;
cin >> str;
ll cnt = 0;
ll i = 0;
if (str[0] == '1')
cnt--;
while (i < n && cnt < k) {
if (str[i] == '1' && str[i + 1] == '0')
cnt++;
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
ll n, k;
cin >> n >> k;
string str;
cin >> str;
ll cnt = 0;
ll i = 0;
if (str[0] == '1')
cnt--;
while (i < n && cnt < k) {
if (str[i] == '1' && str[i + 1] == '0')
cnt++;
... | [
"control_flow.loop.condition.change"
] | 885,259 | 885,260 | u855186748 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;... | [
"control_flow.branch.if.condition.change"
] | 885,269 | 885,270 | u275488634 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define pii pair<int, int>
#define Task "abc"
#define For(i, a, b) for (int i = (a), _b = (b); i <= b; ++i)
#define Debug(X) cout << #X << " = " << X << '\n'
#define All(x) (x).begin(), (x).end()
#define mp make_pair
typedef unsigned long long ... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define pii pair<int, int>
#define Task "abc"
#define For(i, a, b) for (int i = (a), _b = (b); i <= b; ++i)
#define Debug(X) cout << #X << " = " << X << '\n'
#define All(x) (x).begin(), (x).end()
#define mp make_pair
typedef unsigned long long ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 885,271 | 885,272 | u041117654 | cpp |
p03074 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
int main(void) {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int A[N];
REP(i, N) { A[i] = S.at(i) - '0'; }... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
int main(void) {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int A[N];
REP(i, N) { A[i] = S.at(i) - '0'; }... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,273 | 885,274 | u986754154 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k, count = 0;
string s;
vector<int> si, so;
cin >> n >> k >> s;
char c = s[0];
if (c == '0')
si.push_back(0);
rep(i, n) {
if (c == s[i]) {
count++;
} else {
if (c ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k, count = 0;
string s;
vector<int> si, so;
cin >> n >> k >> s;
char c = s[0];
if (c == '0')
si.push_back(0);
rep(i, n) {
if (c == s[i]) {
count++;
} else {
if (c ... | [
"assignment.change"
] | 885,275 | 885,276 | u983711104 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k, count = 0;
string s;
vector<int> si, so;
cin >> n >> k >> s;
char c = s[0];
if (c == '0')
si.push_back(0);
rep(i, n) {
if (c == s[i]) {
count++;
} else {
if (c ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k, count = 0;
string s;
vector<int> si, so;
cin >> n >> k >> s;
char c = s[0];
if (c == '0')
si.push_back(0);
rep(i, n) {
if (c == s[i]) {
count++;
} else {
if (c ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 885,277 | 885,276 | u983711104 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s += '?';
int a[100000] = {0}, b[100000] = {0};
int j = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
b[j]++;
else
a[j]++;
if (s[i] == '0' && s[i + 1] == '1')
j++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s += '?';
int a[100000] = {0}, b[100000] = {0};
int j = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
b[j]++;
else
a[j]++;
if (s[i] == '0' && s[i + 1] == '1')
j++;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,278 | 885,279 | u294721290 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPD(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define FILLl(n, first_dimension_size, value) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPD(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define FILLl(n, first_dimension_size, value) ... | [
"call.arguments.change"
] | 885,280 | 885,281 | u204536668 | cpp |
p03074 | /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
usin... | /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
usin... | [] | 885,286 | 885,287 | u581262359 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
vector<pair<char, ll>> rle(string s) {
vector<pair<char, ll>> res;
char temp = s[0];
ll count = 0;
for (ll i = 0; i < s.siz... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
vector<pair<char, ll>> rle(string s) {
vector<pair<char, ll>> res;
char temp = s[0];
ll count = 0;
for (ll i = 0; i < s.siz... | [
"expression.operator.change"
] | 885,288 | 885,289 | u718758485 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> V;
int cnt = 1;
for (int i = 1; i <= N; i++) {
if (i == N) {
if (S[i - 1] == '0')
cnt *= -1;
V.push_back(cnt);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> V;
int cnt = 1;
for (int i = 1; i <= N; i++) {
if (i == N) {
if (S[i - 1] == '0')
cnt *= -1;
V.push_back(cnt);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 885,290 | 885,291 | u521973174 | cpp |
p03074 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
#define rep(i,... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
#define rep(i,... | [
"control_flow.branch.if.condition.change"
] | 885,299 | 885,300 | u943070796 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a(n);
rep(i, n) a[i] = s[i] - '0';
if (n = 1) {
cout << 1 << endl;
return 0;
}
vector<pair<int, int>> b;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a(n);
rep(i, n) a[i] = s[i] - '0';
if (n == 1) {
cout << 1 << endl;
return 0;
}
vector<pair<int, int>> b... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 885,305 | 885,306 | u131625544 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
vector<pair<ll, ll>> v;
bool f = false;
ll lef, rig;
for (int i = 0; i < n; i++) {
if (!f && s[i] == '0') {
f = 1;
lef = i;
}
if (f && s[i] == '1') {
f = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
vector<pair<ll, ll>> v;
bool f = false;
ll lef, rig;
for (int i = 0; i < n; i++) {
if (!f && s[i] == '0') {
f = 1;
lef = i;
}
if (f && s[i] == '1') {
f = ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 885,307 | 885,308 | u774202056 | cpp |
p03074 | #include <bits/stdc++.h>
#include <fstream>
#define inputtxt() \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf())
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define re... | #include <bits/stdc++.h>
#include <fstream>
#define inputtxt() \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf())
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define re... | [] | 885,320 | 885,321 | u979852867 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i ... | [
"call.arguments.change",
"expression.operation.binary.change",
"call.add"
] | 885,322 | 885,323 | u698883164 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 885,328 | 885,329 | u770009793 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 885,330 | 885,329 | u770009793 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt+... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt+... | [
"variable_declaration.remove"
] | 885,341 | 885,342 | u151505386 | cpp |
p03074 | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
int N, K;
s... | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
int N, K;
s... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 885,358 | 885,359 | u302000346 | cpp |
p03074 | /*input
1 1
1
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma GCC opt... | /*input
1 1
1
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma GCC opt... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,360 | 885,361 | u110464018 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (in... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 885,367 | 885,368 | u129220625 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (in... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (in... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 885,369 | 885,368 | u129220625 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vect... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vect... | [
"control_flow.branch.else.add"
] | 885,372 | 885,373 | u846820729 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
int L = S.length();
S.push_back('2');
vector<int> A;
int tmp = 1;
for (int i = 1; i <= L; i++) {
if (S[i] == S[i - 1]) {
tmp++;
} else {
if (S[i - 1] == '1') {
A.push_back(tm... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
int L = S.length();
S.push_back('2');
vector<int> A;
int tmp = 1;
for (int i = 1; i <= L; i++) {
if (S[i] == S[i - 1]) {
tmp++;
} else {
if (S[i - 1] == '1') {
A.push_back(tm... | [
"call.arguments.add"
] | 885,376 | 885,377 | u285358283 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<char> s(n);
rep(i, n) cin >> s[i];
vector<int> a;
s.push_back('2');
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<char> s(n);
rep(i, n) cin >> s[i];
vector<int> a;
s.push_back('2');
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 885,380 | 885,381 | u862412671 | cpp |
p03074 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::s... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::s... | [
"assignment.change"
] | 885,389 | 885,390 | u264265458 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
char c = s[0];
vector<int> a;
a.push_back(0);
for (int i = 1; i < n; i++) {
if (s[i] != c) {
a.push_back(i);
c = s[i];
}
}
a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
char c = s[0];
vector<int> a;
a.push_back(0);
for (int i = 1; i < n; i++) {
if (s[i] != c) {
a.push_back(i);
c = s[i];
}
}
a... | [
"expression.operation.binary.change"
] | 885,394 | 885,395 | u970690920 | 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); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int N, K;
string S;
int main() {
cin >> N >> K;
cin >> S;
vector<int> retu;... | #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); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int N, K;
string S;
int main() {
cin >> N >> K;
cin >> S;
vector<int> retu;... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 885,404 | 885,405 | u174434198 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 885,408 | 885,409 | u366644013 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | [
"control_flow.loop.condition.change",
"call.add"
] | 885,410 | 885,411 | u366644013 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> zo;
rep(i, n) {
char c = s[i];
int cnt = 0;
while (c == s[i])... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> zo;
rep(i, n) {
char c = s[i];
int cnt = 0;
while (c == s[i])... | [
"literal.number.change",
"expression.operation.binary.change"
] | 885,422 | 885,423 | u089885969 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, sum = 0;
int ans = 0;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int count = 1;
if (s[0] == '0')
a.push_back(0);
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1])
count++;
else {
a.push_back(coun... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, sum = 0;
int ans = 0;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int count = 1;
if (s[0] == '0')
a.push_back(0);
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1])
count++;
else {
a.push_back(coun... | [
"control_flow.loop.for.condition.change"
] | 885,436 | 885,437 | u351265848 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> res;
int tmp = 1;
for (int i = 0; i < N - 1; i++) {
if (s[i] == s[i + 1]) {
tmp++;
continue;
}
res.push_back(tmp);
tmp = 1;
}
res.push_back(tmp);
int ans =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> res;
int tmp = 1;
for (int i = 0; i < N - 1; i++) {
if (s[i] == s[i + 1]) {
tmp++;
continue;
}
res.push_back(tmp);
tmp = 1;
}
res.push_back(tmp);
int ans =... | [] | 885,440 | 885,441 | u660341491 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> num;
if (s[0] == '0')
num.push_back(0);
for (int left = 0; left < N;) {
int right = left;
while (right < N && s[right] == s[left]) {
right++;
}
num.push_back(righ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> num;
if (s[0] == '0')
num.push_back(0);
for (int left = 0; left < N;) {
int right = left;
while (right < N && s[right] == s[left]) {
right++;
}
num.push_back(righ... | [
"call.arguments.change",
"expression.operation.binary.change",
"call.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 885,444 | 885,443 | u660341491 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
int main() {
int n, k;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
int main() {
int n, k;
... | [
"variable_declaration.remove"
] | 885,448 | 885,449 | u963903527 | cpp |
p03074 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | [
"control_flow.loop.for.condition.change"
] | 885,450 | 885,451 | u020746846 | cpp |
p03074 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define rep(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define rep(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 885,456 | 885,457 | u850516963 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Rs(1);
if (S[0] == '1')
Rs[0] = 0;
else
Rs.push_back(0);
int before ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Rs(1);
if (S[0] == '1')
Rs[0] = 0;
else
Rs.push_back(0);
int before ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 885,470 | 885,471 | u945359338 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
int gcd(int a, int b) {
if (!b) {
return a;
}
retur... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
int gcd(int a, int b) {
if (!b) {
return a;
}
retur... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,472 | 885,473 | u083910207 | cpp |
p03074 | #include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<int> pos;
pos.push_back(0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
int ans = 0;
for ... | #include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<int> pos;
pos.push_back(0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
int ans = 0;
for (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,474 | 885,475 | u083910207 | cpp |
p03074 | #include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<int> pos;
pos.push_back(0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
int ans = 0;
for ... | #include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<int> pos;
pos.push_back(0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
int ans = 0;
for ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,474 | 885,476 | u083910207 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, b, e) for (int i = (b); i < (e); ++i)
#define RREP(i, b, e) for (int i = (b)-1; i >= e; --i)
#define rep(i, e) for (int i = 0; i < (e); ++i)
inline void print(void) { cout << '\n'; }
template <class T> inline void print(const T &x) { cout << x << '\n'; }
tem... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, b, e) for (int i = (b); i < (e); ++i)
#define RREP(i, b, e) for (int i = (b)-1; i >= e; --i)
#define rep(i, e) for (int i = 0; i < (e); ++i)
inline void print(void) { cout << '\n'; }
template <class T> inline void print(const T &x) { cout << x << '\n'; }
tem... | [
"expression.operation.binary.add"
] | 885,477 | 885,478 | u403301154 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> cnt;
cnt.push_back(0);
char prev = '1';
for (int i = 0; i < n; ++i) {
if (s[i] == prev)
++cnt.back();
else {
prev = s[i];
cnt.push_back(1);
}
}
if (prev... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> cnt;
cnt.push_back(0);
char prev = '1';
for (int i = 0; i < n; ++i) {
if (s[i] == prev)
++cnt.back();
else {
prev = s[i];
cnt.push_back(1);
}
}
if (prev... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 885,481 | 885,482 | u726604439 | cpp |
p03074 | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
... | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
... | [
"assignment.value.change",
"assignment.change",
"variable_declaration.name.change",
"identifier.change"
] | 885,487 | 885,488 | u247576416 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for... | [
"assignment.change"
] | 885,489 | 885,490 | u950174376 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) for (int i = m; i < n... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) for (int i = m; i < n... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 885,498 | 885,499 | u008582165 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
ll n, k, ans = 0;
string s;
void Main() {
cin >> n >> k >> s;
vector<ll> bound;
bound.push_back(0);
For(i, 1, n) {
if (s.at(i - 1) != s.at(i)) {
bound.push_back(i);
}
}
ll l ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
ll n, k, ans = 0;
string s;
void Main() {
cin >> n >> k >> s;
vector<ll> bound;
bound.push_back(0);
For(i, 1, n) {
if (s.at(i - 1) != s.at(i)) {
bound.push_back(i);
}
}
ll l ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 885,502 | 885,501 | u813174766 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, k, i, bi, hs = 0, max;
string s;
vector<int> w;
cin >> n >> k >> s;
if (s[0] == '0')
w.push_back(0);
i = 0;
while (i < n) {
bi = i;
while (i < n && s[i + 1] == s[i])
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, k, i, bi, hs = 0, max;
string s;
vector<int> w;
cin >> n >> k >> s;
if (s[0] == '0')
w.push_back(0);
i = 0;
while (i < n) {
bi = i;
while (i < n && s[i + 1] == s[i])
... | [
"expression.operation.binary.remove"
] | 885,506 | 885,507 | u088895504 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef ve... | [] | 885,508 | 885,509 | u263715385 | cpp |
p03074 | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef long double LD;
int main() {
LL N, K;
cin >> N >> K;
string S;
cin >> S;
LL range_max = 0;
//! 1の左側を起点とすればOKだが、S[0]が0ときだけ異なる
if (S[0] == '0') {
LL C = 1;
LL i = 0;
LL j;
for (j = i; j < S.length(); ++j) {
... | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef long double LD;
int main() {
LL N, K;
cin >> N >> K;
string S;
cin >> S;
LL range_max = 0;
//! 1の左側を起点とすればOKだが、S[0]が0ときだけ異なる
if (S[0] == '0') {
LL C = 1;
LL i = 0;
LL j;
for (j = i; j < S.length(); ++j) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 885,518 | 885,519 | u412164358 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> cnt(100010, 0);
cnt[0] = 1;
int cur = 0;
for (int i = 1; i < N; i++) {
if (S[i] == S[i - 1]) {
cnt[cur]++;
} else {
cur++;
cnt[cur]++;
}
}
vector<int> sum(10001... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> cnt(100010, 0);
cnt[0] = 1;
int cur = 0;
for (int i = 1; i < N; i++) {
if (S[i] == S[i - 1]) {
cnt[cur]++;
} else {
cur++;
cnt[cur]++;
}
}
vector<int> sum(10001... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 885,520 | 885,521 | u275786410 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a;
int prev = s[0];
a.push_back(0);
for (int i = 1; i < n; ++i) {
if (prev != s[i])
a.push_back(i);
prev = s[i];
}
a.push_back(n);
int ans = 0;
for (int i = 0; i < a.si... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a;
int prev = s[0];
a.push_back(0);
for (int i = 1; i < n; ++i) {
if (prev != s[i])
a.push_back(i);
prev = s[i];
}
a.push_back(n);
int ans = 0;
for (int i = 0; i < a.si... | [
"call.arguments.change"
] | 885,522 | 885,523 | u023195454 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
v... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
v... | [
"control_flow.loop.for.update.change"
] | 885,526 | 885,527 | u048791623 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
cons... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
cons... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 885,528 | 885,529 | u427344224 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
cons... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
cons... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 885,530 | 885,529 | u427344224 | cpp |
p03074 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, k;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k >> s;
vi v;
s += 'x';
int ... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, k;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k >> s;
vi v;
s += 'x';
int ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 885,549 | 885,550 | u562319622 | cpp |
p03074 | #include <algorithm>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#ifdef LDEBUG
#define debug(x) cout << ... | #include <algorithm>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#ifdef LDEBUG
#define debug(x) cout << ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,556 | 885,557 | u742504115 | cpp |
p03074 | #include <bits/stdc++.h>
#define L long long
#define ff first
#define ss second
using namespace std;
const int N = 100005;
int a[N], b[N], sum[N];
int n, K, idx = 0, onz, zero;
int main() {
cin >> n >> K;
string x;
cin >> x;
for (int i = 0; i < n; i++) {
if (x[i] == '0') {
if (onz)
idx++, b[i... | #include <bits/stdc++.h>
#define L long long
#define ff first
#define ss second
using namespace std;
const int N = 100005;
int a[N], b[N], sum[N];
int n, K, idx = 0, onz, zero;
int main() {
cin >> n >> K;
string x;
cin >> x;
for (int i = 0; i < n; i++) {
if (x[i] == '0') {
if (onz)
idx++, b[i... | [
"expression.operation.binary.remove"
] | 885,560 | 885,561 | u521171255 | 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> count;
if (S[0] == '0')
count.push_back(0);
for (int i = 0; i < N; i++) {
int j = i;
while (j < N && S[j] == S[i])
++j;
count.push_bac... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> count;
if (S[0] == '0')
count.push_back(0);
for (int i = 0; i < N; i++) {
int j = i;
while (j < N && S[j] == S[i])
++j;
count.push_bac... | [
"assignment.change"
] | 885,564 | 885,565 | u940000534 | cpp |
p03074 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] ... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 885,566 | 885,567 | u409569205 | cpp |
p03074 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] ... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] ... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change"
] | 885,568 | 885,567 | u409569205 | cpp |
p03074 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] ... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change"
] | 885,569 | 885,567 | u409569205 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<int, int>> zerSegs;
int st;
for (int i = 0; i < n; ++i) {
if (str[i] == '1' && i != 0 && str[i - 1] == '0') {
zerSegs.push_back({st, i - 1});
} else if (str[i] == '0' &... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<int, int>> zerSegs;
int st;
for (int i = 0; i < n; ++i) {
if (str[i] == '1' && i != 0 && str[i - 1] == '0') {
zerSegs.push_back({st, i - 1});
} else if (str[i] == '0' &... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,574 | 885,575 | u210162517 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<int, int>> zerSegs;
int st;
for (int i = 0; i < n; ++i) {
if (str[i] == '1' && i != 0 && str[i - 1] == '0') {
zerSegs.push_back({st, i - 1});
} else if (str[i] == '0' &... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<int, int>> zerSegs;
int st;
for (int i = 0; i < n; ++i) {
if (str[i] == '1' && i != 0 && str[i - 1] == '0') {
zerSegs.push_back({st, i - 1});
} else if (str[i] == '0' &... | [] | 885,576 | 885,575 | u210162517 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0;
int N;
cin >> N;
int K;
cin >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (c... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0;
int N;
cin >> N;
int K;
cin >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (c... | [] | 885,581 | 885,582 | u791220701 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
char beg = S[0], en = S[N - 1];
vi C0, C1;
int l = 0;
for (int i = 0; i <= N; ++i) {
if (i == 0)
l++;
else if (i == N) {
if (S[i - 1] == '0')
... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
char beg = S[0], en = S[N - 1];
vi C0, C1;
int l = 0;
for (int i = 0; i <= N; ++i) {
if (i == 0)
l++;
else if (i == N) {
if (S[i - 1] == '0')
... | [
"control_flow.branch.else.add"
] | 885,587 | 885,588 | u826487371 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
char beg = S[0], en = S[N - 1];
vi C0, C1;
int l = 0;
for (int i = 0; i <= N; ++i) {
if (i == 0)
l++;
else if (i == N) {
if (S[i - 1] == '0')
... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
char beg = S[0], en = S[N - 1];
vi C0, C1;
int l = 0;
for (int i = 0; i <= N; ++i) {
if (i == 0)
l++;
else if (i == N) {
if (S[i - 1] == '0')
... | [
"control_flow.branch.else.add",
"assignment.change"
] | 885,589 | 885,588 | u826487371 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vi zero_endpts;
vi one_endpts;
for (int i = 0; i < N; ++i) {
if (i == N - 1) {
if (S[i] == '0') {
zero_endpts.push_back(i + 1);
} else {
one_en... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vi zero_endpts;
vi one_endpts;
for (int i = 0; i < N; ++i) {
if (i == N - 1) {
if (S[i] == '0') {
zero_endpts.push_back(i + 1);
} else {
one_en... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 885,590 | 885,591 | u826487371 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> last;
last.push_back(0);
int i = 0;
while (i < N - 1) {
if (S[i] != S[i + 1]) {
last.push_back(... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> last;
last.push_back(0);
int i = 0;
while (i < N - 1) {
if (S[i] != S[i + 1]) {
last.push_back(... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,592 | 885,593 | u797165415 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.siz... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.siz... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 885,594 | 885,595 | u303059352 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.siz... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.siz... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,596 | 885,595 | u303059352 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >>... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >>... | [] | 885,601 | 885,602 | u806800460 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int>
switch_index; // S[i-1]とS[i]とで値が切り替わる場合、switch_indexにiを追加する
// 1回の指示 → ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int>
switch_index; // S[i-1]とS[i]とで値が切り替わる場合、switch_indexにiを追加する
// 1回の指示 → ... | [
"assignment.change"
] | 885,611 | 885,612 | u867671099 | cpp |
p03074 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#defin... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#defin... | [
"literal.number.change",
"control_flow.loop.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,638 | 885,639 | u838742270 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.