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 |
|---|---|---|---|---|---|---|---|
p03080 | #include <stdio.h>
int main() {
char s[101], tmp;
int N, r = 0, b = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%c", &tmp);
if (tmp == 'R')
r++;
if (tmp == 'B')
b++;
}
if (r > b)
printf("Yes\n");
else
printf("No\n");
} | #include <stdio.h>
int main() {
char s[101], tmp;
int N, r = 0, b = 0;
scanf("%d\n", &N);
for (int i = 0; i < N; i++) {
scanf("%c", &tmp);
if (tmp == 'R')
r++;
if (tmp == 'B')
b++;
}
if (r > b)
printf("Yes\n");
else
printf("No\n");
} | [
"literal.string.change",
"call.arguments.change"
] | 896,262 | 896,263 | u686303803 | cpp |
p03080 | #include <stdio.h>
int main() {
char s[101], tmp;
int N, r = 0, b = 0;
scanf("%d", &N);
for (int i; i < N; i++) {
scanf("%c", &tmp);
if (tmp == 'R')
r++;
if (tmp == 'B')
b++;
}
if (r > b)
printf("Yes\n");
else
printf("No\n");
} | #include <stdio.h>
int main() {
char s[101], tmp;
int N, r = 0, b = 0;
scanf("%d\n", &N);
for (int i = 0; i < N; i++) {
scanf("%c", &tmp);
if (tmp == 'R')
r++;
if (tmp == 'B')
b++;
}
if (r > b)
printf("Yes\n");
else
printf("No\n");
} | [
"literal.string.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 896,264 | 896,263 | u686303803 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int R, B, n;
R = 0;
B = 0;
cin >> n >> S;
for (int i = 0; i < n; i++) {
if (S[i] == R)
R++;
else
B++;
}
if (R > B)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int R, B, n;
R = 0;
B = 0;
cin >> n >> S;
for (int i = 0; i < n; i++) {
if (S[i] == 'R')
R++;
else
B++;
}
if (R > B)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 896,274 | 896,275 | u057079894 | cpp |
p03080 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int Rcnt, Bcnt = 0;
for (int i = 0; i < N; i++) {
if (s[i] == 'R') {
Rcnt++;
} else {
Bcnt++;
}
}
if (Rcnt > Bcn... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int Rcnt = 0;
int Bcnt = 0;
for (int i = 0; i < N; i++) {
if (s[i] == 'R') {
Rcnt++;
} else {
Bcnt++;
}
}
if (... | [
"variable_declaration.add"
] | 896,280 | 896,281 | u654115954 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int r;
int flag = 0;
r = 0;
string s;
cin >> N >> s;
int i = 0;
while (i < N) {
if (s[i] == 'R')
r++;
i++;
if (r > (N / 2)) {
flag = 1;
}
}
if (flag == 1)
cout << "YES" << endl;
else
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int r;
int flag = 0;
r = 0;
string s;
cin >> N >> s;
int i = 0;
while (i < N) {
if (s[i] == 'R')
r++;
i++;
if (r > (N / 2)) {
flag = 1;
}
}
if (flag == 1)
cout << "Yes" << endl;
else
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,284 | 896,285 | u821732221 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> s(n);
for (int i = 0; i < n; i++)
cin >> s.at(i);
int red, blue;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'R')
red++;
else if (s.at(i) == 'B')
blue++;
}
if (red > blue)
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> s(n);
for (int i = 0; i < n; i++)
cin >> s.at(i);
int red = 0;
int blue = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'R')
red++;
else if (s.at(i) == 'B')
blue++;
}
if (red > blue)... | [
"variable_declaration.add"
] | 896,299 | 896,300 | u775776331 | cpp |
p03080 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [] | 896,301 | 896,302 | u135572611 | cpp |
p03080 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string y = "Yes";
string n = "No";
int ct = 0;
for (auto ch : s) {
if (ch == 'R')
ct++;
}
string ret = n;
if ... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s >> s;
string y = "Yes";
string n = "No";
int ct = 0;
for (auto ch : s) {
if (ch == 'R')
ct++;
}
string ret = n;... | [
"expression.operation.binary.add"
] | 896,303 | 896,304 | u299843956 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, b, i, n;
char c;
scanf("%d", &n);
getchar();
for (i = 0; i < n; i++) {
c = getchar();
if (c == 'R')
r++;
else
b++;
}
if (r > b)
printf("Yes");
else
printf("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r = 0, b = 0, i, n;
char c;
scanf("%d", &n);
getchar();
for (i = 0; i < n; i++) {
c = getchar();
if (c == 'R')
r++;
else
b++;
}
if (r > b)
printf("Yes");
else
printf("No");
return 0;
} | [
"variable_declaration.value.change"
] | 896,307 | 896,308 | u379393519 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int R = 0;
int B = 0;
for (int i = 0; i < N; i++) {
if (S[i] = 'R') {
R++;
} else {
B++;
}
}
if (R > B) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int R = 0;
int B = 0;
for (int i = 0; i < N; i++) {
if (S[i] - 'R' == 0) {
R++;
} else {
B++;
}
}
if (R > B) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 896,309 | 896,310 | u590088474 | cpp |
p03078 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define FOR(i, j, limit) for (int i = j; i < limit; ++i)
#define DUMP(a) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define FOR(i, j, limit) for (int i = j; i < limit; ++i)
#define DUMP(a) ... | [
"call.remove"
] | 896,349 | 896,350 | u111742294 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define l... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define l... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 896,357 | 896,358 | u235155157 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i, n) for (int i = 0; i < n; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i, n) for (int i = 0; i < n; i... | [] | 896,359 | 896,360 | u511344501 | cpp |
p03078 | #include <bits/stdc++.h>
#define int long long
using namespace std;
priority_queue<pair<int, pair<int, int>>> q, q1;
const int maxn = 1e3 + 10;
int x, y, z, k, a[maxn], b[maxn], c[maxn], d[maxn * 3], ans[maxn * 3];
inline bool cmp(int x, int y) { return x > y; }
signed main() {
scanf("%lld%lld%lld%lld", &x, &y, &z, &... | #include <bits/stdc++.h>
#define int long long
using namespace std;
priority_queue<pair<int, pair<int, int>>> q, q1;
const int maxn = 1e3 + 10;
int x, y, z, k, a[maxn], b[maxn], c[maxn], d[maxn * 3], ans[maxn * 3];
inline bool cmp(int x, int y) { return x > y; }
signed main() {
scanf("%lld%lld%lld%lld", &x, &y, &z, &... | [
"identifier.change"
] | 896,391 | 896,392 | u276479653 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int x, y, z, k, a[1000], b[1000], c[1000];
vector<long long> d;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x, grea... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long x, y, z, k, a[1000], b[1000], c[1000];
vector<long long> d;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 896,413 | 896,414 | u974214237 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
#define INF 1e18
typedef long long ll;
typedef pair<ll, ll> P;
typedef struct {
int first;
int second;
int third;
} T;
//昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
class cake {
public:
ll sum;
int x, y, ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
#define INF 1e18
typedef long long ll;
typedef pair<ll, ll> P;
typedef struct {
int first;
int second;
int third;
} T;
//昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
class cake {
public:
ll sum;
int x, y, ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 896,415 | 896,416 | u069450081 | cpp |
p03078 | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queu... | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queu... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 896,434 | 896,435 | u692176965 | cpp |
p03081 | #include <bits/stdc++.h>
const int INF = 1e9, MOD = 1e9 + 7;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
std::vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int now... | #include <bits/stdc++.h>
const int INF = 1e9, MOD = 1e9 + 7;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
std::vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int now... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 896,449 | 896,450 | u942774736 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0;... | [
"identifier.change"
] | 896,456 | 896,457 | u721367699 | cpp |
p03081 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, q;
string str;
int main() {
cin >> n >> q;
cin >> str;
vector<pair<char, char>> arr(q);
for (int i = 0; i < q; i++) {
cin >> arr[i].first >> arr[i].second;
}
reverse(arr.begin(), arr.end());
int... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, q;
string str;
int main() {
cin >> n >> q;
cin >> str;
vector<pair<char, char>> arr(q);
for (int i = 0; i < q; i++) {
cin >> arr[i].first >> arr[i].second;
}
reverse(arr.begin(), arr.end());
int... | [
"expression.operation.binary.remove",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 896,458 | 896,459 | u508729896 | cpp |
p03081 | // Ryo Kamoi
//#define DEBUG
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
int INF = 100000... | // Ryo Kamoi
//#define DEBUG
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
int INF = 100000... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 896,466 | 896,467 | u632114133 | cpp |
p03081 | #include <bitset>
#include <iostream>
#include <queue>
using namespace std; // 575
const int MAX = 200002;
int main() {
int N, Q;
static char t[MAX], d[MAX];
string s;
cin >> N >> Q >> s;
for (int i = 0; i < Q; ++i)
cin >> t[i] >> d[i];
int l = -1, r = N;
for (int i = Q - 1; i >= 0; --i) {
if (s... | #include <bitset>
#include <iostream>
#include <queue>
using namespace std; // 575
const int MAX = 200002;
int main() {
int N, Q;
static char t[MAX], d[MAX];
string s;
cin >> N >> Q >> s;
for (int i = 0; i < Q; ++i)
cin >> t[i] >> d[i];
int l = -1, r = N;
for (int i = Q - 1; i >= 0; --i) {
if (s... | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 896,480 | 896,481 | u550314572 | cpp |
p03081 | #include <bits/stdc++.h>
std::vector<char> t, d;
std::string s;
int N, Q;
int end(int);
int main() {
scanf("%d%d", &N, &Q);
std::cin >> s;
t.resize(Q);
d.resize(Q);
for (int i{}; i < Q; i++)
scanf(" %c %c", &t[i], &d[i]);
int left{}, right{N};
while (left + 1 < right) {
int mid{(left + right)... | #include <bits/stdc++.h>
std::vector<char> t, d;
std::string s;
int N, Q;
int end(int);
int main() {
scanf("%d%d", &N, &Q);
std::cin >> s;
t.resize(Q);
d.resize(Q);
for (int i{}; i < Q; i++)
scanf(" %c %c", &t[i], &d[i]);
int left{-1}, right{N};
while (left + 1 < right) {
int mid{(left + righ... | [] | 896,492 | 896,493 | u086849314 | cpp |
p03081 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 896,496 | 896,497 | u652683896 | cpp |
p03081 | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
#define ALL(c) ((c).begin()), ((c).end())
#de... | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
#define ALL(c) ((c).begin()), ((c).end())
#de... | [
"expression.operation.binary.remove"
] | 896,515 | 896,516 | u141642872 | cpp |
p03081 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, Q;
string s;
cin >> N >> Q >> s;
vector<char> t(Q), d(Q);
for (ll i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
//[left, right]にあるものは生き残る
ll left = 0, right = N - 1;
for (ll i = Q - 1; i >= 0; i--) {
if (d[i]... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, Q;
string s;
cin >> N >> Q >> s;
vector<char> t(Q), d(Q);
for (ll i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
//[left, right]にあるものは生き残る
ll left = 0, right = N - 1;
for (ll i = Q - 1; i >= 0; i--) {
if (d[i]... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 896,521 | 896,522 | u456065785 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
const int NS = (int)2e5 + 4;
int N, Q;
char arr[NS], mov[NS][4];
int main() {
scanf("%d %d", &N, &Q);
scanf("%s", arr + 1);
for (int i = 1; i <= Q; ++i)
scanf(" %c %c", &mov[i][1], &mov[i][2]);
int ans = N;
int l = 1, r = N, mid;
while (l < r) {
mid =... | #include <bits/stdc++.h>
using namespace std;
const int NS = (int)2e5 + 4;
int N, Q;
char arr[NS], mov[NS][4];
int main() {
scanf("%d %d", &N, &Q);
scanf("%s", arr + 1);
for (int i = 1; i <= Q; ++i)
scanf(" %c %c", &mov[i][1], &mov[i][2]);
int ans = N;
int l = 1, r = N, mid;
while (l < r) {
mid =... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 896,529 | 896,530 | u565057006 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define repm(i, a, b) for (int i = (int)(a); i > (int)(b); --i)
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
S = "*" + S + "*";
int x = 0, y = N + 1;
int l = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define repm(i, a, b) for (int i = (int)(a); i > (int)(b); --i)
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
S = "*" + S + "*";
int x = 0, y = N + 1;
int l = ... | [
"identifier.change",
"io.output.change"
] | 896,537 | 896,538 | u007446928 | cpp |
p03081 | /*
* If you gave me a chance
* I'll take it
* It's a shot in the dark
* But I will make it:D
*/
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ex... | /*
* If you gave me a chance
* I'll take it
* It's a shot in the dark
* But I will make it:D
*/
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ex... | [
"identifier.change",
"expression.operation.binary.change"
] | 896,543 | 896,544 | u317879811 | cpp |
p03081 | #include <cstdio>
using namespace std;
char s[200001];
char t[200000];
int d[200000];
int main() {
int n, q, l1, r1, m1, l2, r2, m2, i;
scanf("%d %d", &n, &q);
scanf("%s", s);
for (i = 0; i < q; i++) {
char c1[2];
char c2[2];
scanf("%s %s", c1, c2);
t[i] = c1[0];
if (c2[0] == 'L') {
... | #include <cstdio>
using namespace std;
char s[200001];
char t[200000];
int d[200000];
int main() {
int n, q, l1, r1, m1, l2, r2, m2, i;
scanf("%d %d", &n, &q);
scanf("%s", s);
for (i = 0; i < q; i++) {
char c1[2];
char c2[2];
scanf("%s %s", c1, c2);
t[i] = c1[0];
if (c2[0] == 'L') {
... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 896,545 | 896,546 | u387061829 | cpp |
p03081 | #include <iostream>
#include <string>
#include <vector>
// binary search to get the left and right boundary
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q);
vector<char> d(Q);
for (int i = 0; i < Q; i += 1) {
cin >> t[i] >> d[i];
}
int L = -1;
i... | #include <iostream>
#include <string>
#include <vector>
// binary search to get the left and right boundary separately
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q);
vector<char> d(Q);
for (int i = 0; i < Q; i += 1) {
cin >> t[i] >> d[i];
}
int ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 896,549 | 896,550 | u436484848 | cpp |
p03081 | #include <iostream>
#include <string>
#include <vector>
// binary search to get the left and right boundary
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q);
vector<char> d(Q);
for (int i = 0; i < Q; i += 1) {
cin >> t[i] >> d[i];
}
int L = -1;
i... | #include <iostream>
#include <string>
#include <vector>
// binary search to get the left and right boundary
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q);
vector<char> d(Q);
for (int i = 0; i < Q; i += 1) {
cin >> t[i] >> d[i];
}
int L = -1;
i... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 896,549 | 896,551 | u436484848 | cpp |
p03081 | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change"
] | 896,567 | 896,568 | u119460590 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
enum Result { Left, Right, None };
struct Magic {
char t, d;
};
Result move(string s, vector<Magic> magics, int index) {
for (auto m : magics) {
if (s[index] == m.t) {
if (m.d == 'L')
index--;
if (index == -1)
return Left;
else
... | #include <bits/stdc++.h>
using namespace std;
enum Result { Left, Right, None };
struct Magic {
char t, d;
};
Result move(string s, vector<Magic> magics, int index) {
for (auto m : magics) {
if (s[index] == m.t) {
if (m.d == 'L') {
index--;
if (index == -1)
return Left;
... | [] | 896,573 | 896,574 | u280512618 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#e... | [
"assignment.value.change",
"identifier.change"
] | 896,584 | 896,585 | u633020228 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | [
"expression.operation.binary.remove"
] | 896,586 | 896,587 | u874644572 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
int N, Q;
string S;
char T[200010];
char D[200010];
bool ok[200010];
bool check_right(int pos) {
for (int i = 0; i < Q; i++) {
if (T[i] == S[... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
int N, Q;
string S;
char T[200010];
char D[200010];
bool ok[200010];
bool check_right(int pos) {
for (int i = 0; i < Q; i++) {
if (T[i] == S[... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change"
] | 896,588 | 896,589 | u489053642 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define nummax 220000
int drop(int n, int N, int Q, string s, char t[], char d[]) {
int i, posi = n;
for (i = 1; i <= Q; i++) {
if (s[posi - 1] == t[i]... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define nummax 220000
int drop(int n, int N, int Q, string s, char t[], char d[]) {
int i, posi = n;
for (i = 1; i <= Q; i++) {
if (s[posi - 1] == t[i]... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 896,613 | 896,614 | u541884637 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n';
typedef int64_t Int;
Int mod = 1e9 + 7;
Int INF = 1e9 + 18;
Int n, q;
string s;
char t[200001], l[200001];
bool f(Int cur, Int d) {
for (Int i = 0; i < q; i++) {
if (s[cur] == t[i]) {
if (l[i] == 'L') {
cur--;
... | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n';
typedef int64_t Int;
Int mod = 1e9 + 7;
Int INF = 1e9 + 18;
Int n, q;
string s;
char t[200001], l[200001];
bool f(Int cur, Int d) {
for (Int i = 0; i < q; i++) {
if (s[cur] == t[i]) {
if (l[i] == 'L') {
cur--;
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 896,639 | 896,640 | u572665222 | cpp |
p03081 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long lo... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long lo... | [] | 896,643 | 896,644 | u222293734 | cpp |
p03081 | #include <fstream>
#include <iostream>
#include <string>
using namespace std;
int N, M, solst, soldr;
string s;
struct spell {
char c, d;
} a[200005];
bool Check(int poz, bool dir) {
int i;
for (i = 1; i <= M; i++) {
if (a[i].c == s[poz]) {
if (a[i].d == 'R')
poz++;
else
poz--;
... | #include <fstream>
#include <iostream>
#include <string>
using namespace std;
int N, M, solst, soldr;
string s;
struct spell {
char c, d;
} a[200005];
bool Check(int poz, bool dir) {
int i;
for (i = 1; i <= M; i++) {
if (a[i].c == s[poz]) {
if (a[i].d == 'R')
poz++;
else
poz--;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 896,651 | 896,652 | u432635701 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 896,655 | 896,656 | u106297876 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 896,663 | 896,664 | u340010271 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#def... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#def... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 896,689 | 896,690 | u342051078 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | [
"expression.operation.unary.arithmetic.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 896,691 | 896,692 | u342051078 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | [
"identifier.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 896,693 | 896,694 | u342051078 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, q;
cin >> n >> q;
string s;
cin >> s;... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, q;
cin >> n >> q;
string s;
cin >> s;... | [
"literal.number.change",
"variable_declaration.value.change"
] | 896,706 | 896,707 | u769062455 | cpp |
p03081 | #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; ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 896,710 | 896,711 | u228214259 | cpp |
p03081 | #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; ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 896,712 | 896,711 | u228214259 | cpp |
p03081 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#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 (in... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#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 (in... | [
"expression.operation.binary.remove"
] | 896,719 | 896,720 | u504142483 | cpp |
p03081 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, Q, ansL, ansR, L, R;
string S;
static pair<char, char> A[200000];
cin >> N >> Q >> S;
for (int i = 0; i < Q; i++) {
cin >> A[i].first >> A[i].second;
}
L = 0, R = N;
while (R - L > 1) {
int mid = (L + R) / 2, G = mid;
bool ch... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, Q, ansL, ansR, L, R;
string S;
static pair<char, char> A[200000];
cin >> N >> Q >> S;
for (int i = 0; i < Q; i++) {
cin >> A[i].first >> A[i].second;
}
L = 0, R = N;
while (R - L > 0) {
int mid = (L + R) / 2, G = mid;
bool ch... | [
"literal.number.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 896,725 | 896,726 | u454087021 | cpp |
p03081 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"call.arguments.change",
"call.remove"
] | 896,738 | 896,739 | u791593901 | cpp |
p03081 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"call.arguments.change",
"call.remove",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 896,740 | 896,739 | u791593901 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#de... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#de... | [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 896,749 | 896,750 | u233393801 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#de... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#de... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 896,751 | 896,750 | u233393801 | cpp |
p03081 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | [
"expression.operation.binary.remove"
] | 896,754 | 896,755 | u566864240 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
long long n, q, l, r;
string s;
char t[1000000], d[1000000];
int main() {
cin >> n >> q >> s;
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
l = -1;
r = n;
for (int i = q - 1; i >= 0; i--) {
if (d[i] == 'L') {
if (l + 1 < n && s[l + 1]... | #include <bits/stdc++.h>
using namespace std;
long long n, q, l, r;
string s;
char t[1000000], d[1000000];
int main() {
cin >> n >> q >> s;
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
l = -1;
r = n;
for (int i = q - 1; i >= 0; i--) {
if (d[i] == 'L') {
if (l + 1 < n && s[l + 1]... | [
"identifier.change"
] | 896,760 | 896,761 | u036145426 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 896,768 | 896,769 | u569778242 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 896,770 | 896,769 | u569778242 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vll A, B, C;
for (int i = 0; i < X; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < Y; ++i) {
ll b;
cin >> b;
B.push_back(b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vll A, B, C;
for (int i = 0; i < X; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < Y; ++i) {
ll b;
cin >> b;
B.push_back(b)... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 896,771 | 896,772 | u826487371 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> X >> K;
vll A(X), B(Y), C(Z);
for (int i = 0; i < X; ++i) {
ll a;
cin >> a;
A[i] = a;
}
for (int i = 0; i < Y; ++i) {
ll b;
cin >> b;
B[i] = b;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vll A(X), B(Y), C(Z);
for (int i = 0; i < X; ++i) {
ll a;
cin >> a;
A[i] = a;
}
for (int i = 0; i < Y; ++i) {
ll b;
cin >> b;
B[i] = b;
... | [
"identifier.change",
"expression.operation.binary.change"
] | 896,773 | 896,774 | u826487371 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll long long
#define mod 1000000007
#define NCONS 1000000000
/... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll long long
#define mod 1000000007
#define NCONS 1000000000
/... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 896,775 | 896,776 | u285118720 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#inclu... | [
"expression.operation.binary.add"
] | 896,798 | 896,799 | u966854856 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#inclu... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 896,800 | 896,799 | u966854856 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A.at(i);
}
for (int i = 0; i < Y; i++) {
cin >> B.at(i);
}
for (int i = 0; i < Z; i++) {
cin >> C.at(i);
}
vector<lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A.at(i);
}
for (int i = 0; i < Y; i++) {
cin >> B.at(i);
}
for (int i = 0; i < Z; i++) {
cin >> C.at(i);
}
vector<lon... | [
"variable_declaration.type.primitive.change"
] | 896,801 | 896,802 | u824310141 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> a, b, c, comb;
for (int i = 0; i < x; i++) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < y; i++) {
int... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> a, b, c, comb;
for (int i = 0; i < x; i++) {
long long tmp;
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < y; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 896,806 | 896,807 | u898965510 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int> cakesA(X);
vector<int> cakesB(Y);
vector<int> cakesC(Z);
for (int i = 0; i < X; i++)
cin >> cakesA[i];
for (int i = 0; i < Y; i++)
cin >> cakesB[i]... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> cakesA(X);
vector<long long> cakesB(Y);
vector<long long> cakesC(Z);
for (int i = 0; i < X; i++)
cin >> cakesA[i];
for (int i = 0; i < Y; i++)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 896,810 | 896,811 | u652286295 | cpp |
p03078 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < Y; i++) {
... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < Y; i++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 896,812 | 896,813 | u650243369 | cpp |
p03078 | #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kL... | #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kL... | [
"expression.operation.binary.remove"
] | 896,816 | 896,817 | u925478083 | cpp |
p03078 | #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kL... | #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kL... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 896,820 | 896,819 | u925478083 | cpp |
p03078 | #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kL... | #include <algorithm> // for sort
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int x, y, z, kLen;
int i, j, k;
vector<long long int> a, b, c;
vector<long long int> total;
cin >> x >> y >> z >> kL... | [
"control_flow.branch.if.condition.change"
] | 896,825 | 896,819 | u925478083 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[1001], b[1001], c[1001];
int x, y, z, k;
priority_queue<LL> q;
int main() {
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[1001], b[1001], c[1001];
int x, y, z, k;
priority_queue<LL> q;
int main() {
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
s... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 896,828 | 896,829 | u339483858 | cpp |
p03078 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove"
] | 896,836 | 896,837 | u574045761 | cpp |
p03078 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 896,838 | 896,839 | u791593901 | cpp |
p03078 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <memory>
#include <queue>
#include <utility>
#include <vector>
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <memory>
#include <queue>
#include <utility>
#include <vector>
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
... | [
"identifier.change",
"call.arguments.change"
] | 896,850 | 896,851 | u704411633 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
int A[X], B[Y], C[Z];
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for (int i = 0; i < Z; i++)
cin >> C[i];
int AB[X * Y];
int k = 0;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], C[Z];
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for (int i = 0; i < Z; i++)
cin >> C[i];
long long AB[X * Y];
int k = 0;
for ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 896,854 | 896,855 | u303454114 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF 1000000000000000000
#define MOD 10007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF 1000000000000000000
#define MOD 10007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<l... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 896,856 | 896,857 | u864171425 | cpp |
p03078 | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
... | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"control_flow.branch.else.remove"
] | 896,863 | 896,864 | u146240825 | cpp |
p03078 | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
... | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 896,865 | 896,864 | u146240825 | cpp |
p03078 | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
... | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
for (long long i = 0; i < z; ++i)
... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 896,866 | 896,864 | u146240825 | cpp |
p03078 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
static void D_Cake123();
int main() {
D_Cake123();
fflush(stdout);
return 0;
}
void GetUlls(std::vector<unsigned long long> &vUll, unsigned int cnt,
FILE *strm = stdin) {
unsig... |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
static void D_Cake123();
int main() {
D_Cake123();
fflush(stdout);
return 0;
}
void GetUlls(std::vector<unsigned long long> &vUll, unsigned int cnt,
FILE *strm = stdin) {
unsig... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 896,881 | 896,882 | u887675488 | cpp |
p03078 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 896,890 | 896,891 | u938924220 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
long long x, y, z, K, a[1005], b[1005], c[1005];
vector<long long> vec;
int main() {
cin >> x >> y >> z >> K;
for (int i = 0; i < x; ++i)
cin >> a[i];
sort(a, a + x, greater<long long>());
for (int i = 0; i < y; ++i)
cin >> b[i];
sort(b, b + y, greate... | #include <bits/stdc++.h>
using namespace std;
long long x, y, z, K, a[1005], b[1005], c[1005];
vector<long long> vec;
int main() {
cin >> x >> y >> z >> K;
for (int i = 0; i < x; ++i)
cin >> a[i];
sort(a, a + x, greater<long long>());
for (int i = 0; i < y; ++i)
cin >> b[i];
sort(b, b + y, greate... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 896,892 | 896,893 | u678652070 | cpp |
p03078 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
vector<ll> g[... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
vector<ll> g[... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 896,898 | 896,899 | u109256064 | cpp |
p03078 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a[1005], b[1005], c[1005];
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x);
r... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a[1005], b[1005], c[1005];
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x);
r... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 896,914 | 896,915 | u876558178 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define mod 1000000007
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
int X, Y, Z;
int K;
cin >> X >> Y >> Z;
cin >> K;
vector<long long> A(X), B(Y), C(Z);
rep(i, X... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define mod 1000000007
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
int X, Y, Z;
int K;
cin >> X >> Y >> Z;
cin >> K;
vector<long long> A(X), B(Y), C(Z);
rep(i, X... | [
"call.arguments.change",
"call.add"
] | 896,916 | 896,917 | u859125915 | cpp |
p03081 | #include <stdio.h>
using namespace std;
int n, q;
char s[200000], t[200000], d[200000];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index =... | #include <stdio.h>
using namespace std;
int n, q;
char s[200001], t[200000], d[200000];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index =... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 896,927 | 896,925 | u638659855 | cpp |
p03081 | #include <stdio.h>
using namespace std;
int n, q;
char s[200000], t[200000], d[200000];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index =... | #include <stdio.h>
using namespace std;
int n, q;
char s[200001], t[200000], d[200001];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index =... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 896,927 | 896,928 | u638659855 | cpp |
p03081 | #include <stdio.h>
using namespace std;
int n, q;
char s[200000], t[200000], d[200000];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index =... | #include <stdio.h>
using namespace std;
int n, q;
char s[200001], t[200001], d[200001];
char last_place(int index) {
for (int i = 0; i < q; i++) {
if (s[index] == t[i]) {
if (d[i] == 'R')
index++;
else
index--;
}
if (index == -1)
return 'l'; // lift
else if (index =... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 896,927 | 896,929 | u638659855 | cpp |
p03081 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool check(int i, string &s, vector<char> &t, vector<char> &d, int c) {
for (int j = 0; j < t.size(); j++) {
if (s[i] == t[j]) {
if (d[j] == 'R')
i++;
else
i--;
}
}
return i == c;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool check(int i, string &s, vector<char> &t, vector<char> &d, int c) {
for (int j = 0; j < t.size(); j++) {
if (s[i] == t[j]) {
if (d[j] == 'R')
i++;
else
i--;
}
}
return i == c;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 896,940 | 896,941 | u809153881 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [] | 896,953 | 896,954 | u096883693 | cpp |
p03081 | #include <cstring>
#include <iostream>
using namespace std;
typedef pair<char, char> P;
int n, q;
string s;
P td[200005];
int ans;
int ans2;
bool cimu(int pos, bool swi) {
for (int i = 0; i < q; i++) {
if (td[i].first != s[pos])
continue;
if (td[i].second == 'L')
pos--;
else
pos++;
... | #include <cstring>
#include <iostream>
using namespace std;
typedef pair<char, char> P;
int n, q;
string s;
P td[200005];
int ans;
int ans2;
bool cimu(int pos, bool swi) {
for (int i = 0; i < q; i++) {
if (td[i].first != s[pos])
continue;
if (td[i].second == 'L')
pos--;
else
pos++;
... | [
"expression.operation.binary.remove"
] | 896,957 | 896,958 | u126361752 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define forrn(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define PYMOD(a, m) ((((a) % (m)) + (m)) % (m))
#define all(v) v.begin(), v.end()
#define mp make_pair
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define forrn(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define PYMOD(a, m) ((((a) % (m)) + (m)) % (m))
#define all(v) v.begin(), v.end()
#define mp make_pair
#define... | [] | 896,969 | 896,970 | u725927710 | cpp |
p03081 | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
bool vanish(int n, string s, vector<string> t, vector<string> d, int m) {
int Q = t.size();
int x = n - 1;
int L = s.length();
for (int i = 0; i < Q; i++) {
if (t[i][0] == s[x]) {
x += (d[i][0] =... | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
bool vanish(int n, string s, vector<string> t, vector<string> d, int m) {
int Q = t.size();
int x = n - 1;
int L = s.length();
for (int i = 0; i < Q; i++) {
if (t[i][0] == s[x]) {
x += (d[i][0] =... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 896,980 | 896,981 | u119098168 | cpp |
p03081 | #include <iostream>
#include <string>
#define MAX_SIZE (200 * 1000)
char query[MAX_SIZE][2];
bool die(int pos, int N, int Q, std::string text, bool isLeft) {
for (int i = 0; i < Q; ++i) {
if (text[pos] == query[i][0]) {
if (query[i][1] == 'L') {
--pos;
} else {
++pos;
}
i... | #include <iostream>
#include <string>
#define MAX_SIZE (200 * 1000)
char query[MAX_SIZE][2];
bool die(int pos, int N, int Q, std::string text, bool isLeft) {
for (int i = 0; i < Q; ++i) {
if (text[pos] == query[i][0]) {
if (query[i][1] == 'L') {
--pos;
} else {
++pos;
}
i... | [
"expression.operation.binary.remove"
] | 896,984 | 896,985 | u716085737 | cpp |
p03081 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typ... | [
"expression.operation.binary.remove"
] | 896,986 | 896,987 | u004342119 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 897,017 | 897,018 | u898749314 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#defin... | [] | 897,019 | 897,020 | u795058347 | cpp |
p03081 | #include <iostream>
#define NMAX (2 * 100000)
int main() {
int N, Q;
std::string S;
std::cin >> N >> Q;
std::cin >> S;
using P = std::pair<char, char>;
P temp, td[NMAX];
for (int i = 0; i < Q; ++i) {
std::cin >> temp.first >> temp.second;
td[i] = temp;
}
int lcur = 0;
int rcur = N - 1;... | #include <iostream>
#define NMAX (2 * 100000)
int main() {
int N, Q;
std::string S;
std::cin >> N >> Q;
std::cin >> S;
using P = std::pair<char, char>;
P temp, td[NMAX];
for (int i = 0; i < Q; ++i) {
std::cin >> temp.first >> temp.second;
td[i] = temp;
}
int lcur = 0;
int rcur = N - 1;... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 897,033 | 897,034 | u930737792 | cpp |
p03081 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<char> s(n + 2);
s[0] = 'n';
s[n + 1] = 'n';
for (int i = 1; i <= n; ++i)
cin >> s[i];
vector<char> t(q), d(q);
REP(i, q) { cin >> t[i] >> d[i]; }
int left =... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<char> s(n + 2);
s[0] = 'n';
s[n + 1] = 'n';
for (int i = 1; i <= n; ++i)
cin >> s[i];
vector<char> t(q), d(q);
REP(i, q) { cin >> t[i] >> d[i]; }
int left =... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 897,037 | 897,038 | u209767598 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.