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 <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> distance(5);
int k;
for (int i = 0; i < 5; ++i)
cin >> distance[i];
cin >> k;
for (int i = 0; i < 5; ++i) {
if (k < distance[i]) {
cout << ":(" << endl;
return 0;
}
}
cout << "Yay!" << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> distance(5);
int k;
for (int i = 0; i < 5; ++i)
cin >> distance[i];
cin >> k;
for (int i = 0; i < 5; ++i) {
if (k < distance[i] - distance[0]) {
cout << ":(" << endl;
return 0;
}
}
cout << "Yay!" << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 886,340 | 886,341 | u323542775 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x;
int k;
for (int i = 0; i < 5; i++) {
cin >> x.at(i);
}
cin >> k;
sort(x.begin(), x.end());
if (x.at(4) - x.at(0) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> x.at(i);
}
cin >> k;
sort(x.begin(), x.end());
if (x.at(4) - x.at(0) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"call.arguments.add"
] | 886,344 | 886,345 | u630211216 | cpp |
p03075 | #include <algorithm> //辞書順=next_permutation
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <locale>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string> //char 小文字のほうが32大きい
#include <time.h>
#include <utility> //swap=数値交換
#include <vector> //s1.erase(n)=文字列s1の、n文字目以降削除
#define rt "\n"
#define rep(i, n) for (int i = 0; i < n; i++)
#define rop(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define drop(i, n) for (int i = n; 0 < i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << rt; \
else \
cout << "no" << rt;
#define Yes(ans) \
if (ans) \
cout << "Yes" << rt; \
else \
cout << "No" << rt;
#define YES(ans) \
if (ans) \
cout << "YES" << rt; \
else \
cout << "NO" << rt;
#define sec(a, b, ans) \
if (ans) \
cout << a << rt; \
else \
cout << b << rt;
#define vcin(s, n) rep(i, n) cin >> s[i]; // vcin(配列名),(繰り返し回数)
#define sort(s) sort(s.begin(), s.end()) //標準=昇順
#define reve(s) reverse(s.begin(), s.end())
#define asas int ans = 0
#define llcncn llint cnt = 0
#define llasas llint ans = 0
#define str string
#define please return
#define AC 0
#define Rapid \
cin.tie(0); \
ios::sync_with_stdio(false)
#define Pi 3.1415926535897932384626
#define nine 1000000000
using namespace std;
typedef vector<int> vint;
typedef vector<string> vstr;
typedef vector<char> vchar;
typedef vector<double> vdou;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, llint> pllint;
typedef vector<llint> vllint;
typedef vector<pint> vpint;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vector<int>> vvint;
typedef vector<vector<char>> vvchar;
typedef vector<vector<llint>> vvllint;
typedef vector<vector<string>> vvstr;
typedef vector<vector<bool>> vvbool;
typedef vector<vector<pint>> vvpint;
typedef vector<bool> vbool;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
long long LCM(long long a, long long b) { return a * b / GCD(a, b); }
unsigned GetDigit(unsigned num) { return std::to_string(num).length(); }
int tow(int n) { // 2のn乗
if (n == 0)
return 1;
int x = tow(n / 2);
x *= x;
if (n % 2 == 1)
x *= 2;
return x; //@domino
}
/*
(char)toupper(a[n])=文字列のn文字目を大文字で出力
pow(a,b)=aのb乗
*/
int a = 0, b = 0, c = 0;
int main(void) {
Rapid; //固定高速
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
if (k < d - a)
cout << ":(" << rt;
else
cout << "Yay!" << rt;
please AC;
}
| #include <algorithm> //辞書順=next_permutation
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <locale>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string> //char 小文字のほうが32大きい
#include <time.h>
#include <utility> //swap=数値交換
#include <vector> //s1.erase(n)=文字列s1の、n文字目以降削除
#define rt "\n"
#define rep(i, n) for (int i = 0; i < n; i++)
#define rop(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define drop(i, n) for (int i = n; 0 < i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << rt; \
else \
cout << "no" << rt;
#define Yes(ans) \
if (ans) \
cout << "Yes" << rt; \
else \
cout << "No" << rt;
#define YES(ans) \
if (ans) \
cout << "YES" << rt; \
else \
cout << "NO" << rt;
#define sec(a, b, ans) \
if (ans) \
cout << a << rt; \
else \
cout << b << rt;
#define vcin(s, n) rep(i, n) cin >> s[i]; // vcin(配列名),(繰り返し回数)
#define sort(s) sort(s.begin(), s.end()) //標準=昇順
#define reve(s) reverse(s.begin(), s.end())
#define asas int ans = 0
#define llcncn llint cnt = 0
#define llasas llint ans = 0
#define str string
#define please return
#define AC 0
#define Rapid \
cin.tie(0); \
ios::sync_with_stdio(false)
#define Pi 3.1415926535897932384626
#define nine 1000000000
using namespace std;
typedef vector<int> vint;
typedef vector<string> vstr;
typedef vector<char> vchar;
typedef vector<double> vdou;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, llint> pllint;
typedef vector<llint> vllint;
typedef vector<pint> vpint;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vector<int>> vvint;
typedef vector<vector<char>> vvchar;
typedef vector<vector<llint>> vvllint;
typedef vector<vector<string>> vvstr;
typedef vector<vector<bool>> vvbool;
typedef vector<vector<pint>> vvpint;
typedef vector<bool> vbool;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
long long LCM(long long a, long long b) { return a * b / GCD(a, b); }
unsigned GetDigit(unsigned num) { return std::to_string(num).length(); }
int tow(int n) { // 2のn乗
if (n == 0)
return 1;
int x = tow(n / 2);
x *= x;
if (n % 2 == 1)
x *= 2;
return x; //@domino
}
/*
(char)toupper(a[n])=文字列のn文字目を大文字で出力
pow(a,b)=aのb乗
*/
int a = 0, b = 0, c = 0;
int main(void) {
Rapid; //固定高速
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
if (k < e - a)
cout << ":(" << rt;
else
cout << "Yay!" << rt;
please AC;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 886,357 | 886,358 | u742306624 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
//================================================
int a = 0, b = 0, c, d, n, k = 0;
string s, t;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
bool x = true;
if (e - a > k)
x = false;
if (e - b > k)
x = false;
if (e - c > k)
x = false;
if (e - d > k)
x = false;
if (d - a > k)
x = false;
if (d - b > k)
x = false;
if (d - c > k)
x = false;
if (c - a > k)
x = false;
if (c - b > k)
x = false;
if (b - a > k)
x = false;
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
//================================================
int a = 0, b = 0, c, d, n, k = 0;
string s, t;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e >> k;
bool x = true;
if (e - a > k)
x = false;
if (e - b > k)
x = false;
if (e - c > k)
x = false;
if (e - d > k)
x = false;
if (d - a > k)
x = false;
if (d - b > k)
x = false;
if (d - c > k)
x = false;
if (c - a > k)
x = false;
if (c - b > k)
x = false;
if (b - a > k)
x = false;
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 886,364 | 886,365 | u465760322 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define F(i, s, e) for (int i = s; i < e; ++i)
int main() {
int a[5], k;
F(i, 0, 5) cin >> a[i];
cin >> k;
bool f = true;
F(i, 1, 5) {
F(j, 0, i) {
if (a[i] - a[j] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yey!" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define F(i, s, e) for (int i = s; i < e; ++i)
int main() {
int a[5], k;
F(i, 0, 5) cin >> a[i];
cin >> k;
bool f = true;
F(i, 1, 5) {
F(j, 0, i) {
if (a[i] - a[j] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 886,366 | 886,367 | u561007032 | cpp |
p03075 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
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;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
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;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 886,368 | 886,369 | u614128939 | 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;
vector<int> n{a, b, c, d, e, k};
sort(n.begin(), n.end());
if (n[5] - n[0] <= 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;
vector<int> n{a, b, c, d, e};
sort(n.begin(), n.end());
if (n[4] - n[0] <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 886,370 | 886,371 | u050641473 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> e >> d >> k;
cout << ((e - a <= k) ? "Yay!" : ":(") << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << ((e - a <= k) ? "Yay!" : ":(") << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 886,380 | 886,381 | u190761897 | cpp |
p03075 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v(5);
for (auto &i : v) {
cin >> i;
}
int k;
cin >> k;
bool yes = true;
for (auto &i : v) {
for (auto &j : v) {
if (k < abs(i - j)) {
yes = false;
}
}
}
if (yes) {
cout << "Yay!" << endl;
} else {
cout << ": (" << endl;
}
return 0;
} | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v(5);
for (auto &i : v) {
cin >> i;
}
int k;
cin >> k;
bool yes = true;
for (auto &i : v) {
for (auto &j : v) {
if (k < abs(i - j)) {
yes = false;
}
}
}
if (yes) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 886,386 | 886,387 | u611571299 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
if (E - A >= K)
cout << "Yay!";
else
cout << ":(";
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
if (E - A <= K)
cout << "Yay!";
else
cout << ":(";
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,388 | 886,389 | u545364250 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
if (E - A <= 0)
cout << "Yay!";
else
cout << ":(";
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
if (E - A <= K)
cout << "Yay!";
else
cout << ":(";
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 886,390 | 886,389 | u545364250 | cpp |
p03075 | #include <iostream>
// #include <string>
// #include <iomanip>
// std::cout << std::fixed << std::setprecision(5);
int main() {
int dist[6] = {0}, k;
for (int i = 0; i < 5; i++)
std::cin >> dist[i];
std::cin >> k;
if (dist[4] - dist[0] >= k)
std::cout << ":(" << std::endl;
else
std::cout << "Yay!" << std::endl;
return 0;
} | #include <iostream>
// #include <string>
// #include <iomanip>
// std::cout << std::fixed << std::setprecision(5);
int main() {
int dist[6] = {0}, k;
for (int i = 0; i < 5; i++)
std::cin >> dist[i];
std::cin >> k;
if (dist[4] - dist[0] > k)
std::cout << ":(" << std::endl;
else
std::cout << "Yay!" << std::endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,391 | 886,392 | u954659213 | 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;
if (A[4] - A[0] <= k) {
cout << "Yey!";
} else {
cout << ":(";
}
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;
if (A[4] - A[0] <= k) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 886,393 | 886,394 | u614217744 | 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;
if (A[4] - A[0] < k) {
cout << "Yey!";
} else {
cout << ":(";
}
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;
if (A[4] - A[0] <= k) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 886,395 | 886,394 | u614217744 | 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;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (abs(a[i] - a[j] > k)) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5], k;
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 (abs(a[i] - a[j]) > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 886,400 | 886,401 | u385825353 | cpp |
p03075 | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#include <bits/stdc++.h>
#define pb(X) push_back(X)
#define x first
#define y second
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
using namespace std;
typedef pair<int, int> pii;
int n, a, b, c, d, q, ans;
int main() {
INIT int A[5];
for (int i = 0; i < 5; ++i) {
cin >> A[i];
}
cin >> d;
b = *min_element(A, A + 5);
c = *max_element(A, A + 5);
if (c - b < d)
cout << "Yay!\n";
else
cout << ":(\n";
return 0;
} | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#include <bits/stdc++.h>
#define pb(X) push_back(X)
#define x first
#define y second
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
using namespace std;
typedef pair<int, int> pii;
int n, a, b, c, d, q, ans;
int main() {
INIT int A[5];
for (int i = 0; i < 5; ++i) {
cin >> A[i];
}
cin >> d;
b = *min_element(A, A + 5);
c = *max_element(A, A + 5);
if (c - b <= d)
cout << "Yay!\n";
else
cout << ":(\n";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,402 | 886,403 | u786454404 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
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>
#define rep(i, n) for (int i = 0; i < (n); ++i)
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;
}
| [
"literal.string.change",
"io.output.change"
] | 886,404 | 886,405 | u589238650 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, e, k;
cin >> a >> e >> e >> e >> e >> k;
if (e - a > k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, e, k;
cin >> a >> e >> e >> e >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,408 | 886,409 | u608258653 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define INF 1e9
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
vector<int> a(5);
rep(i, 5) cin >> a[i];
int k;
cin >> k;
rep(i, 4) {
REP(j, i + 1, 4) {
if (a[j] - a[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define INF 1e9
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
vector<int> a(5);
rep(i, 5) cin >> a[i];
int k;
cin >> k;
rep(i, 4) {
REP(j, i + 1, 5) {
if (a[j] - a[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 886,414 | 886,415 | u328179672 | cpp |
p03075 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define vecin(n, a) rep(i, n) scanf("%d", &a[i])
using ll = long long;
const int INF = 1073741823;
const int MINF = -1073741823;
const ll LINF = ll(4661686018427387903);
const ll MOD = 1000000007;
const double PI = acos(-1);
using namespace std;
void scans(string &str) {
char c;
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
int a, b, k;
scanf("%d%*d%*d%*d%d%d", &a, &b, &k);
printf("%s\n", b - a <= k ? "Ysy!" : ":(");
Please AC;
}
| /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define vecin(n, a) rep(i, n) scanf("%d", &a[i])
using ll = long long;
const int INF = 1073741823;
const int MINF = -1073741823;
const ll LINF = ll(4661686018427387903);
const ll MOD = 1000000007;
const double PI = acos(-1);
using namespace std;
void scans(string &str) {
char c;
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
int a, b, k;
scanf("%d%*d%*d%*d%d%d", &a, &b, &k);
printf("%s\n", b - a <= k ? "Yay!" : ":(");
Please AC;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 886,423 | 886,424 | u917972976 | cpp |
p03075 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
typedef long long int ll;
using namespace std;
int main() {
ll 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>
#include <cmath>
#include <cstdio>
#include <iostream>
typedef long long int ll;
using namespace std;
int main() {
ll 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"
] | 886,442 | 886,443 | u473023730 | 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 << ":(";
else
cout << "Yay!";
;
}
| #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 << ":(";
else
cout << "Yay!";
;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 886,457 | 886,458 | u260907804 | 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 - k) > k)
cout << ":(";
else
cout << "Yay!";
;
}
| #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 << ":(";
else
cout << "Yay!";
;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 886,459 | 886,458 | u260907804 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
#define FOUT(n, dist) cout << fixed << setprecision(n) << (dist);
#define BR cout << endl;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define ALL(v) v.begin(), v.end()
typedef long long ll;
const ll mod = 1000000007;
ll powmod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) {
res = res * x % mod;
}
return res;
}
double expect(int x) {
double kitai, tem = 0;
for (int i = 1; i <= x; i++) {
tem += i;
}
kitai = tem / x;
cout << kitai << endl;
return kitai;
}
int main() {
int dist[5];
rep(i, 5) cin >> dist[i];
int k;
cin >> k;
for (int j = 0; j < 4; j++) {
for (int i = 0; i < 4; i++) {
if (dist[i] - dist[j] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
#define FOUT(n, dist) cout << fixed << setprecision(n) << (dist);
#define BR cout << endl;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define ALL(v) v.begin(), v.end()
typedef long long ll;
const ll mod = 1000000007;
ll powmod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) {
res = res * x % mod;
}
return res;
}
double expect(int x) {
double kitai, tem = 0;
for (int i = 1; i <= x; i++) {
tem += i;
}
kitai = tem / x;
cout << kitai << endl;
return kitai;
}
int main() {
int dist[5];
rep(i, 5) cin >> dist[i];
int k;
cin >> k;
for (int j = 0; j < 5; j++) {
for (int i = 0; i < 5; i++) {
if (dist[i] - dist[j] > 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"
] | 886,194 | 886,195 | u608329742 | cpp |
p03075 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
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 <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
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"
] | 886,196 | 886,197 | u965730380 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool check = true;
if (b - a > k || c - a > k || d - a > k || e - a > k || c - b > k ||
d - b > k || e - b > k || d - c > k || e - c > k || e - d > k)
check = false;
if (check)
cout << "Yay" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool check = true;
if (b - a > k || c - a > k || d - a > k || e - a > k || c - b > k ||
d - b > k || e - b > k || d - c > k || e - c > k || e - d > k)
check = false;
if (check)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 886,198 | 886,199 | u985625318 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool check = true;
if (b - a > k || c - a > k || d - a > k || e - a > k || c - b > k ||
d - b > k || e - b > k || d - c > k || e - c > k || e - d < k)
check = false;
if (check)
cout << "Yay" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool check = true;
if (b - a > k || c - a > k || d - a > k || e - a > k || c - b > k ||
d - b > k || e - b > k || d - c > k || e - c > k || e - d > k)
check = false;
if (check)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 886,200 | 886,199 | u985625318 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool t = (k <= e - a);
if (t) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool t = (k < e - a);
if (t) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | [
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 886,201 | 886,202 | u469152073 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool t = (k > e - a);
if (t) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool t = (k < e - a);
if (t) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 886,203 | 886,202 | u469152073 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> e >> k;
bool t = false;
if (b - a > k) {
t = true;
}
if (c - b > k) {
t = true;
}
if (d - c > k) {
t = true;
}
if (e - d > k) {
t = true;
}
if (c - a > k) {
t = true;
}
if (d - b > k) {
t = true;
}
if (e - c > k) {
t = true;
}
if (d - a > k) {
t = true;
}
if (e - b > k) {
t = true;
}
if (e - a > k) {
t = true;
}
if (t == true) {
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;
bool t = false;
if (b - a > k) {
t = true;
}
if (c - b > k) {
t = true;
}
if (d - c > k) {
t = true;
}
if (e - d > k) {
t = true;
}
if (c - a > k) {
t = true;
}
if (d - b > k) {
t = true;
}
if (e - c > k) {
t = true;
}
if (d - a > k) {
t = true;
}
if (e - b > k) {
t = true;
}
if (e - a > k) {
t = true;
}
if (t == true) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | [
"expression.operation.binary.add"
] | 886,205 | 886,206 | u292417719 | cpp |
p03075 | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
vector<int> v(5);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
int k;
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
int d = abs(v[i] - v[j - 1]);
if (d > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
vector<int> v(5);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
int k;
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
int d = abs(v[i] - v[j]);
if (d > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
} | [
"expression.operation.binary.remove"
] | 886,207 | 886,208 | u295279251 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
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 < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
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"
] | 886,211 | 886,212 | u848148267 | 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 << ":(";
}
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 << "Yay!";
} else {
cout << ":(";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,217 | 886,218 | u863370423 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> ans(5);
int a;
for (int i = 0; i < 5; i++)
cin >> ans.at(i);
cin >> a;
sort(ans.begin(), ans.end());
if ((ans.at(0) - ans.at(4)) > a)
cout << ":(";
else
cout << "Yay!";
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> ans(5);
int a;
for (int i = 0; i < 5; i++)
cin >> ans.at(i);
cin >> a;
sort(ans.begin(), ans.end());
if (abs(ans.at(0) - ans.at(4)) > a)
cout << ":(";
else
cout << "Yay!";
} | [
"call.add",
"control_flow.branch.if.condition.change"
] | 886,219 | 886,220 | u079532978 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(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;
cout << ((d - a > k) ? ":(" : "Yay!") << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(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;
cout << ((e - a > k) ? ":(" : "Yay!") << '\n';
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 886,221 | 886,222 | u119171625 | cpp |
p03075 | #pragma region header
#define _GLIBCXX_DEBUG
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_string
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vs vector<string>
#define vvs vector<vector<string>>
#define pq priority_queue<int>
#define smallpq priority_queue<int, vector<int>, greater<int>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
bool isprime(ll a) //素数判定、primeならtrue,違うならfalse
{
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2) {
if (a % i == 0) {
return false;
}
}
// 素数である
return true;
}
ll keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
vi H(5);
int k;
rep(i, 5) { cin >> H[i]; }
cin >> k;
bool b = true;
rep(i, 4) {
for (int j = 0; j > i; j++) {
if (H[j] - H[i] > k)
b = false;
}
}
if (b)
puts("Yay!");
else
puts(":(");
}
| #pragma region header
#define _GLIBCXX_DEBUG
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_string
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vs vector<string>
#define vvs vector<vector<string>>
#define pq priority_queue<int>
#define smallpq priority_queue<int, vector<int>, greater<int>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
bool isprime(ll a) //素数判定、primeならtrue,違うならfalse
{
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2) {
if (a % i == 0) {
return false;
}
}
// 素数である
return true;
}
ll keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
vi H(5);
int k;
rep(i, 5) { cin >> H[i]; }
cin >> k;
bool b = true;
rep(i, 4) {
for (int j = i + 1; j < 5; j++) {
if (H[j] - H[i] > k)
b = false;
}
}
if (b)
puts("Yay!");
else
puts(":(");
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 886,228 | 886,229 | u851044959 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (e - a < k ? "Yay!\n" : ":(\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (e - a <= k ? "Yay!\n" : ":(\n");
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 886,238 | 886,239 | u120143737 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int k;
vector<int> v(5);
rep(i, 5) scanf("%d", &v[i]);
scanf("%d", &k);
rep(i, 5) {
rep(j, 5) {
if (abs(v[i] - v[j]) >= k) {
cout << ":(\n";
return 0;
}
}
}
cout << "Yay!\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int k;
vector<int> v(5);
rep(i, 5) scanf("%d", &v[i]);
scanf("%d", &k);
rep(i, 5) {
rep(j, 5) {
if (abs(v[i] - v[j]) > k) {
cout << ":(\n";
return 0;
}
}
}
cout << "Yay!\n";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,242 | 886,243 | u776463615 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, d, e, k;
string S, T;
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() {
long long int a, b, c, d, e, k;
string S, T;
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"
] | 886,249 | 886,250 | u805277811 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int ae = abs(e - a);
if (ae < k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int ae = e - a;
if (ae <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"call.remove",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,251 | 886,252 | u044960702 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int ae = e - a;
if (ae < k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int ae = e - a;
if (ae <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,253 | 886,252 | u044960702 | 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 ((d - a) <= k) {
cout << "Yay!" << endl;
return 0;
}
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;
return 0;
}
else {
cout << ":(" << endl;
return 0;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 886,261 | 886,262 | u948917469 | cpp |
p03075 | /*
In the name of Allah
MohammadErfan Gooneh
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl '\n'
#define all(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << endl;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
const ll MAXN = 1e6 + 10;
const ll INF = 8e18;
const ll MOD = 1e9 + 7;
int main() {
IOS;
int a[5], k;
for (int i = 0; i < 5; i++)
cin >> a[i];
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i; j >= 0; j--) {
if (abs(a[i] - a[j]) >= k) {
cout << ":(";
return 0;
}
}
}
cout << "Yay!";
return 0;
}
| /*
In the name of Allah
MohammadErfan Gooneh
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl '\n'
#define all(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << endl;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
const ll MAXN = 1e6 + 10;
const ll INF = 8e18;
const ll MOD = 1e9 + 7;
int main() {
IOS;
int a[5], k;
for (int i = 0; i < 5; i++)
cin >> a[i];
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i; j >= 0; j--) {
if (abs(a[i] - a[j]) > k) {
cout << ":(";
return 0;
}
}
}
cout << "Yay!";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,270 | 886,271 | u001975975 | 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;
if (a[4] - a[0] <= k)
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;
if (a[4] - a[0] <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 886,272 | 886,273 | u528258842 | 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;
if (a[0] - a[4] <= k)
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;
if (a[4] - a[0] <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 886,274 | 886,273 | u528258842 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vi x(5);
int k;
rep(i, 5) cin >> x[i];
cin >> k;
string ans = "Yay!";
rep(i, 4) {
rep(j, 4 - i) {
if (x[j + i] - x[i] > k) {
ans = ":(";
break;
}
}
if (ans == ":(")
break;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vi x(5);
int k;
rep(i, 5) cin >> x[i];
cin >> k;
string ans = "Yay!";
rep(i, 4) {
rep(j, 4 - i) {
if (x[j + i + 1] - x[i] > k) {
ans = ":(";
break;
}
}
if (ans == ":(")
break;
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 886,275 | 886,276 | u264721671 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vi x(5);
int k;
rep(i, 5) cin >> x[i];
cin >> k;
string ans = "Yay!";
rep(i, 4) {
rep(j, 4 - i) {
if (x[j] - x[i] > k) {
ans = ":(";
break;
}
}
if (ans == ":(")
break;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vi x(5);
int k;
rep(i, 5) cin >> x[i];
cin >> k;
string ans = "Yay!";
rep(i, 4) {
rep(j, 4 - i) {
if (x[j + i + 1] - x[i] > k) {
ans = ":(";
break;
}
}
if (ans == ":(")
break;
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 886,277 | 886,276 | u264721671 | 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 << "Yay!";
else
cout << ":(";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,278 | 886,279 | u713574885 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
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;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
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;
}
}
| [
"literal.string.change",
"io.output.change"
] | 886,280 | 886,281 | u072293789 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
if (A + K >= E) {
cout << "Yay" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
if (A + K >= E) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 886,290 | 886,462 | u127228093 | cpp |
p03075 | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#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;
#define deb(x) cout << #x << " is " << x << "\n"
#define int long long
#define mod 1000000007LL
#define PI acosl(-1)
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void solve() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int mn = min({a, b, c, d, e});
int mx = max({a, b, c, d, e});
if (mx - mn <= k) {
// can communicate
cout << ":(";
} else {
// can not communicate
cout << "Yay!";
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
} | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#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;
#define deb(x) cout << #x << " is " << x << "\n"
#define int long long
#define mod 1000000007LL
#define PI acosl(-1)
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void solve() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int mn = min({a, b, c, d, e});
int mx = max({a, b, c, d, e});
if (mx - mn > k) {
// can not communicate
cout << ":(";
} else {
// can communicate
cout << "Yay!";
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,469 | 886,470 | u752949890 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; n > i; ++i)
#define MOD 1000000007
using namespace std;
using ll = int64_t;
using pii = pair<int, int>;
using vi = vector<int>;
using VI = vector<ll>;
using vis = vector<string>;
using vvi = vector<vi>;
//最大公約数
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
//最小公倍数
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool prime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
return 0;
} else
cout << "Yey!" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; n > i; ++i)
#define MOD 1000000007
using namespace std;
using ll = int64_t;
using pii = pair<int, int>;
using vi = vector<int>;
using VI = vector<ll>;
using vis = vector<string>;
using vvi = vector<vi>;
//最大公約数
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
//最小公倍数
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool prime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
return 0;
} else
cout << "Yay!" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 886,471 | 886,472 | u270535768 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define MOD 1000000007
int main() {
fast;
ll x = 5;
vector<ll> a(x);
for (int i = 0; i < x; i++)
cin >> a[i];
ll k;
cin >> k;
if (a[4] - a[0] < k)
cout << ":(";
else
cout << "Yay!";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define MOD 1000000007
int main() {
fast;
ll x = 5;
vector<ll> a(x);
for (int i = 0; i < x; i++)
cin >> a[i];
ll k;
cin >> k;
if (a[4] - a[0] > k)
cout << ":(";
else
cout << "Yay!";
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,476 | 886,477 | u972911059 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n = 5;
int a[n];
rep(i, n) cin >> a[i];
int k;
cin >> k;
cout << (abs(a[0] - a[4]) < k ? "Yay!" : ":(") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n = 5;
int a[n];
rep(i, n) cin >> a[i];
int k;
cin >> k;
cout << (abs(a[0] - a[4]) <= k ? "Yay!" : ":(") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 886,488 | 886,489 | u075775814 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define MOD 1000000007
#define INF 1000000000
void solve_abc_a() {
ll n, m;
// ll x, y;
ll a, b, d;
// ll c;
// char c;
// ll h, w;
ll k;
string s, t;
ll l_ans = 0;
string s_ans = "NG";
ll l, r;
V x(5);
rep(i, 5) cin >> x[i];
cin >> k;
s_ans = "Yay!";
rep(i, 4) {
rep(j, 4) {
if (i < j && x[j] - x[i] > k) {
s_ans = ":(";
break;
}
}
}
cout << s_ans << "\n";
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
cout << setprecision(7);
solve_abc_a();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define MOD 1000000007
#define INF 1000000000
void solve_abc_a() {
ll n, m;
// ll x, y;
ll a, b, d;
// ll c;
// char c;
// ll h, w;
ll k;
string s, t;
ll l_ans = 0;
string s_ans = "NG";
ll l, r;
V x(5);
rep(i, 5) cin >> x[i];
cin >> k;
s_ans = "Yay!";
rep(i, 5) {
rep(j, 5) {
if (i < j && x[j] - x[i] > k) {
s_ans = ":(";
break;
}
}
}
cout << s_ans << "\n";
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
cout << setprecision(7);
solve_abc_a();
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 886,499 | 886,500 | u145179061 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll prev = 0;
vector<ll> A(5);
ll k;
rep(i, 4) cin >> A[i];
cin >> k;
rep(i, 5) {
rep2(j, i + 1, 5) {
if (A[j] - A[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll prev = 0;
vector<ll> A(5);
ll k;
rep(i, 5) cin >> A[i];
cin >> k;
rep(i, 4) {
rep2(j, i + 1, 5) {
if (A[j] - A[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 886,503 | 886,504 | u196953553 | cpp |
p03075 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define coutv(v) \
for (int i = 0; i < (v).size(); ++i) \
cout << v[i] << ' '; \
cout << endl;
#define coutvv(v) \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cout << v[i][j] << ' '; \
cout << endl; \
}
#define debugv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) \
cerr << v[i] << ' '; \
cerr << endl; \
}
#define debugvv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cerr << v[i][j] << ' '; \
cerr << endl; \
} \
}
#define TC \
int TESTCASE; \
cin >> TESTCASE; \
while (TESTCASE--)
typedef long long ll;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f >= e - a + 1) {
cout << ":(";
} else {
cout << "Yay!";
}
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define coutv(v) \
for (int i = 0; i < (v).size(); ++i) \
cout << v[i] << ' '; \
cout << endl;
#define coutvv(v) \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cout << v[i][j] << ' '; \
cout << endl; \
}
#define debugv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) \
cerr << v[i] << ' '; \
cerr << endl; \
}
#define debugvv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cerr << v[i][j] << ' '; \
cerr << endl; \
} \
}
#define TC \
int TESTCASE; \
cin >> TESTCASE; \
while (TESTCASE--)
typedef long long ll;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f < e - a) {
cout << ":(";
} else {
cout << "Yay!";
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 886,505 | 886,506 | u641638265 | cpp |
p03075 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define coutv(v) \
for (int i = 0; i < (v).size(); ++i) \
cout << v[i] << ' '; \
cout << endl;
#define coutvv(v) \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cout << v[i][j] << ' '; \
cout << endl; \
}
#define debugv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) \
cerr << v[i] << ' '; \
cerr << endl; \
}
#define debugvv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cerr << v[i][j] << ' '; \
cerr << endl; \
} \
}
#define TC \
int TESTCASE; \
cin >> TESTCASE; \
while (TESTCASE--)
typedef long long ll;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f > e - a) {
cout << ":(";
} else {
cout << "Yay!";
}
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define coutv(v) \
for (int i = 0; i < (v).size(); ++i) \
cout << v[i] << ' '; \
cout << endl;
#define coutvv(v) \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cout << v[i][j] << ' '; \
cout << endl; \
}
#define debugv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) \
cerr << v[i] << ' '; \
cerr << endl; \
}
#define debugvv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cerr << v[i][j] << ' '; \
cerr << endl; \
} \
}
#define TC \
int TESTCASE; \
cin >> TESTCASE; \
while (TESTCASE--)
typedef long long ll;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f < e - a) {
cout << ":(";
} else {
cout << "Yay!";
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,507 | 886,506 | u641638265 | cpp |
p03075 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define coutv(v) \
for (int i = 0; i < (v).size(); ++i) \
cout << v[i] << ' '; \
cout << endl;
#define coutvv(v) \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cout << v[i][j] << ' '; \
cout << endl; \
}
#define debugv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) \
cerr << v[i] << ' '; \
cerr << endl; \
}
#define debugvv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cerr << v[i][j] << ' '; \
cerr << endl; \
} \
}
#define TC \
int TESTCASE; \
cin >> TESTCASE; \
while (TESTCASE--)
typedef long long ll;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f >= e - a) {
cout << ":(";
} else {
cout << "Yay!";
}
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define coutv(v) \
for (int i = 0; i < (v).size(); ++i) \
cout << v[i] << ' '; \
cout << endl;
#define coutvv(v) \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cout << v[i][j] << ' '; \
cout << endl; \
}
#define debugv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) \
cerr << v[i] << ' '; \
cerr << endl; \
}
#define debugvv(v) \
{ \
for (int i = 0; i < (v).size(); ++i) { \
for (int j = 0; j < (v[i]).size(); ++j) \
cerr << v[i][j] << ' '; \
cerr << endl; \
} \
}
#define TC \
int TESTCASE; \
cin >> TESTCASE; \
while (TESTCASE--)
typedef long long ll;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (f < e - a) {
cout << ":(";
} else {
cout << "Yay!";
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,508 | 886,506 | u641638265 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (d - a > k) {
cout << ":(" << endl;
return 0;
}
cout << "Yay!" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
return 0;
}
cout << "Yay!" << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 886,523 | 886,524 | u074488832 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (min({abs(a - b), abs(a - c), abs(a - d), abs(a - e), abs(b - c),
abs(b - d), abs(b - e), abs(c - d), abs(c - d), abs(d - e)}) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (max({abs(a - b), abs(a - c), abs(a - d), abs(a - e), abs(b - c),
abs(b - d), abs(b - e), abs(c - d), abs(c - d), abs(d - e)}) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 886,541 | 886,542 | u861231819 | cpp |
p03075 | #include <climits>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
typedef long long LL;
int main() {
int v[5];
for (int i = 0; i < 5; ++i) {
std::cin >> v[i];
}
int k;
std::cin >> k;
if (k >= v[4] - v[1])
std::cout << "Yay!" << std::endl;
else
std::cout << ":(" << std::endl;
}
| #include <climits>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
typedef long long LL;
int main() {
int v[5];
for (int i = 0; i < 5; ++i) {
std::cin >> v[i];
}
int k;
std::cin >> k;
if (k >= v[4] - v[0])
std::cout << "Yay!" << std::endl;
else
std::cout << ":(" << std::endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 886,545 | 886,546 | u116523315 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(6);
int i, j;
for (i = 1; i < 6; i++) {
cin >> v.at(i);
}
for (i = 0; i < 5; i++) {
for (j = i + 1; j < 5; j++) {
if (abs(v.at(i) - v.at(j)) > v.at(5)) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(6);
int i, j;
for (i = 0; i < 6; i++) {
cin >> v.at(i);
}
for (i = 0; i < 5; i++) {
for (j = i + 1; j < 5; j++) {
if (abs(v.at(i) - v.at(j)) > v.at(5)) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 886,556 | 886,557 | u319965179 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
string ans = (e - a < k) ? "Yay!" : ":(";
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
string ans = (e - a <= k) ? "Yay!" : ":(";
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 886,560 | 886,561 | u891847179 | cpp |
p03075 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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>
#include <math.h>
#define _GLIBCXX_DEBUG
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"
] | 886,574 | 886,575 | u838276016 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool dis = true;
if (e - a >= k) {
dis = false;
}
if (dis) {
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool dis = true;
if (e - a > k) {
dis = false;
}
if (dis) {
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,576 | 886,577 | u096030913 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool dis = true;
if (e - a >= k) {
dis = false;
}
if (dis) {
cout << "Yay!" << endl;
}
else {
cout << ":(!" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
bool dis = true;
if (e - a > k) {
dis = false;
}
if (dis) {
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 886,578 | 886,577 | u096030913 | 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 x = true;
if (e - a > k || e - b > k || e - c > k || e - d > k || d - a > k ||
d - b > k || d - c > k || c - a > k || c - b > k || b - a > k) {
x = false;
}
if (x) {
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;
bool x = true;
if (e - a > k || e - b > k || e - c > k || e - d > k || d - a > k ||
d - b > k || d - c > k || c - a > k || c - b > k || b - a > k) {
x = false;
}
if (x) {
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 886,581 | 886,582 | u751515087 | cpp |
p03075 | /*
* atcoder/abc130/a.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int A[5], K;
void input() {
loop(n, 0, 5) cin >> A[n];
cin >> K;
}
void solve() {
for (int len = 2; len <= 5; len++) {
for (int l = 0; l + len <= 5; l++) {
int r = l + len;
if (abs(A[l] - A[r - 1]) > K) {
cout << ":(" << endl;
return;
}
}
}
cout << "Yey!" << endl;
}
int main() {
// cout.precision(15);
input();
solve();
return 0;
}
| /*
* atcoder/abc130/a.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int A[5], K;
void input() {
loop(n, 0, 5) cin >> A[n];
cin >> K;
}
void solve() {
for (int len = 2; len <= 5; len++) {
for (int l = 0; l + len <= 5; l++) {
int r = l + len;
if (abs(A[l] - A[r - 1]) > K) {
cout << ":(" << endl;
return;
}
}
}
cout << "Yay!" << endl;
}
int main() {
// cout.precision(15);
input();
solve();
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 886,585 | 886,586 | u823862638 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
// int n;
// cin>>n;
int a[5];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a, a + 5);
int k;
cin >> k;
cout << ((a[4] - a[0] < k) ? "Yay!" : ":(");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// int n;
// cin>>n;
int a[5];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a, a + 5);
int k;
cin >> k;
cout << ((a[4] - a[0] <= k) ? "Yay!" : ":(");
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 886,587 | 886,588 | u002627851 | cpp |
p03075 | #include <iostream>
using namespace std;
void range(int s, int w, int korg) {
if ((w - s) < korg)
cout << "Yay!";
else
cout << ":(";
}
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
range(a, e, k);
return 0;
}
| #include <iostream>
using namespace std;
void range(int s, int w, int korg) {
if ((w - s) <= korg)
cout << "Yay!";
else
cout << ":(";
}
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
range(a, e, k);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,596 | 886,597 | u848862823 | cpp |
p03075 | #include <iostream>
using namespace std;
void range(int s, int w, int korg) {
if ((w - s) < korg)
cout << "Yay!!";
else
cout << ":(";
}
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
range(a, e, k);
return 0;
} | #include <iostream>
using namespace std;
void range(int s, int w, int korg) {
if ((w - s) <= korg)
cout << "Yay!";
else
cout << ":(";
}
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
range(a, e, k);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 886,598 | 886,597 | u848862823 | cpp |
p03075 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rept(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n[5], k;
rep(i, 5) cin >> n[i];
cin >> k;
bool ok = true;
sort(n, n + 5);
if (abs(n[0] - n[4]) > k)
ok = false;
cout << (ok ? "YeY!" : ":(") << ln;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rept(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n[5], k;
rep(i, 5) cin >> n[i];
cin >> k;
bool ok = true;
sort(n, n + 5);
if (abs(n[0] - n[4]) > k)
ok = false;
cout << (ok ? "Yay!" : ":(") << ln;
}
| [
"literal.string.change",
"io.output.change"
] | 886,599 | 886,600 | u062736195 | cpp |
p03075 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rept(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n[5], k;
rep(i, 5) cin >> n[i];
cin >> k;
bool ok = true;
sort(n, n + 5);
if (abs(n[0] - n[4]) > k)
ok = false;
cout << (ok ? "Yey!" : ":(") << ln;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rept(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n[5], k;
rep(i, 5) cin >> n[i];
cin >> k;
bool ok = true;
sort(n, n + 5);
if (abs(n[0] - n[4]) > k)
ok = false;
cout << (ok ? "Yay!" : ":(") << ln;
}
| [
"literal.string.change",
"io.output.change"
] | 886,601 | 886,600 | u062736195 | cpp |
p03075 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, b, c, d, e, k;
vector<int> at(5);
rep(i, 5) cin >> at[i];
cin >> k;
bool ans = true;
rep(i, 4) for (int j = i + 1; j < 5; j++) if (abs(at[i] - at[j]) > k) ans =
false;
if (ans) {
cout << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, b, c, d, e, k;
vector<int> at(5);
rep(i, 5) cin >> at[i];
cin >> k;
bool ans = true;
rep(i, 4) for (int j = i + 1; j < 5; j++) if (abs(at[i] - at[j]) > k) ans =
false;
if (ans) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 886,607 | 886,608 | u730499268 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double PI = acos(-1); // 3.14~
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
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;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double PI = acos(-1); // 3.14~
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
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"
] | 886,620 | 886,621 | u011716617 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void solve() {
vector<int> a(6);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int k;
cin >> k;
sort(a.begin(), a.end());
if (a[4] - a[0] > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void solve() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int k;
cin >> k;
sort(a.begin(), a.end());
if (a[4] - a[0] > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
int main() {
solve();
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 886,628 | 886,629 | u332253305 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void solve() {
vector<int> a(6);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int k;
cin >> k;
sort(a.begin(), a.end());
if (a[5] - a[0] > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void solve() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int k;
cin >> k;
sort(a.begin(), a.end());
if (a[4] - a[0] > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
int main() {
solve();
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 886,630 | 886,629 | u332253305 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A(5);
int k;
for (int &i : A)
cin >> i;
cin >> k;
sort(A.begin(), A.end());
if (A.at(4) - A.at(0) < 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 : A)
cin >> i;
cin >> k;
sort(A.begin(), A.end());
if (A.at(4) - A.at(0) > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,633 | 886,634 | u306482197 | cpp |
p03075 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
class Stream {
public:
Stream() {}
//配列以外の入力を受け取る
void read() {}
template <typename First, typename... Rest>
void read(First &first, Rest &...rest) {
cin >> first;
read(rest...);
}
//配列を区切って出力する
template <typename T> void write_vec(vector<T> &v, char divider) {
for (size_t i = 0; i < v.size(); i++) {
cout << v[i] << divider;
}
}
};
int main() {
Stream io;
int a, b, c, d, e, k;
io.read(a, b, c, d, e, k);
string ans = ":(";
if (d - a <= k)
ans = "Yay!";
cout << ans;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
class Stream {
public:
Stream() {}
//配列以外の入力を受け取る
void read() {}
template <typename First, typename... Rest>
void read(First &first, Rest &...rest) {
cin >> first;
read(rest...);
}
//配列を区切って出力する
template <typename T> void write_vec(vector<T> &v, char divider) {
for (size_t i = 0; i < v.size(); i++) {
cout << v[i] << divider;
}
}
};
int main() {
Stream io;
int a, b, c, d, e, k;
io.read(a, b, c, d, e, k);
string ans = ":(";
if (e - a <= k)
ans = "Yay!";
cout << ans;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 886,639 | 886,640 | u269291896 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X;
vector<int> T(5);
for (int i = 0; i < 5; i++) {
cin >> T.at(i);
}
int cnt = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (max(T.at(j), T.at(i)) - min(T.at(j), T.at(i)) > X) {
cnt++;
}
}
}
if (cnt == 0) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X;
vector<int> T(5);
for (int i = 0; i < 5; i++) {
cin >> T.at(i);
}
cin >> X;
int cnt = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (max(T.at(j), T.at(i)) - min(T.at(j), T.at(i)) > X) {
cnt++;
}
}
}
if (cnt == 0) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [] | 886,643 | 886,644 | u033273089 | cpp |
p03075 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll = long long;
int INF = 100100100;
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>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll = long long;
int INF = 100100100;
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"
] | 886,655 | 886,656 | u769530239 | cpp |
p03075 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll = long long;
int INF = 100100100;
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>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll = long long;
int INF = 100100100;
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",
"literal.string.change",
"io.output.change"
] | 886,657 | 886,656 | u769530239 | cpp |
p03075 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll = long long;
int INF = 100100100;
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>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll = long long;
int INF = 100100100;
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",
"literal.string.change",
"io.output.change"
] | 886,658 | 886,656 | u769530239 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e;
int k;
cin >> a >> b >> c >> d >> e >> k;
/*
cout << a << endl;
cout << e << endl;
cout << k << endl;
*/
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++)
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e;
int k;
cin >> a >> b >> c >> d >> e >> k;
/*
cout << a << endl;
cout << e << endl;
cout << k << endl;
*/
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,659 | 886,660 | u801083963 | cpp |
p03075 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
const double PI = 3.14159265358979323846;
int main() {
vector<int> d(5);
for (int i = 0; i < 5; i++) {
cin >> d[i];
}
int k;
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
int n = d[j] - d[i];
if (n >= k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
const double PI = 3.14159265358979323846;
int main() {
vector<int> d(5);
for (int i = 0; i < 5; i++) {
cin >> d[i];
}
int k;
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
int n = d[j] - d[i];
if (n > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,661 | 886,662 | u784838174 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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;
using ll = long long;
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",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 886,663 | 886,664 | u604693716 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
vector<int> v(5);
rep(i, 5) cin >> v.at(i);
sort(v.begin(), v.end());
int k;
cin >> k;
int d = v.at(4) - v.at(0);
if (d > k)
cout << ":(";
else {
cout << "Yey!";
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
vector<int> v(5);
rep(i, 5) cin >> v.at(i);
sort(v.begin(), v.end());
int k;
cin >> k;
int d = v.at(4) - v.at(0);
if (d > k)
cout << ":(";
else {
cout << "Yay!";
}
} | [
"literal.string.change",
"io.output.change"
] | 886,665 | 886,666 | u007463213 | 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;
}
| [
"literal.string.change",
"io.output.change"
] | 886,667 | 886,668 | u608040014 | 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;
}
}
| [
"literal.string.change",
"io.output.change"
] | 886,671 | 886,672 | u587622858 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define input(a) cin >> a
#define print(x) cout << x << endl
#define rep(a, n) for (int i = a; i < n; i++)
#define ll long long int
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
print('Yay!');
else
print(':(');
return 0;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define input(a) cin >> a
#define print(x) cout << x << endl
#define rep(a, n) for (int i = a; i < n; i++)
#define ll long long int
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
print("Yay!");
else
print(":(");
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 886,673 | 886,674 | u054556734 | cpp |
p03075 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define uni(e) e.erase(unique(e.begin(), e.end()), e.end())
#define double long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int INF = 1e10;
int MOD = 1e9 + 7;
template <class T> void out(T a) { cout << a << '\n'; }
template <class T> void yesno(T b) {
if (b)
out("yes");
else
out("no");
}
template <class T> void YesNo(T b) {
if (b)
out("Yes");
else
out("No");
}
template <class T> void YESNO(T b) {
if (b)
out("Yay!");
else
out(":(");
}
template <class T> void noyes(T b) {
if (b)
out("no");
else
out("yes");
}
template <class T> void NoYes(T b) {
if (b)
out("No");
else
out("Yes");
}
template <class T> void NOYES(T b) {
if (b)
out("NO");
else
out("YES");
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool sosuu(int a) {
bool b = 1;
if (a <= 1)
return 0;
else {
rep1(i, sqrt(a) - 1) {
if (a % (i + 1) == 0)
b = 0;
}
return b;
}
}
int modpow(int a, int b, int m = MOD) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
int memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
int fact_mod(int n) {
int f = 1;
for (int i = 2; i < n + 1; i++)
f = f * (i % MOD) % MOD;
return f;
}
int mod_pow(int x, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res = (res * x) % MOD;
x = (x * x) % MOD;
n >>= 1;
}
return res;
}
int c_mod(int n, int r) {
if (r > n - r)
r = n - r;
if (r == 0)
return 1;
int a = 1;
rep(i, r) a = a * ((n - i) % MOD) % MOD;
int b = mod_pow(fact_mod(r), MOD - 2);
return (a % MOD) * (b % MOD) % MOD;
}
signed main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
int g = max(a, max(b, max(c, max(d, e))));
int h = min(a, min(b, min(c, min(d, e))));
YESNO(g - h < f);
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define uni(e) e.erase(unique(e.begin(), e.end()), e.end())
#define double long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int INF = 1e10;
int MOD = 1e9 + 7;
template <class T> void out(T a) { cout << a << '\n'; }
template <class T> void yesno(T b) {
if (b)
out("yes");
else
out("no");
}
template <class T> void YesNo(T b) {
if (b)
out("Yes");
else
out("No");
}
template <class T> void YESNO(T b) {
if (b)
out("Yay!");
else
out(":(");
}
template <class T> void noyes(T b) {
if (b)
out("no");
else
out("yes");
}
template <class T> void NoYes(T b) {
if (b)
out("No");
else
out("Yes");
}
template <class T> void NOYES(T b) {
if (b)
out("NO");
else
out("YES");
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool sosuu(int a) {
bool b = 1;
if (a <= 1)
return 0;
else {
rep1(i, sqrt(a) - 1) {
if (a % (i + 1) == 0)
b = 0;
}
return b;
}
}
int modpow(int a, int b, int m = MOD) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
int memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
int fact_mod(int n) {
int f = 1;
for (int i = 2; i < n + 1; i++)
f = f * (i % MOD) % MOD;
return f;
}
int mod_pow(int x, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res = (res * x) % MOD;
x = (x * x) % MOD;
n >>= 1;
}
return res;
}
int c_mod(int n, int r) {
if (r > n - r)
r = n - r;
if (r == 0)
return 1;
int a = 1;
rep(i, r) a = a * ((n - i) % MOD) % MOD;
int b = mod_pow(fact_mod(r), MOD - 2);
return (a % MOD) * (b % MOD) % MOD;
}
signed main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
int g = max(a, max(b, max(c, max(d, e))));
int h = min(a, min(b, min(c, min(d, e))));
YESNO(g - h <= f);
}
| [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 886,675 | 886,676 | u341447450 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using in6 = int64_t;
using ind = double;
using vi = vector<in6>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<in6, in6>;
using psi = pair<string, in6>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i++)
#define repa(i, a, n) for (in6 i = a; i < (in6)(n); i++)
#define repdown(i, n) for (in6 i = n; i > 0; i--)
#define kyun ios::sync_with_stdio(false)
#define hinata cout << "\n"
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define inf 2147483647
#define dset(n) cout << fixed << setprecision(n)
void yes() { cout << "Yes"; }
void no() { cout << "No"; }
int main() {
kyun;
in6 a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k)
cout << ":(";
else
cout << "Yay!";
hinata;
} | #include <bits/stdc++.h>
using namespace std;
using in6 = int64_t;
using ind = double;
using vi = vector<in6>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<in6, in6>;
using psi = pair<string, in6>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i++)
#define repa(i, a, n) for (in6 i = a; i < (in6)(n); i++)
#define repdown(i, n) for (in6 i = n; i > 0; i--)
#define kyun ios::sync_with_stdio(false)
#define hinata cout << "\n"
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define inf 2147483647
#define dset(n) cout << fixed << setprecision(n)
void yes() { cout << "Yes"; }
void no() { cout << "No"; }
int main() {
kyun;
in6 a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(";
else
cout << "Yay!";
hinata;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,682 | 886,683 | u655179794 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n[5];
int k;
int r;
for (int i = 0; i < 5; i++) {
cin >> n[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (n[i] - n[j] < 0) {
r = n[j] - n[i];
} else {
r = n[i] - n[j];
}
if (r < k) {
flag = 1;
}
}
}
if (flag == 1) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n[5];
int k;
int r;
for (int i = 0; i < 5; i++) {
cin >> n[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (n[i] - n[j] < 0) {
r = n[j] - n[i];
} else {
r = n[i] - n[j];
}
if (r > k) {
flag = 1;
}
}
}
if (flag == 1) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,692 | 886,693 | u117737149 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 5;
int antenas[n];
int k, tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
antenas[i] = tmp;
}
cin >> k;
int t = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (k < (antenas[j] - antenas[i])) {
t = 1;
break;
}
}
if (t == 1)
break;
}
if (t == 1) {
cout << ":()" << endl;
} else {
cout << "Yay!" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 5;
int antenas[n];
int k, tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
antenas[i] = tmp;
}
cin >> k;
int t = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (k < (antenas[j] - antenas[i])) {
t = 1;
break;
}
}
if (t == 1)
break;
}
if (t == 1) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 886,703 | 886,704 | u127741845 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int Anttenas[5];
for (int i = 0; i < 5; ++i) {
cin >> Anttenas[i];
}
int distance;
cin >> distance;
if ((Anttenas[4] - Anttenas[0]) < distance) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int Anttenas[5];
for (int i = 0; i < 5; ++i) {
cin >> Anttenas[i];
}
int distance;
cin >> distance;
if ((Anttenas[4] - Anttenas[0]) <= distance) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,709 | 886,710 | u187013893 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int Anttenas[5];
for (int i = 0; i < 5; ++i) {
cin >> Anttenas[i];
}
int distance;
cin >> distance;
if ((Anttenas[4] - Anttenas[0]) > distance) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int Anttenas[5];
for (int i = 0; i < 5; ++i) {
cin >> Anttenas[i];
}
int distance;
cin >> distance;
if ((Anttenas[4] - Anttenas[0]) <= distance) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,711 | 886,710 | u187013893 | cpp |
p03075 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
const long double PI = (acos(-1));
int main() {
int k;
vector<int> a(5);
rep(i, 0, 5) cin >> a[i];
cin >> k;
int ans = 0;
rep(i, 0, 4) {
rep(j, i, 5) {
if (a[j] - a[i] > k)
ans = 1;
}
}
if (ans == 1)
cout << ":(" << endl;
else
cout << "Yey!" << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
const long double PI = (acos(-1));
int main() {
int k;
vector<int> a(5);
rep(i, 0, 5) cin >> a[i];
cin >> k;
int ans = 0;
rep(i, 0, 4) {
rep(j, i, 5) {
if (a[j] - a[i] > k)
ans = 1;
}
}
if (ans == 1)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 886,714 | 886,715 | u870074807 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
vector<int> vec = {b - a, c - a, d - a, e - a, c - b,
d - b, e - b, d - c, e - c, e - d};
sort(vec.begin(), vec.end());
if (vec[9] <= k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
vector<int> vec = {b - a, c - a, d - a, e - a, c - b,
d - b, e - b, d - c, e - c, e - d};
sort(vec.begin(), vec.end());
if (vec[9] <= 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"
] | 886,718 | 886,719 | u922449177 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
/////////////////////
// Write code below /
/////////////////////
int A[5], k;
string flag = "Yay!";
cin >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
rep(i, 5) {
for (int j = i; j < 5; j++) {
if (A[j] - A[i] > k) {
flag = ":(";
}
}
}
cout << flag << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
/////////////////////
// Write code below /
/////////////////////
int A[5], k;
string flag = "Yay!";
cin >> A[0] >> A[1] >> A[2] >> A[3] >> A[4] >> k;
rep(i, 5) {
for (int j = i; j < 5; j++) {
if (A[j] - A[i] > k) {
flag = ":(";
}
}
}
cout << flag << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 886,725 | 886,726 | u843929518 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.