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 |
|---|---|---|---|---|---|---|---|
p03681 | #include <iostream>
#include <string>
using namespace std;
int avd(int a, int b) {
if (a > b)
return a - b;
else
return b - a;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int main() {
const int MOD = 1000000007;
int N, M;
int tmp = 1;
cin >> N >> M;
if (N == M... | #include <iostream>
#include <string>
using namespace std;
int avd(int a, int b) {
if (a > b)
return a - b;
else
return b - a;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int main() {
const int MOD = 1000000007;
int N, M;
long long int tmp = 1;
cin >> N >> M;
... | [
"variable_declaration.type.widen.change"
] | 1,357,473 | 1,357,474 | u285598935 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = (int)1e5 + 10;
const ll MOD = (int)1e9 + 7;
ll fac[MAXN];
int main() {
int n, m;
cin >> n >> m;
if (n > m)
swap(n, m);
if (n - m > 1)
printf("0\n");
else {
fac[1] = fac[0] = 1;
for (int i = 1; i <= n; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = (int)1e5 + 10;
const ll MOD = (int)1e9 + 7;
ll fac[MAXN];
int main() {
int n, m;
cin >> n >> m;
if (n < m)
swap(n, m);
if (n - m > 1)
printf("0\n");
else {
fac[1] = fac[0] = 1;
for (int i = 2; i <= n; i++)
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,357,478 | 1,357,479 | u294642518 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long long int a = 1;
cin >> n >> m;
if (abs(n - m) >= 2) {
cout << -1 << endl;
return 0;
}
for (int i = 1; i <= n; i++) {
a = (a * i) % 1000000007;
}
for (int i = 1; i <= m; i++) {
a = (a * i) % 1000000007;
}
if (n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long long int a = 1;
cin >> n >> m;
if (abs(n - m) >= 2) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= n; i++) {
a = (a * i) % 1000000007;
}
for (int i = 1; i <= m; i++) {
a = (a * i) % 1000000007;
}
if (n ... | [
"literal.number.change",
"io.output.change"
] | 1,357,491 | 1,357,492 | u988542029 | cpp |
p03681 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#include <stdio.h>
#in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#include <stdio.h>
#in... | [
"expression.operation.binary.add"
] | 1,357,506 | 1,357,507 | u335104842 | cpp |
p03681 | // 6/25 Sunday
#include <algorithm> //max,
#include <cstdlib> //abs()
#include <iostream>
typedef long long llint;
using namespace std;
int main() {
llint i, x, y, x1, y1, sa, ans, k;
cin >> x >> y;
x1 = max(x, y);
y1 = min(x, y);
sa = x1 - y1;
k = x1;
if (sa > 1) {
ans = 0;
} else {
x1 = 1;... | // 6/25 Sunday
#include <algorithm> //max,
#include <cstdlib> //abs()
#include <iostream>
typedef long long llint;
using namespace std;
int main() {
llint i, x, y, x1, y1, sa, ans, k;
cin >> x >> y;
x1 = max(x, y);
y1 = min(x, y);
sa = x1 - y1;
k = x1;
// cout << y1 << endl;
if (sa > 1) {
ans = 0... | [
"assignment.add"
] | 1,357,510 | 1,357,511 | u183464876 | cpp |
p03681 | #include <cmath>
#include <iostream>
using namespace std;
int fact(int n) {
long int sum = 1;
long int X = (int)pow(10, 9) + 7;
for (long int i = 1; i <= n; i++) {
sum = (sum * i) % X;
}
return (int)sum;
}
int main() {
long int N, M, a, b;
cin >> N;
cin >> M;
if (N == M) {
a = fact(N);
... | #include <cmath>
#include <iostream>
using namespace std;
int fact(int n) {
long int sum = 1;
long int X = (int)pow(10, 9) + 7;
for (long int i = 1; i <= n; i++) {
sum = (sum * i) % X;
}
return (int)sum;
}
int main() {
long int N, M, a, b;
cin >> N;
cin >> M;
if (N == M) {
a = fact(N);
... | [
"assignment.variable.change",
"identifier.change"
] | 1,357,519 | 1,357,520 | u768951609 | cpp |
p03681 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int Mod = 1e9 + 7;
ll AA(ll x) {
int ans = 1, i = 1;
while (i <= x) {
ans = (ans * i) % Mod;
i++;
}
return ans % Mod;
}
int main() {
ll n, m;
// cout << AA(100000) << endl;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int Mod = 1e9 + 7;
ll AA(ll x) {
ll ans = 1, i = 1;
while (i <= x) {
ans = (ans * i) % Mod;
i++;
}
return ans % Mod;
}
int main() {
ll n, m;
// cout << AA(100000) << endl;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 ... | [
"variable_declaration.type.change"
] | 1,357,521 | 1,357,522 | u182281036 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define mst(a, b) memset((a), (b), sizeof(a))
#define f(i, a, b) for (int i = (a); i < (b); ++i)
#define rush() ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define mst(a, b) memset((a), (b), sizeof(a))
#define f(i, a, b) for (int i = (a); i < (b); ++i)
#define rush() ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,357,530 | 1,357,531 | u523915521 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const... | [
"variable_declaration.type.narrow.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,532 | 1,357,533 | u192442087 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,534 | 1,357,533 | u192442087 | cpp |
p03681 | #include <iostream>
using namespace std;
int n, m;
long long ans, p[200005];
const long long INF = 1000000007;
void putp(int x) {
p[0] = 1;
p[1] = 1;
for (long long i = 2; i <= x; i++) {
p[i] = (p[i - 1] * i) % INF;
}
}
int main(void) {
cin >> n >> m;
putp(n + m);
if (m > n) {
swap(n, m);
}
... | #include <iostream>
using namespace std;
int n, m;
long long ans, p[200005];
const long long INF = 1000000007;
void putp(int x) {
p[0] = 1;
p[1] = 1;
for (long long i = 2; i <= x; i++) {
p[i] = (p[i - 1] * i) % INF;
}
}
int main(void) {
cin >> n >> m;
putp(n + m);
if (m > n) {
swap(n, m);
}
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,357,535 | 1,357,536 | u560985876 | cpp |
p03681 | #include <iostream>
#include <vector>
using namespace std;
#define MAX 1000000007
int main() {
int min;
int A, B;
cin >> A >> B;
long long int ans = 1;
int n = A - B;
if (n == 0 || n == -1 || n == 1) {
for (int i = 1; i <= A; i++) {
ans *= i;
ans %= MAX;
}
for (int i = 1; i <= B; ... | #include <iostream>
#include <vector>
using namespace std;
#define MAX 1000000007
int main() {
int min;
int A, B;
cin >> A >> B;
long long int ans = 1;
int n = A - B;
if (n == 0 || n == -1 || n == 1) {
for (int i = 1; i <= A; i++) {
ans *= i;
ans %= MAX;
}
for (int i = 1; i <= B; ... | [
"assignment.value.change"
] | 1,357,551 | 1,357,552 | u749127958 | cpp |
p03681 | #include <iostream>
#define MOD 1000000007
using namespace std;
using ull = unsigned long long;
ull f(ull n) {
ull ans = 1;
for (ull i = 1; i <= n; ++i) {
ans = ans * i % MOD;
}
return ans;
}
int main() {
ull N, M;
cin >> N >> M;
if (N < M) {
ull temp = N;
N = M;
M = N;
}
ull ans;
... | #include <iostream>
#define MOD 1000000007
using namespace std;
using ull = unsigned long long;
ull f(ull n) {
ull ans = 1;
for (ull i = 1; i <= n; ++i) {
ans = ans * i % MOD;
}
return ans;
}
int main() {
ull N, M;
cin >> N >> M;
if (N < M) {
ull temp = N;
N = M;
M = temp;
}
ull an... | [
"assignment.value.change",
"identifier.change"
] | 1,357,553 | 1,357,554 | u140398766 | cpp |
p03681 | #include <iostream>
#define MOD 1000000007
using namespace std;
using ull = unsigned long long;
ull f(int n) {
ull ans = 1;
for (int i = 1; i <= n; ++i) {
ans = ans * i % MOD;
}
return ans;
}
int main() {
int N, M;
cin >> N >> M;
if (N < M) {
int temp = N;
N = M;
M = N;
}
ull ans;
... | #include <iostream>
#define MOD 1000000007
using namespace std;
using ull = unsigned long long;
ull f(ull n) {
ull ans = 1;
for (ull i = 1; i <= n; ++i) {
ans = ans * i % MOD;
}
return ans;
}
int main() {
ull N, M;
cin >> N >> M;
if (N < M) {
ull temp = N;
N = M;
M = temp;
}
ull an... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change"
] | 1,357,555 | 1,357,554 | u140398766 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long n, m;
long long gt(long a) {
long long s = 2;
for (long i = 2; i <= a; i++)
s = (s * i) % mod;
return s % mod;
}
int main() {
cin >> n >> m;
if (n < m - 1 || m < n - 1)
return cout << 0, 0;
if (n == m)
cout << gt(n) * g... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long n, m;
long long gt(long a) {
long long s = 1;
for (long i = 2; i <= a; i++)
s = (s * i) % mod;
return s % mod;
}
int main() {
cin >> n >> m;
if (n < m - 1 || m < n - 1)
return cout << 0, 0;
if (n == m)
cout << 2 * gt(n)... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,357,562 | 1,357,563 | u199876234 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long n, m;
long long gt(long a) {
long long s = 2;
for (long i = 2; i <= a; i++)
s = (s * i) % mod;
return s % mod;
}
int main() {
cin >> n >> m;
if (n < m - 1 || m < n - 1)
return cout << -1, 0;
if (n == m)
cout << gt(n) * ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long n, m;
long long gt(long a) {
long long s = 1;
for (long i = 2; i <= a; i++)
s = (s * i) % mod;
return s % mod;
}
int main() {
cin >> n >> m;
if (n < m - 1 || m < n - 1)
return cout << 0, 0;
if (n == m)
cout << 2 * gt(n)... | [
"literal.number.change",
"variable_declaration.value.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,357,564 | 1,357,563 | u199876234 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
string ans = "";
if (b < a) {
ans = "delicious";
} else if (b < a + x) {
ans = "safe";
} else {
ans = "dangerous";
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
string ans = "";
if (b <= a) {
ans = "delicious";
} else if (b <= a + x) {
ans = "safe";
} else {
ans = "dangerous";
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,588 | 1,357,589 | u492548916 | cpp |
p03679 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (B - A > X) {
cout << "dangerous" << endl;
} else if (B <= A) {
cout << "dilicious" << endl;
} else {
cout << "safe" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (B - A > X) {
cout << "dangerous" << endl;
} else if (B <= A) {
cout << "delicious" << endl;
} else {
cout << "safe" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,357,590 | 1,357,591 | u117835862 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int x, a, b;
cin >> x >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (a + x > b)
cout << "dangerous" << endl;
else
cout << "safe" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int x, a, b;
cin >> x >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (a + x < b)
cout << "dangerous" << endl;
else
cout << "safe" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,594 | 1,357,595 | u687214625 | cpp |
p03679 | #define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b > 0) {
cout << "delicious" << endl;
} else if (b - a >= 0 && x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
... |
#define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b >= 0) {
cout << "delicious" << endl;
} else if (b - a > 0 && x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,596 | 1,357,597 | u896014917 | cpp |
p03679 |
#define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b > 0) {
cout << "delicious" << endl;
} else if (b - a >= 0 && 1 + x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl... |
#define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b >= 0) {
cout << "delicious" << endl;
} else if (b - a > 0 && x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,357,598 | 1,357,597 | u896014917 | cpp |
p03679 | #define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b > 0) {
cout << "delicious" << endl;
} else if (b - a >= 0 && x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
... |
#define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b >= 0) {
cout << "delicious" << endl;
} else if (b - a > 0 && x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,599 | 1,357,597 | u896014917 | cpp |
p03679 | #define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b > 0) {
cout << "delicious" << endl;
} else if (a - b <= 0 && x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
... |
#define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b >= 0) {
cout << "delicious" << endl;
} else if (b - a > 0 && x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,357,600 | 1,357,597 | u896014917 | cpp |
p03679 |
#define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b > 0) {
cout << "delicious" << endl;
} else if (a - b < 0 && x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
... |
#define LL long long
#include <iostream>
using namespace std;
int main() {
LL x, a, b;
cin >> x >> a >> b;
auto n = [&x, &a, &b]() {
if (a - b >= 0) {
cout << "delicious" << endl;
} else if (b - a > 0 && x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,357,601 | 1,357,597 | u896014917 | cpp |
p03679 | #include <cstdint>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, a, b;
cin >> x >> a >> b;
if (a >= b) {
cout << "delicious" << endl;
} else {
if ((b - a) <= x) {
cout << "safe" << endl;
} else {
cout << "dangerious" << endl... | #include <cstdint>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, a, b;
cin >> x >> a >> b;
if (a >= b) {
cout << "delicious" << endl;
} else {
if ((b - a) <= x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;... | [
"literal.string.change",
"io.output.change"
] | 1,357,608 | 1,357,609 | u931628752 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int t, n, j, c, x, a, b;
string s;
string ss;
vector<int> v;
int main() {
scanf("%d %d %d", &x, &a, &b);
if (a - b > 0)
printf("delicious\n");
else if (b - a <= x)
printf("safe\n");
else
printf("dangerous\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int t, n, j, c, x, a, b;
string s;
string ss;
vector<int> v;
int main() {
scanf("%d %d %d", &x, &a, &b);
if (a - b >= 0)
printf("delicious\n");
else if (b - a <= x)
printf("safe\n");
else
printf("dangerous\n");
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,616 | 1,357,617 | u495153364 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a > b)
cout << "delicious" << endl;
else if ((a + x) > b && a < b)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b)
cout << "delicious" << endl;
else if ((a + x) >= b)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,357,628 | 1,357,629 | u946847864 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a > b)
cout << "delicious" << endl;
else if ((a + x) > b)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b)
cout << "delicious" << endl;
else if ((a + x) >= b)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,630 | 1,357,629 | u946847864 | cpp |
p03679 | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int x, a, b, t;
cin >> x >> a >> b;
t = b - a;
if (t < 0)
cout << "delicious" << endl;
else if (t <= x)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int x, a, b, t;
cin >> x >> a >> b;
t = b - a;
if (t <= 0)
cout << "delicious" << endl;
else if (t <= x)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,633 | 1,357,634 | u182096840 | cpp |
p03679 | #include <iostream>
int main(int argc, char const *argv[]) {
int x, a, b;
std::cin >> x >> a >> b;
if (a - b > -1)
std::cout << "delicious" << '\n';
else if (a - b > -x)
std::cout << "safe" << '\n';
else
std::cout << "dangerous" << '\n';
return 0;
} | #include <iostream>
int main(int argc, char const *argv[]) {
int x, a, b;
std::cin >> x >> a >> b;
if (a - b > -1)
std::cout << "delicious" << '\n';
else if (a - b >= -x)
std::cout << "safe" << '\n';
else
std::cout << "dangerous" << '\n';
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,635 | 1,357,636 | u069206573 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a - b > 0) {
cout << "delicious" << endl;
} else if (b - a <= x) {
cout << "safe" << endl;
} else {
cout << "dengerous" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a - b >= 0) {
cout << "delicious" << endl;
} else if (b - a <= x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,357,645 | 1,357,644 | u261264691 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b >= c) {
cout << "delicious" << endl;
} else if (a <= c - b)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b >= c) {
cout << "delicious" << endl;
} else if (a >= c - b)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,646 | 1,357,647 | u414947284 | cpp |
p03679 | // AtCoder Beginner Contest 065 A
#include <iostream>
using namespace std;
int main() {
int day_over; // X(賞味期限を過ぎた日数)
int day_before; // A(賞味期限の何日前に買ったか)
int day_after; // B(買ってから何日か)
//////////////////読み込み////////////////////////////
cin >> day_over >> day_before >> day_after;
//賞味期限を基準として(0)賞味期限か... | // AtCoder Beginner Contest 065 A
#include <iostream>
using namespace std;
int main() {
int day_over; // X(賞味期限を過ぎた日数)
int day_before; // A(賞味期限の何日前に買ったか)
int day_after; // B(買ってから何日か)
//////////////////読み込み////////////////////////////
cin >> day_over >> day_before >> day_after;
//賞味期限を基準として(0)賞味期限か... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,357,654 | 1,357,655 | u637922773 | cpp |
p03679 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define foreach(c, itr) \
for (__typeof((c).begin()) itr = (c).begin(); itr != (c)... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define foreach(c, itr) \
for (__typeof((c).begin()) itr = (c).begin(); itr != (c)... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,357,660 | 1,357,661 | u576018050 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int A, B, X;
cin >> X >> A >> B;
if (B - A < 0) {
cout << "delicious" << endl;
} else if (X > B - A) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
return 0;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, X;
cin >> X >> A >> B;
if (B - A <= 0) {
cout << "delicious" << endl;
} else if (X >= B - A) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
return 0;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,662 | 1,357,663 | u830309795 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int A, B, X;
cin >> X >> A >> B;
if (B - A <= 0) {
cout << "delicious" << endl;
} else if (X > B - A) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
return 0;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, X;
cin >> X >> A >> B;
if (B - A <= 0) {
cout << "delicious" << endl;
} else if (X >= B - A) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
return 0;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,664 | 1,357,663 | u830309795 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
A *= (-1);
if (A + B <= 0) {
cout << "delicious";
} else {
if (A + B >= X)
cout << "dangerous";
else
cout << "safe";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
A *= (-1);
if (A + B <= 0) {
cout << "delicious";
} else {
if (A + B <= X)
cout << "safe";
else
cout << "dangerous";
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,357,669 | 1,357,670 | u585586208 | cpp |
p03679 | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a > b) {
cout << "delicious" << endl;
} else if (x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b) {
cout << "delicious" << endl;
} else if (x >= b - a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,671 | 1,357,672 | u970831327 | cpp |
p03679 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (-a + b > x)
cout << "dangerous" << endl;
else if (-a + b < 0)
cout << "delicious" << endl;
else
cout << "safe" << endl;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (-a + b > x)
cout << "dangerous" << endl;
else if (-a + b <= 0)
cout << "delicious" << endl;
else
cout << "safe" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,684 | 1,357,685 | u088764266 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define db(a) cout << a << endl;
typedef pair<int, int> P;
using na... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define db(a) cout << a << endl;
typedef pair<int, int> P;
using na... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,686 | 1,357,687 | u171026188 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define db(a) cout << a << endl;
typedef pair<int, int> P;
using na... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define db(a) cout << a << endl;
typedef pair<int, int> P;
using na... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,688 | 1,357,687 | u171026188 | cpp |
p03679 | #include <iostream>
int main(void) {
int x, a, b;
std::cin >> x >> a >> b;
if (b <= a) {
std::cout << "delicions" << std::endl;
} else if (b <= a + x) {
std::cout << "safe" << std::endl;
} else {
std::cout << "dangerous" << std::endl;
}
return 0;
} | #include <iostream>
int main(void) {
int x, a, b;
std::cin >> x >> a >> b;
if (b <= a) {
std::cout << "delicious" << std::endl;
} else if (b <= a + x) {
std::cout << "safe" << std::endl;
} else {
std::cout << "dangerous" << std::endl;
}
return 0;
} | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,357,699 | 1,357,700 | u579475320 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(c) begin(c), end(c)
#define SZ(c) ((int)c.size())
const int INF = 1001001001001001001ll;
using pii = pair<int, int>;
signed main() {
int X, A, B;
cin >> X >> A >> B;
if (B < A) {
cout << "delicious" << endl;
} else if (B <= A +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(c) begin(c), end(c)
#define SZ(c) ((int)c.size())
const int INF = 1001001001001001001ll;
using pii = pair<int, int>;
signed main() {
int X, A, B;
cin >> X >> A >> B;
if (B <= A) {
cout << "delicious" << endl;
} else if (B <= A ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,703 | 1,357,704 | u133129810 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(c) begin(c), end(c)
#define SZ(c) ((int)c.size())
const int INF = 1001001001001001001ll;
using pii = pair<int, int>;
signed main() {
int X, A, B;
cin >> X >> A >> B;
if (B < A) {
cout << "delicious" << endl;
} else if (B < A + ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(c) begin(c), end(c)
#define SZ(c) ((int)c.size())
const int INF = 1001001001001001001ll;
using pii = pair<int, int>;
signed main() {
int X, A, B;
cin >> X >> A >> B;
if (B <= A) {
cout << "delicious" << endl;
} else if (B <= A ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,705 | 1,357,704 | u133129810 | cpp |
p03679 | #include <iostream>
using namespace std;
int main(void) {
int a, b, x;
cin >> x >> a >> b;
if (a - b >= 0)
cout << "delicious" << endl;
if (a - b < 0 && a + x - b >= 0)
cout << "safe" << endl;
if (a - b < 0 && a + x - b < 0)
cout << "'dangerous'" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, x;
cin >> x >> a >> b;
if (a - b >= 0)
cout << "delicious" << endl;
if (a - b < 0 && a + x - b >= 0)
cout << "safe" << endl;
if (a - b < 0 && a + x - b < 0)
cout << "dangerous" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,357,717 | 1,357,718 | u901561754 | cpp |
p03679 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#include <stdio.h>
#in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#include <stdio.h>
#in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,721 | 1,357,722 | u335104842 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (a > b)
puts("delicious");
else if (a + x >= b)
puts("safe");
else
puts("dangerous");
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (a >= b)
puts("delicious");
else if (a + x >= b)
puts("safe");
else
puts("dangerous");
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,725 | 1,357,726 | u722628899 | cpp |
p03679 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (a - b <= x)
cout << "safe" << endl;
else
cout << "dangerous" << end... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (b - a <= x)
cout << "safe" << endl;
else
cout << "dangerous" << end... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,357,730 | 1,357,731 | u278641898 | cpp |
p03679 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int X = 0, A = 0, B = 0;
cin >> X >> A >> B;
int J = B - A;
if (J <= 0) {
cout << "delicious" << endl;
} else if (J < X) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int X = 0, A = 0, B = 0;
cin >> X >> A >> B;
int J = B - A;
if (J <= 0) {
cout << "delicious" << endl;
} else if (J <= X) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,740 | 1,357,741 | u332115007 | cpp |
p03679 | #include <cstdio>
int X, A, B;
int main() {
scanf("%d %d %d", &X, &A, &B);
int c = A - B;
if (c > 0)
printf("delicious\n");
else if (X + c >= 0)
printf("safe\n");
else
printf("dangerous\n");
return 0;
} | #include <cstdio>
int X, A, B;
int main() {
scanf("%d %d %d", &X, &A, &B);
int c = A - B;
if (c >= 0)
printf("delicious\n");
else if (X + c >= 0)
printf("safe\n");
else
printf("dangerous\n");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,755 | 1,357,756 | u865604924 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
long long x, a, b;
cin >> x >> a >> b;
if (b - a < 0)
cout << "delicious\n";
else if (b - a < x)
cout << "safe\n";
else
cout << "dangerous\n";
} | #include <iostream>
using namespace std;
int main() {
long long x, a, b;
cin >> x >> a >> b;
if (b - a <= 0)
cout << "delicious\n";
else if (b - a <= x)
cout << "safe\n";
else
cout << "dangerous\n";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,757 | 1,357,758 | u141968173 | cpp |
p03679 | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 1,357,759 | 1,357,760 | u014237950 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b) {
cout << "delicious" << endl;
} else if (a + x <= b) {
cout << "dangerous" << endl;
} else {
cout << "safe" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b) {
cout << "delicious" << endl;
} else if (a + x < b) {
cout << "dangerous" << endl;
} else {
cout << "safe" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,766 | 1,357,767 | u456950583 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
int diff = B - A;
if (diff <= 0)
cout << "delicious" << endl;
else if (X - diff > 0)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
int diff = B - A;
if (diff <= 0)
cout << "delicious" << endl;
else if (X - diff >= 0)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,774 | 1,357,775 | u909119242 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
int diff = B - A;
if (diff < 0)
cout << "delicious" << endl;
else if (X - diff > 0)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
int diff = B - A;
if (diff <= 0)
cout << "delicious" << endl;
else if (X - diff >= 0)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,776 | 1,357,775 | u909119242 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (A - B >= 0)
cout << "delicious" << endl;
else if (A - B < 0 && A - B > -X)
cout << "safe" << endl;
else if (A - B <= -X)
cout << "dangerous" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (A - B >= 0)
cout << "delicious" << endl;
else if (A - B < 0 && A - B >= -X)
cout << "safe" << endl;
else if (A - B < -X)
cout << "dangerous" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,777 | 1,357,778 | u926089862 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int a, b, x, ans;
cin >> x >> a >> b;
ans = a + b;
if (a >= b)
cout << "delicious" << endl;
else if (b - a < x)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return (0);
} | #include <iostream>
using namespace std;
int main() {
int a, b, x, ans;
cin >> x >> a >> b;
ans = a + b;
if (a >= b)
cout << "delicious" << endl;
else if (b - a <= x)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return (0);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,779 | 1,357,780 | u183464876 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int a, b, x, ans;
cin >> x >> a >> b;
ans = a + b;
if (a >= b)
cout << "delicious" << endl;
else if (b - a < x)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, x, ans;
cin >> x >> a >> b;
ans = a + b;
if (a >= b)
cout << "delicious" << endl;
else if (b - a <= x)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return (0);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"function.return_value.change"
] | 1,357,781 | 1,357,780 | u183464876 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
long long x, a, b;
cin >> x >> a >> b;
if (a - b > 0) {
cout << "delicious" << endl;
} else if (a - b > -x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long x, a, b;
cin >> x >> a >> b;
if (a - b >= 0) {
cout << "delicious" << endl;
} else if (a - b >= -x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,782 | 1,357,783 | u863507492 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#define _USE_MATH_DEFINES
#define ln long long
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
using namespace std;
int max(int *ary) {
int max = 0... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#define _USE_MATH_DEFINES
#define ln long long
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
using namespace std;
int max(int *ary) {
int max = 0... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,784 | 1,357,785 | u699354332 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#define _USE_MATH_DEFINES
#define ln long long
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
using namespace std;
int max(int *ary) {
int max = 0... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#define _USE_MATH_DEFINES
#define ln long long
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
using namespace std;
int max(int *ary) {
int max = 0... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,786 | 1,357,785 | u699354332 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int x, a, b;
int main() {
cin >> x >> a >> b;
if (b - a > x) {
puts("dangerous");
} else if (b - a <= x && b - a >= 0) {
puts("safe");
} else if (b - a < 0 && b - a <= x) {
puts("delicious");
}
} | #include <bits/stdc++.h>
using namespace std;
int x, a, b;
int main() {
cin >> x >> a >> b;
if (b - a > x) {
puts("dangerous");
} else if (b - a <= x && b - a > 0) {
puts("safe");
} else if (b - a <= 0 && b - a <= x) {
puts("delicious");
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,787 | 1,357,788 | u118354813 | cpp |
p03679 | #include <stdio.h>
int main() {
int X, A, B;
scanf("%d %d %d", &X, &A, &B);
if (0 < (A - B)) {
printf("delicious");
} else if (X >= (B - A)) {
printf("safe");
} else {
printf("dangerous");
}
return 0;
} | #include <stdio.h>
int main() {
int X, A, B;
scanf("%d %d %d", &X, &A, &B);
if (0 <= (A - B)) {
printf("delicious");
} else if (X >= (B - A)) {
printf("safe");
} else {
printf("dangerous");
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,789 | 1,357,790 | u204295829 | cpp |
p03679 | #include <stdio.h>
int main() {
int X, A, B;
scanf("%d %d %d", &X, &A, &B);
if (0 < (A - B)) {
printf("delicious");
} else if (X > (B - A)) {
printf("safe");
} else {
printf("dangerous");
}
return 0;
} | #include <stdio.h>
int main() {
int X, A, B;
scanf("%d %d %d", &X, &A, &B);
if (0 <= (A - B)) {
printf("delicious");
} else if (X >= (B - A)) {
printf("safe");
} else {
printf("dangerous");
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,791 | 1,357,790 | u204295829 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"literal.string.change",
"io.output.change"
] | 1,357,794 | 1,357,795 | u452725238 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a < b && b - a <= x)
cout << "safe" << endl;
else if (a > b)
cout << "delicious" << endl;
else if (a < b && b - a >= x)
cout << "dangerous" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a < b && b - a <= x)
cout << "safe" << endl;
else if (a >= b)
cout << "delicious" << endl;
else if (a < b && b - a >= x)
cout << "dangerous" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,798 | 1,357,799 | u571492569 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a < b && b - a <= x)
cout << "safe" << endl;
else if (a > b)
cout << "delicious " << endl;
else if (a < b && b - a >= x)
cout << "dangerous " << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a < b && b - a <= x)
cout << "safe" << endl;
else if (a >= b)
cout << "delicious" << endl;
else if (a < b && b - a >= x)
cout << "dangerous" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,357,800 | 1,357,799 | u571492569 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a < b && b - a < x)
cout << "safe" << endl;
else if (a > b)
cout << "delicious" << endl;
else if (a < b && b - a > x)
cout << "dangerous" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a < b && b - a <= x)
cout << "safe" << endl;
else if (a >= b)
cout << "delicious" << endl;
else if (a < b && b - a >= x)
cout << "dangerous" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,801 | 1,357,799 | u571492569 | cpp |
p03679 | #include "iostream"
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (A > B) {
cout << "delicious" << endl;
} else {
if (B - A <= X) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
}
return 0;
} | #include "iostream"
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (B <= A) {
cout << "delicious" << endl;
} else {
if (B - A <= X) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,357,804 | 1,357,805 | u382176401 | cpp |
p03679 | //============================================================================
// Name : atcoder.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <i... | //============================================================================
// Name : atcoder.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,357,807 | 1,357,808 | u084549125 | cpp |
p03679 | //============================================================================
// Name : atcoder.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <i... | //============================================================================
// Name : atcoder.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,357,809 | 1,357,808 | u084549125 | cpp |
p03679 | #include <bits/stdc++.h>;
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define T() \
int tt; ... | #include <bits/stdc++.h>;
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define T() \
int tt; ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,810 | 1,357,811 | u964287256 | cpp |
p03679 | #include <bits/stdc++.h>;
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define T() \
int tt; ... | #include <bits/stdc++.h>;
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define T() \
int tt; ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,812 | 1,357,811 | u964287256 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#def... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,357,813 | 1,357,814 | u471289663 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a <= x && b - a < 0) {
cout << "delicious" << endl;
} else if (b - a <= x && b - a >= 0) {
cout << "safe" << endl;
} else if (b - a > x) {
cout << "dangerous" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a <= x && b - a <= 0) {
cout << "delicious" << endl;
} else if (b - a <= x && b - a > 0) {
cout << "safe" << endl;
} else if (b - a > x) {
cout << "dangerous" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,817 | 1,357,818 | u200729311 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a < x && b - a < 0) {
cout << "delicious" << endl;
} else if (b - a < x && b - a >= 0) {
cout << "safe" << endl;
} else if (b - a > x) {
cout << "dangerous" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a <= x && b - a <= 0) {
cout << "delicious" << endl;
} else if (b - a <= x && b - a > 0) {
cout << "safe" << endl;
} else if (b - a > x) {
cout << "dangerous" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,819 | 1,357,818 | u200729311 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,820 | 1,357,821 | u192442087 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const... | [
"variable_declaration.type.narrow.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,822 | 1,357,821 | u192442087 | cpp |
p03679 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define int(x) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define int(x) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,357,836 | 1,357,837 | u757431196 | cpp |
p03679 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define int(x) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define int(x) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,838 | 1,357,837 | u757431196 | cpp |
p03679 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define int(x) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define int(x) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,839 | 1,357,837 | u757431196 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 1e6 + 7, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double PI = acos(0.0) * 2;
template <t... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 1e6 + 7, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double PI = acos(0.0) * 2;
template <t... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,840 | 1,357,841 | u040948438 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 1e6 + 7, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double PI = acos(0.0) * 2;
template <t... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 1e6 + 7, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double PI = acos(0.0) * 2;
template <t... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,843 | 1,357,841 | u040948438 | cpp |
p03679 | // CLMN
// Every cloud has a silver lining
// Hakuna matata
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x) * (x))
const char *fin = "";
const char *fon = "";
#define oo (int)(1e9 + 7)
#define maxn (int)()
void i... | // CLMN
// Every cloud has a silver lining
// Hakuna matata
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x) * (x))
const char *fin = "";
const char *fon = "";
#define oo (int)(1e9 + 7)
#define maxn (int)()
void i... | [
"literal.string.change",
"io.output.change",
"expression.operation.binary.remove"
] | 1,357,849 | 1,357,850 | u113715975 | cpp |
p03679 | // CLMN
// Every cloud has a silver lining
// Hakuna matata
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x) * (x))
const char *fin = "";
const char *fon = "";
#define oo (int)(1e9 + 7)
#define maxn (int)()
void i... | // CLMN
// Every cloud has a silver lining
// Hakuna matata
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x) * (x))
const char *fin = "";
const char *fon = "";
#define oo (int)(1e9 + 7)
#define maxn (int)()
void i... | [
"literal.string.change",
"io.output.change"
] | 1,357,851 | 1,357,850 | u113715975 | cpp |
p03679 | #include <stdio.h>
int main(int argc, char *argv[]) {
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (b < a)
printf("delicious");
else if (b - x <= a)
printf("safe");
else if (b - x > a)
printf("dangerous");
return 0;
} | #include <stdio.h>
int main(int argc, char *argv[]) {
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (b <= a)
printf("delicious");
else if (b - x <= a)
printf("safe");
else if (b - x > a)
printf("dangerous");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,852 | 1,357,853 | u204819248 | cpp |
p03679 | #include <stdio.h>
int main(int argc, char *argv[]) {
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (b < a)
printf("delicious");
else if (b - x < a)
printf("safe");
else if (b - x > a)
printf("dangerous");
return 0;
} | #include <stdio.h>
int main(int argc, char *argv[]) {
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (b <= a)
printf("delicious");
else if (b - x <= a)
printf("safe");
else if (b - x > a)
printf("dangerous");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,854 | 1,357,853 | u204819248 | cpp |
p03679 | #include <cstdio>
using namespace std;
int x, a, b;
int main() {
scanf("%d%d%d", &x, &a, &b);
a = a - b;
if (a > 0)
printf("delicious");
else {
a = -a;
if (a > x)
printf("dangerous");
else
printf("safe");
}
return 0;
}
| #include <cstdio>
using namespace std;
int x, a, b;
int main() {
scanf("%d%d%d", &x, &a, &b);
a = a - b;
if (a >= 0)
printf("delicious");
else {
a = -a;
if (a > x)
printf("dangerous");
else
printf("safe");
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,860 | 1,357,861 | u688198990 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b <= a) {
cout << "delicious";
} else if (a >= x + 1) {
cout << "dangerous";
} else {
cout << "safe";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b <= a) {
cout << "delicious";
} else if (b - a >= x + 1) {
cout << "dangerous";
} else {
cout << "safe";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,357,865 | 1,357,866 | u861532527 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a + b <= x) {
cout << "delicious";
} else if (a >= x + 1) {
cout << "dangerous";
} else {
cout << "safe";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b <= a) {
cout << "delicious";
} else if (b - a >= x + 1) {
cout << "dangerous";
} else {
cout << "safe";
}
return 0;
} | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,357,867 | 1,357,866 | u861532527 | cpp |
p03679 | #include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
#define MAX 1000000
int p[MAX];
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a <= 0) {
cout << "delicious" << endl;
} else if (b - a >= x + 1) {
cout << "dengerous" << endl;
} else {
cout << "safe" << endl;
... | #include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
#define MAX 1000000
int p[MAX];
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a <= 0) {
cout << "delicious" << endl;
} else if (b - a >= x + 1) {
cout << "dangerous" << endl;
} else {
cout << "safe" << endl;
... | [
"literal.string.change",
"io.output.change"
] | 1,357,868 | 1,357,869 | u158635223 | cpp |
p03679 | #include <stdio.h>
int main() {
int x, a, b;
scanf("%d%d%d", &x, &a, &b);
if (a >= b)
printf("delisious");
else if ((b - a) <= x)
printf("safe");
else
printf("dangerous");
} | #include <stdio.h>
int main() {
int x, a, b;
scanf("%d%d%d", &x, &a, &b);
if (a >= b)
printf("delicious");
else if ((b - a) <= x)
printf("safe");
else
printf("dangerous");
} | [
"misc.typo",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,357,878 | 1,357,879 | u787876298 | cpp |
p03679 | #include <stdio.h>
int main() {
int x, a, b;
scanf("%d%d%d", &x, &a, &b);
if (a > b)
printf("delisious");
else if (b - a <= x)
printf("safe");
else
printf("dangerous");
} | #include <stdio.h>
int main() {
int x, a, b;
scanf("%d%d%d", &x, &a, &b);
if (a >= b)
printf("delicious");
else if ((b - a) <= x)
printf("safe");
else
printf("dangerous");
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.typo",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,357,880 | 1,357,879 | u787876298 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (-a + b <= 0) {
cout << "delicious" << endl;
} else if (-a + b > 0 && -a + b < x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (-a + b <= 0) {
cout << "delicious" << endl;
} else if (-a + b > 0 && -a + b <= x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,881 | 1,357,882 | u937018609 | cpp |
p03679 | #include <bits/stdc++.h>
#define MOD 1000000007
#define MAX 1000005
#define ll long long
#define slld(t) scanf("%I64d", &t)
#define sd(t) scanf("%d", &t)
#define ss(x) scanf("%s", x)
#define pd(t) printf("%d\n", t)
#define plld(t) printf("%I64d\n", t)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tr(conta... | #include <bits/stdc++.h>
#define MOD 1000000007
#define MAX 1000005
#define ll long long
#define slld(t) scanf("%I64d", &t)
#define sd(t) scanf("%d", &t)
#define ss(x) scanf("%s", x)
#define pd(t) printf("%d\n", t)
#define plld(t) printf("%I64d\n", t)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tr(conta... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,887 | 1,357,888 | u679834287 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int x, a, b, c, bestby;
cin >> x >> a >> b;
if (b < a) {
cout << "delicious";
return 0;
}
if (b > a) {
c = b - a;
if (c > x) {
cout << "dangerous";
retur... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int x, a, b, c, bestby;
cin >> x >> a >> b;
if (b <= a) {
cout << "delicious";
return 0;
}
if (b > a) {
c = b - a;
if (c > x) {
cout << "dangerous";
retu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,889 | 1,357,890 | u015747312 | cpp |
p03679 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b)
cout << "delicious" << endl;
else if (x + a >= b)
cout << "safe" << endl;
else
cout << "danderous" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b)
cout << "delicious" << endl;
else if (x + a >= b)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,357,891 | 1,357,892 | u318857467 | cpp |
p03679 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a > b)
cout << "delicious" << endl;
else if (x + a > b)
cout << "safe" << endl;
else
cout << "danderous" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b)
cout << "delicious" << endl;
else if (x + a >= b)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,357,893 | 1,357,892 | u318857467 | cpp |
p03679 | /*I MAY NOT GET THE SUCCESS IMMEDIATELY BUT I WILL GET IT FOR SURE*/
#include <bits/stdc++.h>
#define opt std::ios_base::sync_with_stdio(false)
#define I int
#define li int32_t
#define lli long long
#define ulli unsigned long long
#define pn printf("\n")
#define nl cout << '\n'
#define sf(N) scanf("%lld", &N)
#define ... | /*I MAY NOT GET THE SUCCESS IMMEDIATELY BUT I WILL GET IT FOR SURE*/
#include <bits/stdc++.h>
#define opt std::ios_base::sync_with_stdio(false)
#define I int
#define li int32_t
#define lli long long
#define ulli unsigned long long
#define pn printf("\n")
#define nl cout << '\n'
#define sf(N) scanf("%lld", &N)
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,894 | 1,357,895 | u706839656 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long ll;
const int N = 1010;
#define FI first
#define SE second
typedef pair<int, int> pii;
int main() {
// freopen("in.txt","r",stdin);
int x, a, b;
while (~scanf("%d%d%d", &x, &a, &b)) {
if (a + b == x)
puts("delicious... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long ll;
const int N = 1010;
#define FI first
#define SE second
typedef pair<int, int> pii;
int main() {
// freopen("in.txt","r",stdin);
int x, a, b;
while (~scanf("%d%d%d", &x, &a, &b)) {
if (b <= a)
puts("delicious");
... | [
"expression.operation.binary.remove"
] | 1,357,902 | 1,357,903 | u495692321 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.