problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
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) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end())
#define BIT(n) (1LL << (n))
#define DEBUG(a) cout << #a << " = " << a << endl
const ll inf = 1e15;
const ll mod = 1e9 + 7;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int N, K;
string S;
int num[100001];
char state[100001];
int main() {
cin >> N >> K;
cin >> S;
int count = 0;
char pre = S[0];
int key = 0;
REP(i, N) {
if (pre == S[i]) {
count++;
} else {
// num.push_back(count);
// state.push_back(pre);
num[key] = count;
state[key] = pre;
pre = S[i];
count = 1;
key += 1;
}
}
num[key] = count;
state[key] = pre;
key += 1;
int result = 0;
for (int i = 0; i < key; i += 2) {
// cout << n << endl;
// cout << i << endl;
int total = 0;
int inc = (state[i] == '1') ? 2 * K : 2 * K - 1;
for (int j = 0; j <= inc && i + j < key; j++) {
total += num[i + j];
}
// cout << total << endl;
result = max(result, total);
if (i == 0 && state[i] == '0') {
i++;
}
}
cout << result << endl;
}
| #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) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end())
#define BIT(n) (1LL << (n))
#define DEBUG(a) cout << #a << " = " << a << endl
const ll inf = 1e15;
const ll mod = 1e9 + 7;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int N, K;
string S;
int num[100001];
char state[100001];
int main() {
cin >> N >> K;
cin >> S;
int count = 0;
char pre = S[0];
int key = 0;
REP(i, N) {
if (pre == S[i]) {
count++;
} else {
// num.push_back(count);
// state.push_back(pre);
num[key] = count;
state[key] = pre;
pre = S[i];
count = 1;
key += 1;
}
}
num[key] = count;
state[key] = pre;
key += 1;
int result = 0;
for (int i = 0; i < key; i += 2) {
// cout << n << endl;
// cout << i << endl;
int total = 0;
int inc = (state[i] == '1') ? 2 * K : 2 * K - 1;
for (int j = 0; j <= inc && i + j < key; j++) {
total += num[i + j];
}
// cout << total << endl;
result = max(result, total);
if (i == 0 && state[i] == '0') {
i--;
}
}
cout << result << endl;
}
| [] | 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 {
nums.push_back(counter);
now = 1 - now;
counter = 1;
}
}
if (counter != 0)
nums.push_back(counter);
if (nums.size() % 2 == 0)
nums.push_back(
0); //最後が0カウンタならば架空の1の個数0を付け足す。1-0-1-0-1とかにしたい
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans;
int left = 0;
int right = 0;
int Add = 2 * K + 1;
int temp;
for (int i = 0; i < nums.size(); i += 2) {
left = i;
right = min(i + Add, (int)nums.size());
temp = sums[right] - sums[left];
ans = max(ans, temp);
}
cout << ans << endl;
} | #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 {
nums.push_back(counter);
now = 1 - now;
counter = 1;
}
}
if (counter != 0)
nums.push_back(counter);
if (nums.size() % 2 == 0)
nums.push_back(
0); //最後が0カウンタならば架空の1の個数0を付け足す。1-0-1-0-1とかにしたい
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans = 0;
int left = 0;
int right = 0;
int Add = 2 * K + 1;
int temp;
for (int i = 0; i < sums.size(); i += 2) {
left = i;
right = min(i + Add, (int)nums.size());
temp = sums[right] - sums[left];
ans = max(ans, temp);
}
cout << ans << endl;
} | [
"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 {
nums.push_back(counter);
now = 1 - now;
counter = 1;
}
}
if (counter != 0)
nums.push_back(counter);
if (nums.size() / 2 == 0)
nums.push_back(
0); //最後が0カウンタならば架空の1の個数0を付け足す。1-0-1-0-1とかにしたい
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans;
int left = 0;
int right = 0;
int Add = 2 * K + 1;
int temp;
for (int i = 0; i < nums.size(); i += 2) {
left = i;
right = min(i + Add, (int)nums.size());
temp = sums[right] - sums[left];
ans = max(ans, temp);
}
cout << ans << endl;
} | #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 {
nums.push_back(counter);
now = 1 - now;
counter = 1;
}
}
if (counter != 0)
nums.push_back(counter);
if (nums.size() % 2 == 0)
nums.push_back(
0); //最後が0カウンタならば架空の1の個数0を付け足す。1-0-1-0-1とかにしたい
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans = 0;
int left = 0;
int right = 0;
int Add = 2 * K + 1;
int temp;
for (int i = 0; i < sums.size(); i += 2) {
left = i;
right = min(i + Add, (int)nums.size());
temp = sums[right] - sums[left];
ans = max(ans, temp);
}
cout << ans << endl;
} | [
"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 {
nums.push_back(counter);
now = 1 - now;
counter = 1;
}
}
if (counter != 0)
nums.push_back(counter);
if (nums.size() % 2 == 0)
nums.push_back(
0); //最後が0カウンタならば架空の1の個数0を付け足す。1-0-1-0-1とかにしたい
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans;
int left = 0;
int right = 0;
int Add = 2 * K + 1;
int temp;
for (int i = 0; i < nums.size(); i += 2) {
left = i;
right = min(i + Add, (int)nums.size());
temp = sums[right] - sums[left];
ans = max(ans, temp);
}
cout << ans << endl;
} | #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 {
nums.push_back(counter);
now = 1 - now;
counter = 1;
}
}
if (counter != 0)
nums.push_back(counter);
if (nums.size() % 2 == 0)
nums.push_back(
0); //最後が0カウンタならば架空の1の個数0を付け足す。1-0-1-0-1とかにしたい
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans = 0;
int left = 0;
int right = 0;
int Add = 2 * K + 1;
int temp;
for (int i = 0; i < nums.size(); i += 2) {
left = i;
right = min(i + Add, (int)nums.size());
temp = sums[right] - sums[left];
ans = max(ans, temp);
}
cout << ans << endl;
} | [
"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 {
nums.push_back(counter);
now = 1 - now;
counter = 1;
}
}
if (counter != 0)
nums.push_back(counter);
if (nums.size() / 2 == 0)
nums.push_back(
0); //最後が0カウンタならば架空の1の個数0を付け足す。1-0-1-0-1とかにしたい
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans;
int left = 0;
int right = 0;
int Add = 2 * K + 1;
int temp;
for (int i = 0; i < nums.size(); i += 2) {
left = i;
right = min(i + Add, (int)nums.size());
temp = sums[right] - sums[left];
ans = max(ans, temp);
}
cout << ans << endl;
} | #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 {
nums.push_back(counter);
now = 1 - now;
counter = 1;
}
}
if (counter != 0)
nums.push_back(counter);
if (nums.size() % 2 == 0)
nums.push_back(
0); //最後が0カウンタならば架空の1の個数0を付け足す。1-0-1-0-1とかにしたい
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans = 0;
int left = 0;
int right = 0;
int Add = 2 * K + 1;
int temp;
for (int i = 0; i < nums.size(); i += 2) {
left = i;
right = min(i + Add, (int)nums.size());
temp = sums[right] - sums[left];
ans = max(ans, temp);
}
cout << ans << endl;
} | [
"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;
cnt = 1;
}
}
nums.push_back(cnt);
if (nums.size() % 2 == 0) {
nums.push_back(0);
}
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans(0);
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(left + 2 * k + 1, int(nums.size()));
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
}
| #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;
cnt = 1;
}
}
nums.push_back(cnt);
if (nums.size() % 2 == 0) {
nums.push_back(0);
}
vector<int> sums(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sums[i + 1] = sums[i] + nums[i];
}
int ans(0);
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(left + 2 * k + 1, int(nums.size()));
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
}
| [
"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 <utility>
#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 (size_t i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
nums.push_back(cnt);
}
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
vector<int> sums(nums.size() + 1);
sums[0] = 0;
for (size_t i = 0; i < nums.size(); i++) {
sums[i + 1] = nums[i] + sums[i];
}
for (size_t i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add + 1, sums.size());
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
}
| #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 <utility>
#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 (size_t i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
nums.push_back(cnt);
}
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
vector<int> sums(nums.size() + 1);
sums[0] = 0;
for (size_t i = 0; i < nums.size(); i++) {
sums[i + 1] = nums[i] + sums[i];
}
for (size_t i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add, nums.size());
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
}
| [
"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 <utility>
#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 (size_t i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
nums.push_back(cnt);
}
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
vector<int> sums(nums.size() + 1);
sums[0] = 0;
for (size_t i = 0; i < nums.size(); i++) {
sums[i + 1] = nums[i] + sums[i];
}
for (size_t i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add + 1, nums.size());
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
}
| #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 <utility>
#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 (size_t i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
nums.push_back(cnt);
}
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
vector<int> sums(nums.size() + 1);
sums[0] = 0;
for (size_t i = 0; i < nums.size(); i++) {
sums[i + 1] = nums[i] + sums[i];
}
for (size_t i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add, nums.size());
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
}
| [
"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 <utility>
#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 (size_t i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
nums.push_back(cnt);
}
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
vector<int> sums(nums.size() + 1);
sums[0] = nums[0];
for (size_t i = 0; i < nums.size(); i++) {
sums[i + 1] = nums[i] + sums[i];
}
for (size_t i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add + 1, nums.size());
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
}
| #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 <utility>
#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 (size_t i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
nums.push_back(cnt);
}
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
vector<int> sums(nums.size() + 1);
sums[0] = 0;
for (size_t i = 0; i < nums.size(); i++) {
sums[i + 1] = nums[i] + sums[i];
}
for (size_t i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add, nums.size());
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
}
| [
"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;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> v;
string t = "";
int tmp = 1;
s += '2';
rep(i, n) {
if (s[i] == s[i + 1])
tmp++;
else {
v.push_back(tmp);
tmp = 1;
t += s[i];
}
}
vector<int> sum(v.size() + 1);
sum[0] = 0;
rep(i, v.size()) sum[i + 1] = sum[i] + v[i];
int ans = 0, l = 0, r = 0, cnt = 0;
while (l <= v.size()) {
if (r == v.size()) {
if (t[l] == '0')
cnt--;
l++;
} else if (t[r] == '1')
r++;
else if (cnt < k) {
r++;
cnt++;
} else {
if (t[l] == '0')
cnt--;
l++;
}
ans = max(ans, sum[r] - sum[l]);
}
cout << ans << endl;
} | #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;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> v;
string t = "";
int tmp = 1;
s += '2';
rep(i, n) {
if (s[i] == s[i + 1])
tmp++;
else {
v.push_back(tmp);
tmp = 1;
t += s[i];
}
}
vector<int> sum(v.size() + 1);
sum[0] = 0;
rep(i, v.size()) sum[i + 1] = sum[i] + v[i];
int ans = 0, l = 0, r = 0, cnt = 0;
while (l < v.size()) {
if (r == v.size()) {
if (t[l] == '0')
cnt--;
l++;
} else if (t[r] == '1')
r++;
else if (cnt < k) {
r++;
cnt++;
} else {
if (t[l] == '0')
cnt--;
l++;
}
ans = max(ans, sum[r] - sum[l]);
}
cout << ans << endl;
} | [
"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' + now)) cnt++;
else {
ary.push_back(cnt);
now = 1 - now; //0と1を切り替える時の計算 now ^= 1;
cnt = 1; //新しいのをカウントし始める
}
}
if (cnt != 0) ary.push_back(cnt);
//1-0-1-0-1-0-1って感じの配列が欲しい
//1-0-1-0みたいに0で終わってたら、適当に１つ足す
if (ary.size() % 2 == 0) ary.push_back(0);
if (str[0] == '0') {
ary.push_back(0);
}
#else
char prev = 0;
for (ll i = 0; (i < n); i++) {
char curr = str[i];
if (prev != curr) {
prev = curr;
ary.push_back(1);
} else {
ary[ary.size() - 1]++;
}
}
if (str[n - 1] == '0')
ary.push_back(0);
#endif
#if 1
vector<int> sum(ary.size() + 1);
for (int i = 0; i < ary.size(); i++) {
sum[i + 1] = sum[i] + ary[i];
}
#else
vector<ll> sum(ary.size() + 1, 0);
for (ll i = 0; (i < ary.size()); ++i) {
sum[i + 1] = sum[i] + ary[i];
}
#endif
#if 1
int Add = 2 * k + 1;
int maxv = 0;
// 1-0-1...の1から始めるので、偶数番目だけ見る
for (int i = 0; i < ary.size(); i += 2) {
//次のleft, rightを計算する [left, right)
int left = i;
int right = min(i + Add, (int)ary.size());
int tmp = sum[right] - sum[left];
maxv = max(tmp, maxv);
}
#else
ll maxv = 0;
for (ll i = 1; (i < ary.size()); i += 2) {
ll left = i - 1;
ll right = min((ll)(sum.size() - 1), i + (k - 1) * 2 + 1 + 1);
maxv = max(maxv, sum[right] - sum[left]);
}
#endif
cout << maxv << endl;
return 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))
cnt++;
else {
ary.push_back(cnt);
now = 1 - now; // 0と1を切り替える時の計算 now ^= 1;
cnt = 1; //新しいのをカウントし始める
}
}
if (cnt != 0)
ary.push_back(cnt);
// 1-0-1-0-1-0-1って感じの配列が欲しい
// 1-0-1-0みたいに0で終わってたら、適当に１つ足す
if (ary.size() % 2 == 0)
ary.push_back(0);
if (str[0] == '0') {
ary.push_back(0);
}
#else
char prev = 0;
for (ll i = 0; (i < n); i++) {
char curr = str[i];
if (prev != curr) {
prev = curr;
ary.push_back(1);
} else {
ary[ary.size() - 1]++;
}
}
if (str[n - 1] == '0')
ary.push_back(0);
#endif
#if 0
vector<int> sum(ary.size() + 1);
for (int i = 0; i < ary.size(); i++)
{
sum[i + 1] = sum[i] + ary[i];
}
#else
vector<ll> sum(ary.size() + 1, 0);
for (ll i = 0; (i < ary.size()); ++i) {
sum[i + 1] = sum[i] + ary[i];
}
#endif
#if 1
int Add = 2 * k + 1;
int maxv = 0;
// 1-0-1...の1から始めるので、偶数番目だけ見る
for (int i = 0; i < ary.size(); i += 2) {
//次のleft, rightを計算する [left, right)
int left = i;
int right = min(i + Add, (int)ary.size());
int tmp = sum[right] - sum[left];
maxv = max(tmp, maxv);
}
#else
ll maxv = 0;
for (ll i = 1; (i < ary.size()); i += 2) {
ll left = i - 1;
ll right = min((ll)(sum.size() - 1), i + (k - 1) * 2 + 1 + 1);
maxv = max(maxv, sum[right] - sum[left]);
}
#endif
cout << maxv << endl;
return 0;
}
| [
"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 <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR_LT(i, beg, end) for (int i = beg; i < end; i++)
#define FOR_LE(i, beg, end) for (int i = beg; i <= end; i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> starts(n + 2);
starts[0] = 0;
int s_count = 1;
bool is_prev_0 = false;
FOR_LT(i, 0, n) {
bool is_zero = (s[i] == '0');
if (is_prev_0 != is_zero) {
starts[s_count] = i;
s_count++;
}
is_prev_0 = is_zero;
}
starts[s_count] = n;
s_count++;
int segment_num = s_count / 2 - k;
if (segment_num <= 0) {
cout << n << endl;
return 0;
}
int ans = 0;
FOR_LT(i, 0, segment_num) {
int s_p = starts[i * 2];
int e_i = min(s_count - 1, i * 2 + k * 2 + 1);
int e_p = starts[e_i];
ans = max(ans, e_p - s_p);
}
cout << ans << endl;
return 0;
}
| #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 <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR_LT(i, beg, end) for (int i = beg; i < end; i++)
#define FOR_LE(i, beg, end) for (int i = beg; i <= end; i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> starts(n + 2);
starts[0] = 0;
int s_count = 1;
bool is_prev_0 = false;
FOR_LT(i, 0, n) {
bool is_zero = (s[i] == '0');
if (is_prev_0 != is_zero) {
starts[s_count] = i;
s_count++;
}
is_prev_0 = is_zero;
}
starts[s_count] = n;
s_count++;
int segment_num = (s_count + 1) / 2 - k;
if (segment_num <= 0) {
cout << n << endl;
return 0;
}
int ans = 0;
FOR_LT(i, 0, segment_num) {
int s_p = starts[i * 2];
int e_i = min(s_count - 1, i * 2 + k * 2 + 1);
int e_p = starts[e_i];
ans = max(ans, e_p - s_p);
}
cout << ans << endl;
return 0;
}
| [] | 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;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define llrep(i, m, n) for (ll i = m; i < n; ++i)
#define inf 1000000000
#define llinf 1000000000000000000
#define MOD 1000000007
#define ll long long
#define mp make_pair
#define all(v) v.begin(), v.end()
vector<int> v0, v1;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s[0] == '0') {
v1.push_back(0);
}
int hoge = 1;
rep(i, 1, n) {
if (s[i] != s[i - 1]) {
if (s[i - 1] == '0') {
v0.push_back(hoge);
} else {
v1.push_back(hoge);
}
hoge = 1;
} else {
hoge++;
}
}
if (s[n - 1] == '0') {
v1.push_back(0);
v0.push_back(hoge);
} else {
v1.push_back(hoge);
}
if (v0.size() == 0) {
cout << n << endl;
return 0;
}
rep(i, 1, v0.size()) { v0[i] += v0[i - 1]; }
rep(i, 1, v1.size()) { v1[i] += v1[i - 1]; }
int ans = 0;
v0.insert(v0.begin(), 0);
v1.insert(v1.begin(), 0);
rep(i, 0, v0.size() - k) {
ans = max(ans, v1[k + i + 1] - v1[i] + v0[k + i] - v0[i]);
}
cout << ans << endl;
return 0;
} | #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;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define llrep(i, m, n) for (ll i = m; i < n; ++i)
#define inf 1000000000
#define llinf 1000000000000000000
#define MOD 1000000007
#define ll long long
#define mp make_pair
#define all(v) v.begin(), v.end()
vector<int> v0, v1;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s[0] == '0') {
v1.push_back(0);
}
int hoge = 1;
rep(i, 1, n) {
if (s[i] != s[i - 1]) {
if (s[i - 1] == '0') {
v0.push_back(hoge);
} else {
v1.push_back(hoge);
}
hoge = 1;
} else {
hoge++;
}
}
if (s[n - 1] == '0') {
v1.push_back(0);
v0.push_back(hoge);
} else {
v1.push_back(hoge);
}
if (v0.size() < k) {
cout << n << endl;
return 0;
}
rep(i, 1, v0.size()) { v0[i] += v0[i - 1]; }
rep(i, 1, v1.size()) { v1[i] += v1[i - 1]; }
int ans = 0;
v0.insert(v0.begin(), 0);
v1.insert(v1.begin(), 0);
rep(i, 0, v0.size() - k) {
ans = max(ans, v1[k + i + 1] - v1[i] + v0[k + i] - v0[i]);
}
cout << ans << endl;
return 0;
} | [] | 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); \
cout.tie(NULL)
#define END return EXIT_SUCCESS
#define up(I, A, B) for (auto I = (A); I <= (B); ++I)
#define pb push_back
#define pf push_front
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2, class T3> inline void in(T1 &p1, T2 &p2, T3 &p3) {
cin >> p1 >> p2 >> p3;
}
template <class T> inline void out(T p) { cout << p << endl; }
long N, K, len = 1, i, M, ans = 1, L, k;
string S;
deque<long> v, s;
inline void solve(void) {
in(N, K, S);
up(i, 1, N - 1) {
if (S[i] == S[i - 1])
len++;
else {
v.pb(len);
len = 1;
}
}
v.pb(len);
if (S[0] == '0')
v.pf(0);
if (S[N - 1] == '0')
v.pb(0);
M = v.size();
s.resize(M + 1);
for (i = 0; i < M; i++)
s[i + 1] = s[i] + v[i];
for (i = 0; i < M; i += 2) {
L = 2 * K + 1 + i;
if (L > M)
L = M;
chmax(ans, s[i + L] - s[i]);
}
out(ans);
}
int main(int argc, char **argv) {
BEGIN;
solve();
END;
}
| #include <algorithm>
#include <deque>
#include <iostream>
#include <string>
using namespace std;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define END return EXIT_SUCCESS
#define up(I, A, B) for (auto I = (A); I <= (B); ++I)
#define pb push_back
#define pf push_front
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2, class T3> inline void in(T1 &p1, T2 &p2, T3 &p3) {
cin >> p1 >> p2 >> p3;
}
template <class T> inline void out(T p) { cout << p << endl; }
long N, K, len = 1, i, M, ans = 1, L, k;
string S;
deque<long> v, s;
inline void solve(void) {
in(N, K, S);
up(i, 1, N - 1) {
if (S[i] == S[i - 1])
len++;
else {
v.pb(len);
len = 1;
}
}
v.pb(len);
if (S[0] == '0')
v.pf(0);
if (S[N - 1] == '0')
v.pb(0);
M = v.size();
s.resize(M + 1);
for (i = 0; i < M; i++)
s[i + 1] = s[i] + v[i];
for (i = 0; i < M; i += 2) {
L = 2 * K + 1 + i;
if (L > M)
L = M;
chmax(ans, s[L] - s[i]);
}
out(ans);
}
int main(int argc, char **argv) {
BEGIN;
solve();
END;
}
| [
"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); \
cout.tie(NULL)
#define END return EXIT_SUCCESS
#define up(I, A, B) for (auto I = (A); I <= (B); ++I)
#define pb push_back
#define pf push_front
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2, class T3> inline void in(T1 &p1, T2 &p2, T3 &p3) {
cin >> p1 >> p2 >> p3;
}
template <class T> inline void out(T p) { cout << p << endl; }
long N, K, len = 1, i, M, ans = 1, L, k;
string S;
deque<long> v, s;
inline void solve(void) {
in(N, K, S);
up(i, 1, N - 1) {
if (S[i] == S[i - 1])
len++;
else {
v.pb(len);
len = 1;
}
}
v.pb(len);
if (S[0] == '0')
v.pf(0);
if (S[N - 1] == '0')
v.pb(0);
M = v.size();
s.resize(M + 1);
for (i = 0; i < M; i++)
s[i + 1] = s[i] + v[i];
for (i = 0; i < M; i += 2) {
L = 2 * K + 1 + i;
if (L > M)
L = M;
chmax(ans, s[i + L] - s[i]);
}
out(ans);
}
int main(int argc, char **argv) {
BEGIN;
solve();
END;
}
| #include <algorithm>
#include <deque>
#include <iostream>
#include <string>
using namespace std;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define END return EXIT_SUCCESS
#define up(I, A, B) for (auto I = (A); I <= (B); ++I)
#define pb push_back
#define pf push_front
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2, class T3> inline void in(T1 &p1, T2 &p2, T3 &p3) {
cin >> p1 >> p2 >> p3;
}
template <class T> inline void out(T p) { cout << p << endl; }
long N, K, len = 1, i, M, ans = 1, L, k;
string S;
deque<long> v, s;
inline void solve(void) {
in(N, K, S);
up(i, 1, N - 1) {
if (S[i] == S[i - 1])
len++;
else {
v.pb(len);
len = 1;
}
}
v.pb(len);
if (S[0] == '0')
v.pf(0);
if (S[N - 1] == '0')
v.pb(0);
M = v.size();
s.resize(M + 1);
for (i = 0; i < M; i++)
s[i + 1] = s[i] + v[i];
for (i = 0; i < M; i += 2) {
L = 2 * K + 1 + i;
if (L >= M)
L = M;
chmax(ans, s[L] - s[i]);
}
out(ans);
}
int main(int argc, char **argv) {
BEGIN;
solve();
END;
}
| [
"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) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
struct edge {
int to, cost;
};
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> P;
const int INF = 1e9;
// const ll INF = 1e18;
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int ans = 0, sum = 0, l = 0;
for (int r = 0; r < n; r++) {
if (s[r] == '0') {
while (r < n && s[r] == '0')
r++;
sum++;
}
if (sum > k) {
for (; l < n; l++) {
if (s[l] == '0') {
while (l < n && s[l] == '0')
l++;
break;
}
}
sum--;
}
ans = max(ans, r - l + 1);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
struct edge {
int to, cost;
};
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> P;
const int INF = 1e9;
// const ll INF = 1e18;
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int ans = 0, sum = 0, l = 0;
for (int r = 0; r < n; r++) {
if (s[r] == '0') {
while (r < n && s[r] == '0')
r++;
r--;
sum++;
}
if (sum > k) {
for (; l < n; l++) {
if (s[l] == '0') {
while (l < n && s[l] == '0')
l++;
break;
}
}
sum--;
}
ans = max(ans, r - l + 1);
}
cout << ans << endl;
return 0;
} | [
"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;
cnt = 1;
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
vector<int> cum(Nums.size() + 1);
for (int i = 0; i < (int)cum.size(); i++) {
cum[i + 1] = cum[i] + Nums[i];
}
// 1 0 1 0 1 0 1
// 0 1 3 5 8 10 14
int Add = 2 * k + 1;
int ans = 0;
for (int i = 0; i < (int)Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = cum[right] - cum[left];
ans = max(tmp, ans);
}
cout << ans;
return 0;
} | #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;
cnt = 1;
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
vector<int> cum(Nums.size() + 1);
for (int i = 0; i < (int)Nums.size(); i++) {
cum[i + 1] = cum[i] + Nums[i];
}
// 1 0 1 0 1 0 1
// 0 1 3 5 8 10 14
int Add = 2 * k + 1;
int ans = 0;
for (int i = 0; i < (int)Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = cum[right] - cum[left];
ans = max(tmp, ans);
}
cout << ans;
return 0;
}
| [
"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;
cnt = 1;
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
vector<int> cum(Nums.size() + 1);
for (int i = 0; i < (int)cum.size(); i++) {
cum[i + 1] = cum[i] + Nums[i];
}
// 1 0 1 0 1 0 1
// 0 1 3 5 8 10 14
int Add = 2 * k + 1;
int ans = 0;
for (int i = 0; i < (int)Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = cum[right] - cum[left];
cout << tmp;
ans = max(tmp, ans);
}
cout << ans;
return 0;
} | #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;
cnt = 1;
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
vector<int> cum(Nums.size() + 1);
for (int i = 0; i < (int)Nums.size(); i++) {
cum[i + 1] = cum[i] + Nums[i];
}
// 1 0 1 0 1 0 1
// 0 1 3 5 8 10 14
int Add = 2 * k + 1;
int ans = 0;
for (int i = 0; i < (int)Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = cum[right] - cum[left];
ans = max(tmp, ans);
}
cout << ans;
return 0;
}
| [
"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] += accum[i - 1];
int lo = 1, hi = s.size(), ans = 1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
bool someone = false;
for (int i = 0; i + mid <= s.size(); i++) {
bool canDo = s[i] == '1' || (s[i] == '0' && (i == 0 || s[i - 1] != '0'));
if (canDo) {
int V = accum[i + mid] - (i ? accum[i - 1] : 0);
if (V <= k)
someone = true;
}
}
if (someone)
lo = mid + 1, ans = mid;
else
hi = mid - 1;
}
cout << ans << endl;
return 0;
} | #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] += accum[i - 1];
int lo = 1, hi = s.size(), ans = 1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
bool someone = false;
for (int i = 0; i + mid <= s.size(); i++) {
bool canDo = s[i] == '1' || (s[i] == '0' && (i == 0 || s[i - 1] != '0'));
if (canDo) {
int V = accum[i + mid - 1] - (i ? accum[i - 1] : 0);
if (V <= k)
someone = true;
}
}
if (someone)
lo = mid + 1, ans = mid;
else
hi = mid - 1;
}
cout << ans << endl;
return 0;
}
| [
"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 >> 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 - 1] + a[i];
int b = 0;
int ans = 0;
for (int i = 1; i <= n; i++) {
b ^= a[i];
int x = upper_bound(sum, sum + n, k * 2 - (!b) + sum[i]) - sum;
ans = max(ans, x - i);
}
cout << ans;
return 0;
} | #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 >> 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 - 1] + a[i];
int b = 0;
int ans = 0;
for (int i = 1; i <= n; i++) {
b ^= a[i];
int x = upper_bound(sum, sum + n + 1, k * 2 - (!b) + sum[i]) - sum;
ans = max(ans, x - i);
}
cout << ans;
return 0;
} | [
"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++)
sum[i] = sum[i - 1] + a[i];
int b = 0, ans = 0;
for (int i = 1; i <= n; i++) {
b ^= a[i];
int x = upper_bound(sum, sum + 1 + n, k * 2 - (!b) + sum[i]) - sum;
ans = max(ans, x - i);
}
printf("%d\n", ans);
} | #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++)
sum[i] = sum[i - 1] + a[i];
int b = 0, ans = 0;
for (int i = 1; i <= n; i++) {
b ^= a[i];
int x = upper_bound(sum, sum + 1 + n, k * 2 - (!b) + sum[i]) - sum;
ans = max(ans, x - i);
}
printf("%d\n", ans);
} | [
"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 <vector>
using namespace std;
#define TOSTRING(x) #x
#define SZ(x) (int)(x).size()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REPR(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), v.end());
#define PAU system("pause")
typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 28);
const ll LINF = 1e18;
const double PI = acos(-1);
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
char c = '1';
int cur = 0;
vi V;
queue<int> Q;
REP(i, N) {
if (S[i] == c) {
cur++;
} else {
V.push_back(cur);
cur = 1;
c = S[i];
}
}
V.push_back(cur);
int ind = 0;
int sum = 0;
int ans = 0;
while (ind < SZ(V)) {
chmax(ans, sum + V[ind]);
if (ind == N - 1)
break;
sum += V[ind] + V[ind + 1];
Q.push(V[ind] + V[ind + 1]);
if (SZ(Q) > K) {
sum -= Q.front();
Q.pop();
}
ind += 2;
}
chmax(ans, sum);
cout << ans << endl;
return 0;
}
| #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 <vector>
using namespace std;
#define TOSTRING(x) #x
#define SZ(x) (int)(x).size()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REPR(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), v.end());
#define PAU system("pause")
typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 28);
const ll LINF = 1e18;
const double PI = acos(-1);
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
char c = '1';
int cur = 0;
vi V;
queue<int> Q;
REP(i, N) {
if (S[i] == c) {
cur++;
} else {
V.push_back(cur);
cur = 1;
c = S[i];
}
}
V.push_back(cur);
int ind = 0;
int sum = 0;
int ans = 0;
while (ind < SZ(V)) {
chmax(ans, sum + V[ind]);
if (ind == SZ(V) - 1)
break;
sum += V[ind] + V[ind + 1];
Q.push(V[ind] + V[ind + 1]);
if (SZ(Q) > K) {
sum -= Q.front();
Q.pop();
}
ind += 2;
}
chmax(ans, sum);
cout << ans << endl;
return 0;
}
| [
"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 - 1] + a[i];
}
int b = 0, Max = 0;
for (int i = 1; i <= n; i++) {
b ^= a[i];
int x = upper_bound(sum, sum + 1, K * 2 - (!b) + sum[i]) - sum;
Max = max(Max, x - i);
}
cout << Max << "\n";
return 0;
} | #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 - 1] + a[i];
}
int b = 0, Max = 0;
for (int i = 1; i <= n; i++) {
b ^= a[i];
int x = upper_bound(sum, sum + n + 1, K * 2 - (!b) + sum[i]) - sum;
Max = max(Max, x - i);
}
cout << Max << "\n";
return 0;
} | [
"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(x) (int)(x).size()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define show(x) cout << #x << " = " << x << endl;
#define all(a) (a.begin()), (a.end())
#define each(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)
#define perm(c) \
sort(all(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(all(c)))
#define bitComb(a, n, k) \
for (int a##x, a##y, a = (1 << k) - 1; a < (1 << n); \
a##x = a & -a, a##y = a + a##x, a = (((a & ~a##y) / a##x) >> 1) | a##y)
#define uniq(v) \
sort(all(v)); \
v.erase(unique(all(v)), v.end())
#define bit(n) (1LL << (n))
#define randInt(l, r) (uniform_int_distribution<ll>(l, r)(rnd))
#define randDouble(l, r) (uniform_real_distribution<double>(l, r)(rnd))
#define dout(d) printf("%.12f\n", d)
typedef long long ll;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T, class Y>
ostream &operator<<(ostream &o, const pair<T, Y> &p) {
return o << "(" << p.fi << ", " << p.se << ")";
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &v) {
fill((T *)array, (T *)(array + N), v);
}
lll gcd(lll a, lll b, lll &x, lll &y) {
if (!b) {
x = 1;
y = 0;
return a;
}
lll d = gcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
ll gcd(ll a, ll b) {
lll x = 0, y = 0;
return gcd(a, b, x, y);
}
ll modInv(ll a, ll m) {
lll x, y;
gcd(a, m, x, y);
return (x % m + m) % m;
}
ll modPow(lll a, lll n, ll m) {
if (!a)
return a;
lll p = 1;
for (; n > 0; n >>= 1, a = a * a % m)
if (n & 1)
p = p * a % m;
return (ll)p;
}
bool isPrime(ll n) {
if (n < 2 || n % 2 == 0)
return n == 2;
lll t = n - 1, d = t / (t & -t);
for (lll a : {2, 325, 9375, 28178, 450775, 9780504, 1795265022})
if (a % n) {
for (t = d, a = modPow(a, t, n); t != n - 1 && a != 1 && a != n - 1;
a = a * a % n, t = t * 2 % n)
;
if (a != n - 1 && t % 2 == 0)
return 0;
}
return 1;
}
const int IINF = 1e9 + 6;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());
const int N = 2e5 + 1;
int n, k;
string s;
int _v[N + 1], *v = _v + 1;
main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k >> s;
Fill(_v, n);
char p = '1', idx = 0;
v[-1] = 0;
FOR(i, 0, sz(s)) {
if (s[i] != p) {
v[idx++] = i;
p = s[i];
}
}
int ma = 0;
for (int i = k * 2; i < n; i += 2)
maxs(ma, v[i] - v[i - k * 2 - 1]);
cout << ma << endl;
} | #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(x) (int)(x).size()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define show(x) cout << #x << " = " << x << endl;
#define all(a) (a.begin()), (a.end())
#define each(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)
#define perm(c) \
sort(all(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(all(c)))
#define bitComb(a, n, k) \
for (int a##x, a##y, a = (1 << k) - 1; a < (1 << n); \
a##x = a & -a, a##y = a + a##x, a = (((a & ~a##y) / a##x) >> 1) | a##y)
#define uniq(v) \
sort(all(v)); \
v.erase(unique(all(v)), v.end())
#define bit(n) (1LL << (n))
#define randInt(l, r) (uniform_int_distribution<ll>(l, r)(rnd))
#define randDouble(l, r) (uniform_real_distribution<double>(l, r)(rnd))
#define dout(d) printf("%.12f\n", d)
typedef long long ll;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T, class Y>
ostream &operator<<(ostream &o, const pair<T, Y> &p) {
return o << "(" << p.fi << ", " << p.se << ")";
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &v) {
fill((T *)array, (T *)(array + N), v);
}
lll gcd(lll a, lll b, lll &x, lll &y) {
if (!b) {
x = 1;
y = 0;
return a;
}
lll d = gcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
ll gcd(ll a, ll b) {
lll x = 0, y = 0;
return gcd(a, b, x, y);
}
ll modInv(ll a, ll m) {
lll x, y;
gcd(a, m, x, y);
return (x % m + m) % m;
}
ll modPow(lll a, lll n, ll m) {
if (!a)
return a;
lll p = 1;
for (; n > 0; n >>= 1, a = a * a % m)
if (n & 1)
p = p * a % m;
return (ll)p;
}
bool isPrime(ll n) {
if (n < 2 || n % 2 == 0)
return n == 2;
lll t = n - 1, d = t / (t & -t);
for (lll a : {2, 325, 9375, 28178, 450775, 9780504, 1795265022})
if (a % n) {
for (t = d, a = modPow(a, t, n); t != n - 1 && a != 1 && a != n - 1;
a = a * a % n, t = t * 2 % n)
;
if (a != n - 1 && t % 2 == 0)
return 0;
}
return 1;
}
const int IINF = 1e9 + 6;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());
const int N = 2e5 + 1;
int n, k;
string s;
int _v[N + 1], *v = _v + 1;
main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k >> s;
Fill(_v, n);
char p = '1';
int idx = 0;
v[-1] = 0;
FOR(i, 0, sz(s)) {
if (s[i] != p) {
v[idx++] = i;
p = s[i];
}
}
int ma = 0;
for (int i = k * 2; i < N; i += 2)
maxs(ma, v[i] - v[i - k * 2 - 1]);
cout << ma << endl;
} | [
"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_bound
#define ub upper_bound
#define LL long long
#define ULL unsigned long long
#define ret return
#define sz(x) (LL) x.size()
LL n, i, j, ans = 0;
int main() { // Read the constraints,highlights,Time Limit,Test Cases
ios_base::sync_with_stdio(false);
cin.tie(NULL);
LL k;
cin >> n >> k;
string s;
cin >> s;
vector<pair<LL, LL>> V;
if (s[0] == '0')
V.pb({0, -1});
LL cnt = 0;
for (int i = 0; i < sz(s); i++) {
if (s[i] == '1')
cnt++;
else {
if (cnt)
V.pb({cnt, i - cnt}), ans = max(ans, cnt);
cnt = 0;
}
}
if (cnt)
V.pb({cnt, sz(s) - cnt});
else
V.pb({0, sz(s)});
if (k > sz(V) - 2)
ret cout << sz(s), 0;
// cout<<sz(V)-k<<endl;
// for(auto i:V) cout<<i.F<<"| "<<i.S<<endl;
int l = k;
for (int i = 0; i < sz(V) - l; i++) { // cout<<"j = "<<i<<endl;
if (V[i].S == -1)
V[i].S = 0;
if (V[k].S == sz(s))
V[k].S = sz(s) - 1;
// cout<<"i = "<<i<<endl;
ans = max(ans, V[k].S - V[i].S + 1 + V[k].F - 1);
// cout<<i<<" "<<ans<<" "<<V[k].S<<" "<<V[i].S<<" "<<V[k].F<<endl;
k++;
}
cout << ans << endl;
}
// Check for 0,1 and other corner cases. | /*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_bound
#define ub upper_bound
#define LL long long
#define ULL unsigned long long
#define ret return
#define sz(x) (LL) x.size()
LL n, i, j, ans = 0;
int main() { // Read the constraints,highlights,Time Limit,Test Cases
ios_base::sync_with_stdio(false);
cin.tie(NULL);
LL k;
cin >> n >> k;
string s;
cin >> s;
vector<pair<LL, LL>> V;
if (s[0] == '0')
V.pb({0, -1});
LL cnt = 0;
for (int i = 0; i < sz(s); i++) {
if (s[i] == '1')
cnt++;
else {
if (cnt)
V.pb({cnt, i - cnt}), ans = max(ans, cnt);
cnt = 0;
}
}
if (cnt)
V.pb({cnt, sz(s) - cnt});
else
V.pb({1, sz(s)});
if (k > sz(V) - 2)
ret cout << sz(s), 0;
int l = k;
for (int i = 0; i < sz(V) - l; i++) {
if (V[i].S == -1)
V[i].S = 0;
if (V[k].S == sz(s))
V[k].S = sz(s) - 1;
ans = max(ans, V[k].S - V[i].S + 1 + V[k].F - 1);
k++;
}
cout << ans << endl;
}
// Check for 0,1 and other corner cases. | [
"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) {
flag = 1;
}
}
}
if ((flag == 0) ? cout << ":(" << endl : cout << "Yay!" << endl)
;
} | #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) {
flag = 1;
}
}
}
if ((flag == 1) ? cout << ":(" << endl : cout << "Yay!" << endl)
;
} | [
"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) {
flag = 1;
}
}
}
if ((flag == 0) ? cout << ":(" << endl : cout << "Yay!" << endl)
;
} | #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) {
flag = 1;
}
}
}
if ((flag == 1) ? cout << ":(" << endl : cout << "Yay!" << endl)
;
} | [
"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) {
flag = 1;
}
}
}
if ((flag == 0) ? cout << ":(" << endl : cout << "Yay!" << endl)
;
} | #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) {
flag = 1;
}
}
}
if ((flag == 1) ? cout << ":(" << endl : cout << "Yay!" << endl)
;
} | [
"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) {
flag = 1;
}
}
}
if ((flag == 1) ? cout << ":(" << endl : cout << "Yay!" << endl)
;
} | #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) {
flag = 1;
}
}
}
if ((flag == 1) ? cout << ":(" << endl : cout << "Yay!" << endl)
;
} | [
"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;
}
return false;
}
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<long long, long long>;
using veci = vector<int>;
using vecl = vector<long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
int main() {
veci res(5);
REP(i, 5) cin >> res[i];
int k;
cin >> k;
bool ok = true;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (res[j] - res[i] > k)
ok = false;
}
}
cout << (ok ? "Yey!" : ":(") << endl;
} | // 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;
}
return false;
}
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<long long, long long>;
using veci = vector<int>;
using vecl = vector<long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
int main() {
veci res(5);
REP(i, 5) cin >> res[i];
int k;
cin >> k;
bool ok = true;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (res[j] - res[i] > k)
ok = false;
}
}
cout << (ok ? "Yay!" : ":(") << endl;
} | [
"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 >> k;
sort(a.begin(), a.end());
if (a[4] - a[0] <= k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | #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 >> k;
sort(a.begin(), a.end());
if (a[4] - a[0] <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"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);
ios::sync_with_stdio(false);
int k;
vector<int> v(5);
for (int i = 0; i < 5; i++) {
cin >> v.at(i);
}
cin >> k;
bool flag = true;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (v.at(i) != v.at(j)) {
flag = false;
}
}
}
if (flag)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| #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);
ios::sync_with_stdio(false);
int k;
vector<int> v(5);
for (int i = 0; i < 5; i++) {
cin >> v.at(i);
}
cin >> k;
bool flag = true;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (v.at(j) - v.at(i) > k) {
flag = false;
}
}
}
if (flag)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| [
"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 namespace std;
ll n, k;
const ll mod = 1000000007;
int main() {
int a[5], k;
rep(i, 5) cin >> a[i];
cin >> k;
if (abs(a[0] - a[4]) >= k)
out(":(");
else
out("Yay!");
} | #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 namespace std;
ll n, k;
const ll mod = 1000000007;
int main() {
int a[5], k;
rep(i, 5) cin >> a[i];
cin >> k;
if (abs(a[0] - a[4]) > k)
out(":(");
else
out("Yay!");
} | [
"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
const int MOD = 1000000007;
template <class T> void print(const T &t) { cout << t << endl; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
vector<ll> a(6);
rep(i, 5) { cin >> a[i]; }
rep(i, 5) { chmin(a[0], a[i]); }
ll b = a[0];
rep(i, 5) { chmax(a[0], a[i]); }
ll c = a[0];
ll d = c - b;
if (d > a[5]) {
print(":(");
} else {
print("Yay!");
}
} | #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
const int MOD = 1000000007;
template <class T> void print(const T &t) { cout << t << endl; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
vector<ll> a(6);
rep(i, 6) { cin >> a[i]; }
rep(i, 5) { chmin(a[0], a[i]); }
ll b = a[0];
rep(i, 5) { chmax(a[0], a[i]); }
ll c = a[0];
ll d = c - b;
if (d > a[5]) {
print(":(");
} else {
print("Yay!");
}
} | [
"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 namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
struct Edge {
ll from, to, cost;
};
struct node {
ll cost, to;
bool friend operator>(node a, node b) { return a.cost > b.cost; }
};
ll mod(ll a, ll mod) {
ll res = a % mod;
if (res < 0)
res = res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, a % b);
}
bool is_prime(ll n) {
ll i = 2;
if (n == 1)
return false;
if (n == 2)
return true;
bool res = true;
while (i * i < n) {
if (n % i == 0) {
res = false;
}
i = i + 1;
}
// if(i==1)res = false;
if (n % i == 0)
res = false;
return res;
}
/**************************************
** A main function starts from here **
***************************************/
int main() {
ll a[6];
rep(i, 6) cin >> a[i];
bool ans = true;
rep(i, 4) for (ll j = i + 1; j < 4; j++) {
ans = ans and (a[j] - a[i] <= a[5]);
}
cout << (ans ? "Yay!" : ":(");
return 0;
}
| #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 namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
struct Edge {
ll from, to, cost;
};
struct node {
ll cost, to;
bool friend operator>(node a, node b) { return a.cost > b.cost; }
};
ll mod(ll a, ll mod) {
ll res = a % mod;
if (res < 0)
res = res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, a % b);
}
bool is_prime(ll n) {
ll i = 2;
if (n == 1)
return false;
if (n == 2)
return true;
bool res = true;
while (i * i < n) {
if (n % i == 0) {
res = false;
}
i = i + 1;
}
// if(i==1)res = false;
if (n % i == 0)
res = false;
return res;
}
/**************************************
** A main function starts from here **
***************************************/
int main() {
ll a[6];
rep(i, 6) cin >> a[i];
bool ans = true;
rep(i, 4) {
for (ll j = i + 1; j <= 4; j++) {
ans = ans and (abs(a[j] - a[i]) <= a[5]);
}
}
cout << (ans ? "Yay!" : ":(");
return 0;
}
| [
"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(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(i, 0, n) cout << v[i] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define tihs \
if (fopen("inp.txt", "r")) \
freopen("inp.txt", "r", stdin), freopen("out.txt", "w", stdout);
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define M 200010
int main() {
IOS;
tihs;
ll a[4];
rep(i, 0, 4) cin >> a[i];
ll k;
cin >> k;
bool ok = 1;
rep(i, 0, 4) rep(j, i + 1, 4) if (abs(a[i] - a[j]) > k) ok = 0;
if (ok)
cout << "Yay!";
else
cout << ":(";
return 0;
} | #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(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(i, 0, n) cout << v[i] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define tihs \
if (fopen("inp.txt", "r")) \
freopen("inp.txt", "r", stdin), freopen("out.txt", "w", stdout);
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define M 200010
int main() {
IOS;
tihs;
ll a[5];
rep(i, 0, 5) cin >> a[i];
ll k;
cin >> k;
bool ok = 1;
rep(i, 0, 5) rep(j, i + 1, 5) if (abs(a[i] - a[j]) > k) ok = 0;
if (ok)
cout << "Yay!";
else
cout << ":(";
return 0;
} | [
"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 = false;
}
if (flag == true)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #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 = false;
}
if (flag == true)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"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 << ":(" << endl;
} else {
if (a - b <= k)
cout << "Yey!" << endl;
else
cout << ":(" << endl;
}
}
| #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 << ":(" << endl;
} else {
if (a - e <= k)
cout << "Yey!" << endl;
else
cout << ":(" << endl;
}
}
| [
"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++) {
// cout << abs(v.at(i) - v.at(j)) << endl;
if (abs(v.at(i) - v.at(j)) >= k) {
flag = false;
break;
}
}
}
if (flag) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| #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++) {
// cout << abs(v.at(i) - v.at(j)) << endl;
if (abs(v.at(i) - v.at(j)) > k) {
flag = false;
break;
}
}
}
if (flag) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"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 (check)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #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 (check)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"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>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
#define fir first
#define sec second
#define fro front
#define m_p make_pair
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define vecin(v) \
for (int i = 0; i < (int)v.size(); i++) \
cin >> v[i];
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res *a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)
swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) { return xx * yy / gcd(xx, yy); }
bool prime(int xx) {
int a = xx;
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
int com(int xx, int yy) {
int zz = 1;
for (int i = xx; i > xx - yy; i--) {
zz *= i;
zz %= mod;
}
for (int i = 1; i <= yy; i++) {
zz *= modinv(i, mod);
zz %= mod;
}
return zz;
}
signed main() {
int k;
vector<int> vec(5);
vecin(vec);
cin >> k;
sort(all(vec));
if (max(vec[0] - vec[4], vec[4] - vec[0]) > k) {
cout << ":(" << endl;
} else {
cout << "Yey!" << endl;
}
}
| #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>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
#define fir first
#define sec second
#define fro front
#define m_p make_pair
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define vecin(v) \
for (int i = 0; i < (int)v.size(); i++) \
cin >> v[i];
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res *a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)
swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) { return xx * yy / gcd(xx, yy); }
bool prime(int xx) {
int a = xx;
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
int com(int xx, int yy) {
int zz = 1;
for (int i = xx; i > xx - yy; i--) {
zz *= i;
zz %= mod;
}
for (int i = 1; i <= yy; i++) {
zz *= modinv(i, mod);
zz %= mod;
}
return zz;
}
signed main() {
int k;
vector<int> vec(5);
vecin(vec);
cin >> k;
sort(all(vec));
if (max(vec[0] - vec[4], vec[4] - vec[0]) > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
| [
"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 factoring(ll n, map<ll, ll> &mp) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n]++;
}
//絶対値
template <class T, class U = std::make_unsigned_t<T>> U SafeAbs(T x) {
return x < 0 ? -static_cast<uintmax_t>(x) : x;
}
//最大・最小
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// xのn乗
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
// xの逆元
ll mod_inv(ll x, ll mod) { // O(log(mod))
return mod_pow(x, mod - 2, mod);
}
// nCr
ll ncr(ll n, ll r, ll mod) {
ll res = 1;
ll num = 1, den = 1;
for (ll i = n; i >= n - r + 1; i--) {
(den *= i) %= mod;
}
for (ll i = 1; i <= r; i++) {
(num *= i) %= mod;
}
res = den * mod_inv(num, mod);
return res % mod;
}
//二分探索
bool isOk(ll index, ll key, vector<ll> &a, bool g) {
if (g) {
if (a[index] < key) {
return true;
}
} else {
if (a[index] > key) {
return true;
}
}
return false;
}
ll bin_search(ll key, vector<ll> &a, bool g) {
ll l = -1;
ll r = a.size();
if (g) {
l = a.size();
r = -1;
}
while (abs(r - l) > 1) {
ll mid = (l + r) / 2;
if (isOk(mid, key, a, g)) {
r = mid;
} else {
l = mid;
}
}
return r;
}
int main() {
ll 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 << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| #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 factoring(ll n, map<ll, ll> &mp) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n]++;
}
//絶対値
template <class T, class U = std::make_unsigned_t<T>> U SafeAbs(T x) {
return x < 0 ? -static_cast<uintmax_t>(x) : x;
}
//最大・最小
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// xのn乗
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
// xの逆元
ll mod_inv(ll x, ll mod) { // O(log(mod))
return mod_pow(x, mod - 2, mod);
}
// nCr
ll ncr(ll n, ll r, ll mod) {
ll res = 1;
ll num = 1, den = 1;
for (ll i = n; i >= n - r + 1; i--) {
(den *= i) %= mod;
}
for (ll i = 1; i <= r; i++) {
(num *= i) %= mod;
}
res = den * mod_inv(num, mod);
return res % mod;
}
//二分探索
bool isOk(ll index, ll key, vector<ll> &a, bool g) {
if (g) {
if (a[index] < key) {
return true;
}
} else {
if (a[index] > key) {
return true;
}
}
return false;
}
ll bin_search(ll key, vector<ll> &a, bool g) {
ll l = -1;
ll r = a.size();
if (g) {
l = a.size();
r = -1;
}
while (abs(r - l) > 1) {
ll mid = (l + r) / 2;
if (isOk(mid, key, a, g)) {
r = mid;
} else {
l = mid;
}
}
return r;
}
int main() {
ll 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 << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| [
"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 (count > 0)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
}
| #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 (count > 0)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
}
| [
"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 << "Yes" << endl
#define yes cout << "yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define no cout << "no" << endl
const int INF = 1001001001;
const int mod = 1000000007;
#define PI 3.14159265359;
void P(int x) { cout << x << endl; }
void P(long x) { cout << x << endl; }
void P(double x) { cout << x << endl; }
void P(ll x) { cout << x << endl; }
void P(string x) { cout << x << endl; }
void P(char x) { cout << x << endl; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int a[5], k;
rep(i, 5) { cin >> a[i]; }
cin >> k;
int ans = 0;
rep(i, 4) {
for (int j = i; j < 4; j++) {
if (a[j] - a[i] > k)
ans++;
}
}
if (ans > 0)
P(":(");
else
P("Yay!");
return 0;
} | #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 << "Yes" << endl
#define yes cout << "yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define no cout << "no" << endl
const int INF = 1001001001;
const int mod = 1000000007;
#define PI 3.14159265359;
void P(int x) { cout << x << endl; }
void P(long x) { cout << x << endl; }
void P(double x) { cout << x << endl; }
void P(ll x) { cout << x << endl; }
void P(string x) { cout << x << endl; }
void P(char x) { cout << x << endl; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int a[5], k;
rep(i, 5) { cin >> a[i]; }
cin >> k;
int ans = 0;
rep(i, 4) {
for (int j = i; j < 5; j++) {
if (a[j] - a[i] > k)
ans++;
}
}
if (ans > 0)
P(":(");
else
P("Yay!");
return 0;
} | [
"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(":)");
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | #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(":(");
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | [
"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] - arr[4] > k ? ":(" : "Yay!") << endl;
} | #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] - arr[0] > k ? ":(" : "Yay!") << endl;
} | [
"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] - antenna[j] > k)
judge = false;
}
if (judge)
cout << "Yey!" << endl;
else
cout << ":(" << endl;
return 0;
}
| #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] - antenna[j] > k)
judge = false;
}
if (judge)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| [
"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) {
cout << "Yap!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> x.at(i);
}
cin >> k;
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) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"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) for (int i = (b); i >= ((int)(a)); i--)
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll << (x))
#define ceiling(a, b) (((a) + (b)-1) / (b))
#define print0(a) cout << (a) << ' '
#define print1(a) cout << (a) << '\n'
#define print2(a, b) cout << (a) << ' ', print1(b)
#define print3(a, b, c) cout << (a) << ' ', print2(b, c)
#define print4(a, b, c, d) cout << (a) << ' ', print3(b, c, d)
#ifdef i_am_noob
#define debug(a) print2(#a, a)
#else
#define debug(a)
#endif
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
const int Mod = 1000000007, Mod2 = 998244353;
const int MOD = Mod2;
inline int add(int a, int b) { return (a + b >= MOD ? a + b - MOD : a + b); }
inline int sub(int a, int b) {
return (a + MOD - b >= MOD ? a - b : a + MOD - b);
}
int Pow(int a, int b) {
if (!b)
return 1;
int tmp = Pow(a * a % MOD, b >> 1);
return (b & 1 ? tmp * a % MOD : tmp);
}
inline int inverse(int n) { return Pow(n, MOD - 2); }
const int maxn = 105;
// i_am_noob
int a, b, c;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> a >> b >> b >> b >> b >> c;
print1(c > b - a ? ":(" : "Yay!");
return 0;
}
| #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) for (int i = (b); i >= ((int)(a)); i--)
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll << (x))
#define ceiling(a, b) (((a) + (b)-1) / (b))
#define print0(a) cout << (a) << ' '
#define print1(a) cout << (a) << '\n'
#define print2(a, b) cout << (a) << ' ', print1(b)
#define print3(a, b, c) cout << (a) << ' ', print2(b, c)
#define print4(a, b, c, d) cout << (a) << ' ', print3(b, c, d)
#ifdef i_am_noob
#define debug(a) print2(#a, a)
#else
#define debug(a)
#endif
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
const int Mod = 1000000007, Mod2 = 998244353;
const int MOD = Mod2;
inline int add(int a, int b) { return (a + b >= MOD ? a + b - MOD : a + b); }
inline int sub(int a, int b) {
return (a + MOD - b >= MOD ? a - b : a + MOD - b);
}
int Pow(int a, int b) {
if (!b)
return 1;
int tmp = Pow(a * a % MOD, b >> 1);
return (b & 1 ? tmp * a % MOD : tmp);
}
inline int inverse(int n) { return Pow(n, MOD - 2); }
const int maxn = 105;
// i_am_noob
int a, b, c;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> a >> b >> b >> b >> b >> c;
print1(c < b - a ? ":(" : "Yay!");
return 0;
}
| [
"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 lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
vi a(5);
rep(i, 5) { cin >> a[i]; }
int k;
cin >> k;
bool b = true;
vsort(a);
if (a[4] - a[0] < k)
cout << "Yay!";
else {
cout << ":(";
}
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
} | // 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 lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
vi a(5);
rep(i, 5) { cin >> a[i]; }
int k;
cin >> k;
bool b = true;
vsort(a);
if (a[4] - a[0] <= k)
cout << "Yay!";
else {
cout << ":(";
}
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
} | [
"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]) >= k;
}
}
string ret;
if (can_contact)
ret = "Yay!";
else
ret = ":(";
cout << ret << endl;
return 0;
} | #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]) <= k;
}
}
string ret;
if (can_contact)
ret = "Yay!";
else
ret = ":(";
cout << ret << endl;
return 0;
} | [
"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;
printf(":(");
break;
}
}
if (ans = 1) {
break;
}
}
if (ans = 0) {
printf("Yay!");
}
return 0;
}
| #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;
printf(":(");
break;
}
}
if (ans == 1) {
break;
}
}
if (ans == 0) {
printf("Yay!");
}
return 0;
}
| [
"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 <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
vi x(5);
int k;
rep(i, 5) { cin >> x[i]; }
cin >> k;
rep(i, 5) {
for (int j = i; j < 5; j++) {
if (x[i] - x[j] > k) {
cout << ":(";
return 0;
}
}
}
cout << "yay!";
return 0;
}
| #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 <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
vi x(5);
int k;
rep(i, 5) { cin >> x[i]; }
cin >> k;
rep(i, 5) {
for (int j = i; j < 5; j++) {
if (x[j] - x[i] > k) {
cout << ":(";
return 0;
}
}
}
cout << "Yay!";
return 0;
}
| [
"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 <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
vi x(5);
int k;
rep(i, 5) { cin >> x[i]; }
cin >> k;
rep(i, 5) {
for (int j = i; j < 5; j++) {
if (x[j] - x[i] > k) {
cout << ":(";
return 0;
}
}
}
cout << "yay!";
return 0;
}
| #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 <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
vi x(5);
int k;
rep(i, 5) { cin >> x[i]; }
cin >> k;
rep(i, 5) {
for (int j = i; j < 5; j++) {
if (x[j] - x[i] > k) {
cout << ":(";
return 0;
}
}
}
cout << "Yay!";
return 0;
}
| [
"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 cout << "No" << endl;
#define COUTDOUBLE(d, i) cout << setprecision((i)) << (d) << endl;
#define VIN(n, v) \
for (int64_t i = 0; i < (n); i++) { \
cin >> (v).at(i); \
}
using namespace std;
typedef int64_t I;
typedef pair<I, I> P;
typedef vector<I> V;
I MOD = pow(10, 9) + 7;
// 最大公約数
I gcd(I a, I b) { return b != 0 ? gcd(b, a % b) : a; }
// 最小公倍数
I lcm(I a, I b) { return a * b / gcd(a, b); }
int ctoi(char c) { return c - '0'; }
int main() {
I a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a >= k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#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 cout << "No" << endl;
#define COUTDOUBLE(d, i) cout << setprecision((i)) << (d) << endl;
#define VIN(n, v) \
for (int64_t i = 0; i < (n); i++) { \
cin >> (v).at(i); \
}
using namespace std;
typedef int64_t I;
typedef pair<I, I> P;
typedef vector<I> V;
I MOD = pow(10, 9) + 7;
// 最大公約数
I gcd(I a, I b) { return b != 0 ? gcd(b, a % b) : a; }
// 最小公倍数
I lcm(I a, I b) { return a * b / gcd(a, b); }
int ctoi(char c) { return c - '0'; }
int main() {
I a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 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 << ":(" << 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 (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 << ":(" << endl;
}
} | [
"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;
}
}
}
cout << "Yay!" << endl;
return 0;
} | #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;
}
}
}
cout << "Yay!" << 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;
}
}
if (!flag)
break;
}
if (flag) {
cout << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
} | #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;
}
}
if (!flag)
break;
}
if (flag) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"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.tie(nullptr);
ios::sync_with_stdio(false);
vector<Int> a(5);
for (Int i = 0; i < 5; i++) {
cin >> a[i];
}
Int k;
cin >> k;
Int flag = 0;
for (Int i = 0; i < 4; i++) {
for (Int j = i + 1; i < 5; i++) {
if (abs(a[i] - a[j]) > k)
flag = 1;
}
}
if (flag)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | #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.tie(nullptr);
ios::sync_with_stdio(false);
vector<Int> a(5);
for (Int i = 0; i < 5; i++) {
cin >> a[i];
}
Int k;
cin >> k;
Int flag = 0;
for (Int i = 0; i < 4; i++) {
for (Int j = i + 1; j < 5; j++) {
if (abs(a[i] - a[j]) > k)
flag = 1;
}
}
if (flag)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
} | [
"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::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
COUT("Yay!");
} else {
COUT(":(");
}
return 0;
}
| #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::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
COUT("Yay!");
} else {
COUT(":(");
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 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) {
cout << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
}
| #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) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"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 namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
vector<int> v(5);
REP(i, 5) { cin >> v[i]; }
int k;
cin >> k;
bool flg = true;
REP(i, 5) {
FOR(j, i + 1, 4) {
if (abs(v[i] - v[j]) > k)
flg = false;
}
}
if (flg)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #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 namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
vector<int> v(5);
REP(i, 5) { cin >> v[i]; }
int k;
cin >> k;
bool flg = true;
REP(i, 5) {
FOR(j, i + 1, 5) {
if (abs(v[i] - v[j]) > k)
flg = false;
}
}
if (flg)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"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 namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
vector<int> v(5);
REP(i, 5) { cin >> v[i]; }
int k;
cin >> k;
bool flg = true;
REP(i, 5) {
FOR(j, i + 1, 4) {
if (abs(v[i] - v[j]) > k)
flg = false;
}
}
if (flg)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | #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 namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
vector<int> v(5);
REP(i, 5) { cin >> v[i]; }
int k;
cin >> k;
bool flg = true;
REP(i, 4) {
FOR(j, i + 1, 5) {
if (abs(v[i] - v[j]) > k)
flg = false;
}
}
if (flg)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
} | [
"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 = 0; bit < (1 << N); bit++)
using namespace std;
void printAns(int a) { cout << a << endl; }
void yesno(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YESNO(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
typedef long long ll;
typedef unsigned long ul;
typedef long double ld;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll INF = 10000000;
ll mod = 1000000007; // 10^9+7
//番号ズレ注意！！
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
bool ans = true;
REP(i, 4) {
REP2(j, i + 1, 4) {
if (a[j] - a[i] > k)
ans = false;
}
}
if (ans) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #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 = 0; bit < (1 << N); bit++)
using namespace std;
void printAns(int a) { cout << a << endl; }
void yesno(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YESNO(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
typedef long long ll;
typedef unsigned long ul;
typedef long double ld;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll INF = 10000000;
ll mod = 1000000007; // 10^9+7
//番号ズレ注意！！
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
bool ans = true;
REP(i, 4) {
REP2(j, i + 1, 5) {
if (a[j] - a[i] > k)
ans = false;
}
}
if (ans) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"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 << "Yay!" << endl;
return 0;
} | #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 << "Yay!" << endl;
return 0;
} | [
"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), max(c, d)), e),
mn = min(min(min(a, b), min(c, d)), e);
if (mx - mn <= k)
cout << ":(";
else
cout << "Yay!";
return 0;
}
| #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), max(c, d)), e),
mn = min(min(min(a, b), min(c, d)), e);
if (mx - mn > k)
cout << ":(";
else
cout << "Yay!";
return 0;
}
| [
"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.