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 | #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
using namespace std;
#include <cstdio>
#define r(i, n) for (int i = 0; i < n; i++)
int main(void) {
vector<int> a(5);
int k;
r(i, 5) cin >> a.at(i);
cin >> k;
bool flag = 1;
r(i, 4) {
r(j, 4) {
if (abs(a.at(j) - a.at(i)) > k)
flag = 0;
}
}
if (flag)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
using namespace std;
#include <cstdio>
#define r(i, n) for (int i = 0; i < n; i++)
int main(void) {
vector<int> a(5);
int k;
r(i, 5) cin >> a.at(i);
cin >> k;
bool flag = 1;
r(i, 5) {
r(j, 5) {
if (abs(a.at(j) - a.at(i)) > k)
flag = 0;
}
}
if (flag)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 887,736 | 887,737 | u748823501 | cpp |
p03075 | #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
using namespace std;
#include <cstdio>
#define r(i, n) for (int i = 0; i < n; i++)
int main(void) {
vector<int> a(5);
int k;
r(i, 5) cin >> a.at(i);
cin >> k;
bool flag = 1;
r(i, 4) {
r(j, 4) {
if (a.at(j) - a.at(i) > k)
flag = 0;
}
}
if (flag)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
using namespace std;
#include <cstdio>
#define r(i, n) for (int i = 0; i < n; i++)
int main(void) {
vector<int> a(5);
int k;
r(i, 5) cin >> a.at(i);
cin >> k;
bool flag = 1;
r(i, 5) {
r(j, 5) {
if (abs(a.at(j) - a.at(i)) > k)
flag = 0;
}
}
if (flag)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 887,738 | 887,737 | u748823501 | cpp |
p03075 | //
// main.cpp
// sss
//
// Created by on 2019/09/04.
// Copyright © 2019 . All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> vec(5);
for (int i = 0; i <= 5; i++) {
cin >> vec.at(i);
}
int k;
cin >> k;
sort(vec.begin(), vec.end());
if (vec.at(4) - vec.at(0) < k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| //
// main.cpp
// sss
//
// Created by on 2019/09/04.
// Copyright © 2019 . All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> vec(5);
for (int i = 0; i < 5; i++) {
cin >> vec.at(i);
}
int k;
cin >> k;
sort(vec.begin(), vec.end());
if (vec.at(4) - vec.at(0) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 887,741 | 887,742 | u319783732 | cpp |
p03075 | //
// main.cpp
// sss
//
// Created by on 2019/09/04.
// Copyright © 2019 . All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> vec(5);
for (int i = 0; i < 5; i++) {
cin >> vec.at(i);
}
int k;
cin >> k;
sort(vec.begin(), vec.end());
if (vec.at(4) - vec.at(0) < k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| //
// main.cpp
// sss
//
// Created by on 2019/09/04.
// Copyright © 2019 . All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> vec(5);
for (int i = 0; i < 5; i++) {
cin >> vec.at(i);
}
int k;
cin >> k;
sort(vec.begin(), vec.end());
if (vec.at(4) - vec.at(0) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,743 | 887,742 | u319783732 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5];
int k = 0;
int b = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int j = 0; j < 5; j++) {
for (int s = 0; s < 5; s++) {
if (a[s] - a[j] <= k) {
b = 0;
} else {
b = 1;
}
}
}
if (b == 0) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[5];
int k = 0;
int b = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int j = 0; j < 5; j++) {
for (int s = 0; s < 5; s++) {
if (a[s] - a[j] <= k) {
} else {
b = 1;
}
}
}
if (b == 0) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [] | 887,752 | 887,753 | u436403761 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[6];
for (int i = 0; i < 6; ++i)
cin >> a[i];
for (int i = 0; i < 4; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (abs(a[i] - a[j]) > a[6]) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[6];
for (int i = 0; i < 6; ++i)
cin >> a[i];
for (int i = 0; i < 4; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (abs(a[i] - a[j]) > a[5]) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 887,754 | 887,755 | u332153950 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
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>
using namespace std;
typedef long long ll;
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;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 887,758 | 887,759 | u770009793 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int A[5];
int K;
for (int i = 0; i < 5; i++) {
cin >> A[i];
}
cin >> K;
int max = A[4];
int min = A[0];
/*
for(int i=1;i<1;i++){
if(max<A[i])max=A[i];
if(min>A[i])min=A[i];
}
*/
int d = max - min;
if (d < K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A[5];
int K;
for (int i = 0; i < 5; i++) {
cin >> A[i];
}
cin >> K;
int max = A[4];
int min = A[0];
/*
for(int i=1;i<1;i++){
if(max<A[i])max=A[i];
if(min>A[i])min=A[i];
}
*/
int d = max - min;
if (d <= K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,764 | 887,765 | u184929210 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int A[5];
int K;
for (int i = 0; i < 5; i++) {
cin >> A[i];
}
cin >> K;
int max = A[0];
int min = A[4];
/*
for(int i=1;i<1;i++){
if(max<A[i])max=A[i];
if(min>A[i])min=A[i];
}
*/
int d = max - min;
if (d > K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A[5];
int K;
for (int i = 0; i < 5; i++) {
cin >> A[i];
}
cin >> K;
int max = A[4];
int min = A[0];
/*
for(int i=1;i<1;i++){
if(max<A[i])max=A[i];
if(min>A[i])min=A[i];
}
*/
int d = max - min;
if (d <= K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,766 | 887,765 | u184929210 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(5);
int a;
for (int i = 0; i < 5; i++) {
cin >> vec.at(i);
}
cin >> a;
sort(vec.begin(), vec.end());
if (vec[4] - vec[0] < a) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(5);
int a;
for (int i = 0; i < 5; i++) {
cin >> vec.at(i);
}
cin >> a;
sort(vec.begin(), vec.end());
if (vec[4] - vec[0] <= a) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,774 | 887,775 | u664743926 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(5);
int a;
for (int i = 0; i < 5; i++) {
cin >> vec.at(i);
}
cin >> a;
sort(vec.begin(), vec.end());
if (vec[4] - vec[0] > a) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(5);
int a;
for (int i = 0; i < 5; i++) {
cin >> vec.at(i);
}
cin >> a;
sort(vec.begin(), vec.end());
if (vec[4] - vec[0] <= a) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,776 | 887,775 | u664743926 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(a) (a).begin(), (a).end()
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;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(a) (a).begin(), (a).end()
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;
} | [
"literal.string.change",
"io.output.change"
] | 887,785 | 887,786 | u472675932 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5], k, brk = 0;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5 - i; j++) {
if ((a[i] - a[j]) * (a[i] - a[j]) >= k * k) {
brk = 1;
break;
}
}
}
if (brk == 1) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a[5], k, brk = 0;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5 - i; j++) {
if ((a[i] - a[j]) * (a[i] - a[j]) > k * k) {
brk = 1;
break;
}
}
}
if (brk == 1) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,791 | 887,792 | u938317342 | cpp |
p03075 |
#include <iostream>
using namespace std;
int main() {
int a[5], k, brk = 0;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if ((a[i] - a[j]) * (a[i] - a[j]) >= k * k) {
brk = 1;
break;
}
}
}
if (brk == 1) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a[5], k, brk = 0;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5 - i; j++) {
if ((a[i] - a[j]) * (a[i] - a[j]) > k * k) {
brk = 1;
break;
}
}
}
if (brk == 1) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,793 | 887,792 | u938317342 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5], k, brk = 0;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if ((a[i] - a[j]) * (a[i] - a[j]) >= k * k) {
brk = 1;
break;
}
}
}
if (brk = 1) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a[5], k, brk = 0;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5 - i; j++) {
if ((a[i] - a[j]) * (a[i] - a[j]) > k * k) {
brk = 1;
break;
}
}
}
if (brk == 1) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 887,794 | 887,792 | u938317342 | 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 - d >= k && e - c >= k && e - b >= k && 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 - d <= k && e - c <= k && e - b <= k && e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,797 | 887,798 | u703214333 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
using namespace std;
int main() {
int tele[6];
rep(i, 0, 6) cin >> tele[i];
int limit = tele[5];
rep(i, 0, 4) {
rep(j, 1, 4) {
if (abs(tele[i] - tele[j]) > limit) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
using namespace std;
int main() {
int tele[6];
rep(i, 0, 6) cin >> tele[i];
int limit = tele[5];
rep(i, 0, 4) {
rep(j, 1, 5) {
if (abs(tele[i] - tele[j]) > limit) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
}
| [
"literal.number.change",
"call.arguments.change"
] | 887,802 | 887,803 | u873269440 | 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, max(b, max(c, max(d, e)))) - min(a, min(b, min(c, min(d, e)))) <
k) {
cout << "Yay!";
} else {
cout << ":(";
}
} | #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, max(b, max(c, max(d, e)))) - min(a, min(b, min(c, min(d, e)))) <=
k) {
cout << "Yay!";
} else {
cout << ":(";
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,804 | 887,805 | u811897616 | 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 (abs(a - e) <= k)
cout << "Yah!" << endl;
else
cout << ":(" << 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 (abs(a - e) <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 887,806 | 887,807 | u383681712 | cpp |
p03075 | #include "bits/stdc++.h"
#define ll long long
#define FOR(x) for (ll i = 0; i < (x); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
int main() {
vector<ll> a(5);
FOR(5) cin >> a[i];
ll k;
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(\n";
return 0;
}
cout << "Yay\n";
}
| #include "bits/stdc++.h"
#define ll long long
#define FOR(x) for (ll i = 0; i < (x); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
int main() {
vector<ll> a(5);
FOR(5) cin >> a[i];
ll k;
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(\n";
return 0;
}
cout << "Yay!\n";
}
| [
"literal.string.change",
"io.output.change"
] | 887,810 | 887,811 | u546736430 | cpp |
p03075 | #include "bits/stdc++.h"
#define ll long long
#define FOR(x) for (ll i = 0; i < (x); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
int main() {
vector<ll> a(5);
FOR(5) cin >> a[i];
ll k;
cin >> k;
if (a[4] - a[0] > k)
cout << ":(\n";
return 0;
cout << "Yay\n";
}
| #include "bits/stdc++.h"
#define ll long long
#define FOR(x) for (ll i = 0; i < (x); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
int main() {
vector<ll> a(5);
FOR(5) cin >> a[i];
ll k;
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(\n";
return 0;
}
cout << "Yay!\n";
}
| [
"literal.string.change",
"io.output.change"
] | 887,812 | 887,811 | u546736430 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, k;
cin >> a >> b >> c >> d >> e >> f >> k;
if (e - a <= k) {
cout << "Yay!";
} else
cout << ":(";
} | #include <iostream>
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!";
} else
cout << ":(";
} | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 887,819 | 887,820 | u534015096 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(5);
for (int i = 0; i < 5; i++) {
cin >> vec.at(i);
}
int k;
cin >> k;
sort(vec.begin(), vec.end());
if (vec.at(4) - vec.at(0) <= k) {
cout << "Yah!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(5);
for (int i = 0; i < 5; i++) {
cin >> vec.at(i);
}
int k;
cin >> k;
sort(vec.begin(), vec.end());
if (vec.at(4) - vec.at(0) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 887,829 | 887,830 | u835534008 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
// intput
int iti[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> iti[i];
}
cin >> k;
// solve
int idx = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < i; j++) {
if (iti[j + 1] - iti[j] > k) {
idx++;
}
}
}
string ans;
if (idx == 0) {
ans = "Yay!";
} else {
ans = ":(";
}
// output
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
// intput
int iti[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> iti[i];
}
cin >> k;
// solve
int idx = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < i; j++) {
if (iti[i] - iti[j] > k) {
idx++;
}
}
}
string ans;
if (idx == 0) {
ans = "Yay!";
} else {
ans = ":(";
}
// output
cout << ans << endl;
return 0;
}
| [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 887,831 | 887,832 | u653001393 | cpp |
p03075 | #include <bits/stdc++.h>
#include <ctype.h>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end()
const long long INF = 1LL << 60;
#define rep(i, n) for (int i = 0; i < (int)(n); i++) //(i, 10) i=0～i=9まで
#define repr(i, n) for (int i = n; i >= 0; i--) // (i, 10) i=10～i=0まで
#define FOR(i, m, n) for (int i = m; i < n; i++) // (i, 3, 10) i=3～i=9まで
// 総数を1000000007で割った余り
const long long mod = 1e9 + 7;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(5);
// 入力
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
// 処理
// 出力
(e - a >= k) ? cout << ":(" << endl : cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <ctype.h>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end()
const long long INF = 1LL << 60;
#define rep(i, n) for (int i = 0; i < (int)(n); i++) //(i, 10) i=0～i=9まで
#define repr(i, n) for (int i = n; i >= 0; i--) // (i, 10) i=10～i=0まで
#define FOR(i, m, n) for (int i = m; i < n; i++) // (i, 3, 10) i=3～i=9まで
// 総数を1000000007で割った余り
const long long mod = 1e9 + 7;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(5);
// 入力
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
// 処理
// 出力
(e - a > k) ? cout << ":(" << endl : cout << "Yay!" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 887,841 | 887,842 | u766205979 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> pos(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> pos[i];
}
cin >> k;
for (int i = 1; i < 5; i++) {
if ((pos[i] - pos[i - 1]) > k) {
cout << ":(" << endl;
return 0;
}
}
cout << "Yay!" << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> pos(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> pos[i];
}
cin >> k;
for (int i = 0; i < 5; i++) {
if ((pos[4] - pos[i]) > k) {
cout << ":(" << endl;
return 0;
}
}
cout << "Yay!" << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition... | 887,843 | 887,844 | u476534289 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v(5);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
int k;
cin >> k;
bool flag;
for (int i = 0; i < 5; i++) {
for (int j = 1; j < 5; j++) {
if (abs(v[i] - v[j]) > k) {
flag = true;
break;
}
}
if (flag) {
cout << ":(" << endl;
break;
}
}
if (!flag)
cout << "Yay!" << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v(5);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
int k;
cin >> k;
bool flag = false;
for (int i = 0; i < 5; i++) {
for (int j = 1; j < 5; j++) {
if (abs(v[i] - v[j]) > k) {
flag = true;
break;
}
}
if (flag) {
cout << ":(" << endl;
break;
}
}
if (!flag)
cout << "Yay!" << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 887,847 | 887,848 | u034663022 | cpp |
p03075 | #include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
const int ANTENA_NUM = 5;
int a, e;
cin >> a;
for (int i = 1; i < ANTENA_NUM - 1; i++) {
int tmp;
cin >> tmp;
}
cin >> e;
int k;
cin >> k;
cout << (e - a < k ? "Yay!" : ":(") << endl;
return 0;
}
| #include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
const int ANTENA_NUM = 5;
int a, e;
cin >> a;
for (int i = 1; i < ANTENA_NUM - 1; i++) {
int tmp;
cin >> tmp;
}
cin >> e;
int k;
cin >> k;
cout << (e - a <= k ? "Yay!" : ":(") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 887,849 | 887,850 | u873538240 | cpp |
p03075 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int a[5], s;
s = 0;
std::cin >> a[1];
for (int i = 1; i < 5; i++) {
std::cin >> a[i];
s = max(s, a[i] - a[i - 1]);
}
int k;
std::cin >> k;
if (a[4] - a[0] <= k)
std::cout << "Yay!" << std::endl;
else
std::cout << ":(" << std::endl;
} | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int a[5], s;
s = 0;
std::cin >> a[0];
for (int i = 1; i < 5; i++) {
std::cin >> a[i];
s = max(s, a[i] - a[i - 1]);
}
int k;
std::cin >> k;
if (a[4] - a[0] <= k)
std::cout << "Yay!" << std::endl;
else
std::cout << ":(" << std::endl;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 887,851 | 887,852 | u851205244 | cpp |
p03075 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int a[5], s;
s = 0;
std::cin >> a[1];
for (int i = 1; i < 5; i++) {
std::cin >> a[i];
s = max(s, a[i] - a[i - 1]);
}
int k;
std::cin >> k;
if (a[5] - a[1] <= k)
std::cout << "Yay!" << std::endl;
else
std::cout << ":(" << std::endl;
} | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int a[5], s;
s = 0;
std::cin >> a[0];
for (int i = 1; i < 5; i++) {
std::cin >> a[i];
s = max(s, a[i] - a[i - 1]);
}
int k;
std::cin >> k;
if (a[4] - a[0] <= k)
std::cout << "Yay!" << std::endl;
else
std::cout << ":(" << std::endl;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 887,853 | 887,852 | u851205244 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5], k;
for (int i = 0; i < 5; i++) {
cin >> a[0];
}
cin >> k;
bool ans = a[4] - a[0] <= k;
cout << (ans ? "Yay!" : ":(") << endl;
}
| #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;
bool ans = a[4] - a[0] <= k;
cout << (ans ? "Yay!" : ":(") << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 887,866 | 887,867 | u792217717 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, x;
cin >> a >> b >> c >> d >> e >> x;
if (e - a < x) {
cout << ":(";
} else {
cout << "Yay!";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, x;
cin >> a >> b >> c >> d >> e >> x;
if (e - a > x) {
cout << ":(";
} else {
cout << "Yay!";
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,868 | 887,869 | u950901760 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, k, e;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ": (";
else
cout << "Yay!";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, k, e;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(";
else
cout << "Yay!";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 887,870 | 887,871 | u435266469 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(5);
int k, d = 0;
for (int i = 0; i < a.size(); i++)
cin >> a[i];
cin >> k;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
d = max(d, (a[j] - a[i]));
}
}
if (d <= k)
cout << "yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(5);
int k, d = 0;
for (int i = 0; i < a.size(); i++)
cin >> a[i];
cin >> k;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
d = max(d, (a[j] - a[i]));
}
}
if (d <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 887,876 | 887,877 | u598726179 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(5);
int k, d = 0;
for (int i = 0; i < a.size() - 1; i++)
cin >> a[i];
cin >> k;
for (int i = 0; i < a.size(); i++) {
for (int j = i + 1; j < a.size(); j++) {
d = max(d, (a[j] - a[i]));
}
}
if (d <= k)
cout << "yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(5);
int k, d = 0;
for (int i = 0; i < a.size(); i++)
cin >> a[i];
cin >> k;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
d = max(d, (a[j] - a[i]));
}
}
if (d <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 887,878 | 887,877 | u598726179 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(5);
int k, d = 0;
for (int i = 0; i < a.size(); i++)
cin >> a[i];
cin >> k;
for (int i = 0; i < a.size(); i++) {
for (int j = i + 1; j < a.size(); j++) {
d = max(d, a[j] - a[i]);
}
}
if (d <= k)
cout << "yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(5);
int k, d = 0;
for (int i = 0; i < a.size(); i++)
cin >> a[i];
cin >> k;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
d = max(d, (a[j] - a[i]));
}
}
if (d <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 887,879 | 887,877 | u598726179 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(5);
int k, d = 0;
for (int i = 0; i < a.size(); i++)
cin >> a[i];
cin >> k;
for (int i = 1; i < a.size(); i++) {
for (int j = i + 1; j < a.size(); j++) {
d = max(d, a[j] - a[i]);
}
}
if (d <= k)
cout << "yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(5);
int k, d = 0;
for (int i = 0; i < a.size(); i++)
cin >> a[i];
cin >> k;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
d = max(d, (a[j] - a[i]));
}
}
if (d <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 887,880 | 887,877 | u598726179 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int aa[5];
int k;
for (int i = 0; i < 5; i++)
cin >> aa[i];
cin >> k;
int count = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (abs(aa[j] - aa[i]) > k)
count++;
}
}
if (count == 0)
cout << "Yey!" << endl;
else
cout << ":(" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int aa[5];
int k;
for (int i = 0; i < 5; i++)
cin >> aa[i];
cin >> k;
int count = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (aa[j] - aa[i] > k)
count++;
}
}
if (count == 0)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 887,881 | 887,882 | u157195505 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int aa[5];
int k;
for (int i = 0; i < 5; i++)
cin >> aa[i];
cin >> k;
int count = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (aa[j] - aa[i] > k)
count++;
}
}
if (count == 0)
cout << "Yey!" << endl;
else
cout << ":(" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int aa[5];
int k;
for (int i = 0; i < 5; i++)
cin >> aa[i];
cin >> k;
int count = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (aa[j] - aa[i] > k)
count++;
}
}
if (count == 0)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| [
"import.add",
"literal.string.change",
"io.output.change"
] | 887,883 | 887,882 | u157195505 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
int d; //コピー変数
for (int j = i + 1; j < 5; j++) {
if (a[i] < a[j]) {
d = a[i];
a[i] = a[j];
a[j] = d;
}
}
}
int b = a[0] - a[4];
int k;
cin >> k;
if (b > k) {
cout << ":(" << endl;
} else
cout << "yay!!" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
int d; //コピー変数
for (int j = i + 1; j < 5; j++) {
if (a[i] < a[j]) {
d = a[i];
a[i] = a[j];
a[j] = d;
}
}
}
int b = a[0] - a[4];
int k;
cin >> k;
if (b > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 887,890 | 887,891 | u264405855 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
int d; //コピー変数
for (int j = i + 1; j < 5; j++) {
if (a[i] < a[j]) {
d = a[i];
a[i] = a[j];
a[j] = d;
}
}
}
int b = a[0] - a[4];
int k;
cin >> k;
if (b > k) {
cout << ":(" << endl;
} else
cout << "yay!!" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
int d; //コピー変数
for (int j = i + 1; j < 5; j++) {
if (a[i] < a[j]) {
d = a[i];
a[i] = a[j];
a[j] = d;
}
}
}
int b = a[0] - a[4];
int k;
cin >> k;
if (b > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 887,892 | 887,891 | u264405855 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
int d; //コピー変数
for (int j = i + 1; j < 5; j++) {
if (a[i] < a[j]) {
d = a[j];
a[i] = a[j];
a[i] = d;
}
}
}
int b = a[0] - a[4];
int k;
cin >> k;
if (b > k) {
cout << ":(" << endl;
} else
cout << "yay!!" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
int d; //コピー変数
for (int j = i + 1; j < 5; j++) {
if (a[i] < a[j]) {
d = a[i];
a[i] = a[j];
a[j] = d;
}
}
}
int b = a[0] - a[4];
int k;
cin >> k;
if (b > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.variable.change",
"literal.string.change",
"io.output.change"
] | 887,893 | 887,891 | u264405855 | cpp |
p03075 | #include <algorithm>
#include <iostream>
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 <algorithm>
#include <iostream>
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,894 | 887,895 | u911828387 | cpp |
p03075 | #include <algorithm>
#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 <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;
}
} | [
"literal.string.change",
"io.output.change"
] | 887,903 | 887,904 | u392569193 | cpp |
p03075 | #include <algorithm>
#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;
}
} | #include <algorithm>
#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;
}
} | [
"literal.string.change",
"io.output.change"
] | 887,905 | 887,904 | u392569193 | cpp |
p03075 | #include <algorithm>
#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;
}
} | #include <algorithm>
#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;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.add"
] | 887,906 | 887,904 | u392569193 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
string c = "Yay!";
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++)
if (k <= a[j] - a[i])
c = ":(";
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string c = "Yay!";
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++)
if (k < a[j] - a[i])
c = ":(";
}
cout << c << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,907 | 887,908 | u298768617 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
string c = "Yay!";
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 4; j++)
if (k < a[j] - a[i])
c = ":(";
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string c = "Yay!";
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++)
if (k < a[j] - a[i])
c = ":(";
}
cout << c << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 887,909 | 887,908 | u298768617 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (abs(a[i] - a[j]) > k) {
cout << ":(";
return 0;
}
}
}
cout << "YAY";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int k;
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (abs(a[i] - a[j]) > k) {
cout << ":(";
return 0;
}
}
}
cout << "Yay!";
} | [
"literal.string.change",
"io.output.change"
] | 887,910 | 887,911 | u843739531 | 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;
int anko = max(e - a, e - b);
int maojini = max(e - c, e - d);
if (anko < k && maojini < k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
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;
int anko = max(e - a, e - b);
int maojini = max(e - c, e - d);
if (anko <= k && maojini <= k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,914 | 887,915 | u025469035 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++)
cin >> a[i];
int k = 0;
cin >> k;
string ans = "Yay!";
for (int i = 1; i < 5; i++) {
if (a[i] - a[i - 1] > k)
ans = ":(";
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++)
cin >> a[i];
int k = 0;
cin >> k;
string ans = "Yay!";
for (int i = 1; i < 5; i++) {
if (a[i] - a[0] > k)
ans = ":(";
}
cout << ans;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 887,916 | 887,917 | u249546633 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++)
cin >> a[i];
int k = 0;
cin >> k;
string ans = "Yay!";
for (int i = 1; i < 6; i++) {
if (a[i] - a[i - 1] > k)
ans = ":(";
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++)
cin >> a[i];
int k = 0;
cin >> k;
string ans = "Yay!";
for (int i = 1; i < 5; i++) {
if (a[i] - a[0] > k)
ans = ":(";
}
cout << ans;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remo... | 887,918 | 887,917 | u249546633 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, k, M = 0, m = 123;
for (int i = 0; i < 5; i++) {
cin >> a;
M = max(M, a);
m = min(m, a);
}
cin >> k;
cerr << M << ' ' << m;
cout << ((M - m > k) ? ":(" : "Yey!");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, k, M = 0, m = 123;
for (int i = 0; i < 5; i++) {
cin >> a;
M = max(M, a);
m = min(m, a);
}
cin >> k;
cerr << M << ' ' << m;
cout << ((M - m > k) ? ":(" : "Yay!");
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 887,919 | 887,920 | u948459352 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
int t = 0;
vector<int> vec = {a, b, c, d, e};
for (int i = 1; i < 4; i++) {
for (int j = 0; j < i; j++) {
int l = vec[i] - vec[j];
if (l > k) {
t += 1;
}
}
}
if (t == 0) {
cout << "Yay!" << endl;
}
else if (t > 0) {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
int t = 0;
vector<int> vec = {a, b, c, d, e};
for (int i = 1; i < 5; i++) {
for (int j = 0; j < i; j++) {
int l = vec[i] - vec[j];
if (l > k) {
t += 1;
}
}
}
if (t == 0) {
cout << "Yay!" << endl;
}
else if (t > 0) {
cout << ":(" << endl;
}
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 887,921 | 887,922 | u098026368 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
int t = 0;
vector<int> vec = {a, b, c, d, e};
for (int i = 1; i < 4; i++) {
for (int j = 0; j < i; j++) {
int l = vec[i] - vec[j];
if (l > k) {
t += 1;
}
}
}
if (t == 0) {
cout << ":(" << endl;
}
else if (t > 0) {
cout << "Yay!" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
int t = 0;
vector<int> vec = {a, b, c, d, e};
for (int i = 1; i < 5; i++) {
for (int j = 0; j < i; j++) {
int l = vec[i] - vec[j];
if (l > k) {
t += 1;
}
}
}
if (t == 0) {
cout << "Yay!" << endl;
}
else if (t > 0) {
cout << ":(" << endl;
}
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 887,923 | 887,922 | u098026368 | cpp |
p03075 | #include <bits/stdc++.h>
int main() {
int a, b, c, d, e, k;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &k);
if (e - a < k) {
puts("yay!");
} else {
puts(":(");
}
return 0;
} | #include <bits/stdc++.h>
int main() {
int a, b, c, d, e, k;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &k);
if (e - a <= k) {
puts("Yay!");
} else {
puts(":(");
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 887,926 | 887,927 | u066855390 | cpp |
p03075 | #include <bits/stdc++.h>
int main() {
int a, b, c, d, e, k;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &k);
if (e - a <= k) {
puts("yay!");
} else {
puts(":(");
}
return 0;
} | #include <bits/stdc++.h>
int main() {
int a, b, c, d, e, k;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &k);
if (e - a <= k) {
puts("Yay!");
} else {
puts(":(");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 887,928 | 887,927 | u066855390 | cpp |
p03075 | /* include */
#include <bits/stdc++.h>
/* using */
using namespace std;
/* main constructor */
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(0);
// cout << fixed << setprecision(12);
}
} fast;
/* template */
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
/* define */
#define REP(i, x, n) for (int i = x; i < (int)(n); ++i)
#define RREP(i, x, n) for (int i = x - 1; i >= (int)(n); --i)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) REP(i, 1, n + 1)
#define rrep(i, n) RREP(i, n, 0)
#define each(i, n) for (auto &i : n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define eunique(x) \
sort(all(x)); \
(x).erase(unique(all(x)), (x).end())
#define int long long
#define mp make_pair
#define r0 return 0
/* function */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
/* const */
const int inf = 1e9 + 7;
const int dxl[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dyl[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dxs[4] = {1, 0, -1, 0};
const int dys[4] = {0, 1, 0, -1};
/* main */
signed main(void) {
int k;
vector<int> v(5);
rep(i, 5) { cin >> v[i]; }
cin >> k;
if (v[4] - v[0] < k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| /* include */
#include <bits/stdc++.h>
/* using */
using namespace std;
/* main constructor */
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(0);
// cout << fixed << setprecision(12);
}
} fast;
/* template */
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
/* define */
#define REP(i, x, n) for (int i = x; i < (int)(n); ++i)
#define RREP(i, x, n) for (int i = x - 1; i >= (int)(n); --i)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) REP(i, 1, n + 1)
#define rrep(i, n) RREP(i, n, 0)
#define each(i, n) for (auto &i : n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define eunique(x) \
sort(all(x)); \
(x).erase(unique(all(x)), (x).end())
#define int long long
#define mp make_pair
#define r0 return 0
/* function */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
/* const */
const int inf = 1e9 + 7;
const int dxl[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dyl[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dxs[4] = {1, 0, -1, 0};
const int dys[4] = {0, 1, 0, -1};
/* main */
signed main(void) {
int k;
vector<int> v(5);
rep(i, 5) { cin >> v[i]; }
cin >> k;
if (v[4] - v[0] <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,931 | 887,932 | u284092157 | cpp |
p03075 | #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 <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;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,938 | 887,939 | u661461084 | cpp |
p03075 | #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 <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;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,940 | 887,939 | u661461084 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) > 15) {
cout << ":(";
} else {
cout << "Yay!";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) > k) {
cout << ":(";
} else {
cout << "Yay!";
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 887,941 | 887,942 | u653388379 | cpp |
p03075 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < n; i++)
#define REP(n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using INT64 = long long;
using UINT64 = unsigned long long;
int main(void) {
IOS vector<int> a(5);
REP(5) cin >> a[i];
int k;
cin >> k;
reverse(ALL(a));
REP(5) {
FOR(j, i, 5) {
if (a[i] - a[j] >= k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < n; i++)
#define REP(n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using INT64 = long long;
using UINT64 = unsigned long long;
int main(void) {
IOS vector<int> a(5);
REP(5) cin >> a[i];
int k;
cin >> k;
reverse(ALL(a));
REP(5) {
FOR(j, i, 5) {
if (a[i] - a[j] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,943 | 887,944 | u330661451 | cpp |
p03075 | #include <cstdio>
#include <iostream>
using namespace std;
int a, b, c, d, e, k;
int main() {
cin >> a >> b >> c >> d >> e >> k;
if (k > e - a) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int a, b, c, d, e, k;
int main() {
cin >> a >> b >> c >> d >> e >> k;
if (k >= e - a) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,951 | 887,952 | u008639671 | cpp |
p03075 | #include <algorithm>
#include <cassert>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
#define rep(i, l, r) for (ll i = (l); i <= (r); i++)
#define irep(i, r, l) for (ll i = (r); i >= (l); i--)
#define vec(t) vector<int>
using namespace std;
using ll = long long;
using veci = vec(int);
using vecll = vec(ll);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
veci A(6);
rep(i, 0, 5) cin >> A[i];
if (A[4] - A[0] > A[5])
cout << ":(\n";
else
cout << "Yah!\n";
} | #include <algorithm>
#include <cassert>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
#define rep(i, l, r) for (ll i = (l); i <= (r); i++)
#define irep(i, r, l) for (ll i = (r); i >= (l); i--)
#define vec(t) vector<int>
using namespace std;
using ll = long long;
using veci = vec(int);
using vecll = vec(ll);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
veci A(6);
rep(i, 0, 5) cin >> A[i];
if (A[4] - A[0] > A[5])
cout << ":(\n";
else
cout << "Yay!\n";
} | [
"literal.string.change",
"io.output.change"
] | 887,953 | 887,954 | u993688697 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
if (a[4] - a[0] > k)
cout << "Yay!";
else
cout << ":(";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
if (a[4] - a[0] <= k)
cout << "Yay!";
else
cout << ":(";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,961 | 887,962 | u340494803 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int K;
cin >> K;
int S = e - a;
if (S <= K) {
cout << "Yay" << endl;
} else {
cout << ":(" << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int K;
cin >> K;
int S = e - a;
if (S <= K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 887,967 | 887,968 | u813559924 | 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 s;
s = e - a;
if (s < 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;
int s;
s = e - a;
if (s > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,969 | 887,970 | u800100718 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[5];
int k;
bool tf = true;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 4; i++) {
for (int j = i; j < 5; j++)
if ((a[j] - a[i]) > k) {
tf = false;
}
}
if (tf) {
cout << "Yay!" << endl;
} else {
cout << ":)" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[5];
int k;
bool tf = true;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 4; i++) {
for (int j = i; j < 5; j++)
if ((a[j] - a[i]) > k) {
tf = false;
}
}
if (tf) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 887,971 | 887,972 | u868497027 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> 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;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
if (e - a > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,975 | 887,976 | u953110527 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> 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;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
if (e - a > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 887,977 | 887,976 | u953110527 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int arr[] = {a, b, c, d, e};
sort(arr, arr + 4);
// for(int i =0; i < 5; i++) {
// cout << arr[i] << endl;
// }
cout << (arr[4] - arr[0] < k ? "Yay!" : ":(") << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int arr[] = {a, b, c, d, e};
sort(arr, arr + 4);
// for(int i =0; i < 5; i++) {
// cout << arr[i] << endl;
// }
cout << (arr[4] - arr[0] <= k ? "Yay!" : ":(") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 887,981 | 887,982 | u439911726 | cpp |
p03075 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int i;
i = a - e;
if (i <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
system("pause");
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int i;
i = e - a;
if (i <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
system("pause");
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 887,997 | 887,998 | u705644950 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int num[5], k;
for (int i = 0; i < 5; i++)
cin >> num[i];
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 4; j++) {
if (num[j] - num[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int num[5], k;
for (int i = 0; i < 5; i++)
cin >> num[i];
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (num[j] - num[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 887,999 | 888,000 | u125693891 | 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;
} | #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;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 888,001 | 888,002 | u618953765 | cpp |
p03075 | #include <iostream>
int main() {
int p[6];
for (int i = 0; i < 6; ++i) {
std::cin >> p[i];
}
if ((p[4] - p[0]) < p[5]) {
std::cout << "Yay!" << std::endl;
} else {
std::cout << ":(" << std::endl;
}
return 0;
} | #include <iostream>
int main() {
int p[6];
for (int i = 0; i < 6; ++i) {
std::cin >> p[i];
}
if ((p[4] - p[0]) <= p[5]) {
std::cout << "Yay!" << std::endl;
} else {
std::cout << ":(" << std::endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,020 | 888,021 | u331630877 | cpp |
p03075 | #include <stdio.h>
int main(void) {
int num[6] = {0};
for (int i = 0; i < 6; i++) {
scanf("%d", num[i]);
getchar();
}
if (num[4] - num[0] > num[5]) {
printf(":(\n");
} else {
printf("Yay!\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int num[6] = {0};
for (int i = 0; i < 6; i++) {
scanf("%d", &num[i]);
getchar();
}
if (num[4] - num[0] > num[5]) {
printf(":(\n");
} else {
printf("Yay!\n");
}
return 0;
} | [
"expression.operation.unary.reference.add"
] | 888,022 | 888,023 | u337266378 | 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 << ((k <= (e - a)) ? ":(" : "Yay!");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << ((k < (e - a)) ? ":(" : "Yay!");
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 888,024 | 888,025 | u839270538 | cpp |
p03075 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
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>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
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.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,026 | 888,027 | u276682785 | cpp |
p03075 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
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>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
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"
] | 888,028 | 888,027 | u276682785 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define INF 1000000000000000
#define fi first
#define se second
#define all(v) v.begin(), v.end()
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
int to, cost;
};
typedef pair<int, int> P;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * 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;
}
bool kosa(double ax, double ay, double bx, double by, double cx, double cy,
double dx, double dy) { //線分の交差判定
double ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax);
double tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx);
double tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);
double td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);
return tc * td < 0 && ta * tb < 0;
}
int kaijo(int n) {
int ans = 1;
for (int i = 2; i <= n; i++) {
ans *= i;
ans %= MOD;
}
return ans;
}
int modpow(int a, int b) {
if (b == 0)
return 1;
if (b % 2)
return modpow(a, b - 1) * a % MOD;
return modpow(a, b / 2) * modpow(a, b / 2) % MOD;
}
int comb(int a, int b) {
return kaijo(a) * modpow(kaijo(a - b), MOD - 2) % MOD *
modpow(kaijo(b), MOD - 2) % MOD;
}
int a, b, c, d, e, k;
signed main() {
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
puts("Yay");
else
puts(":(");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define INF 1000000000000000
#define fi first
#define se second
#define all(v) v.begin(), v.end()
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
int to, cost;
};
typedef pair<int, int> P;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * 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;
}
bool kosa(double ax, double ay, double bx, double by, double cx, double cy,
double dx, double dy) { //線分の交差判定
double ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax);
double tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx);
double tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);
double td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);
return tc * td < 0 && ta * tb < 0;
}
int kaijo(int n) {
int ans = 1;
for (int i = 2; i <= n; i++) {
ans *= i;
ans %= MOD;
}
return ans;
}
int modpow(int a, int b) {
if (b == 0)
return 1;
if (b % 2)
return modpow(a, b - 1) * a % MOD;
return modpow(a, b / 2) * modpow(a, b / 2) % MOD;
}
int comb(int a, int b) {
return kaijo(a) * modpow(kaijo(a - b), MOD - 2) % MOD *
modpow(kaijo(b), MOD - 2) % MOD;
}
int a, b, c, d, e, k;
signed main() {
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
puts("Yay!");
else
puts(":(");
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 888,031 | 888,032 | u006686215 | cpp |
p03075 | #include <bits/stdc++.h>
///...................................*****.................................................///
/// Author : MD. Rakibul Islam ( mmdrakibul2912@gmail.com ) ///
/// Department of Computer Science /// & Engineering, ///
/// Comilla University , Bangladesh. ///
///...................................*****.................................................///
using namespace std;
int main() {
int n, m, i, j, k, l, a[5];
for (i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
bool x = 0;
for (i = 0; i < 4 - 1; i++) {
for (j = i + 1; j < 4; j++) {
if ((a[j] - a[i]) > k) {
x = 1;
break;
}
}
}
if (x == 1) {
cout << ":(" << endl;
} else
cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
///...................................*****.................................................///
/// Author : MD. Rakibul Islam ( mmdrakibul2912@gmail.com ) ///
/// Department of Computer Science /// & Engineering, ///
/// Comilla University , Bangladesh. ///
///...................................*****.................................................///
using namespace std;
int main() {
int n, m, i, j, k, l, a[5];
for (i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
bool x = 0;
for (i = 0; i < 5 - 1; i++) {
for (j = i + 1; j < 5; j++) {
if ((a[j] - a[i]) > k) {
x = 1;
break;
}
}
}
if (x == 1) {
cout << ":(" << endl;
} else
cout << "Yay!" << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 888,052 | 888,053 | u650872702 | 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;
int count = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (a[i] - a[j] >= k) {
count++;
}
}
}
if (count == 0) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #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;
int count = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (a[i] - a[j] > k) {
count++;
}
}
}
if (count == 0) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,055 | 888,056 | u440248708 | cpp |
p03075 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int a, b, c, d, e, k;
int mx, mn;
cin >> a >> b >> c >> d >> e >> k;
mx = a, mn = a;
if (mx < b)
mx = b;
if (mx < c)
mx = c;
if (mx < d)
mx = d;
if (mx < e)
mx = e;
if (mn < b)
mn = b;
if (mn < c)
mn = c;
if (mn < d)
mn = d;
if (mn < e)
mn = e;
if (mx - mn <= k)
cout << "Yay!";
else
cout << ":(";
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int a, b, c, d, e, k;
int mx, mn;
cin >> a >> b >> c >> d >> e >> k;
mx = a, mn = a;
if (mx < b)
mx = b;
if (mx < c)
mx = c;
if (mx < d)
mx = d;
if (mx < e)
mx = e;
if (mn > b)
mn = b;
if (mn > c)
mn = c;
if (mn > d)
mn = d;
if (mn > e)
mn = e;
if (mx - mn <= k)
cout << "Yay!";
else
cout << ":(";
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,057 | 888,058 | u770161743 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> ant(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> ant.at(i);
}
cin >> k;
if (ant.at(4) + ant.at(0) <= k) {
cout << "Yay!" << endl;
return 0;
}
cout << ":(" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> ant(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> ant.at(i);
}
cin >> k;
if (ant.at(4) - ant.at(0) <= k) {
cout << "Yay!" << endl;
return 0;
}
cout << ":(" << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 888,061 | 888,062 | u120711599 | 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 - a <= k) {
ans = "Yey!";
} else {
ans = ":(";
}
cout << ans << 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!";
} else {
ans = ":(";
}
cout << ans << endl;
}
| [
"literal.string.change",
"assignment.value.change"
] | 888,065 | 888,066 | u266479350 | 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 - a >= k) {
ans = "Yey!";
} else {
ans = ":(";
}
cout << ans << 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!";
} else {
ans = ":(";
}
cout << ans << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"assignment.value.change"
] | 888,068 | 888,066 | u266479350 | cpp |
p03075 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, c, d, e, f, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, c, d, e, f, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,069 | 888,070 | u673474826 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (e - a <= k ? ":(" : "Yay!") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (e - a > k ? ":(" : "Yay!") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 888,079 | 888,080 | u774202056 | cpp |
p03075 | #include <iostream>
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!";
} else {
cout << ":(";
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(";
} else {
cout << "Yay!";
}
} | [
"literal.string.change",
"io.output.change"
] | 888,081 | 888,082 | u779469681 | 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;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,085 | 888,086 | u689245321 | cpp |
p03075 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
using namespace std;
using ll = long long;
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
array<int, 6> a;
for (auto &x : a)
x = in();
cout << (((a[4] - a[0]) < a[5]) ? "Yay!" : ":(") << endl;
return 0;
} | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
using namespace std;
using ll = long long;
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
array<int, 6> a;
for (auto &x : a)
x = in();
cout << (((a[4] - a[0]) <= a[5]) ? "Yay!" : ":(") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 888,089 | 888,090 | u135248164 | 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!";
} else {
cout << ":(";
}
} | #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!";
} else {
cout << ":(";
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,098 | 888,099 | u103305058 | cpp |
p03075 | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define ld long double
#define el '\n'
#define PI (ld)3.14159265358979323846
#define inf (ll)1000000000
#define mod (ll)1000000007
#define mod1 (ll)998244353
#define fo(i, n) for (long long i = 0; i < int(n); i++)
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pqueue priority_queue<int>
#define pdqueue priority_queue<int, vi, greater<int>>
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(a) a.size()
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define vl vector<ll>
//#define x ff
//#define y ss
#define pt(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
using namespace std;
double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }
/*vector<int> parent, rak;
int find_set(int v) {
if (v == parent[v])
return v;
return parent[v] = find_set(parent[v]);
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b) {
if (rak[a] < rak[b])
swap(a, b);
parent[b] = a;
rank[a]+=rank[b];
}
}*/
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll extend_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll ans = extend_gcd(b, a % b, x1, y1);
x = y1;
y = x1 - (a / b) * y1;
return ans;
}
ll inverse(ll a, ll m) {
ll x, y;
extend_gcd(m, a, x, y);
y %= m;
y += m;
y %= m;
return y;
}
/*const int N = 1000001;
int lp[N+1];
vector<int> pr;
void s(){
for (int i=2; i<=N; ++i) {
if (lp[i] == 0) {
lp[i] = i;
pr.push_back (i);
}
for (int j=0; j<(int)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
lp[i * pr[j]] = pr[j];
}
}*/
ll kv;
ll t, n, x, y, h, k, z, p, q, w;
// vector<vector<ll>>v;
// vector<ll>vis,d;
int main() {
IOS;
cin >> x >> y >> z >> h >> p >> k;
if (p - x <= k)
cout << "yay";
else
cout << ":(";
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define ld long double
#define el '\n'
#define PI (ld)3.14159265358979323846
#define inf (ll)1000000000
#define mod (ll)1000000007
#define mod1 (ll)998244353
#define fo(i, n) for (long long i = 0; i < int(n); i++)
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pqueue priority_queue<int>
#define pdqueue priority_queue<int, vi, greater<int>>
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(a) a.size()
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define vl vector<ll>
//#define x ff
//#define y ss
#define pt(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
using namespace std;
double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }
/*vector<int> parent, rak;
int find_set(int v) {
if (v == parent[v])
return v;
return parent[v] = find_set(parent[v]);
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b) {
if (rak[a] < rak[b])
swap(a, b);
parent[b] = a;
rank[a]+=rank[b];
}
}*/
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll extend_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll ans = extend_gcd(b, a % b, x1, y1);
x = y1;
y = x1 - (a / b) * y1;
return ans;
}
ll inverse(ll a, ll m) {
ll x, y;
extend_gcd(m, a, x, y);
y %= m;
y += m;
y %= m;
return y;
}
/*const int N = 1000001;
int lp[N+1];
vector<int> pr;
void s(){
for (int i=2; i<=N; ++i) {
if (lp[i] == 0) {
lp[i] = i;
pr.push_back (i);
}
for (int j=0; j<(int)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
lp[i * pr[j]] = pr[j];
}
}*/
ll kv;
ll t, n, x, y, h, k, z, p, q, w;
// vector<vector<ll>>v;
// vector<ll>vis,d;
int main() {
IOS;
cin >> x >> y >> z >> h >> p >> k;
if (p - x <= k)
cout << "Yay!";
else
cout << ":(";
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 888,108 | 888,109 | u524492594 | cpp |
p03075 | #include <bits/stdc++.h>
#include <iostream>
#define pb push_back
#define mp make_pair
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for (int i = (a); i <= (n); ++i)
#define repst(i, n) for (auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for (int i = (n); i >= (a); --i)
typedef long long ll;
const int inf = int(2e9);
const int mod = inf + 7;
using namespace std;
void solve() {
int a[5];
for (int i = 0; i < 5; ++i)
cin >> a[i];
int k;
cin >> k;
for (int i = 0; i < 5; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (abs(a[i] - a[j]) >= k) {
cout << ":(";
return;
}
}
}
cout << "Yay!";
}
int main() {
Red;
solve();
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#define pb push_back
#define mp make_pair
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for (int i = (a); i <= (n); ++i)
#define repst(i, n) for (auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for (int i = (n); i >= (a); --i)
typedef long long ll;
const int inf = int(2e9);
const int mod = inf + 7;
using namespace std;
void solve() {
int a[5];
for (int i = 0; i < 5; ++i)
cin >> a[i];
int k;
cin >> k;
for (int i = 0; i < 5; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (abs(a[i] - a[j]) > k) {
cout << ":(";
return;
}
}
}
cout << "Yay!";
}
int main() {
Red;
solve();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,116 | 888,117 | u235396011 | cpp |
p03075 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int arr[6];
for (int i = 0; i < 5; i++) {
cin >> arr[i];
}
int k;
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (abs(arr[j] - arr[i]) > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "yay!" << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int arr[6];
for (int i = 0; i < 5; i++) {
cin >> arr[i];
}
int k;
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (abs(arr[j] - arr[i]) > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 888,120 | 888,121 | u530723373 | cpp |
p03075 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int arr[6];
for (int i = 0; i < 5; i++) {
cin >> arr[i];
}
int k;
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (arr[j] - arr[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "yay!" << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int arr[6];
for (int i = 0; i < 5; i++) {
cin >> arr[i];
}
int k;
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (abs(arr[j] - arr[i]) > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 888,122 | 888,121 | u530723373 | 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;
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 (e - a <= K) {
cout << "Yay!" << endl;
}
else
cout << ":(" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,131 | 888,132 | u785409986 | 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;
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 (e - a <= 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"
] | 888,133 | 888,132 | u785409986 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[7], k;
for (int i = 1; i <= 5; i++)
cin >> a[i];
cin >> k;
for (int i = 1; i <= 5; i++)
for (int j = i + 1; j <= 5; j++) {
if (a[j] - a[i] >= k) {
cout << ":(";
return 0;
}
}
cout << "Yay!";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a[7], k;
for (int i = 1; i <= 5; i++)
cin >> a[i];
cin >> k;
for (int i = 1; i <= 5; i++)
for (int j = i + 1; j <= 5; j++) {
if (a[j] - a[i] > k) {
cout << ":(";
return 0;
}
}
cout << "Yay!";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,137 | 888,138 | u198891841 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[7], k;
for (int i = 1; i <= 5; i++)
cin >> a[i];
cin >> k;
for (int i = 1; i <= 5; i++)
for (int j = i + 1; j <= 5; j++) {
if (a[j] - a[i] >= k) {
cout << ":(";
return 0;
}
}
cout << "Yay!";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a[7], k;
for (int i = 1; i <= 5; i++)
cin >> a[i];
cin >> k;
for (int i = 1; i <= 5; i++)
for (int j = i + 1; j <= 5; j++) {
if (a[j] - a[i] > k) {
cout << ":(";
return 0;
}
}
cout << "Yay!";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,139 | 888,138 | u198891841 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.