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 9
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<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define shandom_ruffle random_shuffle
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k)
cout << ":(" << endl;
else
cout << "Yay" << endl;
return 0;
}
// read the question correctly (ll vs int)
// template by super1 derived from bqi343
| #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<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define shandom_ruffle random_shuffle
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
}
// read the question correctly (ll vs int)
// template by super1 derived from bqi343
| [
"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
using namespace ::std;
int jo(ll int jxo, ll int jyo) {
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { return (toxbig - 0x20); }
char tolow(char toxlow) { return (toxlow + 0x20); }
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << ((k - a) > k ? ":(" : "Yay!");
}
// int *p = new int[N];
// vector<int> 変数名(要素数);
// sort(変数名.begin(),変数名.end());//昇順ソート
// vector<vector<int>> 変数名(左の個数, vector<int>(右の個数));
//
| #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
using namespace ::std;
int jo(ll int jxo, ll int jyo) {
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { return (toxbig - 0x20); }
char tolow(char toxlow) { return (toxlow + 0x20); }
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << ((e - a) > k ? ":(" : "Yay!");
}
// int *p = new int[N];
// vector<int> 変数名(要素数);
// sort(変数名.begin(),変数名.end());//昇順ソート
// vector<vector<int>> 変数名(左の個数, vector<int>(右の個数));
//
| [
"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 DEBUG
#define line() cerr << "[" << __LINE__ << "] ";
#define dump(i) cerr << #i ": " << i << " ";
#define dumpl(i) cerr << #i ": " << i << endl;
#else
#define line(i)
#define dump(i)
#define dumpl(i)
#endif
#define MOD 1000000007ll
using namespace std;
int main(int argc, char const *argv[]) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (d - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| #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 DEBUG
#define line() cerr << "[" << __LINE__ << "] ";
#define dump(i) cerr << #i ": " << i << " ";
#define dumpl(i) cerr << #i ": " << i << endl;
#else
#define line(i)
#define dump(i)
#define dumpl(i)
#endif
#define MOD 1000000007ll
using namespace std;
int main(int argc, char const *argv[]) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| [
"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;
return 0;
} | #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;
return 0;
} | [
"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++;
}
// printf("%d - %d = %d \n" , arr[i], arr[j] ,abs(arr[i] - arr[j]));
}
}
if (count > 0) {
printf(":(");
} else {
printf("Yay!");
}
} | #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 = %d \n" , arr[j], arr[i] ,arr[j] - arr[i]);
}
}
}
if (count > 0) {
printf(":(");
} else {
printf("Yay!");
}
}
| [
"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)
const ll MOD = 1000000007;
ll maxx(ll x, ll y, ll z) { return max(max(x, y), z); }
ll minn(ll x, ll y, ll z) { return min(min(x, y), z); }
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * (y / gcd(x, y)); }
// a,b x
int main() {
ll c, d, e, f, g, k;
cin >> c >> d >> e >> f >> g >> k;
if (g - c > k)
cout << "Yay!";
else
cout << ":(";
} | #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)
const ll MOD = 1000000007;
ll maxx(ll x, ll y, ll z) { return max(max(x, y), z); }
ll minn(ll x, ll y, ll z) { return min(min(x, y), z); }
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * (y / gcd(x, y)); }
// a,b x
int main() {
ll c, d, e, f, g, k;
cin >> c >> d >> e >> f >> g >> k;
if (!(g - c > k))
cout << "Yay!";
else
cout << ":(";
} | [
"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<int> d(v.size() + 2, 0);
for (int i = 1; i <= v.size(); ++i) {
d[i] += d[i - 1] + v[i - 1];
}
d[d.size() - 1] = d[d.size() - 2];
int k = 0;
int flg = 1 - (int)(s[0] - '0');
int res = 0;
for (int i = 1; i < d.size(); ++i) {
if (i % 2 == flg) {
++k;
}
if (k <= K) {
res = max(res, d[i]);
} else {
int tmp = d[i + 1];
if (i % 2 == flg) {
tmp -= d[i - 2 * K];
} else {
tmp -= d[i - 2 * K - 1];
}
res = max(res, tmp);
}
}
cout << res << endl;
return 0;
}
| #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<ll> d(v.size() + 2, 0);
for (int i = 1; i <= v.size(); ++i) {
d[i] += d[i - 1] + v[i - 1];
}
d[d.size() - 1] = d[d.size() - 2];
int k = 0;
int flg = 1 - (int)(s[0] - '0');
ll res = 0;
for (int i = 1; i < d.size(); ++i) {
if (i % 2 == flg) {
++k;
}
if (k <= K) {
res = max(res, d[i]);
} else {
ll tmp = d[i];
if (i % 2 == flg) {
tmp -= d[i - 2 * K];
} else {
tmp -= d[i - 2 * K - 1];
}
res = max(res, tmp);
}
}
cout << res << endl;
return 0;
}
| [
"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) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 1e9 + 7;
ll N, K;
string s;
int main(void) {
cin >> N >> K;
cin >> s;
ll f = 0;
if (s[0] == '0') {
s = '1' + s;
N++;
f = 1;
}
ll i;
vector<ll> v;
for (i = 0; i < N;) {
if (s[i] == '0') {
ll cnt = 0;
while (i < N && s[i] == '0') {
cnt++;
i++;
}
v.pb(cnt);
} else if (s[i] == '1') {
ll cnt = 0;
while (i < N && s[i] == '1') {
cnt++;
i++;
}
v.pb(cnt);
}
}
if (v.size() <= K * 2 + 1) {
if (f)
N--;
pt(N);
return 0;
}
ll ans = 0;
ll t = 0;
for (i = 0; i < K * 2 + 1; i++)
t += v[i];
if (f)
ans = t - 1;
else
ans = t;
for (i = K * 2 + 1; i < v.size(); i++) {
t -= v[i - K * 2 - 1];
t -= v[i - K * 2];
if (i + 1 < v.size())
t += v[i + 1];
t += v[i];
chmax(ans, t);
}
pt(ans);
}
| #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) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 1e9 + 7;
ll N, K;
string s;
int main(void) {
cin >> N >> K;
cin >> s;
ll f = 0;
if (s[0] == '0') {
s = '1' + s;
N++;
f = 1;
}
ll i;
vector<ll> v;
for (i = 0; i < N;) {
if (s[i] == '0') {
ll cnt = 0;
while (i < N && s[i] == '0') {
cnt++;
i++;
}
v.pb(cnt);
} else if (s[i] == '1') {
ll cnt = 0;
while (i < N && s[i] == '1') {
cnt++;
i++;
}
v.pb(cnt);
}
}
if (v.size() <= K * 2 + 1) {
if (f)
N--;
pt(N);
return 0;
}
ll ans = 0;
ll t = 0;
for (i = 0; i < K * 2 + 1; i++)
t += v[i];
if (f)
ans = t - 1;
else
ans = t;
for (i = K * 2 + 1; i < v.size(); i += 2) {
t -= v[i - K * 2 - 1];
t -= v[i - K * 2];
if (i + 1 < v.size())
t += v[i + 1];
t += v[i];
chmax(ans, t);
}
pt(ans);
}
| [] | 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;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
hz++;
if (i == n || a[i] != a[i + 1]) {
A[++te] = mp(a[i], hz);
// cout<<A[te].se<<"\n";
hz = 0;
}
}
for (i = 1; i <= te; i++)
p[i] = p[i - 1] + A[i].se;
for (i = 1; i <= te; i++) {
ll R = min(n, i + k * 2);
if (A[i].fi == '0')
R = min(n, i + k * 2 - 1);
has = max(has, p[R] - p[i - 1]);
}
cout << has << "\n";
}
| #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;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
hz++;
if (i == n || a[i] != a[i + 1]) {
A[++te] = mp(a[i], hz);
// cout<<A[te].se<<"\n";
hz = 0;
}
}
for (i = 1; i <= te; i++)
p[i] = p[i - 1] + A[i].se;
for (i = 1; i <= te; i++) {
ll R = min(te, i + k * 2);
if (A[i].fi == '0')
R = min(te, i + k * 2 - 1);
has = max(has, p[R] - p[i - 1]);
}
cout << has << "\n";
}
| [
"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);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
vec.push_back(cnt);
}
if (vec.size() % 2 == 0) {
vec.push_back(0);
}
int add = 2 * k + 1;
int ans = 0;
for (int i = 0; i < vec.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add, (int)vec.size());
for (int j = left; j < right; j++) {
tmp += vec[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
} | #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);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
vec.push_back(cnt);
}
if (vec.size() % 2 == 0) {
vec.push_back(0);
}
int add = 2 * k + 1;
int ans = 0;
for (int i = 0; i < vec.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add, (int)vec.size());
for (int j = left; j < right; j++) {
tmp += vec[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
} | [
"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); }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
struct edge {
int to, cost;
};
class dijkstra {
int V;
int d[100002];
priority_queue<P, vector<P>, greater<P>> que;
void update(int s, vector<edge> G[]) {
fill(d, d + V + 1, 100000000000ll);
d[s] = 0;
que.push(make_pair(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
rep(i, G[v].size()) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
public:
dijkstra(int v, int s, vector<edge> G[]) {
V = v;
update(s, G);
}
int find(int e) {
return d[e];
;
}
};
int cnt2[100000];
signed main() {
int n, k, cnt1, cnt22 = 0, cnt3;
string s;
cin >> n >> k >> s;
cnt2[0] = 1;
rep(i, n) {
if (i == 0 && s[i] == '0')
cnt1 = 1;
else if (i == 0)
cnt1 = 0;
else {
if (s[i] != s[i - 1]) {
cnt22++;
cnt2[cnt22] = 1;
} else
cnt2[cnt22]++;
}
}
if (s[n - 1] == '0')
cnt3 = 1;
else
cnt3 = 0;
int ans = 0;
int l = 0, r = 0;
if (cnt22 < k * 2) {
cout << n << endl;
return 0;
}
if (cnt1) {
l = 1;
int cnt = 0;
rep(i, k * 2) { cnt += cnt2[i]; }
ans = cnt;
}
if (cnt3) {
r = 1;
int cnt = 0;
rep(i, k * 2) { cnt += cnt2[n - 1 - i]; }
ans = max(ans, cnt);
}
rep(i, (n - l - r - k * 2 + 1) / 2 + 1) {
int cnt = 0;
rep(j, k * 2 + 1) { cnt += cnt2[i + l + j]; }
ans = max(ans, cnt);
}
cout << ans << endl;
}
| #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); }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
struct edge {
int to, cost;
};
class dijkstra {
int V;
int d[100002];
priority_queue<P, vector<P>, greater<P>> que;
void update(int s, vector<edge> G[]) {
fill(d, d + V + 1, 100000000000ll);
d[s] = 0;
que.push(make_pair(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
rep(i, G[v].size()) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
public:
dijkstra(int v, int s, vector<edge> G[]) {
V = v;
update(s, G);
}
int find(int e) {
return d[e];
;
}
};
int cnt2[100000];
signed main() {
int n, k, cnt1, cnt22 = 0, cnt3;
string s;
cin >> n >> k >> s;
cnt2[0] = 1;
rep(i, n) {
if (i == 0 && s[i] == '0')
cnt1 = 1;
else if (i == 0)
cnt1 = 0;
else {
if (s[i] != s[i - 1]) {
cnt22++;
cnt2[cnt22] = 1;
} else
cnt2[cnt22]++;
}
}
if (s[n - 1] == '0')
cnt3 = 1;
else
cnt3 = 0;
int ans = 0;
int l = 0, r = 0;
if (cnt22 < k * 2) {
cout << n << endl;
return 0;
}
if (cnt1) {
l = 1;
int cnt = 0;
rep(i, k * 2) { cnt += cnt2[i]; }
ans = cnt;
}
if (cnt3) {
r = 1;
int cnt = 0;
rep(i, k * 2) { cnt += cnt2[n - 1 - i]; }
ans = max(ans, cnt);
}
rep(i, (n - l - r - k * 2 + 1) / 2 + 1) {
int cnt = 0;
rep(j, k * 2 + 1) { cnt += cnt2[i * 2 + l + j]; }
ans = max(ans, cnt);
}
cout << ans << endl;
}
| [
"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[i] == (char)('0' + now))
cnt++;
else {
num.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
num.push_back(cnt);
if (num.size() % 2 == 0)
num.push_back(0);
int left = 0;
int right = 0;
int add = 2 * K + 1;
int ans = 0;
int tmp = 0;
for (int i = 0; i < num.size(); i += 2) {
int nextleft = i;
int nextright = min(i + add, (int)num.size());
tmp = 0;
while (left < nextleft) {
tmp -= num[left];
left++;
}
while (right < nextright) {
tmp += num[right];
right++;
}
ans = max(ans, tmp);
}
cout << ans << endl;
} | #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[i] == (char)('0' + now))
cnt++;
else {
num.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
num.push_back(cnt);
if (num.size() % 2 == 0)
num.push_back(0);
int left = 0;
int right = 0;
int add = 2 * K + 1;
int ans = 0;
int tmp = 0;
for (int i = 0; i < num.size(); i += 2) {
int nextleft = i;
int nextright = min(i + add, (int)num.size());
while (left < nextleft) {
tmp -= num[left];
left++;
}
while (right < nextright) {
tmp += num[right];
right++;
}
ans = max(ans, tmp);
}
cout << ans << endl;
} | [] | 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;
}
}
if (cnt != 0)
Nums.push_back(cnt);
// if (Nums.size() % 2 == 0) Nums.push_back(0);
vector<int> Sums(Nums.size() + 1);
for (int i = 0; i < Nums.size(); ++i) {
Sums[i + 1] = Sums[i] + Nums[i];
}
int add = 2 * K + 1;
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + add, (int)Sums.size());
int tmp = Sums[right] - Sums[left];
ans = max(ans, tmp);
}
cout << ans << endl;
} | #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;
}
}
if (cnt != 0)
Nums.push_back(cnt);
vector<int> Sums(Nums.size() + 1);
for (int i = 0; i < Nums.size(); ++i) {
Sums[i + 1] = Sums[i] + Nums[i];
}
int add = 2 * K + 1;
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + add, (int)Sums.size() - 1);
int tmp = Sums[right] - Sums[left];
ans = max(ans, tmp);
}
cout << ans << endl;
} | [
"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;
tmp = S.at(i);
}
}
a.push_back(cnt);
/*////////////////////////////////////////
for (auto&i:a) {
cout << i << " ";
}
cout << "\n";*/
int add = K * 2 + 1;
vector<int> sums(a.size() + 1);
for (int i = 0; i < a.size(); i++) {
sums.at(i + 1) = sums.at(i) + a.at(i);
}
/*////////////////////////////////////////
for (auto&i : sums) {
cout << i << " ";
}
cout << "\n";*/
int left = 0, right = 0;
int ans = 0;
for (int i = 0; i < a.size(); i++) {
left = i;
right = min((int)a.size(), i + add);
int tmp = sums.at(right) - sums.at(left);
ans = max(ans, tmp);
}
cout << ans << "\n";
return 0;
} | #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;
tmp = S.at(i);
}
}
a.push_back(cnt);
/*///////////////////////////////////////
for (auto&i:a) {
cout << i << " ";
}
cout << "\n";*/
int add = K * 2 + 1;
vector<int> sums(a.size() + 1);
for (int i = 0; i < a.size(); i++) {
sums.at(i + 1) = sums.at(i) + a.at(i);
}
/*///////////////////////////////////////
for (auto&i : sums) {
cout << i << " ";
}
cout << "\n";*/
int left = 0, right = 0;
int ans = 0;
for (int i = 0; i < a.size(); i += 2) {
left = i;
right = min((int)a.size(), i + add);
int tmp = sums.at(right) - sums.at(left);
ans = max(ans, tmp);
}
cout << ans << "\n";
return 0;
} | [] | 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()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
//-------------------------------------------------------
int N, K;
string S;
vector<pair<int, int>> C;
ll SS[101010];
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N >> K >> S;
FORR(s, S) {
if (C.empty() || C.back().first != s)
C.push_back({s, 0});
C.back().second++;
}
ll ma = 0;
FOR(i, C.size()) {
SS[i + 1] = SS[i] + C[i].second;
int tar;
if (C[i].first == '0') {
tar = max(0, i + 1 - (2 * K - 1));
} else {
tar = max(0, i + 1 - (2 * K + 1));
}
ma = max(ma, SS[i + 1] - SS[tar]);
}
cout << ma << endl;
}
int main(int argc, char **argv) {
string s;
int i;
if (argc == 1)
ios::sync_with_stdio(false), cin.tie(0);
FOR(i, argc - 1) s += argv[i + 1], s += '\n';
FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);
cout.tie(0);
solve();
return 0;
}
| #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()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
//-------------------------------------------------------
int N, K;
string S;
vector<pair<int, int>> C;
ll SS[101010];
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N >> K >> S;
FORR(s, S) {
if (C.empty() || C.back().first != s)
C.push_back({s, 0});
C.back().second++;
}
ll ma = 0;
FOR(i, C.size()) {
SS[i + 1] = SS[i] + C[i].second;
int tar;
if (C[i].first == '0') {
tar = max(0, i + 1 - (2 * K));
} else {
tar = max(0, i + 1 - (2 * K + 1));
}
ma = max(ma, SS[i + 1] - SS[tar]);
}
cout << ma << endl;
}
int main(int argc, char **argv) {
string s;
int i;
if (argc == 1)
ios::sync_with_stdio(false), cin.tie(0);
FOR(i, argc - 1) s += argv[i + 1], s += '\n';
FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);
cout.tie(0);
solve();
return 0;
}
| [
"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(cnt);
pos++;
}
if (s.back() == '0') {
ret.push_back(0);
}
for (int i = 1; i < ret.size(); ++i) {
ret[i] += ret[i - 1];
}
return ret;
}
int solve(string s, int k) {
vector<int> codes = to_code(s);
// cout<<codes.size()<<endl;
if (2 * k + 1 >= codes.size()) {
return codes.back();
}
int head = 0;
int ans = 0;
for (int i = 2 * k + 1; i < codes.size(); i += 2, head += 2) {
ans = max(ans, codes[i] - codes[head]);
}
return ans;
}
int main() {
int n, k;
string s;
cin >> n >> k >> s;
cout << solve(s, k) << endl;
;
} | #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(cnt);
pos++;
}
if (s[s.size() - 2] == '0') {
ret.push_back(0);
}
for (int i = 1; i < ret.size(); ++i) {
ret[i] += ret[i - 1];
}
return ret;
}
int solve(string s, int k) {
vector<int> codes = to_code(s);
// cout<<codes.size()<<endl;
if (2 * k + 1 >= codes.size()) {
return codes.back();
}
int head = 0;
int ans = 0;
for (int i = 2 * k + 1; i < codes.size(); i += 2, head += 2) {
ans = max(ans, codes[i] - codes[head]);
}
return ans;
}
int main() {
int n, k;
string s;
cin >> n >> k >> s;
cout << solve(s, k) << endl;
;
} | [
"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_count);
c_num = S[i];
tmp_count = 1;
}
}
// cerr << tmp_count << endl;
array.push_back(tmp_count);
int max_num = 0;
int num = 0;
int first = (S[0] == '0' ? 0 : 1);
int now = first;
int k = 0;
for (int i = 0; i < array.size(); i++) {
if (now == 0) {
num += array[i];
if (++k > K) {
if (first == 0) {
num -= array[i - 2 * (K - 1)];
first = 1;
} else {
// cerr << array[i-2*K] << ' ' << array[i-(2*K+1)] << ' ';
num -= array[i - 2 * K] + array[i - (2 * K + 1)];
}
}
} else {
num += array[i];
}
// cerr << now << ' ' << num << endl;
max_num = max(max_num, num);
now = (now + 1) % 2;
}
cout << max_num << endl;
return 0;
} | #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_count);
c_num = S[i];
tmp_count = 1;
}
}
// cerr << tmp_count << endl;
array.push_back(tmp_count);
int max_num = 0;
int num = 0;
int first = (S[0] == '0' ? 0 : 1);
int now = first;
int k = 0;
for (int i = 0; i < array.size(); i++) {
if (now == 0) {
num += array[i];
if (++k > K) {
if (first == 0) {
num -= array[i - 2 * K];
first = 1;
} else {
// cerr << array[i-2*K] << ' ' << array[i-(2*K+1)] << ' ';
num -= array[i - 2 * K] + array[i - (2 * K + 1)];
}
}
} else {
num += array[i];
}
// cerr << now << ' ' << num << endl;
max_num = max(max_num, num);
now = (now + 1) % 2;
}
cout << max_num << endl;
return 0;
} | [
"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.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * k + 1;
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < sum.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
int temp = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int temp = sum[right] - sum[left];
ans = max(ans, temp);
}
cout << ans << '\n';
}
| #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.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * k + 1;
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < Nums.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
int temp = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int temp = sum[right] - sum[left];
ans = max(ans, temp);
}
cout << ans << '\n';
}
| [
"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.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * k + 1;
int ans = 0;
int left = 0;
int right = 0;
int temp = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int Nextleft = i;
int Nextright = min(i + Add, (int)Nums.size());
// 左端を移動
while (Nextleft > left) {
temp -= Nums[left];
left++;
}
// 右端を移動
while (Nextleft > right) {
temp += Nums[right];
right++;
}
ans = max(ans, temp);
}
cout << ans << '\n';
}
| #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.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * k + 1;
int ans = 0;
int left = 0;
int right = 0;
int temp = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int Nextleft = i;
int Nextright = min(i + Add, (int)Nums.size());
// 左端を移動
while (Nextleft > left) {
temp -= Nums[left];
left++;
}
// 右端を移動
while (Nextright > right) {
temp += Nums[right];
right++;
}
ans = max(ans, temp);
}
cout << ans << '\n';
}
| [
"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++;
else {
Nums.push_back(cnt);
now = 1 - now; // 0と1を切り替える時の計算 now ^= 1;
cnt = 1; //新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1って感じの配列が欲しい
// 1-0-1-0みたいに0で終わってたら、適当に１つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
int left = 0;
int right = 0;
int tmp = 0; // [left, right) のsum
// 1-0-1...の1から始めるので、偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int Nextleft = i;
int Nextright = min(i + Add, (int)Nums.size());
//左端を移動する
while (Nextleft > left) {
tmp -= Nums[left];
left++;
}
//右端を移動する
while (Nextright > right) {
tmp += Nums[right];
right++;
}
ans = max(tmp, ans);
}
cout << ans << endl;
}
| #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++;
else {
Nums.push_back(cnt);
now = 1 - now; // 0と1を切り替える時の計算 now ^= 1;
cnt = 1; //新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1って感じの配列が欲しい
// 1-0-1-0みたいに0で終わってたら、適当に１つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
int left = 0;
int right = 0;
int tmp = 0; // [left, right) のsum
// 1-0-1...の1から始めるので、偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
int Nextleft = i;
int Nextright = min(i + Add, (int)Nums.size());
//左端を移動する
while (Nextleft > left) {
tmp -= Nums[left];
left++;
}
//右端を移動する
while (Nextright > right) {
tmp += Nums[right];
right++;
}
ans = max(tmp, ans);
}
cout << ans << endl;
}
| [
"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);
}
int R = (int)change.size();
int ans = 0;
for (int i = 0; i < R; i++) {
if (S[i] == '1')
if (i + 2 * K + 1 < R) {
ans = max(ans, change[i + 2 * K + 1] - change[i]);
} else
ans = max(ans, N - change[i]);
if (S[i] == '0') {
if (i + 2 * K < R) {
ans = max(ans, change[i + 2 * K] - change[i]);
} else
ans = max(ans, N - change[i]);
}
}
cout << ans << endl;
} | #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);
}
int R = (int)change.size();
int ans = 0;
for (int i = 0; i < R; i++) {
if (S[change[i]] == '1')
if (i + 2 * K + 1 < R) {
ans = max(ans, change[i + 2 * K + 1] - change[i]);
} else
ans = max(ans, N - change[i]);
if (S[change[i]] == '0') {
if (i + 2 * K < R) {
ans = max(ans, change[i + 2 * K] - change[i]);
} else
ans = max(ans, N - change[i]);
}
}
cout << ans << endl;
} | [
"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>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
char s[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
scanf("%s", s);
int k = 0, ret = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '0') {
--m;
while (i < n && s[i] == '0')
++i;
--i;
}
if (m < 0) {
if (s[k] == '0') {
++m;
while (k < n && s[k] == '0')
++k;
--k;
}
++k;
}
ret = max(ret, i - k + 1);
}
printf("%d\n", ret);
return 0;
}
| #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>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
char s[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
scanf("%s", s);
int k = 0, ret = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '0') {
--m;
while (i < n && s[i] == '0')
++i;
--i;
}
while (m < 0) {
if (s[k] == '0') {
++m;
while (k < n && s[k] == '0')
++k;
--k;
}
++k;
}
ret = max(ret, i - k + 1);
}
printf("%d\n", ret);
return 0;
}
| [
"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] == '1') {
v.push_back(i - 1);
zero.push_back(cnt);
cnt = 1;
res = 1;
}
if (s[i] == s[i - 1] && s[i] == '1')
res++, ans = max(res, ans);
if (s[i] == s[i - 1] && s[i - 1] == '0')
cnt++;
}
if (s[n - 1] == '0')
zero.push_back(cnt + 1), v.push_back(n - 1);
v.push_back(n - 1);
zero.push_back(0);
if (n == 1 && s[n - 1] == '1')
ans++;
if (v.size() <= k + 1) {
cout << n << endl;
return 0;
}
// cerr<<v.size();
if (v.size() - k - 1 >= 0)
ans = n - v[v.size() - k - 1];
// cerr<<ans<<endl;
for (int i = v.size() - 1; i - 1 - k >= 0; i--) {
ans = max(ans, (long long)v[i] - v[i - 1 - k] - zero[i]);
cerr << i << " " << ans << " " << v[i] << " " << v[i - 1 - k] << " "
<< zero[i] << endl;
}
cout << ans << endl;
} | #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] == '1') {
v.push_back(i - 1);
zero.push_back(cnt);
cnt = 1;
res = 1;
}
if (s[i] == s[i - 1] && s[i] == '1')
res++, ans = max(res, ans);
if (s[i] == s[i - 1] && s[i - 1] == '0')
cnt++;
}
if (s[n - 1] == '0')
zero.push_back(cnt), v.push_back(n - 1);
v.push_back(n - 1);
zero.push_back(0);
if (n == 1 && s[n - 1] == '1')
ans++;
if (v.size() <= k + 1) {
cout << n << endl;
return 0;
}
// cerr<<v.size();
if (v.size() - k - 1 >= 0)
ans = n - v[v.size() - k - 1];
// cerr<<ans<<endl;
for (int i = v.size() - 1; i - 1 - k >= 0; i--) {
ans = max(ans, (long long)v[i] - v[i - 1 - k] - zero[i]);
cerr << i << " " << ans << " " << v[i] << " " << v[i - 1 - k] << " "
<< zero[i] << endl;
}
cout << ans << endl;
} | [
"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] == '1') {
v.push_back(i - 1);
zero.push_back(cnt);
cnt = 1;
res = 1;
}
if (s[i] == s[i - 1] && s[i] == '1')
res++, ans = max(res, ans);
if (s[i] == s[i - 1] && s[i - 1] == '0')
cnt++;
}
if (s[n - 1] == '0')
zero.push_back(0), v.push_back(n - 1);
v.push_back(n - 1);
zero.push_back(0);
if (n == 1 && s[n - 1] == '1')
ans++;
if (v.size() <= k + 1) {
cout << n << endl;
return 0;
}
// cerr<<v.size();
if (v.size() - k - 1 >= 0)
ans = n - v[v.size() - k - 1];
// cerr<<ans<<endl;
for (int i = v.size() - 1; i - 1 - k >= 0; i--) {
ans = max(ans, (long long)v[i] - v[i - 1 - k] - zero[i]);
cerr << i << " " << ans << " " << v[i] << " " << v[i - 1 - k] << " "
<< zero[i] << endl;
}
cout << ans << endl;
} | #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] == '1') {
v.push_back(i - 1);
zero.push_back(cnt);
cnt = 1;
res = 1;
}
if (s[i] == s[i - 1] && s[i] == '1')
res++, ans = max(res, ans);
if (s[i] == s[i - 1] && s[i - 1] == '0')
cnt++;
}
if (s[n - 1] == '0')
zero.push_back(cnt), v.push_back(n - 1);
v.push_back(n - 1);
zero.push_back(0);
if (n == 1 && s[n - 1] == '1')
ans++;
if (v.size() <= k + 1) {
cout << n << endl;
return 0;
}
// cerr<<v.size();
if (v.size() - k - 1 >= 0)
ans = n - v[v.size() - k - 1];
// cerr<<ans<<endl;
for (int i = v.size() - 1; i - 1 - k >= 0; i--) {
ans = max(ans, (long long)v[i] - v[i - 1 - k] - zero[i]);
cerr << i << " " << ans << " " << v[i] << " " << v[i - 1 - k] << " "
<< zero[i] << endl;
}
cout << ans << endl;
} | [
"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.size();
for (j = zero; j <= zero + 2 * K + 1; j++)
d.push_back(len);
m = 1;
for (j = 0; j < zero; j++) {
// for (j=i+1;j<zero && j-i <= K+1;j++) {
// m = max(m,d[j]-d[i]);
// }
if (s[d[j] - 1] == '1') {
m = max(m, d[j + 2 * K + 1] - d[j]);
} else {
m = max(m, d[j + 2 * K] - d[j]);
}
}
cout << m << endl;
return 0;
} | #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.size();
for (j = zero; j <= zero + 2 * K + 1; j++)
d.push_back(len + 1);
m = 1;
for (j = 0; j < zero; j++) {
// for (j=i+1;j<zero && j-i <= K+1;j++) {
// m = max(m,d[j]-d[i]);
// }
if (s[d[j] - 1] == '1') {
m = max(m, d[j + 2 * K + 1] - d[j]);
} else {
m = max(m, d[j + 2 * K] - d[j]);
}
}
cout << m << endl;
return 0;
} | [
"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;
for (int i = 0; i < arr.size(); i++) {
if (s[i] == '0') {
if (i + 2 * K > arr.size() - 1) {
ans = max(ans, N - arr[i]);
} else {
ans = max(ans, arr[i + 2 * K] - arr[i]);
}
} else {
if (i + 2 * K + 1 > arr.size() - 1) {
ans = max(ans, N - arr[i]);
} else {
ans = max(ans, arr[i + 2 * K + 1] - arr[i]);
}
}
}
cout << ans << endl;
return 0;
}
| #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;
for (int i = 0; i < arr.size(); i++) {
if (s[arr[i]] == '0') {
if (i + 2 * K > arr.size() - 1) {
ans = max(ans, N - arr[i]);
} else {
ans = max(ans, arr[i + 2 * K] - arr[i]);
}
} else {
if (i + 2 * K + 1 > arr.size() - 1) {
ans = max(ans, N - arr[i]);
} else {
ans = max(ans, arr[i + 2 * K + 1] - arr[i]);
}
}
}
cout << ans << endl;
return 0;
}
| [
"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)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<pair<char, int>> v;
int cnt = 0;
char now = '2';
if (s[0] == '0')
v.push_back({'1', 0});
v.push_back({s[0], 1});
FOR(i, 1, n) {
if (v.back().first != s[i])
v.push_back({s[i], 1});
else
v.back().second++;
}
if (v.size() % 2 == 1) {
v.push_back({'0', 0});
}
assert(v.size() % 2 == 0);
vector<pii> p;
REP(i, v.size() / 2) { p.push_back({v[i * 2].second, v[i * 2 + 1].second}); }
int m = p.size();
vi sum(m + 1, 0);
REP(i, m) sum[i + 1] = sum[i] + p[i].first + p[i].second;
p.push_back({0, 0});
int ans = 0;
REP(i, m) {
chmax(ans, sum[min((ll)m, i + k)] - sum[i] + p[min((ll)m, i + k)].second);
}
cout << ans << endl;
} | #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)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<pair<char, int>> v;
int cnt = 0;
char now = '2';
if (s[0] == '0')
v.push_back({'1', 0});
v.push_back({s[0], 1});
FOR(i, 1, n) {
if (v.back().first != s[i])
v.push_back({s[i], 1});
else
v.back().second++;
}
if (v.size() % 2 == 1) {
v.push_back({'0', 0});
}
assert(v.size() % 2 == 0);
vector<pii> p;
REP(i, v.size() / 2) { p.push_back({v[i * 2].second, v[i * 2 + 1].second}); }
int m = p.size();
vi sum(m + 1, 0);
REP(i, m) sum[i + 1] = sum[i] + p[i].first + p[i].second;
p.push_back({0, 0});
int ans = 0;
REP(i, m) {
chmax(ans, sum[min((ll)m, i + k)] - sum[i] + p[min((ll)m, i + k)].first);
}
cout << ans << endl;
} | [
"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;
Tlen++;
}
int max = 0, sum, vstep;
for (int k = 0; k < Tlen; k++) {
sum = 0;
if (U[k] == '1') {
vstep = step * 2 + 1;
} else if (U[k] == '0' && k == 0) {
vstep = step * 2 + 1;
} else
goto skip;
for (int m = 0; m < vstep && (k + m) < Tlen; m++) {
sum += T[k + m];
}
if (sum > max) {
max = sum;
}
skip:;
}
printf("%d\n", max);
return 0;
} | #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;
Tlen++;
}
int max = 0, sum, vstep;
for (int k = 0; k < Tlen; k++) {
sum = 0;
if (U[k] == '1') {
vstep = step * 2 + 1;
} else if (U[k] == '0' && k == 0) {
vstep = step * 2;
} else
goto skip;
for (int m = 0; m < vstep && (k + m) < Tlen; m++) {
sum += T[k + m];
}
if (sum > max) {
max = sum;
}
skip:;
}
printf("%d\n", max);
return 0;
} | [
"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 >> A >> B >> C >> D >> E >> K;
if (E - A > K)
cout << ":(" << endl;
else
cout << "Yay!<<" << endl;
return 0;
} | #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 >> A >> B >> C >> D >> E >> K;
if (E - A > K)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | [
"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--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
int main() {
vll a(5);
ll k;
ll ans = 0;
rep(i, 5) cin >> a[i];
cin >> k;
rep(i, 4) for (int j = i + 1; i < 5; i++) {
if (a[j] - a[i] > k)
ans++;
}
if (ans)
COUT(":(");
else
COUT("Yay!");
}
| #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--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
int main() {
vll a(5);
ll k;
ll ans = 0;
rep(i, 5) cin >> a[i];
cin >> k;
rep(i, 4) for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k)
ans++;
}
if (ans)
COUT(":(");
else
COUT("Yay!");
} | [
"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;
else
cout << "Yay!" << 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;
else
cout << "Yay!" << 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;
}
template <class T, class U> string to_string(const pair<T, U> &p) {
string s = "(";
s += to_string(p.first);
s += ", ";
s += to_string(p.second);
s += ")";
return s;
}
template <class T> string to_string(const T &a) {
bool first = true;
string s = "{";
for (const auto &x : a) {
if (!first) {
s += ", ";
}
first = false;
s += to_string(x);
}
s += "}";
return s;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head head, Tail... tail) {
cerr << ' ' << to_string(head);
debug_out(tail...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "] = ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
using ll = long long;
using ld = long double;
const int mod = 998244353;
const int inf = 1e9 + 100;
const ll inf64 = 7e18l;
int add(int a, int b) {
a += b;
if (a >= mod) {
return a - mod;
}
return a;
}
void add_self(int &a, int b) { a = add(a, b); }
int mult(int a, int b) { return 1ll * a * b % mod; }
int bin_pow(int a, int b) {
if (b == 0) {
return 1;
}
if (b % 2 == 0) {
return bin_pow(mult(a, a), b / 2);
}
return mult(a, bin_pow(a, b - 1));
}
int inv(int a) { return bin_pow(a, mod - 2); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
vector<int> a(5);
int k;
for (int i = 0; i < 5; ++i) {
cin >> a[i];
}
cin >> k;
sort(a.begin(), a.end());
if (a[4] - a[0] > k) {
cout << "Yay!\n";
} else {
cout << ":(\n";
}
return 0;
}
| #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;
}
template <class T, class U> string to_string(const pair<T, U> &p) {
string s = "(";
s += to_string(p.first);
s += ", ";
s += to_string(p.second);
s += ")";
return s;
}
template <class T> string to_string(const T &a) {
bool first = true;
string s = "{";
for (const auto &x : a) {
if (!first) {
s += ", ";
}
first = false;
s += to_string(x);
}
s += "}";
return s;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head head, Tail... tail) {
cerr << ' ' << to_string(head);
debug_out(tail...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "] = ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
using ll = long long;
using ld = long double;
const int mod = 998244353;
const int inf = 1e9 + 100;
const ll inf64 = 7e18l;
int add(int a, int b) {
a += b;
if (a >= mod) {
return a - mod;
}
return a;
}
void add_self(int &a, int b) { a = add(a, b); }
int mult(int a, int b) { return 1ll * a * b % mod; }
int bin_pow(int a, int b) {
if (b == 0) {
return 1;
}
if (b % 2 == 0) {
return bin_pow(mult(a, a), b / 2);
}
return mult(a, bin_pow(a, b - 1));
}
int inv(int a) { return bin_pow(a, mod - 2); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
vector<int> a(5);
int k;
for (int i = 0; i < 5; ++i) {
cin >> a[i];
}
cin >> k;
sort(a.begin(), a.end());
if (a[4] - a[0] <= k) {
cout << "Yay!\n";
} else {
cout << ":(\n";
}
return 0;
}
| [
"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 + 1; j < 5; j++) {
int d = abs(a[j] - a[i]);
if (d >= k)
existed = true;
}
}
cout << (existed ? ":(" : "Yay!") << endl;
return 0;
}
| #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 + 1; j < 5; j++) {
int d = abs(a[j] - a[i]);
if (d > k)
existed = true;
}
}
cout << (existed ? ":(" : "Yay!") << endl;
return 0;
}
| [
"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(i, 5) cin >> a[i];
cin >> k;
if (a[4] - a[0] <= k) {
cout << "Yes!" << endl;
} else
cout << ":(" << endl;
return 0;
} | #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(i, 5) cin >> a[i];
cin >> k;
if (a[4] - a[0] <= k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
return 0;
} | [
"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("Yay!\n");
return 0;
}
| #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("Yay!\n");
return 0;
}
| [
"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("Yay!\n", c);
return 0;
}
| #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("Yay!\n");
return 0;
}
| [
"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] = abs(v[i] - v[j]);
pos += 1;
}
}
int m = *max_element(d.begin(), d.end());
if (m > 15)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
}
| #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] = abs(v[i] - v[j]);
pos += 1;
}
}
int m = *max_element(d.begin(), d.end());
if (m > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
}
| [
"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<int> v(5);
for (int i = 0; i < 5; i++)
cin >> v[i];
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (i == j)
continue;
if (abs(v[i] - v[j]) <= k)
out("Yay!");
}
}
cout << ":(" << endl;
return 0;
}
| #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<int> v(5);
for (int i = 0; i < 5; i++)
cin >> v[i];
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (i == j)
continue;
if (abs(v[i] - v[j]) > k)
out(":(");
}
}
cout << "Yay!" << endl;
return 0;
}
| [
"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] - A[i] > k) {
printf(":(\n");
return 0;
}
for (int m = j + 1; m < 4; m++) {
if (A[m] - A[i] > k) {
printf(":(\n");
return 0;
}
if (A[m] - A[j] > k) {
printf(":(\n");
return 0;
}
}
}
}
printf("Yay!\n");
} | #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] - A[i] > k) {
printf(":(\n");
return 0;
}
for (int m = j + 1; m < 5; m++) {
if (A[m] - A[i] > k) {
printf(":(\n");
return 0;
}
if (A[m] - A[j] > k) {
printf(":(\n");
return 0;
}
}
}
}
printf("Yay!\n");
} | [
"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 << ":(";
} else {
cout << "Yay!";
}
} | #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 << ":(";
} else {
cout << "Yay!";
}
} | [
"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 << ":(";
} else {
cout << "Yay!";
}
} | #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 << ":(";
} else {
cout << "Yay!";
}
} | [
"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(":(\n");
return 0;
}
}
}
printf("Yay!\n");
return 0;
} | #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(":(\n");
return 0;
}
}
}
printf("Yay!\n");
return 0;
} | [
"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 << ":(" << endl;
return 0;
} | #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 << ":(" << endl;
return 0;
} | [
"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(":(");
}
return 0;
}
| #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(":(");
}
return 0;
} | [
"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(":(");
}
return 0;
}
| #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(":(");
}
return 0;
} | [
"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 = true;
}
}
if (yes)
puts("Yay!");
else
puts(":(");
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() {
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 = false;
}
}
if (yes)
puts("Yay!");
else
puts(":(");
return 0;
} | [
"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];
}
cin >> k;
if (a[4] - a[0] < k) {
cout << "Yay!";
} else {
cout << ":(";
}
cout << endl;
} | #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];
}
cin >> k;
if (a[4] - a[0] <= k) {
cout << "Yay!";
} else {
cout << ":(";
}
cout << endl;
} | [
"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 long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<char> vc;
typedef set<int> si;
typedef set<string> ss;
typedef queue<int> qi;
typedef queue<long long> qll;
typedef queue<string> qs;
typedef queue<char> qc;
typedef struct board board;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
typedef pair<int, pair<int, int>> pii;
#define eb emplace_back
#define ppb pop_back
#define clr(a) a.clear()
#define F first
#define S second
#define mkp make_pair
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define left(x) x * 2
#define right(x) x * 2 + 1
#define meme(a, b, c) fill(a + 1, a + 1 + b, c)
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a > b ? b : a)
#define abs(a) (a > 0 ? a : -(a))
#define move(s) s += "#"
#define fr(i, a, b) for (ll i = a; i <= b; ++i)
#define rf(i, a, b) for (ll i = a; i >= b; --i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__);
void to_pray() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr << "Ready\n";
}
const int N = 4e6 + 10;
const int NN = 1e3 + 10;
const int NNN = 2e3 + 9;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LLINF = 1e12 + 7;
const ll P = 53;
const int EPS = 1e-9 - 8;
const int vN = 2e4 + 10;
const int sz = (1 << 22) - 1;
const double PI = acos(-1);
int a[N];
int main() {
to_pray();
int k;
for (int i = 0; i < 5; ++i)
cin >> a[i];
cin >> k;
for (int i = 4; i >= 1; --i) {
for (int j = i - 1; j >= 0; --j) {
int dis = a[i] - a[j];
if (dis > k)
return cout << ": (", 0;
}
}
cout << "Yay!\n";
cout << '\n';
return 0;
} | #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 long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<char> vc;
typedef set<int> si;
typedef set<string> ss;
typedef queue<int> qi;
typedef queue<long long> qll;
typedef queue<string> qs;
typedef queue<char> qc;
typedef struct board board;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
typedef pair<int, pair<int, int>> pii;
#define eb emplace_back
#define ppb pop_back
#define clr(a) a.clear()
#define F first
#define S second
#define mkp make_pair
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define left(x) x * 2
#define right(x) x * 2 + 1
#define meme(a, b, c) fill(a + 1, a + 1 + b, c)
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a > b ? b : a)
#define abs(a) (a > 0 ? a : -(a))
#define move(s) s += "#"
#define fr(i, a, b) for (ll i = a; i <= b; ++i)
#define rf(i, a, b) for (ll i = a; i >= b; --i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__);
void to_pray() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr << "Ready\n";
}
const int N = 4e6 + 10;
const int NN = 1e3 + 10;
const int NNN = 2e3 + 9;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LLINF = 1e12 + 7;
const ll P = 53;
const int EPS = 1e-9 - 8;
const int vN = 2e4 + 10;
const int sz = (1 << 22) - 1;
const double PI = acos(-1);
int a[N];
int main() {
to_pray();
int k;
for (int i = 0; i < 5; ++i)
cin >> a[i];
cin >> k;
for (int i = 4; i >= 1; --i) {
for (int j = i - 1; j >= 0; --j) {
int dis = a[i] - a[j];
if (dis > k)
return cout << ":(", 0;
}
}
cout << "Yay!\n";
cout << '\n';
return 0;
} | [
"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;
} else {
cout << ":(" << endl;
}
}
| #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;
} else {
cout << ":(" << endl;
}
}
| [
"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 {
cout << "Yey!" << endl;
}
}
| #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;
} else {
cout << ":(" << endl;
}
}
| [
"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::endl;
} else {
std::cout << ":(" << std::endl;
}
}
| #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::endl;
} else {
std::cout << ":(" << std::endl;
}
}
| [
"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)
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
rep(i, 5) cin >> x[i];
sort(x, x + 5);
int h;
cin >> h;
if (x[4] - x[0] < h)
cout << "Yay!" << '\n';
else
cout << ":(" << '\n';
} | #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)
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
rep(i, 5) cin >> x[i];
sort(x, x + 5);
int h;
cin >> h;
if (x[4] - x[0] <= h)
cout << "Yay!" << '\n';
else
cout << ":(" << '\n';
} | [
"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 <vector>
using namespace std;
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 (a - e > k)
cout << ":(\n";
else
cout << "Yay!\n";
return 0;
}
| #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 <vector>
using namespace std;
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)
cout << ":(\n";
else
cout << "Yay!\n";
return 0;
} | [
"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>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define vpush(v, x) v.push_back(x);
#define REP(i, x, n) for (int i = x; i < n; i++)
#define INF 2e9
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, w, h;
vint v;
rep(i, 5) {
cin >> a;
vpush(v, a);
}
cin >> a;
if (v[4] - v[0] <= a) {
cout << "Yay";
} else {
cout << ":(";
}
return (0);
} | #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>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define vpush(v, x) v.push_back(x);
#define REP(i, x, n) for (int i = x; i < n; i++)
#define INF 2e9
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, w, h;
vint v;
rep(i, 5) {
cin >> a;
vpush(v, a);
}
cin >> a;
if (v[4] - v[0] <= a) {
cout << "Yay!";
} else {
cout << ":(";
}
return (0);
} | [
"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 for
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int desc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a >= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <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 for
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int desc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"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 << ":(" << endl;
}
}
| #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 << ":(" << endl;
}
}
| [
"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 << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v)
s >> x;
return s;
}
inline void Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; }
inline void YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout<<std::fixed<<std::setprecision(10);
vector<int> a(5);
cin >> a;
int k;
cin >> k;
for (int i = 0; i <= 3; i++) {
for (int j = i + 1; j <= 4; j++) {
if (abs(a[i] - a[j]) > k) {
cout << "Yay!" << endl;
return 0;
}
}
}
cout << ":(" << endl;
}
| #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 << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v)
s >> x;
return s;
}
inline void Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; }
inline void YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout<<std::fixed<<std::setprecision(10);
vector<int> a(5);
cin >> a;
int k;
cin >> k;
for (int i = 0; i <= 3; i++) {
for (int j = i + 1; j <= 4; j++) {
if (abs(a[i] - a[j]) > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
}
| [
"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 << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v)
s >> x;
return s;
}
inline void Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; }
inline void YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout<<std::fixed<<std::setprecision(10);
vector<int> a(5);
cin >> a;
int k;
cin >> k;
for (int i = 0; i <= 3; i++) {
for (int j = i + 1; j <= 4; j++) {
if (abs(a[i] - a[j]) >= k) {
cout << "Yay!" << endl;
return 0;
}
}
}
cout << ":(" << endl;
}
| #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 << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v)
s >> x;
return s;
}
inline void Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; }
inline void YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout<<std::fixed<<std::setprecision(10);
vector<int> a(5);
cin >> a;
int k;
cin >> k;
for (int i = 0; i <= 3; i++) {
for (int j = i + 1; j <= 4; j++) {
if (abs(a[i] - a[j]) > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
}
| [
"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 << ":)";
}
return 0;
}
| #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 << ":(";
}
return 0;
}
| [
"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 ? ":(" : "Yay!") << endl;
return 0;
} | #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 ? ":(" : "Yay!") << endl;
return 0;
} | [
"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;
}
}
}
if (flag)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | #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;
}
}
}
if (flag)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"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
#define pq priority_queue
#define ipair pair<int, int>
#define spair pair<string, string>
#define lpair pair<LL, LL>
#define MP make_pair
#define INF 2147483647
#define _INF -2147483647
#define MM multimap
#define PB push_back
#define MAXN 100004
using namespace std;
typedef long long ll;
int main() {
vi a(5);
rep(i, 0, 5) cin >> a[i];
int k;
cin >> k;
if (a[4] - a[0] < k)
cout << "Yey!" << endl;
else
cout << ":(" << endl;
return 0;
} | #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
#define pq priority_queue
#define ipair pair<int, int>
#define spair pair<string, string>
#define lpair pair<LL, LL>
#define MP make_pair
#define INF 2147483647
#define _INF -2147483647
#define MM multimap
#define PB push_back
#define MAXN 100004
using namespace std;
typedef long long ll;
int main() {
vi a(5);
rep(i, 0, 5) cin >> a[i];
int k;
cin >> k;
if (a[4] - a[0] <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"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 long long ll;
typedef pair<int, int> P;
const int inf = 1012345678;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int a[6];
int main() {
int k;
rep(i, 5) { cin >> a[i]; }
bool flag = true;
cin >> k;
if (a[4] - a[0] >= k)
flag = false;
if (!flag)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
}
| #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 long long ll;
typedef pair<int, int> P;
const int inf = 1012345678;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int a[6];
int main() {
int k;
rep(i, 5) { cin >> a[i]; }
bool flag = true;
cin >> k;
if (a[4] - a[0] > k)
flag = false;
if (!flag)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
}
| [
"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.