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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, MIN = INF;
cin >> n;
for (int i = 0; i < 5; i++) {
ll z;
cin >> z;
MIN = min(MIN, z);
}
cout << n / MIN + 5;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, MIN = INF;
cin >> n;
for (int i = 0; i < 5; i++) {
ll z;
cin >> z;
MIN = min(MIN, z);
}
cout << (n - 1) / MIN + 5;
}
| [] | 892,044 | 892,043 | u166378830 | cpp |
p03077 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long double n, a;
long double min = 10e15;
cin >> n;
for (int i = 0; i < 5; ++i) {
cin >> a;
if (a <= min)
min = a;
}
cout << ceil(n / min) + 4 << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long double n, a;
long double min = 10e15;
cin >> n;
for (int i = 0; i < 5; ++i) {
cin >> a;
if (a <= min)
min = a;
}
cout << (long long)ceil(n / min) + 4 << endl;
return 0;
}
| [
"type_conversion.add"
] | 892,049 | 892,050 | u510372936 | cpp |
p03077 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int Svec(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
int GCD(int a, int b) {
int r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
int LCM(int a, int b) {
int c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
int Factorial(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
long long int n;
cin >> n;
vector<long long int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
cout << (n + v[0] - 1) / v[0] + 4 << endl;
} | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int Svec(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
int GCD(int a, int b) {
int r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
int LCM(int a, int b) {
int c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
int Factorial(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
long long int n;
cin >> n;
vector<long long int> v(5);
rep(i, 5) cin >> v[i];
sort(v.begin(), v.end());
cout << (n + v[0] - 1) / v[0] + 4 << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 892,053 | 892,054 | u264265458 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int gcd(int a, int b) {
int r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int fac(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
int vec_sum(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
///////////////////////////
int main() {
long long int n, a, b, c, d, e, cnt;
cin >> n >> a >> b >> c >> d >> e;
cnt = min(min(a, b), min(c, min(d, e)));
cout << (n + cnt - 1) / n + 4 << endl;
}
/////////////////////////// | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int gcd(int a, int b) {
int r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int fac(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
int vec_sum(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
///////////////////////////
int main() {
long long int n, a, b, c, d, e, cnt;
cin >> n >> a >> b >> c >> d >> e;
cnt = min(min(a, b), min(c, min(d, e)));
cout << (n + cnt - 1) / cnt + 4 << endl;
}
/////////////////////////// | [
"identifier.change",
"io.output.change"
] | 892,055 | 892,056 | u264265458 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int gcd(int a, int b) {
int r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int fac(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
int vec_sum(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
///////////////////////////
int main() {
long long int n, a, b, c, d, e, cnt;
cin >> n >> a >> b >> c >> d >> e;
cnt = min(min(a, b), min(c, min(d, e)));
cout << (n - cnt + 1) / n + 4 << endl;
}
/////////////////////////// | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int gcd(int a, int b) {
int r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int fac(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
int vec_sum(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
///////////////////////////
int main() {
long long int n, a, b, c, d, e, cnt;
cin >> n >> a >> b >> c >> d >> e;
cnt = min(min(a, b), min(c, min(d, e)));
cout << (n + cnt - 1) / cnt + 4 << endl;
}
/////////////////////////// | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 892,057 | 892,056 | u264265458 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
unsigned long long N;
cin >> N;
unsigned long long tmp;
unsigned long long minimum_transition = 1000000000000001;
for (int ii = 0; ii < 5; ++ii) {
cin >> tmp;
if (minimum_transition > tmp) {
minimum_transition = tmp;
}
}
unsigned long long min = 4;
min += N / minimum_transition + 1;
cout << min << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
unsigned long long N;
cin >> N;
unsigned long long tmp;
unsigned long long minimum_transition = 1000000000000001;
for (int ii = 0; ii < 5; ++ii) {
cin >> tmp;
if (minimum_transition > tmp) {
minimum_transition = tmp;
}
}
unsigned long long min = 4;
min += (N - 1) / minimum_transition + 1;
cout << min << endl;
return 0;
}
| [] | 892,058 | 892,059 | u680331221 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> a(5);
long long int n, m;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
m = min(a[0], a[1]);
for (int i = 2; i < 4; i++)
m = min(m, a[i]);
long long int ans = ceil((double)n / m);
ans += 4;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> a(5);
long long int n, m;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
m = min(a[0], a[1]);
for (int i = 2; i < 5; i++)
m = min(m, a[i]);
long long int ans = ceil((double)n / m);
ans += 4;
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 892,062 | 892,063 | u655844242 | cpp |
p03077 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
ll n;
vector<ll> vec;
cin >> n;
for (int i = 0; i < 5; i++) {
ll a;
cin >> a;
vec.push_back(a);
}
sort(vec.begin(), vec.end());
ll tmp = vec[0];
ll ans = 5 + n / tmp;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
ll n;
vector<ll> vec;
cin >> n;
for (int i = 0; i < 5; i++) {
ll a;
cin >> a;
vec.push_back(a);
}
sort(vec.begin(), vec.end());
ll tmp = vec[0];
ll ans = 5 + (n - 1) / tmp;
cout << ans << endl;
return 0;
}
| [] | 892,073 | 892,074 | u519756887 | cpp |
p03077 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32 = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7 = 1'000'000'007;
constexpr int MOD9 = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void scan() {}
template <class H, class... T> void scan(H &&head, T &&...args) {
std::cin >> head;
scan(std::forward<T>(args)...);
}
template <class T> void scan(std::vector<T> &v) {
for (auto &&i : v) {
scan(i);
}
}
template <class T> T up(T a, T div) { return (a + div - 1) / div; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
scan(N);
vector<ll> v(5);
scan(v);
SORT(v);
ll ans = 5;
ans += N / v[0];
print(ans);
return 0;
} | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32 = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7 = 1'000'000'007;
constexpr int MOD9 = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void scan() {}
template <class H, class... T> void scan(H &&head, T &&...args) {
std::cin >> head;
scan(std::forward<T>(args)...);
}
template <class T> void scan(std::vector<T> &v) {
for (auto &&i : v) {
scan(i);
}
}
template <class T> T up(T a, T div) { return (a + div - 1) / div; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
scan(N);
vector<ll> v(5);
scan(v);
SORT(v);
ll ans = 4;
ans += up(N, v[0]);
print(ans);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 892,075 | 892,076 | u324303263 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long m = min(min(min(a, b), c), min(d, e));
cout << 5 + n / m << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long m = min(min(min(a, b), c), min(d, e));
cout << 5 + (n - 1) / m << endl;
return 0;
} | [] | 892,077 | 892,078 | u110383054 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
long long n, a[5];
int main() {
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
long long b = (n / a[0]);
if (((n / a[0]) == 0) && (b != 0))
b -= 1;
cout << (5 + b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, a[5];
int main() {
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
long long b = (n / a[0]);
if (((n % a[0]) == 0) && (b != 0))
b--;
cout << (5 + b) << endl;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 892,079 | 892,080 | u477516105 | cpp |
p03077 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
unsigned long N;
long double A[5];
cin >> N >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
for (int i = 1; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[i] > A[j]) {
unsigned long tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
}
unsigned long cnt = (unsigned long)(ceill(N / A[0]));
cout << cnt + 4 << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
unsigned long N;
long double A[5];
cin >> N >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[i] > A[j]) {
unsigned long tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
}
unsigned long cnt = (unsigned long)(ceill(N / A[0]));
cout << cnt + 4 << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 892,081 | 892,082 | u204523044 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
double b;
vector<double> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
// printf("%.0f\n",floor(b/a[0])+4);
printf("%.0f\n", ceil(b / a[0]) + 5);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
double b;
vector<double> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", ceil(b / a[0]) + 4);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,088 | 892,089 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
double b;
vector<double> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", floor(b / a[0]) + 4);
// printf("%.0f\n",ceil(b/a[0])+5);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
double b;
vector<double> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", ceil(b / a[0]) + 4);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,090 | 892,089 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
ll b;
vector<ll> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", floor(b / a[0]) + 4);
// printf("%.0f\n",ceil(b/a[0])+5);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
double b;
vector<double> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", ceil(b / a[0]) + 4);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| [
"variable_declaration.type.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,091 | 892,089 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
ll b;
vector<ll> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", ceil(b / a[0]) + 5);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
double b;
vector<double> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", ceil(b / a[0]) + 4);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,093 | 892,089 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
ll b;
vector<ll> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", floor(b / a[0]) + 4);
// printf("%.0f\n",ceil(b/a[0])+5);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
/*-----8<-----8<-----*/
int main() {
ll b;
vector<ll> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", ceil((double)b / a[0]) + 4);
// printf("%.0f\n",ceil(b/a[0])+5);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,091 | 892,094 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
ll b;
vector<ll> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", ceil(b / a[0]) + 5);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
/*-----8<-----8<-----*/
int main() {
ll b;
vector<ll> a(5, 0); //
cin >> b;
for (int i = 0; i <= 4; i++) {
cin >> a[i];
}
sort(all(a));
printf("%.0f\n", ceil((double)b / a[0]) + 4);
// printf("%.0f\n",ceil(b/a[0])+5);
// cout << (b/a[0])+5 <<endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,093 | 892,094 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(5);
rep(i, 5) cin >> a[i];
ll res = 1e16;
rep(i, 5) res = min(res, a[i]);
ll ans1 = n / res;
if (n == res)
ans1 = 0;
// cout << res << endl;//
cout << 5 + ans1 << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(5);
rep(i, 5) cin >> a[i];
ll res = 1e16;
rep(i, 5) res = min(res, a[i]);
ll ans1 = (n - 1) / res;
if (n == res)
ans1 = 0;
// cout << res << endl;//
cout << 5 + ans1 << endl;
} | [] | 892,102 | 892,103 | u274883254 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.rbegin()) x = c.rbegin(); x != c.rend(); x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define pi pair<int, int>
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
vll a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(all(a));
cout << n / a[0] + 5 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.rbegin()) x = c.rbegin(); x != c.rend(); x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define pi pair<int, int>
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
vll a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(all(a));
cout << (n - 1) / a[0] + 5 << endl;
return 0;
} | [] | 892,104 | 892,105 | u682686221 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
ll a[5];
int main() {
ll n;
cin >> n;
rep(i, 5) cin >> a[i];
sort(a, a + 5);
ll mn;
if (a[0] % n) {
mn = n / a[0];
} else {
mn = n / a[0] - 1;
}
cout << 5 + mn << endl;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
ll a[5];
int main() {
ll n;
cin >> n;
rep(i, 5) cin >> a[i];
sort(a, a + 5);
ll mn;
if (n % a[0]) {
mn = n / a[0];
} else {
mn = n / a[0] - 1;
}
cout << 5 + mn << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 892,106 | 892,107 | u926242698 | cpp |
p03077 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
const int INF = 1 << 28;
const long long MOD = 1000000007;
using namespace std;
using Graph = vector<vector<int>>;
template <class T> bool chmin(T &a, T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> using P = pair<T, U>;
vector<int> seen(50, -1);
int counter_for_dfs = 0;
void dfs(Graph &G, int v) {
seen[v] = counter_for_dfs;
counter_for_dfs++;
for (auto v_next : G[v]) {
if (seen[v_next] >= 0)
continue;
dfs(G, v_next);
}
}
void bfs(Graph &G) {
vector<int> dist(G.size(), -1);
queue<int> que;
dist[0] = 0;
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int g : G[v]) {
if (dist[g] != -1)
continue;
dist[g] = dist[v] + 1;
que.push(g);
}
}
for (auto i : dist) {
cout << i << " ";
}
}
int counter[200005] = {};
void bfs2(Graph &G, int p, int x) {
vector<int> dist(G.size(), -1);
queue<int> que;
dist[p] = 0;
que.push(p);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int g : G[v]) {
if (dist[g] != -1)
continue;
dist[g] = dist[v] + 1;
que.push(g);
counter[g] += x;
}
}
}
long long int gcd(long long int a, long long int b) {
long long int c = std::min(a, b);
a = std::max(a, b);
b = c;
while (true) {
c = a % b;
a = b;
b = c;
if (c == 0)
break;
}
return a;
}
int main() {
long long int n;
std::vector<long long int> v(5);
scanf("%lld", &n);
for (int i = 0; i < 5; i++)
scanf("%lld", &v[i]);
long long int mn = *std::min_element(v.begin(), v.end());
printf("%lld", n % mn ? n / mn + 5 : n / mn + 6);
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
const int INF = 1 << 28;
const long long MOD = 1000000007;
using namespace std;
using Graph = vector<vector<int>>;
template <class T> bool chmin(T &a, T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> using P = pair<T, U>;
vector<int> seen(50, -1);
int counter_for_dfs = 0;
void dfs(Graph &G, int v) {
seen[v] = counter_for_dfs;
counter_for_dfs++;
for (auto v_next : G[v]) {
if (seen[v_next] >= 0)
continue;
dfs(G, v_next);
}
}
void bfs(Graph &G) {
vector<int> dist(G.size(), -1);
queue<int> que;
dist[0] = 0;
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int g : G[v]) {
if (dist[g] != -1)
continue;
dist[g] = dist[v] + 1;
que.push(g);
}
}
for (auto i : dist) {
cout << i << " ";
}
}
int counter[200005] = {};
void bfs2(Graph &G, int p, int x) {
vector<int> dist(G.size(), -1);
queue<int> que;
dist[p] = 0;
que.push(p);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int g : G[v]) {
if (dist[g] != -1)
continue;
dist[g] = dist[v] + 1;
que.push(g);
counter[g] += x;
}
}
}
long long int gcd(long long int a, long long int b) {
long long int c = std::min(a, b);
a = std::max(a, b);
b = c;
while (true) {
c = a % b;
a = b;
b = c;
if (c == 0)
break;
}
return a;
}
int main() {
long long int n;
std::vector<long long int> v(5);
scanf("%lld", &n);
for (int i = 0; i < 5; i++)
scanf("%lld", &v[i]);
long long int mn = *std::min_element(v.begin(), v.end());
printf("%lld", n % mn ? n / mn + 5 : n / mn + 4);
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,108 | 892,109 | u586583774 | cpp |
p03077 | typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n--;
ll min1 = 1000000000000000;
rep(i, 5) {
ll a;
cin >> a;
min1 = min(min1, a);
}
cout << n / min1 + 5 << endl;
} | typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
cin >> n;
n--;
ll min1 = 1000000000000000;
rep(i, 5) {
ll a;
cin >> a;
min1 = min(min1, a);
}
cout << n / min1 + 5 << endl;
} | [
"variable_declaration.type.change"
] | 892,116 | 892,117 | u438592861 | cpp |
p03077 | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s), rend(s)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = ((a)-1); i >= (b); i--)
#define pb push_back
#define sz(a) int((a).size())
#define put(a) ((cout) << (a) << (endl))
#define putf(a, n) ((cout) << (fixed) << (setprecision(n)) << (a) << (endl))
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i_i = pair<int, int>;
using ll_ll = pair<ll, ll>;
using d_ll = pair<double, ll>;
using ll_d = pair<ll, double>;
using d_d = pair<double, double>;
static constexpr ll LL_INF = 1LL << 60;
static constexpr int I_INF = 1 << 28;
static constexpr double PI =
static_cast<double>(3.14159265358979323846264338327950288);
static constexpr double EPS = numeric_limits<double>::epsilon();
static map<type_index, const char *const> scanType = {{typeid(int), "%d"},
{typeid(ll), "%lld"},
{typeid(double), "%lf"},
{typeid(char), "%c"}};
template <class T> static void scan(vector<T> &v);
[[maybe_unused]] static void scan(vector<string> &v, bool isWord = true);
template <class T> static inline bool chmax(T &a, T b);
template <class T> static inline bool chmin(T &a, T b);
template <class T> static inline T gcd(T a, T b);
template <class T> static inline T lcm(T a, T b);
template <class A, size_t N, class T>
static void Fill(A (&arr)[N], const T &val);
int main(int argc, char *argv[]) {
ll n;
cin >> n;
vector<ll> trans(5);
scan(trans);
ll m = *min_element(all(trans));
ll t = (n / m) + 1;
put(t + 4);
return 0;
}
template <class T> static void scan(vector<T> &v) {
auto tFormat = scanType[typeid(T)];
for (T &n : v) {
scanf(tFormat, &n);
}
}
static void scan(vector<string> &v, bool isWord) {
if (isWord) {
for (auto &n : v) {
cin >> n;
}
return;
}
int i = 0, size = v.size();
string s;
getline(cin, s);
if (s.size() != 0) {
i++;
v[0] = s;
}
for (; i < size; ++i) {
getline(cin, v[i]);
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline T gcd(T a, T b) { return __gcd(a, b); }
template <class T> inline T lcm(T a, T b) { return (a * b) / gcd(a, b); }
template <class A, size_t N, class T> void Fill(A (&arr)[N], const T &val) {
std::fill((T *)arr, (T *)(arr + N), val);
}
| #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s), rend(s)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = ((a)-1); i >= (b); i--)
#define pb push_back
#define sz(a) int((a).size())
#define put(a) ((cout) << (a) << (endl))
#define putf(a, n) ((cout) << (fixed) << (setprecision(n)) << (a) << (endl))
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i_i = pair<int, int>;
using ll_ll = pair<ll, ll>;
using d_ll = pair<double, ll>;
using ll_d = pair<ll, double>;
using d_d = pair<double, double>;
static constexpr ll LL_INF = 1LL << 60;
static constexpr int I_INF = 1 << 28;
static constexpr double PI =
static_cast<double>(3.14159265358979323846264338327950288);
static constexpr double EPS = numeric_limits<double>::epsilon();
static map<type_index, const char *const> scanType = {{typeid(int), "%d"},
{typeid(ll), "%lld"},
{typeid(double), "%lf"},
{typeid(char), "%c"}};
template <class T> static void scan(vector<T> &v);
[[maybe_unused]] static void scan(vector<string> &v, bool isWord = true);
template <class T> static inline bool chmax(T &a, T b);
template <class T> static inline bool chmin(T &a, T b);
template <class T> static inline T gcd(T a, T b);
template <class T> static inline T lcm(T a, T b);
template <class A, size_t N, class T>
static void Fill(A (&arr)[N], const T &val);
int main(int argc, char *argv[]) {
ll n;
cin >> n;
vector<ll> trans(5);
scan(trans);
ll m = *min_element(all(trans));
ll t = (n / m) + bool(n % m);
put(t + 4);
return 0;
}
template <class T> static void scan(vector<T> &v) {
auto tFormat = scanType[typeid(T)];
for (T &n : v) {
scanf(tFormat, &n);
}
}
static void scan(vector<string> &v, bool isWord) {
if (isWord) {
for (auto &n : v) {
cin >> n;
}
return;
}
int i = 0, size = v.size();
string s;
getline(cin, s);
if (s.size() != 0) {
i++;
v[0] = s;
}
for (; i < size; ++i) {
getline(cin, v[i]);
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline T gcd(T a, T b) { return __gcd(a, b); }
template <class T> inline T lcm(T a, T b) { return (a * b) / gcd(a, b); }
template <class A, size_t N, class T> void Fill(A (&arr)[N], const T &val) {
std::fill((T *)arr, (T *)(arr + N), val);
}
| [
"expression.operation.binary.change",
"call.arguments.add"
] | 892,118 | 892,119 | u209647862 | cpp |
p03077 | #include <bits/stdc++.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
ll N;
ll A[5];
cin >> N;
ll mini = 0;
ll m = 1000000000000001;
rep(i, 5) {
cin >> A[i];
if (m > A[i]) {
mini = i;
m = A[i];
}
}
if (N % A[mini] == 0)
cout << 6 + N / A[mini] << endl;
else
cout << 5 + N / A[mini] << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
ll N;
ll A[5];
cin >> N;
ll mini = 0;
ll m = 1000000000000001;
rep(i, 5) {
cin >> A[i];
if (m > A[i]) {
mini = i;
m = A[i];
}
}
if (N % A[mini] == 0)
cout << 4 + N / A[mini] << endl;
else
cout << 5 + N / A[mini] << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 892,122 | 892,123 | u651802048 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll n, t[5];
cin >> n;
rep(i, 5) cin >> t[i];
// ll t_num[6] = {n, 0, 0, 0, 0, 0};
//
// ll count = 0;
// while(t_num[5] != n){
// ll current_num = 0;
// for(ll i = 5; i > 0; i--){
// if(t_num[i-1] >= t[i-1]){
// t_num[i] += t[i-1];
// t_num[i-1] -= t[i-1];
// }else{
// t_num[i] += min(t[i-1], t_num[i-1]);
// t_num[i-1] -= min(t[i-1], t_num[i-1]);
// }
// current_num += t_num[i];
// if(current_num == n)
// break;
// }
// rep(i, 6){
// cout << t_num[i] << " ";
// }
// cout << endl;
// count++;
// }
sort(t, t + 5);
ll count = 5 + ceil(n / 2.0) - 1;
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll n, t[5];
cin >> n;
rep(i, 5) cin >> t[i];
// ll t_num[6] = {n, 0, 0, 0, 0, 0};
//
// ll count = 0;
// while(t_num[5] != n){
// ll current_num = 0;
// for(ll i = 5; i > 0; i--){
// if(t_num[i-1] >= t[i-1]){
// t_num[i] += t[i-1];
// t_num[i-1] -= t[i-1];
// }else{
// t_num[i] += min(t[i-1], t_num[i-1]);
// t_num[i-1] -= min(t[i-1], t_num[i-1]);
// }
// current_num += t_num[i];
// if(current_num == n)
// break;
// }
// rep(i, 6){
// cout << t_num[i] << " ";
// }
// cout << endl;
// count++;
// }
sort(t, t + 5);
ll count = 5 + ceil(n / (double)t[0]) - 1;
cout << count << endl;
return 0;
}
| [
"call.arguments.change",
"expression.operation.binary.change"
] | 892,124 | 892,125 | u326152409 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll> A;
ll btnk = 1e15 + 1;
rep(i, 5) {
ll tmp;
cin >> tmp;
btnk = min(btnk, tmp);
A.push_back(tmp);
}
ll ans = 5 + N / btnk;
co(ans);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll> A;
ll btnk = 1e15 + 1;
rep(i, 5) {
ll tmp;
cin >> tmp;
btnk = min(btnk, tmp);
A.push_back(tmp);
}
ll ans = 5 + (N - 1) / btnk;
co(ans);
return 0;
}
| [] | 892,128 | 892,129 | u984529214 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll X[5] = {};
ll mini = 1000000000000000;
for (int i = 0; i < 5; i++) {
cin >> X[i];
mini = min(mini, X[i]);
}
cout << (N + mini - 1) / mini + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll X[5] = {};
ll mini = 1000000000000000;
for (int i = 0; i < 5; i++) {
cin >> X[i];
mini = min(mini, X[i]);
}
cout << (N + mini - 1) / mini + 4 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 892,132 | 892,133 | u584520839 | cpp |
p03077 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
const ll MOD = 1000000007LL;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << 5 + n / min({a, b, c, d, e}) << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
const ll MOD = 1000000007LL;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << 5 + (n - 1) / min({a, b, c, d, e}) << endl;
} | [] | 892,134 | 892,135 | u614128939 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 5 + (n + 1) / mn << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 5 + (n - 1) / mn << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 892,136 | 892,137 | u973991908 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 4 + (n + 1) / mn << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 5 + (n - 1) / mn << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"literal.number.change",
"io.output.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 892,138 | 892,137 | u973991908 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 4 + ceil(n / mn) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 5 + (n - 1) / mn << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 892,139 | 892,137 | u973991908 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll limit = min(a, min(b, min(c, min(d, e))));
ll times = ceil(n / limit);
cout << times + (ll)4 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
double limit = min(a, min(b, min(c, min(d, e))));
ll times = ceil(double(n / limit));
cout << times + (ll)4 << endl;
return 0;
} | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 892,143 | 892,144 | u615662061 | 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 bottle = min(min(min(min(A, B), C), D), E);
// cout<<N<<" "<<bottle<<endl;
cout << setprecision(18) << ceil(N / bottle) + 4 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
double bottle = min(min(min(min(A, B), C), D), E);
// cout<<N<<" "<<bottle<<endl;
cout << setprecision(18) << ceil(N / bottle) + 4 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 892,145 | 892,146 | u469315559 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int X = min({A, B, C, D, E});
cout << (X + N - 1) / N + 4 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int X = min({A, B, C, D, E});
cout << (X + N - 1) / X + 4 << endl;
}
| [
"identifier.change",
"io.output.change"
] | 892,149 | 892,150 | u817769480 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
int main(void) {
// Your code here!
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll ans = 4;
vector<ll> city = {a, b, c, d, e};
cout << 4 + ceil((double)n / MIN(city));
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
int main(void) {
// Your code here!
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll ans = 4;
vector<ll> city = {a, b, c, d, e};
cout << 4 + (ll)ceil((long double)n / MIN(city));
}
| [
"variable_declaration.type.widen.change"
] | 892,154 | 892,155 | u852862907 | cpp |
p03077 | #include <bits/stdc++.h>
#include <map> // pair
using namespace std;
typedef long long ll;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = (int)0; i < (int)n; i++)
#define llrep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define REP(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define all(var) (var).begin(), (var).end()
#define prt(var) cout << var << endl
#define prt_dbl(i, var) cout << fixed << setprecision(i) << var << endl;
//---------------------------------------------------------------
int main() {
ll N;
vector<ll> A(5, 0);
cin >> N >> A.at(0) >> A.at(1) >> A.at(2) >> A.at(3) >> A.at(4);
ll m = min(A.at(0), min(A.at(1), min(A.at(2), min(A.at(3), A.at(4)))));
ll ans = 5;
if (N % m != 0) {
ans += N / m;
} else {
ans += N / m;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <map> // pair
using namespace std;
typedef long long ll;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = (int)0; i < (int)n; i++)
#define llrep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define REP(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define all(var) (var).begin(), (var).end()
#define prt(var) cout << var << endl
#define prt_dbl(i, var) cout << fixed << setprecision(i) << var << endl;
//---------------------------------------------------------------
int main() {
ll N;
vector<ll> A(5, 0);
cin >> N >> A.at(0) >> A.at(1) >> A.at(2) >> A.at(3) >> A.at(4);
ll m = min(A.at(0), min(A.at(1), min(A.at(2), min(A.at(3), A.at(4)))));
ll ans = 5;
if (N % m != 0) {
ans += N / m;
} else {
ans += N / m - 1;
}
cout << ans << endl;
}
| [
"assignment.change"
] | 892,156 | 892,157 | u906250335 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int ans = 0;
ans = N / min({A, B, C, D, E}) + 5;
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int ans = 0;
ans = (N - 1) / min({A, B, C, D, E}) + 5;
cout << ans;
return 0;
}
| [] | 892,160 | 892,161 | u231455327 | cpp |
p03077 | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
ll N, a[5];
cin >> N;
rep(i, 0, 5) cin >> a[i];
sort(a, a + 5);
if (N <= a[0])
cout << 5 << endl;
else
cout << (ll)ceil(N / a[0]) + 4 << endl;
}
| #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
ll N, a[5];
cin >> N;
rep(i, 0, 5) cin >> a[i];
sort(a, a + 5);
if (N <= a[0])
cout << 5 << endl;
else
cout << (ll)ceil(N / (double)a[0]) + 4 << endl;
}
| [
"type_conversion.add"
] | 892,164 | 892,165 | u293156359 | cpp |
p03077 | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
ll N, a[5];
cin >> N;
rep(i, 0, 5) cin >> a[i];
sort(a, a + 5);
if (N <= a[0])
cout << 5 << endl;
else
cout << ceil(N / a[0]) + 4 << endl;
}
| #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
ll N, a[5];
cin >> N;
rep(i, 0, 5) cin >> a[i];
sort(a, a + 5);
if (N <= a[0])
cout << 5 << endl;
else
cout << (ll)ceil(N / (double)a[0]) + 4 << endl;
}
| [
"type_conversion.add"
] | 892,166 | 892,165 | u293156359 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF 9223372036854775807 + 1
#define sosuu 1000000007
int main() {
lli mini, N;
mini = MAX_INF;
cin >> N;
lli T[5];
rep(i, 5) {
cin >> T[i];
mini = min(T[i], mini);
}
if (mini % 5 == 0) {
cout << N / mini + 4 << endl;
return 0;
}
cout << N / mini + 5 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF 9223372036854775807 + 1
#define sosuu 1000000007
int main() {
lli mini, N;
mini = MAX_INF;
cin >> N;
lli T[5];
rep(i, 5) {
cin >> T[i];
mini = min(T[i], mini);
}
if (N % mini == 0) {
cout << N / mini + 4 << endl;
return 0;
}
cout << N / mini + 5 << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 892,179 | 892,180 | u170513117 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define vv vector<vector<int>>
using namespace std;
main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mn = min({a, b, c, d, e});
ll ans = n / mn + 5;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define vv vector<vector<int>>
using namespace std;
main() {
double n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
double mn = min({a, b, c, d, e});
ll ans = ceil(n / mn) + 4;
cout << ans << endl;
} | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 892,185 | 892,186 | u720321944 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N / minv == 0)
cout << N / minv + 4 << endl;
else
cout << N / minv + 5 << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N % minv == 0)
cout << N / minv + 4 << endl;
else
cout << N / minv + 5 << endl;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 892,187 | 892,188 | u644568158 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N / minv == 0)
cout << N / minv + 5 << endl;
else
cout << N / minv + 4 << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N % minv == 0)
cout << N / minv + 4 << endl;
else
cout << N / minv + 5 << endl;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 892,189 | 892,188 | u644568158 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N / minv)
cout << N / minv + 4 << endl;
else
cout << N / minv + 5 << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N % minv == 0)
cout << N / minv + 4 << endl;
else
cout << N / minv + 5 << endl;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 892,190 | 892,188 | u644568158 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll x = min({a, b, c, d, e});
cout << (ll)(n + x - 1) / x + 4 << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll x = min({a, b, c, d, e});
cout << (ll)(n + x - 1) / x + 4 << endl;
}
| [
"variable_declaration.type.change"
] | 892,191 | 892,192 | u649915042 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int x = min({a, b, c, d, e});
cout << (ll)(n + x - 1) / x + 4 << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll x = min({a, b, c, d, e});
cout << (ll)(n + x - 1) / x + 4 << endl;
}
| [
"variable_declaration.type.change"
] | 892,194 | 892,192 | u649915042 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) \
{ std::cout << #a << " = " << a << "\n"; }
template <class T1, class T2> inline bool minimize(T1 &a, T2 b) {
return b < a && (a = b, 1);
}
template <class T1, class T2> inline bool maximize(T1 &a, T2 b) {
return a < b && (a = b, 1);
}
template <class T, class V> istream &operator>>(istream &ist, pair<T, V> &p) {
return ist >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &ost, pair<T, T> &p) {
return ost << p.first << ", " << p.second;
}
template <class T> istream &operator>>(istream &ist, vector<T> &vs) {
for (auto &e : vs)
ist >> e;
return ist;
}
typedef long long ll;
int const inf = INT_MAX / 2;
int main() {
ll n;
cin >> n;
ll x = std::numeric_limits<ll>::max();
rep(i, 5) {
ll y;
cin >> y;
x = min(x, y);
}
cout << (n - x + 1) / x + 5 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) \
{ std::cout << #a << " = " << a << "\n"; }
template <class T1, class T2> inline bool minimize(T1 &a, T2 b) {
return b < a && (a = b, 1);
}
template <class T1, class T2> inline bool maximize(T1 &a, T2 b) {
return a < b && (a = b, 1);
}
template <class T, class V> istream &operator>>(istream &ist, pair<T, V> &p) {
return ist >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &ost, pair<T, T> &p) {
return ost << p.first << ", " << p.second;
}
template <class T> istream &operator>>(istream &ist, vector<T> &vs) {
for (auto &e : vs)
ist >> e;
return ist;
}
typedef long long ll;
int const inf = INT_MAX / 2;
int main() {
ll n;
cin >> n;
ll x = std::numeric_limits<ll>::max();
rep(i, 5) {
ll y;
cin >> y;
x = min(x, y);
}
cout << 5 + (n - 1) / x << endl;
}
| [
"expression.operation.binary.remove"
] | 892,202 | 892,203 | u809665051 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
vector<int> a(5);
rep(i, 5) cin >> a[i];
ll minmove = *std::min_element(a.begin(), a.end());
ll ans = ((n + minmove - 1) / minmove) + 4;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
ll minmove = *std::min_element(a.begin(), a.end());
ll ans = ((n + minmove - 1) / minmove) + 4;
cout << ans << endl;
return 0;
} | [] | 892,213 | 892,211 | u447096097 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> H(5);
for (long long i = 0; i < 5; i++)
cin >> H[i];
sort(H.begin(), H.end());
cout << 4 + (N + 1) / H[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> H(5);
for (long long i = 0; i < 5; i++)
cin >> H[i];
sort(H.begin(), H.end());
cout << 5 + (N - 1) / H[0] << endl;
}
| [
"literal.number.change",
"io.output.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 892,214 | 892,215 | u406634703 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> H(5);
for (long long i = 0; i < 5; i++)
cin >> H[i];
sort(H.begin(), H.end());
cout << 5 + N / H[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> H(5);
for (long long i = 0; i < 5; i++)
cin >> H[i];
sort(H.begin(), H.end());
cout << 5 + (N - 1) / H[0] << endl;
}
| [] | 892,216 | 892,215 | u406634703 | cpp |
p03077 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int abs(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll aa = min(min(min(A, B), min(C, D)), E);
cout << N / aa + 5 << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int abs(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll aa = min(min(min(A, B), min(C, D)), E);
cout << (N - 1) / aa + 5 << endl;
}
| [] | 892,217 | 892,218 | u776056110 | cpp |
p03077 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int abs(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll aa = min(min(min(A, B), min(C, D)), E);
cout << N / aa + 4 << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int abs(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll aa = min(min(min(A, B), min(C, D)), E);
cout << (N - 1) / aa + 5 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 892,219 | 892,218 | u776056110 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 1e6;
static const int NIL = -1;
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg2.first;
}
int main(void) {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll ans, m, p;
m = min({A, B, C, D, E});
ans = N / m;
if (N % m != 1)
ans++;
cout << ans + 4 << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 1e6;
static const int NIL = -1;
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg2.first;
}
int main(void) {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll ans, m, p;
m = min({A, B, C, D, E});
ans = N / m;
if (N % m != 0)
ans++;
cout << ans + 4 << endl;
return (0);
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 892,227 | 892,228 | u616090453 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll m = min(a, min(b, min(c, min(d, e))));
cout << (n / m) + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll m = min(a, min(b, min(c, min(d, e))));
cout << ((n - 1) / m) + 5 << endl;
} | [] | 892,232 | 892,233 | u013069672 | cpp |
p03077 |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
/*多倍長整数/cpp_intで宣言
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define addf(T) [](T a, T b) { return (a + b); }
#define minf(T) [](T a, T b) { return min(a, b); }
#define maxf(T) [](T a, T b) { return max(a, b); }
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const long double PI = acos(-1.0L);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) { // lcmを求める
return number1 / gcd(number1, number2) * number2;
}
ll LSB(ll n) { return (n & (-n)); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
ll n, a, b, c, d, e;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
ll p = min({a, b, c, d, e});
printf("%d\n", (ll)ceil((double)n / p) + 4LL);
Please AC;
}
|
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
/*多倍長整数/cpp_intで宣言
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define addf(T) [](T a, T b) { return (a + b); }
#define minf(T) [](T a, T b) { return min(a, b); }
#define maxf(T) [](T a, T b) { return max(a, b); }
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const long double PI = acos(-1.0L);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) { // lcmを求める
return number1 / gcd(number1, number2) * number2;
}
ll LSB(ll n) { return (n & (-n)); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
ll n, a, b, c, d, e;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
ll p = min({a, b, c, d, e});
printf("%lld\n", (ll)ceil((double)n / p) + 4LL);
Please AC;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 892,236 | 892,237 | u917972976 | cpp |
p03077 |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
/*多倍長整数/cpp_intで宣言
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define addf(T) [](T a, T b) { return (a + b); }
#define minf(T) [](T a, T b) { return min(a, b); }
#define maxf(T) [](T a, T b) { return max(a, b); }
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const long double PI = acos(-1.0L);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) { // lcmを求める
return number1 / gcd(number1, number2) * number2;
}
ll LSB(ll n) { return (n & (-n)); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
ll n, a, b, c, d, e;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
ll p = min({a, b, c, d, e});
printf("%d\n", ceil((double)n / p) + 4);
Please AC;
}
|
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
/*多倍長整数/cpp_intで宣言
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define addf(T) [](T a, T b) { return (a + b); }
#define minf(T) [](T a, T b) { return min(a, b); }
#define maxf(T) [](T a, T b) { return max(a, b); }
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const long double PI = acos(-1.0L);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) { // lcmを求める
return number1 / gcd(number1, number2) * number2;
}
ll LSB(ll n) { return (n & (-n)); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
ll n, a, b, c, d, e;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
ll p = min({a, b, c, d, e});
printf("%lld\n", (ll)ceil((double)n / p) + 4LL);
Please AC;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"literal.number.type.widen.change"
] | 892,238 | 892,237 | u917972976 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long int n;
cin >> n;
vector<long long int> a(5);
rep(i, 5) cin >> a[i];
for (int i = 1; i < 5; i++) {
a[i] = min(a[i - 1], a[i]);
}
cout << (long long int)ceil(n / a[4]) + 5LL << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long int n;
cin >> n;
vector<long long int> a(5);
rep(i, 5) cin >> a[i];
for (int i = 1; i < 5; i++) {
a[i] = min(a[i - 1], a[i]);
}
cout << (long long int)ceil(1.0 * n / a[4]) + 4LL << endl;
} | [
"literal.number.change",
"io.output.change"
] | 892,239 | 892,240 | u696865277 | cpp |
p03077 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
vector<ll> ABCDE(5);
cin >> N >> ABCDE[0] >> ABCDE[1] >> ABCDE[2] >> ABCDE[3] >> ABCDE[4];
ll min_value = *min_element(ABCDE.begin(), ABCDE.end());
ll ans = ceil(N / min_value) + 5;
cout << ans << endl;
// system("pause");
return 0;
} | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
vector<ll> ABCDE(5);
cin >> N >> ABCDE[0] >> ABCDE[1] >> ABCDE[2] >> ABCDE[3] >> ABCDE[4];
ll min_value = *min_element(ABCDE.begin(), ABCDE.end());
ll ans = ceil((N - 1) / min_value) + 5;
cout << ans << endl;
// system("pause");
return 0;
} | [
"call.arguments.change"
] | 892,243 | 892,244 | u438265890 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define dbg(x) #x "=" << x << " "
#define fore(i, a, b) for (int i = a, gon = b; i < gon; ++i)
#define pb push_back
#define F first
#define S second
typedef double lf;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#else
#define endl '\n'
#endif
ll n, v[5];
cin >> n;
fore(i, 0, 5) cin >> v[i];
ll mn = *min_element(v, v + 5);
ll ans = 5;
if (mn < n) {
ans += n / mn;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define dbg(x) #x "=" << x << " "
#define fore(i, a, b) for (int i = a, gon = b; i < gon; ++i)
#define pb push_back
#define F first
#define S second
typedef double lf;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#else
#define endl '\n'
#endif
ll n, v[5];
cin >> n;
fore(i, 0, 5) cin >> v[i];
ll mn = *min_element(v, v + 5);
ll ans = 5;
if (mn < n) {
ans += (n - 1) / mn;
}
cout << ans << endl;
}
| [] | 892,256 | 892,257 | u994510536 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define show(a, n) \
rep(i, n) { cout << a[i] << ' '; } \
cout << endl;
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<long long, long long> pll;
const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 100000;
int main() {
ll n;
cin >> n;
ll a = INFL;
rep(i, 5) {
ll b;
cin >> b;
a = min(a, b);
}
int ans = n / a + 5;
if (n % a == 0)
ans--;
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define show(a, n) \
rep(i, n) { cout << a[i] << ' '; } \
cout << endl;
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<long long, long long> pll;
const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 100000;
int main() {
ll n;
cin >> n;
ll a = INFL;
rep(i, 5) {
ll b;
cin >> b;
a = min(a, b);
}
ll ans = n / a + 5;
if (n % a == 0)
ans--;
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 892,258 | 892,259 | u489108157 | cpp |
p03077 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i = n; i >= 1; --i)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FILL(c, v) fill((c).begin(), (c).end(), v)
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define CLR(a) memset((a), 0, sizeof(a))
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long LL;
typedef unsigned long long ULL;
const int INTINF = 2147483647;
const LL LLINF = 9223372036854775807;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
LL cities[7];
void solve() {
LL N;
cin >> N;
LL bottleneck = LLINF;
RREP1(dist, 5) {
LL cap;
cin >> cap;
if (cap < bottleneck) {
bottleneck = cap;
}
}
LL cost = N / bottleneck + (N % bottleneck == 0);
cout << cost + 5 << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
solve();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i = n; i >= 1; --i)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FILL(c, v) fill((c).begin(), (c).end(), v)
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define CLR(a) memset((a), 0, sizeof(a))
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long LL;
typedef unsigned long long ULL;
const int INTINF = 2147483647;
const LL LLINF = 9223372036854775807;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
LL cities[7];
void solve() {
LL N;
cin >> N;
LL bottleneck = LLINF;
RREP1(dist, 5) {
LL cap;
cin >> cap;
if (cap < bottleneck) {
bottleneck = cap;
}
}
LL cost = N / bottleneck + (N % bottleneck != 0);
cout << cost + 4 << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
solve();
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"expression.operation.binary.change",
"literal.number.change",
"io.output.change"
] | 892,260 | 892,261 | u938389536 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
int32_t main() {
int n, m = 1e16, tmp;
cin >> n;
for (int i = 1; i <= 5; i++) {
cin >> tmp;
m = min(m, tmp);
}
cout << n / m + 5;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
int32_t main() {
int n, m = 1e16, tmp;
cin >> n;
for (int i = 1; i <= 5; i++) {
cin >> tmp;
m = min(m, tmp);
}
cout << (n - 1) / m + 5;
}
| [] | 892,264 | 892,265 | u472645805 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
ll tmp = 1000000000000005;
rep(i, 5) {
cin >> a[i];
tmp = min(a[i], tmp);
}
cout << 5 + n / tmp << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
ll tmp = 1000000000000005;
rep(i, 5) {
cin >> a[i];
tmp = min(a[i], tmp);
}
cout << 5 + (n - 1) / tmp << endl;
} | [] | 892,273 | 892,274 | u924451152 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long N;
std::vector<long long> v(5);
std::cin >> N;
for (size_t i = 0; i < 5; i++) {
std::cin >> v[i];
}
sort(v.begin(), v.end());
if (N % v[0] == 0)
std::cout << N / v[0] + 5 << '\n';
else
std::cout << N / v[0] + 4 << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long N;
std::vector<long long> v(5);
std::cin >> N;
for (size_t i = 0; i < 5; i++) {
std::cin >> v[i];
}
sort(v.begin(), v.end());
if (N % v[0] != 0)
std::cout << N / v[0] + 5 << '\n';
else
std::cout << N / v[0] + 4 << '\n';
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 892,281 | 892,282 | u053035261 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define __ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define forn(i, a, n) for (int i = a; i < n; i++)
#define fi first
#define se second
#define pb push_back
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef long long int lli;
int main() {
__ lli n, a, b, c, d, e, f;
cin >> n;
cin >> a >> b >> c >> d >> e;
lli ans = (n + 1) / min({a, b, c, d, e});
if ((n + 1) % min({a, b, c, d, e}))
ans++;
ans += 4;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define __ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define forn(i, a, n) for (int i = a; i < n; i++)
#define fi first
#define se second
#define pb push_back
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef long long int lli;
int main() {
__ lli n, a, b, c, d, e, f;
cin >> n;
cin >> a >> b >> c >> d >> e;
lli ans = (n) / min({a, b, c, d, e});
if ((n) % min({a, b, c, d, e}))
ans++;
ans += 4;
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 892,283 | 892,284 | u801950866 | cpp |
p03077 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
long long int ans = -1;
for (int i = 0; i < 5; i++) {
if (ans == -1 || ans > a[i])
ans = a[i];
}
cout << (n + ans - 1) / ans * 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
long long int ans = -1;
for (int i = 0; i < 5; i++) {
if (ans == -1 || ans > a[i])
ans = a[i];
}
cout << (n + ans - 1) / ans + 4 << endl;
}
| [] | 892,287 | 892,288 | u595832794 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int ans = 0;
int x;
x = min(min(a, b), c);
x = min(min(x, d), e);
ans = (n + x - 1) / x;
cout << ans + 4;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll ans = 0;
ll x;
x = min(min(a, b), c);
x = min(min(x, d), e);
ans = (n + x - 1) / x;
cout << ans + 4;
}
| [
"variable_declaration.type.change"
] | 892,289 | 892,290 | u389766217 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long int lli;
int main() {
lli n;
cin >> n;
lli arr[5];
// reading into array
for (int i = 0; i < 5; i++)
cin >> arr[i];
// getting the minimum most element
lli mini = *min_element(arr, arr + 5);
(n % mini == 0) ? cout << n / mini << '\n' : cout << n / mini + 1 << '\n';
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long int lli;
int main() {
lli n;
cin >> n;
lli arr[5];
// reading into array
for (int i = 0; i < 5; i++)
cin >> arr[i];
// getting the minimum most element
lli mini = *min_element(arr, arr + 5);
(n % mini == 0) ? cout << n / mini + 4 << '\n' : cout << n / mini + 5 << '\n';
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 892,296 | 892,297 | u551519692 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
vector<int> pos, baad;
int main() {
long long n;
cin >> n;
long long arr[5];
for (long long i = 0; i < 5; i++)
cin >> arr[i];
sort(arr, arr + 5);
cout << ((n - arr[0] + 1) / arr[0]) + 5 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
vector<int> pos, baad;
int main() {
long long n;
cin >> n;
long long arr[5];
for (int i = 0; i < 5; i++)
cin >> arr[i];
sort(arr, arr + 5);
cout << ((n + arr[0] - 1) / arr[0]) + 4 << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 892,300 | 892,301 | u337550605 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
vector<int> pos, baad;
int main() {
long long n;
cin >> n;
long long arr[5];
for (int i = 0; i < 5; i++)
cin >> arr[i];
sort(arr, arr + 5);
cout << ((n - arr[0] + 1) / arr[0]) + 5 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
vector<int> pos, baad;
int main() {
long long n;
cin >> n;
long long arr[5];
for (int i = 0; i < 5; i++)
cin >> arr[i];
sort(arr, arr + 5);
cout << ((n + arr[0] - 1) / arr[0]) + 4 << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 892,302 | 892,301 | u337550605 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 892,305 | 892,306 | u401900157 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int k = min({A, B, C, D, E});
cout << 5 + N / k << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
N--;
int k = min({A, B, C, D, E});
cout << 5 + N / k << endl;
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 892,311 | 892,312 | u965730380 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll mn = std::min({A, B, C, D, E});
ll ans = 5LL + N / mn;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll mn = std::min({A, B, C, D, E});
ll ans = 5LL + (N - 1) / mn;
cout << ans << endl;
return 0;
} | [] | 892,313 | 892,314 | u340980616 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main(void) {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mini = min(a, min(b, min(c, min(d, e))));
ll res = (n + mini) / mini + 4;
cout << res << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main(void) {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mini = min(a, min(b, min(c, min(d, e))));
ll res = (n + mini - 1) / mini + 4;
cout << res << endl;
} | [
"assignment.change"
] | 892,315 | 892,316 | u222866518 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
using namespace std;
using ll = long long;
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
int main() {
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
sort(a, a + 5);
cout << 4 + (n + a[0]) / a[0] << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
using namespace std;
using ll = long long;
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
int main() {
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
sort(a, a + 5);
cout << 4 + (n + a[0] - 1) / a[0] << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 892,322 | 892,323 | u936602931 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int long key = min(A, B);
key = min(key, C);
key = min(key, D);
key = min(key, E);
int long p = (N - 1) / key + 1;
cout << p + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int long key = min(A, B);
key = min(key, C);
key = min(key, D);
key = min(key, E);
int long p = (N - 1) / key + 1;
cout << p + 4 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 892,324 | 892,325 | u936602931 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, a[5];
cin >> n;
rep(i, 5) cin >> a[i];
ll ans = n / *min_element(a, a + 5) + 5;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, a[5];
cin >> n;
n--;
rep(i, 5) cin >> a[i];
ll ans = n / *min_element(a, a + 5) + 5;
cout << ans << endl;
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 892,326 | 892,327 | u907525511 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
#define repe(i, f, n) for (int i = (f); (i) <= (n); i++)
using namespace std;
typedef long long ll;
ll INF = 1LL << 60;
ll MAX = 100010;
int main() {
ll n;
cin >> n;
ll min = INF;
rep(i, 0, 5) {
ll tmp;
cin >> tmp;
if (min > tmp)
min = tmp;
}
if (n <= min) {
cout << 5 << endl;
} else if (n / min == 0) {
cout << 4 + (n / min) << endl;
} else {
cout << 5 + (n / min) << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
#define repe(i, f, n) for (int i = (f); (i) <= (n); i++)
using namespace std;
typedef long long ll;
ll INF = 1LL << 60;
ll MAX = 100010;
int main() {
ll n;
cin >> n;
ll min = INF;
rep(i, 0, 5) {
ll tmp;
cin >> tmp;
if (min > tmp)
min = tmp;
}
if (n <= min) {
cout << 5 << endl;
} else if (n % min == 0) {
cout << 4 + (n / min) << endl;
} else {
cout << 5 + (n / min) << endl;
}
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 892,332 | 892,333 | u873269440 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
int64_t n;
int64_t A[5];
cin >> n;
rep(i, 5) cin >> A[i];
int64_t mn = *min_element(A, A + 5);
int64_t ans = n / mn + 5;
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
int64_t n;
int64_t A[5];
cin >> n;
rep(i, 5) cin >> A[i];
int64_t mn = *min_element(A, A + 5);
int64_t ans = (n - 1) / mn + 5;
cout << ans << endl;
} | [] | 892,344 | 892,345 | u480172743 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
ll damepo = min({a, b, c, d, e});
cout << (n + damepo - 1) / damepo + 4 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll damepo = min({a, b, c, d, e});
cout << (n + damepo - 1) / damepo + 4 << endl;
} | [
"expression.operation.binary.add"
] | 892,352 | 892,353 | u650236619 | cpp |
p03077 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vin = vector<int>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mn;
mn = min(a, b);
mn = min(min(c, d), min(mn, e));
////////////
if (mn > n) {
cout << 5 << endl;
} else {
int ans = 0;
ans += 5;
ans += (n - 1) / mn;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vin = vector<int>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mn;
mn = min(a, b);
mn = min(min(c, d), min(mn, e));
////////////
if (mn > n) {
cout << 5 << endl;
} else {
ll ans = 0;
ans += 5;
ans += (n - 1) / mn;
cout << ans << endl;
}
} | [
"variable_declaration.type.change"
] | 892,362 | 892,363 | u531461815 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
ll x = 100000000000000000;
rep(i, 4) {
ll t;
cin >> t;
x = min(x, t);
}
if (n % x == 0) {
cout << n / x + 4 << endl;
} else {
cout << n / x + 5 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
ll x = 100000000000000000;
rep(i, 5) {
ll t;
cin >> t;
x = min(x, t);
}
if (n % x == 0) {
cout << n / x + 4 << endl;
} else {
cout << n / x + 5 << endl;
}
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 892,364 | 892,365 | u459930111 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
ll x = 10000000000000000;
rep(i, 4) {
ll t;
cin >> t;
x = min(x, t);
}
if (n % x == 0) {
cout << n / x + 4 << endl;
} else {
cout << n / x + 5 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
ll x = 100000000000000000;
rep(i, 5) {
ll t;
cin >> t;
x = min(x, t);
}
if (n % x == 0) {
cout << n / x + 4 << endl;
} else {
cout << n / x + 5 << endl;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 892,366 | 892,365 | u459930111 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 5 + n / a[0];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 5 + (n - 1) / a[0];
cout << ans << endl;
return 0;
} | [] | 892,367 | 892,368 | u354281482 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
vector<int> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 5 + n / a[0];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 5 + (n - 1) / a[0];
cout << ans << endl;
return 0;
} | [] | 892,369 | 892,368 | u354281482 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
{ \
cout << #v << "=" << endl; \
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 Return(ans) \
{ \
cout << (ans) << endl; \
return 0; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod
#include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
vec Time(5);
REP(i, 5) cin >> Time[i];
int bottle = 0;
REP(i, 5) { bottle = max(bottle, N / Time[i]); }
Out(bottle + 5);
}
| #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
{ \
cout << #v << "=" << endl; \
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 Return(ans) \
{ \
cout << (ans) << endl; \
return 0; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod
#include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
vec Time(5);
REP(i, 5) cin >> Time[i];
int bottle = 0;
REP(i, 5) { bottle = max(bottle, (N - 1) / Time[i]); }
Out(bottle + 5);
}
| [
"call.arguments.change"
] | 892,375 | 892,376 | u088608223 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main(void) {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mn = min(a, min(b, min(c, min(d, e))));
cout << (mn % n == 0 ? n / mn + 4 : n / mn + 5) << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main(void) {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mn = min(a, min(b, min(c, min(d, e))));
cout << (n % mn == 0 ? n / mn + 4 : n / mn + 5) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 892,377 | 892,378 | u254015449 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int mx4[] = {0, 1, 0, -1};
int my4[] = {1, 0, -1, 0};
int INF = 2e6;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll s = min(a, min(b, min(c, min(d, e))));
if (n % s == 0)
cout << n / s + 3 << endl;
else
cout << n / s + 5 << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int mx4[] = {0, 1, 0, -1};
int my4[] = {1, 0, -1, 0};
int INF = 2e6;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll s = min(a, min(b, min(c, min(d, e))));
if (n % s == 0)
cout << n / s + 4 << endl;
else
cout << n / s + 5 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 892,379 | 892,380 | u504800764 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int mx4[] = {0, 1, 0, -1};
int my4[] = {1, 0, -1, 0};
int INF = 2e6;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll s = min(a, min(b, min(c, min(d, e))));
if (n % s == 0)
cout << n / s + 1 << endl;
else
cout << n / s + 5 << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int mx4[] = {0, 1, 0, -1};
int my4[] = {1, 0, -1, 0};
int INF = 2e6;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll s = min(a, min(b, min(c, min(d, e))));
if (n % s == 0)
cout << n / s + 4 << endl;
else
cout << n / s + 5 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 892,381 | 892,380 | u504800764 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int mx4[] = {0, 1, 0, -1};
int my4[] = {1, 0, -1, 0};
int INF = 2e6;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll s = min(a, min(b, min(c, min(d, e))));
if (n % s == 0)
cout << n / s << endl;
else
cout << n / s + 5 << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int mx4[] = {0, 1, 0, -1};
int my4[] = {1, 0, -1, 0};
int INF = 2e6;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll s = min(a, min(b, min(c, min(d, e))));
if (n % s == 0)
cout << n / s + 4 << endl;
else
cout << n / s + 5 << endl;
}
| [
"expression.operation.binary.add"
] | 892,382 | 892,380 | u504800764 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;
// using Real = mp::number<mp::cpp_dec_float<1024>>;
int main() {
ll N;
cin >> N;
vector<ll> V(5);
rep(i, 5) cin >> V.at(i);
sort(all(V));
ll ans = N / V.at(0) + 5;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;
// using Real = mp::number<mp::cpp_dec_float<1024>>;
int main() {
ll N;
cin >> N;
vector<ll> V(5);
rep(i, 5) cin >> V.at(i);
sort(all(V));
ll ans = (N - 1) / V.at(0) + 5;
cout << ans << endl;
} | [] | 892,385 | 892,386 | u666490638 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vector<ll>> dist;
const int dx[4] = {0, -1, 0, 1};
const int dy[4] = {1, 0, -1, 0};
vector<ll> A;
// vectorのリサイズ
// A.resize(N);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
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(5) / min(a, min(min(b, c), min(d, e)))) + 4 << endl;
return 0;
}
| // ボトルネックのところにすべてが依存するのはわかったが 立式できなかった
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vector<ll>> dist;
const int dx[4] = {0, -1, 0, 1};
const int dy[4] = {1, 0, -1, 0};
vector<ll> A;
// vectorのリサイズ
// A.resize(N);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
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 << ll(ceil(double(n) / min(a, min(min(b, c), min(d, e))))) + 4 << endl;
return 0;
}
| [
"call.add",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change",
"call.arguments.change"
] | 892,389 | 892,390 | u652037179 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> abc(5);
for (ll i = 0; i < abc.size(); i++) {
cin >> abc[i];
}
sort(abc.begin(), abc.end());
ll ans = 0;
if (abc[0] >= n) {
ans = n;
} else {
ans = ceil(n / double(abc[0]) + 4);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> abc(5);
for (ll i = 0; i < abc.size(); i++) {
cin >> abc[i];
}
sort(abc.begin(), abc.end());
ll ans = 0;
if (abc[0] >= n) {
ans = 5;
} else {
ans = ceil(n / double(abc[0]) + 4);
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 892,391 | 892,392 | u476027087 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> abc(5);
for (int i = 0; i < abc.size(); i++) {
cin >> abc[i];
}
sort(abc.begin(), abc.end());
ll ans = 0;
if (abc[0] >= n) {
ans = n;
} else {
ans = ceil(n / double(abc[0]) + 4);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> abc(5);
for (ll i = 0; i < abc.size(); i++) {
cin >> abc[i];
}
sort(abc.begin(), abc.end());
ll ans = 0;
if (abc[0] >= n) {
ans = 5;
} else {
ans = ceil(n / double(abc[0]) + 4);
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 892,393 | 892,392 | u476027087 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
ll dx[] = {1, 0};
ll dy[] = {0, 1};
int main() {
ll N;
vector<ll> a(5);
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a.begin(), a.end());
cout << ceil((double)N / a[0]) + 4 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
ll dx[] = {1, 0};
ll dy[] = {0, 1};
int main() {
ll N;
vector<ll> a(5);
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a.begin(), a.end());
cout << (ll)ceil((double)N / a[0]) + 4LL << endl;
return 0;
} | [
"literal.number.type.widen.change"
] | 892,394 | 892,395 | u378155378 | cpp |
p03077 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
const long double PI = (acos(-1));
int main() {
ll n;
vector<ll> a(5);
cin >> n;
ll ans = 5, mini = n;
rep(i, 0, 5) {
cin >> a[i];
mini = min(mini, a[i]);
}
ans += n / mini;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
const long double PI = (acos(-1));
int main() {
ll n;
vector<ll> a(5);
cin >> n;
ll ans = 5, mini = n;
rep(i, 0, 5) {
cin >> a[i];
mini = min(mini, a[i]);
}
ans += (n - 1) / mini;
cout << ans << endl;
return 0;
} | [] | 892,396 | 892,397 | u870074807 | cpp |
p03077 | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define int long long
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
#define mod 1000000007
#define INF 10e10
template <typename T>
void print(T x) {
std::cout << x << " ";
}
template <typename T>
void println(T x) {
std::cout << x << "\n";
}
signed main(void) {
double n;
int a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int m = min({a, b, c, d, e});
print((n + m - 1) / m + 4);
} | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define int long long
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
#define mod 1000000007
#define INF 10e10
template <typename T>
void print(T x) {
std::cout << x << " ";
}
template <typename T>
void println(T x) {
std::cout << x << "\n";
}
signed main(void) {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int m = min({a, b, c, d, e});
print((n + m - 1) / m + 4);
} | [
"variable_declaration.remove",
"variable_declaration.add"
] | 892,405 | 892,406 | u519761526 | cpp |
p03077 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
using Graph = vector<vector<ll>>;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&a
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (ll i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (ll i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (ll i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (ll i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
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;
}
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
// sort
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 最小公倍数
void lcm(ll a, ll b) {}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を
// ll bfs_maze(vector<string>& str, ll s_y, ll s_x, ll g_y, ll g_x)
ll bfs_maze(vector<string> &str, ll s_y, ll s_x) {
ll d = 0;
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
// スタート地点を含める場合は0→1
que.push({s_y, s_x, 0});
v[s_y][s_x] = 0;
while (!que.empty()) {
Corr now = que.front();
que.pop();
// ゴールに到達したら終了する
// if (now.y == g_y && now.x == g_x)
// break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
// これまで探索した地点より遠くに移動できるか
d = max(d, next.depth);
que.push(next);
}
}
}
// ゴールまでの移動距離
// return v[(int)g_y][(int)g_x];
// スタートから最も遠い地点までの距離
return d;
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 繰り返し二乗法 a^n
ll iterativePower(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// 階乗
ll factorial(ll n) {
ll res = 1;
REP(i, n) { res = res * (i + 1) % MOD; }
return res;
}
// MODの逆元
vector<ll> MODInverse(ll n, ll fact) {
vector<ll> res(n + 1);
res[n] = iterativePower(fact, MOD - 2);
REPR(i, n - 1) { res[i] = res[i + 1] * (i + 1) % MOD; }
return res;
}
// 二項係数nCr
ll comb(ll n, ll r) {
ll fact = factorial(n);
vector<ll> fact_inv;
fact_inv = MODInverse(n, fact);
return (fact * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
cout << endl;
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
// 約数
vector<ll> makeDivisors(ll n) {
vector<ll> divisors;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
divisors.pb(i);
if (i != n / i) {
divisors.pb(n / i);
}
}
}
sort(ALL(divisors));
return divisors;
}
// 尺取り法
ll shakutori(vector<ll> &v, ll x) {
ll res = 0;
ll n = SZ(v);
ll sum = 0;
ll right = 0;
REP(left, n) {
while (right < n && sum + v[right] <= x) {
sum += v[right];
right++;
}
res += (right - left);
if (right == left)
right++;
else
sum -= v[left];
}
return res;
}
// 深さ優先探索
void dfs(const Graph &g, ll x) {}
// 幅優先探索
void bfs() {}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n;
cin >> n;
// 変数（vector）取得
// vector<ll> a(n - 1);
// a = INV(n - 1);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
// string s;
// cin >> s;
// 文字列（vector）取得
// vector<string> str(n);
// REP(i, n)
// {
// cin >> str[i];
// }
// グラフ取得
// Graph g(n);
// REP(i, k) {
// ll from, weight;
// cin >> from >> weight;
// g[from].pb(to);
// //g[to].pb(from);
//}
// 迷路用string取得
// vector<string> str(h);
// REP(i, h) {
// cin >> str[i];
//}
//
// 実装部分
//
vector<ll> a(5);
a = INV(5);
ll ans = 5;
sort(ALL(a));
ans += ceil(n / a[0]) - 1;
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(10);
MSG(ans);
// ans_vec(ans);
return 0;
}
//
// memo
//
// for(ll i=0; i<n;i++) // ループ
// cout << << endl; // 出力
// sort(ALL(a), greater<ll>()); // 降順
// abs(k) // 絶対値
// sqrt(n) // ルート
// ceil(n) // 切り上げ
// floor(n) // 切り捨て
// round(n) // 四捨五入
| #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
using Graph = vector<vector<ll>>;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&a
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (ll i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (ll i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (ll i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (ll i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
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;
}
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
// sort
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 最小公倍数
void lcm(ll a, ll b) {}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を
// ll bfs_maze(vector<string>& str, ll s_y, ll s_x, ll g_y, ll g_x)
ll bfs_maze(vector<string> &str, ll s_y, ll s_x) {
ll d = 0;
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
// スタート地点を含める場合は0→1
que.push({s_y, s_x, 0});
v[s_y][s_x] = 0;
while (!que.empty()) {
Corr now = que.front();
que.pop();
// ゴールに到達したら終了する
// if (now.y == g_y && now.x == g_x)
// break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
// これまで探索した地点より遠くに移動できるか
d = max(d, next.depth);
que.push(next);
}
}
}
// ゴールまでの移動距離
// return v[(int)g_y][(int)g_x];
// スタートから最も遠い地点までの距離
return d;
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 繰り返し二乗法 a^n
ll iterativePower(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// 階乗
ll factorial(ll n) {
ll res = 1;
REP(i, n) { res = res * (i + 1) % MOD; }
return res;
}
// MODの逆元
vector<ll> MODInverse(ll n, ll fact) {
vector<ll> res(n + 1);
res[n] = iterativePower(fact, MOD - 2);
REPR(i, n - 1) { res[i] = res[i + 1] * (i + 1) % MOD; }
return res;
}
// 二項係数nCr
ll comb(ll n, ll r) {
ll fact = factorial(n);
vector<ll> fact_inv;
fact_inv = MODInverse(n, fact);
return (fact * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
cout << endl;
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
// 約数
vector<ll> makeDivisors(ll n) {
vector<ll> divisors;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
divisors.pb(i);
if (i != n / i) {
divisors.pb(n / i);
}
}
}
sort(ALL(divisors));
return divisors;
}
// 尺取り法
ll shakutori(vector<ll> &v, ll x) {
ll res = 0;
ll n = SZ(v);
ll sum = 0;
ll right = 0;
REP(left, n) {
while (right < n && sum + v[right] <= x) {
sum += v[right];
right++;
}
res += (right - left);
if (right == left)
right++;
else
sum -= v[left];
}
return res;
}
// 深さ優先探索
void dfs(const Graph &g, ll x) {}
// 幅優先探索
void bfs() {}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n;
cin >> n;
// 変数（vector）取得
// vector<ll> a(n - 1);
// a = INV(n - 1);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
// string s;
// cin >> s;
// 文字列（vector）取得
// vector<string> str(n);
// REP(i, n)
// {
// cin >> str[i];
// }
// グラフ取得
// Graph g(n);
// REP(i, k) {
// ll from, weight;
// cin >> from >> weight;
// g[from].pb(to);
// //g[to].pb(from);
//}
// 迷路用string取得
// vector<string> str(h);
// REP(i, h) {
// cin >> str[i];
//}
//
// 実装部分
//
vector<ll> a(5);
a = INV(5);
ll ans = 5;
sort(ALL(a));
ans += ceil((double)n / a[0]) - 1;
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(10);
MSG(ans);
// ans_vec(ans);
return 0;
}
//
// memo
//
// for(ll i=0; i<n;i++) // ループ
// cout << << endl; // 出力
// sort(ALL(a), greater<ll>()); // 降順
// abs(k) // 絶対値
// sqrt(n) // ルート
// ceil(n) // 切り上げ
// floor(n) // 切り捨て
// round(n) // 四捨五入
| [
"type_conversion.add"
] | 892,409 | 892,410 | u337845373 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int q = (n - 1) / a;
int r = (n - 1) / b;
int s = (n - 1) / c;
int t = (n - 1) / d;
int u = (n - 1) / e;
cout << max({q, r, s, t, u}) + 5 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll q = (n - 1) / a;
ll r = (n - 1) / b;
ll s = (n - 1) / c;
ll t = (n - 1) / d;
ll u = (n - 1) / e;
cout << max({q, r, s, t, u}) + 5 << endl;
} | [
"variable_declaration.type.change"
] | 892,415 | 892,416 | u816145694 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.