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 |
|---|---|---|---|---|---|---|---|
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 4; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 4; ++i) {
min_trans = min(min_trans, trans[i]);
}
time = 4 + N / min_trans;
if (N % min_trans != 0)
time++;
cout << time << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 5; ++i) {
min_trans = min(min_trans, trans[i]);
}
time = 4 + N / min_trans;
if (N % min_trans != 0)
time++;
cout << time << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,563 | 894,566 | u969265031 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 4; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 5; ++i) {
min_trans = min(min_trans, trans[i]);
}
time = 4 + N / min_trans;
if (N % min_trans != 0)
time++;
cout << time << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 5; ++i) {
min_trans = min(min_trans, trans[i]);
}
time = 4 + N / min_trans;
if (N % min_trans != 0)
time++;
cout << time << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,565 | 894,566 | u969265031 | cpp |
p03077 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
long long a[6], A, i, s = 0, j;
for (i = 0; i < 6; i++) {
scanf("%lld", &a[i]);
}
sort(a + 1, a + 6);
if (a[0] % a[1 + 1] != 0)
A = a[0] / a[1] + 1;
else
A = a[0] / a[1];
s = A + 4;
printf("%lld", s);
}
| #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
long long a[6], A, i, s = 0, j;
for (i = 0; i < 6; i++) {
scanf("%lld", &a[i]);
}
sort(a + 1, a + 6);
if (a[0] % a[1] != 0)
A = a[0] / a[1] + 1;
else
A = a[0] / a[1];
s = A + 4;
printf("%lld", s);
}
| [
"expression.operation.binary.remove"
] | 894,572 | 894,573 | u083496316 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(5);
ll mini = LLONG_MAX;
for (int z = 0; z < 5; z++) {
cin >> arr[z];
mini = min(mini, arr[z]);
}
ll answer = n / mini;
if (n & 1)
answer++;
cout << answer + 4 << endl;
cin >> n;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(5);
ll mini = LLONG_MAX;
for (int z = 0; z < 5; z++) {
cin >> arr[z];
mini = min(mini, arr[z]);
}
ll answer = n / mini;
if (n % mini != 0)
answer++;
cout << answer + 4 << endl;
cin >> n;
} | [
"control_flow.branch.if.condition.change"
] | 894,582 | 894,583 | u553927381 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(5);
ll mini = LLONG_MAX;
for (int z = 0; z < 5; z++) {
cin >> arr[z];
mini = min(mini, arr[z]);
}
ll answer = n / mini;
if (answer & 1)
answer++;
cout << answer + 4 << endl;
cin >> n;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(5);
ll mini = LLONG_MAX;
for (int z = 0; z < 5; z++) {
cin >> arr[z];
mini = min(mini, arr[z]);
}
ll answer = n / mini;
if (n % mini != 0)
answer++;
cout << answer + 4 << endl;
cin >> n;
} | [
"control_flow.branch.if.condition.change"
] | 894,584 | 894,583 | u553927381 | cpp |
p03077 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// 入力
long long n;
vector<long long> C(5, 0);
cin >> n;
for (int i = 0; i < 5; ++i) {
cin >> C[i];
}
long long min_c = C[0];
for (int i = 1; i < 5; ++i) {
min_c = min(min_c, C[i]);
}
//
int ans = n / min_c;
if (n % min_c > 0)
ans++;
cout << ans + 4 << endl;
return 0;
} |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// 入力
long long n;
vector<long long> C(5, 0);
cin >> n;
for (int i = 0; i < 5; ++i) {
cin >> C[i];
}
long long min_c = C[0];
for (int i = 1; i < 5; ++i) {
min_c = min(min_c, C[i]);
}
//
long long ans = n / min_c;
if (n % min_c > 0)
ans++;
cout << ans + 4 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,587 | 894,588 | u556799364 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
ll N;
vector<ll> V(5);
cin >> N;
rep(i, 0, 5) cin >> V[i];
ll mini = INF;
rep(i, 0, 5) mini = min(mini, V[i]);
ll ans = 4 + (N + mini) / mini;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
ll INF = (1LL << 60) - 1;
int MOD = 1e9 + 7;
main() {
ll N;
vector<ll> V(5);
cin >> N;
rep(i, 0, 5) cin >> V[i];
ll mini = INF;
rep(i, 0, 5) mini = min(mini, V[i]);
ll ans = 4 + (N + mini - 1) / mini;
cout << ans << endl;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 894,608 | 894,609 | u157322125 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, x, y, z, h, w, n, e;
void input() { cin >> n >> a >> b >> c >> d >> e; }
void solve() {
ll sum = 0;
int m = min({a, b, c, d, e});
sum += n % m == 0 ? m : n / m + 1;
sum += 4;
cout << sum << endl;
}
int main() {
input();
solve();
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, x, y, z, h, w, n, e;
void input() { cin >> n >> a >> b >> c >> d >> e; }
void solve() {
ll sum = 0;
ll m = min({a, b, c, d, e});
sum += n % m == 0 ? n / m : n / m + 1;
sum += 4;
cout << sum << endl;
}
int main() {
input();
solve();
} | [
"variable_declaration.type.change"
] | 894,613 | 894,612 | u789199225 | cpp |
p03077 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
long long n;
long long tosi[5];
cin >> n;
cin >> tosi[0];
cin >> tosi[1];
cin >> tosi[2];
cin >> tosi[3];
cin >> tosi[4];
long int min = tosi[0];
for (int i = 0; i < 5; i++) {
if (tosi[i] < min) {
min = tosi[i];
}
}
cout << n / min + 5 << endl;
} | #include <iostream>
#include <string.h>
using namespace std;
int main() {
long long n;
long long tosi[5];
cin >> n;
cin >> tosi[0];
cin >> tosi[1];
cin >> tosi[2];
cin >> tosi[3];
cin >> tosi[4];
long int min = tosi[0];
for (int i = 0; i < 5; i++) {
if (tosi[i] < min) {
min = tosi[i];
}
}
cout << (n - 1) / min + 5 << endl;
} | [] | 894,616 | 894,617 | u375879613 | cpp |
p03077 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long N, A, B, C, D, E, m, t = 0;
cin >> N >> A >> B >> C >> D >> E;
m = min({A, B, C, D, E});
cout << 4 + N / m + (N / m != 0) << endl;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long N, A, B, C, D, E, m, t = 0;
cin >> N >> A >> B >> C >> D >> E;
m = min({A, B, C, D, E});
cout << 4 + N / m + (N % m != 0) << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 894,618 | 894,619 | u313403396 | cpp |
p03077 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int t;
unsigned long long x[6];
for (t = 0; t < 6; t++)
cin >> x[t];
unsigned long long mini = x[1];
unsigned long long minit = 1;
for (t = 1; t < 6; t++) {
if (mini > x[t]) {
mini = x[t];
minit = t;
}
}
unsigned long long total = 4 + (x[0] / x[minit]);
unsigned long long amari;
amari = x[0] / x[minit];
if (amari % 10 != 0)
total += 1;
std::cout << total << std::endl;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int t;
unsigned long long x[6];
for (t = 0; t < 6; t++)
cin >> x[t];
unsigned long long mini = x[1];
unsigned long long minit = 1;
for (t = 1; t < 6; t++) {
if (mini > x[t]) {
mini = x[t];
minit = t;
}
}
unsigned long long total = 4 + (x[0] / x[minit]);
unsigned long long amari;
amari = x[0] % x[minit];
if (amari != 0)
total += 1;
std::cout << total << std::endl;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 894,635 | 894,636 | u344462910 | cpp |
p03077 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int t;
unsigned long long x[6];
for (t = 0; t < 6; t++)
cin >> x[t];
unsigned long long mini = x[1];
unsigned long long minit = 1;
for (t = 1; t < 6; t++) {
if (mini > x[t]) {
mini = x[t];
minit = t;
}
}
unsigned long long total = 4 + (x[0] / x[minit]);
int amari;
amari = x[0] / x[minit];
if (amari % 10 != 0)
total += 1;
std::cout << total << std::endl;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int t;
unsigned long long x[6];
for (t = 0; t < 6; t++)
cin >> x[t];
unsigned long long mini = x[1];
unsigned long long minit = 1;
for (t = 1; t < 6; t++) {
if (mini > x[t]) {
mini = x[t];
minit = t;
}
}
unsigned long long total = 4 + (x[0] / x[minit]);
unsigned long long amari;
amari = x[0] % x[minit];
if (amari != 0)
total += 1;
std::cout << total << std::endl;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 894,637 | 894,636 | u344462910 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> city(5, 0);
int n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> city[i];
sort(city.begin(), city.end());
long long rtn = 0;
if (n % city[0] == 0) {
rtn += n / city[0];
} else {
rtn += n / city[0] + 1;
}
rtn += 4;
cout << rtn << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> city(5, 0);
long long n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> city[i];
sort(city.begin(), city.end());
long long rtn = 0;
if (n % city[0] == 0) {
rtn += n / city[0];
} else {
rtn += n / city[0] + 1;
}
rtn += 4;
cout << rtn << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,638 | 894,639 | u239023686 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, m[5], ans = 0;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> m[i];
}
for (int i = 4; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (m[j] > m[j + 1]) {
long long tmp = m[j];
m[j] = m[j + 1];
m[j + 1] = tmp;
}
}
}
ans = n / m[0] + 5;
if (n % m[0] == 0) {
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, m[5], ans = 0;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> m[i];
}
for (int i = 4; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (m[j] > m[j + 1]) {
long long tmp = m[j];
m[j] = m[j + 1];
m[j + 1] = tmp;
}
}
}
ans = n / m[0] + 5;
if (n % m[0] == 0) {
ans--;
}
cout << ans << endl;
return 0;
}
| [] | 894,648 | 894,649 | u801916231 | cpp |
p03077 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define INF ULLONG_MAX
ull N;
int main() {
cin >> N;
ull temp;
ull min_tra = INF;
for (int i = 0; i < 5; ++i) {
cin >> temp;
min_tra = min(temp, min_tra);
}
if (N % min_tra == 0) {
cout << (N / min_tra) + 5 << endl;
} else {
cout << ((N / min_tra) + 5) << endl;
}
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define INF ULLONG_MAX
ull N;
int main() {
cin >> N;
ull temp;
ull min_tra = INF;
for (int i = 0; i < 5; ++i) {
cin >> temp;
min_tra = min(temp, min_tra);
}
if (N % min_tra == 0) {
cout << (N / min_tra) + 4 << endl;
} else {
cout << ((N / min_tra) + 5) << endl;
}
} | [
"literal.number.change",
"io.output.change"
] | 894,659 | 894,660 | u045354461 | cpp |
p03077 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, ans = 0, min = pow(10, 15);
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a;
if (min > a)
min = a;
}
ans = (long long)n / (long long)min + 5;
printf("%lld\n", ans);
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, ans = 0, min = pow(10, 15);
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a;
if (min > a)
min = a;
}
ans = (long long)(n - 1) / (long long)min + 5;
printf("%lld\n", ans);
} | [] | 894,667 | 894,668 | u839397805 | cpp |
p03078 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N = 5000005;
const int M = 1000000007;
const lb PI = acos(-1);
ll x, y, z, k;
ll a[N], b[N], c[N], d[N], s[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
ll i, j;
cin >> x >> y >> z >> k;
for (i = 1; i <= x; i++)
cin >> a[i];
for (i = 1; i <= y; i++)
cin >> b[i];
for (i = 1; i <= z; i++)
cin >> c[i];
ll m = 0, cnt = 0;
for (i = 1; i <= x; i++)
for (j = 1; j <= y; j++)
d[++m] = a[i] + b[j];
sort(d + 1, d + m + 1, greater<int>());
sort(c + 1, c + z + 1, greater<int>());
m = min(m, k);
for (i = 1; i <= m; i++)
for (j = 1; j <= z; j++)
s[++cnt] = d[i] + c[j];
sort(s + 1, s + cnt + 1, greater<int>());
for (i = 1; i <= k; i++)
cout << s[i] << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N = 5000005;
const int M = 1000000007;
const lb PI = acos(-1);
ll x, y, z, k;
ll a[N], b[N], c[N], d[N], s[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
ll i, j;
cin >> x >> y >> z >> k;
for (i = 1; i <= x; i++)
cin >> a[i];
for (i = 1; i <= y; i++)
cin >> b[i];
for (i = 1; i <= z; i++)
cin >> c[i];
ll m = 0, cnt = 0;
for (i = 1; i <= x; i++)
for (j = 1; j <= y; j++)
d[++m] = a[i] + b[j];
sort(d + 1, d + m + 1, greater<ll>());
sort(c + 1, c + z + 1, greater<ll>());
m = min(m, k);
for (i = 1; i <= m; i++)
for (j = 1; j <= z; j++)
s[++cnt] = d[i] + c[j];
sort(s + 1, s + cnt + 1, greater<ll>());
for (i = 1; i <= k; i++)
cout << s[i] << '\n';
return 0;
}
| [
"call.arguments.change"
] | 894,675 | 894,676 | u916060970 | cpp |
p03078 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N = 1000005;
const int M = 1000000007;
const lb PI = acos(-1);
ll x, y, z, k;
ll a[N], b[N], c[N], d[N], s[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
ll i, j;
cin >> x >> y >> z >> k;
for (i = 1; i <= x; i++)
cin >> a[i];
for (i = 1; i <= y; i++)
cin >> b[i];
for (i = 1; i <= z; i++)
cin >> c[i];
ll m = 0, cnt = 0;
for (i = 1; i <= x; i++)
for (j = 1; j <= y; j++)
d[++m] = a[i] + b[j];
sort(d + 1, d + m + 1, greater<int>());
sort(c + 1, c + z + 1, greater<int>());
m = min(m, k);
for (i = 1; i <= m; i++)
for (j = 1; j <= z; j++)
s[++cnt] = d[i] + c[j];
sort(s + 1, s + cnt + 1, greater<int>());
for (i = 1; i <= k; i++)
cout << s[i] << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N = 5000005;
const int M = 1000000007;
const lb PI = acos(-1);
ll x, y, z, k;
ll a[N], b[N], c[N], d[N], s[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
ll i, j;
cin >> x >> y >> z >> k;
for (i = 1; i <= x; i++)
cin >> a[i];
for (i = 1; i <= y; i++)
cin >> b[i];
for (i = 1; i <= z; i++)
cin >> c[i];
ll m = 0, cnt = 0;
for (i = 1; i <= x; i++)
for (j = 1; j <= y; j++)
d[++m] = a[i] + b[j];
sort(d + 1, d + m + 1, greater<ll>());
sort(c + 1, c + z + 1, greater<ll>());
m = min(m, k);
for (i = 1; i <= m; i++)
for (j = 1; j <= z; j++)
s[++cnt] = d[i] + c[j];
sort(s + 1, s + cnt + 1, greater<ll>());
for (i = 1; i <= k; i++)
cout << s[i] << '\n';
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 894,677 | 894,676 | u916060970 | cpp |
p03078 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N = 100005;
const int M = 1000000007;
const lb PI = acos(-1);
ll x, y, z, k;
ll a[N], b[N], c[N], d[N], s[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
ll i, j;
cin >> x >> y >> z >> k;
for (i = 1; i <= x; i++)
cin >> a[i];
for (i = 1; i <= y; i++)
cin >> b[i];
for (i = 1; i <= z; i++)
cin >> c[i];
ll m = 0, cnt = 0;
for (i = 1; i <= x; i++)
for (j = 1; j <= y; j++)
d[++m] = a[i] + b[j];
sort(d + 1, d + m + 1, greater<int>());
sort(c + 1, c + z + 1, greater<int>());
m = min(m, k);
for (i = 1; i <= m; i++)
for (j = 1; j <= z; j++)
s[++cnt] = d[i] + c[j];
sort(s + 1, s + cnt + 1, greater<int>());
for (i = 1; i <= k; i++)
cout << s[i] << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N = 5000005;
const int M = 1000000007;
const lb PI = acos(-1);
ll x, y, z, k;
ll a[N], b[N], c[N], d[N], s[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
ll i, j;
cin >> x >> y >> z >> k;
for (i = 1; i <= x; i++)
cin >> a[i];
for (i = 1; i <= y; i++)
cin >> b[i];
for (i = 1; i <= z; i++)
cin >> c[i];
ll m = 0, cnt = 0;
for (i = 1; i <= x; i++)
for (j = 1; j <= y; j++)
d[++m] = a[i] + b[j];
sort(d + 1, d + m + 1, greater<ll>());
sort(c + 1, c + z + 1, greater<ll>());
m = min(m, k);
for (i = 1; i <= m; i++)
for (j = 1; j <= z; j++)
s[++cnt] = d[i] + c[j];
sort(s + 1, s + cnt + 1, greater<ll>());
for (i = 1; i <= k; i++)
cout << s[i] << '\n';
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 894,678 | 894,676 | u916060970 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000;
int A[N], B[N], C[N];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int x, y, z, want;
cin >> x >> y >> z >> want;
for (int i = 0; i < x; i++)
cin >> A[i];
for (int i = 0; i < y; i++)
cin >> B[i];
for (int i = 0; i < z; i++)
cin >> C[i];
sort(C, C + z);
priority_queue<pair<int, pair<int, pair<int, int>>>> pq;
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++)
pq.push({A[i] + B[j] + C[z - 1], {i, {j, z - 1}}});
while (want) {
cout << pq.top().first << '\n';
int i = pq.top().second.first;
int j = pq.top().second.second.first;
int k = pq.top().second.second.second;
pq.pop();
if (k)
pq.push({A[i] + B[j] + C[k - 1], {i, {j, k - 1}}});
want--;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000;
ll A[N], B[N], C[N];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int x, y, z, want;
cin >> x >> y >> z >> want;
for (int i = 0; i < x; i++)
cin >> A[i];
for (int i = 0; i < y; i++)
cin >> B[i];
for (int i = 0; i < z; i++)
cin >> C[i];
sort(C, C + z);
priority_queue<pair<ll, pair<int, pair<int, int>>>> pq;
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++)
pq.push({A[i] + B[j] + C[z - 1], {i, {j, z - 1}}});
while (want) {
cout << pq.top().first << '\n';
int i = pq.top().second.first;
int j = pq.top().second.second.first;
int k = pq.top().second.second.second;
pq.pop();
if (k)
pq.push({A[i] + B[j] + C[k - 1], {i, {j, k - 1}}});
want--;
}
return 0;
}
| [
"variable_declaration.type.change"
] | 894,704 | 894,705 | u941439948 | cpp |
p03078 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long long int
#define rep(i, n) for (i = 0; i < n; i++)
#define fin(ans) cout << (ans) << endl
#define INF INT_MAX
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long LLINF = 1LL << 60;
// set<int>::iterator it;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
ll max, maxnum, pm, x, y, z, k, i, j, m;
cin >> x >> y >> z >> k;
vector<int> a, b, c;
rep(i, x) {
cin >> pm;
a.push_back(pm);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
rep(i, y) {
cin >> pm;
b.push_back(pm);
}
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
rep(i, z) {
cin >> pm;
c.push_back(pm);
}
sort(c.begin(), c.end());
reverse(c.begin(), c.end());
vector<int> v;
for (i = 0; i < x; i++) {
for (j = 0; j < y; j++) {
for (m = 0; m < z; m++) {
if ((i + 1) * (j + 1) * (m + 1) > k)
break;
else
v.push_back(a[i] + b[j] + c[m]);
}
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (i = 0; i < k; i++) {
cout << v[i] << endl;
}
//////////////////////////////////////////////////////
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long long int
#define rep(i, n) for (i = 0; i < n; i++)
#define fin(ans) cout << (ans) << endl
#define INF INT_MAX
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long LLINF = 1LL << 60;
// set<int>::iterator it;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
ll max, maxnum, pm, x, y, z, k, i, j, m;
cin >> x >> y >> z >> k;
vector<ll> a, b, c;
rep(i, x) {
cin >> pm;
a.push_back(pm);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
rep(i, y) {
cin >> pm;
b.push_back(pm);
}
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
rep(i, z) {
cin >> pm;
c.push_back(pm);
}
sort(c.begin(), c.end());
reverse(c.begin(), c.end());
vector<ll> v;
for (i = 0; i < x; i++) {
for (j = 0; j < y; j++) {
for (m = 0; m < z; m++) {
if ((i + 1) * (j + 1) * (m + 1) > k)
break;
else
v.push_back(a[i] + b[j] + c[m]);
}
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (i = 0; i < k; i++) {
cout << v[i] << endl;
}
//////////////////////////////////////////////////////
return 0;
}
| [] | 894,715 | 894,716 | u903311413 | cpp |
p03078 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
for (int i = 0; i < X; ++i)
cin >> A[i];
for (int i = 0; i < Y; ++i)
cin >> B[i];
for (int i = 0; i < Z; ++i)
cin >> C[i];
sort(A, A + X, greater<>());
sort(B, B + Y, greater<>());
sort(C, C + Z, greater<>());
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
x.push_back(A[i] + B[j]);
}
}
sort(x.begin(), x.end(), greater<>());
for (int i = 0; i < K || i < X * Y; ++i) {
for (int j = 0; j < Z; ++j) {
y.push_back(x[i] + C[j]);
}
}
sort(y.begin(), y.end(), greater<>());
for (int i = 0; i < K; ++i)
cout << y[i] << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
for (int i = 0; i < X; ++i)
cin >> A[i];
for (int i = 0; i < Y; ++i)
cin >> B[i];
for (int i = 0; i < Z; ++i)
cin >> C[i];
sort(A, A + X, greater<>());
sort(B, B + Y, greater<>());
sort(C, C + Z, greater<>());
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
x.push_back(A[i] + B[j]);
}
}
sort(x.begin(), x.end(), greater<>());
for (int i = 0; i < K && i < X * Y; ++i) {
for (int j = 0; j < Z; ++j) {
y.push_back(x[i] + C[j]);
}
}
sort(y.begin(), y.end(), greater<>());
for (int i = 0; i < K; ++i)
cout << y[i] << endl;
}
| [
"misc.opposites",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 894,722 | 894,723 | u275488634 | cpp |
p03078 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
for (int i = 0; i < X; ++i)
cin >> A[i];
for (int i = 0; i < Y; ++i)
cin >> B[i];
for (int i = 0; i < Z; ++i)
cin >> C[i];
sort(A, A + X, greater<>());
sort(B, B + Y, greater<>());
sort(C, C + Z, greater<>());
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
x.push_back(A[i] + B[j]);
}
}
sort(x.begin(), x.end(), greater<>());
for (int i = 0; i < K; ++i) {
for (int j = 0; j < Z; ++j) {
y.push_back(x[i] + C[j]);
}
}
sort(y.begin(), y.end(), greater<>());
for (int i = 0; i < K; ++i)
cout << y[i] << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
for (int i = 0; i < X; ++i)
cin >> A[i];
for (int i = 0; i < Y; ++i)
cin >> B[i];
for (int i = 0; i < Z; ++i)
cin >> C[i];
sort(A, A + X, greater<>());
sort(B, B + Y, greater<>());
sort(C, C + Z, greater<>());
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
x.push_back(A[i] + B[j]);
}
}
sort(x.begin(), x.end(), greater<>());
for (int i = 0; i < K && i < X * Y; ++i) {
for (int j = 0; j < Z; ++j) {
y.push_back(x[i] + C[j]);
}
}
sort(y.begin(), y.end(), greater<>());
for (int i = 0; i < K; ++i)
cout << y[i] << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 894,725 | 894,723 | u275488634 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> xlist(x);
for (int i = 0; i < x; i++) {
cin >> xlist[i];
}
vector<ll> ylist(y);
for (int i = 0; i < y; i++) {
cin >> ylist[i];
}
vector<ll> zlist(z);
for (int i = 0; i < z; i++) {
cin >> zlist[i];
}
vector<ll> xylist(x * y);
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
xylist[y * i + j] = xlist[i] + ylist[j];
}
}
sort(xylist.begin(), xylist.end(), greater<ll>());
int cnt = min(k, x * y * z);
vector<ll> xyzlist(cnt * z);
for (int i = 0; i < cnt; i++) {
for (int j = 0; j < z; j++) {
xyzlist[z * i + j] = xylist[i] + zlist[j];
}
}
sort(xyzlist.begin(), xyzlist.end(), greater<ll>());
for (int i = 0; i < k; i++) {
cout << xyzlist[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> xlist(x);
for (int i = 0; i < x; i++) {
cin >> xlist[i];
}
vector<ll> ylist(y);
for (int i = 0; i < y; i++) {
cin >> ylist[i];
}
vector<ll> zlist(z);
for (int i = 0; i < z; i++) {
cin >> zlist[i];
}
vector<ll> xylist(x * y);
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
xylist[y * i + j] = xlist[i] + ylist[j];
}
}
sort(xylist.begin(), xylist.end(), greater<ll>());
int cnt = min(k, x * y);
vector<ll> xyzlist(cnt * z);
for (int i = 0; i < cnt; i++) {
for (int j = 0; j < z; j++) {
xyzlist[z * i + j] = xylist[i] + zlist[j];
}
}
sort(xyzlist.begin(), xyzlist.end(), greater<ll>());
for (int i = 0; i < k; i++) {
cout << xyzlist[i] << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 894,730 | 894,731 | u146594935 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> xlist(x);
for (int i = 0; i < x; i++) {
cin >> xlist[i];
}
vector<ll> ylist(y);
for (int i = 0; i < y; i++) {
cin >> ylist[i];
}
vector<ll> zlist(z);
for (int i = 0; i < z; i++) {
cin >> zlist[i];
}
vector<ll> xylist(x * y);
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
xylist[y * i + j] = xlist[i] + ylist[j];
}
}
sort(xylist.begin(), xylist.end(), greater<ll>());
int cnt = min(k, x * y * z);
vector<ll> xyzlist(cnt * z);
for (int i = 0; i < cnt; i++) {
for (int j = 0; j < z; j++) {
xyzlist[z * i + j] = xylist[i] + zlist[j];
}
}
sort(xyzlist.begin(), xyzlist.end(), greater<ll>());
for (int i = 0; i < cnt; i++) {
cout << xyzlist[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> xlist(x);
for (int i = 0; i < x; i++) {
cin >> xlist[i];
}
vector<ll> ylist(y);
for (int i = 0; i < y; i++) {
cin >> ylist[i];
}
vector<ll> zlist(z);
for (int i = 0; i < z; i++) {
cin >> zlist[i];
}
vector<ll> xylist(x * y);
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
xylist[y * i + j] = xlist[i] + ylist[j];
}
}
sort(xylist.begin(), xylist.end(), greater<ll>());
int cnt = min(k, x * y);
vector<ll> xyzlist(cnt * z);
for (int i = 0; i < cnt; i++) {
for (int j = 0; j < z; j++) {
xyzlist[z * i + j] = xylist[i] + zlist[j];
}
}
sort(xyzlist.begin(), xyzlist.end(), greater<ll>());
for (int i = 0; i < k; i++) {
cout << xyzlist[i] << endl;
}
return 0;
} | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 894,732 | 894,731 | u146594935 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
// const ll MOD=998244353;
int X, Y, Z;
ll K;
ll A[1010], B[1010], C[1010];
bool solve(ll mid) {
ll sum = 0;
rep(i, X) rep(j, Y) {
int k = lower_bound(C, C + Z + 1, mid - (A[i] + B[j])) - C;
sum += Z - k;
}
return (sum >= K);
}
void ans(ll l) {
vector<ll> res;
rep(i, X) rep(j, Y) {
int tmp = upper_bound(C, C + Z + 1, l - (A[i] + B[j])) - C;
for (int k = tmp; k < Z; k++)
res.push_back(A[i] + B[j] + C[k]);
}
int siz = res.size();
for (int i = 0; i + siz < K; i++)
res.push_back(l);
sort(res.rbegin(), res.rend());
for (ll r : res)
cout << r << endl;
}
int main() {
cin >> X >> Y >> Z >> K;
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
sort(C, C + Z);
C[Z] = 1e15;
ll l = 0, r = 3e10;
while (r - l > 1) {
ll mid = (l + r) / 2;
if (solve(mid))
l = mid;
else
r = mid;
}
ans(l);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
// const ll MOD=998244353;
int X, Y, Z;
ll K;
ll A[1010], B[1010], C[1010];
bool solve(ll mid) {
ll sum = 0;
rep(i, X) rep(j, Y) {
int k = lower_bound(C, C + Z + 1, mid - (A[i] + B[j])) - C;
sum += Z - k;
}
return (sum >= K);
}
void ans(ll l) {
vector<ll> res;
rep(i, X) rep(j, Y) {
int tmp = upper_bound(C, C + Z + 1, l - (A[i] + B[j])) - C;
for (int k = tmp; k < Z; k++)
res.push_back(A[i] + B[j] + C[k]);
}
int siz = res.size();
for (int i = 0; i + siz < K; i++)
res.push_back(l);
sort(res.rbegin(), res.rend());
for (ll r : res)
cout << r << endl;
}
int main() {
cin >> X >> Y >> Z >> K;
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
sort(C, C + Z);
C[Z] = 1e15;
ll l = 0, r = 1e11;
while (r - l > 1) {
ll mid = (l + r) / 2;
if (solve(mid))
l = mid;
else
r = mid;
}
ans(l);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 894,740 | 894,741 | u046768272 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
sort(all(A));
sort(all(B));
sort(all(C));
reverse(all(A));
reverse(all(B));
reverse(all(C));
vector<ll> s;
rep(i, X) rep(j, Y) rep(k, Z) {
if ((i + 1) * (j + j) * (k + 1) <= K)
s.push_back(A[i] + B[j] + C[k]);
else
break;
}
sort(all(s));
reverse(all(s));
rep(i, K) cout << s[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
sort(all(A));
sort(all(B));
sort(all(C));
reverse(all(A));
reverse(all(B));
reverse(all(C));
vector<ll> s;
rep(i, X) rep(j, Y) rep(k, Z) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
s.push_back(A[i] + B[j] + C[k]);
else
break;
}
sort(all(s));
reverse(all(s));
rep(i, K) cout << s[i] << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 894,751 | 894,752 | u964763428 | cpp |
p03078 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef pair<int, int> P;
typedef unsigned long long int ll;
const int INF = 1 << 30;
const ll LINF = ll(1e18);
const ll MOD = ll(1e9 + 7);
vector<ll> cake[] = {vector<ll>(), vector<ll>(), vector<ll>()};
int main() {
vector<int> lim(3);
rep(i, 3) cin >> lim[i];
int K;
cin >> K;
rep(i, 3) cake[i].resize(lim[i]);
rep(i, 3) rep(j, lim[i]) cin >> cake[i][j];
rep(i, 3) sort(cake[i].begin(), cake[i].end(), greater<int>());
vector<ll> ans;
rep(i, lim[0]) rep(j, lim[1]) rep(k, lim[2]) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
ans.push_back(cake[0][i] + cake[1][j] + cake[2][k]);
}
sort(ans.begin(), ans.end(), greater<ll>());
rep(i, K) cout << ans[i] << endl;
// system("read -n 1 -s -p \"Press any key to continue...\"");
}
| #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef pair<int, int> P;
typedef unsigned long long int ll;
const int INF = 1 << 30;
const ll LINF = ll(1e18);
const ll MOD = ll(1e9 + 7);
vector<ll> cake[] = {vector<ll>(), vector<ll>(), vector<ll>()};
int main() {
vector<int> lim(3);
rep(i, 3) cin >> lim[i];
int K;
cin >> K;
rep(i, 3) cake[i].resize(lim[i]);
rep(i, 3) rep(j, lim[i]) cin >> cake[i][j];
rep(i, 3) sort(cake[i].begin(), cake[i].end(), greater<ll>());
vector<ll> ans;
rep(i, lim[0]) rep(j, lim[1]) rep(k, lim[2]) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
ans.push_back(cake[0][i] + cake[1][j] + cake[2][k]);
}
sort(ans.begin(), ans.end(), greater<ll>());
rep(i, K) cout << ans[i] << endl;
// system("read -n 1 -s -p \"Press any key to continue...\"");
}
| [
"call.arguments.change"
] | 894,782 | 894,783 | u630664279 | cpp |
p03078 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int d[3], K;
R(d[0], d[1], d[2], K);
VL AA[3];
REP(i, 3) {
REP(j, d[i]) {
LL v;
R(v);
AA[i].PB(v);
}
sort(ALL(AA[i]), greater<int>());
}
priority_queue<pair<LL, int>> h;
REP(i, d[0]) REP(j, d[1]) { h.push(MP(AA[0][i] + AA[1][j] + AA[2][0], 0)); }
while (K) {
K--;
auto now = h.top();
h.pop();
W(now.F);
if (now.S + 1 < d[2]) {
now.F += AA[2][now.S + 1] - AA[2][now.S];
now.S++;
h.push(now);
}
}
return 0;
}
| /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int d[3], K;
R(d[0], d[1], d[2], K);
VL AA[3];
REP(i, 3) {
REP(j, d[i]) {
LL v;
R(v);
AA[i].PB(v);
}
sort(ALL(AA[i]), greater<LL>());
}
priority_queue<pair<LL, int>> h;
REP(i, d[0]) REP(j, d[1]) { h.push(MP(AA[0][i] + AA[1][j] + AA[2][0], 0)); }
while (K) {
K--;
auto now = h.top();
h.pop();
W(now.F);
if (now.S + 1 < d[2]) {
now.F += AA[2][now.S + 1] - AA[2][now.S];
now.S++;
h.push(now);
}
}
return 0;
}
| [
"call.arguments.change"
] | 894,796 | 894,797 | u284124505 | cpp |
p03078 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int d[3], K;
R(d[0], d[1], d[2], K);
VL AA[3];
REP(i, 3) {
REP(j, d[i]) {
LL v;
R(v);
AA[i].PB(v);
}
sort(ALL(AA[i]), greater<int>());
}
priority_queue<pair<int, int>> h;
REP(i, d[0]) REP(j, d[1]) { h.push(MP(AA[0][i] + AA[1][j] + AA[2][0], 0)); }
while (K) {
K--;
auto now = h.top();
h.pop();
W(now.F);
if (now.S + 1 < d[2]) {
now.F += AA[2][now.S + 1] - AA[2][now.S];
now.S++;
h.push(now);
}
}
return 0;
}
| /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int d[3], K;
R(d[0], d[1], d[2], K);
VL AA[3];
REP(i, 3) {
REP(j, d[i]) {
LL v;
R(v);
AA[i].PB(v);
}
sort(ALL(AA[i]), greater<LL>());
}
priority_queue<pair<LL, int>> h;
REP(i, d[0]) REP(j, d[1]) { h.push(MP(AA[0][i] + AA[1][j] + AA[2][0], 0)); }
while (K) {
K--;
auto now = h.top();
h.pop();
W(now.F);
if (now.S + 1 < d[2]) {
now.F += AA[2][now.S + 1] - AA[2][now.S];
now.S++;
h.push(now);
}
}
return 0;
}
| [
"call.arguments.change"
] | 894,798 | 894,797 | u284124505 | cpp |
p03078 | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X, 0);
vector<ll> B(Y, 0);
vector<ll> C(Z, 0);
for (ll i = 0; i < X; i++) {
cin >> A[i];
}
for (ll i = 0; i < Y; i++) {
cin >> B[i];
}
for (ll i = 0; i < Z; i++) {
cin >> C[i];
}
sort(C.rbegin(), C.rend());
vector<ll> AB;
for (ll i = 0; i < X; i++) {
for (ll j = 0; j < Y; j++) {
AB.push_back(A[i] + B[j]);
// cout << A[i]+B[j] << endl;
}
}
sort(AB.rbegin(), AB.rend());
vector<ll> ans;
ll cn = 0;
for (ll i = 0; i < AB.size(); i++) {
for (ll j = 0; j < Z; j++) {
ans.push_back(AB[i] + C[j]);
cn++;
if (cn > K) {
break;
}
}
if (cn > K) {
break;
}
}
sort(ans.rbegin(), ans.rend());
for (ll i = 0; i < K; i++) {
cout << ans[i] << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X, 0);
vector<ll> B(Y, 0);
vector<ll> C(Z, 0);
for (ll i = 0; i < X; i++) {
cin >> A[i];
}
for (ll i = 0; i < Y; i++) {
cin >> B[i];
}
for (ll i = 0; i < Z; i++) {
cin >> C[i];
}
sort(C.rbegin(), C.rend());
vector<ll> AB;
for (ll i = 0; i < X; i++) {
for (ll j = 0; j < Y; j++) {
AB.push_back(A[i] + B[j]);
// cout << A[i]+B[j] << endl;
}
}
sort(AB.rbegin(), AB.rend());
vector<ll> ans;
ll cn = 0;
for (ll i = 0; i < AB.size(); i++) {
for (ll j = 0; j < Z; j++) {
ans.push_back(AB[i] + C[j]);
cn++;
if (cn >= K * K) {
break;
}
}
if (cn >= K * K) {
break;
}
}
sort(ans.rbegin(), ans.rend());
for (ll i = 0; i < K; i++) {
cout << ans[i] << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 894,799 | 894,800 | u048791623 | cpp |
p03078 | #include <algorithm>
#include <cstdio>
#include <map>
#include <queue>
using namespace std;
#define ll long long
struct s {
int v, i, j;
};
class cmp {
public:
bool operator()(const s &a, const s &b) { return a.v < b.v; }
};
int main() {
int x, y, z, k;
scanf("%d %d %d %d", &x, &y, &z, &k);
ll a[x], b[y], c[z];
for (int i = 0; i < x; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < y; i++)
scanf("%lld", &b[i]);
for (int i = 0; i < z; i++)
scanf("%lld", &c[i]);
ll d[x * y], count = 0;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
d[count] = a[i] + b[j];
count++;
}
}
sort(d, d + x * y);
reverse(d, d + x * y);
sort(c, c + z);
reverse(c, c + z);
priority_queue<s, vector<s>, cmp> pq;
for (int i = 0; i < x * y; i++) {
s aaa;
aaa.i = i;
aaa.j = 0;
aaa.v = d[aaa.i] + c[aaa.j];
pq.push(aaa);
}
while (k--) {
s cur = pq.top();
pq.pop();
printf("%lld\n", cur.v);
s ns;
if (cur.j == z - 1)
continue;
ns.i = cur.i;
ns.j = cur.j + 1;
ns.v = d[ns.i] + c[ns.j];
pq.push(ns);
}
} | #include <algorithm>
#include <cstdio>
#include <map>
#include <queue>
using namespace std;
#define ll long long
struct s {
ll v, i, j;
};
class cmp {
public:
bool operator()(const s &a, const s &b) { return a.v < b.v; }
};
int main() {
int x, y, z, k;
scanf("%d %d %d %d", &x, &y, &z, &k);
ll a[x], b[y], c[z];
for (int i = 0; i < x; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < y; i++)
scanf("%lld", &b[i]);
for (int i = 0; i < z; i++)
scanf("%lld", &c[i]);
ll d[x * y], count = 0;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
d[count] = a[i] + b[j];
count++;
}
}
sort(d, d + x * y);
reverse(d, d + x * y);
sort(c, c + z);
reverse(c, c + z);
priority_queue<s, vector<s>, cmp> pq;
for (int i = 0; i < x * y; i++) {
s aaa;
aaa.i = i;
aaa.j = 0;
aaa.v = d[aaa.i] + c[aaa.j];
pq.push(aaa);
}
while (k--) {
s cur = pq.top();
pq.pop();
printf("%lld\n", cur.v);
s ns;
if (cur.j == z - 1)
continue;
ns.i = cur.i;
ns.j = cur.j + 1;
ns.v = d[ns.i] + c[ns.j];
pq.push(ns);
}
} | [] | 894,801 | 894,802 | u340969800 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z;
cin >> X >> Y >> Z;
long long K;
cin >> K;
vector<long long> A, B, C;
vector<pair<long long, int>> vec;
for (int a = 0; a < X; a++) {
long long b;
cin >> b;
A.push_back(b);
}
for (int a = 0; a < Y; a++) {
long long b;
cin >> b;
B.push_back(b);
}
for (int a = 0; a < Z; a++) {
long long b;
cin >> b;
C.push_back(b);
}
vector<long long> hoge;
for (int a = 0; a < Y; a++) {
for (int b = 0; b < Z; b++) {
hoge.push_back(B.at(a) * C.at(b));
}
}
sort(hoge.begin(), hoge.end());
priority_queue<long long, vector<long long>, greater<long long>> que;
sort(A.begin(), A.end());
reverse(hoge.begin(), hoge.end());
reverse(A.begin(), A.end());
for (int a = 0; a < X; a++) {
for (int b = 0; b < hoge.size(); b++) {
if (que.size() <= K) {
que.push(hoge.at(b) + A.at(a));
} else {
if (que.top() < hoge.at(b) + A.at(a)) {
que.push(hoge.at(b) + A.at(a));
que.pop();
} else {
break;
}
}
}
}
vector<long long> q;
for (int a = 0; a < K; a++) {
q.push_back(que.top());
que.pop();
}
reverse(q.begin(), q.end());
for (int a = 0; a < K; a++)
cout << q.at(a) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z;
cin >> X >> Y >> Z;
long long K;
cin >> K;
vector<long long> A, B, C;
vector<pair<long long, int>> vec;
for (int a = 0; a < X; a++) {
long long b;
cin >> b;
A.push_back(b);
}
for (int a = 0; a < Y; a++) {
long long b;
cin >> b;
B.push_back(b);
}
for (int a = 0; a < Z; a++) {
long long b;
cin >> b;
C.push_back(b);
}
vector<long long> hoge;
for (int a = 0; a < Y; a++) {
for (int b = 0; b < Z; b++) {
hoge.push_back(B.at(a) + C.at(b));
}
}
sort(hoge.begin(), hoge.end());
priority_queue<long long, vector<long long>, greater<long long>> que;
sort(A.begin(), A.end());
reverse(hoge.begin(), hoge.end());
reverse(A.begin(), A.end());
for (int a = 0; a < X; a++) {
for (int b = 0; b < hoge.size(); b++) {
if (que.size() < K) {
que.push(hoge.at(b) + A.at(a));
} else {
if (que.top() < hoge.at(b) + A.at(a)) {
que.push(hoge.at(b) + A.at(a));
que.pop();
} else {
break;
}
}
}
}
vector<long long> q;
for (int a = 0; a < K; a++) {
q.push_back(que.top());
que.pop();
}
reverse(q.begin(), q.end());
for (int a = 0; a < K; a++)
cout << q.at(a) << endl;
}
| [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 894,810 | 894,811 | u580402951 | cpp |
p03078 | #include <bits/stdc++.h>
#define LL long long
#define db double
using namespace std;
#define MAXN 200200
#define MAXE 400400
typedef pair<int, int> pii;
#define X first
#define Y second
const LL INF = (1LL << 62) | 3;
#define Debug(...) fprintf(stderr, __VA_ARGS__)
template <typename T> inline void read(T &x) {
int ch = getchar();
bool fg = false;
for (x = 0; !isdigit(ch); ch = getchar()) {
if (ch == '-') {
fg = true;
}
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + ch - '0';
}
if (fg) {
x = -x;
}
}
template <typename T> inline bool chkmin(T &x, const T &y) {
return y < x ? (x = y, true) : false;
}
template <typename T> inline bool chkmax(T &x, const T &y) {
return x < y ? (x = y, true) : false;
}
priority_queue<int> q;
int k, a[MAXN], b[MAXN], c[MAXN];
signed main() {
int x, y, z;
read(x), read(y), read(z), read(k);
k = min(k, x * y * z);
for (int i = 1; i <= x; i++)
read(a[i]);
for (int i = 1; i <= y; i++)
read(b[i]);
for (int i = 1; i <= z; i++)
read(c[i]);
sort(a + 1, a + x + 1);
reverse(a + 1, a + x + 1);
sort(b + 1, b + y + 1);
reverse(b + 1, b + y + 1);
sort(c + 1, c + z + 1);
reverse(c + 1, c + z + 1);
for (int i = 1; i <= x; i++) {
for (int j = 1; j <= y; j++) {
q.push(a[i] + b[j]);
}
}
for (int i = 1; i <= k; i++) {
if (!q.empty())
a[i] = q.top(), q.pop();
else
break;
}
while (!q.empty())
q.pop();
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= z; j++) {
q.push(a[i] + c[j]);
}
}
for (int i = 1; i <= k; i++) {
printf("%d\n", q.top());
q.pop();
}
return 0;
} | #include <bits/stdc++.h>
#define LL long long
#define db double
using namespace std;
#define MAXN 200200
#define MAXE 400400
typedef pair<int, int> pii;
#define X first
#define Y second
const LL INF = (1LL << 62) | 3;
#define Debug(...) fprintf(stderr, __VA_ARGS__)
template <typename T> inline void read(T &x) {
int ch = getchar();
bool fg = false;
for (x = 0; !isdigit(ch); ch = getchar()) {
if (ch == '-') {
fg = true;
}
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + ch - '0';
}
if (fg) {
x = -x;
}
}
template <typename T> inline bool chkmin(T &x, const T &y) {
return y < x ? (x = y, true) : false;
}
template <typename T> inline bool chkmax(T &x, const T &y) {
return x < y ? (x = y, true) : false;
}
priority_queue<long long> q;
int k;
long long a[MAXN], b[MAXN], c[MAXN];
signed main() {
int x, y, z;
read(x), read(y), read(z), read(k);
k = min(k, x * y * z);
for (int i = 1; i <= x; i++)
read(a[i]);
for (int i = 1; i <= y; i++)
read(b[i]);
for (int i = 1; i <= z; i++)
read(c[i]);
sort(a + 1, a + x + 1);
reverse(a + 1, a + x + 1);
sort(b + 1, b + y + 1);
reverse(b + 1, b + y + 1);
sort(c + 1, c + z + 1);
reverse(c + 1, c + z + 1);
for (int i = 1; i <= x; i++) {
for (int j = 1; j <= y; j++) {
q.push(a[i] + b[j]);
}
}
for (int i = 1; i <= k; i++) {
if (!q.empty())
a[i] = q.top(), q.pop();
else
break;
}
while (!q.empty())
q.pop();
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= z; j++) {
q.push(a[i] + c[j]);
}
}
for (int i = 1; i <= k; i++) {
printf("%lld\n", q.top());
q.pop();
}
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 894,826 | 894,827 | u194743874 | cpp |
p03079 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define Vl vector<ll>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll ZER = 0;
int main() {
vector<int> a(3);
rep(i, 3) cin >> a[i];
sort(ALL(a));
if (a[0] == a[1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define Vl vector<ll>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll ZER = 0;
int main() {
vector<int> a(3);
rep(i, 3) cin >> a[i];
sort(ALL(a));
if (a[0] == a[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 894,848 | 894,849 | u516525290 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.141592653589793
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.141592653589793
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,852 | 894,853 | u927053131 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
// [正]三角形
int main(void) {
int a[3];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
if (a[2] == a[1] and a[0] == a[1]) {
cout << "YES";
} else {
cout << "NO";
}
}
| #include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
// [正]三角形
int main(void) {
int a[3];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
if (a[2] == a[1] and a[0] == a[1]) {
cout << "Yes"; //
} else {
cout << "No"; //
}
// cout<<endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,854 | 894,855 | u520276780 | cpp |
p03079 | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes";
else
cout << "No";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,856 | 894,857 | u273359100 | cpp |
p03079 | /*
author : nishi5451
created: 12.08.2020 14:48:15
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | /*
author : nishi5451
created: 12.08.2020 14:48:15
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,858 | 894,859 | u033937898 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, k, i, j;
cin >> x >> y >> z >> k;
long long a[x], b, d[x * y] = {}, e[k * z] = {};
for (i = 0; i < x; i++) {
cin >> a[i];
}
for (i = 0; i < y; i++) {
cin >> b;
for (j = 0; j < x; j++) {
d[y * i + j] = a[j] + b;
}
}
sort(d, d + x * y, greater<long long>());
for (i = 0; i < z; i++) {
cin >> b;
for (j = 0; j < k && j < x * y; j++) {
e[z * i + j] = d[j] + b;
}
}
sort(e, e + z * k, greater<long long>());
for (i = 0; i < k; i++) {
cout << e[i] << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, k, i, j;
cin >> x >> y >> z >> k;
long long a[x], b, d[x * y] = {}, e[k * z] = {};
for (i = 0; i < x; i++) {
cin >> a[i];
}
for (i = 0; i < y; i++) {
cin >> b;
for (j = 0; j < x; j++) {
d[x * i + j] = a[j] + b;
}
}
sort(d, d + x * y, greater<long long>());
for (i = 0; i < z; i++) {
cin >> b;
for (j = 0; j < k && j < x * y; j++) {
e[k * i + j] = d[j] + b;
}
}
sort(e, e + z * k, greater<long long>());
for (i = 0; i < k; i++) {
cout << e[i] << '\n';
}
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 894,882 | 894,883 | u058348416 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> A(X);
vector<long long> B(Y);
vector<long long> C(Z);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
for (int i = 0; i < Z; i++) {
cin >> C[i];
}
vector<long long> AB(X * Y);
int index = 0;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AB[index] = A[i] * B[j];
index += 1;
}
}
sort(AB.begin(), AB.end());
reverse(AB.begin(), AB.end());
vector<long long> V(min(K, X * Y));
for (int i = 0; i < min(K, X * Y); i++) {
V[i] = AB[i];
}
index = 0;
vector<long long> abc(V.size() * Z);
for (int i = 0; i < Z; i++) {
for (int j = 0; j < V.size(); j++) {
abc[index] = C[i] * V[j];
index += 1;
}
}
sort(abc.begin(), abc.end());
reverse(abc.begin(), abc.end());
vector<long long> ans(K);
for (int i = 0; i < K; i++) {
ans[i] = abc[i];
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
};
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> A(X);
vector<long long> B(Y);
vector<long long> C(Z);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
for (int i = 0; i < Z; i++) {
cin >> C[i];
}
vector<long long> AB(X * Y);
int index = 0;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
AB[index] = A[i] + B[j];
index += 1;
}
}
sort(AB.begin(), AB.end());
reverse(AB.begin(), AB.end());
vector<long long> V(min(K, X * Y));
for (int i = 0; i < min(K, X * Y); i++) {
V[i] = AB[i];
}
index = 0;
vector<long long> abc(V.size() * Z);
for (int i = 0; i < Z; i++) {
for (int j = 0; j < V.size(); j++) {
abc[index] = C[i] + V[j];
index += 1;
}
}
sort(abc.begin(), abc.end());
reverse(abc.begin(), abc.end());
vector<long long> ans(K);
for (int i = 0; i < K; i++) {
ans[i] = abc[i];
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
};
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 894,892 | 894,893 | u987594251 | cpp |
p03078 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
int main(int argc, char *argv[]) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int> A(X);
vector<int> B(Y);
vector<int> C(Z);
int i, j, k;
for (i = 0; i < X; i++) {
cin >> A[i];
}
for (i = 0; i < Y; i++) {
cin >> B[i];
}
for (i = 0; i < Z; i++) {
cin >> C[i];
}
multimap<LL, int> myMap;
multimap<LL, int>::iterator mit;
bool bFull = false;
for (i = 0; i < X; i++) {
for (j = 0; j < Y; j++) {
for (k = 0; k < Z; k++) {
LL xyz = A[i] + B[j] + C[k];
if (!bFull) {
if (myMap.size() == K) {
bFull = true;
}
}
if (!bFull) {
myMap.insert(multimap<LL, int>::value_type(xyz, 0));
} else {
mit = myMap.begin();
if (xyz > (*mit).first) {
myMap.erase(myMap.begin());
myMap.insert(multimap<LL, int>::value_type(xyz, 0));
}
}
}
}
}
vector<LL> R;
for (mit = myMap.begin(); mit != myMap.end(); mit++) {
R.push_back((*mit).first);
}
for (i = R.size() - 1; i >= 0; i--) {
cout << R[i] << endl;
}
return 0;
} | #include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
int main(int argc, char *argv[]) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<LL> A(X);
vector<LL> B(Y);
vector<LL> C(Z);
int i, j, k;
for (i = 0; i < X; i++) {
cin >> A[i];
}
for (i = 0; i < Y; i++) {
cin >> B[i];
}
for (i = 0; i < Z; i++) {
cin >> C[i];
}
multimap<LL, int> myMap;
multimap<LL, int>::iterator mit;
bool bFull = false;
for (i = 0; i < X; i++) {
for (j = 0; j < Y; j++) {
for (k = 0; k < Z; k++) {
LL xyz = A[i] + B[j] + C[k];
if (!bFull) {
if (myMap.size() == K) {
bFull = true;
}
}
if (!bFull) {
myMap.insert(multimap<LL, int>::value_type(xyz, 0));
} else {
mit = myMap.begin();
if (xyz > (*mit).first) {
myMap.erase(myMap.begin());
myMap.insert(multimap<LL, int>::value_type(xyz, 0));
}
}
}
}
}
vector<LL> R;
for (mit = myMap.begin(); mit != myMap.end(); mit++) {
R.push_back((*mit).first);
}
for (i = R.size() - 1; i >= 0; i--) {
cout << R[i] << endl;
}
return 0;
} | [] | 894,905 | 894,906 | u875570028 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
long long k = 0, c[3] = {0};
vector<long long> cake[3], ans, lst;
void solve();
long long ch(long long now);
int main() {
for (int i = 0; i < 3; ++i)
cin >> c[i];
cin >> k;
for (int i = 0; i < 3; ++i) {
cake[i].resize(c[i]);
for (int j = 0; j < c[i]; ++j)
cin >> cake[i][j];
sort(cake[i].begin(), cake[i].end());
}
solve();
for (int i = 0; i < k; ++i)
cout << ans[i] << endl;
return 0;
}
void solve() {
long long maxnum = cake[0][c[0] - 1] + cake[1][c[1] - 1] + cake[2][c[2] - 1],
minnum = cake[0][0] + cake[1][0] + cake[2][0];
for (int i = 0; i < c[1]; ++i)
for (int j = 0; j < c[2]; ++j)
lst.push_back(cake[1][i] + cake[2][j]);
sort(lst.begin(), lst.end());
for (int i = 0; i < k; ++i) {
long long l = minnum, r = maxnum;
while (r - l > 1) {
long long now = (l + r) / 2, nowid = ch(now);
if (nowid <= i)
r = now;
else {
if (nowid >= k)
minnum = now;
l = now;
}
}
maxnum = r;
ans.push_back(r);
}
}
long long ch(long long now) {
long long cnt = 0;
for (int i = 0; i < c[0]; ++i) {
long long nowbound = now - cake[0][c[0] - 1 - i];
auto it = upper_bound(lst.begin(), lst.end(), nowbound);
if (it == lst.end())
break;
cnt += lst.end() - it;
}
return cnt;
} | #include <bits/stdc++.h>
using namespace std;
long long k = 0, c[3] = {0};
vector<long long> cake[3], ans, lst;
void solve();
long long ch(long long now);
int main() {
for (int i = 0; i < 3; ++i)
cin >> c[i];
cin >> k;
for (int i = 0; i < 3; ++i) {
cake[i].resize(c[i]);
for (int j = 0; j < c[i]; ++j)
cin >> cake[i][j];
sort(cake[i].begin(), cake[i].end());
}
solve();
for (int i = 0; i < k; ++i)
cout << ans[i] << endl;
return 0;
}
void solve() {
long long maxnum = cake[0][c[0] - 1] + cake[1][c[1] - 1] + cake[2][c[2] - 1],
minnum = cake[0][0] + cake[1][0] + cake[2][0] - 1;
for (int i = 0; i < c[1]; ++i)
for (int j = 0; j < c[2]; ++j)
lst.push_back(cake[1][i] + cake[2][j]);
sort(lst.begin(), lst.end());
for (int i = 0; i < k; ++i) {
long long l = minnum, r = maxnum;
while (r - l > 1) {
long long now = (l + r) / 2, nowid = ch(now);
if (nowid <= i)
r = now;
else {
if (nowid >= k)
minnum = now;
l = now;
}
}
maxnum = r;
ans.push_back(r);
}
}
long long ch(long long now) {
long long cnt = 0;
for (int i = 0; i < c[0]; ++i) {
long long nowbound = now - cake[0][c[0] - 1 - i];
auto it = upper_bound(lst.begin(), lst.end(), nowbound);
if (it == lst.end())
break;
cnt += lst.end() - it;
}
return cnt;
} | [
"assignment.change"
] | 894,911 | 894,912 | u269963329 | cpp |
p03079 | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define int long long
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll inf = 1e9 + 7;
const ll mod = 1e9 + 7;
double PI = acos(-1.0);
signed main() {
vector<ll> a(3);
rep(i, 3) cin >> a[i];
sort(all(a));
if (a[0] + a[1] > a[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define int long long
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll inf = 1e9 + 7;
const ll mod = 1e9 + 7;
double PI = acos(-1.0);
signed main() {
vector<ll> a(3);
rep(i, 3) cin >> a[i];
sort(all(a));
if (a[0] == a[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 894,917 | 894,918 | u339937125 | cpp |
p03079 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstdlib>
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) \
for (int i = 0; i < (n); i++) \
;
#define all(a) (a).begin(), (a).end()
using namespace std;
using ld = long double;
using ll = long long;
const ll INF = 10010010010;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { // a>b
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
ll A, B, C;
cin >> A >> B >> C;
if (A == B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstdlib>
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) \
for (int i = 0; i < (n); i++) \
;
#define all(a) (a).begin(), (a).end()
using namespace std;
using ld = long double;
using ll = long long;
const ll INF = 10010010010;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { // a>b
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
ll A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 894,919 | 894,920 | u527652459 | cpp |
p03079 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a & b & c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 894,926 | 894,927 | u688789047 | cpp |
p03079 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void) {
vector<ll> a(3);
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[0] + a[1] > a[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void) {
vector<ll> a(3);
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[0] == a[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 894,933 | 894,934 | u755121033 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C ? "Yes" : "Np") << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C ? "Yes" : "No") << endl;
} | [
"literal.string.change",
"io.output.change"
] | 894,939 | 894,940 | u868132236 | cpp |
p03079 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a == b && b == c) ? "Yes" : "No";
}
| #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << ((a == b && b == c) ? "Yes" : "No");
} | [] | 894,941 | 894,942 | u424602097 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define LONGLONGMAX 9223372036854775807
#define LONGLONGMIN -9223372036854775807
#define INTMAX 32767
#define INTMIN -32767
#define ROUNDUP(divisor, dividend) (divisor + (dividend - 1)) / dividend
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a == b && b == c ? "YES" : "NO") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define LONGLONGMAX 9223372036854775807
#define LONGLONGMIN -9223372036854775807
#define INTMAX 32767
#define INTMIN -32767
#define ROUNDUP(divisor, dividend) (divisor + (dividend - 1)) / dividend
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a == b && b == c ? "Yes" : "No") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,943 | 894,944 | u890807039 | cpp |
p03079 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define LAST(x) x[x.size() - 1]
#define ALL(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
#define CEIL(a, b) ((a + b - 1) / b)
int FACT(int a) {
if (a == 0)
return 1;
else
return a * FACT(a - 1);
}
int nPr(int n, int r) {
int s = n - r + 1;
int sum = 1;
for (int i = s; i <= n; i++)
sum *= i;
return sum;
}
// int nCr1(int n, int r)
// int nCr2(int n, int r)
int GCD(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return GCD(b, a % b);
}
int LCM(int a, int b) // assuming a,b >= 1
{
return a * b / GCD(a, b);
}
double LOG(int a, int b) { return log(b) / log(a); }
inline bool BETWEEN(int x, int min, int max) {
if (min <= x && x <= max)
return true;
else
return false;
}
inline bool PRIMEOR(int x) {
if (x == 1)
return false;
if (x == 2)
return true;
if (x % 2 == 0)
return false;
double sqrtx = sqrt(x);
for (int i = 3; i <= sqrtx; i += 2) {
if (x % i == 0)
return false;
}
return true;
}
using namespace std;
#pragma endregion
signed main() {
int a[3];
rep(i, 3) { cin >> a[i]; }
if (a[0] == a[1] && a[1] == a[2])
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define LAST(x) x[x.size() - 1]
#define ALL(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
#define CEIL(a, b) ((a + b - 1) / b)
int FACT(int a) {
if (a == 0)
return 1;
else
return a * FACT(a - 1);
}
int nPr(int n, int r) {
int s = n - r + 1;
int sum = 1;
for (int i = s; i <= n; i++)
sum *= i;
return sum;
}
// int nCr1(int n, int r)
// int nCr2(int n, int r)
int GCD(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return GCD(b, a % b);
}
int LCM(int a, int b) // assuming a,b >= 1
{
return a * b / GCD(a, b);
}
double LOG(int a, int b) { return log(b) / log(a); }
inline bool BETWEEN(int x, int min, int max) {
if (min <= x && x <= max)
return true;
else
return false;
}
inline bool PRIMEOR(int x) {
if (x == 1)
return false;
if (x == 2)
return true;
if (x % 2 == 0)
return false;
double sqrtx = sqrt(x);
for (int i = 3; i <= sqrtx; i += 2) {
if (x % i == 0)
return false;
}
return true;
}
using namespace std;
#pragma endregion
signed main() {
int a[3];
rep(i, 3) { cin >> a[i]; }
if (a[0] == a[1] && a[1] == a[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,947 | 894,948 | u545364250 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (max({a, b, c}) == min({a, b, c})) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (max({a, b, c}) == min({a, b, c})) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,949 | 894,950 | u519194615 | cpp |
p03079 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll a, b, c;
cin >> a, b, c;
if (a == b and b == c and a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a == b and b == c and a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [] | 894,953 | 894,954 | u473023730 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x == y == z) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x == y && y == z) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 894,955 | 894,956 | u178021677 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x == y == z) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x == y && y == z) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 894,955 | 894,957 | u178021677 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 894,958 | 894,959 | u902803949 | cpp |
p03079 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int lint;
typedef pair<int, int> P;
typedef pair<lint, lint> LLP;
typedef pair<char, char> CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v, hoge) upper_bound(v.begin(), v.end(), hoge)
#define lower(v, hoge) lower_bound(v.begin(), v.end(), hoge)
#define llower(v, hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v, hoge) *upper_bound(v.begin(), v.end(), hoge)
const lint MOD = pow(10, 9) + 7;
/*
vector<char>al(26);
al =
{'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL =
{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
vector<char>NUM(10);
NUM = { '0','1','2' ,'3' ,'4' ,'5' ,'6' ,'7' ,'8' ,'9' };
*/
int main() {
vector<int> V(3);
rep(i, 3) { cin >> V[i]; }
sort(V);
if (V[2] < V[1] + V[0]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int lint;
typedef pair<int, int> P;
typedef pair<lint, lint> LLP;
typedef pair<char, char> CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v, hoge) upper_bound(v.begin(), v.end(), hoge)
#define lower(v, hoge) lower_bound(v.begin(), v.end(), hoge)
#define llower(v, hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v, hoge) *upper_bound(v.begin(), v.end(), hoge)
const lint MOD = pow(10, 9) + 7;
/*
vector<char>al(26);
al =
{'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL =
{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
vector<char>NUM(10);
NUM = { '0','1','2' ,'3' ,'4' ,'5' ,'6' ,'7' ,'8' ,'9' };
*/
int main() {
vector<int> V(3);
rep(i, 3) { cin >> V[i]; }
sort(V);
if (V[2] == V[0]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 894,960 | 894,961 | u247679666 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 894,962 | 894,963 | u548834738 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 894,976 | 894,977 | u517197973 | cpp |
p03079 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes";
else
cout << "No";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,981 | 894,982 | u512624048 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 894,985 | 894,986 | u091026689 | cpp |
p03079 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C && C == A)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C && C == A)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 894,989 | 894,990 | u608258653 | cpp |
p03079 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a == b == c)
puts("Yes");
else
puts("No");
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
puts("Yes");
else
puts("No");
} | [
"control_flow.branch.if.condition.change"
] | 895,004 | 895,005 | u242679311 | cpp |
p03079 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,008 | 895,009 | u273928723 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(int argc, char *argv[]) {
// cin.tie(0);
// ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c)
cout << "Yes" << endl;
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(int argc, char *argv[]) {
// cin.tie(0);
// ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 895,010 | 895,011 | u569778242 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a == b == c ? "Yes" : "No") << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a == b && b == c ? "Yes" : "No") << endl;
} | [
"expression.operation.binary.add"
] | 895,014 | 895,015 | u392569193 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 895,016 | 895,017 | u710135612 | cpp |
p03079 | #include <iostream>
#include <set>
using namespace std;
int main(int argc, const char *argv[]) {
set<int> st;
int x;
for (int i = 0; i < 2; i++) {
cin >> x;
st.insert(x);
}
if (st.size() == 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <iostream>
#include <set>
using namespace std;
int main(int argc, const char *argv[]) {
set<int> st;
int x;
for (int i = 0; i < 3; i++) {
cin >> x;
st.insert(x);
}
if (st.size() == 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 895,024 | 895,025 | u493080913 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == (b == c))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 895,026 | 895,027 | u218759384 | cpp |
p03079 | #include <stdio.h>
int main(void) {
int A, B, C;
scanf("%d", &A);
scanf("%d", &B);
scanf("%d", &C);
if (A == B && B == C)
printf("yes");
else
printf("no");
return 0;
} | #include <stdio.h>
int main(void) {
int A, B, C;
scanf("%d", &A);
scanf("%d", &B);
scanf("%d", &C);
if (A == B && B == C)
printf("Yes");
else
printf("No");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 895,032 | 895,033 | u956941456 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A = B = C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 895,036 | 895,037 | u795273869 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 895,041 | 895,042 | u445015174 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a, b, c;
if (a == b && b == c)
cout << "Yes";
else
cout << "No";
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes";
else
cout << "No";
} | [] | 895,052 | 895,053 | u455489956 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,062 | 895,063 | u673058289 | cpp |
p03079 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a == b && b == c) ? "Yes" : "No";
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a == b && b == c ? "Yes" : "No");
} | [] | 895,064 | 895,065 | u649972935 | cpp |
p03079 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a == b == c) {
std::cout << "Yes";
} else {
std::cout << "No";
}
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a == b && b == c) {
std::cout << "Yes";
} else {
std::cout << "No";
}
} | [
"control_flow.branch.if.condition.change"
] | 895,066 | 895,067 | u649972935 | cpp |
p03079 | /*input
2 2 2
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define pb push_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> P) {
out << '(' << P.F << ',' << P.S << ')';
return out;
}
//}}}
const ll maxn = 300005;
const ll maxlg = __lg(maxn) + 2;
const ll INF64 = 8000000000000000000LL;
const int INF = 0x3f3f3f3f;
const ll MOD = ll(1e9 + 7);
const double PI = acos(-1);
// const ll p=880301;
// const ll P=31;
ll mypow(ll a, ll b) {
ll res = 1LL;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
IOS;
int a, b, c;
cin >> a >> b >> c;
cout << ((a == b && b == c) ? "YES\n" : "NO\n");
return 0;
}
| /*input
3 4 5
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define pb push_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> P) {
out << '(' << P.F << ',' << P.S << ')';
return out;
}
//}}}
const ll maxn = 300005;
const ll maxlg = __lg(maxn) + 2;
const ll INF64 = 8000000000000000000LL;
const int INF = 0x3f3f3f3f;
const ll MOD = ll(1e9 + 7);
const double PI = acos(-1);
// const ll p=880301;
// const ll P=31;
ll mypow(ll a, ll b) {
ll res = 1LL;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
IOS;
int a, b, c;
cin >> a >> b >> c;
cout << ((a == b && b == c) ? "Yes\n" : "No\n");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,070 | 895,071 | u010467501 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a, b, c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [] | 895,087 | 895,088 | u361841553 | cpp |
p03079 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C && C == A) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C && C == A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,092 | 895,093 | u954985773 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "yes";
else
cout << "no";
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes";
else
cout << "No";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,094 | 895,095 | u070471279 | cpp |
p03079 | /* <rab:include(base.hpp)> */
#pragma GCC optimize("O3")
void solve(); /* この関数に問題ごとの処理を書く */
#if defined(EBUG) && !defined(ONLINE_JUDGE)
#define debug true
#else
#define NDEBUG /* <cassert>のincludeより前に定義する必要がある */
#define debug false
#endif
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#ifdef __cpp_lib_execution
#include <execution>
#endif
#include <cassert>
#include <cstdio>
#include <cstdlib>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define int LL /* 標準ライブラリのincludeが終わってから書き換える */
#define times(n, i) uptil(0, n, i)
#define rtimes(n, i) downto((n)-1, 0, i)
#define upto(f, t, i) \
for (auto rab_base_dest = (t), i = decltype(t)(f); i <= rab_base_dest; i++)
#define uptil(f, t, i) \
for (auto rab_base_dest = (t), i = decltype(t)(f); i < rab_base_dest; i++)
#define downto(f, t, i) \
for (auto rab_base_dest = decltype(f)(t), i = (f); i >= rab_base_dest; i--)
#define downtil(f, t, i) \
for (auto rab_base_dest = decltype(f)(t), i = (f); i > rab_base_dest; i--)
#define iter(v) begin(v), end(v)
#define citer(v) cbegin(v), cend(v)
#if debug
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 2
#define _LIBCPP_DEBUG2 2
#define ln << endl
#else
#define ln << '\n'
#endif
#define tb << '\t'
#define sp << ' '
#ifdef __cpp_lib_execution
#if debug
#define PARABLE execution::par_unseq,
#else
#define PARABLE execution::seq,
#endif
#else
#define PARABLE /* none */
#endif
#define CS const
#define CX constexpr
#define IL inline
#define RT return
#define TL template
#define TN typename
#define lambda [&]
/* <rab:include(typedefs.hpp)> */
struct unit {};
using int128 = __int128;
using LD = long double;
TL<TN T> using vec = vector<T>;
TL<TN T> using vvec = vec<vec<T>>;
TL<TN T> using vvvec = vec<vvec<T>>;
TL<TN T> using vvvvec = vec<vvvec<T>>;
/* @rab:typedefs:dynamic */
/* </rab:include(typedefs.hpp)> */
/* <rab:include(alias.hpp)> */
#define MP make_pair
#define MU make_unique
#define PB push_back
#define UP unique_ptr
#define foldl accumulate
#define scanl partial_sum
/* </rab:include(alias.hpp)> */
TL<TN T> IL bool amax(T &v, CS T &a) { RT v < a && (v = a, true); }
TL<TN T> IL bool amin(T &v, CS T &a) { RT v > a && (v = a, true); }
namespace kpl {
template <class V, class W> static IL void append(V &v, const W &w) {
copy(PARABLE citer(w), back_inserter(v));
}
template <class V>
static IL auto flatten(const V &xss, unsigned reserve_size = 0)
-> vector<decltype(*begin(*begin(xss)))> {
decltype(flatten(xss)) ret;
ret.reserve(reserve_size);
for (const auto &xs : xss)
append(ret, xs);
ret.shrink_to_fit();
return move(ret);
}
template <class I> static inline bool is_in(I x, I l, I r) {
return l <= x && x < r;
}
} // namespace kpl
/* <rab:include(util.hpp)> */
#ifndef __cpp_lib_exchange_function
// #define __cpp_lib_exchange_function 201304L
#define exchange exchange_RAB
TL<class T, class U = T> T exchange(T &t, U &&u) {
T ret = move(t);
t = forward<U>(u);
RT ret;
}
#endif
#ifndef __cpp_lib_clamp
// #define __cpp_lib_clamp 201603L
#define clamp clamp_RAB
TL<class T> CX CS T &clamp(CS T &a, CS T &mn, CS T &mx) {
RT a<mn ? mn : a> mx ? mx : a;
}
#endif
template <class V> void uniq_after_sort(V &v) {
v.erase(unique(iter(v)), v.end());
}
template <class V> void sort_and_uniq(V &v) {
sort(iter(v));
v.erase(unique(iter(v)), v.end());
}
/* </rab:include(util.hpp)> */
/* <rab:include(mod.hpp)> */
#ifdef MOD
#if !defined(FORCE_MOD) && MOD != 1000000007 && MOD != 1000000009 && \
MOD != 998244353
#error unknown mod MOD; if you really want to use (MOD) as mod, define FORCE_MOD.
#endif
#else
#define MOD 1000000007
#endif
/* <rab:include(power.hpp)> */
TL<class T> T power(T x, int n) {
T rt(1);
for (; n; n /= 2) {
if (n % 2)
rt *= x;
x *= x;
}
RT rt;
}
int pow_mod(int x, int n, int m) {
int rt = 1;
for (; n; n /= 2) {
if (n % 2)
rt = rt * x % m;
x = x * x % m;
}
RT rt;
}
int pow_mod_64(int128 x, int n, int m) {
int128 rt = 1;
for (; n; n /= 2) {
if (n % 2)
rt = rt * x % m;
x = x * x % m;
}
RT rt;
}
/* </rab:include(power.hpp)> */
IL CX int modulo(int a, int m) { RT(a %= m, a >= 0 ? a : a + m); }
TL<ULL mod = MOD> class MInt {
/*
int with modulo.
// `mod` must be a prime for `log`.
`mod` must be coprime to `val` for `inv` and to `m.val` for `operator/` and
`operator/=`.
*/
/*! https://ei1333.github.io/luzhiled/snippets/other/mod-int.html */
public:
int val;
CX MInt() : val(0) {}
explicit CX MInt(int v) : val(modulo(v, mod)) {}
MInt &operator+=(CS MInt &m) {
val += m.val;
if (val >= mod)
val -= mod;
RT *this;
}
MInt &operator-=(CS MInt &m) {
val -= m.val;
if (val < 0)
val += mod;
RT *this;
}
MInt &operator*=(CS MInt &m) {
val = val * m.val % mod;
RT *this;
}
MInt &operator/=(CS MInt &m) {
val = val * m.inv().val % mod;
RT *this;
}
MInt operator+(CS MInt &m) CS { RT MInt(*this) += m; }
MInt operator-(CS MInt &m) CS { RT MInt(*this) -= m; }
MInt operator*(CS MInt &m) CS { RT MInt(*this) *= m; }
MInt operator/(CS MInt &m) CS { RT MInt(*this) /= m; }
MInt operator-() CS {
MInt m;
m.val = val ? mod - val : 0;
RT m;
}
bool operator==(CS MInt &m) CS { RT val == m.val; }
bool operator!=(CS MInt &m) CS { RT val != m.val; }
// MInt pow(int n)CS{MInt x(*this),rt(1);while(n){if(n%2)rt*=x;x*=x;n/=2;}RT
// rt;}
MInt pow(int n) CS { RT power(*this, n); }
MInt inv() CS {
int a = val, b = mod, x = 1, y = 0, t;
while (b) {
t = a / b;
swap(b, a -= t * b);
swap(y, x -= t * y);
}
RT(MInt) x;
}
friend ostream &operator<<(ostream &o, CS MInt<mod> &m) { RT o << m.val; }
friend istream &operator>>(istream &i, MInt<mod> &m) {
int v;
i >> v;
m = MInt<mod>(v);
RT i;
}
};
using mint = MInt<>;
constexpr mint operator"" _m(ULL n) { RT mint(n); }
constexpr MInt<998244353> operator"" _m998244353(ULL n) {
RT MInt<998244353>(n);
}
constexpr MInt<1000000007> operator"" _m1e9_7(ULL n) { RT MInt<1000000007>(n); }
constexpr MInt<1000000009> operator"" _m1e9_9(ULL n) { RT MInt<1000000009>(n); }
////#pragma rab:gsub \b(\d+)m\b mint(\1)
/* </rab:include(mod.hpp)> */
/* <rab:include(debug.hpp)> */
TL<class T> IL istream &operator>>(istream &s, vec<T> &v) {
for (auto &&p : v)
s >> p;
RT s;
}
TL<class T, class S> IL ostream &operator<<(ostream &s, CS pair<T, S> &p) {
RT s << "(" << p.first << "," << p.second << ")";
}
TL<class T> IL ostream &operator<<(ostream &, CS vec<T> &);
TL<class T, class S> IL ostream &operator<<(ostream &, CS map<T, S> &);
#define DEFINE_ITER_OUTPUT(s, x, sep) \
{ \
int i = 0; \
for (CS auto &x##0_elem : x) { \
if (i++) \
s << sep; \
s << x##0_elem; \
} \
RT s; \
}
TL<class T> IL ostream &operator<<(ostream &s, CS vec<T> &v)
DEFINE_ITER_OUTPUT(s, v, ' ') TL<class T, class S> IL ostream &
operator<<(ostream &s, CS map<T, S> &m)
DEFINE_ITER_OUTPUT(s, m, ' ') TL<class T> IL ostream &
operator<<(ostream &s, CS vec<vec<T>> &w)
DEFINE_ITER_OUTPUT(s, w, '\n') TL<class T, class S> IL ostream &
operator<<(ostream &s, CS vec<map<T, S>> &v)
DEFINE_ITER_OUTPUT(s, v, '\n')
/* </rab:include(debug.hpp)> */
signed main() {
if (debug)
cerr << "MOD: " << (MOD)ln;
if (!debug) {
cin.tie(0);
ios::sync_with_stdio(0);
}
cout << fixed << setprecision(20);
cerr << fixed << setprecision(20);
solve();
return 0;
}
/* </rab:include(base.hpp)> */
/* <rab:include(consts.hpp)> */
/* 方向: 真上から時計回り */
int di4[] = {-1, 0, 1, 0}, dj4[] = {0, 1, 0, -1};
int di8[] = {-1, -1, 0, 1, 1, 1, 0, -1},
dj8[] = {0, 1, 1, 1, 0, -1, -1, -1, -1};
int di_knight[] = {-2, -1, 1, 2, 2, 1, -1, -2},
dj_knight[] = {1, 2, 2, 1, -1, -2, -2, -1};
namespace dict {
/* \b(\w+)\[\]=\"(?!\1) */
[[maybe_unused]] constexpr char YES[] = "YES", Yes[] = "Yes", yes[] = "yes",
NO[] = "NO", No[] = "No", no[] = "no",
WIN[] = "WIN", Win[] = "Win", win[] = "win",
LOSE[] = "LOSE", Lose[] = "Lose",
lose[] = "lose", OK[] = "OK", ok[] = "ok",
NG[] = "NG", ng[] = "ng", NA[] = "NA",
na[] = "na", AC[] = "AC", ac[] = "ac",
WA[] = "WA", wa[] = "wa", PRIME[] = "PRIME",
Prime[] = "Prime", prime[] = "prime",
NOT_PRIME[] = "NOT PRIME",
Not_Prime[] = "Not Prime",
not_prime[] = "not prime", ALICE[] = "ALICE",
Alice[] = "Alice", alice[] = "alice",
BROWN[] = "BROWN", Brown[] = "Brown",
brown[] = "brown", BOB[] = "BOB", Bob[] = "Bob",
bob[] = "bob", SAME[] = "SAME", Same[] = "Same",
same[] = "same", DIFFERENT[] = "DIFFERENT",
Different[] = "Different",
different[] = "different",
TAKAHASHI[] = "TAKAHASHI",
Takahashi[] = "Takahashi",
takahashi[] = "takahashi", AOKI[] = "AOKI",
Aoki[] = "Aoki", aoki[] = "aoki";
} // namespace dict
/* </rab:include(consts.hpp)> */
void solve() {
// ABC
/* <foxy.memo-area> */
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
/* </foxy.memo-area> */
cout << (A == B && B == C ? dict::YES : dict::NO) ln;
}
/* <rab:gen/> */ | /* <rab:include(base.hpp)> */
#pragma GCC optimize("O3")
void solve(); /* この関数に問題ごとの処理を書く */
#if defined(EBUG) && !defined(ONLINE_JUDGE)
#define debug true
#else
#define NDEBUG /* <cassert>のincludeより前に定義する必要がある */
#define debug false
#endif
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#ifdef __cpp_lib_execution
#include <execution>
#endif
#include <cassert>
#include <cstdio>
#include <cstdlib>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define int LL /* 標準ライブラリのincludeが終わってから書き換える */
#define times(n, i) uptil(0, n, i)
#define rtimes(n, i) downto((n)-1, 0, i)
#define upto(f, t, i) \
for (auto rab_base_dest = (t), i = decltype(t)(f); i <= rab_base_dest; i++)
#define uptil(f, t, i) \
for (auto rab_base_dest = (t), i = decltype(t)(f); i < rab_base_dest; i++)
#define downto(f, t, i) \
for (auto rab_base_dest = decltype(f)(t), i = (f); i >= rab_base_dest; i--)
#define downtil(f, t, i) \
for (auto rab_base_dest = decltype(f)(t), i = (f); i > rab_base_dest; i--)
#define iter(v) begin(v), end(v)
#define citer(v) cbegin(v), cend(v)
#if debug
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 2
#define _LIBCPP_DEBUG2 2
#define ln << endl
#else
#define ln << '\n'
#endif
#define tb << '\t'
#define sp << ' '
#ifdef __cpp_lib_execution
#if debug
#define PARABLE execution::par_unseq,
#else
#define PARABLE execution::seq,
#endif
#else
#define PARABLE /* none */
#endif
#define CS const
#define CX constexpr
#define IL inline
#define RT return
#define TL template
#define TN typename
#define lambda [&]
/* <rab:include(typedefs.hpp)> */
struct unit {};
using int128 = __int128;
using LD = long double;
TL<TN T> using vec = vector<T>;
TL<TN T> using vvec = vec<vec<T>>;
TL<TN T> using vvvec = vec<vvec<T>>;
TL<TN T> using vvvvec = vec<vvvec<T>>;
/* @rab:typedefs:dynamic */
/* </rab:include(typedefs.hpp)> */
/* <rab:include(alias.hpp)> */
#define MP make_pair
#define MU make_unique
#define PB push_back
#define UP unique_ptr
#define foldl accumulate
#define scanl partial_sum
/* </rab:include(alias.hpp)> */
TL<TN T> IL bool amax(T &v, CS T &a) { RT v < a && (v = a, true); }
TL<TN T> IL bool amin(T &v, CS T &a) { RT v > a && (v = a, true); }
namespace kpl {
template <class V, class W> static IL void append(V &v, const W &w) {
copy(PARABLE citer(w), back_inserter(v));
}
template <class V>
static IL auto flatten(const V &xss, unsigned reserve_size = 0)
-> vector<decltype(*begin(*begin(xss)))> {
decltype(flatten(xss)) ret;
ret.reserve(reserve_size);
for (const auto &xs : xss)
append(ret, xs);
ret.shrink_to_fit();
return move(ret);
}
template <class I> static inline bool is_in(I x, I l, I r) {
return l <= x && x < r;
}
} // namespace kpl
/* <rab:include(util.hpp)> */
#ifndef __cpp_lib_exchange_function
// #define __cpp_lib_exchange_function 201304L
#define exchange exchange_RAB
TL<class T, class U = T> T exchange(T &t, U &&u) {
T ret = move(t);
t = forward<U>(u);
RT ret;
}
#endif
#ifndef __cpp_lib_clamp
// #define __cpp_lib_clamp 201603L
#define clamp clamp_RAB
TL<class T> CX CS T &clamp(CS T &a, CS T &mn, CS T &mx) {
RT a<mn ? mn : a> mx ? mx : a;
}
#endif
template <class V> void uniq_after_sort(V &v) {
v.erase(unique(iter(v)), v.end());
}
template <class V> void sort_and_uniq(V &v) {
sort(iter(v));
v.erase(unique(iter(v)), v.end());
}
/* </rab:include(util.hpp)> */
/* <rab:include(mod.hpp)> */
#ifdef MOD
#if !defined(FORCE_MOD) && MOD != 1000000007 && MOD != 1000000009 && \
MOD != 998244353
#error unknown mod MOD; if you really want to use (MOD) as mod, define FORCE_MOD.
#endif
#else
#define MOD 1000000007
#endif
/* <rab:include(power.hpp)> */
TL<class T> T power(T x, int n) {
T rt(1);
for (; n; n /= 2) {
if (n % 2)
rt *= x;
x *= x;
}
RT rt;
}
int pow_mod(int x, int n, int m) {
int rt = 1;
for (; n; n /= 2) {
if (n % 2)
rt = rt * x % m;
x = x * x % m;
}
RT rt;
}
int pow_mod_64(int128 x, int n, int m) {
int128 rt = 1;
for (; n; n /= 2) {
if (n % 2)
rt = rt * x % m;
x = x * x % m;
}
RT rt;
}
/* </rab:include(power.hpp)> */
IL CX int modulo(int a, int m) { RT(a %= m, a >= 0 ? a : a + m); }
TL<ULL mod = MOD> class MInt {
/*
int with modulo.
// `mod` must be a prime for `log`.
`mod` must be coprime to `val` for `inv` and to `m.val` for `operator/` and
`operator/=`.
*/
/*! https://ei1333.github.io/luzhiled/snippets/other/mod-int.html */
public:
int val;
CX MInt() : val(0) {}
explicit CX MInt(int v) : val(modulo(v, mod)) {}
MInt &operator+=(CS MInt &m) {
val += m.val;
if (val >= mod)
val -= mod;
RT *this;
}
MInt &operator-=(CS MInt &m) {
val -= m.val;
if (val < 0)
val += mod;
RT *this;
}
MInt &operator*=(CS MInt &m) {
val = val * m.val % mod;
RT *this;
}
MInt &operator/=(CS MInt &m) {
val = val * m.inv().val % mod;
RT *this;
}
MInt operator+(CS MInt &m) CS { RT MInt(*this) += m; }
MInt operator-(CS MInt &m) CS { RT MInt(*this) -= m; }
MInt operator*(CS MInt &m) CS { RT MInt(*this) *= m; }
MInt operator/(CS MInt &m) CS { RT MInt(*this) /= m; }
MInt operator-() CS {
MInt m;
m.val = val ? mod - val : 0;
RT m;
}
bool operator==(CS MInt &m) CS { RT val == m.val; }
bool operator!=(CS MInt &m) CS { RT val != m.val; }
// MInt pow(int n)CS{MInt x(*this),rt(1);while(n){if(n%2)rt*=x;x*=x;n/=2;}RT
// rt;}
MInt pow(int n) CS { RT power(*this, n); }
MInt inv() CS {
int a = val, b = mod, x = 1, y = 0, t;
while (b) {
t = a / b;
swap(b, a -= t * b);
swap(y, x -= t * y);
}
RT(MInt) x;
}
friend ostream &operator<<(ostream &o, CS MInt<mod> &m) { RT o << m.val; }
friend istream &operator>>(istream &i, MInt<mod> &m) {
int v;
i >> v;
m = MInt<mod>(v);
RT i;
}
};
using mint = MInt<>;
constexpr mint operator"" _m(ULL n) { RT mint(n); }
constexpr MInt<998244353> operator"" _m998244353(ULL n) {
RT MInt<998244353>(n);
}
constexpr MInt<1000000007> operator"" _m1e9_7(ULL n) { RT MInt<1000000007>(n); }
constexpr MInt<1000000009> operator"" _m1e9_9(ULL n) { RT MInt<1000000009>(n); }
////#pragma rab:gsub \b(\d+)m\b mint(\1)
/* </rab:include(mod.hpp)> */
/* <rab:include(debug.hpp)> */
TL<class T> IL istream &operator>>(istream &s, vec<T> &v) {
for (auto &&p : v)
s >> p;
RT s;
}
TL<class T, class S> IL ostream &operator<<(ostream &s, CS pair<T, S> &p) {
RT s << "(" << p.first << "," << p.second << ")";
}
TL<class T> IL ostream &operator<<(ostream &, CS vec<T> &);
TL<class T, class S> IL ostream &operator<<(ostream &, CS map<T, S> &);
#define DEFINE_ITER_OUTPUT(s, x, sep) \
{ \
int i = 0; \
for (CS auto &x##0_elem : x) { \
if (i++) \
s << sep; \
s << x##0_elem; \
} \
RT s; \
}
TL<class T> IL ostream &operator<<(ostream &s, CS vec<T> &v)
DEFINE_ITER_OUTPUT(s, v, ' ') TL<class T, class S> IL ostream &
operator<<(ostream &s, CS map<T, S> &m)
DEFINE_ITER_OUTPUT(s, m, ' ') TL<class T> IL ostream &
operator<<(ostream &s, CS vec<vec<T>> &w)
DEFINE_ITER_OUTPUT(s, w, '\n') TL<class T, class S> IL ostream &
operator<<(ostream &s, CS vec<map<T, S>> &v)
DEFINE_ITER_OUTPUT(s, v, '\n')
/* </rab:include(debug.hpp)> */
signed main() {
if (debug)
cerr << "MOD: " << (MOD)ln;
if (!debug) {
cin.tie(0);
ios::sync_with_stdio(0);
}
cout << fixed << setprecision(20);
cerr << fixed << setprecision(20);
solve();
return 0;
}
/* </rab:include(base.hpp)> */
/* <rab:include(consts.hpp)> */
/* 方向: 真上から時計回り */
int di4[] = {-1, 0, 1, 0}, dj4[] = {0, 1, 0, -1};
int di8[] = {-1, -1, 0, 1, 1, 1, 0, -1},
dj8[] = {0, 1, 1, 1, 0, -1, -1, -1, -1};
int di_knight[] = {-2, -1, 1, 2, 2, 1, -1, -2},
dj_knight[] = {1, 2, 2, 1, -1, -2, -2, -1};
namespace dict {
/* \b(\w+)\[\]=\"(?!\1) */
[[maybe_unused]] constexpr char YES[] = "YES", Yes[] = "Yes", yes[] = "yes",
NO[] = "NO", No[] = "No", no[] = "no",
WIN[] = "WIN", Win[] = "Win", win[] = "win",
LOSE[] = "LOSE", Lose[] = "Lose",
lose[] = "lose", OK[] = "OK", ok[] = "ok",
NG[] = "NG", ng[] = "ng", NA[] = "NA",
na[] = "na", AC[] = "AC", ac[] = "ac",
WA[] = "WA", wa[] = "wa", PRIME[] = "PRIME",
Prime[] = "Prime", prime[] = "prime",
NOT_PRIME[] = "NOT PRIME",
Not_Prime[] = "Not Prime",
not_prime[] = "not prime", ALICE[] = "ALICE",
Alice[] = "Alice", alice[] = "alice",
BROWN[] = "BROWN", Brown[] = "Brown",
brown[] = "brown", BOB[] = "BOB", Bob[] = "Bob",
bob[] = "bob", SAME[] = "SAME", Same[] = "Same",
same[] = "same", DIFFERENT[] = "DIFFERENT",
Different[] = "Different",
different[] = "different",
TAKAHASHI[] = "TAKAHASHI",
Takahashi[] = "Takahashi",
takahashi[] = "takahashi", AOKI[] = "AOKI",
Aoki[] = "Aoki", aoki[] = "aoki";
} // namespace dict
/* </rab:include(consts.hpp)> */
void solve() {
// ABC
/* <foxy.memo-area> */
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
/* </foxy.memo-area> */
cout << (A == B && B == C ? dict::Yes : dict::No) ln;
}
/* <rab:gen/> */ | [
"identifier.change",
"io.output.change"
] | 895,098 | 895,099 | u032223772 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,102 | 895,103 | u317918118 | cpp |
p03079 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
string ans;
cin >> a >> b >> c;
ans = "No";
if (a == b == c) {
ans = "Yes";
}
cout << ans << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
string ans;
cin >> a >> b >> c;
ans = "No";
if (a == b && a == c) {
ans = "Yes";
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 895,104 | 895,105 | u365928729 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b || b == c || a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,116 | 895,117 | u348914050 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b || b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && a == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,118 | 895,117 | u348914050 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep0(i, b, s) for (int i = b; i < s; i++)
typedef long long ll;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep0(i, b, s) for (int i = b; i < s; i++)
typedef long long ll;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 895,125 | 895,126 | u738835924 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 895,129 | 895,130 | u352152495 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 895,132 | 895,130 | u352152495 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A = B = C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 895,139 | 895,140 | u170628605 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 895,146 | 895,147 | u587364000 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 895,148 | 895,147 | u587364000 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && A == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 895,152 | 895,153 | u768838833 | cpp |
p03079 | #import <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && A == C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 895,154 | 895,153 | u768838833 | cpp |
p03079 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "YES" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,155 | 895,156 | u386907894 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b || a != c || b != c) {
cout << "NO";
return 0;
}
cout << "YES";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b || a != c || b != c) {
cout << "No";
return 0;
}
cout << "Yes";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,157 | 895,158 | u314693739 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B) {
if (B == C) {
cout << "Yes";
}
} else
cout << "No";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << "Yes";
} else
cout << "No";
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 895,163 | 895,164 | u464725395 | cpp |
p03079 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,177 | 895,178 | u929996201 | cpp |
p03079 | #include <iostream>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,182 | 895,178 | u929996201 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b || b == c || c == a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 895,192 | 895,193 | u255412750 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b || b == c || c == a) {
cout << 'Yes' << endl;
} else {
cout << 'No' << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 895,194 | 895,193 | u255412750 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.