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 |
|---|---|---|---|---|---|---|---|
p03075 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 887,162 | 887,163 | u422558819 | cpp |
p03075 | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long... | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 887,164 | 887,165 | u319945100 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) <= 15)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 887,172 | 887,173 | u132364782 | cpp |
p03075 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 887,178 | 887,179 | u174404613 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[i] - a[j] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 887,186 | 887,187 | u366115355 | cpp |
p03075 | #include <stdio.h>
#include <stdlib.h>
int main() {
int a, b, c, d, e, f;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f);
int arr[] = {a, b, c, d, e, f};
int i, j, count = 0;
for (i = 0; i < 4; i++) {
for (j = i + 1; j < 5; j++) {
if ((arr[j] - arr[i]) > arr[f]) {
count++;
}
// pr... | #include <stdio.h>
#include <stdlib.h>
int main() {
int a, b, c, d, e, f;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f);
int arr[] = {a, b, c, d, e};
int i, j, count = 0;
for (i = 0; i < 4; i++) {
for (j = i + 1; j < 5; j++) {
if ((arr[j] - arr[i]) > f) {
count++;
// printf("%d - %d ... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 887,196 | 887,197 | u923465140 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> TUP;
#define a first
#define b second
#define bg begin()
#define ed end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define mp(x, y) make_pair(x, y)
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> TUP;
#define a first
#define b second
#define bg begin()
#define ed end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define mp(x, y) make_pair(x, y)
co... | [
"control_flow.branch.if.condition.change"
] | 887,198 | 887,199 | u527058497 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> v;
int cnt = 1;
for (int i = 1; i < N; ++i) {
if (s[i] != s[i - 1]) {
v.push_back(cnt);
cnt = 0;
}
++cnt;
}
v.push_back(cnt);
vector<i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> v;
int cnt = 1;
for (int i = 1; i < N; ++i) {
if (s[i] != s[i - 1]) {
v.push_back(cnt);
cnt = 0;
}
++cnt;
}
v.push_back(cnt);
vector<l... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 887,208 | 887,209 | u203927510 | cpp |
p03074 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | [] | 887,218 | 887,219 | u768152935 | cpp |
p03074 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
using namespace std;
ll n, k, i, hz, te, has, p[101010];
char a[101010];
pair<ll, ll> A[101010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
using namespace std;
ll n, k, i, hz, te, has, p[101010];
char a[101010];
pair<ll, ll> A[101010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k... | [
"identifier.change",
"call.arguments.change",
"assignment.value.change"
] | 887,220 | 887,221 | u015405600 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> vec;
int now = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
vec.push_back(cnt);
n... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> vec;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
vec.push_back(cnt);
n... | [
"literal.number.change",
"variable_declaration.value.change"
] | 887,222 | 887,223 | u901615543 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) REP(i, 0, n)
#define int long long
#define REP(i, l, r) for (int i = l; i < r; i++)
using namespace std;
typedef pair<int, int> P;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
boo... | #include <bits/stdc++.h>
#define rep(i, n) REP(i, 0, n)
#define int long long
#define REP(i, l, r) for (int i = l; i < r; i++)
using namespace std;
typedef pair<int, int> P;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
boo... | [
"assignment.change"
] | 887,236 | 887,237 | u073057072 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> num;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> num;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S... | [] | 887,240 | 887,241 | u845620905 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (auto &c : S) {
if (c == (char)('0' + now))
++cnt;
else {
Nums.push_back(cnt);
cnt = 1;
now = 1 - now;
}
}
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (auto &c : S) {
if (c == (char)('0' + now))
++cnt;
else {
Nums.push_back(cnt);
cnt = 1;
now = 1 - now;
}
}
i... | [
"assignment.change"
] | 887,259 | 887,260 | u067237725 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N, K;
string S;
cin >> N >> K >> S;
vector<int> a; //個数
char tmp = '1';
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == tmp) {
cnt++;
} else {
a.push_back(cnt);
cnt = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N, K;
string S;
cin >> N >> K >> S;
vector<int> a; //個数
char tmp = '1';
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == tmp) {
cnt++;
} else {
a.push_back(cnt);
cnt = 1;
... | [] | 887,270 | 887,271 | u111937495 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"expression.operation.binary.remove"
] | 887,274 | 887,275 | u452725238 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
vector<int> to_code(string s) {
vector<int> ret = {0};
if (s[0] == '0') {
ret.push_back(0);
}
s += "$";
int pos = 0;
while (pos + 1 < s.size()) {
int cnt = 1;
while (pos + 1 < s.size() && s[pos] == s[pos + 1])
pos++, cnt++;
ret.push_back(c... | #include <bits/stdc++.h>
using namespace std;
vector<int> to_code(string s) {
vector<int> ret = {0};
if (s[0] == '0') {
ret.push_back(0);
}
s += "$";
int pos = 0;
while (pos + 1 < s.size()) {
int cnt = 1;
while (pos + 1 < s.size() && s[pos] == s[pos + 1])
pos++, cnt++;
ret.push_back(c... | [
"control_flow.branch.if.condition.change",
"call.function.change",
"variable_access.subscript.index.change"
] | 887,276 | 887,277 | u914762730 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> array;
char c_num = S[0];
int tmp_count = 0;
for (int i = 0; i < N; i++) {
if (S[i] == c_num) {
tmp_count++;
} else {
// cerr << tmp_count << endl;
array.push_back(tmp_... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> array;
char c_num = S[0];
int tmp_count = 0;
for (int i = 0; i < N; i++) {
if (S[i] == c_num) {
tmp_count++;
} else {
// cerr << tmp_count << endl;
array.push_back(tmp_... | [
"expression.operation.binary.remove"
] | 887,278 | 887,279 | u293072892 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int cnt = 0;
int now = 1;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int cnt = 0;
int now = 1;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 887,291 | 887,292 | u603234915 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int cnt = 0;
int now = 1;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int cnt = 0;
int now = 1;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 887,293 | 887,294 | u603234915 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++... | [
"variable_declaration.remove"
] | 887,300 | 887,301 | u987412812 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> change;
change.push_back(0);
for (int i = 1; i < N; i++) {
if (S[i - 1] != S[i])
change.push_back(i);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> change;
change.push_back(0);
for (int i = 1; i < N; i++) {
if (S[i - 1] != S[i])
change.push_back(i);
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 887,302 | 887,303 | u650243369 | cpp |
p03074 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inc... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inc... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 887,304 | 887,305 | u112723190 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
string s;
cin >> s;
long long ans = 0;
vector<int> v;
vector<int> zero;
int cnt = 1;
zero.push_back(0);
v.push_back(-1);
long long res = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1] && s[i] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
string s;
cin >> s;
long long ans = 0;
vector<int> v;
vector<int> zero;
int cnt = 1;
zero.push_back(0);
v.push_back(-1);
long long res = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1] && s[i] =... | [
"expression.operation.binary.remove"
] | 887,306 | 887,307 | u676029460 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
string s;
cin >> s;
long long ans = 0;
vector<int> v;
vector<int> zero;
int cnt = 1;
zero.push_back(0);
v.push_back(0);
long long res = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1] && s[i] ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
string s;
cin >> s;
long long ans = 0;
vector<int> v;
vector<int> zero;
int cnt = 1;
zero.push_back(0);
v.push_back(-1);
long long res = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1] && s[i] =... | [
"literal.number.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove"
] | 887,308 | 887,307 | u676029460 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int i, j, N, K, len, zero, m;
string s;
cin >> N >> K >> s;
vector<int> d;
len = s.length();
d.push_back(1);
for (i = 0; i < len - 1; i++) {
if (s[i] != s[i + 1])
d.push_back(i + 1);
}
zero = d.si... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int i, j, N, K, len, zero, m;
string s;
cin >> N >> K >> s;
vector<int> d;
len = s.length();
d.push_back(1);
for (i = 0; i < len - 1; i++) {
if (s[i] != s[i + 1])
d.push_back(i + 2);
}
zero = d.si... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 887,320 | 887,321 | u677149117 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> arr;
arr.push_back(0);
for (int i = 1; i < N; i++) {
if (s[i - 1] != s[i])
arr.push_back(i);
}
if (arr.size() == 1) {
cout << N << endl;
return 0;
}
int ans = -1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> arr;
arr.push_back(0);
for (int i = 1; i < N; i++) {
if (s[i - 1] != s[i])
arr.push_back(i);
}
if (arr.size() == 1) {
cout << N << endl;
return 0;
}
int ans = -1;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 887,335 | 887,336 | u077536797 | cpp |
p03074 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 887,339 | 887,340 | u918357423 | cpp |
p03074 | #include <stdio.h>
int main() {
int num, step;
char S[100001], U[100001];
int T[100001];
scanf("%d %d\n", &num, &step);
scanf("%s", S);
int Tlen = 0, buff;
for (int i; i < num;) {
buff = S[i];
int j = 0;
while (S[i] == buff) {
i++;
j++;
}
T[Tlen] = j;
U[Tlen] = buff;
... | #include <stdio.h>
int main() {
int num, step;
char S[100001], U[100001];
int T[100001];
scanf("%d %d\n", &num, &step);
scanf("%s", S);
int Tlen = 0, buff;
for (int i; i < num;) {
buff = S[i];
int j = 0;
while (S[i] == buff) {
i++;
j++;
}
T[Tlen] = j;
U[Tlen] = buff;
... | [
"expression.operation.binary.remove"
] | 887,347 | 887,348 | u774305089 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
ll A, B, C, D, E, K;
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
ll A, B, C, D, E, K;
cin ... | [
"literal.string.change",
"io.output.change"
] | 887,351 | 887,352 | u340980616 | cpp |
p03075 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 887,353 | 887,354 | u103850114 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
bool t = true;
int mayor = 0, menor = 123;
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (d - a <= k)
cout << "Yay!";
else
cout << ":(";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
bool t = true;
int mayor = 0, menor = 123;
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) <= k)
cout << "Yay!";
else
cout << ":(";
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 887,378 | 887,379 | u073134441 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
int k;
for (int i = 0; i < 5; i++)
cin >> a.at(i);
cin >> k;
int m = a.at(0);
int M = a.at(0);
for (int i = 0; i < 5; i++) {
m = min(m, a.at(0));
M = max(M, a.at(0));
}
if (M - m > k)
cout << ":(" << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
int k;
for (int i = 0; i < 5; i++)
cin >> a.at(i);
cin >> k;
int m = a.at(0);
int M = a.at(0);
for (int i = 0; i < 5; i++) {
m = min(m, a.at(i));
M = max(M, a.at(i));
}
if (M - m > k)
cout << ":(" << endl;... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 887,380 | 887,381 | u438313904 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(const char c) {
string s = "'";
s += c;
s += "'";
return s... | #include <bits/stdc++.h>
using namespace std;
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(const char c) {
string s = "'";
s += c;
s += "'";
return s... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,389 | 887,390 | u631438357 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (d - a > k ? ":(" : "Yay!") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (e - a > k ? ":(" : "Yay!") << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 887,394 | 887,395 | u207391881 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= 15)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 887,409 | 887,410 | u294721290 | cpp |
p03075 | #include <cmath>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define llong long long
#define dotp(n) fixed << setprecision(n)
int main() {
int a[5];
rep(i, 5) { cin >> a[i]; }
int k;
cin >> k;
bool existed = false;
for (int i = 0; i < 5; i++) {
for (int j = i ... | #include <cmath>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define llong long long
#define dotp(n) fixed << setprecision(n)
int main() {
int a[5];
rep(i, 5) { cin >> a[i]; }
int k;
cin >> k;
bool existed = false;
for (int i = 0; i < 5; i++) {
for (int j = i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,413 | 887,414 | u748577909 | cpp |
p03075 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a[5], k;
rep... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a[5], k;
rep... | [
"literal.string.change",
"io.output.change"
] | 887,421 | 887,422 | u506765399 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a >= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,423 | 887,424 | u113298224 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0, k, a[5];
for (int i = 0; i < 5; i++)
scanf("%d", &a[i]);
scanf("%d", &k);
for (int i = 0; i < 5; i++) {
for (int j = 1; j < 4; j++) {
if (k < a[j] - a[i]) {
printf(":(\n");
return 0;
}
}
}
printf(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0, k, a[5];
for (int i = 0; i < 5; i++)
scanf("%d", &a[i]);
scanf("%d", &k);
for (int i = 0; i < 5; i++) {
for (int j = 1; j < 5; j++) {
if (k < a[j] - a[i]) {
printf(":(\n");
return 0;
}
}
}
printf(... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 887,425 | 887,426 | u467710662 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0, k, a[5];
for (int i = 0; i < 5; i++)
scanf("%d", &a[i]);
scanf("%d", &k);
for (int i = 0; i < 5; i++) {
for (int j = 1; j < 4; j++) {
if (k < a[j] - a[i]) {
printf(":(\n");
return 0;
}
}
}
printf(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0, k, a[5];
for (int i = 0; i < 5; i++)
scanf("%d", &a[i]);
scanf("%d", &k);
for (int i = 0; i < 5; i++) {
for (int j = 1; j < 5; j++) {
if (k < a[j] - a[i]) {
printf(":(\n");
return 0;
}
}
}
printf(... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 887,427 | 887,426 | u467710662 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
int a[6];
int k;
rep(i, 5) cin >> a[i];
cin >> k;
if (a[4] - a[0] < k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
int a[6];
int k;
rep(i, 5) cin >> a[i];
cin >> k;
if (a[4] - a[0] <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,428 | 887,429 | u411427373 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a >= k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 887,433 | 887,434 | u820341516 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a >= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,435 | 887,434 | u820341516 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (a - e > k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 887,436 | 887,434 | u820341516 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int a, b, c, d, e, k;
int main() {
cin >> a >> b >> c >> d >> e >> k;
if ((a - e) <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int a, b, c, d, e, k;
int main() {
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 887,441 | 887,442 | u477516105 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int k, pos = 0;
vector<int> v(5), d(10, 0);
for (ll i = 0; i < 5; ++i)
cin >> v[i];
cin >> k;
for (ll i = 0; i < 4; ++i) {
for (ll j = i + 1; j < 5; ++j) {
d[pos] =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int k, pos = 0;
vector<int> v(5), d(10, 0);
for (ll i = 0; i < 5; ++i)
cin >> v[i];
cin >> k;
for (ll i = 0; i < 4; ++i) {
for (ll j = i + 1; j < 5; ++j) {
d[pos] =... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 887,443 | 887,444 | u894339989 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a > k - 1)
cout << ":(" << '\n';
else
cout << "Yay!" << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a > k)
cout << ":(" << '\n';
else
cout << "Yay!" << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 887,468 | 887,469 | u551519692 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f > e - a)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f >= e - a)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,474 | 887,475 | u365870732 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f > e - a)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f >= e - a)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 887,476 | 887,475 | u365870732 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k;
vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k;
vector... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 887,479 | 887,480 | u774417629 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int a, b, c, d, e, k;
int A[5];
int main() {
for (int i = 0; i < 5; i++) {
cin >> A[i];
}
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 4; j++) {
if (A[j]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int a, b, c, d, e, k;
int A[5];
int main() {
for (int i = 0; i < 5; i++) {
cin >> A[i];
}
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[j]... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 887,481 | 887,482 | u455366471 | cpp |
p03075 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a[5], C;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> C;
if (a[4] - a[0] <= C)
cout << "Yay" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a[5], C;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> C;
if (a[4] - a[0] <= C)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 887,483 | 887,484 | u407213771 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
int k;
int flag = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if ((a[j] - a[i]) >= k) {
flag++;
}
}
}
if (flag) {
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
int k;
int flag = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if ((a[j] - a[i]) > k) {
flag++;
}
}
}
if (flag) {
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,500 | 887,501 | u573537453 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
int k;
int flag = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if ((a[j] - a[i]) >= k)
flag++;
}
}
if (flag) {
cout << ":(";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
int k;
int flag = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if ((a[j] - a[i]) > k) {
flag++;
}
}
}
if (flag) {
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,502 | 887,501 | u573537453 | cpp |
p03075 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
vector<int> v(5);
for (int i = 0; i < 5; i++) {
scanf("%d", &v[i]);
}
int k;
scanf("%d", &k);
for (int i = 0; i < 5; i++) {
for (int j = 0; j < k; j++) {
if (abs(v[i] - v[j]) > k) {
printf(":(... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
vector<int> v(5);
for (int i = 0; i < 5; i++) {
scanf("%d", &v[i]);
}
int k;
scanf("%d", &k);
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (abs(v[i] - v[j]) > k) {
printf(":(... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 887,503 | 887,504 | u655221557 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":( " << endl;
else
cout << "Yay" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":( " << endl;
else
cout << "Yay!" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 887,505 | 887,506 | u429665788 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k)
cout << "Yay!" << endl;
else
cout << ":(" << e... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) <= k)
cout << "Yay!" << endl;
else
cout << ":(" <... | [
"control_flow.branch.if.condition.change"
] | 887,514 | 887,515 | u199343957 | cpp |
p03075 | #include <iostream>
#include <stdio.h>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
printf("Yay!");
} else {
printf(":(");
... | #include <iostream>
#include <stdio.h>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
printf("Yay!");
} else {
printf(":(");
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,522 | 887,523 | u361826811 | cpp |
p03075 | #include <iostream>
#include <stdio.h>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a >= k) {
printf("Yay!");
} else {
printf(":(");
... | #include <iostream>
#include <stdio.h>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
printf("Yay!");
} else {
printf(":(");
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,524 | 887,523 | u361826811 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a[5];
rep(i, 5) cin >> a[i];
int k;
cin >> k;
bool yes = false;
for (int i = 0; i < 5; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (a[j] - a[i] <= k)
yes = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a[5];
rep(i, 5) cin >> a[i];
int k;
cin >> k;
bool yes = true;
for (int i = 0; i < 5; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (a[j] - a[i] > k)
yes = fa... | [
"misc.opposites",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 887,528 | 887,529 | u139255323 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int m = max(max(max(max(a, b), c), d), e);
int n = min(min(min(min(a, b), c), d), e);
if (m - n <= k) {
cout << "Yey!" << endl;
}
else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int m = max(max(max(max(a, b), c), d), e);
int n = min(min(min(min(a, b), c), d), e);
if (m - n <= k) {
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 887,530 | 887,531 | u165771525 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool flag = false;
int diff = e - a;
if (diff < k) {
flag = true;
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool flag = false;
int diff = e - a;
if (diff <= k) {
flag = true;
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,532 | 887,533 | u275212209 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
int K;
cin >> a >> b >> c >> d >> e >> K;
if (e - a <= K) {
cout << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
int K;
cin >> a >> b >> c >> d >> e >> K;
if (e - a <= K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 887,534 | 887,535 | u266426923 | cpp |
p03075 | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
int main() {
int a, b, c, d, e, k;
std::cin >> a >> b >> c >> d >> e >> k;
if (k >= a + e) {
std::cout << "Yay!" << std::endl;
} else {
std::cout << ":(" << std::endl;
}
}
| #include <algorithm>
#include <array>
#include <iostream>
#include <string>
int main() {
int a, b, c, d, e, k;
std::cin >> a >> b >> c >> d >> e >> k;
if (k >= e - a) {
std::cout << "Yay!" << std::endl;
} else {
std::cout << ":(" << std::endl;
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 887,543 | 887,544 | u840731541 | cpp |
p03075 | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
int main() {
int a, b, c, d, e, k;
std::cin >> a >> b >> c >> d >> e >> k;
if (k > (a + e)) {
std::cout << "Yay!" << std::endl;
} else {
std::cout << ":(" << std::endl;
}
}
| #include <algorithm>
#include <array>
#include <iostream>
#include <string>
int main() {
int a, b, c, d, e, k;
std::cin >> a >> b >> c >> d >> e >> k;
if (k >= e - a) {
std::cout << "Yay!" << std::endl;
} else {
std::cout << ":(" << std::endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,545 | 887,544 | u840731541 | cpp |
p03075 | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 887,546 | 887,547 | u840731541 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, f;
string A;
cin >> a >> b >> c >> d >> e >> f;
if (d - a > f) {
A = ":(";
} else {
A = "Yay!";
}
cout << A << endl;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, f;
string A;
cin >> a >> b >> c >> d >> e >> f;
if (e - a > f) {
A = ":(";
} else {
A = "Yay!";
}
cout << A << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 887,558 | 887,559 | u322171361 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, f;
string A;
cin >> a >> b >> c >> d >> e >> f;
if (abs(a - b) > f) {
A = ":(";
} else {
A = "Yay!";
}
cout << A << endl;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, f;
string A;
cin >> a >> b >> c >> d >> e >> f;
if (e - a > f) {
A = ":(";
} else {
A = "Yay!";
}
cout << A << endl;
} | [
"control_flow.branch.if.condition.change",
"call.arguments.change",
"identifier.change"
] | 887,561 | 887,559 | u322171361 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(5);
for (int i = 0; i < 5; i++)
cin >> V[i];
sort(V.begin(), V.end());
int K;
cin >> K;
if (V.back() - V.front() < K) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(5);
for (int i = 0; i < 5; i++)
cin >> V[i];
sort(V.begin(), V.end());
int K;
cin >> K;
if (V.back() - V.front() <= K) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,566 | 887,567 | u599568485 | cpp |
p03075 | #include <iostream>
//#include <iomanip>
//#include <algorithm>
//#include <numeric>
//#include <queue>
//#include <stack>
//#include <math.h>
#include <vector>
//#include <string>
// typedef long long LL;
using namespace std;
int main() {
vector<int> a(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
... | #include <iostream>
//#include <iomanip>
//#include <algorithm>
//#include <numeric>
//#include <queue>
//#include <stack>
//#include <math.h>
#include <vector>
//#include <string>
// typedef long long LL;
using namespace std;
int main() {
vector<int> a(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,570 | 887,571 | u755310927 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int p[10];
for (int i = 0; i < 5; i++)
cin >> p[i];
int k;
cin >> k;
if (p[4] - p[0] <= k)
cout << "Yay!" << endl;
else
cout << ":)" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int p[10];
for (int i = 0; i < 5; i++)
cin >> p[i];
int k;
cin >> k;
if (p[4] - p[0] <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 887,572 | 887,573 | u030716762 | cpp |
p03075 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | [
"literal.string.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 887,574 | 887,575 | u371702445 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
vector<int> ant(5);
for (int i = 0; i < 5; i++) {
cin >> ant[i];
}
int k;
cin >> k;
int distance = ant[4] - ant[0];
if (distance <= k) {
cout << "Yey!" << endl;
} e... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
vector<int> ant(5);
for (int i = 0; i < 5; i++) {
cin >> ant[i];
}
int k;
cin >> k;
int distance = ant[4] - ant[0];
if (distance <= k) {
cout << "Yay!" << endl;
} e... | [
"literal.string.change",
"io.output.change"
] | 887,578 | 887,579 | u625522718 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
vector<int> ant(5);
for (int i = 0; i < 5; i++) {
cin >> ant[i];
}
int k;
cin >> k;
int distance = ant[4] - ant[0];
if (distance > k) {
cout << ":(" << endl;
} else... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
vector<int> ant(5);
for (int i = 0; i < 5; i++) {
cin >> ant[i];
}
int k;
cin >> k;
int distance = ant[4] - ant[0];
if (distance <= k) {
cout << "Yay!" << endl;
} e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 887,580 | 887,579 | u625522718 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int ar[5], k;
for (int i = 0; i < 5; i++) {
cin >> ar[i];
}
cin >> k;
if (ar[4] - ar[0] > 15)
cout << ":(";
else
cout << "Yay!";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int ar[5], k;
for (int i = 0; i < 5; i++) {
cin >> ar[i];
}
cin >> k;
if (ar[4] - ar[0] > k)
cout << ":(";
else
cout << "Yay!";
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 887,584 | 887,585 | u118192443 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5], k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
cout << (a[4] - a[0] > k ? "Yay!" : ":(") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[5], k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
cout << (a[4] - a[0] <= k ? "Yay!" : ":(") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 887,586 | 887,587 | u522506260 | cpp |
p03075 | #include <iostream>
int main() {
int a[5], k;
std::cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
std::cin >> k;
bool flag = true;
for (int i = 1; i < 5; i++) {
for (int j = 0; j < i; j++) {
if (a[j] - a[i] > k) {
flag = false;
}
}
}
if (flag) {
std::cout << "Yay!" << std:... | #include <iostream>
int main() {
int a[5], k;
std::cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
std::cin >> k;
bool flag = true;
for (int i = 1; i < 5; i++) {
for (int j = 0; j < i; j++) {
if (a[i] - a[j] > k) {
flag = false;
}
}
}
if (flag) {
std::cout << "Yay!" << std:... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 887,588 | 887,589 | u205529984 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
string ans = ":(";
if (e - d <= k)
ans = "Yay!";
cout << ans;
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
string ans = ":(";
if (e - a <= k)
ans = "Yay!";
cout << ans;
cout << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 887,590 | 887,591 | u195132800 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yey!" << endl;
else
cout << ":(" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 887,596 | 887,597 | u620626180 | cpp |
p03075 | #include <bits/stdc++.h>
long long x[10000010];
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i < (n); i++)
#define pii pair<long, long>
#define all(x) (x).begin(), (x).end()
#define int long long
#define setout(n, x) setw(n) << setfill(x)
#define Fixed fixed << setprecision(10)
usi... | #include <bits/stdc++.h>
long long x[10000010];
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i < (n); i++)
#define pii pair<long, long>
#define all(x) (x).begin(), (x).end()
#define int long long
#define setout(n, x) setw(n) << setfill(x)
#define Fixed fixed << setprecision(10)
usi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,598 | 887,599 | u600244905 | cpp |
p03075 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 887,605 | 887,606 | u696290869 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (max({a, b, c, d, e}) - min({a, b, c, d, e}) > k) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (max({a, b, c, d, e}) - min({a, b, c, d, e}) > k) {
cout << ":(";
} else {
cout << "Yay!";
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 887,613 | 887,614 | u533749093 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[100], k;
for (int i = 0; i < 5; i++) {
cin >> arr[i];
}
cin >> k;
sort(arr, arr + 5);
if (arr[4] - arr[0] < k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[10], k;
for (int i = 0; i < 5; i++) {
cin >> arr[i];
}
cin >> k;
sort(arr, arr + 4);
if (arr[4] - arr[0] <= k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,621 | 887,622 | u222613738 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[100], k;
for (int i = 0; i < 4; i++) {
cin >> arr[i];
}
cin >> k;
sort(arr, arr + 4);
if (arr[4] - arr[0] <= k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[10], k;
for (int i = 0; i < 5; i++) {
cin >> arr[i];
}
cin >> k;
sort(arr, arr + 4);
if (arr[4] - arr[0] <= k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 887,623 | 887,622 | u222613738 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[100], k;
for (int i = 0; i < 4; i++) {
cin >> arr[i];
}
cin >> k;
sort(arr, arr + 4);
if (arr[4] - arr[0] < k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[10], k;
for (int i = 0; i < 5; i++) {
cin >> arr[i];
}
cin >> k;
sort(arr, arr + 4);
if (arr[4] - arr[0] <= k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,624 | 887,622 | u222613738 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A[5], k;
for (int i = 0; i < 5; i++)
cin >> A[i];
cin >> k;
if (A[0] - A[4] > k) {
cout << ":(";
return 0;
}
cout << "Yay!";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A[5], k;
for (int i = 0; i < 5; i++)
cin >> A[i];
cin >> k;
if (A[4] - A[0] > k) {
cout << ":(";
return 0;
}
cout << "Yay!";
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 887,629 | 887,630 | u798678713 | cpp |
p03075 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"literal.string.change",
"io.output.change"
] | 887,637 | 887,638 | u132033278 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,639 | 887,640 | u801513186 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
// cout << a << b << c << d << e << k << endl;
if ((e - a) < k) {
cout << "Yay!" << endl;
} else if ((e - a) > k) {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
// cout << a << b << c << d << e << k << endl;
if ((e - a) <= k) {
cout << "Yay!" << endl;
} else if ((e - a) > k) {
cout << ":(" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,643 | 887,644 | u966467199 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
if (A - E <= K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
if (E - A <= K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 887,653 | 887,654 | u636605529 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
int e;
int f;
cin >> a >> b >> c >> d >> e >> f;
vector<int> vec = {a, b, c, d, e};
sort(vec.begin(), vec.end());
if (abs((vec.begin()) - (vec.end())) <= f) {
cout << "Yay!" << endl;
}
else {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
int e;
int f;
cin >> a >> b >> c >> d >> e >> f;
vector<int> vec = {a, b, c, d, e};
sort(vec.begin(), vec.end());
if (abs((vec.at(0)) - (vec.at(4))) <= f) {
cout << "Yay!" << endl;
}
else {
cout <<... | [
"call.function.change",
"control_flow.branch.if.condition.change"
] | 887,655 | 887,656 | u530329977 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) \
#a ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) \
#a ... | [
"literal.string.change",
"io.output.change"
] | 887,661 | 887,662 | u167988719 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) \
#a ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) \
#a ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 887,663 | 887,662 | u167988719 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int dis[5];
int k;
rep(i, 5) {
int x;
cin >> x;
dis[i] = x;
}
cin >> k;
if (dis[4] - dis[0] <= k) {
cout << "Yay!";
} else {
cout << ":)";
}
re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int dis[5];
int k;
rep(i, 5) {
int x;
cin >> x;
dis[i] = x;
}
cin >> k;
if (dis[4] - dis[0] <= k) {
cout << "Yay!";
} else {
cout << ":(";
}
re... | [
"literal.string.change",
"io.output.change"
] | 887,664 | 887,665 | u905170328 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (k > e - a)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (k < e - a)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,674 | 887,675 | u980485808 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int k;
cin >> k;
bool err = false;
for (int i = 0; i < 5; i++)
for (int j = i + 1; i < 5; i++) {
if (abs(a[i] - a[j]) > k)
err = true;
}
cout << (err ? ":(" : "Y... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int k;
cin >> k;
bool err = false;
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++) {
if (abs(a[i] - a[j]) > k)
err = true;
}
cout << (err ? ":(" : "Y... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 887,704 | 887,705 | u331948661 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int array[5];
int k;
for (int i = 0; i < 5; i++)
cin >> array[i];
cin >> k;
bool flag = true;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (k <= (array[j] - array[i])) {
flag = false;
break;... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int array[5];
int k;
for (int i = 0; i < 5; i++)
cin >> array[i];
cin >> k;
bool flag = true;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (k < (array[j] - array[i])) {
flag = false;
break;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,719 | 887,720 | u932033261 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define pi 3.1415926536
#define ff first
#define ss second
#defin... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define pi 3.1415926536
#define ff first
#define ss second
#defin... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 887,723 | 887,722 | u075520262 | cpp |
p03075 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,734 | 887,735 | u950174376 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.