problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03075 | // https://atcoder.jp/contests/abc123/tasks/abc123_a
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const... | // https://atcoder.jp/contests/abc123/tasks/abc123_a
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 888,149 | 888,150 | u679904527 | cpp |
p03075 | #include <iostream>
int main(void) {
int a[6];
int count = 0;
for (int i = 0; i < 6; i++)
std::cin >> a[i];
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++)
if (a[j] - a[i] <= a[5])
count++;
std::cout << ((count == 0) ? "Yay!" : ":(") << std::endl;
return 0;
} | #include <iostream>
int main(void) {
int a[6];
int count = 0;
for (int i = 0; i < 6; i++)
std::cin >> a[i];
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > a[5])
count++;
}
std::cout << ((count == 0) ? "Yay!" : ":(") << std::endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,156 | 888,157 | u139018733 | 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"
] | 888,166 | 888,167 | u401900157 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a <= k) {
cout << "Yay" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 888,172 | 888,173 | u401900157 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
for (int i = 0; i < 4; ++i)
cin >> b;
cin >> k;
if (b - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a;
for (int i = 0; i < 4; ++i)
cin >> b;
cin >> k;
if (b - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| [] | 888,174 | 888,175 | u898749314 | cpp |
p03075 |
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
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>
#include <cmath>
#include <cstdlib>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,187 | 888,188 | u098679988 | cpp |
p03075 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" <... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" <... | [
"literal.string.change",
"io.output.change"
] | 888,202 | 888,203 | u061732150 | 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!" << 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;
if ((e - a) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 888,207 | 888,208 | u455015745 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << "Yay!";
else
cout << ":(";
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 << ":(";
else
cout << "Yay!";
return 0;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 888,211 | 888,212 | u239897421 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int i, k, m, n, l;
int data[5];
for (i = 0; i < 5; i++) {
cin >> data[i];
}
cin >> k;
for (m = 0; m < 5; m++) {
for (n = m + 1; n < 5; n++) {
if (data[n] - data[m] >= k) {
printf(":(\n");
re... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int i, k, m, n, l;
int data[5];
for (i = 0; i < 5; i++) {
cin >> data[i];
}
cin >> k;
for (m = 0; m < 5; m++) {
for (n = m + 1; n < 5; n++) {
if (data[n] - data[m] > k) {
printf(":(\n");
ret... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,219 | 888,220 | u590825849 | cpp |
p03075 |
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#include <climits>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int main() {
int A[5];
int dis;
REP(i, 5) { scanf("%d", &A[i]); }
scanf("%d", &dis);
int max = 0, min = 124;
REP(i, 5) {
... |
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#include <climits>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int main() {
int A[5];
int dis;
REP(i, 5) { scanf("%d", &A[i]); }
scanf("%d", &dis);
int max = 0, min = 124;
REP(i, 5) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 888,223 | 888,224 | u089177147 | cpp |
p03075 |
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#include <climits>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int main() {
int A[5];
int dis;
REP(i, 5) { scanf("%d", &A[i]); }
scanf("%d", &dis);
int max = 0, min = 124;
REP(i, 5) {
... |
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#include <climits>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int main() {
int A[5];
int dis;
REP(i, 5) { scanf("%d", &A[i]); }
scanf("%d", &dis);
int max = 0, min = 124;
REP(i, 5) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 888,225 | 888,224 | u089177147 | 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"
] | 888,226 | 888,227 | u378253030 | cpp |
p03075 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using na... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using na... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,228 | 888,229 | u662918817 | cpp |
p03075 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using na... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using na... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 888,230 | 888,231 | u662918817 | cpp |
p03075 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using na... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using na... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 888,232 | 888,231 | u662918817 | cpp |
p03075 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using na... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using na... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.add",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 888,233 | 888,231 | u662918817 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E, X;
cin >> A >> B >> C >> D >> E >> X;
if ((E - A) < X) {
cout << "Yay!" << endl;
} else {
cout << ":( " << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E, X;
cin >> A >> B >> C >> D >> E >> X;
if ((E - A) <= X) {
cout << "Yay!" << endl;
} else {
cout << ":( " << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,234 | 888,235 | u955534952 | 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"
] | 888,236 | 888,237 | u667294123 | 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!" << 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;
if ((e - a) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,238 | 888,239 | u728894486 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,248 | 888,249 | u319001729 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
int k = 0;
bool flag = false;
cin >> a >> b >> c >> d >> e;
if (k >= (e - a)) {
flag = true;
}
if (flag == true)
cout << "Yay!" << endl;
else if (flag == false)
cout << ":(" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
int k = 0;
bool flag = false;
cin >> a >> b >> c >> d >> e >> k;
if (k >= (e - a)) {
flag = true;
}
if (flag == true)
cout << "Yay!" << endl;
else if (flag == false)
cout << ":(" << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 888,255 | 888,256 | u826315133 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
string ans;
ans = e - a > k ? ":)" : "Yay!";
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
string ans;
ans = e - a > k ? ":(" : "Yay!";
cout << ans << endl;
} | [
"literal.string.change"
] | 888,259 | 888,260 | u254766083 | cpp |
p03075 | //
// Created by yuu on 2019-04-16.
//
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int A[4];
for (int i = 0; i < 4; ++i) {
cin >> A[i];
}
int K;
c... | //
// Created by yuu on 2019-04-16.
//
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int A[5];
for (int i = 0; i < 5; ++i) {
cin >> A[i];
}
int K;
c... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 888,269 | 888,270 | u149583407 | cpp |
p03075 | #include <iostream>
int main(void) {
int a, b, c, d, e, k;
std::cin >> a >> b >> c >> d >> e >> k;
e - a >= k ? std::cout << "Yay!" : std::cout << ":(";
return 0;
} | #include <iostream>
int main(void) {
int a, b, c, d, e, k;
std::cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
std::cout << "Yay!";
else
std::cout << ":(";
return 0;
}
| [
"control_flow.branch.if.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 888,273 | 888,274 | u481584122 | cpp |
p03075 | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++) {
scanf("%d", &a[i]);
}
sort(a, a + 5);
int x = a[4] - a[0];
int k;
scanf("%d", &k);
if (x <= k) {
printf("Yay! %d", x);
} else {
printf(":(");
}
} | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++) {
scanf("%d", &a[i]);
}
sort(a, a + 5);
int x = a[4] - a[0];
int k;
scanf("%d", &k);
if (x <= k) {
printf("Yay!");
} else {
printf(":(");
}
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 888,281 | 888,282 | u379288456 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
main() {
vector<int> xs(5);
for (auto &x : xs)
cin >> x;
int k;
cin >> k;
vector<pair<int, int>> xss;
for (int i = 1; i <= 5; ++i) {
for (int j = 1; j <= 5; ++j) {
xss.push_back({xs[i], xs[j]});
}
}
vector<... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
main() {
vector<int> xs(5);
for (auto &x : xs)
cin >> x;
int k;
cin >> k;
vector<pair<int, int>> xss;
for (int i = 0; i < 5; ++i) {
for (int j = 0; j < 5; ++j) {
xss.push_back({xs[i], xs[j]});
}
}
vector<bo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 888,291 | 888,292 | u095676321 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e;
cin >> k;
int dis;
dis = min(a, (b, c, d, e));
-max(a, (b, c, d, e));
if (k >= dis) {
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;
cin >> k;
int dis;
dis = max(a, (b, c, d, e)) - min(a, (b, c, d, e));
if (k >= dis) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"assignment.change"
] | 888,293 | 888,294 | u832995587 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
//入力
int a, b, c, d, e;
int k;
cin >> a >> b >> c >> d >> e;
cin >> k;
//処理
string ans;
int L = e - a;
if (L < k)
ans = "Yay!";
else
ans = ":(";
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
//入力
int a, b, c, d, e;
int k;
cin >> a >> b >> c >> d >> e;
cin >> k;
//処理
string ans;
int L = e - a;
if (L <= k)
ans = "Yay!";
else
ans = ":(";
cout << ans << endl;
return 0;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,299 | 888,300 | u947750088 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
//入力
int a, b, c, d, e;
int k;
cin >> a >> b >> c >> d >> e;
cin >> k;
//処理
string ans;
int L = e - a;
if (L > k)
ans = "Yay!";
else
ans = ":(";
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
//入力
int a, b, c, d, e;
int k;
cin >> a >> b >> c >> d >> e;
cin >> k;
//処理
string ans;
int L = e - a;
if (L <= k)
ans = "Yay!";
else
ans = ":(";
cout << ans << endl;
return 0;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,301 | 888,300 | u947750088 | cpp |
p03075 | #include <cstdio>
#include <string>
using namespace std;
int main(void) {
int a, e, k, i;
scanf("%d", &a);
scanf("%d", &i);
scanf("%d", &i);
scanf("%d", &i);
scanf("%d", &e);
scanf("%d", &k);
if (e - a > k)
printf("Yay!\n");
else
printf(":(\n");
fflush(stdout);
return 0;
}
| #include <cstdio>
#include <string>
using namespace std;
int main(void) {
int a, e, k, i;
scanf("%d", &a);
scanf("%d", &i);
scanf("%d", &i);
scanf("%d", &i);
scanf("%d", &e);
scanf("%d", &k);
if (e - a <= k)
printf("Yay!\n");
else
printf(":(\n");
fflush(stdout);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,304 | 888,305 | u925478083 | cpp |
p03075 | #include <stdio.h>
int main(void) {
int a, b, c, d, e, k;
a < b;
b < c;
c < d;
d < e;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
scanf("%d", &k);
if ((e - a) > k) {
printf(":(");
}
if ((e - a) < k) {
printf("Yay!");
}
}
| #include <stdio.h>
int main(void) {
int a, b, c, d, e, k;
a < b;
b < c;
c < d;
d < e;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
scanf("%d", &k);
if ((e - a) > k) {
printf(":(");
}
if ((e - a) <= k) {
printf("Yay!");
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,312 | 888,313 | u607104908 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, e, k, tmp;
cin >> a >> tmp >> tmp >> tmp >> e >> k;
int res = (e - a) < k;
cout << (res ? "Yay!" : ":(");
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, e, k, tmp;
cin >> a >> tmp >> tmp >> tmp >> e >> k;
int res = (e - a) <= k;
cout << (res ? "Yay!" : ":(");
return 0;
} | [
"import.add",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 888,314 | 888,315 | u939527507 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
#define NUMSSIZE 6
int main() {
vector<int> nums;
for (int i = 0; i < NUMSSIZE; i++) {
int j = 0;
cin >> j;
nums.push_back(j);
}
if (nums[nums.size() - 2] - nums[0] < nums[nums.size() - 1]) {
cout << "Yay!";
} else {
cout << ":("... | #include <iostream>
#include <vector>
using namespace std;
#define NUMSSIZE 6
int main() {
vector<int> nums;
for (int i = 0; i < NUMSSIZE; i++) {
int j = 0;
cin >> j;
nums.push_back(j);
}
if (nums[nums.size() - 2] - nums[0] <= nums[nums.size() - 1]) {
cout << "Yay!";
} else {
cout << ":(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,318 | 888,319 | u271381409 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int N[5], i;
int flg;
//入力
for (i = 0; i < 6; i++) {
cin >> N[i];
}
//計算
if (N[4] - N[0] < N[5]) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N[5], i;
int flg;
//入力
for (i = 0; i < 6; i++) {
cin >> N[i];
}
//計算
if (N[4] - N[0] <= N[5]) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,329 | 888,330 | u242067199 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl;
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl;
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,333 | 888,334 | u489846029 | cpp |
p03075 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define MOD 1000000007
int main() {
int v[5];
for (int i = 0; i < 5; i++)
cin >> v[i];
int k;
cin >> k;
for (... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define MOD 1000000007
int main() {
int v[5];
for (int i = 0; i < 5; i++)
cin >> v[i];
int k;
cin >> k;
for (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 888,335 | 888,336 | u422592877 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
ll Mod = 1e9 + 7;
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;
retur... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
ll Mod = 1e9 + 7;
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;
retu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,339 | 888,340 | u831873811 | cpp |
p03075 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int antenna[5];
int k;
std::cin >> antenna[0];
std::cin >> antenna[1];
std::cin >> antenna[2];
std::cin >> antenna[3];
std::cin >> antenna[4];
std::cin >> k;
for (int i = 4; i < 0; i--) {
for (int j = 0; j... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int antenna[5];
int k;
std::cin >> antenna[0];
std::cin >> antenna[1];
std::cin >> antenna[2];
std::cin >> antenna[3];
std::cin >> antenna[4];
std::cin >> k;
for (int i = 4; i > 0; i--) {
for (int j = 0; j... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 888,350 | 888,351 | u329731898 | cpp |
p03075 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int antenna[5];
int k;
std::cin >> antenna[0];
std::cin >> antenna[1];
std::cin >> antenna[2];
std::cin >> antenna[3];
std::cin >> antenna[4];
std::cin >> k;
for (int i = 4; i < 0; i--) {
for (int j = 0; j... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int antenna[5];
int k;
std::cin >> antenna[0];
std::cin >> antenna[1];
std::cin >> antenna[2];
std::cin >> antenna[3];
std::cin >> antenna[4];
std::cin >> k;
for (int i = 4; i > 0; i--) {
for (int j = 0; j... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change"
] | 888,352 | 888,351 | u329731898 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
string ans = ":(";
if (e - a < k) {
ans = "Yay!";
}
cout << ans << 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;
string ans = ":(";
if (e - a <= k) {
ans = "Yay!";
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,353 | 888,354 | u120826790 | 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 << "Yay!" << endl;
else
cout << ":(" << endl;
} | #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!" << endl;
else
cout << ":(" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,355 | 888,356 | u309446269 | cpp |
p03075 | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <float.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator> // std::back_inserter
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#inc... | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <float.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator> // std::back_inserter
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#inc... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 888,357 | 888,358 | u056889505 | cpp |
p03075 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <queue>
#include <stack>
#include <vector>
#define PI 3.1415926535
#define MAX 100
#define swap(a, b, t) (t = a, a = b, b ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <queue>
#include <stack>
#include <vector>
#define PI 3.1415926535
#define MAX 100
#define swap(a, b, t) (t = a, a = b, b ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,359 | 888,360 | u131889965 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++)
cin >> a.at(i);
int k;
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 4 - i; j++) {
if (abs(a.at(i) - a.at(i + j)) > k) {
cout << ":(" << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++)
cin >> a.at(i);
int k;
cin >> k;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 5 - i; j++) {
if (abs(a.at(i) - a.at(i + j)) > k) {
cout << ":(" << endl;
return 0;
}... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 888,372 | 888,373 | u405230134 | cpp |
p03075 | #include <iostream>
using namespace std;
main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a < k)
cout << "Yay!";
else
cout << ":(";
}
| #include <iostream>
using namespace std;
main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a <= k)
cout << "Yay!";
else
cout << ":(";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,374 | 888,375 | u373717076 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int num[5];
int k;
for (int i = 0; i < 5; i++)
cin >> num[i];
cin >> k;
if (num[4] - num[0] > k)
cout << ":)" << endl;
else
cout << "Yay!" << endl;
} | #include <iostream>
using namespace std;
int main() {
int num[5];
int k;
for (int i = 0; i < 5; i++)
cin >> num[i];
cin >> k;
if (num[4] - num[0] > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 888,382 | 888,383 | u905802918 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int i;
int main() {
int a[5];
int k;
int mami[2];
for (i = 0; i < 5; i++)
cin >> a[i];
cin >> k;
int maxv = INT_MIN;
int minv = INT_MAX;
int ans[2];
for (i = 0; i < 5; i++) {
if (a[i] > maxv)
maxv = a[i];
if (a[i] < minv)
minv ... | #include <bits/stdc++.h>
using namespace std;
int i;
int main() {
int a[5];
int k;
int mami[2];
for (i = 0; i < 5; i++)
cin >> a[i];
cin >> k;
int maxv = INT_MIN;
int minv = INT_MAX;
int ans[2];
for (i = 0; i < 5; i++) {
if (a[i] > maxv)
maxv = a[i];
if (a[i] < minv)
minv ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,386 | 888,387 | u912899441 | cpp |
p03075 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, d, e, k, i = 0;
cin >> a >> b >> c >> d >> e >> k;
if (0 <= a, b, c, d, e, k <= 123) {
if (a < b < c < d < e) {
if ((e - a) <= k) {
i = 1;
}
}
}
cout << ((i == 1) ? "Yay!" : ";(") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, d, e, k, i = 0;
cin >> a >> b >> c >> d >> e >> k;
if (0 <= a, b, c, d, e, k <= 123) {
if (a < b < c < d < e) {
if ((e - a) <= k) {
i = 1;
}
}
}
cout << ((i == 1) ? "Yay!" : ":(") << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 888,394 | 888,395 | u121243942 | cpp |
p03075 | #include <stdio.h>
int main(void) {
char ans[4];
int a, b, c, d, e, k;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
scanf("%d", &k);
if (e - a > k) {
printf(":(\n");
} else {
printf("YaY!\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
char ans[4];
int a, b, c, d, e, k;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
scanf("%d", &k);
if (e - a > k) {
printf(":(\n");
} else {
printf("Yay!\n");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 888,396 | 888,397 | u629341543 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 4; j++) {
if (a[j] - a[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 888,405 | 888,406 | u988542029 | cpp |
p03075 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1;... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,407 | 888,408 | u696415377 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int arr[5], k;
for (int &i : arr)
cin >> i;
cin >> k;
bool flag = true;
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++)
flag = flag && (arr[j] - arr[i] <= k);
cout << flag ? "Yay!" : ":(";
} | #include <iostream>
using namespace std;
int main() {
int arr[5], k;
for (int &i : arr)
cin >> i;
cin >> k;
bool flag = true;
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++)
flag = flag && (arr[j] - arr[i] <= k);
cout << (flag ? "Yay!" : ":(");
} | [] | 888,409 | 888,410 | u081249228 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
vector<int> a;
for (int i = 0; i < 6; i++) {
int n;
cin >> n;
a.push_back(n);
}
int x = a[4] - a[0];
if (x <= a[5]) {
cout << "Yey!" << endl;
} else {
cout << ":(" << en... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
vector<int> a;
for (int i = 0; i < 6; i++) {
int n;
cin >> n;
a.push_back(n);
}
int x = a[4] - a[0];
if (x <= a[5]) {
cout << "Yay!" << endl;
} else {
cout << ":(" << en... | [
"literal.string.change",
"io.output.change"
] | 888,413 | 888,414 | u354492470 | 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;
sort(a, a + 5);
if (a[4] > k)
cout << ":(";
else
cout << "Yay!";
} | #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;
sort(a, a + 5);
if (a[4] - a[0] > k)
cout << ":(";
else
cout << "Yay!";
} | [
"control_flow.branch.if.condition.change"
] | 888,417 | 888,418 | u168820186 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0;
int tosort[5];
int k;
int s = 0;
bool can = true;
for (int i = 0; i < 5; i++)
cin >> tosort[i];
cin >> k;
for (int i = 0; i < 5; i++) {
in... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0;
int tosort[5];
int k;
int s = 0;
bool can = true;
for (int i = 0; i < 5; i++)
cin >> tosort[i];
cin >> k;
for (int i = 0; i < 5; i++) {
in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,437 | 888,438 | u395846213 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0;
int tosort[5];
int k;
int s = 0;
bool can = true;
for (int i = 0; i < 5; i++)
cin >> tosort[i];
cin >> k;
for (int i = 0; i < 5; i++) {
in... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0;
int tosort[5];
int k;
int s = 0;
bool can = true;
for (int i = 0; i < 5; i++)
cin >> tosort[i];
cin >> k;
for (int i = 0; i < 5; i++) {
in... | [
"control_flow.branch.if.condition.change"
] | 888,439 | 888,438 | u395846213 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,440 | 888,441 | u539675863 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
vector<int> a(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(" << endl;
} else {
cout << "Yay !" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
vector<int> a(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 888,442 | 888,443 | u843574076 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
vector<int> a(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
if (a[4] - a[0] < k) {
cout << ":(" << endl;
} else {
cout << "Yay !" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
vector<int> a(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 888,444 | 888,443 | u843574076 | 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 << "Yey!" << 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;
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"
] | 888,453 | 888,454 | u119012830 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << ((e - a) > k ? "Yay!" : ":(") << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << ((e - a) <= k ? "Yay!" : ":(") << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 888,455 | 888,456 | u635406078 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 100000000
typedef long long ll;
using namespace std;
doubl... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 100000000
typedef long long ll;
using namespace std;
doubl... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,473 | 888,474 | u843974324 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int k;
cin >> k;
sort(a.begin(), a.end());
if (a[5] - a[0] <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int k;
cin >> k;
sort(a.begin(), a.end());
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"
] | 888,475 | 888,476 | u544165468 | cpp |
p03075 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long l... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long l... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 888,496 | 888,497 | u179643082 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (k > e - a) {
cout << "Yay!";
} else {
cout << ":(";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (k >= e - a) {
cout << "Yay!";
} else {
cout << ":(";
}
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,498 | 888,499 | u794565416 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (d - a > k)
cout << ":(" << endl;
else
cout << "Yay!";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(" << endl;
else
cout << "Yay!";
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 888,500 | 888,501 | u520205434 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (d - a > k)
cout << ":(" << endl;
else
cout << "yay!";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(" << endl;
else
cout << "Yay!";
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 888,502 | 888,501 | u520205434 | 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 (b - a > k) {
cout << ":(" << endl;
} else if (c - b > k) {
cout << ":(" << endl;
} else if (d - c > k) {
cout << ":(" << endl;
} else if (e - d > k) {
cout << ":(" << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else if (e - b > k) {
cout << ":(" << endl;
} else if (e - c > k) {
cout << ":(" << endl;
} else if (e - d > k) {
cout << ":(" << endl... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 888,510 | 888,511 | u201743726 | cpp |
p03075 | //
// Created on 4/26/19.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a >= k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | //
// Created on 4/26/19.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 888,514 | 888,515 | u655975843 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if ((d - a) <= f)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if ((e - a) <= f)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 888,535 | 888,536 | u454349421 | cpp |
p03075 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,543 | 888,544 | u652286295 | 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 << ":(" << endl;
else
cout << "Yay!" << endl;
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 << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,554 | 888,555 | u513736711 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 888,556 | 888,557 | u112581208 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | [
"literal.number.change",
"call.arguments.change",
"call.remove"
] | 888,558 | 888,557 | u112581208 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 888,563 | 888,564 | u788341294 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> coordinate;
int a, k;
for (int i = 0; i < 5; i++) {
cin >> a;
coordinate.push_back(a);
}
cin >> k;
if (coordinate[4] - coordinate[0] > k) {
cout << ":(" << endl;
} else if (coordinate[4] - coordinate[0] <= k) ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> coordinate;
int a, k;
for (int i = 0; i < 5; i++) {
cin >> a;
coordinate.push_back(a);
}
cin >> k;
if (coordinate[4] - coordinate[0] > k) {
cout << ":(" << endl;
} else if (coordinate[4] - coordinate[0] <= k) ... | [
"literal.string.change",
"io.output.change"
] | 888,569 | 888,570 | u081094913 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
string re;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
re = 'Yay!';
} else {
re = ':(';
}
cout << re << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
string re;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
re = "Yay!";
} else {
re = ":(";
}
cout << re << endl;
return 0;
} | [
"literal.string.change",
"assignment.value.change"
] | 888,585 | 888,586 | u313578168 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < 15)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
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;
} | [] | 888,589 | 888,588 | u954081460 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MOD 1000000007
#define INF INT_MAX
#define NINF INT_MIN
#define LLINF LLONG_MAX
using ll = long long;
using namespace std;
int main() {
int a, b, c, d, e, k;
cin ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MOD 1000000007
#define INF INT_MAX
#define NINF INT_MIN
#define LLINF LLONG_MAX
using ll = long long;
using namespace std;
int main() {
int a, b, c, d, e, k;
cin ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,594 | 888,595 | u165374901 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, K;
cin >> a >> b >> c >> d >> e >> K;
if (e - a < K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, K;
cin >> a >> b >> c >> d >> e >> K;
if (e - a <= K) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,596 | 888,597 | u097827299 | cpp |
p03075 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
vector<int> antenna(5);
REP(i, 5) cin >> antenna[i];
int k;
cin >> k;
int maxi = *max_element(antenna.begin(), antenna.end());
int mini = *min_element(antenna.begin(), antenna.end());
if ((maxi - ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
vector<int> antenna(5);
REP(i, 5) cin >> antenna[i];
int k;
cin >> k;
int maxi = *max_element(antenna.begin(), antenna.end());
int mini = *min_element(antenna.begin(), antenna.end());
if ((maxi - ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,600 | 888,601 | u342042786 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 888,602 | 888,603 | u465317453 | cpp |
p03075 | #include <iostream>
int main() {
int a, b, c, d, e, k;
std::cin >> a >> b >> c >> d >> e >> k;
std::cout << (e - a <= k) ? "Yay!" : ":(";
return 0;
} | #include <iostream>
int main() {
int a, b, c, d, e, k;
std::cin >> a >> b >> c >> d >> e >> k;
std::cout << ((e - a <= k) ? "Yay!" : ":(");
return 0;
}
| [] | 888,606 | 888,607 | u444349080 | cpp |
p03075 | // doot diddly donger cuckerino Hahahahahah
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UINT;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vecto... | // doot diddly donger cuckerino Hahahahahah
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UINT;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vecto... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 888,618 | 888,619 | u592758681 | cpp |
p03075 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define hell 1000000007
#define lbnd lower_bound
#define ubnd upper_bound
#define sll set<ll int>
#define msll multiset<ll int>
#define io ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define hell 1000000007
#define lbnd lower_bound
#define ubnd upper_bound
#define sll set<ll int>
#define msll multiset<ll int>
#define io ... | [] | 888,620 | 888,621 | u118498303 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int maxdis = a - e;
if (maxdis <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int maxdis = e - a;
if (maxdis <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operation.binary.remove"
] | 888,632 | 888,633 | u640827947 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (k > e - a) {
cout << "Yay!";
} else {
cout << ":(";
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (k >= e - a) {
cout << "Yay!";
} else {
cout << ":(";
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,641 | 888,642 | u231396853 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int jl[11];
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
jl[1] = b - a;
jl[2] = c - a;
jl[3] = d - a;
jl[4] = e - a;
jl[5] = c - b;
jl[6] = d - b;
jl[7] = e - b;
jl[8] = d - c;
jl[9] = e - c;
jl[10] = e - d;
bool ans = true... | #include <bits/stdc++.h>
using namespace std;
int jl[11];
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
jl[1] = b - a;
jl[2] = c - a;
jl[3] = d - a;
jl[4] = e - a;
jl[5] = c - b;
jl[6] = d - b;
jl[7] = e - b;
jl[8] = d - c;
jl[9] = e - c;
jl[10] = e - d;
bool ans = true... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 888,667 | 888,668 | u211018720 | cpp |
p03075 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 888,671 | 888,672 | u043443359 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int s = e - a;
if (s >= k)
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;
int s = e - a;
if (s > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,679 | 888,680 | u715627316 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int s = e - a;
if (s >= k)
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;
int s = e - a;
if (s > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,679 | 888,681 | u715627316 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[6], k;
for (int i = 0; i < 5; i++)
cin >> a[i];
cin >> k;
int sum = 0;
int flag = 0;
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++) {
sum = a[j] - a[i];
if (sum >= k)
flag = 1;
}
flag == 0 ? puts(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[6], k;
for (int i = 0; i < 5; i++)
cin >> a[i];
cin >> k;
int sum = 0;
int flag = 0;
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++) {
sum = a[j] - a[i];
if (sum > k)
flag = 1;
}
flag == 0 ? puts("... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 888,684 | 888,685 | u914135866 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
void solveA() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > 15) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
void solveB() {}
void solveC() {}
void solveD() {}
int main() { solveA(); }
| #include <bits/stdc++.h>
using namespace std;
void solveA() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
void solveB() {}
void solveC() {}
void solveD() {}
int main() { solveA(); }
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 888,692 | 888,693 | u735499035 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int num[5];
int k;
bool flag = true;
for (int i = 0; i > 5; i++) {
cin >> num[i];
}
cin >> k;
((num[4] - num[0]) > k) ? cout << "Yay!" << endl : cout << ":(" << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int num[5];
int k;
bool flag = true;
for (int i = 0; i < 5; i++) {
cin >> num[i];
}
cin >> k;
((num[4] - num[0]) <= k) ? cout << "Yay!" << endl : cout << ":(" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 888,700 | 888,701 | u571790125 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
string ans;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
ans == ":(";
} else {
ans == "Yay!";
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
string ans;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
ans = ":(";
} else {
ans = "Yay!";
}
cout << ans << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 888,708 | 888,709 | u552201227 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb ... | [
"literal.string.change",
"expression.operation.binary.change"
] | 888,712 | 888,713 | u572468811 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[10];
int b = 0;
for (int i = 0; i < 6; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
b = max(b, abs(a[i] - a[j]));
}
}
if (b <= a[6]) {
cout << "Yay!" << endl;
} else {
cout << ":(" << ... | #include <iostream>
using namespace std;
int main() {
int a[10];
int b = 0;
for (int i = 0; i < 6; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
b = max(b, abs(a[i] - a[j]));
/*
cout<<"b = "<<b<<endl;
cout<<"a[6] = "<<a[5]<<endl;
cout<<"abs... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 888,714 | 888,715 | u245414044 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[10];
int b = 0;
for (int i = 0; i < 6; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
b = max(b, abs(a[i] - a[j]));
// cout<<b<<" ";
}
}
if (b <= a[6]) {
cout << "Yay!" << endl;
} else... | #include <iostream>
using namespace std;
int main() {
int a[10];
int b = 0;
for (int i = 0; i < 6; i++)
cin >> a[i];
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
b = max(b, abs(a[i] - a[j]));
/*
cout<<"b = "<<b<<endl;
cout<<"a[6] = "<<a[5]<<endl;
cout<<"abs... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 888,716 | 888,715 | u245414044 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 1000000007
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << "Yay!\n";
els... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 1000000007
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(\n";
else
... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 888,725 | 888,726 | u170650966 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.