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 |
|---|---|---|---|---|---|---|---|
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll(i) = a; (i) < (b); ++(i))
#define RFOR(i, a, b) for (ll(i) = a; (i) >= (b); --(i))
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define UNIQ(v) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll(i) = a; (i) < (b); ++(i))
#define RFOR(i, a, b) for (ll(i) = a; (i) >= (b); --(i))
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define UNIQ(v) ... | [] | 886,729 | 886,730 | u140859535 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int counter = 0;
int now = 1;
for (int i = 0; i < N; i++) {
if (S[i] == (char)(now + '0'))
counter++;
else {... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int counter = 0;
int now = 1;
for (int i = 0; i < N; i++) {
if (S[i] == (char)(now + '0'))
counter++;
else {... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 886,731 | 886,732 | u397070717 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int counter = 0;
int now = 1;
for (int i = 0; i < N; i++) {
if (S[i] == (char)(now + '0'))
counter++;
else {... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int counter = 0;
int now = 1;
for (int i = 0; i < N; i++) {
if (S[i] == (char)(now + '0'))
counter++;
else {... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 886,733 | 886,732 | u397070717 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int counter = 0;
int now = 1;
for (int i = 0; i < N; i++) {
if (S[i] == (char)(now + '0'))
counter++;
else {... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int counter = 0;
int now = 1;
for (int i = 0; i < N; i++) {
if (S[i] == (char)(now + '0'))
counter++;
else {... | [
"variable_declaration.value.change"
] | 886,731 | 886,734 | u397070717 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int counter = 0;
int now = 1;
for (int i = 0; i < N; i++) {
if (S[i] == (char)(now + '0'))
counter++;
else {... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int counter = 0;
int now = 1;
for (int i = 0; i < N; i++) {
if (S[i] == (char)(now + '0'))
counter++;
else {... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"variable_declaration.value.change"
] | 886,733 | 886,734 | u397070717 | cpp |
p03074 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> nums;
bool one(true);
int cnt(0);
for (int i = 0; i < n; i++) {
if (s[i] == one ? '1' : '0') {
cnt++;
} else {
nums.push_back(cnt);
one = !one;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> nums;
bool one(true);
int cnt(0);
for (int i = 0; i < n; i++) {
if (s[i] == (one ? '1' : '0')) {
cnt++;
} else {
nums.push_back(cnt);
one = !one;
... | [
"control_flow.branch.if.condition.change"
] | 886,740 | 886,741 | u081445141 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change"
] | 886,746 | 886,747 | u432551953 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | [
"expression.operation.binary.remove"
] | 886,748 | 886,747 | u432551953 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | [
"expression.operation.binary.remove"
] | 886,749 | 886,747 | u432551953 | cpp |
p03074 | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) a.begin(), a.end()
using namespace std;
typedef pair<int, int> P;
typ... | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) a.begin(), a.end()
using namespace std;
typedef pair<int, int> P;
typ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 886,772 | 886,773 | u869282786 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
string str;
cin >> n >> k >> str;
vector<ll> ary;
#if 0
int now = 1; //今見ている数
int cnt = 0; //nowがいくつ並んでいるか
for (int i = 0; i < n; i++)
{
if (str[i] == (char)('0' +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
string str;
cin >> n >> k >> str;
vector<ll> ary;
#if 1
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < n; i++) {
if (str[i] == (char)('0' + now))
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 886,778 | 886,779 | u100825466 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <thread... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <thread... | [] | 886,780 | 886,781 | u862095327 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <vector>
using namespace std;
#defi... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <vector>
using namespace std;
#defi... | [] | 886,788 | 886,789 | u365321796 | cpp |
p03074 | #include <algorithm>
#include <deque>
#include <iostream>
#include <string>
using namespace std;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <algorithm>
#include <deque>
#include <iostream>
#include <string>
using namespace std;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"expression.operation.binary.remove"
] | 886,797 | 886,798 | u743561048 | cpp |
p03074 | #include <algorithm>
#include <deque>
#include <iostream>
#include <string>
using namespace std;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <algorithm>
#include <deque>
#include <iostream>
#include <string>
using namespace std;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 886,797 | 886,799 | u743561048 | cpp |
p03074 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | [
"expression.unary.arithmetic.add"
] | 886,816 | 886,817 | u216772548 | cpp |
p03074 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 886,823 | 886,824 | u621104964 | cpp |
p03074 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 886,825 | 886,824 | u621104964 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> accum(n, 0);
int acc = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0' && (i == 0 || s[i - 1] != '0'))
accum[i] = 1;
}
for (int i = 1; i < s.size(); i++)
accum[i] +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> accum(n, 0);
int acc = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0' && (i == 0 || s[i - 1] != '0'))
accum[i] = 1;
}
for (int i = 1; i < s.size(); i++)
accum[i] +... | [
"assignment.change"
] | 886,830 | 886,831 | u251828455 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
const int pi = 3.1415926535897932384626433832795;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
#define ll long long
#define inf int(1e9 + 7)
#define pb push_back
#define mp make_pair
int d[200005], a[200005], sum[200005];
int n, k;
int main() {
cin >> n... | #include <bits/stdc++.h>
using namespace std;
const int pi = 3.1415926535897932384626433832795;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
#define ll long long
#define inf int(1e9 + 7)
#define pb push_back
#define mp make_pair
int d[200005], a[200005], sum[200005];
int n, k;
int main() {
cin >> n... | [
"assignment.change"
] | 886,834 | 886,835 | u004314860 | cpp |
p03074 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, k, d[100005], a[100005], ss = 0, sum[100005];
bool tmp;
int main(void) {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%1d", &d[i]);
for (int i = 1; i <= n; i++) {
a[i] = (d[i] ^ d[i + 1]);
}
for (int i = 1; i <= n; i++... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, k, d[100005], a[100005], ss = 0, sum[100005];
bool tmp;
int main(void) {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%1d", &d[i]);
for (int i = 1; i <= n; i++) {
a[i] = (d[i] ^ d[i - 1]);
}
for (int i = 1; i <= n; i++... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 886,839 | 886,840 | u959835031 | cpp |
p03074 | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | [
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 886,842 | 886,843 | u137332130 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int d[200000], a[200000], sum[200000];
int main() {
int n, K;
cin >> n >> K;
for (int i = 0; i < n; i++) {
scanf("%1d", &d[i + 1]);
}
for (int i = 1; i <= n; i++)
a[i] = (d[i] ^ d[i - 1]);
sum[0] = 0;
for (int i = 1; i <= n; i++) {
sum[i] = sum[i -... | #include <bits/stdc++.h>
using namespace std;
int d[200000], a[200000], sum[200000];
int main() {
int n, K;
cin >> n >> K;
for (int i = 0; i < n; i++) {
scanf("%1d", &d[i + 1]);
}
for (int i = 1; i <= n; i++)
a[i] = (d[i] ^ d[i - 1]);
sum[0] = 0;
for (int i = 1; i <= n; i++) {
sum[i] = sum[i -... | [
"assignment.change"
] | 886,844 | 886,845 | u127973530 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 886,848 | 886,849 | u976045235 | cpp |
p03074 | /*siddharth goyal*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define REP(i, n) for (int i = 1; i <= n; i++)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vl vector<LL>
#define itr ::iterator it
#define lb lower_boun... | /*siddharth goyal*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define REP(i, n) for (int i = 1; i <= n; i++)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vl vector<LL>
#define itr ::iterator it
#define lb lower_boun... | [
"literal.number.change",
"call.arguments.change"
] | 886,855 | 886,856 | u823648302 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
if (k < e - a)
cout << ":(" << endl;
else
cout << "Yey!" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
if (k < e - a)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 886,870 | 886,871 | u247123590 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
if (k > e - a)
cout << ":(" << endl;
else
cout << "Yey!" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int k;
cin >> k;
if (k < e - a)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 886,872 | 886,871 | u247123590 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
static const int MOD = 1000000007;
using ll = long long;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] < k) {
... | #include <bits/stdc++.h>
using namespace std;
static const int MOD = 1000000007;
using ll = long long;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 886,879 | 886,880 | u338193317 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
static const int MOD = 1000000007;
using ll = long long;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k) {
... | #include <bits/stdc++.h>
using namespace std;
static const int MOD = 1000000007;
using ll = long long;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 886,881 | 886,880 | u338193317 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
static const int MOD = 1000000007;
using ll = long long;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[i] - a[j] > k) {
... | #include <bits/stdc++.h>
using namespace std;
static const int MOD = 1000000007;
using ll = long long;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k) {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 886,882 | 886,880 | u338193317 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
static const int MOD = 1000000007;
using ll = long long;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[i] - a[j] > k) {
... | #include <bits/stdc++.h>
using namespace std;
static const int MOD = 1000000007;
using ll = long long;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k) {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 886,883 | 886,880 | u338193317 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int left = max({a, b, c, d, e});
int right = min({a, b, c, d, e});
if (left - right < 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;
int left = max({a, b, c, d, e});
int right = min({a, b, c, d, e});
if (left - right <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,884 | 886,885 | u533566373 | cpp |
p03075 | // url:
// problem name: Brick Break
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
... | // url:
// problem name: Brick Break
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
... | [
"literal.string.change",
"io.output.change"
] | 886,886 | 886,887 | u446371873 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, kyori;
cin >> a >> b >> c >> d >> e >> kyori;
if (e - a < kyori)
cout << "Yay!";
else
cout << ":(";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, kyori;
cin >> a >> b >> c >> d >> e >> kyori;
if (e - a <= kyori)
cout << "Yay!";
else
cout << ":(";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,888 | 886,889 | u367131219 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, kyori;
cin >> a >> b >> c >> d >> e >> kyori;
if (e - a > kyori)
cout << "Yay!";
else
cout << ":(";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, kyori;
cin >> a >> b >> c >> d >> e >> kyori;
if (e - a <= kyori)
cout << "Yay!";
else
cout << ":(";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,890 | 886,889 | u367131219 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
typedef long long ll;
using namespace std;
int main() {
vector<int> a(5);
int k;
rep(i, 0, 4) cin >> a[i];
cin >... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
typedef long long ll;
using namespace std;
int main() {
vector<int> a(5);
int k;
rep(i, 0, 4) cin >> a[i];
cin >... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 886,891 | 886,892 | u374678351 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
int MOD = 1000000007;
signed main() {
cin.tie(0);
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
int MOD = 1000000007;
signed main() {
cin.tie(0);
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 886,897 | 886,898 | u394973531 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using na... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using na... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,903 | 886,904 | u716970267 | 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 || d - a > k || c - a > k || b - a > k) {
cout << "*(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k || d - a > k || c - a > k || b - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 886,905 | 886,906 | u834753207 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second... | [
"literal.number.change",
"call.arguments.change"
] | 886,911 | 886,912 | u201304522 | 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 << ":(";
} else {
cout << "Yay!";
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(";
} else {
cout << "Yay!";
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,916 | 886,917 | u841702632 | cpp |
p03075 | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cout << v[i] << " "
using... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cout << v[i] << " "
using... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 886,918 | 886,919 | u225053756 | cpp |
p03075 | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 886,920 | 886,921 | u742553775 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
int main() {
int a[5], k;
rep(i, 5) cin >> a[i];
cin >> k;
bool flag = true;
rep(i, 4) rep(j, i) {
if (a[i] - a[j] > k)
flag = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
int main() {
int a[5], k;
rep(i, 5) cin >> a[i];
cin >> k;
bool flag = true;
rep(i, 5) rep(j, i) {
if (a[i] - a[j] > k)
flag = ... | [
"literal.number.change",
"call.arguments.change"
] | 886,922 | 886,923 | u733599187 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ll a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a < k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ll a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,926 | 886,927 | u451736367 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ll long long
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (a < b) {
if (b - a <= k)
cout << "Yay!" << endl;
else
cout ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ll long long
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (a < e) {
if (e - a <= k)
cout << "Yay!" << endl;
else
cout ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 886,934 | 886,935 | u481657940 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
vector<int> v(5, 0);
int k;
bool flag = true;
for (int i = 0; i < 5; i++) {
cin >> v.at(i);
}
cin >> k;
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v.size(); j++) {
/... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
vector<int> v(5, 0);
int k;
bool flag = true;
for (int i = 0; i < 5; i++) {
cin >> v.at(i);
}
cin >> k;
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v.size(); j++) {
/... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,936 | 886,937 | u549383771 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
int k;
bool check = true;
for (int i = 0; i < 5; i++)
cin >> a.at(i);
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (a.at(i) - a.at(j) > k)
check = false;
}
}
if (ch... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
int k;
bool check = true;
for (int i = 0; i < 5; i++)
cin >> a.at(i);
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (a.at(j) - a.at(i) > k)
check = false;
}
}
if (ch... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 886,958 | 886,959 | u578969098 | cpp |
p03075 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | [
"literal.string.change",
"io.output.change"
] | 886,960 | 886,961 | u294700660 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <type_traits>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
void ... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <type_traits>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
void ... | [
"literal.string.change",
"io.output.change"
] | 886,962 | 886,963 | u595446852 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
int main() {
int A[5], k;
rep(i, 5) cin >> A[i];
cin >> k;
int count = 0;
rep(i, 5) {
for (int j = i + 1; j < 5; j++) {
if (abs(A[i] = A[j]) > k)
count++;
}
}
if (co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
int main() {
int A[5], k;
rep(i, 5) cin >> A[i];
cin >> k;
int count = 0;
rep(i, 5) {
for (int j = i + 1; j < 5; j++) {
if (abs(A[i] - A[j]) > k)
count++;
}
}
if (co... | [
"control_flow.branch.if.condition.change"
] | 886,967 | 886,968 | u776439373 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Ye... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Ye... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 886,971 | 886,972 | u152335469 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
int getmd(int a, int b, int c, int d) { return abs(a - c) + abs(b - d); }
int main() {
int a[5], k;
rep(i, 5) cin >> a[i];
cin >> k;
rep(i, 5) {
rep(j, 5) {
if (abs(a[i] - a[j]) > k) {
puts(":)");
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
int getmd(int a, int b, int c, int d) { return abs(a - c) + abs(b - d); }
int main() {
int a[5], k;
rep(i, 5) cin >> a[i];
cin >> k;
rep(i, 5) {
rep(j, 5) {
if (abs(a[i] - a[j]) > k) {
puts(":(");
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 886,979 | 886,980 | u662871912 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int dif(int a, int b) { return a - b; }
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (dif(e, a) < k) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int dif(int a, int b) { return a - b; }
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
if (dif(e, a) <= k) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 886,983 | 886,984 | u173252932 | cpp |
p03075 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
vector<int> arr{a, b, c, d, e};
sort(arr.begin(), arr.end());
cout << (arr[0] - ar... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
vector<int> arr{a, b, c, d, e};
sort(arr.begin(), arr.end());
cout << (arr[4] - ar... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 886,985 | 886,986 | u879294842 | cpp |
p03075 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
vector<int> antenna(5);
int k;
rep(i, 5) cin >> antenna[i];
cin >> k;
bool judge = true;
rep(i, 5) rep(j, 5) {
if (antenna[i... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
vector<int> antenna(5);
int k;
rep(i, 5) cin >> antenna[i];
cin >> k;
bool judge = true;
rep(i, 5) rep(j, 5) {
if (antenna[i... | [
"literal.string.change",
"io.output.change"
] | 886,987 | 886,988 | u826189900 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> x.at(i);
}
cin >> k;
int y = 0;
for (int m = 0; m < 5; m++) {
for (int j = 0; j < 5; j++) {
if (x.at(m) - x.at(j) > k) {
y++;
}
}
}
if (y == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> x.at(i);
}
cin >> k;
int y = 0;
for (int m = 0; m < 5; m++) {
for (int j = 0; j < 5; j++) {
if (x.at(m) - x.at(j) > k) {
y++;
}
}
}
if (y == 0) {
... | [
"literal.string.change",
"io.output.change"
] | 886,993 | 886,994 | u466865328 | cpp |
p03075 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i, a)
#define rep1(i, a) rep2(i, 0, a)
#define rep2(i, b, a) for (int i = (b); i < ((int)(a)); i++)
#define rep3(i, b, a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i, a)
#define rep1(i, a) rep2(i, 0, a)
#define rep2(i, b, a) for (int i = (b); i < ((int)(a)); i++)
#define rep3(i, b, a... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 886,995 | 886,996 | u590110823 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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!";
} else {
cout <... | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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!";
} else {
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,009 | 887,010 | u420245204 | cpp |
p03075 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,011 | 887,012 | u610897920 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> antennas;
for (int i = 0; i < 5; i++) {
int _in;
cin >> _in;
antennas.push_back(_in);
}
int k;
cin >> k;
bool ans = antennas[5] - antennas[0] <= k;
cout << (ans ? "Yay!" : ":(") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> antennas;
for (int i = 0; i < 5; i++) {
int _in;
cin >> _in;
antennas.push_back(_in);
}
int k;
cin >> k;
bool ans = antennas[4] - antennas[0] <= k;
cout << (ans ? "Yay!" : ":(") << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 887,015 | 887,016 | u303453927 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e;
if ((e - a) > k)
cout << ":(";
else
cout << "Yay!";
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) > k)
cout << ":(";
else
cout << "Yay!";
} | [
"expression.operation.binary.add"
] | 887,017 | 887,018 | u746310630 | 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 << ":(";
else
cout << "Yay";
}
| #include <iostream>
using namespace std;
int main()
{
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(";
else
cout << "Yay!";
}
| [
"literal.string.change",
"io.output.change"
] | 887,019 | 887,020 | u597079106 | 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 << ":(";
else
cout << "yay";
}
| #include <iostream>
using namespace std;
int main()
{
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(";
else
cout << "Yay!";
}
| [
"literal.string.change",
"io.output.change"
] | 887,021 | 887,020 | u597079106 | cpp |
p03075 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[5];
int k;
for (int i = 0; i < 5; ++i)
cin >> p[i];
cin >> k;
if (abs(p[0] - p[4]) < k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[5];
int k;
for (int i = 0; i < 5; ++i)
cin >> p[i];
cin >> k;
if (abs(p[0] - p[4]) > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 887,030 | 887,031 | u419501474 | cpp |
p03075 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[5];
int k;
for (int i = 0; i < 5; ++i)
cin >> p[i];
cin >> k;
if (abs(p[0] - p[4]) > k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[5];
int k;
for (int i = 0; i < 5; ++i)
cin >> p[i];
cin >> k;
if (abs(p[0] - p[4]) > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 887,032 | 887,031 | u419501474 | 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"
] | 887,034 | 887,035 | u596200441 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int k;
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
bool can_contact = true;
for (int i = 0; i < 4; ++i) {
for (int j = i + 1; j < 5; ++j) {
can_contact &= (a[j] - a[i]) ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int k;
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
bool can_contact = true;
for (int i = 0; i < 4; ++i) {
for (int j = i + 1; j < 5; ++j) {
can_contact &= (a[j] - a[i]) ... | [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 887,045 | 887,046 | u445401544 | cpp |
p03075 | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
int a[6], k;
int main() {
for (int i = 1; i <= 5; i++) {
cin >> a[i];
}
cin >> k;
if (a[5] - a[1] > k) {
cout << ":(";
} else
cout << "Yey!";
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
using namespace std;
int a[6], k;
int main() {
for (int i = 1; i <= 5; i++) {
cin >> a[i];
}
cin >> k;
if (a[5] - a[1] > k) {
cout << ":(";
} else
cout << "Yay!";
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 887,047 | 887,048 | u331140961 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << 'Yay!' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 887,049 | 887,050 | u273355214 | cpp |
p03075 | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int a, b, c, d, e, k, ans;
ans = 0;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &k);
int h[5] = {a, b, c, d, e};
for (int i = 0; i < 5; i++) {
for (int ii = 0; ii < 5; ii++) {
if (abs(h[i] - h[ii]) > k) {
ans = ans + 1;
prin... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int a, b, c, d, e, k, ans;
ans = 0;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &k);
int h[5] = {a, b, c, d, e};
for (int i = 0; i < 5; i += 1) {
for (int ii = 0; ii < 5; ii += 1) {
if (abs(h[i] - h[ii]) > k) {
ans = ans + 1;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 887,053 | 887,054 | u288432959 | 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 = "Yay";
if (e - a > k)
ans = ":(";
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 = "Yay!";
if (e - a > k)
ans = ":(";
cout << ans << endl;
return 0;
} | [
"literal.string.change",
"variable_declaration.value.change"
] | 887,055 | 887,056 | u063131621 | 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 = "Yay";
if (e - a >= k)
ans = ":(";
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 = "Yay!";
if (e - a > k)
ans = ":(";
cout << ans << endl;
return 0;
} | [
"literal.string.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,057 | 887,056 | u063131621 | cpp |
p03075 | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <... | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 887,068 | 887,069 | u667375816 | cpp |
p03075 | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <... | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 887,070 | 887,069 | u667375816 | cpp |
p03075 | #include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No... | #include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,075 | 887,076 | u942230032 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
// since a<b<c<d<e, we should check only whether a<e holds
if (e - a < k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
// since a<b<c<d<e, we should check only whether a<e holds
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,079 | 887,080 | u707853565 | cpp |
p03075 | #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int arr[6];
for (int i = 0; i < 6; i++) {
cin >> arr[i];
}
int sa = arr[5] - arr[0];
if (sa >= arr[6]) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int arr[6];
for (int i = 0; i < 6; i++) {
cin >> arr[i];
}
int sa = arr[4] - arr[0];
if (sa <= arr[5]) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,081 | 887,082 | u821064400 | cpp |
p03075 | #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int arr[6];
for (int i = 0; i < 6; i++) {
cin >> arr[i];
}
int sa = arr[5] - arr[0];
if (sa >= arr[6]) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int arr[6];
for (int i = 0; i < 6; i++) {
cin >> arr[i];
}
int sa = arr[4] - arr[0];
if (sa <= arr[5]) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,083 | 887,082 | u821064400 | 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 && c - a <= k && d - a <= k && e - a <= k && c - b <= k &&
d - b <= k && e - b <= k && d - c <= k && e - c <= k && e - d <= k) {
cout << "Yey!" << endl;
} else {
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (b - a <= k && c - a <= k && d - a <= k && e - a <= k && c - b <= k &&
d - b <= k && e - b <= k && d - c <= k && e - c <= k && e - d <= k) {
cout << "Yay!" << endl;
} else {
cout... | [
"literal.string.change",
"io.output.change"
] | 887,084 | 887,085 | u564060397 | 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 <= 4 * 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.operation.binary.remove"
] | 887,086 | 887,087 | u355424600 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int N[5] = {0};
int k = 0;
for (int i = 0; i < 5; i++) {
cin >> N[i];
}
cin >> k;
if (N[4] - N[0] <= k) {
cout << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N[5] = {0};
int k = 0;
for (int i = 0; i < 5; i++) {
cin >> N[i];
}
cin >> k;
if (N[4] - N[0] <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 887,090 | 887,091 | u304657273 | cpp |
p03075 | #include <iostream>
int main() {
int a, b, c, d, e, k;
std::cin >> a;
std::cin >> b;
std::cin >> c;
std::cin >> d;
std::cin >> e;
std::cin >> k;
if (e - a < k) {
std::cout << "Yay!";
} else {
std::cout << ":(";
}
} | // ConsoleApplication2.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
int main() {
int a, b, c, d, e, k;
std::cin >> a;
std::cin >> b;
std::cin >> c;
std::cin >> d;
std::cin >> e;
std::cin >> k;
if (e - a <= k) {
std::cout << "Yay!";
} else {
std::cout << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,092 | 887,093 | u277347379 | cpp |
p03075 | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
int main() {
uint16_t a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
bool yay = e - a < k;
cout << (yay ? "Yay!" : ":(") << endl;
return 0;
}
| #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
int main() {
uint16_t a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
bool yay = e - a <= k;
cout << (yay ? "Yay!" : ":(") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 887,103 | 887,104 | u843070415 | cpp |
p03075 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) <= k)
cout << 'Yay!' << endl;
else
cout << ':(' << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 887,107 | 887,108 | u631558039 | cpp |
p03075 | #include <bits/stdc++.h>
#define int long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a >= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,117 | 887,118 | u526894223 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
int dis = e - a;
if (dis < 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;
int dis = e - a;
if (dis <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,119 | 887,120 | u615258936 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (abs(a - e) <= 15) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (abs(a - e) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 887,125 | 887,126 | u562940053 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
vector<int> s(5);
for (int i = 0; i < 5; i++)
cin >> s[i];
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (k < s[j] - s[i]) {
cout << ":(" << endl;
return 0;
}
}
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
vector<int> s(5);
for (int i = 0; i < 5; i++)
cin >> s[i];
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (k < s[j] - s[i]) {
cout << ":(" << endl;
return 0;
}
... | [] | 887,127 | 887,128 | u602481141 | 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;
}
} | #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"
] | 887,129 | 887,130 | u887207211 | cpp |
p03075 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
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;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,133 | 887,134 | u887207211 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
bool flag = true;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k) {
flag = false;
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
bool flag = true;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (a[j] - a[i] > k) {
flag = false;
break;
}
}
... | [
"literal.string.change",
"io.output.change"
] | 887,138 | 887,139 | u108540384 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000007;
int main() {
cin.ti... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000007;
int main() {
cin.ti... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 887,140 | 887,141 | u612271542 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,142 | 887,143 | u155216115 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
vector<int> n(5);
n[0] = a;
n[1] = b;
n[2] = c;
n[3] = d;
n[4] = e;
sort(n.begin(), n.end());
int max_distance = n[4] - n[0];
if (max_distance <= k... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
vector<int> n(5);
n[0] = a;
n[1] = b;
n[2] = c;
n[3] = d;
n[4] = e;
sort(n.begin(), n.end());
int max_distance = n[4] - n[0];
if (max_distance <= k... | [
"literal.string.change",
"io.output.change"
] | 887,146 | 887,147 | u246343119 | cpp |
p03075 | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define DEC(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using... | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define DEC(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using... | [
"literal.number.change",
"call.arguments.change"
] | 887,148 | 887,149 | u067267922 | cpp |
p03075 | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define DEC(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using... | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define DEC(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using... | [
"literal.number.change",
"call.arguments.change"
] | 887,148 | 887,150 | u067267922 | cpp |
p03075 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#define REP_1(i, n) for (int i = 1; i < n + 1; i++)
#define bitSearch(bit, n) for (int bit =... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#define REP_1(i, n) for (int i = 1; i < n + 1; i++)
#define bitSearch(bit, n) for (int bit =... | [
"literal.number.change",
"call.arguments.change"
] | 887,155 | 887,156 | u741556152 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5], k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 0; i < 5; i++)
for (int k = i + 1; k < 5; k++) {
if (k < abs(a[i] - a[k])) {
cout << ":(" << endl;
return 0;
}
}
cout << "Y... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5], k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 0; i < 5; i++)
for (int j = i + 1; j < 5; j++) {
if (k < abs(a[i] - a[j])) {
cout << ":(" << endl;
return 0;
}
}
cout << "Y... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 887,157 | 887,158 | u318027064 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
int a, b, c, d, e, k, mx, mn;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> a >> b >> c >> d >> e >> k;
mx = max(max(max(a, b... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
int a, b, c, d, e, k, mx, mn;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> a >> b >> c >> d >> e >> k;
mx = max(max(max(a, b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 887,159 | 887,160 | u535425458 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.