problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03077 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll sum_time = 0;
sum_time = N / min({A, B, C, D, E});
sum_time += 5;
cout << sum_time << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll sum_time = 0;
sum_time = (N - 1) / min({A, B, C, D, E});
sum_time += 5;
cout << sum_time << endl;
} | [] | 892,959 | 892,960 | u946378574 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
ll n;
vector<ll> city(6, 0);
vector<ll> way(5, 0);
int main() {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> way[i];
}
ll Min = *min_element(all(way));
ll ans = ceil(n * 1.0 / Min) + 5;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
ll n;
vector<ll> city(6, 0);
vector<ll> way(5, 0);
int main() {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> way[i];
}
ll Min = *min_element(all(way));
ll ans = ceil(n * 1.0 / Min) + 4;
cout << ans << endl;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 892,963 | 892,964 | u255001744 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
ll n;
vector<ll> city(6, 0);
vector<ll> way(5, 0);
int main() {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> way[i];
}
ll Min = *min_element(all(way));
ll ans = ceil(n / Min) + 5;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
ll n;
vector<ll> city(6, 0);
vector<ll> way(5, 0);
int main() {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> way[i];
}
ll Min = *min_element(all(way));
ll ans = ceil(n * 1.0 / Min) + 4;
cout << ans << endl;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 892,965 | 892,964 | u255001744 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
ll n;
vector<ll> city(6, 0);
vector<ll> way(5, 0);
int main() {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> way[i];
}
ll Min = *min_element(all(way));
ll ans = ceil(n / Min) + 4;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
ll n;
vector<ll> city(6, 0);
vector<ll> way(5, 0);
int main() {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> way[i];
}
ll Min = *min_element(all(way));
ll ans = ceil(n * 1.0 / Min) + 4;
cout << ans << endl;
} | [
"assignment.change"
] | 892,966 | 892,964 | u255001744 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, a[5];
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
cout << setprecision(16) << 4 + ceil(n * 1.0 / a[0]);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
long long int n, a[5];
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
cout << setprecision(16) << 4 + ceil(n * 1.0 / a[0]);
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 892,967 | 892,968 | u340494803 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N, A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
cout << max({(N - 1) / A, (N - 1) / B, (N - 1) / C, (N - 1) / D,
(N - 1) / E}) +
5
<< endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
cout << max({(N - 1) / A, (N - 1) / B, (N - 1) / C, (N - 1) / D,
(N - 1) / E}) +
5
<< endl;
} | [
"expression.operation.binary.add"
] | 892,976 | 892,977 | u489117389 | cpp |
p03077 | #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ll n, m;
ll Min = 1e18;
cin >> n;
int idx;
for (int i = 1; i <= 5; i++) {
cin >> m;
if (m < Min) {
Min = m;
idx = i;
}
}
if (Min >= n) {
cout << 5 << endl;
return 0;
}
ll temp;
if (n % Min == 0)
temp = n / Min;
else
temp = (n / Min) + 1;
ll ans = (idx + temp - 1);
ans += 6 - idx;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
ll n, m;
ll Min = 1e18;
cin >> n;
int idx;
for (int i = 1; i <= 5; i++) {
cin >> m;
if (m < Min) {
Min = m;
idx = i;
}
}
if (Min >= n) {
cout << 5 << endl;
return 0;
}
ll temp;
if (n % Min == 0)
temp = n / Min;
else
temp = (n / Min) + 1;
ll ans = (idx + temp - 1);
ans += 5 - idx;
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 892,978 | 892,979 | u066910956 | cpp |
p03077 | #include <bits/stdc++.h>
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin); i > (end); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.end(), greater<ll>())
#define REVERSE(a) reverse(a.begin(), a.end())
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=(" << ; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << ")" << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define ll long long
#define f first
#define s second
#define pb push_back
#define INF 1000000000000000000
using namespace std;
using vec = vector<ll>;
using mat = vector<vec>;
using Pii = pair<ll, ll>;
using PiP = pair<ll, Pii>;
using PPi = pair<Pii, ll>;
int main() {
// 入力
ll N;
cin >> N;
vec A(5);
ll minA = INF;
REP(i, 5) {
cin >> A[i];
minA = min(minA, A[i]);
}
cout << 5 + (N + 1) / minA - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin); i > (end); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.end(), greater<ll>())
#define REVERSE(a) reverse(a.begin(), a.end())
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=(" << ; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << ")" << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define ll long long
#define f first
#define s second
#define pb push_back
#define INF 1000000000000000000
using namespace std;
using vec = vector<ll>;
using mat = vector<vec>;
using Pii = pair<ll, ll>;
using PiP = pair<ll, Pii>;
using PPi = pair<Pii, ll>;
int main() {
// 入力
ll N;
cin >> N;
vec A(5);
ll minA = INF;
REP(i, 5) {
cin >> A[i];
minA = min(minA, A[i]);
}
cout << 4 + (N + minA - 1) / minA << endl;
return 0;
} | [
"literal.number.change",
"io.output.change",
"expression.operation.binary.remove"
] | 892,984 | 892,985 | u973797979 | cpp |
p03077 | #include <algorithm>
#include <array>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef int value_type; /* ソートするキーの型 */
value_type med3(value_type x, value_type y, value_type z)
/* x, y, z の中間値を返す */
{
if (x < y)
if (y < z)
return y;
else if (z < x)
return x;
else
return z;
else if (z < y)
return y;
else if (x < z)
return x;
else
return z;
}
void quicksort(value_type a[], int left, int right, value_type index[])
/* クイックソート
* a : ソートする配列
* left : ソートするデータの開始位置
* right : ソートするデータの終了位置
* index: index配列
*/
{
if (left < right) {
int i = left, j = right;
value_type tmp,
pivot = med3(a[i], a[i + (j - i) / 2],
a[j]); /* (i+j)/2ではオーバーフローしてしまう */
while (1) { /* a[] を pivot 以上と以下の集まりに分割する */
while (a[i] < pivot)
i++; /* a[i] >= pivot となる位置を検索 */
while (pivot < a[j])
j--; /* a[j] <= pivot となる位置を検索 */
if (i >= j)
break;
tmp = a[i];
a[i] = a[j];
a[j] = tmp; /* a[i],a[j] を交換 */
tmp = index[i];
index[i] = index[j];
index[j] = tmp;
i++;
j--;
}
quicksort(a, left, i - 1, index); /* 分割した左を再帰的にソート */
quicksort(a, j + 1, right, index); /* 分割した右を再帰的にソート */
}
}
int dfs(int n, int N) {
if (n > N) {
return 0;
}
int ret;
return ret;
}
int main() {
long long N, a, b, c, d, e;
long long ans;
cin >> N >> a >> b >> c >> d >> e;
ans = 5 + N / min(a, min(b, min(c, min(d, e))));
std::cout << ans << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef int value_type; /* ソートするキーの型 */
value_type med3(value_type x, value_type y, value_type z)
/* x, y, z の中間値を返す */
{
if (x < y)
if (y < z)
return y;
else if (z < x)
return x;
else
return z;
else if (z < y)
return y;
else if (x < z)
return x;
else
return z;
}
void quicksort(value_type a[], int left, int right, value_type index[])
/* クイックソート
* a : ソートする配列
* left : ソートするデータの開始位置
* right : ソートするデータの終了位置
* index: index配列
*/
{
if (left < right) {
int i = left, j = right;
value_type tmp,
pivot = med3(a[i], a[i + (j - i) / 2],
a[j]); /* (i+j)/2ではオーバーフローしてしまう */
while (1) { /* a[] を pivot 以上と以下の集まりに分割する */
while (a[i] < pivot)
i++; /* a[i] >= pivot となる位置を検索 */
while (pivot < a[j])
j--; /* a[j] <= pivot となる位置を検索 */
if (i >= j)
break;
tmp = a[i];
a[i] = a[j];
a[j] = tmp; /* a[i],a[j] を交換 */
tmp = index[i];
index[i] = index[j];
index[j] = tmp;
i++;
j--;
}
quicksort(a, left, i - 1, index); /* 分割した左を再帰的にソート */
quicksort(a, j + 1, right, index); /* 分割した右を再帰的にソート */
}
}
int dfs(int n, int N) {
if (n > N) {
return 0;
}
int ret;
return ret;
}
int main() {
long long N, a, b, c, d, e;
long long ans;
cin >> N >> a >> b >> c >> d >> e;
ans = 5 + (N - 1) / min(a, min(b, min(c, min(d, e))));
std::cout << ans << endl;
return 0;
} | [] | 892,989 | 892,990 | u920434083 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long n, min = 1000000000000000, a[5];
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (min > a[i])
min = a[i];
}
int sub = 4;
if (n % min == 0)
sub++;
cout << n / min + sub << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n, min = 1000000000000000, a[5];
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (min > a[i])
min = a[i];
}
int sub = 5;
if (n % min == 0)
sub--;
cout << n / min + sub << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 892,993 | 892,994 | u112766430 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
ll n;
ll a[5];
cin >> n;
ll min_val = pow(10, 15) + 1;
REP(i, 5) {
cin >> a[i];
min_val = min(min_val, a[i]);
}
cout << n / min_val + 5 << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
ll n;
ll a[5];
cin >> n;
ll min_val = pow(10, 15) + 1;
REP(i, 5) {
cin >> a[i];
min_val = min(min_val, a[i]);
}
cout << (n - 1) / min_val + 5 << endl;
return 0;
}
| [] | 892,997 | 892,998 | u507128581 | cpp |
p03077 | #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 f = 5 + (n + 1) / min(min(min(a, b), min(c, d)), e);
cout << f << 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 f = 5 + (n - 1) / min(min(min(a, b), min(c, d)), e);
cout << f << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 893,008 | 893,009 | u412025794 | cpp |
p03077 | #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 f = 5 + n / min(min(min(a, b), min(c, d)), e);
cout << f << 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 f = 5 + (n - 1) / min(min(min(a, b), min(c, d)), e);
cout << f << endl;
} | [] | 893,010 | 893,009 | u412025794 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long f = 5 + n / min(min(min(a, b), min(c, d)), e);
cout << f << 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 f = 5 + (n - 1) / min(min(min(a, b), min(c, d)), e);
cout << f << endl;
} | [
"variable_declaration.type.widen.change"
] | 893,011 | 893,009 | u412025794 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << ceil(n / min({a, b, c, d, e})) + 4 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << (n - 1) / min({a, b, c, d, e}) + 5 << endl;
return 0;
}
| [
"call.arguments.change",
"literal.number.change",
"io.output.change"
] | 893,024 | 893,025 | u256027816 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
cout << 4 + max({
(N - 1) / A,
(N - 1) / B,
(N - 1) / C,
(N - 1) / D,
(N - 1) / E,
})
<< endl;
} | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
cout << 5 + max({(N - 1) / A, (N - 1) / B, (N - 1) / C, (N - 1) / D,
(N - 1) / E})
<< endl;
} | [
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 893,034 | 893,035 | u673474826 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
cout << 4 + max({
(N - 1) / A,
(N - 1) / B,
(N - 1) / C,
(N - 1) / D,
(N - 1) / E,
})
<< endl;
} | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
cout << 5 + max({(N - 1) / A, (N - 1) / B, (N - 1) / C, (N - 1) / D,
(N - 1) / E})
<< endl;
} | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 893,036 | 893,035 | u673474826 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, m = pow(10, 15) + 500;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> t;
m = min(m, t);
}
long long ans = (long long)floor(n / m);
cout << ans + 5;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, m = pow(10, 16);
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> t;
m = min(m, t);
}
long long ans = (long long)ceil(n / m);
cout << ans + 4;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 893,039 | 893,040 | u443404767 | cpp |
p03077 | #include <algorithm>
#include <cstdint>
#include <iostream>
auto main() -> int {
std::int64_t N;
std::cin >> N;
std::int64_t ms[5];
for (int i = 0; i < 5; ++i) {
std::cin >> ms[i];
}
const auto m = std::min_element(std::begin(ms), std::end(ms));
std::cout << ((N / *m) + 5) << "\n";
}
| #include <algorithm>
#include <cstdint>
#include <iostream>
auto main() -> int {
std::int64_t N;
std::cin >> N;
std::int64_t ms[5];
for (int i = 0; i < 5; ++i) {
std::cin >> ms[i];
}
const auto m = std::min_element(std::begin(ms), std::end(ms));
std::cout << (((N - 1) / *m) + 5) << "\n";
}
| [] | 893,041 | 893,042 | u646965135 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
// your code goes here
long int N, trans[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans[i];
}
long int min = trans[0];
for (int i = 1; i < 5; i++) {
if (min > trans[i])
min = trans[i];
}
cout << 5 + N / min << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
// your code goes here
long int N, trans[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans[i];
}
long int min = trans[0];
for (int i = 1; i < 5; i++) {
if (min > trans[i])
min = trans[i];
}
cout << 5 + (N - 1) / min << endl;
return 0;
}
| [] | 893,043 | 893,044 | u939903905 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, E, X;
cin >> N >> A >> B >> C >> D >> E;
X = min(A, min(B, min(C, min(D, E))));
if (N % X != 0) {
cout << N / X + 5 << endl;
} else {
cout << N / X + 4 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, C, D, E, X;
cin >> N >> A >> B >> C >> D >> E;
X = min(A, min(B, min(C, min(D, E))));
if (N % X != 0) {
cout << N / X + 5 << endl;
} else {
cout << N / X + 4 << endl;
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,045 | 893,046 | u717501752 | cpp |
p03077 | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<double> VD;
typedef pair<int, int> P1;
typedef long long int ll;
// number
#define INF 1e9
#define NUM 1000000007
// itr
#define all(x) begin(x), end(x)
// repeat
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
// max,min
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
// function
/*ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a%b);
}*/
/*ll lcm(ll a,ll b) {
ll g = gcd(a, b);
retur5n a * (b / g);
}*/
int dig(int a) {
int sum = 0;
while (a) {
sum += a % 10;
a /= 10;
}
return sum;
}
// grid template
int x[] = {-1, 0, 1, 0};
int y[] = {0, -1, 0, 1};
int xx[] = {-1, -1, 1, 1};
int yy[] = {1, -1, 1, -1};
int main() {
ll a, b, c, d, e, n;
cin >> n >> a >> b >> c >> d >> e;
ll ans = min({a, b, c, d, e});
cout << (ll)(n / ans) + 5 << endl;
} | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<double> VD;
typedef pair<int, int> P1;
typedef long long int ll;
// number
#define INF 1e9
#define NUM 1000000007
// itr
#define all(x) begin(x), end(x)
// repeat
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
// max,min
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
// function
/*ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a%b);
}*/
/*ll lcm(ll a,ll b) {
ll g = gcd(a, b);
retur5n a * (b / g);
}*/
int dig(int a) {
int sum = 0;
while (a) {
sum += a % 10;
a /= 10;
}
return sum;
}
// grid template
int x[] = {-1, 0, 1, 0};
int y[] = {0, -1, 0, 1};
int xx[] = {-1, -1, 1, 1};
int yy[] = {1, -1, 1, -1};
int main() {
double a, b, c, d, e, n;
cin >> n >> a >> b >> c >> d >> e;
double ans = min({a, b, c, d, e});
cout << (ll)(ceil(n / ans) + 4) << endl;
// cout << floor(n / ans) << endl;
} | [
"variable_declaration.type.change",
"call.add",
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 893,049 | 893,050 | u226951654 | cpp |
p03077 | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<double> VD;
typedef pair<int, int> P1;
typedef long long int ll;
// number
#define INF 1e9
#define NUM 1000000007
// itr
#define all(x) begin(x), end(x)
// repeat
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
// max,min
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
// function
/*ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a%b);
}*/
/*ll lcm(ll a,ll b) {
ll g = gcd(a, b);
retur5n a * (b / g);
}*/
int dig(int a) {
int sum = 0;
while (a) {
sum += a % 10;
a /= 10;
}
return sum;
}
// grid template
int x[] = {-1, 0, 1, 0};
int y[] = {0, -1, 0, 1};
int xx[] = {-1, -1, 1, 1};
int yy[] = {1, -1, 1, -1};
int main() {
ll a, b, c, d, e, n;
cin >> n >> a >> b >> c >> d >> e;
ll ans = min({a, b, c, d, e});
cout << (ll)(ceil(n / ans)) + 5 << endl;
} | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<double> VD;
typedef pair<int, int> P1;
typedef long long int ll;
// number
#define INF 1e9
#define NUM 1000000007
// itr
#define all(x) begin(x), end(x)
// repeat
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
// max,min
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
// function
/*ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a%b);
}*/
/*ll lcm(ll a,ll b) {
ll g = gcd(a, b);
retur5n a * (b / g);
}*/
int dig(int a) {
int sum = 0;
while (a) {
sum += a % 10;
a /= 10;
}
return sum;
}
// grid template
int x[] = {-1, 0, 1, 0};
int y[] = {0, -1, 0, 1};
int xx[] = {-1, -1, 1, 1};
int yy[] = {1, -1, 1, -1};
int main() {
double a, b, c, d, e, n;
cin >> n >> a >> b >> c >> d >> e;
double ans = min({a, b, c, d, e});
cout << (ll)(ceil(n / ans) + 4) << endl;
// cout << floor(n / ans) << endl;
} | [
"variable_declaration.type.change",
"call.arguments.change",
"literal.number.change",
"io.output.change"
] | 893,051 | 893,050 | u226951654 | cpp |
p03077 | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<double> VD;
typedef pair<int, int> P1;
typedef long long int ll;
// number
#define INF 1e9
#define NUM 1000000007
// itr
#define all(x) begin(x), end(x)
// repeat
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
// max,min
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
// function
/*ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a%b);
}*/
/*ll lcm(ll a,ll b) {
ll g = gcd(a, b);
retur5n a * (b / g);
}*/
int dig(int a) {
int sum = 0;
while (a) {
sum += a % 10;
a /= 10;
}
return sum;
}
// grid template
int x[] = {-1, 0, 1, 0};
int y[] = {0, -1, 0, 1};
int xx[] = {-1, -1, 1, 1};
int yy[] = {1, -1, 1, -1};
int main() {
ll a, b, c, d, e, n;
cin >> n >> a >> b >> c >> d >> e;
ll ans = min({a, b, c, d, e});
cout << (ll)(ceil(n / ans) + 5) << endl;
} | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<double> VD;
typedef pair<int, int> P1;
typedef long long int ll;
// number
#define INF 1e9
#define NUM 1000000007
// itr
#define all(x) begin(x), end(x)
// repeat
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
// max,min
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
// function
/*ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a%b);
}*/
/*ll lcm(ll a,ll b) {
ll g = gcd(a, b);
retur5n a * (b / g);
}*/
int dig(int a) {
int sum = 0;
while (a) {
sum += a % 10;
a /= 10;
}
return sum;
}
// grid template
int x[] = {-1, 0, 1, 0};
int y[] = {0, -1, 0, 1};
int xx[] = {-1, -1, 1, 1};
int yy[] = {1, -1, 1, -1};
int main() {
double a, b, c, d, e, n;
cin >> n >> a >> b >> c >> d >> e;
double ans = min({a, b, c, d, e});
cout << (ll)(ceil(n / ans) + 4) << endl;
// cout << floor(n / ans) << endl;
} | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change"
] | 893,052 | 893,050 | u226951654 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pi;
#define trace(x) cout << #x << "=" << x << "\n";
#define llp 1000000007
#define mod 1000000007
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define deb(x) cerr << #x << " = " << x << endl;
int32_t main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(5);
REP(i, 0, 5) { cin >> a[i]; }
sort(a.begin(), a.end());
int small = a[0];
int ans;
ans = 5;
int div = n / a[0];
// deb(div);
ans += div;
// deb(ans);
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pi;
#define trace(x) cout << #x << "=" << x << "\n";
#define llp 1000000007
#define mod 1000000007
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define deb(x) cerr << #x << " = " << x << endl;
int32_t main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(5);
REP(i, 0, 5) { cin >> a[i]; }
sort(a.begin(), a.end());
int small = a[0];
int ans;
ans = 5;
int div = (n - 1) / a[0];
// deb(div);
ans += div;
// deb(ans);
cout << ans << "\n";
return 0;
} | [] | 893,055 | 893,056 | u946432910 | cpp |
p03077 | // #pragma GCC optimize ("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
// #include <type_traits>
using namespace std;
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
#define fou(i, a, n) for (int i = a; i < n; i++)
#define fod(i, a, n) for (int i = n - 1; i >= a; i--)
#define rep(n) fou(_, 0, n)
#define tra(a, x) for (auto &a : x)
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define sz(xs) ((int)(xs).size())
#define all(xs) xs.begin(), xs.end()
#define lla(xs) xs.rbegin(), xs.rend()
#define sum(xs) accumulate(all(xs), 0)
#define sortup(xs) sort(all(xs))
#define sortdown(xs) sort(lla(xs))
#define reverse(xs) reverse(all(xs))
#define contain(xs, n) (find(all(xs), n) != xs.end())
#define unique(xs) xs.erase(unique(all(xs)), xs.end())
#define search(xs, n) distance(xs.begin(), find(all(xs), n))
#define count(xs, n) count(all(xs), n)
// #define vecmin(xs) *min_element(all(xs))
// #define vecmax(xs) *max_element(all(xs))
template <class C> void mini(C &a, C b) { a = min(a, b); }
template <class C> void maxi(C &a, C b) { a = max(a, b); }
// 複数，シフト，演算
// #define newvec(T,n,xs) vector<T> xs(n)
#define in(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define invec(T, n, ...) \
vector<T> __VA_ARGS__; \
T t; \
_cinvec(t, n, __VA_ARGS__)
#define invec2(T, n, xs, ys) \
vector<T> xs(n), ys(n); \
fou(i, 0, n) cin >> xs.at(i) >> ys.at(i)
#define invec3(T, n, xs, ys, zs) \
vector<T> xs(n), ys(n), zs(n); \
fou(i, 0, n) cin >> xs.at(i) >> ys.at(i) >> zs[i]
// #define Cinss(T, n, m, xs) Vec2(T, n, m, xs); For(i, n) For(j, m) cin >>
// xs[i][j] #define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T,
// x); map[x] ++; }
#define out(...) _cout(__VA_ARGS__)
#define outvec(xs) \
tra(x, xs) cout << x << " "; \
cout << endl
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
void _cout() {}
template <class Head, class... Tail> void _cout(Head &&head, Tail &&...tail) {
cout << head << endl;
_cout(forward<Tail>(tail)...);
}
template <class Type> void _cinvec(Type t, int n) {}
template <class Type, class Head, class... Tail>
void _cinvec(Type t, int n, Head &&head, Tail &&...tail) {
rep(n) {
cin >> t;
head.eb(t);
}
_cinvec(t, n, forward<Tail>(tail)...);
}
#define int int64_t
// #define double long double
// map,文字列処理
signed main() {
in(int, n, a, b, c, d, e);
int m = min({a, b, c, d, e});
int x = n / m + 5;
out(x);
} | // #pragma GCC optimize ("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
// #include <type_traits>
using namespace std;
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
#define fou(i, a, n) for (int i = a; i < n; i++)
#define fod(i, a, n) for (int i = n - 1; i >= a; i--)
#define rep(n) fou(_, 0, n)
#define tra(a, x) for (auto &a : x)
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define sz(xs) ((int)(xs).size())
#define all(xs) xs.begin(), xs.end()
#define lla(xs) xs.rbegin(), xs.rend()
#define sum(xs) accumulate(all(xs), 0)
#define sortup(xs) sort(all(xs))
#define sortdown(xs) sort(lla(xs))
#define reverse(xs) reverse(all(xs))
#define contain(xs, n) (find(all(xs), n) != xs.end())
#define unique(xs) xs.erase(unique(all(xs)), xs.end())
#define search(xs, n) distance(xs.begin(), find(all(xs), n))
#define count(xs, n) count(all(xs), n)
// #define vecmin(xs) *min_element(all(xs))
// #define vecmax(xs) *max_element(all(xs))
template <class C> void mini(C &a, C b) { a = min(a, b); }
template <class C> void maxi(C &a, C b) { a = max(a, b); }
// 複数，シフト，演算
// #define newvec(T,n,xs) vector<T> xs(n)
#define in(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define invec(T, n, ...) \
vector<T> __VA_ARGS__; \
T t; \
_cinvec(t, n, __VA_ARGS__)
#define invec2(T, n, xs, ys) \
vector<T> xs(n), ys(n); \
fou(i, 0, n) cin >> xs.at(i) >> ys.at(i)
#define invec3(T, n, xs, ys, zs) \
vector<T> xs(n), ys(n), zs(n); \
fou(i, 0, n) cin >> xs.at(i) >> ys.at(i) >> zs[i]
// #define Cinss(T, n, m, xs) Vec2(T, n, m, xs); For(i, n) For(j, m) cin >>
// xs[i][j] #define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T,
// x); map[x] ++; }
#define out(...) _cout(__VA_ARGS__)
#define outvec(xs) \
tra(x, xs) cout << x << " "; \
cout << endl
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
void _cout() {}
template <class Head, class... Tail> void _cout(Head &&head, Tail &&...tail) {
cout << head << endl;
_cout(forward<Tail>(tail)...);
}
template <class Type> void _cinvec(Type t, int n) {}
template <class Type, class Head, class... Tail>
void _cinvec(Type t, int n, Head &&head, Tail &&...tail) {
rep(n) {
cin >> t;
head.eb(t);
}
_cinvec(t, n, forward<Tail>(tail)...);
}
#define int int64_t
// #define double long double
// map,文字列処理
signed main() {
in(int, n, a, b, c, d, e);
int m = min({a, b, c, d, e});
int x = (n - 1) / m + 5;
out(x);
} | [] | 893,067 | 893,068 | u408927978 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int main(void) {
ll n;
cin >> n;
vector<ll> a(5);
rep(i, 5) { cin >> a[i]; }
sort(ALL(a));
print(4 + (int)ceil((double)n / (double)a[0]));
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int main(void) {
ll n;
cin >> n;
vector<ll> a(5);
rep(i, 5) { cin >> a[i]; }
sort(ALL(a));
print(4 + (ll)ceil((double)n / (double)a[0]));
} | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 893,069 | 893,070 | u650565403 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int main(void) {
ll n;
cin >> n;
vector<ll> a(5);
rep(i, 5) { cin >> a[i]; }
sort(ALL(a));
print(4 + ceil((double)n / (double)a[0]));
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int main(void) {
ll n;
cin >> n;
vector<ll> a(5);
rep(i, 5) { cin >> a[i]; }
sort(ALL(a));
print(4 + (ll)ceil((double)n / (double)a[0]));
} | [
"type_conversion.add"
] | 893,071 | 893,070 | u650565403 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a, b, c, d, e, x, ans;
cin >> n >> a >> b >> c >> d >> e;
x = min(min(min(min(a, b), c), d), e);
ans = (n - 1) / x + 5;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
long long n, a, b, c, d, e, x, ans;
cin >> n >> a >> b >> c >> d >> e;
x = min(min(min(min(a, b), c), d), e);
ans = (n - 1) / x + 5;
cout << ans << endl;
}
| [
"preprocessor.define.value.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,072 | 893,073 | u352228045 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
long long roundup(long long N, long long a) {
long long result;
if (N % a == 0) {
return N / a;
} else {
return N / a + N - N % a;
}
}
int main() {
long long N;
vector<long long> a(5);
vector<long long> b(5);
cin >> N;
long long m = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0) {
m = a[i];
} else {
m = min(m, a[i]);
}
}
long long result = roundup(N, m) + 4;
cout << result << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long roundup(long long N, long long a) {
long long result;
if (N % a == 0) {
return N / a;
} else {
return N / a + 1;
}
}
int main() {
long long N;
vector<long long> a(5);
vector<long long> b(5);
cin >> N;
long long m = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0) {
m = a[i];
} else {
m = min(m, a[i]);
}
}
long long result = roundup(N, m) + 4;
cout << result << endl;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 893,074 | 893,075 | u311517735 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, x, mn = 123;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> x;
mn = min(x, mn);
}
cout << n / mn + (n % mn == 0 ? 4 : 5) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, x, mn = 1e+16;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> x;
mn = min(x, mn);
}
cout << n / mn + (n % mn == 0 ? 4 : 5) << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 893,080 | 893,081 | u798086274 | cpp |
p03077 | #define ll long long
#define vv(t) vector<vector<t>>
#define v(t) vector<t>
#define vvi vector<vector<int>>
#define vi vector<int>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#include <algorithm>
#include <iostream>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
// cin.tie(0);
// sync_with_stdio(false);
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
int main(int argc, const char *argv[]) {
ll mini = 1000000000000001;
ll peaple;
cin >> peaple;
rep(i, 5) {
ll tmp;
cin >> tmp;
mini = min(mini, tmp);
}
ll cnt = peaple / mini;
cout << cnt + 5 << endl;
return 0;
}
| #define ll long long
#define vv(t) vector<vector<t>>
#define v(t) vector<t>
#define vvi vector<vector<int>>
#define vi vector<int>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#include <algorithm>
#include <iostream>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
// cin.tie(0);
// sync_with_stdio(false);
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
int main(int argc, const char *argv[]) {
ll mini = 1000000000000001;
ll peaple;
cin >> peaple;
rep(i, 5) {
ll tmp;
cin >> tmp;
mini = min(mini, tmp);
}
ll cnt = --peaple / mini;
cout << cnt + 5 << endl;
return 0;
}
| [] | 893,094 | 893,095 | u602301472 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define kuriage(x) x += 10 - x % 10;
#define mod(cans) cans % 10 * *9 + 7;
#define vecin(x, y) \
for (int i = 0; i < x; i++) { \
cin >> y[i]; \
}
#define debug(x) cout << "Debug" << x << "\n"
typedef long long ll;
using namespace std;
int main() {
ll n, r, ans = 0;
cin >> n;
ll tr[5];
vecin(5, tr);
ans = tr[0];
// debug(1);
for (int i = 0; i < 5; i++)
ans = min(ans, tr[i]);
// debug(2);
if (ans >= n) {
cout << "5\n";
} else if (n % ans == 0) {
r = (n / ans) + 4;
} else {
r = (n / ans) + 5;
}
// debug(3);
cout << r << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define kuriage(x) x += 10 - x % 10;
#define mod(cans) cans % 10 * *9 + 7;
#define vecin(x, y) \
for (int i = 0; i < x; i++) { \
cin >> y[i]; \
}
#define debug(x) cout << "Debug" << x << "\n"
typedef long long ll;
using namespace std;
int main() {
ll n, r, ans = 0;
cin >> n;
ll tr[5];
vecin(5, tr);
ans = tr[0];
// debug(1);
for (int i = 0; i < 5; i++)
ans = min(ans, tr[i]);
// debug(2);
if (ans >= n) {
r = 5;
} else if (n % ans == 0) {
r = (n / ans) + 4;
} else {
r = (n / ans) + 5;
}
// debug(3);
cout << r << "\n";
return 0;
} | [] | 893,103 | 893,104 | u001577246 | cpp |
p03077 | #include <cstdio>
#include <string>
using namespace std;
#define COUNT 5
int main(void) {
int a, b, c, d, e;
long long int n;
long long int capa[COUNT];
int i;
scanf("%lld", &n);
for (i = 0; i < COUNT; i++) {
scanf("%d", &capa[i]);
}
long long int minCapa = capa[0];
for (i = 1; i < COUNT; i++) {
if (capa[i] < minCapa) {
minCapa = capa[i];
}
}
long long int durationAtMinCapa = (n + minCapa - 1) / minCapa;
printf("%lld\n", durationAtMinCapa + 4);
fflush(stdout);
return 0;
}
| #include <cstdio>
#include <string>
using namespace std;
#define COUNT 5
int main(void) {
int a, b, c, d, e;
long long int n;
long long int capa[COUNT];
int i;
scanf("%lld", &n);
for (i = 0; i < COUNT; i++) {
scanf("%lld", &capa[i]);
}
long long int minCapa = capa[0];
for (i = 1; i < COUNT; i++) {
if (capa[i] < minCapa) {
minCapa = capa[i];
}
}
long long int durationAtMinCapa = (n + minCapa - 1) / minCapa;
printf("%lld\n", durationAtMinCapa + 4);
fflush(stdout);
return 0;
}
| [
"literal.string.change",
"call.arguments.change"
] | 893,110 | 893,111 | u925478083 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
ll n, a, b, c, d, e, ans = 5;
cin >> n >> a >> b >> c >> d >> e;
ans += n /
max({(n - 1) / a, (n - 1) / b, (n - 1) / c, (n - 1) / d, (n - 1) / e});
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
ll n, a, b, c, d, e, ans = 5;
cin >> n >> a >> b >> c >> d >> e;
ans += max({(n - 1) / a, (n - 1) / b, (n - 1) / c, (n - 1) / d, (n - 1) / e});
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 893,120 | 893,121 | u997023236 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<unsigned long> a(5);
vector<unsigned long> c(5);
unsigned long n;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
c[0] = n;
for (unsigned long i = 0; i < 5; i++) {
c[i] = (unsigned long)ceil(n / a[i]);
}
unsigned long m = *max_element(c.begin(), c.end());
m += 5;
cout << m << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<unsigned long> a(5);
vector<unsigned long> c(5);
unsigned long n;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
c[0] = n;
for (unsigned long i = 0; i < 5; i++) {
c[i] = (unsigned long)ceil((double)n / a[i]);
}
unsigned long m = *max_element(c.begin(), c.end());
m += 4;
cout << m << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 893,122 | 893,123 | u234531758 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
void solve(long long N, long long A, long long B, long long C, long long D,
long long E) {
vector<ll> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
vec.push_back(D);
vec.push_back(E);
ll m = *min_element(vec.begin(), vec.end());
ll p = (ll)floor(N * 1.0 / m);
printf("%lld", p + 5);
}
int main() {
// FILE* fp_in =
// freopen("/Users/kokinakamura/atcoder-workspace/abc123/C/in_2.txt", "r",
// stdin);
long long N;
scanf("%lld", &N);
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long D;
scanf("%lld", &D);
long long E;
scanf("%lld", &E);
solve(N, A, B, C, D, E);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
void solve(long long N, long long A, long long B, long long C, long long D,
long long E) {
vector<ll> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
vec.push_back(D);
vec.push_back(E);
ll m = *min_element(vec.begin(), vec.end());
ll p = (ll)ceil(N * 1.0 / m);
printf("%lld", p + 4);
}
int main() {
// FILE* fp_in =
// freopen("/Users/kokinakamura/atcoder-workspace/abc123/C/in_2.txt", "r",
// stdin);
long long N;
scanf("%lld", &N);
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long D;
scanf("%lld", &D);
long long E;
scanf("%lld", &E);
solve(N, A, B, C, D, E);
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 893,126 | 893,127 | u302684639 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
void solve(long long N, long long A, long long B, long long C, long long D,
long long E) {
vector<ll> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
vec.push_back(D);
vec.push_back(E);
ll m = *min_element(vec.begin(), vec.end());
ll p = (ll)floor(N * 1.0 / m);
printf("%lld", p + 5);
}
int main() {
// FILE* fp_in =
// freopen("/Users/kokinakamura/atcoder-workspace/abc123/C/in_3.txt", "r",
// stdin);
long long N;
scanf("%lld", &N);
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long D;
scanf("%lld", &D);
long long E;
scanf("%lld", &E);
solve(N, A, B, C, D, E);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
void solve(long long N, long long A, long long B, long long C, long long D,
long long E) {
vector<ll> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
vec.push_back(D);
vec.push_back(E);
ll m = *min_element(vec.begin(), vec.end());
ll p = (ll)ceil(N * 1.0 / m);
printf("%lld", p + 4);
}
int main() {
// FILE* fp_in =
// freopen("/Users/kokinakamura/atcoder-workspace/abc123/C/in_2.txt", "r",
// stdin);
long long N;
scanf("%lld", &N);
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long D;
scanf("%lld", &D);
long long E;
scanf("%lld", &E);
solve(N, A, B, C, D, E);
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 893,128 | 893,127 | u302684639 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long a;
cin >> n >> a;
long long m = a;
for (int i = 0; i < 4; i++) {
cin >> a;
m = min(m, a);
}
cout << n / m + 5 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long a;
cin >> n >> a;
long long m = a;
for (int i = 0; i < 4; i++) {
cin >> a;
m = min(m, a);
}
cout << (n - 1) / m + 5 << endl;
}
| [] | 893,140 | 893,141 | u685726857 | cpp |
p03077 | #include <iostream>
using namespace std;
#define CAP_MIN 1000000000000001
int main(void) {
long long n, capacity[5];
// long long cap_min = long long(pow(10, 15))+1;
long long cap_min = CAP_MIN;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
if (cap_min > capacity[i]) {
cap_min = capacity[i];
}
}
long long ret = (long long)n / cap_min;
ret += 5;
cout << ret << endl;
return 0;
} | #include <iostream>
using namespace std;
#define CAP_MIN 1000000000000001
int main(void) {
long long n, capacity[5];
// long long cap_min = long long(pow(10, 15))+1;
long long cap_min = CAP_MIN;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
if (cap_min > capacity[i]) {
cap_min = capacity[i];
}
}
long long ret = (n - 1) / cap_min;
ret += 5;
cout << ret << endl;
return 0;
} | [] | 893,142 | 893,143 | u728082661 | cpp |
p03077 | #include <iostream>
using namespace std;
#define CAP_MIN 1000000000000001
int main(void) {
long long n, capacity[5];
// long long cap_min = long long(pow(10, 15))+1;
long long cap_min = CAP_MIN;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
if (cap_min > capacity[i]) {
cap_min = capacity[i];
}
}
long long ret = n / cap_min;
ret += 5;
cout << ret << endl;
return 0;
} | #include <iostream>
using namespace std;
#define CAP_MIN 1000000000000001
int main(void) {
long long n, capacity[5];
// long long cap_min = long long(pow(10, 15))+1;
long long cap_min = CAP_MIN;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
if (cap_min > capacity[i]) {
cap_min = capacity[i];
}
}
long long ret = (n - 1) / cap_min;
ret += 5;
cout << ret << endl;
return 0;
} | [] | 893,144 | 893,143 | u728082661 | cpp |
p03077 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int main() {
ll n;
ll a[5];
cin >> n;
ll m = 0;
rep(i, 5) {
cin >> a[i];
m = max(m, a[i]);
}
ll ans = n / m + 4;
if (n % m != 0)
ans++;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int main() {
ll n;
ll a[5];
cin >> n;
ll m = 1000000000000000;
rep(i, 5) {
cin >> a[i];
m = min(m, a[i]);
}
ll ans = n / m + 4;
if (n % m != 0)
ans++;
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 893,145 | 893,146 | u791593901 | cpp |
p03077 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL = (LL)1e19;
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << 5LL + max({n / a, n / b, n / c, n / d, n / e}) << endl;
} | #include <bits/stdc++.h>
//#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL = (LL)1e19;
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
n--;
cout << 5LL + max({n / a, n / b, n / c, n / d, n / e}) << endl;
} | [
"expression.unary.arithmetic.add"
] | 893,151 | 893,152 | u544732702 | cpp |
p03077 |
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
long long int n;
scanf("%lld", &n);
long long int c[5];
for (int i = 0; i < 5; i++) {
scanf("%d", &c[i]);
}
long long int min_c = c[0];
for (int i = 0; i < 5; i++) {
min_c = min(min_c, c[i]);
}
printf("%lld\n", (n + min_c - 1) / min_c + 4);
return 0;
} |
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
long long int n;
scanf("%lld", &n);
long long int c[5];
for (int i = 0; i < 5; i++) {
scanf("%lld", &c[i]);
}
long long int min_c = c[0];
for (int i = 0; i < 5; i++) {
min_c = min(min_c, c[i]);
}
printf("%lld\n", (n + min_c - 1) / min_c + 4);
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 893,153 | 893,154 | u289709148 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long sum, temp, min;
cin >> sum >> min;
for (int i = 0; i < 4; i++) {
cin >> temp;
if (temp < min)
min = temp;
}
cout << 5 + (sum + min - 1) / min << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long sum, temp, min;
cin >> sum >> min;
for (int i = 0; i < 4; i++) {
cin >> temp;
if (temp < min)
min = temp;
}
cout << 4 + (sum + min - 1) / min << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 893,162 | 893,163 | u905802918 | cpp |
p03077 | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
ll N, A[5];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
REP(i, 5) cin >> A[i];
ll mn = *min_element(A, A + 5);
cout << 5 + N / mn << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
ll N, A[5];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
REP(i, 5) cin >> A[i];
ll mn = *min_element(A, A + 5);
cout << 5 + (N - 1) / mn << endl;
} | [] | 893,168 | 893,169 | u533920479 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int a[5] = {A, B, C, D, E};
sort(a, a + 5);
cout << N / a[0] + 5;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int a[5] = {A, B, C, D, E};
sort(a, a + 5);
cout << (N - 1) / a[0] + 5;
} | [] | 893,170 | 893,171 | u582357587 | cpp |
p03077 | #include <stdio.h>
int main() {
long long N;
long long move[5];
scanf("%lld", &N);
scanf("%lld", &move[0]);
long long min = move[0];
for (int i = 0; i < 5; i++) {
scanf("%lld", &move[i]);
if (min > move[i]) {
min = move[i];
}
}
long long ans = ((N + min - 1) / min) + 4;
printf("%lld\n", ans);
} | #include <stdio.h>
int main() {
long long N;
long long move[5];
scanf("%lld", &N);
scanf("%lld", &move[0]);
long long min = move[0];
for (int i = 1; i < 5; i++) {
scanf("%lld", &move[i]);
if (min > move[i]) {
min = move[i];
}
}
long long ans = ((N + min - 1) / min) + 4;
printf("%lld\n", ans);
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 893,172 | 893,173 | u303722032 | cpp |
p03077 | #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) \
for (int var = (from), var##down = ((int)(to)) < ((int)(from)); \
var##down ? (var >= (int)(to)) : (var <= (int)(to)); \
var##down ? var-- : var++)
#define UPTO(var, from, to) for (int var = (from); var <= ((int)(to)); var++)
#define DOWNTO(var, from, to) for (int var = (from); var >= ((int)(to)); var--)
#define FOR(var, to) UPTO(var, 0, (to)-1)
#define DOWN(var, from) DOWNTO(var, (from)-1, 0)
#define INIT(var, val) FOR(i, countof(var)) var[i] = val
#define INPUT(var) FOR(i, countof(var)) cin >> var[i]
#define INPUT1(var) FOR(i, countof(var)) cin >> var[i], var[i]--
#define SORT(v) qsort(v, countof(v), sizeof(*v), int_less)
#define SORTT(v) qsort(v, countof(v), sizeof(*v), int_greater)
#define QSORT(v, b) qsort(v, countof(v), sizeof(*v), b)
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;
static const int MOD = 1000000007;
static const int INF = ((1 << 30) - 1);
static const s64 LINF = ((1LL << 62) - 1);
struct Comb {
std::vector<std::vector<s64>> a;
Comb(int n) { // O(n^2)
a.resize(n + 1);
FOR(i, n + 1) {
a[i].resize(i + 1, 1);
UPTO(j, 1, i - 1) a[i][j] = a[i - 1][j] + a[i - 1][j];
}
}
s64 ncr(int n, int r) {
assert(n >= 0);
assert(n <= (int)a.size());
assert(r >= 0);
assert(r <= n);
return a[n][r];
}
};
#define gc(c) (c) = getchar()
int ri() {
int c, s = 0, r = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
s64 rs64() {
s64 r = 0;
int c, s;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
int int_less(const void *a, const void *b) {
return (*(const int *)a - *(const int *)b);
}
int int_greater(const void *a, const void *b) {
return (*(const int *)b - *(const int *)a);
}
std::string operator*(const std::string &s, int n) {
std::string res;
FOR(i, n) res += s;
return res;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class A, class B>
std::ostream &operator<<(std::ostream &os, std::pair<A, B> a) {
os << a.fi << "," << a.se;
return os;
}
int main() {
s64 n = rs64();
s64 min = LINF;
FOR(i, 5) min = std::min(min, rs64());
std::cout << 5 + (n - 1) / min << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) \
for (int var = (from), var##down = ((int)(to)) < ((int)(from)); \
var##down ? (var >= (int)(to)) : (var <= (int)(to)); \
var##down ? var-- : var++)
#define UPTO(var, from, to) for (int var = (from); var <= ((int)(to)); var++)
#define DOWNTO(var, from, to) for (int var = (from); var >= ((int)(to)); var--)
#define FOR(var, to) UPTO(var, 0, (to)-1)
#define DOWN(var, from) DOWNTO(var, (from)-1, 0)
#define INIT(var, val) FOR(i, countof(var)) var[i] = val
#define INPUT(var) FOR(i, countof(var)) cin >> var[i]
#define INPUT1(var) FOR(i, countof(var)) cin >> var[i], var[i]--
#define SORT(v) qsort(v, countof(v), sizeof(*v), int_less)
#define SORTT(v) qsort(v, countof(v), sizeof(*v), int_greater)
#define QSORT(v, b) qsort(v, countof(v), sizeof(*v), b)
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;
static const int MOD = 1000000007;
static const int INF = ((1 << 30) - 1);
static const s64 LINF = ((1LL << 62) - 1);
struct Comb {
std::vector<std::vector<s64>> a;
Comb(int n) { // O(n^2)
a.resize(n + 1);
FOR(i, n + 1) {
a[i].resize(i + 1, 1);
UPTO(j, 1, i - 1) a[i][j] = a[i - 1][j] + a[i - 1][j];
}
}
s64 ncr(int n, int r) {
assert(n >= 0);
assert(n <= (int)a.size());
assert(r >= 0);
assert(r <= n);
return a[n][r];
}
};
#define gc(c) (c) = getchar()
int ri() {
int c, s = 0, r = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
s64 rs64() {
s64 r = 0;
int c, s = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
int int_less(const void *a, const void *b) {
return (*(const int *)a - *(const int *)b);
}
int int_greater(const void *a, const void *b) {
return (*(const int *)b - *(const int *)a);
}
std::string operator*(const std::string &s, int n) {
std::string res;
FOR(i, n) res += s;
return res;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class A, class B>
std::ostream &operator<<(std::ostream &os, std::pair<A, B> a) {
os << a.fi << "," << a.se;
return os;
}
int main() {
s64 n = rs64();
s64 min = LINF;
FOR(i, 5) min = std::min(min, rs64());
std::cout << 5 + (n - 1) / min << std::endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 893,180 | 893,181 | u040490988 | cpp |
p03077 | #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) \
for (int var = (from), var##down = ((int)(to)) < ((int)(from)); \
var##down ? (var >= (int)(to)) : (var <= (int)(to)); \
var##down ? var-- : var++)
#define UPTO(var, from, to) for (int var = (from); var <= ((int)(to)); var++)
#define DOWNTO(var, from, to) for (int var = (from); var >= ((int)(to)); var--)
#define FOR(var, to) UPTO(var, 0, (to)-1)
#define DOWN(var, from) DOWNTO(var, (from)-1, 0)
#define INIT(var, val) FOR(i, countof(var)) var[i] = val
#define INPUT(var) FOR(i, countof(var)) cin >> var[i]
#define INPUT1(var) FOR(i, countof(var)) cin >> var[i], var[i]--
#define SORT(v) qsort(v, countof(v), sizeof(*v), int_less)
#define SORTT(v) qsort(v, countof(v), sizeof(*v), int_greater)
#define QSORT(v, b) qsort(v, countof(v), sizeof(*v), b)
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;
static const int MOD = 1000000007;
static const int INF = ((1 << 30) - 1);
static const s64 LINF = ((1LL << 62) - 1);
struct Comb {
std::vector<std::vector<s64>> a;
Comb(int n) { // O(n^2)
a.resize(n + 1);
FOR(i, n + 1) {
a[i].resize(i + 1, 1);
UPTO(j, 1, i - 1) a[i][j] = a[i - 1][j] + a[i - 1][j];
}
}
s64 ncr(int n, int r) {
assert(n >= 0);
assert(n <= (int)a.size());
assert(r >= 0);
assert(r <= n);
return a[n][r];
}
};
#define gc(c) (c) = getchar()
int ri() {
int c, s = 0, r = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
s64 rs64() {
s64 r;
int c, s;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
int int_less(const void *a, const void *b) {
return (*(const int *)a - *(const int *)b);
}
int int_greater(const void *a, const void *b) {
return (*(const int *)b - *(const int *)a);
}
std::string operator*(const std::string &s, int n) {
std::string res;
FOR(i, n) res += s;
return res;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class A, class B>
std::ostream &operator<<(std::ostream &os, std::pair<A, B> a) {
os << a.fi << "," << a.se;
return os;
}
int main() {
s64 n = rs64();
s64 min = LINF;
FOR(i, 5) min = std::min(min, rs64());
std::cout << 5 + (n - 1) / min << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) \
for (int var = (from), var##down = ((int)(to)) < ((int)(from)); \
var##down ? (var >= (int)(to)) : (var <= (int)(to)); \
var##down ? var-- : var++)
#define UPTO(var, from, to) for (int var = (from); var <= ((int)(to)); var++)
#define DOWNTO(var, from, to) for (int var = (from); var >= ((int)(to)); var--)
#define FOR(var, to) UPTO(var, 0, (to)-1)
#define DOWN(var, from) DOWNTO(var, (from)-1, 0)
#define INIT(var, val) FOR(i, countof(var)) var[i] = val
#define INPUT(var) FOR(i, countof(var)) cin >> var[i]
#define INPUT1(var) FOR(i, countof(var)) cin >> var[i], var[i]--
#define SORT(v) qsort(v, countof(v), sizeof(*v), int_less)
#define SORTT(v) qsort(v, countof(v), sizeof(*v), int_greater)
#define QSORT(v, b) qsort(v, countof(v), sizeof(*v), b)
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;
static const int MOD = 1000000007;
static const int INF = ((1 << 30) - 1);
static const s64 LINF = ((1LL << 62) - 1);
struct Comb {
std::vector<std::vector<s64>> a;
Comb(int n) { // O(n^2)
a.resize(n + 1);
FOR(i, n + 1) {
a[i].resize(i + 1, 1);
UPTO(j, 1, i - 1) a[i][j] = a[i - 1][j] + a[i - 1][j];
}
}
s64 ncr(int n, int r) {
assert(n >= 0);
assert(n <= (int)a.size());
assert(r >= 0);
assert(r <= n);
return a[n][r];
}
};
#define gc(c) (c) = getchar()
int ri() {
int c, s = 0, r = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
s64 rs64() {
s64 r = 0;
int c, s = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
int int_less(const void *a, const void *b) {
return (*(const int *)a - *(const int *)b);
}
int int_greater(const void *a, const void *b) {
return (*(const int *)b - *(const int *)a);
}
std::string operator*(const std::string &s, int n) {
std::string res;
FOR(i, n) res += s;
return res;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class A, class B>
std::ostream &operator<<(std::ostream &os, std::pair<A, B> a) {
os << a.fi << "," << a.se;
return os;
}
int main() {
s64 n = rs64();
s64 min = LINF;
FOR(i, 5) min = std::min(min, rs64());
std::cout << 5 + (n - 1) / min << std::endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 893,182 | 893,181 | u040490988 | cpp |
p03077 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int i;
long long min = 0;
long long a;
long double N;
long long T;
long double t;
long long ANS;
vector<long long> A;
cin >> N;
for (i = 0; i < 5; i++) {
cin >> a;
A.push_back(a);
}
vector<long long>::iterator itr = min_element(A.begin(), A.end());
T = ceil(N / *itr);
ANS = T + 5;
cout << ANS << endl;
} | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int i;
long long min = 0;
long long a;
long double N;
long long T;
long double t;
long long ANS;
vector<long long> A;
cin >> N;
for (i = 0; i < 5; i++) {
cin >> a;
A.push_back(a);
}
vector<long long>::iterator itr = min_element(A.begin(), A.end());
T = ceil(N / *itr);
ANS = T + 4;
cout << ANS << endl;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 893,183 | 893,184 | u230139835 | cpp |
p03077 | #include <cstring>
#include <iostream>
//#include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#define si(a) scanf("%d", &a)
#define sl(a) scanf("%lld", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define sll(a, b) scanf("%lld%lld", &a, &b)
#define queues priority_queue
#define mod 998244353
#define mem(a) memset(a, 0, sizeof(a));
#define def(a) ((a) & (-a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
// priority_queue<int,vector<int >,greater<int > >q;
const ll INF = 0x3f3f3f3f;
// const double E=exp(1);
// const double PI=acos(-1);
using namespace std;
int main() {
int n, s[6];
cin >> n;
for (int i = 1; i <= 5; i++)
cin >> s[i];
sort(s + 1, s + 6);
int t = 5;
t += n % s[1] ? n / s[1] : n / s[1] - 1;
cout << t << endl;
}
/******************************************
** ** ******** **
** ** ** ** **
** ** ** ** **
** ** ** ** **
** *********** ** **
** ** ** ******** **
******************************************/
| #include <cstring>
#include <iostream>
//#include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#define si(a) scanf("%d", &a)
#define sl(a) scanf("%lld", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define sll(a, b) scanf("%lld%lld", &a, &b)
#define queues priority_queue
#define mod 998244353
#define mem(a) memset(a, 0, sizeof(a));
#define def(a) ((a) & (-a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
// priority_queue<int,vector<int >,greater<int > >q;
const ll INF = 0x3f3f3f3f;
// const double E=exp(1);
// const double PI=acos(-1);
using namespace std;
int main() {
ll n, s[6];
cin >> n;
for (int i = 1; i <= 5; i++)
cin >> s[i];
sort(s + 1, s + 6);
ll t = 5;
t += n % s[1] ? n / s[1] : n / s[1] - 1;
cout << t << endl;
}
/******************************************
** ** ******** **
** ** ** ** **
** ** ** ** **
** ** ** ** **
** *********** ** **
** ** ** ******** **
******************************************/
| [
"variable_declaration.type.change"
] | 893,187 | 893,188 | u114362525 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B, C, D, E, m;
cin >> N >> A >> B >> C >> D >> E;
m = min(N, min(A, min(B, min(C, min(D, E)))));
if (m % N == 0)
cout << 4 + N / m << endl;
else
cout << 5 + N / m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B, C, D, E, m;
cin >> N >> A >> B >> C >> D >> E;
m = min(N, min(A, min(B, min(C, min(D, E)))));
if (N % m == 0)
cout << 4 + N / m << endl;
else
cout << 5 + N / m << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 893,196 | 893,197 | u732571394 | cpp |
p03077 | #include <iostream>
using namespace std;
#define LL long long
int main() {
LL n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
a = min(a, b);
a = min(a, c);
a = min(a, d);
a = min(a, e);
cout << (n + a - 1) / a << '\n';
return 0;
} | #include <iostream>
using namespace std;
#define LL long long
int main() {
LL n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
a = min(a, b);
a = min(a, c);
a = min(a, d);
a = min(a, e);
cout << (n + a - 1) / a + 4 << '\n';
return 0;
} | [
"expression.operation.binary.add"
] | 893,202 | 893,203 | u440556285 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<long long> n(5);
long long k, ans;
std::cin >> k;
for (int i = 0; i < 5; i++) {
std::cin >> n[i];
}
ans = k / *(std::min_element(n.begin(), n.end())) + 5;
std::cout << ans << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<long long> n(5);
long long k, ans;
std::cin >> k;
for (int i = 0; i < 5; i++) {
std::cin >> n[i];
}
ans = (k - 1) / *(std::min_element(n.begin(), n.end())) + 5;
std::cout << ans << std::endl;
return 0;
} | [] | 893,206 | 893,207 | u133607477 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
#define NUM 5
int main(void) {
LL N, a[NUM];
cin >> N;
for (int i = 0; i < NUM; i++) {
cin >> a[i];
}
cout << 4 + ceil((double)N / (*min_element(a, a + NUM))) << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
#define NUM 5
int main(void) {
LL N, a[NUM];
cin >> N;
for (int i = 0; i < NUM; i++) {
cin >> a[i];
}
cout << (LL)(4 + ceil((double)N / (*min_element(a, a + NUM)))) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 893,215 | 893,216 | u843830192 | cpp |
p03077 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i < b; i++)
typedef long long int lld;
typedef vector<lld> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
int main() {
long n, k;
cin >> n;
vl x;
rep(i, 5) {
cin >> k;
x.push_back(k);
}
long min = *min_element(x.begin(), x.end());
long ans;
if (n % min == 0)
ans = n / min + 6;
else
ans = n / min + 5;
cout << ans;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i < b; i++)
typedef long long int lld;
typedef vector<lld> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
int main() {
long n, k;
cin >> n;
vl x;
rep(i, 5) {
cin >> k;
x.push_back(k);
}
long min = *min_element(x.begin(), x.end());
long ans;
if (n % min == 0)
ans = n / min + 4;
else
ans = n / min + 5;
cout << ans;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 893,226 | 893,227 | u696415377 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
double A;
double minimum = 0;
for (int i = 0; i < 5; i++) {
cin >> A;
minimum = min(minimum, A);
}
cout << (long long)ceil(N / minimum) + 4 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
double A;
double minimum = 10000000000000010LL;
for (int i = 0; i < 5; i++) {
cin >> A;
minimum = min(minimum, A);
}
cout << (long long)ceil(N / minimum) + 4 << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"literal.number.type.widen.change"
] | 893,236 | 893,237 | u609576113 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#define REP(i, n) FOR(i, 0, n, 1)
#define RFOR(i, a, b, c) for (int i = (int)(a); i >= (int)(b); i -= (int)(c))
#define RREP(i, n) RFOR(i, n, 0, 1)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERSE(c) reverse(ALL(c))
#define UNIQ(c) unique(ALL(c))
#define LB(c, x) lower_bound(c.begin(), c.end(), x)
#define UB(c, x) upper_bound(c.begin(), c.end(), x)
#define LI(c, x) distance(c.begin(), LB(c, x))
#define UI(c, x) distance(c.begin(), UB(c, x))
// functions
template <class T> T ceil(T a, T b) { return (a + b - 1) / b; }
template <class T> T round(T a, T b) { return (a + b / 2) / b; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// main
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
vector<ll> X(5);
cin >> N;
REP(i, 5) { cin >> X[i]; }
ll m = *min_element(X.begin(), X.end());
cout << N / m + 5 << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#define REP(i, n) FOR(i, 0, n, 1)
#define RFOR(i, a, b, c) for (int i = (int)(a); i >= (int)(b); i -= (int)(c))
#define RREP(i, n) RFOR(i, n, 0, 1)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERSE(c) reverse(ALL(c))
#define UNIQ(c) unique(ALL(c))
#define LB(c, x) lower_bound(c.begin(), c.end(), x)
#define UB(c, x) upper_bound(c.begin(), c.end(), x)
#define LI(c, x) distance(c.begin(), LB(c, x))
#define UI(c, x) distance(c.begin(), UB(c, x))
// functions
template <class T> T ceil(T a, T b) { return (a + b - 1) / b; }
template <class T> T round(T a, T b) { return (a + b / 2) / b; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// main
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
vector<ll> X(5);
cin >> N;
REP(i, 5) { cin >> X[i]; }
ll m = *min_element(X.begin(), X.end());
cout << ceil(N, m) + 4 << endl;
return 0;
}
| [
"call.add",
"io.output.change",
"call.arguments.change",
"literal.number.change"
] | 893,250 | 893,251 | u164300951 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#define REP(i, n) FOR(i, 0, n, 1)
#define RFOR(i, a, b, c) for (int i = (int)(a); i >= (int)(b); i -= (int)(c))
#define RREP(i, n) RFOR(i, n, 0, 1)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERSE(c) reverse(ALL(c))
#define UNIQ(c) unique(ALL(c))
#define LB(c, x) lower_bound(c.begin(), c.end(), x)
#define UB(c, x) upper_bound(c.begin(), c.end(), x)
#define LI(c, x) distance(c.begin(), LB(c, x))
#define UI(c, x) distance(c.begin(), UB(c, x))
// functions
template <class T> T ceil(T a, T b) { return (a + b - 1) / b; }
template <class T> T round(T a, T b) { return (a + b / 2) / b; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// main
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
vector<ll> X(5);
cin >> N;
REP(i, 5) { cin >> X[i]; }
ll m = *min_element(X.begin(), X.end());
cout << N / m + 5 << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#define REP(i, n) FOR(i, 0, n, 1)
#define RFOR(i, a, b, c) for (int i = (int)(a); i >= (int)(b); i -= (int)(c))
#define RREP(i, n) RFOR(i, n, 0, 1)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERSE(c) reverse(ALL(c))
#define UNIQ(c) unique(ALL(c))
#define LB(c, x) lower_bound(c.begin(), c.end(), x)
#define UB(c, x) upper_bound(c.begin(), c.end(), x)
#define LI(c, x) distance(c.begin(), LB(c, x))
#define UI(c, x) distance(c.begin(), UB(c, x))
// functions
template <class T> T ceil(T a, T b) { return (a + b - 1) / b; }
template <class T> T round(T a, T b) { return (a + b / 2) / b; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// main
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
vector<ll> X(5);
cin >> N;
REP(i, 5) { cin >> X[i]; }
ll m = *min_element(X.begin(), X.end());
cout << (N - 1) / m + 5 << endl;
return 0;
}
| [] | 893,250 | 893,252 | u164300951 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
long n, a, b, c, d, e, m;
cin >> n >> a >> b >> c >> d >> e;
m = min({a, b, c, d, e});
// cout << "min:" << m << endl;
cout << setprecision(10) << ceil((double)n / m) + 4 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
long n, a, b, c, d, e, m;
cin >> n >> a >> b >> c >> d >> e;
m = min({a, b, c, d, e});
// cout << "min:" << m << endl;
cout << setprecision(16) << ceil((double)n / m) + 4 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 893,253 | 893,254 | u477694598 | cpp |
p03077 | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) \
int N; \
cin >> N;
#define makes(s) \
string s; \
cin >> s;
#define maked(d) \
double d; \
cin >> d;
#define makev(v, N) \
vi v(N); \
rep(N) cin >> v[i];
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using msi = map<string, int>;
template <typename T> void say(T s) { cout << s << "\n"; }
template <typename T> void say(vector<T> s) {
auto itr = s.begin();
cout << *(itr++);
while (itr != s.end()) {
cout << " " << *(itr++);
}
cout << "\n";
}
template <typename T> void say(vector<T> s, char r) {
auto itr = s.begin();
cout << *(itr++);
while (itr != s.end()) {
cout << r << *(itr++);
}
cout << "\n";
}
void yn(bool b) {
if (b)
say("yes");
else
say("no");
}
void Yn(bool b) {
if (b)
say("Yes");
else
say("No");
}
void YN(bool b) {
if (b)
say("YES");
else
say("NO");
}
void Yay(bool b) {
if (b)
say("Yay!");
else
say(":(");
}
template <typename T> void maxi(T &a, T b) { a = max(a, b); }
template <typename T> void mini(T &a, T b) { a = min(a, b); }
void exact_say(double x) {
cout << setprecision(numeric_limits<double>::max_digits10) << x << endl;
}
template <typename T> vector<vector<T>> fill_vector(int h, int w, T val) {
vector<vector<T>> ret;
vector<T> v(w, val);
rep(h) ret.push_back(v);
return ret;
}
template <typename T> T max(vector<T> v) {
T ret = v[0];
Rep(1, v.size()) maxi(ret, v[i]);
return ret;
}
template <typename T> T min(vector<T> v) {
T ret = v[0];
Rep(1, v.size()) mini(ret, v[i]);
return ret;
}
bool comp(int a, int b) {
if (a % 10 == 0)
return false;
if (b % 10 == 0)
return true;
return a % 10 < b % 10;
}
signed main() {
makei(n);
makev(v, 5ll);
sort(all(v));
int btl = v.front();
exact_say(5 + floor((double)n / btl));
};
| #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) \
int N; \
cin >> N;
#define makes(s) \
string s; \
cin >> s;
#define maked(d) \
double d; \
cin >> d;
#define makev(v, N) \
vi v(N); \
rep(N) cin >> v[i];
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using msi = map<string, int>;
template <typename T> void say(T s) { cout << s << "\n"; }
template <typename T> void say(vector<T> s) {
auto itr = s.begin();
cout << *(itr++);
while (itr != s.end()) {
cout << " " << *(itr++);
}
cout << "\n";
}
template <typename T> void say(vector<T> s, char r) {
auto itr = s.begin();
cout << *(itr++);
while (itr != s.end()) {
cout << r << *(itr++);
}
cout << "\n";
}
void yn(bool b) {
if (b)
say("yes");
else
say("no");
}
void Yn(bool b) {
if (b)
say("Yes");
else
say("No");
}
void YN(bool b) {
if (b)
say("YES");
else
say("NO");
}
void Yay(bool b) {
if (b)
say("Yay!");
else
say(":(");
}
template <typename T> void maxi(T &a, T b) { a = max(a, b); }
template <typename T> void mini(T &a, T b) { a = min(a, b); }
void exact_say(double x) {
cout << setprecision(numeric_limits<double>::max_digits10) << x << endl;
}
template <typename T> vector<vector<T>> fill_vector(int h, int w, T val) {
vector<vector<T>> ret;
vector<T> v(w, val);
rep(h) ret.push_back(v);
return ret;
}
template <typename T> T max(vector<T> v) {
T ret = v[0];
Rep(1, v.size()) maxi(ret, v[i]);
return ret;
}
template <typename T> T min(vector<T> v) {
T ret = v[0];
Rep(1, v.size()) mini(ret, v[i]);
return ret;
}
bool comp(int a, int b) {
if (a % 10 == 0)
return false;
if (b % 10 == 0)
return true;
return a % 10 < b % 10;
}
signed main() {
makei(n);
makev(v, 5ll);
sort(all(v));
int btl = v.front();
exact_say(5 + ceil((double)n / btl) - 1);
};
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 893,259 | 893,260 | u698760125 | cpp |
p03077 | #include <iostream>
using namespace std;
long long int mini(long long int a, long long int b) {
return ((b == 0) ? a : (a < b) ? a : b);
}
int main() {
long long int a[5] = {}, N = 0;
long long int ans = 0;
long long int min = 1000000000000001;
// int minum = 0,tmp = 0;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a[i];
// min = tmp;
min = mini(min, a[i]);
// minum = (min != tmp)?i: minum;
}
/*for (int i = 0; i < minum; i++)
{
}*/
ans = 4 + N / min + (N % min == 0) ? 0 : 1;
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
long long int mini(long long int a, long long int b) {
return ((b == 0) ? a : (a < b) ? a : b);
}
int main() {
long long int a[5] = {}, N = 0;
long long int ans = 0;
long long int min = 1000000000000001;
// int minum = 0,tmp = 0;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a[i];
// min = tmp;
min = mini(min, a[i]);
// minum = (min != tmp)?i: minum;
}
/*for (int i = 0; i < minum; i++)
{
}*/
ans = 4 + N / min + ((N % min == 0) ? 0 : 1);
cout << ans;
return 0;
} | [] | 893,261 | 893,262 | u444349080 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n"
#define ll long long
int main() {
ll n;
vector<ll> a(5);
cin >> n;
REP(i, 5) cin >> a[i];
ll Min = *min_element(a.begin(), a.end());
ll ans = n / (2 * Min - 1) + 4;
OUT(ans);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n"
#define ll long long
int main() {
ll n;
vector<ll> a(5);
cin >> n;
REP(i, 5) cin >> a[i];
ll Min = *min_element(a.begin(), a.end());
ll ans = (n + Min - 1) / Min + 4;
OUT(ans);
return 0;
} | [
"expression.operation.binary.remove"
] | 893,270 | 893,271 | u860374704 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n"
#define ll long long
int main() {
int n;
vector<int> a(5);
cin >> n;
REP(i, 5) cin >> a[i];
int Min = *min_element(a.begin(), a.end());
int ans = (n + Min - 1) / Min + 4;
OUT(ans);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n"
#define ll long long
int main() {
ll n;
vector<ll> a(5);
cin >> n;
REP(i, 5) cin >> a[i];
ll Min = *min_element(a.begin(), a.end());
ll ans = (n + Min - 1) / Min + 4;
OUT(ans);
return 0;
} | [
"variable_declaration.type.change"
] | 893,272 | 893,271 | u860374704 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define fore(i, s, e) for (int i = s; i < e; i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[5];
fore(i, 0, 5) cin >> a[i];
sort(a, a + 5);
cout << 5 + n / a[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fore(i, s, e) for (int i = s; i < e; i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[5];
fore(i, 0, 5) cin >> a[i];
sort(a, a + 5);
cout << 5 + (n - 1) / a[0] << endl;
return 0;
} | [] | 893,275 | 893,276 | u783593194 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define INT_MAX 2147483647
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
// int binary_search(int key){
// //isOKを満たす要素のうち最小のインデックスを返す。（要ソート）
// int left = -1;
// int right = N;
//
// while(right - left > 1){
// int mid = left + (right - left)/2;
//
// if(isOK(mid, key)) right=mid;
// else left=mid;
// }
//
// return right;
// }
int main() {
ll N;
cin >> N;
vint a(5);
rep(i, 5) { cin >> a[i]; }
ll mn = vmin(a);
cout << N / mn + 5 << endl;
}
//
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define INT_MAX 2147483647
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
// int binary_search(int key){
// //isOKを満たす要素のうち最小のインデックスを返す。（要ソート）
// int left = -1;
// int right = N;
//
// while(right - left > 1){
// int mid = left + (right - left)/2;
//
// if(isOK(mid, key)) right=mid;
// else left=mid;
// }
//
// return right;
// }
int main() {
ll N;
cin >> N;
vint a(5);
rep(i, 5) { cin >> a[i]; }
ll mn = vmin(a);
cout << (N - 1) / mn + 5 << endl;
}
//
| [] | 893,279 | 893,280 | u644070128 | cpp |
p03077 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
REP(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
const ll INF = 1LL << 60;
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
#define int long long
inline void my_io() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cout << fixed << setprecision(10);
}
signed main() {
ll n;
vector<ll> v(5, 0);
ll mi = INF;
cin >> n;
REP(i, 5) {
cin >> v[i];
mi = min(mi, v[i]);
}
cout << ceil((double)n / (double)mi) + 4 << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
REP(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
const ll INF = 1LL << 60;
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
#define int long long
inline void my_io() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cout << fixed << setprecision(10);
}
signed main() {
ll n;
vector<ll> v(5, 0);
ll mi = INF;
cin >> n;
REP(i, 5) {
cin >> v[i];
mi = min(mi, v[i]);
}
cout << (ll)ceil((double)n / (double)mi) + 4 << endl;
} | [
"type_conversion.add"
] | 893,283 | 893,284 | u800551451 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long ca[5];
long long N;
cin >> N;
for (int i = 0; i < 5; i++)
cin >> ca[i];
long long min = ca[0];
long long ans;
for (int i = 0; i < 5; i++) {
if (min > ca[i])
min = ca[i];
}
ans = N / min;
if (N % min)
ans++;
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
long long ca[5];
long long N;
cin >> N;
for (int i = 0; i < 5; i++)
cin >> ca[i];
long long min = ca[0];
long long ans;
for (int i = 0; i < 5; i++) {
if (min > ca[i])
min = ca[i];
}
ans = N / min;
if (N % min)
ans++;
ans += 4;
cout << ans << endl;
}
| [
"assignment.add"
] | 893,292 | 893,293 | u058186113 | cpp |
p03077 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define MOD 1000000007
#define INF 1ll << 30
#define MAX 100010
#define eps 1e-11
#define bit_max 1ll << 32
#define _USE_MATH_DEFINES
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
long long int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long int ans = min(a, min(b, min(c, min(d, e))));
ans = (n / ans + n % ans == 0 ? 0 : 1) + 4;
cout << ans;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define MOD 1000000007
#define INF 1ll << 30
#define MAX 100010
#define eps 1e-11
#define bit_max 1ll << 32
#define _USE_MATH_DEFINES
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
long long int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long int ans = min(a, min(b, min(c, min(d, e))));
ans = (n / ans) + (n % ans == 0 ? 0 : 1);
ans += 4;
cout << ans;
return 0;
} | [
"expression.operation.binary.change",
"assignment.change"
] | 893,307 | 893,308 | u566864240 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll m;
for (int i = 0; i < 5; i++) {
ll tmp;
cin >> tmp;
chmin(m, tmp);
}
ll ans = 4LL + (N / m) + (N % m != 0);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll m = 1e18;
for (int i = 0; i < 5; i++) {
ll tmp;
cin >> tmp;
chmin(m, tmp);
}
ll ans = 4LL + (N / m) + (N % m != 0);
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 893,315 | 893,316 | u666394517 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#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 <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long int
const int INF = 1001001001001001LL;
const int MOD = 1000000007;
signed main() {
int n;
cin >> n;
int m = INF;
for (int i = 0; i < 5; i++) {
int val;
cin >> val;
m = min(m, val);
}
cout << (n - m + 1) / m + 5 << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#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 <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long int
const int INF = 1001001001001001LL;
const int MOD = 1000000007;
signed main() {
int n;
cin >> n;
int m = INF;
for (int i = 0; i < 5; i++) {
int val;
cin >> val;
m = min(m, val);
}
cout << (n + m - 1) / m + 4 << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 893,331 | 893,332 | u212904724 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
void solveA() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
void solveB() {
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
int min = 9;
int minad = 0;
for (int i = 0; i < 5; i++) {
if (a[i] % 10 < min && a[i] % 10 != 0) {
min = a[i] % 10;
minad = i;
}
}
int ans = 0;
for (int i = 0; i < 5; i++) {
if (i == minad || a[i] % 10 == 0) {
ans += a[i];
} else {
ans = ans + 10 - a[i] % 10 + a[i];
}
}
cout << ans << endl;
}
void solveC() {
long long n;
vector<long long> a{5};
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a.begin(), a.end());
cout << (n + a[0] - 1) / a[0] + 4 << endl;
}
void solveD() {}
int main() { solveC(); }
| #include <bits/stdc++.h>
using namespace std;
void solveA() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
void solveB() {
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
int min = 9;
int minad = 0;
for (int i = 0; i < 5; i++) {
if (a[i] % 10 < min && a[i] % 10 != 0) {
min = a[i] % 10;
minad = i;
}
}
int ans = 0;
for (int i = 0; i < 5; i++) {
if (i == minad || a[i] % 10 == 0) {
ans += a[i];
} else {
ans = ans + 10 - a[i] % 10 + a[i];
}
}
cout << ans << endl;
}
void solveC() {
long long n;
vector<long long> a(5);
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a.begin(), a.end());
cout << (n + a[0] - 1) / a[0] + 4 << endl;
}
void solveD() {}
int main() { solveC(); }
| [] | 893,333 | 893,334 | u735499035 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#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 <stack>
#include <string>
#include <utility>
#include <vector>
#define chmin(a, b) ((a) = min((a), (b)))
#define chmax(a, b) ((a) = max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1);
const double eps = 1e-10;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mi = min({a, b, c, d, e});
cout << n / mi + 5 << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#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 <stack>
#include <string>
#include <utility>
#include <vector>
#define chmin(a, b) ((a) = min((a), (b)))
#define chmax(a, b) ((a) = max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1);
const double eps = 1e-10;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mi = min({a, b, c, d, e});
cout << (n - 1) / mi + 5 << endl;
} | [] | 893,336 | 893,337 | u049420296 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
int main() {
int i, j, k, m, l, f, x, y, z;
string s;
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
sort(a, a + 5);
if (a[0] >= n) {
cout << 5;
return 0;
}
cout << (n - a[0] + 1) / a[0] + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
int main() {
int i, j, k, m, l, f, x, y, z;
string s;
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
sort(a, a + 5);
if (a[0] >= n) {
cout << 5;
return 0;
}
cout << (n + a[0] - 1) / a[0] + 4 << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 893,338 | 893,339 | u854612287 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
int main() {
int i, j, k, m, l, f, x, y, z;
string s;
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
sort(a, a + 5);
if (a[0] >= n) {
cout << 5;
return 0;
}
cout << (n - a[0] + 1) / a[0] + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
int main() {
int i, j, k, m, l, f, x, y, z;
string s;
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
sort(a, a + 5);
if (a[0] >= n) {
cout << 5;
return 0;
}
cout << (n + a[0] - 1) / a[0] + 4 << endl;
} | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 893,340 | 893,339 | u854612287 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
long long a[10];
while (cin >> n) {
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a, a + 5);
long long sum;
if (n < a[0]) {
cout << "5" << endl;
continue;
}
if (n % 2 == 0) {
sum = (n / a[0]) + 4;
} else {
n = n - 1;
sum = (n / a[0]) + 5;
}
cout << sum << endl;
}
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
long long a[10];
while (cin >> n) {
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a, a + 5);
long long sum;
if (n < a[0]) {
cout << "5" << endl;
continue;
}
if (n % a[0] == 0) {
sum = (n / a[0]) + 4;
} else {
n = n - 1;
sum = (n / a[0]) + 5;
}
cout << sum << endl;
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 893,347 | 893,348 | u234252849 | cpp |
p03077 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> a(5);
long long i, n;
cin >> n;
for (i = 0; i < 5; ++i) {
cin >> a.at(i);
}
long long min = a.at(0);
for (i = 1; i < 5; ++i) {
if (min > a.at(i)) {
min = a.at(i);
}
}
if (min % n) {
cout << n / min + 5 << endl;
} else {
cout << n / min + 4 << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> a(5);
long long i, n;
cin >> n;
for (i = 0; i < 5; ++i) {
cin >> a.at(i);
}
long long min = a.at(0);
for (i = 1; i < 5; ++i) {
if (min > a.at(i)) {
min = a.at(i);
}
}
if (n % min) {
cout << n / min + 5 << endl;
} else {
cout << n / min + 4 << endl;
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 893,355 | 893,356 | u446795710 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
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;
}
/* define const */
const long long INF = (1LL << 60);
/* end defineing */
int main() {
long long n;
long long a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 4);
// cout << a[0] << a[1] << a[2] << a[3] << a[4] << endl;
long long tmp;
if (n % a[0] != 0)
tmp = n / a[0] + 1;
else
tmp = n / a[0];
tmp += 4;
cout << tmp << endl;
}
| #include <bits/stdc++.h>
using namespace std;
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;
}
/* define const */
const long long INF = (1LL << 60);
/* end defineing */
int main() {
long long n;
long long a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
// cout << a[0] << a[1] << a[2] << a[3] << a[4] << endl;
long long tmp;
if (n % a[0] != 0)
tmp = n / a[0] + 1;
else
tmp = n / a[0];
tmp += 4;
cout << tmp << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 893,357 | 893,358 | u218759384 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll a[5], n, t;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
if (n > a[0]) {
if (n / a[0] == 0)
t = n / a[0];
else
t = n / a[0] + 1;
} else if (n <= a[0])
t = 1;
cout << t + 4;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll a[5], n, t;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
if (n > a[0]) {
if (n % a[0] == 0)
t = n / a[0];
else
t = n / a[0] + 1;
} else if (n <= a[0])
t = 1;
cout << t + 4;
return 0;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 893,363 | 893,364 | u543120093 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 300010
ll n, a, b, c, d, e;
int main() {
cin >> n >> a >> b >> c >> d >> e;
ll ans = 0;
a = min(a, min(b, min(c, d)));
a = min(a, e);
ans = ceil(n / a) + 5ll;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 300010
ll n, a, b, c, d, e;
int main() {
cin >> n >> a >> b >> c >> d >> e;
ll ans = 0;
a = min(a, min(b, min(c, d)));
a = min(a, e);
ans = (n - 1) / a + 5ll;
cout << ans;
} | [
"call.arguments.change"
] | 893,368 | 893,369 | u993519359 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, a;
cin >> n;
ll mn = 1LL << 60;
for (int i = 0; i < 5; i++) {
cin >> a;
mn = min(mn, a);
}
cout << 5 + n / mn << "\n";
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, a;
cin >> n;
ll mn = 1LL << 60;
for (int i = 0; i < 5; i++) {
cin >> a;
mn = min(mn, a);
}
cout << 5 + (n - 1) / mn << "\n";
return 0;
} | [] | 893,373 | 893,374 | u334624175 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
ll N, A[5];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
rep(i, 0, 5) cin >> A[i];
ll mi = infl;
rep(i, 0, 5) chmin(mi, A[i]);
ll ans = (N + mi - 1) / mi * 5;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
ll N, A[5];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
rep(i, 0, 5) cin >> A[i];
ll mi = infl;
rep(i, 0, 5) chmin(mi, A[i]);
ll ans = 4 + (N + mi - 1) / mi;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 893,375 | 893,376 | u141378465 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
int s(int n) { return ceil((double)n / 10) * 10; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << ceil((double)n / min({a, b, c, d, e})) + 4 << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
int s(int n) { return ceil((double)n / 10) * 10; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << fixed << (ll)ceil((double)n / min({a, b, c, d, e})) + 4 << endl;
}
| [
"io.output.change"
] | 893,377 | 893,378 | u277556971 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << endl
#define p7(a, b, c, d, e, f, g) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) \
for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n) \
idp { \
rep(i, n) { cout << x[i] << " "; } \
puts(""); \
}
#define dump2(x, n) \
idp { \
rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
puts(""); \
}
#define dumpi(x) \
idp { \
foreach (it, x) { cout << (*it) << " "; } \
puts(""); \
}
#define dumpi2(x) \
idp { \
foreach (it, x) { cout << "[" << (it)->F << " , " << (it)->S << "] "; } \
puts(""); \
}
#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h) \
rep(i, h) { \
rep(j, w) cout << a[i][j] << " "; \
puts(""); \
}
typedef pair<li, li> PI;
inline li divup(li x, li y) {
li res = x / y;
return res + (x % y > 0);
}
int main() {
li n;
li q[5];
rep(i, 5) { cin >> q[i]; }
li m = q[0];
repp(i, 1, 5) { m = min(m, q[i]); }
cout << divup(n, m) + 4 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << endl
#define p7(a, b, c, d, e, f, g) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) \
for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n) \
idp { \
rep(i, n) { cout << x[i] << " "; } \
puts(""); \
}
#define dump2(x, n) \
idp { \
rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
puts(""); \
}
#define dumpi(x) \
idp { \
foreach (it, x) { cout << (*it) << " "; } \
puts(""); \
}
#define dumpi2(x) \
idp { \
foreach (it, x) { cout << "[" << (it)->F << " , " << (it)->S << "] "; } \
puts(""); \
}
#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h) \
rep(i, h) { \
rep(j, w) cout << a[i][j] << " "; \
puts(""); \
}
typedef pair<li, li> PI;
inline li divup(li x, li y) {
li res = x / y;
return res + (x % y > 0);
}
int main() {
li n;
cin >> n;
li q[5];
rep(i, 5) { cin >> q[i]; }
li m = q[0];
repp(i, 1, 5) { m = min(m, q[i]); }
cout << divup(n, m) + 4 << endl;
return 0;
} | [] | 893,379 | 893,380 | u962966398 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int x = 0;
if (n % min(a, min(b, min(c, min(d, e)))) != 0) {
x = 1;
}
cout << n / min(a, min(b, min(c, min(d, e)))) + 5 - 1 + x << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int x = 0;
if (n % min(a, min(b, min(c, min(d, e)))) != 0) {
x = 1;
}
cout << n / min(a, min(b, min(c, min(d, e)))) + 5 - 1 + x << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 893,388 | 893,389 | u678503521 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repbit(n) for (ll bit = 0, bit < (1 << n), bit++)
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr int modpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
int main() {
ll n, t;
cin >> n;
vector<ll> h(5);
rep(i, 0, 5) cin >> h[i];
sort(h.begin(), h.end());
t = n / h[0];
cout << t + 5;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repbit(n) for (ll bit = 0, bit < (1 << n), bit++)
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr int modpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
int main() {
ll n, t;
cin >> n;
vector<ll> h(5);
rep(i, 0, 5) cin >> h[i];
sort(h.begin(), h.end());
t = (n - 1) / h[0];
cout << t + 5;
}
| [] | 893,396 | 893,397 | u356489231 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
long long n;
std::vector<long long> aList(5);
std::cin >> n;
for (int i = 0; i < 5; i++)
std::cin >> aList[i];
std::sort(aList.begin(), aList.end());
long long ans = n / aList[0] + 5;
if (n % aList[0] == 0)
ans++;
std::cout << ans << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
long long n;
std::vector<long long> aList(5);
std::cin >> n;
for (int i = 0; i < 5; i++)
std::cin >> aList[i];
std::sort(aList.begin(), aList.end());
long long ans = n / aList[0] + 5;
if (n % aList[0] == 0)
ans--;
std::cout << ans << std::endl;
return 0;
} | [] | 893,412 | 893,413 | u865621256 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll res = min(A, min(B, min(C, min(D, E))));
cout << 5LL + N / res << "\n";
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll res = min(A, min(B, min(C, min(D, E))));
cout << 5LL + (N - 1) / res << "\n";
} | [] | 893,414 | 893,415 | u235155157 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll res = min(A, min(B, min(C, min(D, E))));
cout << 5 + N / res << "\n";
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll res = min(A, min(B, min(C, min(D, E))));
cout << 5LL + (N - 1) / res << "\n";
} | [
"literal.number.type.widen.change"
] | 893,416 | 893,415 | u235155157 | cpp |
p03077 | #include <iostream>
using namespace std;
int MinIndex(const unsigned long long int *const array, const int size);
int main() {
unsigned long long int N;
unsigned long long int board[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> board[i];
int bottleNeckIndex = MinIndex(board, sizeof(board));
unsigned long long int ans =
(unsigned long long int)(N / board[bottleNeckIndex]) + 4;
if ((N % board[bottleNeckIndex]) != 0)
ans++;
cout << ans;
return 0;
}
int MinIndex(const unsigned long long int *const array, const int size) {
int minIndex = 0;
unsigned long long int minValue = array[0];
for (int i = 1; i < size; i++) {
if (array[i] < minValue) {
minIndex = i;
minValue = array[i];
}
}
return minIndex;
} | #include <iostream>
using namespace std;
int MinIndex(const unsigned long long int *const array, const int size);
int main() {
unsigned long long int N;
unsigned long long int board[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> board[i];
int bottleNeckIndex = MinIndex(board, 5);
unsigned long long int ans =
(unsigned long long int)(N / board[bottleNeckIndex]) + 4;
if ((N % board[bottleNeckIndex]) != 0)
ans++;
cout << ans;
return 0;
}
int MinIndex(const unsigned long long int *const array, const int size) {
int minIndex = 0;
unsigned long long int minValue = array[0];
for (int i = 1; i < size; i++) {
if (array[i] < minValue) {
minIndex = i;
minValue = array[i];
}
}
return minIndex;
} | [
"call.arguments.change"
] | 893,423 | 893,424 | u045289957 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#define P pair
// stoi(s): string to int
// stod(s): string to double
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
// DBL_MIN
// DBL_MAX
// LDBL_MIN
// LDBL_MAX
// A-Z: 65~90
// a-z: 97~122
// |a-z| = 26
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
ll n;
cin >> n;
vector<ll> v(5);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
vsort(v);
ll ans = ceil(n / v[0]) + 4;
cout << ans << endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#define P pair
// stoi(s): string to int
// stod(s): string to double
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
// DBL_MIN
// DBL_MAX
// LDBL_MIN
// LDBL_MAX
// A-Z: 65~90
// a-z: 97~122
// |a-z| = 26
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
ll n;
cin >> n;
vector<ll> v(5);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
vsort(v);
ll ans = ceil(1.0 * n / v[0]) + 4;
cout << ans << endl;
}
| [
"assignment.change"
] | 893,425 | 893,426 | u493080913 | cpp |
p03077 | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 100000000;
const int N = 2e6 + 10;
void fast() { std::ios_base::sync_with_stdio(0); }
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt","w",stdout);
#endif*/
ll n;
cin >> n;
vector<ll> arr(n);
for (ll &i : arr)
cin >> i;
ll v = *min_element(arr.begin(), arr.end());
cout << (n + v - 1) / v + 4;
return 0;
} | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 100000000;
const int N = 2e6 + 10;
void fast() { std::ios_base::sync_with_stdio(0); }
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt","w",stdout);
#endif*/
ll n;
cin >> n;
vector<ll> arr(5);
for (ll &i : arr)
cin >> i;
ll v = *min_element(arr.begin(), arr.end());
cout << (n + v - 1) / v + 4;
return 0;
} | [] | 893,438 | 893,439 | u692176965 | cpp |
p03077 | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 100000000;
const int N = 2e6 + 10;
void fast() { std::ios_base::sync_with_stdio(0); }
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt","w",stdout);
#endif*/
ll n;
cin >> n;
vector<ll> arr(n);
for (ll &i : arr)
cin >> i;
ll v = *min_element(arr.begin(), arr.end());
cout << (n + v - 1LL) / v + 4 << endl;
return 0;
} | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 100000000;
const int N = 2e6 + 10;
void fast() { std::ios_base::sync_with_stdio(0); }
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt","w",stdout);
#endif*/
ll n;
cin >> n;
vector<ll> arr(5);
for (ll &i : arr)
cin >> i;
ll v = *min_element(arr.begin(), arr.end());
cout << (n + v - 1) / v + 4;
return 0;
} | [
"expression.operation.binary.remove"
] | 893,440 | 893,439 | u692176965 | cpp |
p03077 | #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long N;
vector<unsigned long long> trans(5);
unsigned long long time = 0;
int min_i = 0;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans[i];
}
sort(trans.begin(), trans.end());
time = N / trans[0] + 5;
cout << time << endl;
}
| #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long N;
vector<unsigned long long> trans(5);
unsigned long long time = 0;
int min_i = 0;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans[i];
}
sort(trans.begin(), trans.end());
time = (N - 1) / trans[0] + 5;
cout << time << endl;
}
| [] | 893,444 | 893,445 | u774910314 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
int n[8];
n[7] = 1;
n[6] = 0;
for (int i = 0; i < 6; i++) {
cin >> n[i];
}
for (int j = 2; j < 6; j++) {
if (n[1] > n[j]) {
n[7] = j;
n[6] = n[1];
n[1] = n[j];
n[j] = n[6];
} else {
}
}
int a;
if (n[0] % n[1] == 0) {
a = n[0] / n[1];
} else {
a = n[0] / n[1] + 1;
}
cout << (n[7] - 1) + a + (5 - n[7]) << endl;
} | #include <iostream>
using namespace std;
int main() {
long n[8];
n[7] = 1;
n[6] = 0;
for (int i = 0; i < 6; i++) {
cin >> n[i];
}
for (int j = 2; j < 6; j++) {
if (n[1] > n[j]) {
n[7] = j;
n[6] = n[1];
n[1] = n[j];
n[j] = n[6];
} else {
}
}
long a;
if (n[0] % n[1] == 0) {
a = n[0] / n[1];
} else {
a = n[0] / n[1] + 1;
}
cout << (n[7] - 1) + a + (5 - n[7]) << endl;
} | [
"variable_declaration.type.primitive.change"
] | 893,462 | 893,463 | u461896927 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k + 1) / k + 4;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k - 1) / k + 4;
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 893,464 | 893,465 | u684556267 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k) / k + 4;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k - 1) / k + 4;
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 893,466 | 893,465 | u684556267 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + 1) / k + 4;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k - 1) / k + 4;
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 893,467 | 893,465 | u684556267 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long a;
cin >> a;
for (int i = 1; i < 5; i++) {
long long temp;
cin >> temp;
if (temp < a)
a = temp;
}
if (n < a)
cout << 5;
else {
long long time = n / a + 4;
if (n & a == 0)
cout << "a";
else
cout << (time + 1);
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long a;
cin >> a;
for (int i = 1; i < 5; i++) {
long long temp;
cin >> temp;
if (temp < a)
a = temp;
}
if (n <= a)
cout << 5;
else {
long long time = n / a + 4;
if (n % a == 0)
cout << time;
else
cout << (time + 1);
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 893,470 | 893,471 | u606107557 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.