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 <iostream>
int main() {
uint64_t a, b, c, d, e, n;
std::cin >> n >> a >> b >> c >> d >> e;
uint64_t min = std::min(a, b);
min = std::min(min, c);
min = std::min(min, d);
min = std::min(min, e);
uint64_t time = 0;
if (min >= n)
time = 1;
else if (n % 2 == 0)
time = n / min;
else
time = n / min + 1;
time += 4;
std::cout << time << std::endl;
return 0;
}
| #include <iostream>
int main() {
uint64_t a, b, c, d, e, n;
std::cin >> n >> a >> b >> c >> d >> e;
uint64_t min = std::min(a, b);
min = std::min(min, c);
min = std::min(min, d);
min = std::min(min, e);
uint64_t time = 0;
if (min >= n)
time = 1;
else if (n % min == 0)
time = n / min;
else
time = n / min + 1;
time += 4;
std::cout << time << std::endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 893,975 | 893,976 | u100825466 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long p[5];
long long minp;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> p[i];
if (i == 0)
minp = p[i];
else
minp = min(minp, p[i]);
}
if (N % minp == 0) {
cout << 5 + (long long)(N / minp) << endl;
} else {
cout << 5 + (long long)(N / minp) + 1 << endl;
}
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long p[5];
long long minp;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> p[i];
if (i == 0)
minp = p[i];
else
minp = min(minp, p[i]);
}
if (N % minp == 0) {
cout << 5 + (long long)(N / minp) - 1 << endl;
} else {
cout << 5 + (long long)(N / minp) << endl;
}
} | [
"expression.operation.binary.remove"
] | 893,986 | 893,987 | u119477929 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b, c, d, e, mi, ans;
cin >> n >> a >> b >> c >> d >> e;
mi = min(a, min(b, min(c, min(d, e))));
ans = 5 + n / mi;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b, c, d, e, mi, ans;
cin >> n >> a >> b >> c >> d >> e;
mi = min(a, min(b, min(c, min(d, e))));
ans = 5 + (n - 1) / mi;
cout << ans << endl;
} | [] | 893,990 | 893,991 | u916256067 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1LL << 60;
constexpr int Inf = 1e9;
inline int in() {
int x;
cin >> x;
return x;
}
template <typename T> inline void out(const T &x) { cout << x << endl; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// UP = 0;RIGHT = 1; DOWN = 2; LEFT =3;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
if (a < b)
gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
void eratos(bool *isPrime, int max) {
fill(isPrime, isPrime + max, true);
isPrime[0] = false;
isPrime[1] = false;
for (int i = 2; i <= max / i; ++i)
if (isPrime[i])
for (int j = 2; j <= max / i; ++j)
isPrime[i * j] = false;
}
//
signed main() {
ios();
int N;
int a[5];
cin >> N;
rep(i, 5) cin >> a[i];
sort(a, a + 5);
int ans = N / a[0] + 5;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1LL << 60;
constexpr int Inf = 1e9;
inline int in() {
int x;
cin >> x;
return x;
}
template <typename T> inline void out(const T &x) { cout << x << endl; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// UP = 0;RIGHT = 1; DOWN = 2; LEFT =3;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
if (a < b)
gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
void eratos(bool *isPrime, int max) {
fill(isPrime, isPrime + max, true);
isPrime[0] = false;
isPrime[1] = false;
for (int i = 2; i <= max / i; ++i)
if (isPrime[i])
for (int j = 2; j <= max / i; ++j)
isPrime[i * j] = false;
}
//
signed main() {
ios();
int N;
int a[5];
cin >> N;
rep(i, 5) cin >> a[i];
sort(a, a + 5);
int ans = (N - 1) / a[0] + 5;
cout << ans << endl;
}
| [] | 893,998 | 893,999 | u904833081 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, Amin = -1;
cin >> N;
for (int i = 0; i < 5; i++) {
long long temp;
cin >> temp;
if (Amin == -1 || temp < Amin) {
Amin = temp;
}
}
long long ans = 0;
if (Amin < N) {
ans = N / Amin + 5;
} else {
ans = 5;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, Amin = -1;
cin >> N;
for (int i = 0; i < 5; i++) {
long long temp;
cin >> temp;
if (Amin == -1 || temp < Amin) {
Amin = temp;
}
}
long long ans = 0;
if (Amin < N) {
ans = (N - 1) / Amin + 5;
} else {
ans = 5;
}
cout << ans << endl;
return 0;
}
| [] | 894,000 | 894,001 | u426449570 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
long long int N, A, B, C, D, E;
vector<long long int> city;
int main(void) {
cin >> N >> A >> B >> C >> D >> E;
city.push_back(A);
city.push_back(B);
city.push_back(C);
city.push_back(D);
city.push_back(E);
long long int min = *min_element(city.begin(), city.end());
cout << 5 + (long long int)(N / min) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long int N, A, B, C, D, E;
vector<long long int> city;
int main(void) {
cin >> N >> A >> B >> C >> D >> E;
city.push_back(A);
city.push_back(B);
city.push_back(C);
city.push_back(D);
city.push_back(E);
long long int min = *min_element(city.begin(), city.end());
cout << 5 + (long long int)((N - 1) / min) << endl;
return 0;
}
| [] | 894,006 | 894,007 | u793136026 | cpp |
p03077 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> using vv = vector<V<T>>;
template <class T> using VV = vector<V<T>>;
#define fi first
#define se second
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (ll i = (ll)(b)-1; i >= a; --i)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define eb(val) emplace_back(val)
const double PI = acos(-1);
const double EPS = 1e-10;
const ll MOD = 1e9 + 7;
void cioacc() { // accelerate cin/cout
cin.tie(0);
ios::sync_with_stdio(false);
}
signed main() {
ll n;
cin >> n;
ll a[5];
REP(i, 5) cin >> a[i];
ll mn = 1e16;
REP(i, 5) { mins(mn, a[i]); }
ll ans = 5;
ans += (n - mn + 1) / mn;
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> using vv = vector<V<T>>;
template <class T> using VV = vector<V<T>>;
#define fi first
#define se second
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (ll i = (ll)(b)-1; i >= a; --i)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define eb(val) emplace_back(val)
const double PI = acos(-1);
const double EPS = 1e-10;
const ll MOD = 1e9 + 7;
void cioacc() { // accelerate cin/cout
cin.tie(0);
ios::sync_with_stdio(false);
}
signed main() {
ll n;
cin >> n;
ll a[5];
REP(i, 5) cin >> a[i];
ll mn = 1e16;
REP(i, 5) { mins(mn, a[i]); }
ll ans = 4;
ans += (n + mn - 1) / mn;
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove",
"assignment.change"
] | 894,008 | 894,009 | u949798495 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
int main() {
ll n;
cin >> n;
vll a(5);
REP(i, 5) cin >> a[i];
VSORT(a);
ll ans = 5 + n / a[0];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
int main() {
ll n;
cin >> n;
vll a(5);
REP(i, 5) cin >> a[i];
VSORT(a);
ll ans = 5 + (n - 1) / a[0];
cout << ans << endl;
return 0;
} | [] | 894,010 | 894,011 | u986276444 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N;
vector<long long int> cap(5);
cin >> N;
for (auto &c : cap)
cin >> c;
if (N == 0) {
cout << 0 << endl;
return 0;
}
int minimum = *min_element(cap.begin(), cap.end());
cout << 5 + N / minimum << endl;
;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N;
vector<long long int> cap(5);
cin >> N;
for (auto &c : cap)
cin >> c;
if (N == 0) {
cout << 0 << endl;
return 0;
}
long long int minimum = *min_element(cap.begin(), cap.end());
cout << 5 + (N - 1) / minimum << endl;
;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 894,016 | 894,015 | u050706842 | cpp |
p03077 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using ld = long double;
const ll INF = 1e18;
const ld eps = 1e-9, pi = acos(-1.0);
int main() {
ll n;
ll a[5];
cin >> n;
REP(i, 5) cin >> a[i];
sort(a, a + 5);
cout << n / a[0] + 5 << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using ld = long double;
const ll INF = 1e18;
const ld eps = 1e-9, pi = acos(-1.0);
int main() {
ll n;
ll a[5];
cin >> n;
REP(i, 5) cin >> a[i];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5 << endl;
return 0;
} | [] | 894,021 | 894,022 | u199808440 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N;
long long X[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> X[i];
}
sort(X, X + 5, greater<long long>());
long long S;
S = N / X[4];
long long goukei;
goukei = S + 5;
cout << goukei;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N;
long long X[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> X[i];
}
sort(X, X + 5, greater<long long>());
long long S;
S = (N - 1) / X[4];
long long goukei;
goukei = S + 5;
cout << goukei;
return 0;
}
| [] | 894,027 | 894,028 | u573019226 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
int min_index = 0;
long long trans[5], min, N;
cin >> N >> trans[0];
min = trans[0];
for (int i = 1; i < 5; i++) {
cin >> trans[i];
if (min > trans[i]) {
min = trans[i];
}
}
cout << N / min + 5;
} | #include <iostream>
using namespace std;
int main() {
int min_index = 0;
long long trans[5], min, N;
cin >> N >> trans[0];
min = trans[0];
for (int i = 1; i < 5; i++) {
cin >> trans[i];
if (min > trans[i]) {
min = trans[i];
}
}
cout << (N - 1) / min + 5;
} | [] | 894,029 | 894,030 | u554988565 | cpp |
p03077 | //#define DEB1 //output check function
//#define DEB2 //same output, input from input.txt
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <vector>
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define INF(a) memset(a, 0x3f, sizeof(a))
#define ALL(t) (t).begin(), (t).end()
#define FILL(a, c) fill(a, a + sizeof(a) / sizeof(*a), c)
#define FILL2D(A, c) fill(A[0], A[0] + sizeof(A) / sizeof(**A), c)
#define FILL3D(A, c) fill(A[0][0], A[0][0] + sizeof(A) / sizeof(***A), c)
#define REP(i, m) for (int i = 0; i < (m); ++i)
#define REPN(i, m, in) for (int i = (in); i < (m); ++i)
#define IN(a, x, b) (a <= x && x < b)
#define PB push_back
using namespace std;
using LL = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<LL, LL>;
using VI = vector<int>;
using VVI = vector<VI>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#ifdef DEB1
#define DPRINT(x) cout << #x << "=" << (x) << endl; // print at debug mode
#else
#define DPRINT(x) ;
#endif
#ifdef DEB1
#define DCHECK(x) cout << "debug check" << #x << endl;
#else
#define DCHECK(x) ;
#endif
/*
constant values
*/
// const int dx[] = {1,0,-1,0};
// const int dy[] = {0,1,0,-1};
// const int MX = 31001;
// const ll INF= 1LL<<60 ;//INF = 1001001001001; //1e9
// Main program
void solve() {
LL N, tmp;
LL A[5];
cin >> N >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
tmp = A[0];
REP(i, 4) { chmin(tmp, A[i + 1]); }
cout << (N + 1) / tmp + 4 << endl;
}
// ----------------------------------------------
int main() {
#ifdef DEB2
cout << "DEBUG MODE" << endl;
ifstream in("input.txt"); // for debug
cin.rdbuf(in.rdbuf()); // for debug
#endif
int T = 1;
for (int i = 0; i < T; ++i) {
solve();
}
} | //#define DEB1 //output check function
//#define DEB2 //same output, input from input.txt
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <vector>
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define INF(a) memset(a, 0x3f, sizeof(a))
#define ALL(t) (t).begin(), (t).end()
#define FILL(a, c) fill(a, a + sizeof(a) / sizeof(*a), c)
#define FILL2D(A, c) fill(A[0], A[0] + sizeof(A) / sizeof(**A), c)
#define FILL3D(A, c) fill(A[0][0], A[0][0] + sizeof(A) / sizeof(***A), c)
#define REP(i, m) for (int i = 0; i < (m); ++i)
#define REPN(i, m, in) for (int i = (in); i < (m); ++i)
#define IN(a, x, b) (a <= x && x < b)
#define PB push_back
using namespace std;
using LL = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<LL, LL>;
using VI = vector<int>;
using VVI = vector<VI>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#ifdef DEB1
#define DPRINT(x) cout << #x << "=" << (x) << endl; // print at debug mode
#else
#define DPRINT(x) ;
#endif
#ifdef DEB1
#define DCHECK(x) cout << "debug check" << #x << endl;
#else
#define DCHECK(x) ;
#endif
/*
constant values
*/
// const int dx[] = {1,0,-1,0};
// const int dy[] = {0,1,0,-1};
// const int MX = 31001;
// const ll INF= 1LL<<60 ;//INF = 1001001001001; //1e9
// Main program
void solve() {
LL N, tmp;
LL A[5];
cin >> N >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
tmp = A[0];
REP(i, 4) { chmin(tmp, A[i + 1]); }
cout << (N + tmp - 1) / tmp + 4 << endl;
}
// ----------------------------------------------
int main() {
#ifdef DEB2
cout << "DEBUG MODE" << endl;
ifstream in("input.txt"); // for debug
cin.rdbuf(in.rdbuf()); // for debug
#endif
int T = 1;
for (int i = 0; i < T; ++i) {
solve();
}
} | [
"expression.operation.binary.add"
] | 894,037 | 894,038 | u495072453 | cpp |
p03077 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
vector<long long> v(5, 0);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int nannka = 0;
if (N % v[0] != 0) {
N -= N % v[0];
nannka++;
;
}
ans = N / v[0] + 5;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
vector<long long> v(5, 0);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int nannka = 0;
if (N % v[0] != 0) {
N -= N % v[0];
nannka++;
;
}
ans = N / v[0] + 4 + nannka;
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 894,039 | 894,040 | u468862268 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 10000000000000000;
int main() {
ll n;
cin >> n;
ll a[5];
ll les = INF;
for (int i = 0; i < 5; i++) {
cin >> a[i];
les = min(les, a[i]);
}
cout << n / les + 5 << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 10000000000000000;
int main() {
ll n;
cin >> n;
ll a[5];
ll les = INF;
for (int i = 0; i < 5; i++) {
cin >> a[i];
les = min(les, a[i]);
}
cout << (n - 1) / les + 5 << endl;
} | [] | 894,050 | 894,051 | u681557252 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long n, a[5], minn, necknum, ans;
int main(void) {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
minn = a[i];
else
minn = min(minn, a[i]);
}
necknum = (n + minn) / minn;
ans = 5 + (necknum - 1);
cout << ans << "\n";
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long n, a[5], minn, necknum, ans;
int main(void) {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
minn = a[i];
else
minn = min(minn, a[i]);
}
necknum = (n + minn - 1) / minn;
ans = 5 + (necknum - 1);
cout << ans << "\n";
return 0;
} | [
"assignment.change"
] | 894,054 | 894,055 | u217596176 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const int INF = 1e9;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
ll a[10], n;
std::cin >> n;
rep(i, 5) std::cin >> a[i];
sort(a, a + 5);
std::cout << 5 + n / a[0] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const int INF = 1e9;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
ll a[10], n;
std::cin >> n;
rep(i, 5) std::cin >> a[i];
sort(a, a + 5);
std::cout << 5 + (n - 1) / a[0] << '\n';
return 0;
}
| [] | 894,064 | 894,065 | u863279562 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
vector<int> v(5, 0);
for (auto &&x : v)
cin >> x;
int a = v[0];
for (auto &&x : v)
a = min(a, x);
// cout<<a;
cout << 5 + n / a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
vector<int> v(5, 0);
for (auto &&x : v)
cin >> x;
int a = v[0];
for (auto &&x : v)
a = min(a, x);
// cout<<a;
cout << 5 + (n - 1) / a << endl;
}
| [] | 894,066 | 894,067 | u731175398 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i;
long long n;
long long temp;
vector<long long> list;
cin >> n;
for (i = 0; i < 5; i++) {
cin >> temp;
list.push_back(temp);
}
sort(list.begin(), list.end());
if (n / list[0] <= 1) {
cout << 5;
} else {
if (n % list[0] == 0) {
cout << n / list[0] - 1 + 5;
} else {
cout << n / list[0] + 1 - 1 + 5;
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i;
long long n;
long long temp;
vector<long long> list;
cin >> n;
for (i = 0; i < 5; i++) {
cin >> temp;
list.push_back(temp);
}
sort(list.begin(), list.end());
if (n / list[0] < 1) {
cout << 5;
} else {
if (n % list[0] == 0) {
cout << n / list[0] - 1 + 5;
} else {
cout << n / list[0] + 1 - 1 + 5;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 894,079 | 894,080 | u875367173 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long> cap(5);
long n;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> cap.at(i);
}
vector<long>::iterator minIt = min_element(cap.begin(), cap.end());
int minIdx = distance(cap.begin(), minIt);
long min = cap.at(minIdx);
int ans = 4 + n / min;
if (n % min != 0) {
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long> cap(5);
long n;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> cap.at(i);
}
vector<long>::iterator minIt = min_element(cap.begin(), cap.end());
int minIdx = distance(cap.begin(), minIt);
long min = cap.at(minIdx);
long ans = 4 + n / min;
if (n % min != 0) {
ans++;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 894,085 | 894,086 | u461393490 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, int B) { return (A + (B - 1)) / B; }
long long divCeil(int A, long long B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, long long B) { return (A + (B - 1)) / B; }
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long m = min(min(min(min(A, B), C), D), E);
long long t = 5 + N / m;
cout << t << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, int B) { return (A + (B - 1)) / B; }
long long divCeil(int A, long long B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, long long B) { return (A + (B - 1)) / B; }
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long m = min(min(min(min(A, B), C), D), E);
long long t = 5 + divCeil(N, m) - 1;
cout << t << endl;
} | [
"call.add",
"expression.operation.binary.change",
"assignment.change"
] | 894,087 | 894,088 | u811472478 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long long> cp(5);
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> cp[i];
}
sort(cp.begin(), cp.end());
cout << (N + cp[0]) / cp[0] + (5 - 1) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long long> cp(5);
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> cp[i];
}
sort(cp.begin(), cp.end());
cout << (N + cp[0] - 1) / cp[0] + (5 - 1) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 894,097 | 894,098 | u736339585 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long> cp(5);
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> cp[i];
}
sort(cp.begin(), cp.end());
cout << (N + cp[0]) / cp[0] + (5 - 1) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long long> cp(5);
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> cp[i];
}
sort(cp.begin(), cp.end());
cout << (N + cp[0] - 1) / cp[0] + (5 - 1) << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 894,099 | 894,098 | u736339585 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[5];
long long int min = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
min = a[i];
if (a[i] < min) {
min = a[i];
}
}
long long int r = 0;
if (n / min == 0)
r = n / min;
else
r = n / min + 1;
cout << r + 4;
} | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[5];
long long int min = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
min = a[i];
if (a[i] < min) {
min = a[i];
}
}
long long int r = 0;
if (n % min == 0)
r = n / min;
else
r = n / min + 1;
cout << r + 4;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 894,106 | 894,107 | u875377810 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define repr(i, b, e) for (int(i) = (b)-1; (i) >= (e); --(i))
#define print(x) cout << (x) << endl
#define min2(a, b) ((a) < (b)) ? (a) : (b)
#define max2(a, b) ((a) > (b)) ? (a) : (b)
#define count counting_variable
typedef long long ll;
using namespace std;
int main() {
unsigned long long N, A[5], mincap = 0;
cin >> N;
rep(i, 0, 5) cin >> A[i];
rep(i, 0, 5) {
if (A[i] < A[mincap])
mincap = i;
}
print((N / A[mincap] + 5));
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define repr(i, b, e) for (int(i) = (b)-1; (i) >= (e); --(i))
#define print(x) cout << (x) << endl
#define min2(a, b) ((a) < (b)) ? (a) : (b)
#define max2(a, b) ((a) > (b)) ? (a) : (b)
#define count counting_variable
typedef long long ll;
using namespace std;
int main() {
unsigned long long N, A[5], mincap = 0;
cin >> N;
rep(i, 0, 5) cin >> A[i];
rep(i, 0, 5) {
if (A[i] < A[mincap])
mincap = i;
}
print(((N - 1) / A[mincap] + 5));
return 0;
} | [
"call.arguments.change"
] | 894,116 | 894,117 | u569690172 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
// long long double N;
long long m[6];
// cin >> N;
long long i;
long long ans = 0;
long long min;
for (i = 0; i < 6; i++) {
cin >> m[i];
}
sort(m + 1, m + 6);
ans += 5 + m[0] / m[1];
if (m[0] == m[1]) {
ans--;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
// long long double N;
long long m[6];
// cin >> N;
long long i;
long long ans = 0;
long long min;
for (i = 0; i < 6; i++) {
cin >> m[i];
}
sort(m + 1, m + 6);
ans += 5 + m[0] / m[1];
if (m[0] % m[1] == 0) {
ans--;
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 894,118 | 894,119 | u586244382 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf = 1.01e9;
const i64 inf64 = 4.01e18;
const double eps = 1e-9;
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T, size_t size> void fill(T (&ary)[size], const T &val) {
fill_n((T *)ary, size, val);
}
void solve() {
// const i64 mod = 1'000'000'007;
i64 N;
vector<i64> v(5);
cin >> N;
rep(i, 0, 5) cin >> v[i];
i64 mi = *min_element(begin(v), end(v));
cout << N / mi + 5 << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf = 1.01e9;
const i64 inf64 = 4.01e18;
const double eps = 1e-9;
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T, size_t size> void fill(T (&ary)[size], const T &val) {
fill_n((T *)ary, size, val);
}
void solve() {
// const i64 mod = 1'000'000'007;
i64 N;
vector<i64> v(5);
cin >> N;
rep(i, 0, 5) cin >> v[i];
i64 mi = *min_element(begin(v), end(v));
cout << (N - 1) / mi + 5 << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
return 0;
}
| [] | 894,120 | 894,121 | u759266806 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1918;
// vi v1[200005],v2;
// bool visit[200005]={false};
/*void bfs(ll n){
queue<ll> q;
q.push(n);
visit[n]=true;
while(!q.empty()){
ll t=q.front();
q.pop();
v2.pb(t);
for(ll i=0;i<v1[t].size();i++){
if(visit[v1[t][i]]==false){
q.push(v1[t][i]);
visit[v1[t][i]]=true;
}
}
}
}*/
/*void dfs(ll n){
for(ll i=0;i<v1[n].size();i++)
{
ll y=v1[n][i];
if(visit[y]==0)
{
v2.pb(y);
visit[y]=1;
dfs(y);
}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, e, k, i, x = 0, p, y = 0, ans = 0, m = 0;
cin >> n;
ll a[5];
for (i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
m = a[i];
else if (m >= a[i]) {
y = i;
m = a[i];
}
}
// cout<<y<<" "<<m<<endl;
if (y == 4 || y == 0 || m == a[0] || m == a[4]) {
if (n % m == 0)
ans += n / m;
else
ans += n / m + 1;
cout << ans + 4;
return 0;
}
i = 0;
while (y != i) {
i++;
ans++;
}
x = 5 - y - 1;
if (n % m == 0)
ans += n / m;
ans += n / m + 1;
cout << ans + x;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1918;
// vi v1[200005],v2;
// bool visit[200005]={false};
/*void bfs(ll n){
queue<ll> q;
q.push(n);
visit[n]=true;
while(!q.empty()){
ll t=q.front();
q.pop();
v2.pb(t);
for(ll i=0;i<v1[t].size();i++){
if(visit[v1[t][i]]==false){
q.push(v1[t][i]);
visit[v1[t][i]]=true;
}
}
}
}*/
/*void dfs(ll n){
for(ll i=0;i<v1[n].size();i++)
{
ll y=v1[n][i];
if(visit[y]==0)
{
v2.pb(y);
visit[y]=1;
dfs(y);
}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, e, k, i, x = 0, p, y = 0, ans = 0, m = 0;
cin >> n;
ll a[5];
for (i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
m = a[i];
else if (m >= a[i]) {
y = i;
m = a[i];
}
}
// cout<<y<<" "<<m<<endl;
if (y == 4 || y == 0 || m == a[0] || m == a[4]) {
if (n % m == 0)
ans += n / m;
else
ans += n / m + 1;
cout << ans + 4;
return 0;
}
i = 0;
while (y != i) {
i++;
ans++;
}
x = 5 - y - 1;
if (n % m == 0)
ans += n / m;
else
ans += n / m + 1;
cout << ans + x;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 894,131 | 894,132 | u415518175 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
ll n, res = 5, x[5], mi = 999;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> x[i];
mi = min(mi, x[i]);
}
if (mi >= n) {
} else {
n -= mi;
res += ceil(n / (double)mi);
}
cout << res << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
ll n, res = 5, x[5], mi = 1000000000000001;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> x[i];
mi = min(mi, x[i]);
}
if (mi >= n) {
} else {
n -= mi;
res += ceil(n / (double)mi);
}
cout << res << endl;
}
int main() {
solve();
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 894,135 | 894,136 | u679071005 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
ll n, res = 5;
int x[5], mi = 999;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> x[i];
mi = min(mi, x[i]);
}
if (mi >= n) {
} else {
n -= mi;
res += ceil(n / (double)mi);
}
cout << res << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
ll n, res = 5, x[5], mi = 1000000000000001;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> x[i];
mi = min(mi, x[i]);
}
if (mi >= n) {
} else {
n -= mi;
res += ceil(n / (double)mi);
}
cout << res << endl;
}
int main() {
solve();
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 894,137 | 894,136 | u679071005 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; i++)
#define FOR(i, k, n) for (signed i = k; i < n; i++)
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "No") << endl
#define pr(r) cout << r << endl
#define min(x, y) (x < y) ? x : y
#define max(x, y) (x > y) ? x : y
#define ll long long
int main(void) {
ll n, a[5], i;
cin >> n;
rep(i, 5) cin >> a[i];
sort(a, a + 5);
ll r = 4 + n / a[0] + 1;
if (n / a[0] == 0)
r--;
pr(r);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; i++)
#define FOR(i, k, n) for (signed i = k; i < n; i++)
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "No") << endl
#define pr(r) cout << r << endl
#define min(x, y) (x < y) ? x : y
#define max(x, y) (x > y) ? x : y
#define ll long long
int main(void) {
ll n, a[5], i;
cin >> n;
rep(i, 5) cin >> a[i];
sort(a, a + 5);
ll r = 5 + n / a[0];
if (n % a[0] == 0)
r--;
pr(r);
} | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 894,142 | 894,143 | u222965004 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int x, y, z, w;
x = min(a, b);
y = min(c, d);
z = min(x, y);
w = min(e, z);
int t = 0;
if (n % w == 0) {
t += n / w;
}
else if (n % w > 0) {
t += n / w + 1;
}
cout << t + 4 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long x, y, z, w;
x = min(a, b);
y = min(c, d);
z = min(x, y);
w = min(e, z);
long long t = 0;
if (n % w == 0) {
t += n / w;
}
else if (n % w > 0) {
t += n / w + 1;
}
cout << t + 4 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,150 | 894,151 | u979163294 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
vector<long long> val(5);
long long x = 0;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> val[i];
}
x = n / (*min_element(val.begin(), val.end())) + 5;
// cout << *min_element(val.begin(), val.end()) << endl;
cout << x << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
vector<long long> val(5);
long long x = 0;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> val[i];
}
x = (n - 1) / (*min_element(val.begin(), val.end())) + 5;
// cout << *min_element(val.begin(), val.end()) << endl;
cout << x << endl;
} | [] | 894,162 | 894,163 | u227764848 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main() {
ll n, a[5];
cin >> n;
REP(i, 5) cin >> a[i];
ll mn = INF, mn_i;
REP(i, 5) {
if (mn > a[i]) {
mn = a[i];
mn_i = i;
}
}
cout << mn_i + ((n % a[mn_i] == 0) ? n / a[mn_i] : n / a[mn_i]) + 1 + 4 - mn_i
<< endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main() {
ll n, a[5];
cin >> n;
REP(i, 5) cin >> a[i];
ll mn = INF, mn_i;
REP(i, 5) {
if (mn > a[i]) {
mn = a[i];
mn_i = i;
}
}
cout << mn_i + ((n % a[mn_i] == 0) ? n / a[mn_i] : n / a[mn_i] + 1) + 4 - mn_i
<< endl;
} | [] | 894,184 | 894,185 | u711985352 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
#define inf 1e15 + 1
using namespace std;
signed main() {
IOS;
int n, a, mi = inf, t[6], c[7] = {0}, i, ans = 0;
cin >> n;
for (i = 1; i <= 5; i++) {
cin >> a;
t[i] = mi = min(a, mi);
}
ans = (n / mi + 1) + 4;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
#define inf 1e15 + 1
using namespace std;
signed main() {
IOS;
int n, a, mi = inf, t[6], c[7] = {0}, i, ans = 0;
cin >> n;
for (i = 1; i <= 5; i++) {
cin >> a;
t[i] = mi = min(a, mi);
}
ans = (n + mi - 1) / mi + 4;
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 894,194 | 894,195 | u762703573 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; i < (n); i++)
#define rrep(i, n) for (int(i) = 1; i <= (n); i++)
#define REP(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define MOD 1000000007
#define INF 1e18
#define int long long
#define endl "\n"
#define yorn(f) puts((f) ? "Yes" : "No")
#define YORN(f) puts((f) ? "YES" : "NO")
typedef long long ll;
typedef pair<int, int> P;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; };
int lcm(int a, int b) { return a / gcd(a, b) * b; };
int mod(int a, int b) { return (a + b - 1) / b; };
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
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 x, y, z, k;
int a[1010], b[1010], c[1010];
signed main() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(15);
cin >> x >> y >> z >> k;
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(a, a + x, greater<>());
sort(b, b + y, greater<>());
sort(c, c + z, greater<>());
vector<int> sum;
rep(i, x) {
rep(j, y) {
rep(l, z) {
if ((i + 1) * (j + 1) * (l + 1) > k)
break;
sum.push_back(a[i] + b[j] + c[l]);
}
}
}
sort(all(sum), greater<>());
rep(i, sum.size()) cout << sum[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; i < (n); i++)
#define rrep(i, n) for (int(i) = 1; i <= (n); i++)
#define REP(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define MOD 1000000007
#define INF 1e18
#define int long long
#define endl "\n"
#define yorn(f) puts((f) ? "Yes" : "No")
#define YORN(f) puts((f) ? "YES" : "NO")
typedef long long ll;
typedef pair<int, int> P;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; };
int lcm(int a, int b) { return a / gcd(a, b) * b; };
int mod(int a, int b) { return (a + b - 1) / b; };
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
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 x, y, z, k;
int a[1010], b[1010], c[1010];
signed main() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(15);
cin >> x >> y >> z >> k;
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(a, a + x, greater<>());
sort(b, b + y, greater<>());
sort(c, c + z, greater<>());
vector<int> sum;
rep(i, x) {
rep(j, y) {
rep(l, z) {
if ((i + 1) * (j + 1) * (l + 1) > k)
break;
sum.push_back(a[i] + b[j] + c[l]);
}
}
}
sort(all(sum), greater<>());
rep(i, k) cout << sum[i] << endl;
return 0;
} | [
"call.arguments.change",
"expression.operation.binary.change",
"call.remove"
] | 894,199 | 894,200 | u681869152 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 1e5 + 23;
long long a[N], b[N], c[N];
void solve() {
int x, y, z, K;
scanf("%d%d%d%d", &x, &y, &z, &K);
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);
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
vector<long long> v;
for (int i = 0; i < x; ++i) {
for (int j = 0; j < y; ++j) {
for (int k = 0; k < z; ++k) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
v.push_back(a[i] + b[j] + c[j]);
}
}
}
sort(v.begin(), v.end(), greater<long long>());
for (int i = 0; i < K; ++i)
printf("%lld\n", v[i]);
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 1e5 + 23;
long long a[N], b[N], c[N];
void solve() {
int x, y, z, K;
scanf("%d%d%d%d", &x, &y, &z, &K);
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);
sort(a, a + x, greater<long long>());
sort(b, b + y, greater<long long>());
sort(c, c + z, greater<long long>());
vector<long long> v;
for (int i = 0; i < x; ++i) {
for (int j = 0; j < y; ++j) {
for (int k = 0; k < z; ++k) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
v.push_back(a[i] + b[j] + c[k]);
}
}
}
sort(v.begin(), v.end(), greater<long long>());
for (int i = 0; i < K; ++i)
printf("%lld\n", v[i]);
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,218 | 894,219 | u953463534 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
vector<ll> AB;
rep(i, X) rep(j, Y) AB.push_back(A[i] + B[j]);
sort(AB.rbegin(), AB.rend());
vector<ll> ABC;
rep(i, min(K, (int)AB.size())) rep(j, Z) ABC.push_back(AB[i] + C[j]);
sort(ABC.rbegin(), ABC.rend());
rep(i, K) cout << ABC[i];
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
vector<ll> AB;
rep(i, X) rep(j, Y) AB.push_back(A[i] + B[j]);
sort(AB.rbegin(), AB.rend());
vector<ll> ABC;
rep(i, min(K, (int)AB.size())) rep(j, Z) ABC.push_back(AB[i] + C[j]);
sort(ABC.rbegin(), ABC.rend());
rep(i, K) cout << ABC[i] << endl;
return 0;
} | [
"io.output.newline.add"
] | 894,220 | 894,221 | u702118111 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) { cin >> a[i]; }
rep(i, y) { cin >> b[i]; }
rep(i, z) { cin >> c[i]; }
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
vector<ll> e;
rep(i, x) rep(j, y) { e.push_back(a[i] + b[j]); }
sort(e.rbegin(), e.rend());
vector<int> ans;
int n = min((ll)e.size(), k);
// a+bの大きい方からk個とcの組み合わせを全探索し
//その中から大きいものｋ個が答え
rep(i, n) rep(j, z) { ans.push_back(e[i] + c[j]); }
sort(ans.rbegin(), ans.rend());
rep(i, k) cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) { cin >> a[i]; }
rep(i, y) { cin >> b[i]; }
rep(i, z) { cin >> c[i]; }
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
vector<ll> e;
rep(i, x) rep(j, y) { e.push_back(a[i] + b[j]); }
sort(e.rbegin(), e.rend());
vector<ll> ans;
int n = min((ll)e.size(), k);
// a+bの大きい方からk個とcの組み合わせを全探索し
//その中から大きいものｋ個が答え
rep(i, n) rep(j, z) { ans.push_back(e[i] + c[j]); }
sort(ans.rbegin(), ans.rend());
rep(i, k) cout << ans[i] << endl;
} | [] | 894,222 | 894,223 | u489823438 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) { cin >> a[i]; }
rep(i, y) { cin >> b[i]; }
rep(i, z) { cin >> c[i]; }
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
vector<ll> e;
rep(i, x) rep(j, y) { e.push_back(a[i] + b[j]); }
sort(e.rbegin(), e.rend());
vector<int> ans;
int n = min((ll)e.size(), k);
// a+bの大きい方からk個とcの組み合わせを全探索し
//その中から大きいものｋ個が答え
rep(i, k) rep(j, z) { ans.push_back(e[i] + c[j]); }
sort(ans.rbegin(), ans.rend());
rep(i, k) cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) { cin >> a[i]; }
rep(i, y) { cin >> b[i]; }
rep(i, z) { cin >> c[i]; }
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
vector<ll> e;
rep(i, x) rep(j, y) { e.push_back(a[i] + b[j]); }
sort(e.rbegin(), e.rend());
vector<ll> ans;
int n = min((ll)e.size(), k);
// a+bの大きい方からk個とcの組み合わせを全探索し
//その中から大きいものｋ個が答え
rep(i, n) rep(j, z) { ans.push_back(e[i] + c[j]); }
sort(ans.rbegin(), ans.rend());
rep(i, k) cout << ans[i] << endl;
} | [
"identifier.change",
"call.arguments.change"
] | 894,224 | 894,223 | u489823438 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
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<int> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vector<ll> sum;
rep(i, x) rep(j, y) { sum.push_back(a[i] + b[j]); }
sort(sum.rbegin(), sum.rend());
vector<ll> ans;
rep(i, min(k, x + y)) {
rep(j, z) { ans.push_back(sum[i] + c[j]); }
}
sort(ans.rbegin(), ans.rend());
rep(i, k) cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
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> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vector<ll> sum;
rep(i, x) rep(j, y) { sum.push_back(a[i] + b[j]); }
sort(sum.rbegin(), sum.rend());
vector<ll> ans;
rep(i, min(k, x * y)) {
rep(j, z) { ans.push_back(sum[i] + c[j]); }
}
sort(ans.rbegin(), ans.rend());
rep(i, k) cout << ans[i] << endl;
} | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,227 | 894,226 | u754114382 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1006;
int X, Y, Z, K;
int A[MAX_N], B[MAX_N], C[MAX_N];
void solve() {
sort(A, A + X, greater<int>());
sort(B, B + Y, greater<int>());
sort(C, C + Z, greater<int>());
vector<ll> v;
for (int i = 0; i < X; ++i)
for (int j = 0; j < Y; ++j) {
v.push_back(A[i] + B[j]);
}
sort(v.rbegin(), v.rend());
vector<ll> ans;
for (int i = 0; i < min((int)v.size(), K); ++i) {
for (int j = 0; j < Z; ++j)
ans.push_back(v[i] + C[j]);
}
sort(ans.rbegin(), ans.rend());
for (int i = 0; i < K; ++i)
cout << ans[i] << '\n';
}
int main() {
cin >> X >> Y >> Z >> K;
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];
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1006;
int X, Y, Z, K;
ll A[MAX_N], B[MAX_N], C[MAX_N];
void solve() {
sort(A, A + X, greater<ll>());
sort(B, B + Y, greater<ll>());
sort(C, C + Z, greater<ll>());
vector<ll> v;
for (int i = 0; i < X; ++i)
for (int j = 0; j < Y; ++j) {
v.push_back(A[i] + B[j]);
}
sort(v.rbegin(), v.rend());
vector<ll> ans;
for (int i = 0; i < min((int)v.size(), K); ++i) {
for (int j = 0; j < Z; ++j)
ans.push_back(v[i] + C[j]);
}
sort(ans.rbegin(), ans.rend());
for (int i = 0; i < K; ++i)
cout << ans[i] << '\n';
}
int main() {
cin >> X >> Y >> Z >> K;
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];
solve();
return 0;
} | [
"variable_declaration.type.change",
"call.arguments.change"
] | 894,232 | 894,233 | u570770016 | 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);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
vector<long long> B(Y);
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
vector<long long> C(Z);
for (int i = 0; i < Z; i++) {
cin >> C[i];
}
vector<long long> S1;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
S1.push_back(A[i] + B[j]);
}
}
sort(S1.begin(), S1.end());
reverse(S1.begin(), S1.begin());
vector<long long> S2;
for (int i = 0; i < min((int)S1.size(), K); i++) {
for (int j = 0; j < Z; j++) {
S2.push_back(S1[i] + C[j]);
}
}
sort(S2.begin(), S2.end());
reverse(S2.begin(), S2.end());
for (int i = 0; i < K; i++) {
cout << S2[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);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
vector<long long> B(Y);
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
vector<long long> C(Z);
for (int i = 0; i < Z; i++) {
cin >> C[i];
}
vector<long long> S1;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
S1.push_back(A[i] + B[j]);
}
}
sort(S1.begin(), S1.end());
reverse(S1.begin(), S1.end());
vector<long long> S2;
for (int i = 0; i < min((int)S1.size(), K); i++) {
for (int j = 0; j < Z; j++) {
S2.push_back(S1[i] + C[j]);
}
}
sort(S2.begin(), S2.end());
reverse(S2.begin(), S2.end());
for (int i = 0; i < K; i++) {
cout << S2[i] << endl;
}
} | [
"call.function.change",
"call.arguments.change"
] | 894,244 | 894,245 | u424374375 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> C(Z);
vector<ll> D;
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.begin(), A.end(), greater<int>());
sort(B.begin(), B.end(), greater<int>());
sort(C.begin(), C.end(), greater<int>());
for (int i = 0; i < min(K, X); i++) {
for (int j = 0; j < min(K, Y); j++) {
D.push_back(A[i] + B[j]);
}
}
sort(D.begin(), D.end(), greater<int>());
vector<ll> E;
for (int i = 0; i < min((ll)(D.size()), K); i++) {
E.push_back(D[i]);
}
vector<ll> ans;
for (int i = 0; i < min((ll)(E.size()), K); i++) {
for (int j = 0; j < Z; j++) {
ans.push_back(E[i] + C[j]);
}
}
sort(ans.begin(), ans.end(), greater<int>());
for (int i = 0; i < K; i++) {
cout << ans[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> C(Z);
vector<ll> D;
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.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
for (int i = 0; i < min(K, X); i++) {
for (int j = 0; j < min(K, Y); j++) {
D.push_back(A[i] + B[j]);
}
}
sort(D.begin(), D.end(), greater<ll>());
vector<ll> E;
for (int i = 0; i < min((ll)(D.size()), K); i++) {
E.push_back(D[i]);
}
vector<ll> ans;
for (int i = 0; i < min((ll)(E.size()), K); i++) {
for (int j = 0; j < Z; j++) {
ans.push_back(E[i] + C[j]);
}
}
sort(ans.begin(), ans.end(), greater<ll>());
for (int i = 0; i < K; i++) {
cout << ans[i] << endl;
}
return 0;
} | [
"call.arguments.change"
] | 894,255 | 894,256 | u083494782 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout << n << "\n"
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> P;
typedef pair<string, int> Psi;
vector<ll> A(1010), B(1010), C(1010);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x, y, z, k;
cin >> x >> y >> z >> k;
rep(i, x) { cin >> A[i]; }
rep(i, y) { cin >> B[i]; }
rep(i, z) { cin >> C[i]; }
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
vector<ll> ans;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
for (int l = 0; l < z; l++) {
if ((i + 1) + (j + 1) + (l + 1) > k)
break;
ans.push_back(A[i] + B[j] + C[l]);
}
}
}
sort(ans.begin(), ans.end(), greater<ll>());
rep(i, k) { writeln(ans[i]); }
}
| #include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout << n << "\n"
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> P;
typedef pair<string, int> Psi;
vector<ll> A(1010), B(1010), C(1010);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x, y, z, k;
cin >> x >> y >> z >> k;
rep(i, x) { cin >> A[i]; }
rep(i, y) { cin >> B[i]; }
rep(i, z) { cin >> C[i]; }
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
vector<ll> ans;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
for (int l = 0; l < z; l++) {
if ((i + 1) * (j + 1) * (l + 1) > k)
break;
ans.push_back(A[i] + B[j] + C[l]);
}
}
}
sort(ans.begin(), ans.end(), greater<ll>());
rep(i, k) { writeln(ans[i]); }
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 894,266 | 894,267 | u020238108 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 58;
// aを常に小さい値にする 大きい値にする
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
// 二分探索 前方のindexを返すもの（自分自身を含む） 前方: -INF側のこと
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() -
1; // upper_bound : keyより大きい要素の内の一番左側のイテレータを返す
}
// 二分探索 後方のindexを返すもの（自分自身を含む）後方: INF側のこと
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) -
v.begin(); // lower_bound :
// key以上の要素の内の一番左側のイテレータを返す
}
// 最大公約数を求める GCD
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
using Data = pair<ll, vector<int>>;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
sort(A.begin(), A.end(), greater<int>());
sort(B.begin(), B.end(), greater<int>());
sort(C.begin(), C.end(), greater<int>());
priority_queue<Data> que;
set<Data>
se; // 同じ組み合わせが使われないように使ったものは集合として保存していく
Data insert;
insert = make_pair(A[0] + B[0] + C[0], vector<int>({0, 0, 0}));
que.push(insert);
rep(i, K) {
// 出力
auto c = que.top();
que.pop();
cout << c.first << endl;
// 次の三候補をpush
// A のみ index を 1 個進めて足したもの
if (c.second[0] + 1 < X) {
ll sum = c.first - A[c.second[0]] + A[c.second[0] + 1];
auto num = c.second;
num[0]++;
auto d = Data(sum, num);
// すでに push されたもの以外
if (!se.count(d))
se.insert(d), que.push(d);
}
// B のみ index を 1 個進めて足したもの
if (c.second[1] + 1 < Y) {
ll sum = c.first - B[c.second[1]] + B[c.second[1] + 1];
auto num = c.second;
num[1]++;
auto d = Data(sum, num);
// すでに push されたもの以外
if (!se.count(d))
se.insert(d), que.push(d);
}
// C のみ index を 1 個進めて足したもの
if (c.second[2] + 1 < Z) {
ll sum = c.first - C[c.second[2]] + C[c.second[2] + 1];
auto num = c.second;
num[2]++;
auto d = Data(sum, num);
// すでに push されたもの以外
if (!se.count(d))
se.insert(d), que.push(d);
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 58;
// aを常に小さい値にする 大きい値にする
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
// 二分探索 前方のindexを返すもの（自分自身を含む） 前方: -INF側のこと
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() -
1; // upper_bound : keyより大きい要素の内の一番左側のイテレータを返す
}
// 二分探索 後方のindexを返すもの（自分自身を含む）後方: INF側のこと
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) -
v.begin(); // lower_bound :
// key以上の要素の内の一番左側のイテレータを返す
}
// 最大公約数を求める GCD
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
using Data = pair<ll, vector<int>>;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
priority_queue<Data> que;
set<Data>
se; // 同じ組み合わせが使われないように使ったものは集合として保存していく
Data insert;
insert = make_pair(A[0] + B[0] + C[0], vector<int>({0, 0, 0}));
que.push(insert);
rep(i, K) {
// 出力
auto c = que.top();
que.pop();
cout << c.first << endl;
// 次の三候補をpush
// A のみ index を 1 個進めて足したもの
if (c.second[0] + 1 < X) {
ll sum = c.first - A[c.second[0]] + A[c.second[0] + 1];
auto num = c.second;
num[0]++;
auto d = Data(sum, num);
// すでに push されたもの以外
if (!se.count(d))
se.insert(d), que.push(d);
}
// B のみ index を 1 個進めて足したもの
if (c.second[1] + 1 < Y) {
ll sum = c.first - B[c.second[1]] + B[c.second[1] + 1];
auto num = c.second;
num[1]++;
auto d = Data(sum, num);
// すでに push されたもの以外
if (!se.count(d))
se.insert(d), que.push(d);
}
// C のみ index を 1 個進めて足したもの
if (c.second[2] + 1 < Z) {
ll sum = c.first - C[c.second[2]] + C[c.second[2] + 1];
auto num = c.second;
num[2]++;
auto d = Data(sum, num);
// すでに push されたもの以外
if (!se.count(d))
se.insert(d), que.push(d);
}
}
} | [
"variable_declaration.type.change",
"call.arguments.change"
] | 894,270 | 894,271 | u067267880 | cpp |
p03078 | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
constexpr int MAX = 1010;
using ll = long long int;
using T = std::tuple<ll, int, int, int>;
ll a[MAX], b[MAX], c[MAX];
std::set<T> used;
std::priority_queue<T> que;
int dx[] = {1, 0, 0}, dy[] = {0, 1, 0}, dz[] = {0, 0, 1};
int main() {
int x, y, z, k;
std::cin >> x >> y >> z >> k;
for (int i = 0; i < x; ++i)
std::cin >> a[i];
for (int i = 0; i < y; ++i)
std::cin >> b[i];
for (int i = 0; i < z; ++i)
std::cin >> c[i];
std::sort(a, a + x, std::greater<>());
std::sort(b, b + y, std::greater<>());
std::sort(c, c + z, std::greater<>());
que.emplace(a[0] + b[0] + c[0], 0, 0, 0);
for (int i = 0; i < k; ++i) {
int t, X, Y, Z;
std::tie(t, X, Y, Z) = que.top();
que.pop();
std::cout << t << std::endl;
for (int j = 0; j < 3; ++j) {
int xx = X + dx[j], yy = Y + dy[j], zz = Z + dz[j];
if (xx == x || yy == y || zz == z)
continue;
int tt = a[xx] + b[yy] + c[zz];
if (used.count(T(tt, xx, yy, zz)))
continue;
que.emplace(tt, xx, yy, zz);
used.emplace(tt, xx, yy, zz);
}
}
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
constexpr int MAX = 1010;
using ll = long long int;
using T = std::tuple<ll, int, int, int>;
ll a[MAX], b[MAX], c[MAX];
std::set<T> used;
std::priority_queue<T> que;
int dx[] = {1, 0, 0}, dy[] = {0, 1, 0}, dz[] = {0, 0, 1};
int main() {
int x, y, z, k;
std::cin >> x >> y >> z >> k;
for (int i = 0; i < x; ++i)
std::cin >> a[i];
for (int i = 0; i < y; ++i)
std::cin >> b[i];
for (int i = 0; i < z; ++i)
std::cin >> c[i];
std::sort(a, a + x, std::greater<>());
std::sort(b, b + y, std::greater<>());
std::sort(c, c + z, std::greater<>());
que.emplace(a[0] + b[0] + c[0], 0, 0, 0);
for (int i = 0; i < k; ++i) {
int X, Y, Z;
ll t;
std::tie(t, X, Y, Z) = que.top();
que.pop();
std::cout << t << std::endl;
for (int j = 0; j < 3; ++j) {
int xx = X + dx[j], yy = Y + dy[j], zz = Z + dz[j];
if (xx == x || yy == y || zz == z)
continue;
ll tt = a[xx] + b[yy] + c[zz];
if (used.count(T(tt, xx, yy, zz)))
continue;
que.emplace(tt, xx, yy, zz);
used.emplace(tt, xx, yy, zz);
}
}
return 0;
} | [
"variable_declaration.remove",
"variable_declaration.add",
"variable_declaration.type.change"
] | 894,272 | 894,273 | u332570575 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << var << std::endl
#define pp(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
/*-----8<-----8<-----*/
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> a(X, 0), b(Y, 0), c(Z, 0);
rep(i, X) cin >> a[i];
rep(i, Y) cin >> b[i];
rep(i, Z) cin >> c[i];
// nth_element(a.begin(), a.begin() + K-1, a.end(), greater<ll>());
// nth_element(b.begin(), b.begin() + K-1, b.end(), greater<ll>());
// nth_element(c.begin(), c.begin() + K-1, c.end(), greater<ll>());
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> v;
rep(i, X) {
rep(j, Y) {
rep(k, Z) {
if ((i + 1) * (j + 1) * (k + 1) > K)
continue;
ll t = a[i] + b[j] + c[k];
v.pb(t);
pp(t);
}
}
}
// sort(all(a));
// nth_element(v.begin(), v.begin() + K-1, v.end(), greater<ll>());
// sort(v.begin(), v.end(), greater<ll>());
// cout << v.end()-v.begin() <<endl;
partial_sort(v.begin(), v.begin() + K, v.end(), greater<ll>());
// p("------");
rep(i, K) cout << v[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << var << std::endl
#define pp(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
/*-----8<-----8<-----*/
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> a(X, 0), b(Y, 0), c(Z, 0);
rep(i, X) cin >> a[i];
rep(i, Y) cin >> b[i];
rep(i, Z) cin >> c[i];
// nth_element(a.begin(), a.begin() + K-1, a.end(), greater<ll>());
// nth_element(b.begin(), b.begin() + K-1, b.end(), greater<ll>());
// nth_element(c.begin(), c.begin() + K-1, c.end(), greater<ll>());
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> v;
rep(i, X) {
rep(j, Y) {
rep(k, Z) {
if ((i + 1) * (j + 1) * (k + 1) > K)
continue;
ll t = a[i] + b[j] + c[k];
v.pb(t);
// pp(t);
}
}
}
// sort(all(a));
// nth_element(v.begin(), v.begin() + K-1, v.end(), greater<ll>());
// sort(v.begin(), v.end(), greater<ll>());
// cout << v.end()-v.begin() <<endl;
partial_sort(v.begin(), v.begin() + K, v.end(), greater<ll>());
// p("------");
rep(i, K) cout << v[i] << endl;
return 0;
}
| [
"call.remove"
] | 894,277 | 894,278 | u061071198 | cpp |
p03078 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
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 gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const ll INF = 1LL << 60;
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> ans;
rep(i, x) rep(j, y) {
if ((i + 1) * (j + 1) > K)
continue;
rep(k, z) {
if ((i + 1) * (j + 1) * (k + 1) > K)
continue;
ans.pb(a[i] + b[j] + c[k]);
}
}
sort(all(a), greater<ll>());
rep(i, K) std::cout << ans[i] << '\n';
}
| #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
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 gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const ll INF = 1LL << 60;
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> ans;
rep(i, x) rep(j, y) {
if ((i + 1) * (j + 1) > K)
break;
rep(k, z) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
ans.pb(a[i] + b[j] + c[k]);
}
}
sort(all(ans), greater<ll>());
rep(i, K) std::cout << ans[i] << '\n';
}
| [
"control_flow.continue.remove",
"control_flow.break.add",
"identifier.change",
"call.arguments.change"
] | 894,287 | 894,288 | u354567428 | cpp |
p03078 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
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 gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const ll INF = 1LL << 60;
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> ans;
rep(i, x) rep(j, y) {
if ((i + 1) * (j + 1) > K)
continue;
rep(k, z) {
if ((i + 1) * (j + 1) * (k + 1) > K)
continue;
ans.pb(a[i] + b[j] + c[k]);
}
}
sort(all(a), greater<ll>());
rep(i, K) std::cout << ans[i] << '\n';
}
| #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
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 gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const ll INF = 1LL << 60;
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(all(a), greater<ll>());
sort(all(b), greater<ll>());
sort(all(c), greater<ll>());
vector<ll> ans;
rep(i, x) rep(j, y) {
if ((i + 1) * (j + 1) > K)
continue;
rep(k, z) {
if ((i + 1) * (j + 1) * (k + 1) > K)
continue;
ans.pb(a[i] + b[j] + c[k]);
}
}
sort(all(ans), greater<ll>());
rep(i, K) std::cout << ans[i] << '\n';
}
| [
"identifier.change",
"call.arguments.change"
] | 894,287 | 894,289 | u354567428 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos(-1.0);
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;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
vector<ll> AB, nAB(K), ans;
rep(i, X) rep(j, Y) AB.pb(A[i] + B[j]);
sort(rall(AB));
rep(i, min(K, X * Y * Z)) nAB[i] = AB[i];
rep(i, min(K, X * Y * Z)) rep(j, Z) ans.pb(nAB[i] + C[j]);
sort(rall(ans));
rep(i, K) cout << ans[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos(-1.0);
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;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
vector<ll> AB, nAB(K), ans;
rep(i, X) rep(j, Y) AB.pb(A[i] + B[j]);
sort(rall(AB));
rep(i, min(K, X * Y)) nAB[i] = AB[i];
rep(i, min(K, X * Y * Z)) rep(j, Z) ans.pb(nAB[i] + C[j]);
sort(rall(ans));
rep(i, K) cout << ans[i] << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 894,298 | 894,299 | u502389123 | cpp |
p03078 | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
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(j, y) { cin >> b[j]; }
rep(l, z) { cin >> c[l]; }
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
sort(c.begin(), c.end(), greater<ll>());
priority_queue<ll> q;
rep(i, x) {
rep(j, y) {
int tmp_z = min(z, K / (i + 1) / (j + 1) - 1);
rep(l, tmp_z) { q.push(a[i] + b[j] + c[l]); }
}
}
rep(i, K) {
cout << q.top() << endl;
q.pop();
}
return 0;
} | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
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(j, y) { cin >> b[j]; }
rep(l, z) { cin >> c[l]; }
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
sort(c.begin(), c.end(), greater<ll>());
priority_queue<ll> q;
rep(i, x) {
rep(j, y) {
int tmp_z = min(z, K / (i + 1) / (j + 1));
rep(l, tmp_z) { q.push(a[i] + b[j] + c[l]); }
}
}
rep(i, K) {
cout << q.top() << endl;
q.pop();
}
return 0;
} | [
"expression.operation.binary.remove"
] | 894,302 | 894,303 | u247576416 | cpp |
p03078 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end(), greater<ll>())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool mini(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define y0 y3487465 // j0
#define y1 y1347829 // j1
#define INF2 4000000000000000037
#define INF 1000000007
#define PI (acos(-1))
#define MOD 1000000007
#define EPS 1e(-9);
using namespace std;
typedef long long ll;
void Main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> a, b, c, ab, abc;
rep(i, X) {
int aa;
cin >> aa;
a.emplace_back(aa);
}
rep(i, Y) {
int aa;
cin >> aa;
b.emplace_back(aa);
}
rep(i, Z) {
int aa;
cin >> aa;
c.emplace_back(aa);
}
SORT(a);
SORT(b);
SORT(c);
int ka = min(K, X);
int kb = min(K, Y);
rep(i, ka) {
rep(j, kb) { ab.emplace_back(a[i] + b[j]); }
}
SORT(ab);
int kab = min(K, X * Y);
int kc = min(K, Z);
rep(i, kab) {
rep(j, kc) { abc.emplace_back(ab[i] + c[j]); }
}
SORT(abc);
rep(i, K) { cout << abc[i] << "\n"; }
}
//-----------------------------------
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
//-----------------------------------
| #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end(), greater<ll>())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool mini(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define y0 y3487465 // j0
#define y1 y1347829 // j1
#define INF2 4000000000000000037
#define INF 1000000007
#define PI (acos(-1))
#define MOD 1000000007
#define EPS 1e(-9);
using namespace std;
typedef long long ll;
void Main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> a, b, c, ab, abc;
rep(i, X) {
ll aa;
cin >> aa;
a.emplace_back(aa);
}
rep(i, Y) {
ll aa;
cin >> aa;
b.emplace_back(aa);
}
rep(i, Z) {
ll aa;
cin >> aa;
c.emplace_back(aa);
}
SORT(a);
SORT(b);
SORT(c);
int ka = min(K, X);
int kb = min(K, Y);
rep(i, ka) {
rep(j, kb) { ab.emplace_back(a[i] + b[j]); }
}
SORT(ab);
int kab = min(K, X * Y);
int kc = min(K, Z);
rep(i, kab) {
rep(j, kc) { abc.emplace_back(ab[i] + c[j]); }
}
SORT(abc);
rep(i, K) { cout << abc[i] << "\n"; }
}
//-----------------------------------
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
//-----------------------------------
| [
"variable_declaration.type.change"
] | 894,306 | 894,307 | u556276145 | cpp |
p03078 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
int X, Y, Z, K;
vector<long long> A, B, C;
priority_queue<long long> Q;
int main() {
cin >> X >> Y >> Z >> K;
int i, j, k;
long long num;
A.assign(X, 0);
B.assign(Y, 0);
C.assign(Z, 0);
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];
}
sort(A.begin(), A.end(), greater<int>());
sort(B.begin(), B.end(), greater<int>());
sort(C.begin(), C.end(), greater<int>());
for (i = 0; i < X; i++) {
for (j = 0; j < Y; j++) {
for (k = 0; k < Z && (i + 1) * (j + 1) * (k + 1) <= K; k++) {
num = A[i] + B[j] + C[k];
Q.push(num);
}
}
}
for (i = 0; i < K; i++) {
cout << Q.top() << endl;
Q.pop();
}
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
int X, Y, Z, K;
vector<long long> A, B, C;
priority_queue<long long> Q;
int main() {
cin >> X >> Y >> Z >> K;
int i, j, k;
long long num;
A.assign(X, 0);
B.assign(Y, 0);
C.assign(Z, 0);
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];
}
sort(A.begin(), A.end(), greater<long long>());
sort(B.begin(), B.end(), greater<long long>());
sort(C.begin(), C.end(), greater<long long>());
for (i = 0; i < X; i++) {
for (j = 0; j < Y; j++) {
for (k = 0; k < Z && (i + 1) * (j + 1) * (k + 1) <= K; k++) {
num = A[i] + B[j] + C[k];
Q.push(num);
}
}
}
for (i = 0; i < K; i++) {
cout << Q.top() << endl;
Q.pop();
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,311 | 894,312 | u596430580 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
priority_queue<pair<ll, tuple<ll, ll, ll>>> q;
int x, y, z, k;
vector<ll> a;
vector<ll> b;
vector<ll> c;
unordered_set<ll> us;
int main() {
int d;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++) {
cin >> d;
a.push_back(d);
}
for (int i = 0; i < y; i++) {
cin >> d;
b.push_back(d);
}
for (int i = 0; i < z; i++) {
cin >> d;
c.push_back(d);
}
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
sort(c.begin(), c.end(), greater<ll>());
q.push(make_pair(a[0] + b[0] + c[0], make_tuple(0, 0, 0)));
tuple<ll, ll, ll> t;
long long uu;
for (int i = 0; i < k; i++) {
cout << q.top().first << endl;
ll xx = get<0>(q.top().second);
ll yy = get<1>(q.top().second);
ll zz = get<2>(q.top().second);
q.pop();
t = make_tuple(xx + 1, yy, zz);
uu = xx * 10e6 + (yy - 1) * 10e3 + zz - 1;
if (xx + 1 < x && us.find(uu) == us.end()) {
q.push(make_pair(a[xx + 1] + b[yy] + c[zz], t));
us.insert(uu);
}
t = make_tuple(xx, yy + 1, zz);
uu = (xx - 1) * 10e6 + yy * 10e3 + zz - 1;
if (yy + 1 < y && us.find(uu) == us.end()) {
q.push(make_pair(a[xx] + b[yy + 1] + c[zz], t));
us.insert(uu);
}
t = make_tuple(xx, yy, zz + 1);
uu = (xx - 1) * 10e6 + (yy - 1) * 10e3 + zz;
if (zz + 1 < z && us.find(uu) == us.end()) {
q.push(make_pair(a[xx] + b[yy] + c[zz + 1], t));
us.insert(uu);
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
priority_queue<pair<ll, tuple<ll, ll, ll>>> q;
ll x, y, z, k;
vector<ll> a;
vector<ll> b;
vector<ll> c;
unordered_set<ll> us;
int main() {
ll d;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++) {
cin >> d;
a.push_back(d);
}
for (int i = 0; i < y; i++) {
cin >> d;
b.push_back(d);
}
for (int i = 0; i < z; i++) {
cin >> d;
c.push_back(d);
}
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
sort(c.begin(), c.end(), greater<ll>());
q.push(make_pair(a[0] + b[0] + c[0], make_tuple(0, 0, 0)));
tuple<ll, ll, ll> t;
long long uu;
for (int i = 0; i < k; i++) {
cout << q.top().first << endl;
ll xx = get<0>(q.top().second);
ll yy = get<1>(q.top().second);
ll zz = get<2>(q.top().second);
q.pop();
t = make_tuple(xx + 1, yy, zz);
uu = xx * 10e6 + (yy - 1) * 10e3 + zz - 1;
if (xx + 1 < x && us.find(uu) == us.end()) {
q.push(make_pair(a[xx + 1] + b[yy] + c[zz], t));
us.insert(uu);
}
t = make_tuple(xx, yy + 1, zz);
uu = (xx - 1) * 10e6 + yy * 10e3 + zz - 1;
if (yy + 1 < y && us.find(uu) == us.end()) {
q.push(make_pair(a[xx] + b[yy + 1] + c[zz], t));
us.insert(uu);
}
t = make_tuple(xx, yy, zz + 1);
uu = (xx - 1) * 10e6 + (yy - 1) * 10e3 + zz;
if (zz + 1 < z && us.find(uu) == us.end()) {
q.push(make_pair(a[xx] + b[yy] + c[zz + 1], t));
us.insert(uu);
}
}
return 0;
} | [
"variable_declaration.type.change"
] | 894,332 | 894,333 | u705230587 | cpp |
p03078 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std::pair<int, int>
#define pli std::pair<ll, int>
#define pil std::pair<int, ll>
#define psi std::pair<string, int>
#define pll std::pair<ll, ll>
#define pci std::pair<char, int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define pb push_back
#define vll std::vector<ll>
#define vpi std::vector<std::pair<int, int>>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vvpil std::vector<std::vector<std::pair<int, ll>>>
#define vlpii std::vector<std::list<pii>>
#define vlpil std::vector<std::list<pil>>
#define li std::list<int>
#define lpil std::list<pil>
#define Endl printf("\n")
#define vli vector<list<int>>
#define vvll vector<vector<ll>>
#define mp make_pair
#define x first
#define y second
#define ull uint64_t
#define ma 100000000
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
const ll INF = 10000000000000;
const ll mod = 1e9 + 7;
const int MAX = 300005;
using namespace std;
void add(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
ll Pow(ll a, ll b) {
if (b == 0)
return 1;
ll c = Pow(a, b / 2);
if (b % 2)
return (a * ((c * c) % mod)) % mod;
return (c * c) % mod;
}
int N, M, Q;
ll parent[MAX], component_size[MAX], result[MAX];
int findRoot(int node) {
return parent[node] == node ? node : parent[node] = findRoot(parent[node]);
}
void UnionNodes(int x, int y) {
int rootX = findRoot(x);
int rootY = findRoot(y);
if (rootX == rootY)
return;
if (rand() & 1)
swap(rootX, rootY);
parent[rootY] = rootX;
component_size[rootX] += component_size[rootY];
component_size[rootY] = 0;
}
// check modulo
int main() {
IOS;
cout.precision(50);
int x, y, z, k;
cin >> x >> y >> z >> k;
vll a(x);
for (int i = 0; i < x; i++)
cin >> a[i];
vll b(y);
for (int i = 0; i < y; i++)
cin >> b[i];
vll c(z);
for (int i = 0; i < z; i++)
cin >> c[i];
vll d;
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++)
d.pb(a[i] + b[j]);
sort(d.rbegin(), d.rend());
sort(c.rbegin(), c.rend());
priority_queue<ll> ans;
for (int i = 0; i < min(k, (int)x * y); i++) {
for (int j = 0; j < z; j++)
ans.push(d[i] + c[j]);
}
while (ans.size()) {
cout << ans.top() << "\n";
ans.pop();
}
return 0;
}
| #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std::pair<int, int>
#define pli std::pair<ll, int>
#define pil std::pair<int, ll>
#define psi std::pair<string, int>
#define pll std::pair<ll, ll>
#define pci std::pair<char, int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define pb push_back
#define vll std::vector<ll>
#define vpi std::vector<std::pair<int, int>>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vvpil std::vector<std::vector<std::pair<int, ll>>>
#define vlpii std::vector<std::list<pii>>
#define vlpil std::vector<std::list<pil>>
#define li std::list<int>
#define lpil std::list<pil>
#define Endl printf("\n")
#define vli vector<list<int>>
#define vvll vector<vector<ll>>
#define mp make_pair
#define x first
#define y second
#define ull uint64_t
#define ma 100000000
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
const ll INF = 10000000000000;
const ll mod = 1e9 + 7;
const int MAX = 300005;
using namespace std;
void add(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
ll Pow(ll a, ll b) {
if (b == 0)
return 1;
ll c = Pow(a, b / 2);
if (b % 2)
return (a * ((c * c) % mod)) % mod;
return (c * c) % mod;
}
int N, M, Q;
ll parent[MAX], component_size[MAX], result[MAX];
int findRoot(int node) {
return parent[node] == node ? node : parent[node] = findRoot(parent[node]);
}
void UnionNodes(int x, int y) {
int rootX = findRoot(x);
int rootY = findRoot(y);
if (rootX == rootY)
return;
if (rand() & 1)
swap(rootX, rootY);
parent[rootY] = rootX;
component_size[rootX] += component_size[rootY];
component_size[rootY] = 0;
}
// check modulo
int main() {
IOS;
cout.precision(50);
int x, y, z, k;
cin >> x >> y >> z >> k;
vll a(x);
for (int i = 0; i < x; i++)
cin >> a[i];
vll b(y);
for (int i = 0; i < y; i++)
cin >> b[i];
vll c(z);
for (int i = 0; i < z; i++)
cin >> c[i];
vll d;
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++)
d.pb(a[i] + b[j]);
sort(d.rbegin(), d.rend());
sort(c.rbegin(), c.rend());
priority_queue<ll> ans;
for (int i = 0; i < min(k, (int)x * y); i++) {
for (int j = 0; j < z; j++)
ans.push(d[i] + c[j]);
}
while (k--) {
cout << ans.top() << "\n";
ans.pop();
}
return 0;
}
| [
"call.remove"
] | 894,337 | 894,338 | u752814744 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
#include "cpp-pyprint/pyprint.h"
#endif
void 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];
priority_queue<ll> queue;
rep(x, X) {
rep(y, Y) { queue.push(A[x] + B[y]); }
}
vector<ll> target;
ll tmp = min(K, X * Y);
while (target.size() != tmp) {
ll q = queue.top();
queue.pop();
target.push_back(q);
}
priority_queue<ll> ans;
rep(i, K) {
ll t = target[i];
rep(z, Z) { ans.push(C[z] + t); }
}
int cnt = 0;
while (cnt != K) {
cout << ans.top() << endl;
ans.pop();
cnt++;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
#include "cpp-pyprint/pyprint.h"
#endif
void 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];
priority_queue<ll> queue;
rep(x, X) {
rep(y, Y) { queue.push(A[x] + B[y]); }
}
vector<ll> target;
ll tmp = min(K, X * Y);
while (target.size() != tmp) {
ll q = queue.top();
queue.pop();
target.push_back(q);
}
priority_queue<ll> ans;
rep(i, tmp) {
ll t = target[i];
rep(z, Z) { ans.push(C[z] + t); }
}
int cnt = 0;
while (cnt != K) {
cout << ans.top() << endl;
ans.pop();
cnt++;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
| [] | 894,339 | 894,340 | u427344224 | cpp |
p03078 | /**
* Created by hiramekun at 20:07 on 2019-08-27.
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(obj) (obj).begin(), (obj).end()
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vl a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vl ab;
rep(i, x) rep(j, y) ab.emplace_back(a[i] + b[j]);
sort(all(ab), greater<>());
sort(all(c), greater<>());
vl ans;
rep(i, min(k, x * y)) rep(j, k) ans.emplace_back(ab[i] + c[j]);
sort(all(ans), greater<>());
rep(i, k) cout << ans[i] << '\n';
return 0;
} | /**
* Created by hiramekun at 20:07 on 2019-08-27.
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(obj) (obj).begin(), (obj).end()
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vl a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vl ab;
rep(i, x) rep(j, y) ab.emplace_back(a[i] + b[j]);
sort(all(ab), greater<>());
sort(all(c), greater<>());
vl ans;
rep(i, min(k, x * y)) rep(j, min(k, z)) ans.emplace_back(ab[i] + c[j]);
sort(all(ans), greater<>());
rep(i, k) cout << ans[i] << '\n';
return 0;
} | [
"call.add",
"call.arguments.add"
] | 894,350 | 894,351 | u136378781 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
long long X, Y, Z, K, A[1009], B[1009], C[1009];
vector<long long> vec;
int main() {
cin >> X >> Y >> Z >> K;
for (int i = 0; i < X; i++)
cin >> A[i];
sort(A, A + X, greater<long long>());
for (int i = 0; i < Y; i++)
cin >> B[i];
sort(B, B + Y, greater<long long>());
for (int i = 0; i < Z; i++)
cin >> C[i];
sort(C, C + Z, greater<long long>());
for (int i = 0; i <= K; i++) {
for (int j = 0; j <= K; j++) {
for (int k = 0; k <= K; k++) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
vec.push_back(A[i] + B[j] + C[k]);
else
break;
}
}
}
sort(vec.begin(), vec.end(), greater<long long>());
for (int i = 0; i < K; i++)
cout << vec[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long X, Y, Z, K, A[1009], B[1009], C[1009];
vector<long long> vec;
int main() {
cin >> X >> Y >> Z >> K;
for (int i = 0; i < X; i++)
cin >> A[i];
sort(A, A + X, greater<long long>());
for (int i = 0; i < Y; i++)
cin >> B[i];
sort(B, B + Y, greater<long long>());
for (int i = 0; i < Z; i++)
cin >> C[i];
sort(C, C + Z, greater<long long>());
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
vec.push_back(A[i] + B[j] + C[k]);
else
break;
}
}
}
sort(vec.begin(), vec.end(), greater<long long>());
for (int i = 0; i < K; i++)
cout << vec[i] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 894,352 | 894,353 | u832995587 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int> S, A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A.at(i);
}
for (int i = 0; i < Y; i++) {
cin >> B.at(i);
}
for (int i = 0; i < Z; i++) {
cin >> C.at(i);
}
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) <= K) {
S.push_back(A[i] + B[j] + C[k]);
} else {
break;
}
}
}
}
sort(S.rbegin(), S.rend());
for (int i = 0; i < K; i++) {
cout << S.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int64_t> S, A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A.at(i);
}
for (int i = 0; i < Y; i++) {
cin >> B.at(i);
}
for (int i = 0; i < Z; i++) {
cin >> C.at(i);
}
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) <= K) {
S.push_back(A[i] + B[j] + C[k]);
} else {
break;
}
}
}
}
sort(S.rbegin(), S.rend());
for (int i = 0; i < K; i++) {
cout << S.at(i) << endl;
}
} | [
"variable_declaration.type.primitive.change"
] | 894,360 | 894,361 | u170324846 | cpp |
p03078 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_D main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int MGN = 10;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using psi = pair<string, int>;
// functions
#endif
int main_D() {
cin.tie(0);
ios::sync_with_stdio(false);
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vl A(X);
REP(i, X) cin >> A[i];
vl B(Y);
REP(i, Y) cin >> B[i];
vl C(Z);
REP(i, Z) cin >> C[i];
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
vl ans;
REP(i, X) {
if ((i + 1) > K)
break;
REP(j, Y) {
if ((i + 1) + (j + 1) > K)
break;
REP(k, Z) {
if ((i + 1) + (j + 1) + (k + 1) > K)
break;
ans.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(ans.begin(), ans.end(), greater<ll>());
REP(i, K) cout << ans[i] << endl;
return 0;
} | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_D main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int MGN = 10;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using psi = pair<string, int>;
// functions
#endif
int main_D() {
cin.tie(0);
ios::sync_with_stdio(false);
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vl A(X);
REP(i, X) cin >> A[i];
vl B(Y);
REP(i, Y) cin >> B[i];
vl C(Z);
REP(i, Z) cin >> C[i];
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
sort(C.begin(), C.end(), greater<ll>());
vl ans;
REP(i, X) {
if ((i + 1) > K)
break;
REP(j, Y) {
if ((i + 1) * (j + 1) > K)
break;
REP(k, Z) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
ans.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(ans.begin(), ans.end(), greater<ll>());
REP(i, K) cout << ans[i] << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 894,362 | 894,363 | u404244809 | cpp |
p03078 | #include <algorithm>
#include <array>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int X, Y, Z, num;
cin >> X >> Y >> Z >> num;
array<long, 1001> cake1;
array<long, 1001> cake2;
array<long, 1001> cake3;
for (int i = 0; i < X; i++) {
cin >> cake1[i];
}
for (int i = 0; i < Y; i++) {
cin >> cake2[i];
}
for (int i = 0; i < Z; i++) {
cin >> cake3[i];
}
sort(cake1.begin(), cake1.begin() + X, greater<long>());
sort(cake2.begin(), cake2.begin() + Y, greater<long>());
sort(cake3.begin(), cake3.begin() + Z, greater<long>());
vector<long> v;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if (i * j * k <= k) {
v.push_back(cake1[i] + cake2[j] + cake3[k]);
} else {
break;
}
}
}
}
sort(v.begin(), v.end(), greater<long>());
for (int i = 0; i < num; i++) {
cout << v[i] << endl;
}
return 0;
} | #include <algorithm>
#include <array>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int X, Y, Z, num;
cin >> X >> Y >> Z >> num;
array<long, 1001> cake1;
array<long, 1001> cake2;
array<long, 1001> cake3;
for (int i = 0; i < X; i++) {
cin >> cake1[i];
}
for (int i = 0; i < Y; i++) {
cin >> cake2[i];
}
for (int i = 0; i < Z; i++) {
cin >> cake3[i];
}
sort(cake1.begin(), cake1.begin() + X, greater<long>());
sort(cake2.begin(), cake2.begin() + Y, greater<long>());
sort(cake3.begin(), cake3.begin() + Z, greater<long>());
vector<long> v;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if (i * j * k < num) {
v.push_back(cake1[i] + cake2[j] + cake3[k]);
} else {
break;
}
}
}
}
sort(v.begin(), v.end(), greater<long>());
for (int i = 0; i < num; i++) {
cout << v[i] << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 894,378 | 894,379 | u881705752 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], 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];
}
sort(A, A + X, greater<long long>());
sort(B, B + Y, greater<long long>());
sort(C, C + Z, greater<long long>());
priority_queue<tuple<long long, int, int, int>> que;
que.push(make_tuple(A[0] + B[0] + C[0], 0, 0, 0));
int k = min(X * Y * Z, 3000);
set<tuple<int, int, int>> used;
used.insert(make_tuple(0, 0, 0));
for (int i = 0; i < k; i++) {
auto q = que.top();
cout << get<0>(q) << endl;
int x = get<1>(q), y = get<2>(q), z = get<3>(q);
que.pop();
if (used.find(make_tuple(x + 1, y, z)) == used.end() && x + 1 < X) {
used.insert(make_tuple(x + 1, y, z));
que.push(make_tuple(A[x + 1] + B[y] + C[z], x + 1, y, z));
}
if (used.find(make_tuple(x, y + 1, z)) == used.end() && y + 1 < Y) {
used.insert(make_tuple(x, y + 1, z));
que.push(make_tuple(A[x] + B[y + 1] + C[z], x, y + 1, z));
}
if (used.find(make_tuple(x, y, z + 1)) == used.end() && z + 1 < Z) {
used.insert(make_tuple(x, y, z + 1));
que.push(make_tuple(A[x] + B[y] + C[z + 1], x, y, z + 1));
}
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], 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];
}
sort(A, A + X, greater<long long>());
sort(B, B + Y, greater<long long>());
sort(C, C + Z, greater<long long>());
priority_queue<tuple<long long, int, int, int>> que;
que.push(make_tuple(A[0] + B[0] + C[0], 0, 0, 0));
int k = min(X * Y * Z, K);
set<tuple<int, int, int>> used;
used.insert(make_tuple(0, 0, 0));
for (int i = 0; i < k; i++) {
auto q = que.top();
cout << get<0>(q) << endl;
int x = get<1>(q), y = get<2>(q), z = get<3>(q);
que.pop();
if (used.find(make_tuple(x + 1, y, z)) == used.end() && x + 1 < X) {
used.insert(make_tuple(x + 1, y, z));
que.push(make_tuple(A[x + 1] + B[y] + C[z], x + 1, y, z));
}
if (used.find(make_tuple(x, y + 1, z)) == used.end() && y + 1 < Y) {
used.insert(make_tuple(x, y + 1, z));
que.push(make_tuple(A[x] + B[y + 1] + C[z], x, y + 1, z));
}
if (used.find(make_tuple(x, y, z + 1)) == used.end() && z + 1 < Z) {
used.insert(make_tuple(x, y, z + 1));
que.push(make_tuple(A[x] + B[y] + C[z + 1], x, y, z + 1));
}
}
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 894,395 | 894,396 | u102334466 | cpp |
p03078 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), 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<ll> ab;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
ab.push_back(a[i] + b[j]);
}
}
sort(ab.begin(), ab.end());
reverse(ab.begin(), ab.end());
vector<ll> abc;
for (int i = 0; i < min(k, (int)ab.size()); i++) {
for (int j = 0; j < z; j++) {
abc.push_back(ab[i] + b[j]);
}
}
sort(abc.begin(), abc.end());
reverse(abc.begin(), abc.end());
for (int i = 0; i < k; i++) {
cout << abc[i] << endl;
}
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), 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<ll> ab;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
ab.push_back(a[i] + b[j]);
}
}
sort(ab.begin(), ab.end());
reverse(ab.begin(), ab.end());
vector<ll> abc;
for (int i = 0; i < min(k, (int)ab.size()); i++) {
for (int j = 0; j < z; j++) {
abc.push_back(ab[i] + c[j]);
}
}
sort(abc.begin(), abc.end());
reverse(abc.begin(), abc.end());
for (int i = 0; i < k; i++) {
cout << abc[i] << endl;
}
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,407 | 894,408 | u066855390 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define el '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define DEBUG cerr << "DEBUG >>> "
#define ms(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const int nax = 1005;
int ax[nax], ay[nax], az[nax];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++) {
cin >> ax[i];
// DEBUG << ax[i] << el;
}
for (int i = 0; i < y; i++)
cin >> ay[i];
for (int i = 0; i < z; i++)
cin >> az[i];
vector<int> ab;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
ab.pb(ax[i] + ay[j]);
}
}
sort(ab.begin(), ab.end(), greater<int>());
if ((int)ab.size() > k)
ab.erase(ab.begin() + k, ab.end());
vector<int> ans;
for (int i = 0; i < (int)ab.size(); i++) {
for (int j = 0; j < z; j++) {
ans.pb(ab[i] + az[j]);
}
}
sort(ans.begin(), ans.end(), greater<int>());
for (int i = 0; i < k; i++) {
cout << ans[i] << el;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define el '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define DEBUG cerr << "DEBUG >>> "
#define ms(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const int nax = 1005;
ll ax[nax], ay[nax], az[nax];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++) {
cin >> ax[i];
// DEBUG << ax[i] << el;
}
for (int i = 0; i < y; i++)
cin >> ay[i];
for (int i = 0; i < z; i++)
cin >> az[i];
vector<ll> ab;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
ab.pb(ax[i] + ay[j]);
}
}
sort(ab.begin(), ab.end(), greater<ll>());
if ((int)ab.size() > k)
ab.erase(ab.begin() + k, ab.end());
vector<ll> ans;
for (int i = 0; i < (int)ab.size(); i++) {
for (int j = 0; j < z; j++) {
ans.pb(ab[i] + az[j]);
}
}
sort(ans.begin(), ans.end(), greater<ll>());
for (int i = 0; i < k; i++) {
cout << ans[i] << el;
}
return 0;
} | [
"variable_declaration.type.change",
"call.arguments.change"
] | 894,411 | 894,412 | u420202803 | cpp |
p03078 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> A(x), B(y), 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];
}
sort(C.begin(), C.end(), greater<int>());
vector<long long> sumAB;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
sumAB.push_back(A[i] + B[j]);
}
}
vector<long long> sum;
sort(sumAB.begin(), sumAB.end(), greater<int>());
for (int i = 0; i < min(k, (int)sumAB.size()); i++) {
for (int j = 0; j < z; j++) {
sum.push_back(sumAB[i] + C[j]);
}
}
sort(sum.begin(), sum.end(), greater<int>());
for (int i = 0; i < k; i++) {
cout << sum[i] << endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> A(x), B(y), 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];
}
sort(C.begin(), C.end(), greater<long long>());
vector<long long> sumAB;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
sumAB.push_back(A[i] + B[j]);
}
}
vector<long long> sum;
sort(sumAB.begin(), sumAB.end(), greater<long long>());
for (int i = 0; i < min(k, (int)sumAB.size()); i++) {
for (int j = 0; j < z; j++) {
sum.push_back(sumAB[i] + C[j]);
}
}
sort(sum.begin(), sum.end(), greater<long long>());
for (int i = 0; i < k; i++) {
cout << sum[i] << endl;
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,413 | 894,414 | u110653681 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define REPR(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, s, e) for (int i = s; i <= e; i++)
#define FORR(i, s, e) for (int i = s; e <= i; i--)
#define LLI long long int
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(a, shift) ((a>>shift)&1))
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort((v).rbegin(), (v).rend())
// int 2.14E±9 lli 9.2E±18 double 1.7E±380
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<LLI> a(X), b(Y), c(Z);
REP(i, X) { cin >> a[i]; }
RSORT(a);
REP(i, Y) { cin >> b[i]; }
RSORT(b);
REP(i, Z) { cin >> c[i]; }
RSORT(c);
vector<LLI> v;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) < K)
v.push_back(a[i] + b[j] + c[k]);
else
break;
}
}
}
RSORT(v);
REP(i, K) { cout << v[i] << endl; }
return 0;
} | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define REPR(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, s, e) for (int i = s; i <= e; i++)
#define FORR(i, s, e) for (int i = s; e <= i; i--)
#define LLI long long int
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(a, shift) ((a>>shift)&1))
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort((v).rbegin(), (v).rend())
// int 2.14E±9 lli 9.2E±18 double 1.7E±380
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<LLI> a(X), b(Y), c(Z);
REP(i, X) { cin >> a[i]; }
RSORT(a);
REP(i, Y) { cin >> b[i]; }
RSORT(b);
REP(i, Z) { cin >> c[i]; }
RSORT(c);
vector<LLI> v;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
v.push_back(a[i] + b[j] + c[k]);
else
break;
}
}
}
RSORT(v);
REP(i, K) { cout << v[i] << endl; }
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 894,421 | 894,422 | u840105874 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define REPR(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, s, e) for (int i = s; i <= e; i++)
#define FORR(i, s, e) for (int i = s; e <= i; i--)
#define LLI long long int
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(a, shift) ((a>>shift)&1))
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort((v).rbegin(), (v).rend())
// int 2.14E±9 lli 9.2E±18 double 1.7E±380
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<LLI> a(X), b(Y), c(Z);
REP(i, X) { cin >> a[i]; }
RSORT(a);
REP(i, Y) { cin >> b[i]; }
RSORT(b);
REP(i, Z) { cin >> c[i]; }
RSORT(c);
vector<LLI> v;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) < K)
v.push_back(a[i] + b[j] + c[k]);
break;
}
}
}
RSORT(v);
REP(i, K) { cout << v[i] << endl; }
return 0;
} | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define REPR(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, s, e) for (int i = s; i <= e; i++)
#define FORR(i, s, e) for (int i = s; e <= i; i--)
#define LLI long long int
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(a, shift) ((a>>shift)&1))
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort((v).rbegin(), (v).rend())
// int 2.14E±9 lli 9.2E±18 double 1.7E±380
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<LLI> a(X), b(Y), c(Z);
REP(i, X) { cin >> a[i]; }
RSORT(a);
REP(i, Y) { cin >> b[i]; }
RSORT(b);
REP(i, Z) { cin >> c[i]; }
RSORT(c);
vector<LLI> v;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
v.push_back(a[i] + b[j] + c[k]);
else
break;
}
}
}
RSORT(v);
REP(i, K) { cout << v[i] << endl; }
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 894,423 | 894,422 | u840105874 | cpp |
p03078 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ll;
typedef pair<ll, ll> curr;
const int MOD = 998244353;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll calc(int a, int b, int p) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = calc(a, b / 2, p);
return (d * d) % p;
} else {
return (a * calc(a, b - 1, p)) % p;
}
}
bool comp(int a, int b) { return a > b; }
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> vec;
for (int i = 0; i < X; i++)
cin >> A[i];
sort(A, A + X, comp);
for (int i = 0; i < Y; i++)
cin >> B[i];
sort(B, B + Y, comp);
for (int i = 0; i < Z; i++)
cin >> C[i];
sort(C, C + Z, comp);
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
vec.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(vec.begin(), vec.end(), comp);
for (int i = 0; i < K; i++)
cout << vec[i] << "\n";
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ll;
typedef pair<ll, ll> curr;
const int MOD = 998244353;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll calc(int a, int b, int p) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = calc(a, b / 2, p);
return (d * d) % p;
} else {
return (a * calc(a, b - 1, p)) % p;
}
}
bool comp(ll a, ll b) { return a > b; }
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> vec;
for (int i = 0; i < X; i++)
cin >> A[i];
sort(A, A + X, comp);
for (int i = 0; i < Y; i++)
cin >> B[i];
sort(B, B + Y, comp);
for (int i = 0; i < Z; i++)
cin >> C[i];
sort(C, C + Z, comp);
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if ((i + 1) * (j + 1) * (k + 1) <= K)
vec.push_back(A[i] + B[j] + C[k]);
}
}
}
sort(vec.begin(), vec.end(), comp);
for (int i = 0; i < K; i++)
cout << vec[i] << "\n";
}
| [] | 894,426 | 894,427 | u554988565 | cpp |
p03078 | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> xx(X), yy(Y), zz(Z);
for (int i = 0; i < X; ++i)
cin >> xx[i];
sort(all(xx), greater<long long>());
for (int i = 0; i < Y; ++i)
cin >> yy[i];
sort(all(yy), greater<long long>());
for (int i = 0; i < Z; ++i)
cin >> zz[i];
sort(all(zz), greater<long long>());
vector<long long> res;
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
for (int k = 0; k < Z; ++k) {
if ((i + 1) * (j + 1) * (k + 1) >= K)
break;
res.push_back(xx[i] + yy[j] + zz[k]);
}
}
}
sort(all(res), greater<long long>());
for (int i = 0; i < K; ++i)
cout << res[i] << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> xx(X), yy(Y), zz(Z);
for (int i = 0; i < X; ++i)
cin >> xx[i];
sort(all(xx), greater<long long>());
for (int i = 0; i < Y; ++i)
cin >> yy[i];
sort(all(yy), greater<long long>());
for (int i = 0; i < Z; ++i)
cin >> zz[i];
sort(all(zz), greater<long long>());
vector<long long> res;
for (int i = 0; i < X; ++i) {
for (int j = 0; j < Y; ++j) {
for (int k = 0; k < Z; ++k) {
if ((i + 1) * (j + 1) * (k + 1) > K)
break;
res.push_back(xx[i] + yy[j] + zz[k]);
}
}
}
sort(all(res), greater<long long>());
for (int i = 0; i < K; ++i)
cout << res[i] << "\n";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 894,435 | 894,436 | u882821419 | cpp |
p03078 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[1001], b[1001], c[1001], d[1000001];
int x, y, z, k;
int p, q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> x >> y >> z >> k;
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];
for (int i = 0; i < x; ++i)
for (int j = 0; j < y; ++j)
d[i * y + j] = a[i] + b[j];
sort(c, c + z, greater<ll>());
sort(d, d + (x * y), greater<ll>());
vector<ll> sol;
for (int i = 0; i < min(k, x * y); ++i)
for (int j = 0; j < z; ++j)
sol.push_back(c[i] + d[j]);
sort(all(sol), greater<ll>());
for (int i = 0; i < k; ++i)
cout << sol[i] << '\n';
}
| #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[1001], b[1001], c[1001], d[1000001];
int x, y, z, k;
int p, q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> x >> y >> z >> k;
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];
for (int i = 0; i < x; ++i)
for (int j = 0; j < y; ++j)
d[i * y + j] = a[i] + b[j];
sort(c, c + z, greater<ll>());
sort(d, d + (x * y), greater<ll>());
vector<ll> sol;
for (int i = 0; i < min(k, x * y); ++i)
for (int j = 0; j < z; ++j)
sol.push_back(d[i] + c[j]);
sort(all(sol), greater<ll>());
for (int i = 0; i < k; ++i)
cout << sol[i] << '\n';
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,439 | 894,440 | u562319622 | cpp |
p03078 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[1001], b[1001], c[1001], d[1000001];
int x, y, z, k;
int p, q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> x >> y >> z >> k;
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];
for (int i = 0; i < x; ++i)
for (int j = 0; j < y; ++j)
d[i * y + j] = a[i] + b[j];
sort(c, c + z, greater<ll>());
sort(d, d + (x * y), greater<ll>());
vi sol;
for (int i = 0; i < min(k, x * y); ++i)
for (int j = 0; j < z; ++j)
sol.push_back(c[i] + d[j]);
sort(all(sol), greater<ll>());
for (int i = 0; i < k; ++i)
cout << sol[i] << '\n';
}
| #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[1001], b[1001], c[1001], d[1000001];
int x, y, z, k;
int p, q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> x >> y >> z >> k;
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];
for (int i = 0; i < x; ++i)
for (int j = 0; j < y; ++j)
d[i * y + j] = a[i] + b[j];
sort(c, c + z, greater<ll>());
sort(d, d + (x * y), greater<ll>());
vector<ll> sol;
for (int i = 0; i < min(k, x * y); ++i)
for (int j = 0; j < z; ++j)
sol.push_back(d[i] + c[j]);
sort(all(sol), greater<ll>());
for (int i = 0; i < k; ++i)
cout << sol[i] << '\n';
}
| [
"variable_declaration.type.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,441 | 894,440 | u562319622 | cpp |
p03078 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
#define y0 qvya13579
#define y1 qvyb24680
#define j0 qvja13579
#define j1 qvjb24680
#define next qvne13579xt
#define prev qvpr13579ev
#define INF 1000000007
#define MOD 1000000007
#define PI acos(-1.0)
#define endl "\n"
#define IOS \
cin.tie(0); \
ios::sync_with_stdio(false)
#define M_P make_pair
#define PU_B push_back
#define PU_F push_front
#define PO_B pop_back
#define PO_F pop_front
#define U_B upper_bound
#define L_B lower_bound
#define B_S binary_search
#define PR_Q priority_queue
#define FIR first
#define SEC second
#if __cplusplus < 201103L
#define stoi(argument_string) atoi((argument_string).c_str())
#endif
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP_R(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZ(x) ((int)(x).size())
#define COUT(x) cout << (x) << endl
#define CIN(x) cin >> (x)
#define CIN2(x, y) cin >> (x) >> (y)
#define CIN3(x, y, z) cin >> (x) >> (y) >> (z)
#define CIN4(x, y, z, w) cin >> (x) >> (y) >> (z) >> (w)
#define SCAND(x) scanf("%d", &(x))
#define SCAND2(x, y) scanf("%d%d", &(x), &(y))
#define SCAND3(x, y, z) scanf("%d%d%d", &(x), &(y), &(z))
#define SCAND4(x, y, z, w) scanf("%d%d%d%d", &(x), &(y), &(z), &(w))
#define SCANLLD(x) scanf("%lld", &(x))
#define SCANLLD2(x, y) scanf("%lld%lld", &(x), &(y))
#define SCANLLD3(x, y, z) scanf("%lld%lld%lld", &(x), &(y), &(z))
#define SCANLLD4(x, y, z, w) scanf("%lld%lld%lld%lld", &(x), &(y), &(z), &(w))
#define PRINTD(x) printf("%d\n", (x))
#define PRINTLLD(x) printf("%lld\n", (x))
typedef long long int lli;
using namespace std;
bool compare_by_2nd(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int ctoi(char c) {
if (c >= '0' and c <= '9') {
return (int)(c - '0');
}
return -1;
}
int alphabet_pos(char c) {
if (c >= 'a' and c <= 'z') {
return (int)(c - 'a');
}
return -1;
}
int alphabet_pos_capital(char c) {
if (c >= 'A' and c <= 'Z') {
return (int)(c - 'A');
}
return -1;
}
vector<string> split(string str, char ch) {
int first = 0;
int last = str.find_first_of(ch);
if (last == string::npos) {
last = SIZ(str);
}
vector<string> result;
while (first < SIZ(str)) {
string Ssubstr(str, first, last - first);
result.push_back(Ssubstr);
first = last + 1;
last = str.find_first_of(ch, first);
if (last == string::npos) {
last = SIZ(str);
}
}
return result;
}
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b) {
return gcd(b, 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);
}
lli pow_fast(lli x, lli n_power, lli modulus) {
if (n_power == 0) {
return 1;
}
if (n_power % 2 == 0) {
return pow_fast(x * x % modulus, n_power / 2, modulus);
}
return x * pow_fast(x, n_power - 1, modulus) % modulus;
}
struct UnionFind // size-based
{
vector<int> parent, treesize;
UnionFind(int size)
: parent(size), treesize(size, 1) // constructor
{
for (int i = 0; i < size; ++i) {
parent[i] = i;
}
}
int root(int x) {
if (parent[x] == x) {
return x;
}
return parent[x] = root(parent[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) {
return;
}
if (treesize[x] < treesize[y]) {
parent[x] = y;
treesize[y] += treesize[x];
} else {
parent[y] = x;
treesize[x] += treesize[y];
}
}
bool sametree(int x, int y) { return root(x) == root(y); }
int gettreesize(int x) { return treesize[root(x)]; }
};
/*------------------ the end of the template -----------------------*/
int main() {
IOS; /* making cin faster */
int X, Y, Z, K;
SCAND4(X, Y, Z, K);
vector<lli> A(X);
vector<lli> B(Y);
vector<lli> C(Z);
REP(i, X) { SCANLLD(A[i]); }
REP(i, Y) { SCANLLD(B[i]); }
REP(i, Z) { SCANLLD(C[i]); }
sort(RALL(A));
sort(RALL(B));
sort(RALL(C));
vector<lli> D;
REP(i, X) {
REP(j, Y) { D.push_back(A[i] + B[j]); }
}
sort(ALL(D));
vector<lli> candi;
REP(i, min(2 * K, X * Y)) {
REP(j, Z) { candi.push_back(D[i] + C[j]); }
}
sort(RALL(candi));
REP(i, K) { PRINTLLD(candi[i]); }
}
| #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
#define y0 qvya13579
#define y1 qvyb24680
#define j0 qvja13579
#define j1 qvjb24680
#define next qvne13579xt
#define prev qvpr13579ev
#define INF 1000000007
#define MOD 1000000007
#define PI acos(-1.0)
#define endl "\n"
#define IOS \
cin.tie(0); \
ios::sync_with_stdio(false)
#define M_P make_pair
#define PU_B push_back
#define PU_F push_front
#define PO_B pop_back
#define PO_F pop_front
#define U_B upper_bound
#define L_B lower_bound
#define B_S binary_search
#define PR_Q priority_queue
#define FIR first
#define SEC second
#if __cplusplus < 201103L
#define stoi(argument_string) atoi((argument_string).c_str())
#endif
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP_R(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZ(x) ((int)(x).size())
#define COUT(x) cout << (x) << endl
#define CIN(x) cin >> (x)
#define CIN2(x, y) cin >> (x) >> (y)
#define CIN3(x, y, z) cin >> (x) >> (y) >> (z)
#define CIN4(x, y, z, w) cin >> (x) >> (y) >> (z) >> (w)
#define SCAND(x) scanf("%d", &(x))
#define SCAND2(x, y) scanf("%d%d", &(x), &(y))
#define SCAND3(x, y, z) scanf("%d%d%d", &(x), &(y), &(z))
#define SCAND4(x, y, z, w) scanf("%d%d%d%d", &(x), &(y), &(z), &(w))
#define SCANLLD(x) scanf("%lld", &(x))
#define SCANLLD2(x, y) scanf("%lld%lld", &(x), &(y))
#define SCANLLD3(x, y, z) scanf("%lld%lld%lld", &(x), &(y), &(z))
#define SCANLLD4(x, y, z, w) scanf("%lld%lld%lld%lld", &(x), &(y), &(z), &(w))
#define PRINTD(x) printf("%d\n", (x))
#define PRINTLLD(x) printf("%lld\n", (x))
typedef long long int lli;
using namespace std;
bool compare_by_2nd(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int ctoi(char c) {
if (c >= '0' and c <= '9') {
return (int)(c - '0');
}
return -1;
}
int alphabet_pos(char c) {
if (c >= 'a' and c <= 'z') {
return (int)(c - 'a');
}
return -1;
}
int alphabet_pos_capital(char c) {
if (c >= 'A' and c <= 'Z') {
return (int)(c - 'A');
}
return -1;
}
vector<string> split(string str, char ch) {
int first = 0;
int last = str.find_first_of(ch);
if (last == string::npos) {
last = SIZ(str);
}
vector<string> result;
while (first < SIZ(str)) {
string Ssubstr(str, first, last - first);
result.push_back(Ssubstr);
first = last + 1;
last = str.find_first_of(ch, first);
if (last == string::npos) {
last = SIZ(str);
}
}
return result;
}
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b) {
return gcd(b, 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);
}
lli pow_fast(lli x, lli n_power, lli modulus) {
if (n_power == 0) {
return 1;
}
if (n_power % 2 == 0) {
return pow_fast(x * x % modulus, n_power / 2, modulus);
}
return x * pow_fast(x, n_power - 1, modulus) % modulus;
}
struct UnionFind // size-based
{
vector<int> parent, treesize;
UnionFind(int size)
: parent(size), treesize(size, 1) // constructor
{
for (int i = 0; i < size; ++i) {
parent[i] = i;
}
}
int root(int x) {
if (parent[x] == x) {
return x;
}
return parent[x] = root(parent[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) {
return;
}
if (treesize[x] < treesize[y]) {
parent[x] = y;
treesize[y] += treesize[x];
} else {
parent[y] = x;
treesize[x] += treesize[y];
}
}
bool sametree(int x, int y) { return root(x) == root(y); }
int gettreesize(int x) { return treesize[root(x)]; }
};
/*------------------ the end of the template -----------------------*/
int main() {
IOS; /* making cin faster */
int X, Y, Z, K;
SCAND4(X, Y, Z, K);
vector<lli> A(X);
vector<lli> B(Y);
vector<lli> C(Z);
REP(i, X) { SCANLLD(A[i]); }
REP(i, Y) { SCANLLD(B[i]); }
REP(i, Z) { SCANLLD(C[i]); }
sort(RALL(A));
sort(RALL(B));
sort(RALL(C));
vector<lli> D;
REP(i, X) {
REP(j, Y) { D.push_back(A[i] + B[j]); }
}
sort(RALL(D));
vector<lli> candi;
REP(i, min(2 * K, X * Y)) {
REP(j, Z) { candi.push_back(D[i] + C[j]); }
}
sort(RALL(candi));
REP(i, K) { PRINTLLD(candi[i]); }
}
| [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 894,444 | 894,445 | u900727536 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define clr(a, x) memset(a, x, sizeof(a))
#define SZ(x) ((int)(x).size())
#define lson rt << 1
#define rson rt << 1 | 1
#define pb push_back
#define fi first
#define se second
#define what_is(x) cerr << #x << " " << x << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T> inline void _read(T &x) { cin >> x; }
void R() {}
template <typename T, typename... U> void R(T &head, U &...tail) {
_read(head);
R(tail...);
}
template <typename T> inline void _write(const T &x) { cout << x << ' '; }
void W() { cout << endl; }
template <typename T, typename... U> void W(const T &head, const U &...tail) {
_write(head);
W(tail...);
}
void go();
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
go();
return 0;
}
/****************ackun*********************/
const int MAXN = 1000 + 10;
int a[MAXN], b[MAXN], c[MAXN];
bool cmp(ll x, ll y) { return x > y; }
void go() {
int x, y, z, t;
R(x, y, z, t);
rep(i, 1, x) { R(a[i]); }
rep(i, 1, y) { R(b[i]); }
rep(i, 1, z) { R(c[i]); }
sort(a + 1, a + 1 + x, cmp);
sort(b + 1, b + 1 + y, cmp);
sort(c + 1, c + 1 + z, cmp);
vector<ll> ans;
rep(i, 1, x) {
rep(j, 1, y) {
rep(k, 1, z) {
if (1LL * i * j * k <= t) {
ans.pb(1LL * a[i] + b[j] + c[k]);
// W(i,j,k);
} else {
break;
}
}
}
}
sort(ans.rbegin(), ans.rend());
rep(i, 0, t - 1) { W(ans[i]); }
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define clr(a, x) memset(a, x, sizeof(a))
#define SZ(x) ((int)(x).size())
#define lson rt << 1
#define rson rt << 1 | 1
#define pb push_back
#define fi first
#define se second
#define what_is(x) cerr << #x << " " << x << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T> inline void _read(T &x) { cin >> x; }
void R() {}
template <typename T, typename... U> void R(T &head, U &...tail) {
_read(head);
R(tail...);
}
template <typename T> inline void _write(const T &x) { cout << x << ' '; }
void W() { cout << endl; }
template <typename T, typename... U> void W(const T &head, const U &...tail) {
_write(head);
W(tail...);
}
void go();
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
go();
return 0;
}
/****************ackun*********************/
const int MAXN = 1000 + 10;
ll a[MAXN], b[MAXN], c[MAXN];
bool cmp(ll x, ll y) { return x > y; }
void go() {
int x, y, z, t;
R(x, y, z, t);
rep(i, 1, x) { R(a[i]); }
rep(i, 1, y) { R(b[i]); }
rep(i, 1, z) { R(c[i]); }
sort(a + 1, a + 1 + x, cmp);
sort(b + 1, b + 1 + y, cmp);
sort(c + 1, c + 1 + z, cmp);
vector<ll> ans;
rep(i, 1, x) {
rep(j, 1, y) {
rep(k, 1, z) {
if (1LL * i * j * k <= t) {
ans.pb(1LL * a[i] + b[j] + c[k]);
// W(i,j,k);
} else {
break;
}
}
}
}
sort(ans.rbegin(), ans.rend());
rep(i, 0, t - 1) { W(ans[i]); }
}
| [
"variable_declaration.type.change"
] | 894,466 | 894,467 | u749563575 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define clr(a, x) memset(a, x, sizeof(a))
#define SZ(x) ((int)(x).size())
#define lson rt << 1
#define rson rt << 1 | 1
#define pb push_back
#define fi first
#define se second
#define what_is(x) cerr << #x << " " << x << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T> inline void _read(T &x) { cin >> x; }
void R() {}
template <typename T, typename... U> void R(T &head, U &...tail) {
_read(head);
R(tail...);
}
template <typename T> inline void _write(const T &x) { cout << x << ' '; }
void W() { cout << endl; }
template <typename T, typename... U> void W(const T &head, const U &...tail) {
_write(head);
W(tail...);
}
void go();
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
go();
return 0;
}
/****************ackun*********************/
const int MAXN = 1000 + 10;
int a[MAXN], b[MAXN], c[MAXN];
bool cmp(int x, int y) { return x > y; }
void go() {
int x, y, z, t;
R(x, y, z, t);
rep(i, 1, x) { R(a[i]); }
rep(i, 1, y) { R(b[i]); }
rep(i, 1, z) { R(c[i]); }
sort(a + 1, a + 1 + x, cmp);
sort(b + 1, b + 1 + y, cmp);
sort(c + 1, c + 1 + z, cmp);
vector<ll> ans;
rep(i, 1, x) {
rep(j, 1, y) {
rep(k, 1, z) {
if (1LL * i * j * k <= t) {
ans.pb(1LL * a[i] + b[j] + c[k]);
// W(i,j,k);
} else {
break;
}
}
}
}
sort(ans.rbegin(), ans.rend());
rep(i, 0, t - 1) { W(ans[i]); }
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define clr(a, x) memset(a, x, sizeof(a))
#define SZ(x) ((int)(x).size())
#define lson rt << 1
#define rson rt << 1 | 1
#define pb push_back
#define fi first
#define se second
#define what_is(x) cerr << #x << " " << x << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T> inline void _read(T &x) { cin >> x; }
void R() {}
template <typename T, typename... U> void R(T &head, U &...tail) {
_read(head);
R(tail...);
}
template <typename T> inline void _write(const T &x) { cout << x << ' '; }
void W() { cout << endl; }
template <typename T, typename... U> void W(const T &head, const U &...tail) {
_write(head);
W(tail...);
}
void go();
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
go();
return 0;
}
/****************ackun*********************/
const int MAXN = 1000 + 10;
ll a[MAXN], b[MAXN], c[MAXN];
bool cmp(ll x, ll y) { return x > y; }
void go() {
int x, y, z, t;
R(x, y, z, t);
rep(i, 1, x) { R(a[i]); }
rep(i, 1, y) { R(b[i]); }
rep(i, 1, z) { R(c[i]); }
sort(a + 1, a + 1 + x, cmp);
sort(b + 1, b + 1 + y, cmp);
sort(c + 1, c + 1 + z, cmp);
vector<ll> ans;
rep(i, 1, x) {
rep(j, 1, y) {
rep(k, 1, z) {
if (1LL * i * j * k <= t) {
ans.pb(1LL * a[i] + b[j] + c[k]);
// W(i,j,k);
} else {
break;
}
}
}
}
sort(ans.rbegin(), ans.rend());
rep(i, 0, t - 1) { W(ans[i]); }
}
| [
"variable_declaration.type.change"
] | 894,468 | 894,467 | u749563575 | cpp |
p03078 | #include <algorithm>
#include <stdio.h>
#include <vector>
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
typedef long long ll;
using namespace std;
const int N = 1010;
int x, y, z, k;
ll a[N], b[N], c[N];
vector<ll> ab;
vector<ll> abc;
int main() {
scanf("%d%d%d%d", &x, &y, &z, &k);
REP(i, 0, x) scanf("%lld", a + i);
REP(i, 0, y) scanf("%lld", b + i);
REP(i, 0, z) scanf("%lld", c + i);
REP(i, 0, x) REP(j, 0, y) ab.push_back(a[i] + b[j]);
sort(ab.rbegin(), ab.rend());
REP(i, 0, z) {
REP(j, 0, min(k, int(ab.size()))) { abc.push_back(c[i] + ab[j]); }
}
sort(abc.rbegin(), abc.rend());
REP(r, 1, k + 1) { printf("%lld\n", abc[r]); }
}
| #include <algorithm>
#include <stdio.h>
#include <vector>
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
typedef long long ll;
using namespace std;
const int N = 1010;
int x, y, z, k;
ll a[N], b[N], c[N];
vector<ll> ab;
vector<ll> abc;
int main() {
scanf("%d%d%d%d", &x, &y, &z, &k);
REP(i, 0, x) scanf("%lld", a + i);
REP(i, 0, y) scanf("%lld", b + i);
REP(i, 0, z) scanf("%lld", c + i);
REP(i, 0, x) REP(j, 0, y) ab.push_back(a[i] + b[j]);
sort(ab.rbegin(), ab.rend());
REP(i, 0, z) {
REP(j, 0, min(k, int(ab.size()))) { abc.push_back(c[i] + ab[j]); }
}
sort(abc.rbegin(), abc.rend());
REP(r, 0, k) { printf("%lld\n", abc[r]); }
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 894,476 | 894,477 | u459746049 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e15 + 5);
const int MAX_N = (int)(1e1 + 5);
ll n;
ll a[MAX_N];
ll ans;
int main(void) {
// Here your code !
scanf("%lld", &n);
for (int i = 0; i < 5; ++i) {
scanf("%lld", &(a[i]));
}
ll minimum = INF;
for (int i = 0; i < 5; ++i) {
minimum = min(minimum, a[i]);
}
ans = n / minimum + 1 + 4;
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e15 + 5);
const int MAX_N = (int)(1e1 + 5);
ll n;
ll a[MAX_N];
ll ans;
int main(void) {
// Here your code !
scanf("%lld", &n);
for (int i = 0; i < 5; ++i) {
scanf("%lld", &(a[i]));
}
ll minimum = INF;
for (int i = 0; i < 5; ++i) {
minimum = min(minimum, a[i]);
}
ans = (n - 1) / minimum + 1 + 4;
printf("%lld\n", ans);
return 0;
}
| [] | 894,480 | 894,481 | u497422208 | cpp |
p03077 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
if (n % min({a[0], a[1], a[2], a[3], a[4]}) == 0) {
cout << (n) / min({a[0], a[1], a[2], a[3], a[4]}) + 5 << endl;
} else {
cout << (n - 1) / min({a[0], a[1], a[2], a[3], a[4]}) + 5 << endl;
}
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
if (n % min({a[0], a[1], a[2], a[3], a[4]}) == 0) {
cout << (n) / min({a[0], a[1], a[2], a[3], a[4]}) + 4 << endl;
} else {
cout << (n - 1) / min({a[0], a[1], a[2], a[3], a[4]}) + 5 << endl;
}
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 894,485 | 894,486 | u114838227 | cpp |
p03077 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
cout << ceil(n / min({a[0], a[1], a[2], a[3], a[4]})) + 5 << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
cout << (n - 1) / min({a[0], a[1], a[2], a[3], a[4]}) + 5 << endl;
return 0;
} | [
"call.arguments.change"
] | 894,487 | 894,488 | u114838227 | cpp |
p03077 | #include "math.h"
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main() {
long int N, A, B, C, D, E;
cin >> N;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
cin >> E;
long int minhuman = A;
if (B < minhuman) {
minhuman = B;
}
if (C < minhuman) {
minhuman = C;
}
if (D < minhuman) {
minhuman = D;
}
if (E < minhuman) {
minhuman = E;
}
long int x = ceil(N / minhuman);
long int ans = x + 4;
cout << ans << endl;
}
| #include "math.h"
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main() {
long double N, A, B, C, D, E;
cin >> N;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
cin >> E;
long double minhuman = A;
if (B < minhuman) {
minhuman = B;
}
if (C < minhuman) {
minhuman = C;
}
if (D < minhuman) {
minhuman = D;
}
if (E < minhuman) {
minhuman = E;
}
long int x = ceil(N / minhuman);
long int ans = x + 4;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 894,493 | 894,494 | u313994303 | cpp |
p03077 | #include <iostream>
#include <string>
using namespace std;
int main() {
long long int N;
long long int CAP[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> CAP[i];
long long int min = CAP[0];
for (int i = 1; i < 5; i++)
if (min > CAP[i])
min = CAP[i];
long long int adtime = N / min;
cout << 5 + adtime << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
long long int N;
long long int CAP[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> CAP[i];
long long int min = CAP[0];
for (int i = 1; i < 5; i++)
if (min > CAP[i])
min = CAP[i];
long long int adtime = (N - 1) / min;
cout << 5 + adtime << endl;
return 0;
}
| [] | 894,495 | 894,496 | u783809618 | cpp |
p03077 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
int main() {
LL n;
cin >> n;
vector<LL> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
LL mi = *min_element(a.begin(), a.end());
LL cnt = (LL)ceil(n / mi);
LL ans = 4 + cnt;
cout << ans << endl;
return 0;
}
|
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
int main() {
LL n;
cin >> n;
vector<LL> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
LL mi = *min_element(a.begin(), a.end());
LL cnt = (LL)ceil((double)n / mi);
LL ans = 4 + cnt;
cout << ans << endl;
return 0;
}
| [
"type_conversion.add"
] | 894,503 | 894,504 | u874996917 | cpp |
p03077 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
int main() {
LL n;
cin >> n;
vector<LL> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
LL mi = *min_element(a.begin(), a.end());
LL cnt = (LL)floor(n / mi);
LL ans = 4 + cnt;
cout << ans << endl;
return 0;
}
|
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
int main() {
LL n;
cin >> n;
vector<LL> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
LL mi = *min_element(a.begin(), a.end());
LL cnt = (LL)ceil((double)n / mi);
LL ans = 4 + cnt;
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 894,505 | 894,504 | u874996917 | cpp |
p03077 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
long long int a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
long long int ans = ceil(n / (float)a[0]) - 1 + 5;
cout << ans;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
long long int a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
long long int ans = ceil(n / (double)a[0]) - 1 + 5;
cout << ans;
}
| [
"variable_declaration.type.primitive.change"
] | 894,512 | 894,513 | u179987763 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 4; i++) {
min1 = min(min1, a[i]);
}
cout << (n + min1 - 1) / min1 + 4 << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 5; i++) {
min1 = min(min1, a[i]);
}
cout << (n - 1) / min1 + 5 << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"io.output.change"
] | 894,536 | 894,537 | u953532675 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 4; i++) {
min1 = min(min1, a[i]);
}
cout << (n - 1) / min1 + 5 << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 5; i++) {
min1 = min(min1, a[i]);
}
cout << (n - 1) / min1 + 5 << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,538 | 894,537 | u953532675 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 4; i++) {
min1 = min(min1, a[i]);
}
cout << (n + 1) / min1 + 4 << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 5; i++) {
min1 = min(min1, a[i]);
}
cout << (n - 1) / min1 + 5 << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 894,539 | 894,537 | u953532675 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 4; i++) {
min1 = min(min1, a[i]);
}
cout << n / min1 + 4 << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 5; i++) {
min1 = min(min1, a[i]);
}
cout << (n - 1) / min1 + 5 << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 894,540 | 894,537 | u953532675 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 4; i++) {
min1 = min(min1, a[i]);
}
cout << n / min1 + 5 << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll i = 0; i < 5; i++) {
min1 = min(min1, a[i]);
}
cout << (n - 1) / min1 + 5 << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,543 | 894,537 | u953532675 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, mini = 10000000, a;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a;
mini = min(a, mini);
}
cout << 5 + (N / mini) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N, mini = 1000000000000001, a;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a;
mini = min(a, mini);
}
N--;
cout << 5 + (N / mini) << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.unary.arithmetic.add"
] | 894,544 | 894,545 | u239087789 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, mini = 10000000, a;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a;
mini = min(a, mini);
}
cout << 5 + (N / mini) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N, mini = 1000000000000001, a;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a;
mini = min(a, mini);
}
N--;
cout << 5 + (N / mini) << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.unary.arithmetic.add"
] | 894,546 | 894,545 | u239087789 | cpp |
p03077 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, n[6];
cin >> N;
long long c; //一番小さいキャパ
for (int i = 0; i < 6; i++) {
cin >> n[i];
}
c = n[0];
for (int i = 1; i < 6; i++) {
if (c > n[i]) {
c = n[i];
}
}
long long t; //一番小さいキャパのところで何分かかるか
if (N % c == 0) {
t = N / c;
} else {
t = N / c + 1;
}
long long ans;
ans = t + 4;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, n[5];
cin >> N;
long long c; //一番小さいキャパ
for (int i = 0; i < 5; i++) {
cin >> n[i];
}
c = n[0];
for (int i = 1; i < 5; i++) {
if (c > n[i]) {
c = n[i];
}
}
long long t; //一番小さいキャパのところで何分かかるか
if (N % c == 0) {
t = N / c;
} else {
t = N / c + 1;
}
long long ans;
ans = t + 4;
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,547 | 894,548 | u942534145 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define PB push_back
#define ALL(v) (v).begin(), (v).end()
#define SZ size()
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR((i), 0, (n))
#define GET(a) cin >> (a)
#define GET2(a, b) cin >> (a) >> (b)
#define GET3(a, b, c) cin >> (a) >> (b) >> (c)
#define SHOW(v) cout << (v) << endl
#define SHOW2(a, b) cout << (a) << " " << (b) << endl
#define SHOW3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define MOD 1000000007
template <class T> void GETV(T &v) {
REP(i, v.size()) { GET(v[i]); }
}
template <class T> void SHOWV(T &v) {
REP(i, v.size()) { SHOW(v[i]); }
}
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> v(5);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
ll ans = ceil(n / *min_element(ALL(v))) + 5;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define PB push_back
#define ALL(v) (v).begin(), (v).end()
#define SZ size()
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR((i), 0, (n))
#define GET(a) cin >> (a)
#define GET2(a, b) cin >> (a) >> (b)
#define GET3(a, b, c) cin >> (a) >> (b) >> (c)
#define SHOW(v) cout << (v) << endl
#define SHOW2(a, b) cout << (a) << " " << (b) << endl
#define SHOW3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define MOD 1000000007
template <class T> void GETV(T &v) {
REP(i, v.size()) { GET(v[i]); }
}
template <class T> void SHOWV(T &v) {
REP(i, v.size()) { SHOW(v[i]); }
}
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> v(5);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
ll ans = ceil((n - 1) / *min_element(ALL(v))) + 5;
cout << ans << endl;
return 0;
} | [
"call.arguments.change"
] | 894,549 | 894,550 | u419383010 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int a[5], N, m = 10000000000000000;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> a[i];
m = min(a[i], m);
}
cout << N / m + 5 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int a[5], N, m = 10000000000000000;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> a[i];
m = min(a[i], m);
}
cout << (N - 1) / m + 5 << endl;
return 0;
}
| [] | 894,551 | 894,552 | u823974338 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll N;
ll M;
string s;
vector<ll> input1;
vector<vector<ll>> input2;
int main() {
cin >> N;
vector<pair<ll, ll>> aa;
ll t = 0;
for (int i = 0; i < 5; i++) {
cin >> t;
aa.push_back(make_pair(t, i));
}
sort(aa.begin(), aa.end());
if (aa[0].first > N) {
cout << "5" << endl;
return 0;
}
ll ans = N / aa[0].first + 4;
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
double N;
ll M;
string s;
vector<ll> input1;
vector<vector<ll>> input2;
int main() {
cin >> N;
vector<pair<double, double>> aa;
ll t = 0;
for (int i = 0; i < 5; i++) {
cin >> t;
aa.push_back(make_pair(t, i));
}
sort(aa.begin(), aa.end());
if (aa[0].first > N) {
cout << "5" << endl;
return 0;
}
ll ans = ceil(N / aa[0].first) + 4;
cout << ans << endl;
} | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 894,556 | 894,557 | u048791623 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a[5], time = 0;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << n / a[0] + 5;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a[5], time = 0;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5;
return 0;
} | [] | 894,558 | 894,559 | u203891294 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a[5], time = 0;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << time / a[0] + 5;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a[5], time = 0;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5;
return 0;
} | [
"io.output.change"
] | 894,560 | 894,559 | u203891294 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long N;
long trans[5];
long min_trans;
long time;
cin >> N;
for (int i = 0; i < 4; ++i) {
cin >> trans[i];
}
min_trans = N;
for (const long &tr : trans) {
min_trans = min(min_trans, tr);
}
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() {
unsigned long N;
unsigned long trans[5];
unsigned long min_trans;
unsigned long time;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> trans[i];
}
min_trans = N;
for (unsigned long &tr : trans) {
min_trans = min(min_trans, tr);
}
time = 4 + N / min_trans;
if (N % min_trans != 0)
time++;
cout << time << endl;
return 0;
} | [
"variable_declaration.type.widen.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,561 | 894,562 | 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 < 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() {
unsigned long N;
unsigned long trans[5];
unsigned long min_trans;
unsigned 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;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,563 | 894,564 | 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() {
unsigned long N;
unsigned long trans[5];
unsigned long min_trans;
unsigned 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;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,565 | 894,564 | u969265031 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.