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 |
|---|---|---|---|---|---|---|---|
p03149 | #include <algorithm>
#include <iostream>
using namespace std;
int a[4];
int main() {
for (int i = 0; i < 4; i++)
cin >> a[i];
sort(a, a + 4);
if (a[0] == 1 && a[1] == 9 && a[2] == 7 && a[3] == 4)
cout << "YES";
else
cout << "NO";
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int a[4];
int main() {
for (int i = 0; i < 4; i++)
cin >> a[i];
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,315 | 947,316 | u152424169 | cpp |
p03149 | #include <iostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <map>
#include <queue>
#include <string>
#include <vector>
#d... | #include <iostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <map>
#include <queue>
#include <string>
#include <vector>
#d... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,321 | 947,322 | u824332405 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int a[20];
int main() {
a[1] = 1, a[4] = 1, a[9] = 1, a[7] = 1;
for (int i = 0; i < 4; i++) {
int t;
cin >> t;
a[t] = 0;
}
if (a[1] || a[9] || a[7] || a[4]) {
cout << "No\n";
} else
cout << "Yes\n";
} | #include <bits/stdc++.h>
using namespace std;
int a[20];
int main() {
a[1] = 1, a[4] = 1, a[9] = 1, a[7] = 1;
for (int i = 0; i < 4; i++) {
int t;
cin >> t;
a[t] = 0;
}
if (a[1] || a[9] || a[7] || a[4]) {
cout << "NO\n";
} else
cout << "YES\n";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,323 | 947,324 | u269278772 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
bool judge(int a, int b, int c, int d, int x) {
if (a == x || b == x || c == x || d == x)
return true;
}
int main() {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
int t = 0;
if (judge(a, b, c, d, 1))
t++;
if (judge(a, b, c, d, 9))
t++;
if (ju... | #include <bits/stdc++.h>
using namespace std;
bool judge(int a, int b, int c, int d, int x) {
if (a == x || b == x || c == x || d == x)
return true;
else
return false;
}
int main() {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
int t = 0;
if (judge(a, b, c, d, 1))
t++;
if (judge(a, b, c,... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.return.add"
] | 947,343 | 947,344 | u676323984 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
char N[4];
int main() {
cin >> N[0] >> N[1] >> N[2] >> N[3];
sort(N, N + 4);
if (!strcmp(N, "1479"))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
char N[4];
int main() {
cin >> N[0] >> N[1] >> N[2] >> N[3];
sort(N, N + 4);
if (!strcmp(N, "1479"))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,347 | 947,348 | u056863173 | cpp |
p03149 | #include <iostream>
#include <string>
int main() {
int N[4];
for (int i = 0; i < 4; i++)
std::cin >> N[i];
bool check = false;
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
for (int k = 0; k < 4; k++)
for (int l = 0; l < 4; l++)
if (1000 * N[i] + 100 * N[j] + 10 * N[... | #include <iostream>
#include <string>
int main() {
int N[4];
for (int i = 0; i < 4; i++)
std::cin >> N[i];
bool check = false;
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
for (int k = 0; k < 4; k++)
for (int l = 0; l < 4; l++)
if (1000 * N[i] + 100 * N[j] + 10 * N[... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 947,351 | 947,352 | u985625318 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string ans = "No";
for (int f = 0; f < S.size(); f++)
for (int m = 0; m < S.size(); m++) {
if (f + m > S.size())
continue;
int l = S.size() - f - m;
string check;
for (int i = 0; i < f; i++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string ans = "NO";
for (int f = 0; f < S.size(); f++)
for (int m = 0; m < S.size(); m++) {
if (f + m > S.size())
continue;
int l = S.size() - f - m;
string check;
for (int i = 0; i < f; i++)
... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 947,359 | 947,360 | u840389344 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
string s;
cin >> s;
string u = "keyence", ans = "No";
int l = s.size();
for (int i = 0; i < l; i++) {
for (int j = 0; j <= l - i - 1; j++) {
string cp = s;
cp = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
string s;
cin >> s;
string u = "keyence", ans = "NO";
int l = s.size();
for (int i = 0; i < l; i++) {
for (int j = 0; j <= l - i - 1; j++) {
string cp = s;
cp = ... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 947,361 | 947,362 | u130651752 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
string s;
cin >> s;
string u = "keyence", ans = "No";
int l = s.size();
for (int i = 0; i < l; i++) {
for (int j = 0; j < l - i - 1; j++) {
string cp = s;
cp = c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
string s;
cin >> s;
string u = "keyence", ans = "NO";
int l = s.size();
for (int i = 0; i < l; i++) {
for (int j = 0; j <= l - i - 1; j++) {
string cp = s;
cp = ... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change"
] | 947,364 | 947,362 | u130651752 | cpp |
p03150 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
void solve() {
string s;
cin >> s;
if (s == "keyence") {
cout << "Yes";
return;
}
int n = s.length();
for (int i = 0; i < n; i++) {
for (int j = i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
void solve() {
string s;
cin >> s;
if (s == "keyence") {
cout << "YES";
return;
}
int n = s.length();
for (int i = 0; i < n; i++) {
for (int j = i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,368 | 947,369 | u806692883 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,379 | 947,378 | u950174376 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int len = (int)(S.size());
bool ans = false;
if (S.substr(0, 7) == "keyence" || S.substr(len - 7) == "keyence")
ans = true;
for (int i = 1; i < len - 1; i++) {
string a = S.substr(0, i);
string b = S.substr(len - 7 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int len = (int)(S.size());
bool ans = false;
if (S.substr(0, 7) == "keyence" || S.substr(len - 7) == "keyence")
ans = true;
for (int i = 1; i < 7; i++) {
string a = S.substr(0, i);
string b = S.substr(len - 7 + i);
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 947,380 | 947,381 | u418586218 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s, key = "keyence";
cin >> s;
auto solve = [&](int l) {
int r = 1;
while (l + r < s.size()) {
string t = s;
t.erase(l, r);
if (t == key) {
cout << "YES" << endl;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s, key = "keyence";
cin >> s;
auto solve = [&](int l) {
int r = 0;
while (l + r < s.size()) {
string t = s;
t.erase(l, r);
if (t == key) {
cout << "YES" << endl;... | [
"literal.number.change",
"variable_declaration.value.change"
] | 947,388 | 947,389 | u713574885 | cpp |
p03150 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change"
] | 947,394 | 947,395 | u179778090 | cpp |
p03150 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
string s;
cin >> s;
int l = (int)s.size();
bool ok = false;
for (int i = 0; i < l; i++) {
for (int j = i; j < l; j++) {
string t = s.substr(0,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
string s;
cin >> s;
int l = (int)s.size();
bool ok = false;
for (int i = 0; i < l; i++) {
for (int j = i; j < l; j++) {
string t = s.substr(0,... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,400 | 947,401 | u801916231 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 1; j <= s.size(); j++) {
string t = s;
if (t.erase(i, j) == "keyence") {
cout << "YES" << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j <= s.size(); j++) {
string t = s;
if (t.erase(i, j) == "keyence") {
cout << "YES" << endl;
retu... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 947,409 | 947,410 | u298768617 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
string keyence = "keyence";
rep(i, S.size()) {
for (int j = i + 1; j < S.size(); j++) {
if (S.substr(0, i) + S.substr(j, S.size()) == keyence) {
cout << "YES" <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
string keyence = "keyence";
string value;
rep(i, S.size()) {
for (int j = i; j < S.size(); j++) {
if (S.substr(0, i) + S.substr(j, S.size()) == keyence) {
co... | [
"variable_declaration.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 947,413 | 947,414 | u579001504 | cpp |
p03148 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 21474... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 21474... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 947,421 | 947,422 | u901561754 | cpp |
p03148 | /**
*
*/
// {{{ header
#include <bits/stdc++.h>
using namespace std;
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using f32 = float;
using f6... | /**
*
*/
// {{{ header
#include <bits/stdc++.h>
using namespace std;
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using f32 = float;
using f6... | [
"expression.unary.arithmetic.add"
] | 947,425 | 947,426 | u254456372 | cpp |
p03148 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int INF = pow(2, 31) - 1;
#define ll long long
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int INF = pow(2, 31) - 1;
#define ll long long
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b)... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.condition.change"
] | 947,435 | 947,436 | u353542198 | cpp |
p03148 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int INF = pow(2, 31) - 1;
#define ll long long
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int INF = pow(2, 31) - 1;
#define ll long long
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b)... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.condition.change"
] | 947,437 | 947,436 | u353542198 | cpp |
p03148 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
int main() {
int count[100001];
memset(count, 0, sizeof(count));
int n, k;
cin >> n >> k;
vector<pair<int, int>> susi;
for (int i = ... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
int main() {
int count[100001];
memset(count, 0, sizeof(count));
int n, k;
cin >> n >> k;
vector<pair<int, int>> susi;
for (int i = ... | [
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.change"
] | 947,441 | 947,442 | u051493691 | cpp |
p03148 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)... | [
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 947,446 | 947,447 | u136378781 | cpp |
p03148 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define ll long long int
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> pairs(n);
REP(i, n) {
ll a, b;
cin >> a >> b;
pairs[i] = make_pair(b, a)... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define ll long long int
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> pairs(n);
REP(i, n) {
ll a, b;
cin >> a >> b;
pairs[i] = make_pair(b, a)... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 947,464 | 947,463 | u620059302 | cpp |
p03148 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
typedef long long ll;
int N, K;
vector<int> D;
map<int, int> t_max;
vector<int> max_val, max_pos;
void input_init(void) {
cin >> N >> K;
D.resize(N);
for (int i = 0; i < N; ++... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
typedef long long ll;
int N, K;
vector<int> D;
map<int, int> t_max;
vector<int> max_val, max_pos;
void input_init(void) {
cin >> N >> K;
D.resize(N);
for (int i = 0; i < N; ++... | [
"expression.unary.arithmetic.add"
] | 947,475 | 947,476 | u282280353 | cpp |
p03148 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long int ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for (int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long int ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for (int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b... | [
"expression.operation.binary.remove"
] | 947,491 | 947,492 | u261243803 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<pii> a(n);
rep(i, n) cin >> a.at(i)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<pii> a(n);
rep(i, n) cin >> a.at(i)... | [
"assignment.change"
] | 947,504 | 947,505 | u480831358 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<pii> a(n);
rep(i, n) cin >> a.at(i)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<pii> a(n);
rep(i, n) cin >> a.at(i)... | [
"assignment.change"
] | 947,506 | 947,507 | u480831358 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> sushi;
const int MAXN = 100001;
int main() {
ll n, k;
cin >> n >> k;
vector<sushi> v;
for (int i = 0; i < n; i++) {
ll t, d;
cin >> t >> d;
v.push_back(sushi(t, d));
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> sushi;
const int MAXN = 100001;
int main() {
ll n, k;
cin >> n >> k;
vector<sushi> v;
for (int i = 0; i < n; i++) {
ll t, d;
cin >> t >> d;
v.push_back(sushi(t, d));
}
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 947,536 | 947,537 | u633065537 | cpp |
p03148 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
tem... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
tem... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.arguments.change"
] | 947,542 | 947,543 | u604896914 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
ll k, n;
typedef pair<ll, ll> P;
set<ll> bonus;
vector<P> sushi;
int main() {
cin >> n >> k;
priority_queue<P, vector<P>, greater<P>> p1;
priority_queue<P> p2;
for (int i = 0; ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
ll k, n;
typedef pair<ll, ll> P;
set<ll> bonus;
vector<P> sushi;
int main() {
cin >> n >> k;
priority_queue<P, vector<P>, greater<P>> p1;
priority_queue<P> p2;
for (int i = 0; ... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 947,547 | 947,548 | u126361752 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main() {
// cin の高速化らしい
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> sushi;
for (int i = 0; i < n; i++) {
int t, d;
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main() {
// cin の高速化らしい
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> sushi;
for (int i = 0; i < n; i++) {
int t, d;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 947,561 | 947,562 | u725458677 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main() {
// cin の高速化らしい
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> sushi;
for (int i = 0; i < n; i++) {
int t, d;
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main() {
// cin の高速化らしい
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> sushi;
for (int i = 0; i < n; i++) {
int t, d;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 947,563 | 947,562 | u725458677 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main() {
// cin の高速化らしい
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> sushi;
for (int i = 0; i < n; i++) {
int t, d;
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main() {
// cin の高速化らしい
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> sushi;
for (int i = 0; i < n; i++) {
int t, d;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 947,564 | 947,562 | u725458677 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repf(i, f, l) for (int i = f; i < (int)l; ++i)
#define repit(it, t) \
for (__typeof((t).begin()) it = (t).begin(); it != (t).end(); it++)
#define endl "\n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repf(i, f, l) for (int i = f; i < (int)l; ++i)
#define repit(it, t) \
for (__typeof((t).begin()) it = (t).begin(); it != (t).end(); it++)
#define endl "\n... | [
"assignment.change",
"expression.operation.binary.add"
] | 947,571 | 947,572 | u880359730 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
struct SegmentTree {
int n;
vector<ll> node;
SegmentTree(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
struct SegmentTree {
int n;
vector<ll> node;
SegmentTree(... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 947,587 | 947,588 | u864171425 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int N, K;
vector<P> dt;
ll calc(int x) {
ll point = (ll)x * x;
int cnt = 0;
set<int> us;
vector<bool> ate(N, false);
for (int i = 0; i < N; i++) {
int d = dt[i].first, t = dt[i].second;
if (us.find(t) == ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int N, K;
vector<P> dt;
ll calc(int x) {
ll point = (ll)x * x;
int cnt = 0;
set<int> us;
vector<bool> ate(N, false);
for (int i = 0; i < N; i++) {
int d = dt[i].first, t = dt[i].second;
if (us.find(t) == ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 947,612 | 947,613 | u639989198 | cpp |
p03148 | #include <algorithm>
#include <complex>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<... | #include <algorithm>
#include <complex>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 947,614 | 947,615 | u852158538 | cpp |
p03148 | #include <algorithm>
#include <complex>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<... | #include <algorithm>
#include <complex>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 947,616 | 947,615 | u852158538 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef struct node {
int x, y;
bool operator<(const struct node &n) const { return y > n.y; }
} NODE, *PNODE;
NODE a[100005];
int n, k, cnt = 0;
int visited[100005];
stack<int> s;
int main() {
int i;
long long ans = 0, res = 0, type = 0;
scanf("%d%d", &n, &k);
... | #include <bits/stdc++.h>
using namespace std;
typedef struct node {
int x, y;
bool operator<(const struct node &n) const { return y > n.y; }
} NODE, *PNODE;
NODE a[100005];
int n, k, cnt = 0;
int visited[100005];
stack<int> s;
int main() {
int i;
long long ans = 0, res = 0, type = 0;
scanf("%d%d", &n, &k);
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 947,621 | 947,622 | u314499126 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef struct node {
int x, y;
bool operator<(const struct node &n) const { return y > n.y; }
} NODE, *PNODE;
NODE a[100005];
int n, k, cnt = 0;
int visited[100005];
stack<int> s;
int main() {
int i;
long long ans = 0, res = 0, type = 0;
scanf("%d%d", &n, &k);
... | #include <bits/stdc++.h>
using namespace std;
typedef struct node {
int x, y;
bool operator<(const struct node &n) const { return y > n.y; }
} NODE, *PNODE;
NODE a[100005];
int n, k, cnt = 0;
int visited[100005];
stack<int> s;
int main() {
int i;
long long ans = 0, res = 0, type = 0;
scanf("%d%d", &n, &k);
... | [
"assignment.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 947,623 | 947,622 | u314499126 | cpp |
p03148 | #include <algorithm>
#include <cstdio>
#include <map>
typedef long long ll;
#define PII pair<ll, ll>
#define T second
#define D first
using namespace std;
ll n, k, sum, ans;
PII a[100005];
map<ll, ll> mp;
int main() {
ll i, j, sz;
scanf("%lld%lld", &n, &k);
for (i = 0; i < n; i++)
scanf("%lld%lld", &a[i].T, ... | #include <algorithm>
#include <cstdio>
#include <map>
typedef long long ll;
#define PII pair<ll, ll>
#define T second
#define D first
using namespace std;
ll n, k, sum, ans;
PII a[100005];
map<ll, ll> mp;
int main() {
ll i, j, sz;
scanf("%lld%lld", &n, &k);
for (i = 0; i < n; i++)
scanf("%lld%lld", &a[i].T, ... | [
"expression.unary.arithmetic.add"
] | 947,628 | 947,629 | u093170535 | cpp |
p03149 | #include <bits/stdc++.h>
#include <cmath>
#include <list>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int N[4];
cin >> N[0] >> N[1] >> N[2] >> N[3];
int check[4] = {0, 0, 0, 0};
for (int i = 0; i < 4; i++) {
if (N[i] = 1)
check[0] = 1;
if (N[i] = 4)
check[1] = 1... | #include <bits/stdc++.h>
#include <cmath>
#include <list>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int N[4];
cin >> N[0] >> N[1] >> N[2] >> N[3];
int check[4] = {0, 0, 0, 0};
for (int i = 0; i < 4; i++) {
if (N[i] == 1)
check[0] = 1;
if (N[i] == 4)
check[1] =... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 947,668 | 947,669 | u650243369 | cpp |
p03149 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int n[4];
int main() {
cin >> n[0] >> n[1] >> n[2] >> n[3];
sort(n, n + 4);
if (n[0] == 1)
if (n[1] == 4)
if (n[2] == 7)
if (n[3] == 9)
cout << "YES" << endl;
else
cout << "NO" << e... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int n[4];
int main() {
cin >> n[0] >> n[1] >> n[2] >> n[3];
sort(n, n + 4);
if (n[0] == 1)
if (n[1] == 4)
if (n[2] == 7)
if (n[3] == 9) {
cout << "YES" << endl;
return 0;
}
cout <... | [
"control_flow.return.add"
] | 947,676 | 947,677 | u876442898 | cpp |
p03149 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
signed main() {
int a[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9) {
puts("Yes");
} else
puts("No");
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
signed main() {
int a[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9) {
puts("YES");
} else
puts("NO");
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 947,682 | 947,683 | u016612263 | cpp |
p03149 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define int long long
#define ll \
getchar(); \
getcha... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define int long long
#define ll \
getchar(); \
getcha... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 947,686 | 947,687 | u971256474 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(4);
cin >> a[0] >> a[1] >> a[2] >> a[3];
sort(a.begin(), a.end());
if (a[0] != 1 || a[1] != 7 || a[2] != 9 || a[3] != 4) {
cout << "NO"
<< "\n";
} else {
cout << "YES"
<< "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(4);
cin >> a[0] >> a[1] >> a[2] >> a[3];
sort(a.begin(), a.end());
if (a[0] != 1 || a[1] != 4 || a[2] != 7 || a[3] != 9) {
cout << "NO"
<< "\n";
} else {
cout << "YES"
<< "\n";
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,698 | 947,699 | u319242216 | cpp |
p03149 | #include <iostream>
using namespace std;
int main() {
int x[4], a = 0, b = 0, c = 0, d = 0;
for (int i = 0; i < 4; i++)
cin >> x[i];
for (int i = 0; i < 4; i++) {
switch (x[i]) {
case 1:
a = 1;
break;
case 9:
b = 1;
break;
case 7:
c = 1;
break;
case 4:
... | #include <iostream>
using namespace std;
int main() {
int x[4], a = 0, b = 0, c = 0, d = 0;
for (int i = 0; i < 4; i++)
cin >> x[i];
for (int i = 0; i < 4; i++) {
switch (x[i]) {
case 1:
a = 1;
break;
case 9:
b = 1;
break;
case 7:
c = 1;
break;
case 4:
... | [
"literal.string.change",
"io.output.change"
] | 947,707 | 947,708 | u759663933 | cpp |
p03149 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a == 1 || b == 1 || c == 1 || d == 1) {
if (a == 4 || b == 4 || c == 4 || d == 4) {
if (a == 7 || b == 7 || c == 7... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a == 1 || b == 1 || c == 1 || d == 1) {
if (a == 4 || b == 4 || c == 4 || d == 4) {
if (a == 7 || b == 7 || c == 7... | [
"control_flow.branch.if.condition.change"
] | 947,713 | 947,714 | u923238225 | cpp |
p03149 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 1000000007
#define maxn 10000010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 1000000007
#define maxn 10000010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 947,715 | 947,716 | u245106490 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(4);
for (int i = 0; i < 4; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[0] == 1 && a[1] == 4 && a[3] == 7 && a[3] == 9)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(4);
for (int i = 0; i < 4; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 947,717 | 947,718 | u654240084 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[4];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n[4];
for (int i = 0; i < 4; i++) {
cin >> n[i];
}
for (int i = 0; i < 4; i++) {
if (n[i] == 1)
a[0]++;
if (n[i] == 7)
a[1]++;
if (n[i] =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[4];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n[4];
for (int i = 0; i < 4; i++) {
cin >> n[i];
}
for (int i = 0; i < 4; i++) {
if (n[i] == 1)
a[0]++;
if (n[i] == 7)
a[1]++;
if (n[i] =... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.change"
] | 947,721 | 947,722 | u344122377 | cpp |
p03149 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int a[4];
int main() {
int i, j, k;
scanf("%d%d%d%d", &a[1], &a[2], &a[3], &a[0]);
sort(a, a + 3);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9)
printf("YES\n");
else
printf("NO\n");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int a[4];
int main() {
int i, j, k;
scanf("%d%d%d%d", &a[1], &a[2], &a[3], &a[0]);
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9)
printf("YES\n");
else
printf("NO\n");
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 947,723 | 947,724 | u792421324 | cpp |
p03149 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int a[4];
int main() {
int i, j, k;
scanf("%d%d%d%d", &a[1], &a[2], &a[3], &a[0]);
sort(a, a + 3);
if (a[1] == 1 && a[2] == 4 && a[3] == 7 && a[4] == 9)
printf("YES\n");
else
printf("NO\n");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int a[4];
int main() {
int i, j, k;
scanf("%d%d%d%d", &a[1], &a[2], &a[3], &a[0]);
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9)
printf("YES\n");
else
printf("NO\n");
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 947,725 | 947,724 | u792421324 | cpp |
p03149 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int a[4];
int main() {
int i, j, k;
scanf("%d%d%d%d", &a[1], &a[2], &a[3], &a[4]);
sort(a, a + 3);
if (a[1] == 1 && a[2] == 4 && a[3] == 7 && a[4] == 9)
printf("YES\n");
else
printf("NO\n");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int a[4];
int main() {
int i, j, k;
scanf("%d%d%d%d", &a[1], &a[2], &a[3], &a[0]);
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9)
printf("YES\n");
else
printf("NO\n");
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 947,726 | 947,724 | u792421324 | cpp |
p03149 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,727 | 947,728 | u426855695 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a == 1 || b == 1 || c == 1 || d == 1) {
if (a == 4 || b == 4 || c == 4 || d == 4) {
if (a == 7 || b == 7 || c == 7 || d == 7) {
if (a == 9 || b == 9 || c == 9 || d == 9)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a == 1 || b == 1 || c == 1 || d == 1) {
if (a == 4 || b == 4 || c == 4 || d == 4) {
if (a == 7 || b == 7 || c == 7 || d == 7) {
if (a == 9 || b == 9 || c == 9 || d == 9)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,729 | 947,730 | u077536797 | cpp |
p03150 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using na... | [
"literal.number.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,737 | 947,738 | u841131859 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
const int di[4] = {1, 0, -1, 0};
const int dj[4] = {0, 1, 0, -1};
signed main() {
string s;
cin >> s;
int n = (int)s.size();
for (int l = 0; l < n; l++) {
for (int r = l; r < n; r++) {
string t = "";
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
const int di[4] = {1, 0, -1, 0};
const int dj[4] = {0, 1, 0, -1};
signed main() {
string s;
cin >> s;
int n = (int)s.size();
for (int l = 0; l < n; l++) {
for (int r = l; r <= n; r++) {
string t = "";
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 947,739 | 947,740 | u212904724 | cpp |
p03150 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int subN = N - 7;
if (subN < 0) {
cout << "NO" << endl;
return 0;
}
for (int i = 0; i < N; i++) {
string first = S.substr(0, i);
string middle = S.substr(i, subN);
string last ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int subN = N - 7;
if (subN < 0) {
cout << "NO" << endl;
return 0;
}
for (int i = 0; i < N - subN + 1; i++) {
string first = S.substr(0, i);
string middle = S.substr(i, subN);
s... | [
"control_flow.loop.for.condition.change"
] | 947,741 | 947,742 | u521973174 | cpp |
p03150 | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a > b)
return false;
a = b;
return true;
}
template <class T> bool chmin(T &a, const T &b) {
if (a... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a > b)
return false;
a = b;
return true;
}
template <class T> bool chmin(T &a, const T &b) {
if (a... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,747 | 947,748 | u047554023 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n); i >= 0; i--)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define REVSORT(c) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n); i >= 0; i--)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define REVSORT(c) ... | [
"expression.unary.arithmetic.remove"
] | 947,751 | 947,752 | u615258936 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pa = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e14;
const long double EPS = 1e-11;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pa = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e14;
const long double EPS = 1e-11;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0;... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 947,765 | 947,766 | u722535636 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
bool f() {
string s;
cin >> s;
string a = "keyence";
int l = s.size();
if (l < 7)
return false;
for (int i = 0; i < 8; i++) {
if (s.substr(0, i) != a.substr(0, i))
continue;
int j = 7 - i;
if (s.substr(l - 1 - j, j) == a.substr(6 - j, j))
... | #include <bits/stdc++.h>
using namespace std;
bool f() {
string s;
cin >> s;
string a = "keyence";
int l = s.size();
if (l < 7)
return false;
for (int i = 0; i < 8; i++) {
if (s.substr(0, i) != a.substr(0, i))
return false;
int j = 7 - i;
if (s.substr(l - j, j) == a.substr(7 - j, j))
... | [
"control_flow.continue.remove",
"control_flow.return.add",
"function.return_value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,773 | 947,774 | u946322619 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
bool f() {
string s;
cin >> s;
string a = "keyence";
int l = s.size();
if (l < 7)
return false;
for (int i = 0; i < 8; i++) {
if (s.substr(0, i) != a.substr(0, i))
continue;
int j = 7 - i;
if (s.substr(l - 1 - j, j) == a.substr(6 - j, j))
... | #include <bits/stdc++.h>
using namespace std;
bool f() {
string s;
cin >> s;
string a = "keyence";
int l = s.size();
if (l < 7)
return false;
for (int i = 0; i < 8; i++) {
if (s.substr(0, i) != a.substr(0, i))
continue;
int j = 7 - i;
if (s.substr(l - j, j) == a.substr(7 - j, j))
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,773 | 947,775 | u946322619 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t / 2;
... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t / 2;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,780 | 947,781 | u687204015 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, keyence;
int sizedif;
cin >> S;
keyence = "keyence";
sizedif = S.size() - 7;
for (int k = 0; k < 7; k++) {
if (S.at(k) != keyence.at(k)) {
if (S.compare(k + sizedif, 7 - k, keyence, k, 7 - k) == 0)
cout << "Yes" << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, keyence;
int sizedif;
cin >> S;
keyence = "keyence";
sizedif = S.size() - 7;
for (int k = 0; k < 7; k++) {
if (S.at(k) != keyence.at(k)) {
if (S.compare(k + sizedif, 7 - k, keyence, k, 7 - k) == 0)
cout << "YES" << endl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,782 | 947,783 | u302893919 | cpp |
p03150 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string S = "keyence";
string A, T;
cin >> A;
rep(i, S.size()) {
rep(j, S.size()) {
T = A;
T.erase(i, j);
if (T == S) {
cout << "Yes";
return 0;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string S = "keyence";
string A, T;
cin >> A;
rep(i, A.size()) {
rep(j, A.size()) {
T = A;
T.erase(i, j);
if (T == S) {
cout << "YES";
return 0;... | [
"identifier.change",
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,798 | 947,797 | u764860452 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | [
"literal.string.change",
"variable_declaration.value.change"
] | 947,806 | 947,807 | u322177979 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
const string X = "keyofscience";
int main() {
string S;
cin >> S;
int N = (int)S.size();
for (int i = 0; i <= N; i++) {
for (int j = i; j <= N; j++) {
if ((i == 0 && j == 0) || (i == N && j == N)) {
if (S == X) {
cout << "YES" << endl... | #include <bits/stdc++.h>
using namespace std;
const string X = "keyence";
int main() {
string S;
cin >> S;
int N = (int)S.size();
for (int i = 0; i <= N; i++) {
for (int j = i; j <= N; j++) {
if ((i == 0 && j == 0) || (i == N && j == N)) {
if (S == X) {
cout << "YES" << endl;
... | [
"literal.string.change",
"variable_declaration.value.change"
] | 947,822 | 947,823 | u904123392 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
const string X = "keyofscience";
int main() {
string S;
cin >> S;
int N = (int)S.size();
for (int i = 0; i <= N; i++) {
for (int j = i; j <= N; j++) {
if ((i == 0 && j == 0) || (i == N && j == N)) {
if (S == X) {
cout << "Yes" << endl... | #include <bits/stdc++.h>
using namespace std;
const string X = "keyence";
int main() {
string S;
cin >> S;
int N = (int)S.size();
for (int i = 0; i <= N; i++) {
for (int j = i; j <= N; j++) {
if ((i == 0 && j == 0) || (i == N && j == N)) {
if (S == X) {
cout << "YES" << endl;
... | [
"literal.string.change",
"variable_declaration.value.change",
"literal.string.case.change",
"io.output.change"
] | 947,824 | 947,823 | u904123392 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
//#define int long long
using pii = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
si... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
//#define int long long
using pii = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
si... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,829 | 947,830 | u803754262 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const string k = "keyence";
string s;
cin >> s;
if (s == k) {
cout << "YES" << endl;
return 0;
}
int l = s.length();
for (int i = 0; i < l; i++) {
for (int j = i; j < l; j++) {
string S = "";
for... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const string k = "keyence";
string s;
cin >> s;
if (s == k) {
cout << "YES" << endl;
return 0;
}
int l = s.length();
for (int i = 0; i < l; i++) {
for (int j = i; j < l; j++) {
string S = "";
for... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,837 | 947,838 | u904833081 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const string k = "keyence";
string s;
cin >> s;
if (s == k) {
cout << "YES" << endl;
return 0;
}
int l = s.length();
for (int i = 0; i < l; i++) {
for (int j = i + 1; j < l + 1; j++) {
string S = "";
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const string k = "keyence";
string s;
cin >> s;
if (s == k) {
cout << "YES" << endl;
return 0;
}
int l = s.length();
for (int i = 0; i < l; i++) {
for (int j = i; j < l; j++) {
string S = "";
for... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,839 | 947,838 | u904833081 | cpp |
p03150 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define intmax INT... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define intmax INT... | [
"literal.number.change",
"call.arguments.change"
] | 947,853 | 947,854 | u006717664 | cpp |
p03150 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
//入力終了
char k[] = "keyence";
//先頭がkでなければ，末尾がkeyenceになるしかない
if (S[0] != k[0]) {
if (S.substr(S.size() - 7) == k)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
//末尾がeでなければ，先頭がkeyenceになるしかない
else if (S... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
//入力終了
char k[] = "keyence";
//先頭がkでなければ，末尾がkeyenceになるしかない
if (S[0] != k[0]) {
if (S.substr(S.size() - 7) == k)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
//末尾がeでなければ，先頭がkeyenceになるしかない
else if (S... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,870 | 947,871 | u537852947 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
for (int i = 0; i < 7; i++) {
if (s.substr(0, i) + s.substr(s.size() - 7 + i) == "keyence") {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
for (int i = 0; i < 7; i++) {
if (s.substr(0, i) + s.substr(s.size() - 7 + i) == "keyence") {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,875 | 947,876 | u842857133 | cpp |
p03150 | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,883 | 947,884 | u935370883 | cpp |
p03150 | #include <bits/stdc++.h>
// #define int long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
string s;
cin >> s;
bool isOK = false;
if (s == "... | #include <bits/stdc++.h>
// #define int long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
string s;
cin >> s;
bool isOK = false;
if (s == "... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,887 | 947,888 | u510749912 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 947,889 | 947,890 | u947236878 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "keyence";
int pos = 0;
// try at the beginning
if (s.substr(0, 7) == ans)
pos = 1;
// try at the end
if (s.substr((int)s.size() - 7, 7) == ans)
pos = 1;
// try the other possible way
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "keyence";
int pos = 0;
// try at the beginning
if (s.substr(0, 7) == ans)
pos = 1;
// try at the end
if (s.substr((int)s.size() - 7, 7) == ans)
pos = 1;
// try the other possible way
for (int i = 1; ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 947,891 | 947,892 | u004676431 | cpp |
p03150 | #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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).e... | #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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).e... | [
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 947,904 | 947,905 | u608773191 | cpp |
p03150 | #include <algorithm>
#include <atomic>
#include <cmath>
#include <future>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <thread>
#include <vector>
#define int long long
#define endre ... | #include <algorithm>
#include <atomic>
#include <cmath>
#include <future>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <thread>
#include <vector>
#define int long long
#define endre ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 947,906 | 947,907 | u147049801 | cpp |
p03150 | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,912 | 947,913 | u222866518 | cpp |
p03150 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,916 | 947,917 | u596311864 | cpp |
p03150 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define repitr(ritr, x) for (auto ritr = x.rbeg... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define repitr(ritr, x) for (auto ritr = x.rbeg... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,920 | 947,921 | u617826263 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string title = "keyence";
int N = S.size(), M = title.size();
bool flag = false;
for (int i = 0; i < M + 1; i++) {
string leftSide = S.substr(0, i);
string rightSide = S.substr(N - M + i, M - i);
if (leftSide + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string title = "keyence";
int N = S.size(), M = title.size();
bool flag = false;
for (int i = 0; i < M + 1; i++) {
string leftSide = S.substr(0, i);
string rightSide = S.substr(N - M + i, M - i);
if (leftSide + ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,935 | 947,936 | u735528230 | cpp |
p03150 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using ll = long long;
int main() {
std::string s;
std::cin >> s;
std::string keyence = "keyence";
for (int i = 0; i < keyence.size() + 1; i++) {
if (s.subst... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using ll = long long;
int main() {
std::string s;
std::cin >> s;
std::string keyence = "keyence";
for (int i = 0; i < keyence.size() + 1; i++) {
if (s.subst... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 947,944 | 947,945 | u157368592 | cpp |
p03150 | #include <bits/stdc++.h>
#include <cctype>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int, int>
int main() {
string S;
cin >> S;
strin... | #include <bits/stdc++.h>
#include <cctype>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int, int>
int main() {
string S;
cin >> S;
strin... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,952 | 947,953 | u474180590 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i) = (n -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i) = (n -... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 947,956 | 947,957 | u017078415 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
string k = "keyence";
int n = s.length();
bool flag = true;
for (int i = 0; i <= 7; i++) {
string t = s.substr(0, (7 - i)) + s.substr(n - i, i);
if (k == t)
flag = true;
}
if (flag)
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
string k = "keyence";
int n = s.length();
bool flag = false;
for (int i = 0; i <= 7; i++) {
string t = s.substr(0, (7 - i)) + s.substr(n - i, i);
if (k == t)
flag = true;
}
if (flag)
c... | [
"misc.opposites",
"variable_declaration.value.change"
] | 947,958 | 947,959 | u873762144 | cpp |
p03150 | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
int main() {
string s;
cin >> s;
int n = s.size();
string t = "keyence";
rep(i, 8) {
string ns = s.substr(0, i) + s.substr(n -... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
int main() {
string s;
cin >> s;
int n = s.size();
string t = "keyence";
rep(i, 8) {
string ns = s.substr(0, i) + s.substr(n -... | [] | 947,966 | 947,967 | u936602931 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 947,976 | 947,977 | u356754940 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string key{"keyence"};
if (s == key) {
cout << "YES";
return 0;
}
for (int i = 0; i < (int)s.length() - 7; i++) {
for (int j = i; j < (int)s.length(); j++) {
for (int k = 0; k < 8; k++) {
// cout << s.s... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string key{"keyence"};
if (s == key) {
cout << "YES";
return 0;
}
for (int i = 0; i < (int)s.length() - 7; i++) {
for (int j = i; j < (int)s.length(); j++) {
for (int k = 0; k < 8; k++) {
// cout << s.s... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 947,982 | 947,983 | u515923980 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
const string keyword = "keyence";
string S;
cin >> S;
bool is_satisfied = false;
for (size_t len_head = 0; len_head <= keyword.size(); len_head++) {
size_t len_tail = keyword.size() - len_head;
if (S.substr(0, len_head) == keyword.substr(0, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
const string keyword = "keyence";
string S;
cin >> S;
bool is_satisfied = false;
for (size_t len_head = 0; len_head <= keyword.size(); len_head++) {
size_t len_tail = keyword.size() - len_head;
if (S.substr(0, len_head) == keyword.substr(0, ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 947,986 | 947,987 | u068765697 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#defin... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,035 | 948,036 | u790461875 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 948,041 | 948,042 | u132033278 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 948,045 | 948,046 | u355424600 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "keyence") {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < s.size(); i++)
for (int j = 1; j + i <= s.size(); j++) {
string ss = s.substr(0, i) + s.substr(i + j);
// cout<<i<<" "<<j<<" "<<ss... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "keyence") {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < s.size(); i++)
for (int j = 1; j + i <= s.size(); j++) {
string ss = s.substr(0, i) + s.substr(i + j);
// cout<<i<<" "<<j<<" "<<ss... | [
"literal.string.change",
"io.output.change"
] | 948,057 | 948,058 | u792037966 | cpp |
p03150 | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
string S;
cin >> S;
string k = "keyence";
string str1, str2;
int find1, find2, find3;
for (int i = 1; i <= 6; i++) {
str1 = k.substr(0, i);
str2 = k.substr(i, 7 - i);
find1 = S.find(str1);
f... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
string S;
cin >> S;
string k = "keyence";
string str1, str2;
int find1, find2, find3;
for (int i = 1; i <= 6; i++) {
str1 = k.substr(0, i);
str2 = k.substr(i, 7 - i);
find1 = S.find(str1);
f... | [
"assignment.value.change",
"call.function.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 948,065 | 948,064 | u912952979 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.