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;
int main() {
ll N, s[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> s[i];
}
ll m = s[0];
ll ans = 0;
ll p = 0;
for (int i = 0; i < 5; i++) {
if (m > s[i]) {
m = s[i];
p = i;
}
}
if (m < N) {
ans += p;
if (N % 2 == 0)
ans += N / m;
else
ans += N / m + 1;
ans += 4 - p;
} else {
ans = 5;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, s[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> s[i];
}
ll m = s[0];
ll ans = 0;
ll p = 0;
for (int i = 1; i < 5; i++) {
if (m > s[i]) {
m = s[i];
p = i;
}
}
if (m < N) {
ans += p;
if (N % m == 0)
ans += N / m;
else
ans += N / m + 1;
ans += 4 - p;
} else {
ans = 5;
}
cout << ans;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 892,417 | 892,418 | u109191542 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> bool chmax(T &a, T b) {
if (a <= b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a >= b) {
a = b;
return true;
}
return false;
}
int main(void) {
ll n;
vector<ll> a(5);
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a.begin(), a.end());
ll ans = ceil(n / a[0]) + 5;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> bool chmax(T &a, T b) {
if (a <= b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a >= b) {
a = b;
return true;
}
return false;
}
int main(void) {
ll n;
vector<ll> a(5);
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a.begin(), a.end());
ll ans = ceil((n - 1) / a[0]) + 5;
cout << ans << endl;
} | [
"call.arguments.change"
] | 892,424 | 892,425 | u957377447 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const int MOD = 1000000007;
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))));
ll ans = 5 + n / m;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const int MOD = 1000000007;
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))));
ll ans = 5 + (n - 1) / m;
cout << ans << endl;
return 0;
} | [] | 892,434 | 892,435 | u118225776 | cpp |
p03077 | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i > (n); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
//降順はgreater<T>()
#define all(x) (x).begin(), (x).end()
#define rv(s) reverse((s).begin(), (s).end())
// gcd lcmはそのままok
#define gcd(a, b) __gcd(a, b)
#define bits(n) (1 << (n))
#define pcnt(x) __builtin_popcountll(x)
//配列内等要素削除
#define unique(x) (x).erase(unique(x).begin(),(x).end()),(x).end())
#define Fixed(n) fixed << setprecision(n)
//総和
#define sowa(n) ((n) * ((n) + 1)) / 2
#define pb(x, a) (x).push_back(a)
#define fb(x, a) (x).push_front(a)
#define eb(x, a) (x).emplace_back(a)
#define F first
#define S second
#define cauto const auto &
using P = pair<int, int>;
using Graph = vector<vector<P>>;
template <class T> //昇順
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T> //降順
using max_heap = priority_queue<T>;
template <class A, class B> using umap = unordered_map<A, B>;
template <class A> using uset = unordered_set<A>;
template <class T>
bool chmax(T &a, const T &b) //最大値更新 返り値はbool
{
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) //最小値更新 返り値はbool
{
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr int INF = 0x3f3f3f3f;
constexpr int LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9 + 7;
constexpr int mod2 = 998244353;
//} END
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n, a, cnt = INF;
cin >> n;
rep(i, 0, 5) {
cin >> a;
chmin(cnt, a);
}
cout << (n + cnt) / cnt + 4 << '\n';
return 0;
} | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i > (n); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
//降順はgreater<T>()
#define all(x) (x).begin(), (x).end()
#define rv(s) reverse((s).begin(), (s).end())
// gcd lcmはそのままok
#define gcd(a, b) __gcd(a, b)
#define bits(n) (1 << (n))
#define pcnt(x) __builtin_popcountll(x)
//配列内等要素削除
#define unique(x) (x).erase(unique(x).begin(),(x).end()),(x).end())
#define Fixed(n) fixed << setprecision(n)
//総和
#define sowa(n) ((n) * ((n) + 1)) / 2
#define pb(x, a) (x).push_back(a)
#define fb(x, a) (x).push_front(a)
#define eb(x, a) (x).emplace_back(a)
#define F first
#define S second
#define cauto const auto &
using P = pair<int, int>;
using Graph = vector<vector<P>>;
template <class T> //昇順
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T> //降順
using max_heap = priority_queue<T>;
template <class A, class B> using umap = unordered_map<A, B>;
template <class A> using uset = unordered_set<A>;
template <class T>
bool chmax(T &a, const T &b) //最大値更新 返り値はbool
{
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) //最小値更新 返り値はbool
{
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr int INF = 0x3f3f3f3f;
constexpr int LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9 + 7;
constexpr int mod2 = 998244353;
//} END
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n, a, cnt = LINF;
cin >> n;
rep(i, 0, 5) {
cin >> a;
chmin(cnt, a);
}
// cout << cnt << '\n';
cout << (n + cnt - 1) / cnt + 4 << '\n';
return 0;
} | [
"variable_declaration.value.change",
"identifier.change"
] | 892,439 | 892,440 | u600244905 | cpp |
p03077 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
#define FIN \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
int main() {
FIN
ll n,
a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mn = min({a, b, c, d, e});
ll ans = 5;
ans += (n % mn == 0) ? n / mn : n / mn;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
#define FIN \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
int main() {
FIN
ll n,
a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mn = min({a, b, c, d, e});
ll ans = 5;
ans += (n % mn == 0) ? n / mn - 1 : n / mn;
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 892,443 | 892,444 | u557565572 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-14)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
// combination com(200010);
int n;
cin >> n;
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << 5 + max({n / a, n / b, n / c, n / d, n / e}) << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-14)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
// combination com(200010);
int n;
cin >> n;
n--;
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << 5 + max({n / a, n / b, n / c, n / d, n / e}) << endl;
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 892,445 | 892,446 | u809967037 | cpp |
p03077 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define sz(x) ((int)(x).size())
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = (int)1e9;
const ll inf = (ll)1e18;
const int mod = 1000000007;
const int MAX_N = 100010;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
/*------------------------------*/
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int mi = min(a, min(b, min(c, min(d, e))));
out((int)ceil((double)n / mi) + 4);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define sz(x) ((int)(x).size())
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = (int)1e9;
const ll inf = (ll)1e18;
const int mod = 1000000007;
const int MAX_N = 100010;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
/*------------------------------*/
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mi = min(a, min(b, min(c, min(d, e))));
out((ll)ceil((double)n / mi) + 4);
return 0;
} | [
"variable_declaration.type.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 892,447 | 892,448 | u273352618 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element((x).begin(), (x).end())
#define MIN(x) *min_element((x).begin(), (x).end())
#define SORTR(x) sort((x).rbegin(), (x).rend())
#define SORT(x) sort((x).begin(), (x).end())
#define SUM(x) accumulate((x).begin(), (x).end(), 0)
#define FILL(x, a) fill(x.begin(), x.end(), a)
#define EACH(i, x) \
for (typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
const long long int INF = 1e18;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
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;
}
template <class BidirectionalIterator>
bool next_partial_permutation(BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last) {
reverse(middle, last);
return next_permutation(first, last);
}
#define COUT(x) cout << x << "\n"
// ll ceil(ll val) return
void Main() {
ll N, A, B, C, D, E;
ll result = 0;
cin >> N >> A >> B >> C >> D >> E;
VI pos(N);
result = 1 + ((N - 1) / min({A, B, C, D, E})) + 4;
cout << result << "\n";
return;
}
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element((x).begin(), (x).end())
#define MIN(x) *min_element((x).begin(), (x).end())
#define SORTR(x) sort((x).rbegin(), (x).rend())
#define SORT(x) sort((x).begin(), (x).end())
#define SUM(x) accumulate((x).begin(), (x).end(), 0)
#define FILL(x, a) fill(x.begin(), x.end(), a)
#define EACH(i, x) \
for (typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
const long long int INF = 1e18;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
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;
}
template <class BidirectionalIterator>
bool next_partial_permutation(BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last) {
reverse(middle, last);
return next_permutation(first, last);
}
#define COUT(x) cout << x << "\n"
// ll ceil(ll val) return
void Main() {
ll N, A, B, C, D, E;
ll result = 0;
cin >> N >> A >> B >> C >> D >> E;
result = 1 + ((N - 1) / min({A, B, C, D, E})) + 4;
cout << result << "\n";
return;
}
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
| [
"variable_declaration.remove"
] | 892,451 | 892,452 | u170054586 | cpp |
p03077 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
ll n;
std::cin >> n;
ll mi = 1e18;
rep(i, 5) {
ll t;
std::cin >> t;
chmin(mi, t);
}
std::cout << ((n + mi) / mi) + 5 - 1 << "\n";
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
ll n;
std::cin >> n;
ll mi = 1e18;
rep(i, 5) {
ll t;
std::cin >> t;
chmin(mi, t);
}
std::cout << ((n + mi - 1) / mi) + 5 - 1 << "\n";
}
| [
"expression.operation.binary.add"
] | 892,453 | 892,454 | u700484101 | cpp |
p03077 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
signed main() {
int N = read(), min = N;
REP(i, 5) { chmin(min, read()); }
if (N == min) {
print(5);
} else {
if (N % min) {
print(5 + (N / min) + 1);
} else {
print(5 + ceil(N / min));
}
}
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
signed main() {
int N = read(), min = N;
REP(i, 5) { chmin(min, read()); }
if (N == min) {
print(5);
} else {
if (N % min) {
print(5 + (N / min));
} else {
print(5 + (N / min) - 1);
}
}
}
| [
"expression.operation.binary.remove",
"call.arguments.change"
] | 892,455 | 892,456 | u700484101 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ll n;
cin >> n;
ll a[5];
for (ll i = 0; i < 5; i++)
cin >> a[i];
ll mn = a[0];
for (ll i = 0; i < 5; i++)
mn = min(a[i], mn);
cout << n / mn + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ll n;
cin >> n;
ll a[5];
for (ll i = 0; i < 5; i++)
cin >> a[i];
ll mn = a[0];
for (ll i = 0; i < 5; i++)
mn = min(a[i], mn);
cout << ((n - 1) / mn) + 5 << endl;
} | [] | 892,457 | 892,458 | u184929210 | cpp |
p03077 | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define ll long long
#define llint long long int
#define reverse(v) reverse(v.begin(), v.end());
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF UnionFind
#define Pint pair<int, int>
#define keta(a) fixed << setprecision(a)
constexpr auto INF = 100000000000;
constexpr auto mod = 1000000007;
//辞書順はnext_permutation( begin( v ), end( v ) );やで！
struct edge {
int to, cost;
};
int main() {
ll n;
cin >> n;
ll z = 1000000000000000;
rep(i, 0, 5) {
ll s;
cin >> s;
if (z > s)
z = s;
}
ll ans = (n + z - 1 / z) + 4;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define ll long long
#define llint long long int
#define reverse(v) reverse(v.begin(), v.end());
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF UnionFind
#define Pint pair<int, int>
#define keta(a) fixed << setprecision(a)
constexpr auto INF = 100000000000;
constexpr auto mod = 1000000007;
//辞書順はnext_permutation( begin( v ), end( v ) );やで！
struct edge {
int to, cost;
};
int main() {
ll n;
cin >> n;
ll z = 1000000000000000;
rep(i, 0, 5) {
ll s;
cin >> s;
if (z > s)
z = s;
}
ll ans = ((n + z - 1) / z) + 4;
cout << ans << endl;
return 0;
} | [] | 892,462 | 892,463 | u407213771 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
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;
}
const int inf = 1001001001;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int mn = min(min(a, b), tmin(c, d, e));
cout << (n + mn - 1) / mn + 4 << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
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;
}
const int inf = 1001001001;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mn = min(min(a, b), tmin(c, d, e));
cout << (n + mn - 1) / mn + 4 << endl;
}
| [
"variable_declaration.type.change"
] | 892,475 | 892,476 | u853721692 | cpp |
p03077 | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << 5 + ((n) / (min(a, min(b, min(c, min(d, e))))));
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << 5 + ((n - 1) / (min(a, min(b, min(c, min(d, e))))));
return 0;
} | [
"expression.operation.binary.add"
] | 892,483 | 892,484 | u141633429 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % m;
a = a * a % m;
n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() : n(0) { ; }
modint(ll m) : n(m) {
if (n >= mod)
n %= mod;
else if (n < 0)
n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
a.n += b.n;
if (a.n >= mod)
a.n -= mod;
return a;
}
modint operator-=(modint &a, modint b) {
a.n -= b.n;
if (a.n < 0)
a.n += mod;
return a;
}
modint operator*=(modint &a, modint b) {
a.n = ((ll)a.n * b.n) % mod;
return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)
return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)
res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)
return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
ll N;
cin >> N;
vector<ll> v(5);
rep(i, 5) cin >> v[i];
ll mi = INF;
rep(i, 5) { mi = min(mi, v[i]); }
cout << (ll)((N - mi + 1) / mi + (ll)5) << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// init_f();
// init();
// int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % m;
a = a * a % m;
n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() : n(0) { ; }
modint(ll m) : n(m) {
if (n >= mod)
n %= mod;
else if (n < 0)
n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
a.n += b.n;
if (a.n >= mod)
a.n -= mod;
return a;
}
modint operator-=(modint &a, modint b) {
a.n -= b.n;
if (a.n < 0)
a.n += mod;
return a;
}
modint operator*=(modint &a, modint b) {
a.n = ((ll)a.n * b.n) % mod;
return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)
return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)
res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)
return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
ll N;
cin >> N;
vector<ll> v(5);
rep(i, 5) cin >> v[i];
ll mi = INF;
rep(i, 5) { mi = min(mi, v[i]); }
cout << (ll)((N + mi - 1) / mi + (ll)4) << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// init_f();
// init();
// int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 892,485 | 892,486 | u132371041 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T> void fin(T a) {
cout << a << endl;
exit(0);
}
void Main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
fin(5 + n / min(a, min(b, min(c, min(d, e)))));
}
//前処理
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20); //高精度少数表示
Main();
return 0;
}
/*
//test時
g++ test.cpp -o test;./test
*/
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T> void fin(T a) {
cout << a << endl;
exit(0);
}
void Main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
fin(5 + (n - 1) / min(a, min(b, min(c, min(d, e)))));
}
//前処理
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20); //高精度少数表示
Main();
return 0;
}
/*
//test時
g++ test.cpp -o test;./test
*/
| [
"call.arguments.change"
] | 892,491 | 892,492 | u743889070 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double PI = acos(-1.0);
ll N;
ll dis[5];
int input() {
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> dis[i];
}
}
int solve() {
ll mi = 1e16;
for (int i = 0; i < 5; ++i)
mi = min(mi, dis[i]);
ll ans = N / mi + 5ll;
if (!N % mi)
ans--;
cout << ans << endl;
}
int main() {
cin.tie();
ios::sync_with_stdio(false);
input();
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double PI = acos(-1.0);
ll N;
ll dis[5];
int input() {
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> dis[i];
}
}
int solve() {
ll mi = 1e16;
for (int i = 0; i < 5; ++i)
mi = min(mi, dis[i]);
ll ans = N / mi + 5ll;
if (N % mi == 0)
ans--;
cout << ans << endl;
}
int main() {
cin.tie();
ios::sync_with_stdio(false);
input();
solve();
return 0;
} | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 892,493 | 892,494 | u675343092 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 深さ優先探索
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
// vector<pair<int, int>> gx, gy;
deque<pair<int, int>> que;
typedef vector<vector<int>> Matrix;
const int INF = 100000000;
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());
ll ans = N / a[0] + 5;
cout << ans << endl;
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/
| #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 深さ優先探索
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
// vector<pair<int, int>> gx, gy;
deque<pair<int, int>> que;
typedef vector<vector<int>> Matrix;
const int INF = 100000000;
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());
ll ans = ((N - 1) / a[0]) + 5;
cout << ans << endl;
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/
| [] | 892,497 | 892,498 | u488878376 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define vecbool vector<bool>
#define vecpairll vector<pair<long long, long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s >= 0; s--)
int main() {
ll n, ans = 0, a[5], count = 0;
string s;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
vecll now(5, 0);
forll(i, 0, 5) if (n / a[i] == 0) now[i] == 0;
else now[i] == 1;
count = max(n - 1 / a[0] + now[0], n - 1 / a[1] + now[1]);
forll(i, 2, 5) { count = max(count, n - 1 / a[i] + now[i]); }
count += 5;
cout << count;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define vecbool vector<bool>
#define vecpairll vector<pair<long long, long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s >= 0; s--)
int main() {
ll n, ans = 0, a[5], count = 0;
string s;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
vecll now(5, 0);
forll(i, 0, 5) if (n / a[i] == 0) now[i] == 0;
else now[i] == 1;
count = max((n - 1) / a[0] + now[0], (n - 1) / a[1] + now[1]);
forll(i, 2, 5) { count = max(count, (n - 1) / a[i] + now[i]); }
count += 5;
cout << count;
} | [
"call.arguments.change"
] | 892,511 | 892,512 | u783408650 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll m = 2000000000000000;
for (int i = 0; i < 5; i++) {
ll x;
cin >> x;
m = min(m, x);
}
cout << 5 + N / m << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll m = 2000000000000000;
for (int i = 0; i < 5; i++) {
ll x;
cin >> x;
m = min(m, x);
}
cout << 5 + (N - 1) / m << endl;
} | [] | 892,513 | 892,514 | u619653948 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
#define repr1(i, N) for (ll i = N; i > 0; i--)
#define INF 1000000007
using ll = long long;
using namespace std;
typedef pair<int, int> P;
int main() {
ll N, ans = 0;
ll A[6];
// double ans = 0.0;
cin >> N;
rep(i, 5) cin >> A[i];
sort(A, A + 5);
ans += (N + A[0] - 1) / (A[0]) + 5;
cout << ans;
// printf("%.15lf",ans);
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
#define repr1(i, N) for (ll i = N; i > 0; i--)
#define INF 1000000007
using ll = long long;
using namespace std;
typedef pair<int, int> P;
int main() {
ll N, ans = 0;
ll A[6];
// double ans = 0.0;
cin >> N;
rep(i, 5) cin >> A[i];
sort(A, A + 5);
ans += (N + A[0] - 1) / (A[0]) + 4;
cout << ans;
// printf("%.15lf",ans);
cout << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 892,517 | 892,518 | u099619676 | cpp |
p03077 | #include <bits/stdc++.h>
#include <bitset>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> v(5);
for (ll i = 0; i < 5; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
ll res = n / v[0];
ll time = res + 5;
cout << time << endl;
}
| #include <bits/stdc++.h>
#include <bitset>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> v(5);
for (ll i = 0; i < 5; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
ll res = (n - 1) / v[0];
ll time = res + 5;
cout << time << endl;
} | [] | 892,525 | 892,526 | u108843155 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%lld", &x)
int main() {
ll n, a, b, c, d, e, ans;
sc(n), sc(a), sc(b), sc(c), sc(d), sc(e);
vector<ll> w = {a, b, c, d, e};
sort(w.begin(), w.end());
if (n <= w[0])
ans = 5;
else if (n % w[0] > 0)
ans = 5 + n / w[0];
else
ans = 4 + w[0];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%lld", &x)
int main() {
ll n, a, b, c, d, e, ans;
sc(n), sc(a), sc(b), sc(c), sc(d), sc(e);
vector<ll> w = {a, b, c, d, e};
sort(w.begin(), w.end());
if (n <= w[0])
ans = 5;
else if (n % w[0] == 0)
ans = 4 + n / w[0];
else
ans = 5 + n / w[0];
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.add",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 892,527 | 892,528 | u920543723 | cpp |
p03077 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
int main(void) {
ll N;
ll a[5];
ll min_a = 1e15 + 1;
cin >> N;
rep(i, 5) {
cin >> a[i];
min_a = min(min_a, a[i]);
}
ll answer = ceil(N / min_a) + 5;
cout << answer << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
int main(void) {
ll N;
ll a[5];
ll min_a = 1e15 + 1;
cin >> N;
rep(i, 5) {
cin >> a[i];
min_a = min(min_a, a[i]);
}
ll answer = ceil((N - 1) / min_a) + 5;
cout << answer << endl;
return 0;
} | [
"call.arguments.change"
] | 892,531 | 892,532 | u767543103 | cpp |
p03077 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep1(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define rep(i, a, b) for (int i = (a); (i) < (b); (i)++)
#define ll long long
#define mpi map<int, int>
#define N 200005
#define pql priority_queue<ll>
#define all(v) (v).begin(), (v).end()
#define str stringstream
using namespace std;
int main() {
ll n, a, Min = 1e17;
cin >> n;
rep(i, 0, 5) {
cin >> a;
Min = min(a, Min);
}
cout << n / Min + 4 + 1;
return 0;
}
| #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep1(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define rep(i, a, b) for (int i = (a); (i) < (b); (i)++)
#define ll long long
#define mpi map<int, int>
#define N 200005
#define pql priority_queue<ll>
#define all(v) (v).begin(), (v).end()
#define str stringstream
using namespace std;
int main() {
ll n, a, Min = 1e17;
cin >> n;
rep(i, 0, 5) {
cin >> a;
Min = min(a, Min);
}
cout << (n - 1) / Min + 4 + 1;
return 0;
}
| [] | 892,537 | 892,538 | u796123030 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
long long cap = 1001001001001001;
for (int i = 0; i < 5; i++) {
long long c;
cin >> c;
cap = min(cap, c);
}
cout << (n + cap - 1) / cap + 4 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long cap = 1001001001001001;
for (int i = 0; i < 5; i++) {
long long c;
cin >> c;
cap = min(cap, c);
}
cout << (n + cap - 1) / cap + 4 << '\n';
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 892,539 | 892,540 | u254871849 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, c = 0, min = 900000000000000;
cin >> n;
vector<long long int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (min >= a[i]) {
min = a[i];
}
}
cout << (n + min) / min + 4 << endl;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, c = 0, min = 900000000000000;
cin >> n;
vector<long long int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (min >= a[i]) {
min = a[i];
}
}
cout << (n - 1) / min + 5 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 892,553 | 892,554 | u519899937 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e16;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll M;
M = min(a, b);
M = min(c, M);
M = min(d, M);
M = min(e, M);
cout << 5 + n / M << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e16;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll M;
M = min(a, b);
M = min(c, M);
M = min(d, M);
M = min(e, M);
cout << 5 + (n - 1) / M << endl;
return 0;
} | [] | 892,555 | 892,556 | u045408189 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> void chmin(T &a, const T &b) noexcept {
if (b < a)
a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
if (a < b)
a = b;
}
void debug_out() { cout << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
auto f = [&](ll x) {
ll res = (n + x - 1) / x;
debug(x, res);
return res;
};
ll maxi = 0;
rep(i, 5) {
chmax(
maxi,
f(a[i])); //必要な乗る回数の最大値（その他はそのまま都市についたらすぐ乗る）
}
ll ans = 5 + maxi - 1;
debug(ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> void chmin(T &a, const T &b) noexcept {
if (b < a)
a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
if (a < b)
a = b;
}
void debug_out() { cout << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
auto f = [&](ll x) {
ll res = (n + x - 1) / x;
debug(x, res);
return res;
};
ll maxi = 0;
rep(i, 5) {
chmax(
maxi,
f(a[i])); //必要な乗る回数の最大値（その他はそのまま都市についたらすぐ乗る）
}
ll ans = 5 + maxi - 1;
cout << ans << endl;
return 0;
} | [
"io.output.change"
] | 892,557 | 892,558 | u681349918 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int mod = 1000000007;
ll cnt = 0;
int main() {
ll n;
cin >> n;
ll a;
ll minnum = INF;
map<ll, ll> mp;
ll ans = -1;
for (int i = 0; i < 5; i++) {
cin >> a;
ans = max(ans, n / a);
}
cout << 5 + ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int mod = 1000000007;
ll cnt = 0;
int main() {
ll n;
cin >> n;
n--;
ll a;
ll minnum = INF;
map<ll, ll> mp;
ll ans = -1;
for (int i = 0; i < 5; i++) {
cin >> a;
ans = max(ans, n / a);
}
cout << 5 + ans << endl;
} | [
"expression.unary.arithmetic.add"
] | 892,561 | 892,562 | u179593519 | cpp |
p03077 | // int a = stoi(c); 文字列をintへ
//小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
//途中の出力をそのまま残さない
//数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
//絶対値 abs()
//入力は空白で切れる
//大文字判定 isupper(文字) 小文字判定 islower(文字)
// do{}while(next_permutation(ALL(配列)))
// while(N)で回すとき、Nはコピーを作っておく
//小文字に対応する文字コード：S[i] - 'a'
//文字コード→小文字：(char)(数字+'a')
//グラフの距離:隣接行列で扱う
//等価なものに変換する思考
// bool型 初期値はTrue
//島渡りの問題：中間ノードに着目
//配列はvector<>を使う：意味わからないエラーがなくなる。
//背反な事象にちゃんとわける
//チェックリストはマップを使う
//数が大きい時の比較はstring型で行う
//全て0になったか調べたい->0になるたびにcntする
//またはかかつか
//例外処理は最初にする
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define ALL(a) (a).begin(), (a).end()
#define ll long long int
using namespace std;
// K進数でのNの桁数
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
// a,bの最大公約数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
// nC2の計算
ll C(ll N) { return N * (N - 1) / 2; }
//円周率
const double PI = 3.14159265358979323846;
//割るやつ
const ll MOD = (pow(10, 9) + 7);
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
vector<ll> a(5);
a[0] = A;
a[1] = B;
a[2] = C;
a[3] = D;
a[4] = E;
sort(ALL(a));
ll x;
if (N % a[0] == 0)
x = N / a[0];
else
x = N / a[0] + 1;
if (a[0] == A) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == B) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == C) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == D) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == E) {
cout << x + 5 << endl;
return 0;
}
} | // int a = stoi(c); 文字列をintへ
//小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
//途中の出力をそのまま残さない
//数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
//絶対値 abs()
//入力は空白で切れる
//大文字判定 isupper(文字) 小文字判定 islower(文字)
// do{}while(next_permutation(ALL(配列)))
// while(N)で回すとき、Nはコピーを作っておく
//小文字に対応する文字コード：S[i] - 'a'
//文字コード→小文字：(char)(数字+'a')
//グラフの距離:隣接行列で扱う
//等価なものに変換する思考
// bool型 初期値はTrue
//島渡りの問題：中間ノードに着目
//配列はvector<>を使う：意味わからないエラーがなくなる。
//背反な事象にちゃんとわける
//チェックリストはマップを使う
//数が大きい時の比較はstring型で行う
//全て0になったか調べたい->0になるたびにcntする
//またはかかつか
//例外処理は最初にする
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define ALL(a) (a).begin(), (a).end()
#define ll long long int
using namespace std;
// K進数でのNの桁数
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
// a,bの最大公約数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
// nC2の計算
ll C(ll N) { return N * (N - 1) / 2; }
//円周率
const double PI = 3.14159265358979323846;
//割るやつ
const ll MOD = (pow(10, 9) + 7);
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
vector<ll> a(5);
a[0] = A;
a[1] = B;
a[2] = C;
a[3] = D;
a[4] = E;
sort(ALL(a));
ll x;
if (N % a[0] == 0)
x = N / a[0];
else
x = N / a[0] + 1;
if (a[0] == A) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == B) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == C) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == D) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == E) {
cout << x + 4 << endl;
return 0;
}
} | [
"literal.number.change",
"io.output.change"
] | 892,563 | 892,564 | u565692645 | cpp |
p03077 | // int a = stoi(c); 文字列をintへ
//小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
//途中の出力をそのまま残さない
//数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
//絶対値 abs()
//入力は空白で切れる
//大文字判定 isupper(文字) 小文字判定 islower(文字)
// do{}while(next_permutation(ALL(配列)))
// while(N)で回すとき、Nはコピーを作っておく
//小文字に対応する文字コード：S[i] - 'a'
//文字コード→小文字：(char)(数字+'a')
//グラフの距離:隣接行列で扱う
//等価なものに変換する思考
// bool型 初期値はTrue
//島渡りの問題：中間ノードに着目
//配列はvector<>を使う：意味わからないエラーがなくなる。
//背反な事象にちゃんとわける
//チェックリストはマップを使う
//数が大きい時の比較はstring型で行う
//全て0になったか調べたい->0になるたびにcntする
//またはかかつか
//例外処理は最初にする
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define ALL(a) (a).begin(), (a).end()
#define ll long long int
using namespace std;
// K進数でのNの桁数
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
// a,bの最大公約数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
// nC2の計算
ll C(ll N) { return N * (N - 1) / 2; }
//円周率
const double PI = 3.14159265358979323846;
//割るやつ
const ll MOD = (pow(10, 9) + 7);
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
vector<ll> a(5);
a[0] = A;
a[1] = B;
a[2] = C;
a[3] = D;
a[4] = E;
sort(ALL(a));
ll x;
if (N % a[0] == 0)
x = N / a[0];
else
x = N / a[0] + 1;
if (a[0] == A) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == B) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == C) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == D) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == E) {
cout << x + 1 << endl;
return 0;
}
} | // int a = stoi(c); 文字列をintへ
//小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
//途中の出力をそのまま残さない
//数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
//絶対値 abs()
//入力は空白で切れる
//大文字判定 isupper(文字) 小文字判定 islower(文字)
// do{}while(next_permutation(ALL(配列)))
// while(N)で回すとき、Nはコピーを作っておく
//小文字に対応する文字コード：S[i] - 'a'
//文字コード→小文字：(char)(数字+'a')
//グラフの距離:隣接行列で扱う
//等価なものに変換する思考
// bool型 初期値はTrue
//島渡りの問題：中間ノードに着目
//配列はvector<>を使う：意味わからないエラーがなくなる。
//背反な事象にちゃんとわける
//チェックリストはマップを使う
//数が大きい時の比較はstring型で行う
//全て0になったか調べたい->0になるたびにcntする
//またはかかつか
//例外処理は最初にする
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define ALL(a) (a).begin(), (a).end()
#define ll long long int
using namespace std;
// K進数でのNの桁数
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
// a,bの最大公約数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
// nC2の計算
ll C(ll N) { return N * (N - 1) / 2; }
//円周率
const double PI = 3.14159265358979323846;
//割るやつ
const ll MOD = (pow(10, 9) + 7);
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
vector<ll> a(5);
a[0] = A;
a[1] = B;
a[2] = C;
a[3] = D;
a[4] = E;
sort(ALL(a));
ll x;
if (N % a[0] == 0)
x = N / a[0];
else
x = N / a[0] + 1;
if (a[0] == A) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == B) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == C) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == D) {
cout << x + 4 << endl;
return 0;
}
if (a[0] == E) {
cout << x + 4 << endl;
return 0;
}
} | [
"literal.number.change",
"io.output.change"
] | 892,565 | 892,564 | u565692645 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
cout << max({(N - 1) / A, (N - 1) / B, (N - 1) / C, (N - 1) / D,
(N - 1) / E}) *
4 +
5
<< endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
cout << max({(N - 1) / A, (N - 1) / B, (N - 1) / C, (N - 1) / D,
(N - 1) / E}) +
5
<< endl;
return 0;
} | [] | 892,570 | 892,571 | u112747720 | cpp |
p03077 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define vec vector
#define vi vec<int>
#define vvi vec<vec<int>>
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define SORT(a) stable_sort(ALL(a))
#define RSORT(a) stable_sort(RALL(a))
#define REV(a) reverse(ALL(a))
#define UNIQUE(a) a.erase(unique(ALL(a)), end(a))
#define lambda(i) [](auto &i)
#define compare(i, j) [](auto &i, auto &j)
#define min_of(a) *min_element(ALL(a))
#define max_of(a) *max_element(ALL(a))
#define sum(a) accumulate(ALL(a), 0)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define SZ(a) (int)(a).size()
#define REP(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define RREP(i, n) for (auto i = n - 1; i != static_cast<decltype(i)>(-1); i--)
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define RFOR(i, a, b) for (auto i = b - 1; i != a; i--)
#define EACH(i, a) for (auto &&i : (a))
using namespace std;
const int INF = 1e18;
const int MOD = 1e9 + 7;
struct union_find {
vi data;
union_find(int size) : data(size, -1) {}
bool union_set(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool find_set(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
vi cum(vi V) {
vi U(SZ(V));
partial_sum(ALL(V), begin(U));
return U;
}
void solve() {
int n;
int ans = 0;
cin >> n;
vi v(5);
REP(i, 5) {
cin >> v[i];
int l_min = INF;
REP(j, i) l_min = min(l_min, v[j]);
ans = max(ans, (n - 1) / l_min + 1 + i);
}
cout << ans << endl;
// REP(i, n) {
// cout << v[i];
// }
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
solve();
}
| #include <bits/stdc++.h>
#define int long long
#define ll long long
#define vec vector
#define vi vec<int>
#define vvi vec<vec<int>>
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define SORT(a) stable_sort(ALL(a))
#define RSORT(a) stable_sort(RALL(a))
#define REV(a) reverse(ALL(a))
#define UNIQUE(a) a.erase(unique(ALL(a)), end(a))
#define lambda(i) [](auto &i)
#define compare(i, j) [](auto &i, auto &j)
#define min_of(a) *min_element(ALL(a))
#define max_of(a) *max_element(ALL(a))
#define sum(a) accumulate(ALL(a), 0)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define SZ(a) (int)(a).size()
#define REP(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define RREP(i, n) for (auto i = n - 1; i != static_cast<decltype(i)>(-1); i--)
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define RFOR(i, a, b) for (auto i = b - 1; i != a; i--)
#define EACH(i, a) for (auto &&i : (a))
using namespace std;
const int INF = 1e18;
const int MOD = 1e9 + 7;
struct union_find {
vi data;
union_find(int size) : data(size, -1) {}
bool union_set(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool find_set(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
vi cum(vi V) {
vi U(SZ(V));
partial_sum(ALL(V), begin(U));
return U;
}
void solve() {
int n;
int ans = 0;
cin >> n;
vi v(5);
REP(i, 5) {
cin >> v[i];
int l_min = INF;
REP(j, i + 1) l_min = min(l_min, v[j]);
ans = max(ans, (n - 1) / l_min + 1 + i);
}
cout << ans << endl;
// REP(i, n) {
// cout << v[i];
// }
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
solve();
}
| [
"assignment.change"
] | 892,572 | 892,573 | u048773461 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
int main() {
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
ll mi = a[0];
rep(i, 4) mi = min(mi, a[i + 1]);
ll ans = n / mi + 5;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
int main() {
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
ll mi = a[0];
rep(i, 4) mi = min(mi, a[i + 1]);
ll ans = (n - 1) / mi + 5;
cout << ans << endl;
} | [] | 892,574 | 892,575 | u737491054 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) REP(i, 0, n)
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPE(i, x, n) for (int i = x; i <= n; i++)
#define OP(x) cout << x << endl;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> void chmax(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a < b)
b = a;
}
typedef long long ll;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll ans = (n / min({a, b, c, d, e})) + 5;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) REP(i, 0, n)
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPE(i, x, n) for (int i = x; i <= n; i++)
#define OP(x) cout << x << endl;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> void chmax(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a < b)
b = a;
}
typedef long long ll;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll ans = ((n - 1) / min({a, b, c, d, e})) + 5;
cout << ans << endl;
}
| [] | 892,581 | 892,582 | u651235280 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll a[5];
int main() {
ll n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
ll x = (n + a[0] - 1 / a[0]);
cout << x + 4 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll a[5];
int main() {
ll n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
ll x = (n + a[0] - 1) / a[0];
cout << x + 4 << endl;
return 0;
} | [] | 892,587 | 892,588 | u774202056 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
#define showall(obj) \
for (auto x : obj) \
cout << x << endl;
typedef long long ll;
typedef pair<int, int> ip;
typedef pair<ll, ll> lp;
typedef vector<int> vint;
typedef vector<ll> vll;
const int inf = 100100100;
const ll INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll div = min({a, b, c, d, e});
ll ans = 4 + ceil(n / div);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
#define showall(obj) \
for (auto x : obj) \
cout << x << endl;
typedef long long ll;
typedef pair<int, int> ip;
typedef pair<ll, ll> lp;
typedef vector<int> vint;
typedef vector<ll> vll;
const int inf = 100100100;
const ll INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
int main() {
long double n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long double div = min({a, b, c, d, e});
ll ans = 4 + ceil(n / div);
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 892,608 | 892,609 | u190761897 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n;
cin >> a >> b >> c >> d >> e;
cout << fixed << setprecision(0) << n / min(a, min(b, min(c, min(d, e)))) + 5
<< endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n;
cin >> a >> b >> c >> d >> e;
cout << fixed << setprecision(0)
<< (n - 1) / min(a, min(b, min(c, min(d, e)))) + 5 << endl;
return 0;
} | [] | 892,610 | 892,611 | u406647332 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int N;
cin >> N;
long long int minNum = 1e15;
vector<long long int> nums(5);
for (int i = 0; i < 5; i++) {
cin >> nums[i];
if (nums[i] < minNum)
minNum = nums[i];
}
int ans;
if (N % minNum == 0)
ans = N / minNum;
else
ans = N / minNum + 1;
cout << ans + 4 << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int N;
cin >> N;
long long int minNum = 1e15;
vector<long long int> nums(5);
for (int i = 0; i < 5; i++) {
cin >> nums[i];
if (nums[i] < minNum)
minNum = nums[i];
}
long long int ans;
if (N % minNum == 0)
ans = N / minNum;
else
ans = (N / minNum) + 1;
cout << ans + 4 << endl;
} | [
"variable_declaration.type.widen.change"
] | 892,612 | 892,613 | u992875223 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
const int INF = 2147483647; // int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
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;
}
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mi = min({a, b, c, d, e});
cout << 5 + ((n - mi + 1) / mi) << endl;
return 0;
}
/*
やっほい！
やほほい！
+ *
∧∧ . ∧∞∧ *
* ヽ(=´ω｀)人(´ω｀*)ﾉ
.～（ O x.） （ O)～ +
。* ∪ ∪
*/ | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
const int INF = 2147483647; // int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
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;
}
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mi = min({a, b, c, d, e});
cout << 5 + ((n + mi - 1) / mi) - 1 << endl;
return 0;
}
/*
やっほい！
やほほい！
+ *
∧∧ . ∧∞∧ *
* ヽ(=´ω｀)人(´ω｀*)ﾉ
.～（ O x.） （ O)～ +
。* ∪ ∪
*/ | [
"expression.operation.binary.remove"
] | 892,614 | 892,615 | u901555384 | cpp |
p03077 | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll mn = 100000000000000000;
for (int i = 0; i < 5; i++) {
ll sub;
cin >> sub;
if (sub < mn)
mn = sub;
}
cout << n / mn + 5 << endl;
} | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll mn = 100000000000000000;
for (int i = 0; i < 5; i++) {
ll sub;
cin >> sub;
if (sub < mn)
mn = sub;
}
cout << (n - 1) / mn + 5 << endl;
} | [] | 892,624 | 892,625 | u993074316 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define len(v) ll(v.size())
const ll mod = 1e9 + 7;
// vector書き出し
template <class T> void cout_vec(const vector<T> &vec1) {
rep(i, len(vec1)) { cout << vec1[i] << ' '; }
cout << '\n';
}
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
vector<ll> a(5);
cin >> n;
cin >> a[0];
ll min = a[0];
ll ind = 0;
FOR(i, 1, 5) {
cin >> a[i];
if (a[i] < min) {
min = a[i];
ind = i;
}
}
if (ind == 4) {
cout << n / min + 4 << endl;
} else {
cout << n / min + 5 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define len(v) ll(v.size())
const ll mod = 1e9 + 7;
// vector書き出し
template <class T> void cout_vec(const vector<T> &vec1) {
rep(i, len(vec1)) { cout << vec1[i] << ' '; }
cout << '\n';
}
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
vector<ll> a(5);
cin >> n;
cin >> a[0];
ll min = a[0];
ll ind = 0;
FOR(i, 1, 5) {
cin >> a[i];
if (a[i] < min) {
min = a[i];
ind = i;
}
}
if (n % min == 0) {
cout << n / min + 4 << endl;
} else {
cout << n / min + 5 << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 892,627 | 892,628 | u340010271 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
ll N, A, B, C, D, E, ans = 0;
int main() {
cin >> N >> A >> B >> C >> D >> E;
ll X = min({A, B, C, D, E});
cout << setprecision(10) << ceil((long double)N / (long double)X) + 4;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
ll N, A, B, C, D, E, ans = 0;
int main() {
cin >> N >> A >> B >> C >> D >> E;
ll X = min({A, B, C, D, E});
cout << setprecision(30) << ceil((long double)N / (long double)X) + 4;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 892,636 | 892,637 | u987913144 | cpp |
p03077 | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1.0);
int main() {
ll n, a, b, c, d, e, res = 0;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
res = min({a, b, c, d});
res = n / res + 4 + (n % res ? 1 : 0);
printf("%lld\n", res);
return 0;
}
| #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1.0);
int main() {
ll n, a, b, c, d, e, res = 0;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
res = min({a, b, c, d, e});
res = n / res + 4 + (n % res ? 1 : 0);
printf("%lld\n", res);
return 0;
}
| [] | 892,645 | 892,646 | u789157713 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long ans = 4;
long long minv = min({a, b, e, d, e});
ans += (n + minv - 1) / minv;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long ans = 4;
long long minv = min({a, b, c, d, e});
ans += (n + minv - 1) / minv;
cout << ans << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change"
] | 892,649 | 892,650 | u813098295 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
ll aa[5];
rep(i, 4) {
if (a[i + 1] > a[i]) {
a[i + 1] = a[i];
}
}
aa[0] = (n + a[0] - 1) / a[0];
aa[1] = (n + a[1] - 1) / a[1] + 1;
aa[2] = (n + a[2] - 1) / a[2] + 2;
aa[3] = (n + a[1] - 1) / a[3] + 3;
aa[4] = (n + a[4] - 1) / a[4] + 4;
ll min = aa[0];
rep(i, 5) {
if (min < aa[i]) {
min = aa[i];
}
}
cout << min << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
ll aa[5];
rep(i, 4) {
if (a[i + 1] > a[i]) {
a[i + 1] = a[i];
}
}
aa[0] = (n + a[0] - 1) / a[0];
aa[1] = (n + a[1] - 1) / a[1] + 1;
aa[2] = (n + a[2] - 1) / a[2] + 2;
aa[3] = (n + a[1] - 1) / a[3] + 3;
aa[4] = (n + a[4] - 1) / a[4] + 4;
ll min = aa[0];
rep(i, 5) {
if (min < aa[i]) {
min = aa[i];
}
}
cout << aa[4] << endl;
return 0;
} | [
"io.output.change"
] | 892,655 | 892,656 | u985524697 | cpp |
p03077 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
#define debug_vi(v) \
copy((v).begin(), (v).end(), ostream_iterator<int>(cout, " "));
#define debug_vll(v) \
copy((v).begin(), (v).end(), ostream_iterator<long long>(cout, " "));
#define debug_vd(v) \
copy((v).begin(), (v).end(), ostream_iterator<double>(cout, " "));
#define sort_v(v) sort((v).begin(), (v).end()); //昇順
#define d_sort_vi(v) sort((v).begin(), (v).end(), greater<int>()); //降
#define d_sort_vd(v) sort((v).begin(), (v).end(), greater<double>()); //昇順
#define say(t) cout << (t) << endl;
#define sum_vi(v) accumulate((v).begin(), (v).end(), 0);
#define sum_vll(v) accumulate((v).begin(), (v).end(), 0LL);
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; }
const int IINF = (1 << 30);
const ll LLINF = 1LL << 60;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
ll n;
cin >> n;
vector<ll> hoge(5);
rep_i(i, hoge.size()) { cin >> hoge[i]; }
ll m = *min_element(hoge.begin(), hoge.end());
if (n <= m) {
cout << 5 << endl;
} else {
if (n % m != 0) {
n += n % m;
}
cout << n / m + 4 << endl;
}
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
#define debug_vi(v) \
copy((v).begin(), (v).end(), ostream_iterator<int>(cout, " "));
#define debug_vll(v) \
copy((v).begin(), (v).end(), ostream_iterator<long long>(cout, " "));
#define debug_vd(v) \
copy((v).begin(), (v).end(), ostream_iterator<double>(cout, " "));
#define sort_v(v) sort((v).begin(), (v).end()); //昇順
#define d_sort_vi(v) sort((v).begin(), (v).end(), greater<int>()); //降
#define d_sort_vd(v) sort((v).begin(), (v).end(), greater<double>()); //昇順
#define say(t) cout << (t) << endl;
#define sum_vi(v) accumulate((v).begin(), (v).end(), 0);
#define sum_vll(v) accumulate((v).begin(), (v).end(), 0LL);
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; }
const int IINF = (1 << 30);
const ll LLINF = 1LL << 60;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
ll n;
cin >> n;
vector<ll> hoge(5);
rep_i(i, hoge.size()) { cin >> hoge[i]; }
ll m = *min_element(hoge.begin(), hoge.end());
if (n <= m) {
cout << 5 << endl;
} else {
// cout << n/m << endl;
if (n % m != 0) {
n += m;
}
// cout << n/m << endl;
cout << n / m + 4 << endl;
}
} | [
"expression.operation.binary.remove"
] | 892,663 | 892,664 | u981388291 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <utility>
#include <vector>
using namespace std;
vector<int> s(5);
int main() {
int N;
cin >> N >> s[0] >> s[1] >> s[2] >> s[3] >> s[4];
sort(s.begin(), s.end());
int ans = ceil((double)N / s[0]) + 4;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <utility>
#include <vector>
using namespace std;
vector<long long> s(5);
int main() {
long long N;
cin >> N >> s[0] >> s[1] >> s[2] >> s[3] >> s[4];
sort(s.begin(), s.end());
long long ans = ceil((double)N / s[0]) + 4;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 892,673 | 892,674 | u432088501 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
// using ll = long long;
#define int long long
#define LOG(variable) cout << #variable ":\t" << (variable) << endl
#define LOGCON(i, container) \
for (int(i) = 0; (i) < (container).size(); ++(i)) \
cout << (i) << ":\t" << (container)[(i)] << endl
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(i, r, n) for (int i = (r); i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i) // from n to 0
#define REPRS(i, r, n) for (int i = (n); i >= (r); --i) // from n to r
#define REPOBJ(itr, obj) \
for (auto itr = (obj).begin(); itr != (obj).end(); ++itr)
#define REPROBJ(itr, obj) \
for (auto itr = (obj).rbegin(), e = (obj).rend(); itr != e; ++itr)
#define COUTB(x) cout << (x) << "\n"
#define COUTS(x) cout << (x) << " "
#define PB push_back
#define SORT(obj) sort((obj).begin(), (obj).end())
#define SORTR(obj) sort((obj).begin(), (obj).end(), greater<>())
#define ALL(obj) (obj).begin(), (obj).end()
#define MOD 1000000007
#define PI (acos(-1))
/***** MAIN *****/
signed main() {
int n;
cin >> n;
int minimum = LLONG_MAX;
REP(i, 5) {
int tmp;
cin >> tmp;
minimum = min(minimum, tmp);
}
if (n <= minimum) {
cout << 5 << endl;
return 0;
}
int extra = n / minimum;
if (n % minimum == 0)
++extra;
cout << 5 + extra;
cout << "\n";
return 0;
}
/***** MAIN *****/
| #include <bits/stdc++.h>
using namespace std;
// using ll = long long;
#define int long long
#define LOG(variable) cout << #variable ":\t" << (variable) << endl
#define LOGCON(i, container) \
for (int(i) = 0; (i) < (container).size(); ++(i)) \
cout << (i) << ":\t" << (container)[(i)] << endl
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(i, r, n) for (int i = (r); i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i) // from n to 0
#define REPRS(i, r, n) for (int i = (n); i >= (r); --i) // from n to r
#define REPOBJ(itr, obj) \
for (auto itr = (obj).begin(); itr != (obj).end(); ++itr)
#define REPROBJ(itr, obj) \
for (auto itr = (obj).rbegin(), e = (obj).rend(); itr != e; ++itr)
#define COUTB(x) cout << (x) << "\n"
#define COUTS(x) cout << (x) << " "
#define PB push_back
#define SORT(obj) sort((obj).begin(), (obj).end())
#define SORTR(obj) sort((obj).begin(), (obj).end(), greater<>())
#define ALL(obj) (obj).begin(), (obj).end()
#define MOD 1000000007
#define PI (acos(-1))
/***** MAIN *****/
signed main() {
int n;
cin >> n;
int minimum = LLONG_MAX;
REP(i, 5) {
int tmp;
cin >> tmp;
minimum = min(minimum, tmp);
}
if (n <= minimum) {
cout << 5 << endl;
return 0;
}
int extra = n / minimum;
if (n % minimum == 0)
--extra;
cout << 5 + extra;
cout << "\n";
return 0;
}
/***** MAIN *****/
| [] | 892,679 | 892,680 | u323748756 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S) \
vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 1000000007
#define MAX 510000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
lli A, B, C, D, E, F, N, M, K, L, X, Y, Z, H, W, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N;
Vec(P, lli, 5, 0);
rep(i, 0, 5) cin >> P[i];
Sort(P);
if (N % P[0])
K = N / P[0];
else
K = N / P[0] - 1;
Out(N + K);
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S) \
vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 1000000007
#define MAX 510000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
lli A, B, C, D, E, F, N, M, K, L, X, Y, Z, H, W, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N;
Vec(P, lli, 5, 0);
rep(i, 0, 5) cin >> P[i];
Sort(P);
if (N % P[0])
K = N / P[0];
else
K = N / P[0] - 1;
Out(5 + K);
} | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 892,681 | 892,682 | u618604643 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define Vecpr vector<pair<lli, lli>>
int main() {
lli N, A;
vector<lli> P(5);
rep(i, 5) cin >> P[i];
Sort(P);
if (N % P[0] == 0)
A = N / P[0] + 4;
else
A = N / P[0] + 5;
Out(A);
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define Vecpr vector<pair<lli, lli>>
int main() {
lli N, A;
cin >> N;
vector<lli> P(5);
rep(i, 5) cin >> P[i];
Sort(P);
if (N % P[0] == 0)
A = N / P[0] + 4;
else
A = N / P[0] + 5;
Out(A);
}
| [] | 892,683 | 892,684 | u618604643 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
unsigned long long city[5], N;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> city[i];
}
unsigned long long min_value = 10000000000000001;
int min_index;
for (int i = 0; i < 5; i++) {
if (city[i] < min_value) {
min_value = city[i];
min_index = i;
}
}
cout << 5 + N / min_value << endl;
} | #include <iostream>
using namespace std;
int main() {
unsigned long long city[5], N;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> city[i];
}
unsigned long long min_value = 10000000000000001;
int min_index;
for (int i = 0; i < 5; i++) {
if (city[i] < min_value) {
min_value = city[i];
min_index = i;
}
}
cout << 5 + (N - 1) / min_value << endl;
} | [] | 892,701 | 892,702 | u247407965 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
unsigned long long city[5], N;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> city[i];
}
unsigned long long min_value = 1000000000000001;
int min_index;
for (int i = 0; i < 5; i++) {
if (city[i] < min_value) {
min_value = city[i];
min_index = i;
}
}
cout << 5 + N / min_value << endl;
} | #include <iostream>
using namespace std;
int main() {
unsigned long long city[5], N;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> city[i];
}
unsigned long long min_value = 10000000000000001;
int min_index;
for (int i = 0; i < 5; i++) {
if (city[i] < min_value) {
min_value = city[i];
min_index = i;
}
}
cout << 5 + (N - 1) / min_value << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 892,703 | 892,702 | u247407965 | cpp |
p03077 | #include <bits/stdc++.h>
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define RFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define rep(i, N) FOR(i, 0, N)
#define rrep(i, N) RFOR(i, 0, N)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
using namespace std;
using ll = long long int;
using V = vector<ll>;
using P = pair<ll, ll>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
constexpr int mod = 1e9 + 7;
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; }
ll n;
int main() {
cin >> n;
V t(5);
rep(i, 5) cin >> t[i];
ll minel = t[0];
FOR(i, 1, 5) minel = min(minel, t[i]);
ll ret = n / minel + (minel != 0) + 4;
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define RFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define rep(i, N) FOR(i, 0, N)
#define rrep(i, N) RFOR(i, 0, N)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
using namespace std;
using ll = long long int;
using V = vector<ll>;
using P = pair<ll, ll>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
constexpr int mod = 1e9 + 7;
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; }
ll n;
int main() {
cin >> n;
V t(5);
rep(i, 5) cin >> t[i];
ll minel = t[0];
FOR(i, 1, 5) minel = min(minel, t[i]);
ll ret = n / minel + (n % minel != 0) + 4;
cout << ret << endl;
return 0;
}
| [
"assignment.change"
] | 892,706 | 892,707 | u636235110 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long min_trans = min(a, min(b, min(c, min(d, e))));
if (min_trans < n)
cout << n / min_trans + 5 << endl;
else
cout << 5 << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long min_trans = min(a, min(b, min(c, min(d, e))));
if (min_trans < n)
cout << (n - 1) / min_trans + 5 << endl;
else
cout << 5 << endl;
}
| [] | 892,724 | 892,725 | u482808969 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int64_t z = min(a, (b, (c, (d, e))));
if (n % z == 0) {
cout << (n / z) + 4;
} else {
cout << (n / z) + 5;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int64_t z = min(a, min(b, min(c, min(d, e))));
if (n % z == 0) {
cout << (n / z) + 4;
} else {
cout << (n / z) + 5;
}
} | [
"call.add",
"call.arguments.change"
] | 892,726 | 892,727 | u607229598 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long a[5];
for (int i = 0; i < 5; ++i) {
cin >> a[i];
}
long long mina = 1e+15;
for (int i = 0; i < 5; ++i) {
if (mina > a[i])
mina = a[i];
}
int ans = N / mina;
if (N % mina == 0)
ans += 4;
else
ans += 5;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long a[5];
for (int i = 0; i < 5; ++i) {
cin >> a[i];
}
long long mina = 1e+15;
for (int i = 0; i < 5; ++i) {
if (mina > a[i])
mina = a[i];
}
long long ans = N / mina;
if (N % mina == 0)
ans += 4;
else
ans += 5;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 892,732 | 892,733 | u394561216 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define MOD 1000000007
using namespace std;
main() {
ll n;
array<ll, 5> a;
scanf("%lld", &n);
rep(i, 5) scanf("%lld", &a[i]);
ll min_ = *min_element(a.begin(), a.end());
printf("%lld\n", n / min_ + (n % min_ ? 5 : 1));
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define MOD 1000000007
using namespace std;
main() {
ll n;
array<ll, 5> a;
scanf("%lld", &n);
rep(i, 5) scanf("%lld", &a[i]);
ll min_ = *min_element(a.begin(), a.end());
printf("%lld\n", n / min_ + (n % min_ ? 5 : 4));
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,743 | 892,744 | u187597169 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
int len = 5;
vector<ll> arr(len);
for (int i = 0; i < len; i++) {
cin >> arr[i];
}
ll minEl = *min_element(arr.begin(), arr.end());
if (minEl >= n) {
cout << len << endl;
return 0;
}
ll d = n / minEl;
if (n / minEl == 0) {
d--;
}
cout << (ll)len + d << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
int len = 5;
vector<ll> arr(len);
for (int i = 0; i < len; i++) {
cin >> arr[i];
}
ll minEl = *min_element(arr.begin(), arr.end());
if (minEl >= n) {
cout << len << endl;
return 0;
}
ll d = n / minEl;
if (n % minEl == 0) {
d--;
}
cout << (ll)len + d << endl;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 892,747 | 892,748 | u416521732 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll mi = LLONG_MAX;
for (int i = 0; i < 5; i++) {
ll A;
cin >> A;
mi = min(mi, A);
}
cout << 5 + (N - mi + 1) / mi << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll mi = LLONG_MAX;
for (int i = 0; i < 5; i++) {
ll A;
cin >> A;
mi = min(mi, A);
}
cout << 4 + (N + mi - 1) / mi << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change",
"expression.operation.binary.remove"
] | 892,753 | 892,754 | u752161277 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) cin >> vec.at(i);
sort(vec.begin(), vec.end());
int t;
t = vec.at(0);
cout << (n + t - 1) / n + 4;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long n;
cin >> n;
vector<long> vec(5);
rep(i, 5) cin >> vec.at(i);
sort(vec.begin(), vec.end());
long t;
t = vec.at(0);
cout << (n + t - 1) / t + 4;
} | [
"variable_declaration.type.primitive.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"identifier.change",
"io.output.change"
] | 892,757 | 892,756 | u741134767 | cpp |
p03077 | #include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define leng(n) (int)(log10(n) + 1)
#define INF 9000000000000000000
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } // 最大公約数gcd
int lcm(int a, int b) { return a / gcd(a, b) * b; } // 最小公倍数lcm
signed main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << 5 + n / (min({a, b, c, d, e})) << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define leng(n) (int)(log10(n) + 1)
#define INF 9000000000000000000
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } // 最大公約数gcd
int lcm(int a, int b) { return a / gcd(a, b) * b; } // 最小公倍数lcm
signed main() {
int 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,758 | 892,759 | u095453583 | cpp |
p03077 | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
ll INF = 9999999999999999;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll max(ll a, ll b) {
if (a > b)
return a;
else
return b;
}
ll min(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
int main(void) {
ll N;
cin >> N;
ll min_X = 100000000000000001;
for (int i = 0; i < 5; i++) {
ll X;
cin >> X;
min_X = min(min_X, X);
}
ll ans = 4;
ans += (N / min_X) + 1;
if (N % min_X == 0)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
ll INF = 9999999999999999;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll max(ll a, ll b) {
if (a > b)
return a;
else
return b;
}
ll min(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
int main(void) {
ll N;
cin >> N;
ll min_X = 100000000000000001;
for (int i = 0; i < 5; i++) {
ll X;
cin >> X;
min_X = min(min_X, X);
}
ll ans = 4;
ans += (N / min_X) + 1;
if (N % min_X == 0)
ans--;
cout << ans << endl;
}
| [] | 892,769 | 892,770 | u720721463 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
const long long INF = 1LL << 60;
const long long mod = 1e9 + 7;
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))));
int ans;
if (N % m != 0)
ans = N / m + 5;
else
ans = N / m + 4;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
const long long INF = 1LL << 60;
const long long mod = 1e9 + 7;
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))));
ll ans;
if (N % m != 0)
ans = N / m + 5;
else
ans = N / m + 4;
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 892,771 | 892,772 | u730594702 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define INF 999999999
typedef long long int Int;
using ll = long long;
using VI = vector<int>;
int gcd(Int a, Int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(Int a, Int b) { return a / gcd(a, b) * b; }
int main() {
Int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
Int ans = 0;
Int mi = min({a, b, c, d, e});
ans = (n + mi - 1) / mi;
ans += 5;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define INF 999999999
typedef long long int Int;
using ll = long long;
using VI = vector<int>;
int gcd(Int a, Int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(Int a, Int b) { return a / gcd(a, b) * b; }
int main() {
Int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
Int ans = 0;
Int mi = min({a, b, c, d, e});
ans = (n + mi - 1) / mi;
ans += 4;
cout << ans << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 892,777 | 892,778 | u902149880 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long P[5];
long long T[5];
for (int i = 0; i < 5; i++) {
cin >> P[i];
if (N % P[i] == 0) {
T[i] = N / P[i];
} else {
T[i] = (N / P[i]) + 1;
}
}
long long count = T[0];
for (int i = 1; i < 5; i++) {
if (P[i] >= P[i - 1]) {
T[i] = T[i - 1];
}
count += T[i] - T[i - 1] + 1;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long P[5];
long long T[5];
for (int i = 0; i < 5; i++) {
cin >> P[i];
if (N % P[i] == 0) {
T[i] = N / P[i];
} else {
T[i] = (N / P[i]) + 1;
}
}
long long count = T[0];
for (int i = 1; i < 5; i++) {
if (T[i] <= T[i - 1]) {
T[i] = T[i - 1];
}
count += T[i] - T[i - 1] + 1;
}
cout << count << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 892,779 | 892,780 | u879436400 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
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;
// 最小容量の交通機関に乗る時間
int onTime = ceil((double)n / min({a, b, c, d, e}));
// 最小容量の交通機関が使われていない時間
// i番目から出る交通機関が最小キャパとすると，
// i-1分に最速の人が使い始め，
// ゴール前から5-i分には最後の人が使い終わる
int outTime = 4;
int ans = onTime + outTime;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
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 onTime = ceil((double)n / min({a, b, c, d, e}));
// 最小容量の交通機関が使われていない時間
// i番目から出る交通機関が最小キャパとすると，
// i-1分に最速の人が使い始め，
// ゴール前から5-i分には最後の人が使い終わる
ll outTime = 4;
ll ans = onTime + outTime;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 892,781 | 892,782 | u654115954 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 0;
vector<ll> s(5);
rep(i, 5) { cin >> s.at(i); }
ans = (ll)n / s.at(0);
if ((ll)n % s.at(0) != 0) {
ans++;
}
ll min = s.at(0);
rep(k, 4) {
// cout<<ans<<endl;
if (min <= s.at(k + 1)) {
ans++;
} else {
min = s.at(k);
ans = (ll)n / s.at(k + 1);
ans += k + 1;
if ((ll)n % s.at(k + 1) != 0) {
ans++;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 0;
vector<ll> s(5);
rep(i, 5) { cin >> s.at(i); }
ans = (ll)n / s.at(0);
if ((ll)n % s.at(0) != 0) {
ans++;
}
ll min = s.at(0);
rep(k, 4) {
// cout<<ans<<endl;
if (min <= s.at(k + 1)) {
ans++;
} else {
min = s.at(k + 1);
ans = (ll)n / s.at(k + 1);
ans += k + 1;
if ((ll)n % s.at(k + 1) != 0) {
ans++;
}
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 892,786 | 892,787 | u120967809 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
ll res = min({a, b, c, d, e});
if (!N % res)
cout << N / res + 4 << endl;
else
cout << N / res + 5 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
ll res = min({a, b, c, d, e});
if (N % res == 0)
cout << N / res + 4 << endl;
else
cout << N / res + 5 << endl;
return 0;
}
| [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 892,790 | 892,791 | u455317716 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
ll n, a, b, c, d, e;
ll mn = 1e16;
int main() {
cin >> n >> a >> b >> c >> d >> e;
ll num;
mn = min(mn, min(a, min(b, min(c, min(d, e)))));
if (n % mn == 0)
num = (n / mn);
else
num = (n / mn) + 1;
cout << num + 5 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
ll n, a, b, c, d, e;
ll mn = 1e16;
int main() {
cin >> n >> a >> b >> c >> d >> e;
ll num;
mn = min(mn, min(a, min(b, min(c, min(d, e)))));
if (n % mn == 0)
num = (n / mn);
else
num = (n / mn) + 1;
cout << num + 4 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 892,792 | 892,793 | u342051078 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll x;
x = min(a, min(b, min(c, min(d, e))));
cout << (n + x - 1 / x) + 4;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll x;
x = min(a, min(b, min(c, min(d, e))));
cout << ((n + x - 1) / x) + 4;
return 0;
} | [] | 892,794 | 892,795 | u478997153 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define itn int
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto &i : (arr))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << '\n'
#define dump2(x, y) \
cerr << #x << " = " << (x) << " " << #y << " = " << (y) << '\n'
#define SZ(x) ((int)(x).size())
#define bit(n) (1LL << (n))
constexpr int MOD = 1e9 + 7;
template <typename T> using pq = priority_queue<T>;
template <typename T> using pqr = priority_queue<T, vector<T>, greater<T>>;
const int INF = LLONG_MAX / 2;
using P = pair<int, int>;
using vec = vector<int>;
template <typename T> using mat = vector<vector<T>>;
template <typename T1, typename T2>
ostream &operator<<(ostream &stream, const pair<T1, T2> &p) {
return stream << p.first << " " << p.second;
}
template <typename T> void print(const vector<T> vec) {
unsigned int len = vec.size();
rep(i, len - 1) cout << vec[i] << ' ';
cout << vec[len - 1] << '\n';
}
template <typename Arg> void print(const Arg arg) { cout << arg << '\n'; }
template <typename Head, typename... Args>
void print(const Head head, const Args... args) {
cout << head << " ";
print(args...);
}
template <typename T> T sum_(vector<T> vec, T init = 0) {
return std::accumulate(all(vec), T(init));
}
template <typename T> void init(vector<T> &v) { rep(i, v.size()) cin >> v[i]; }
template <typename T, typename U> void init(vector<T> &v, vector<U> &w) {
assert(v.size() == w.size());
rep(i, v.size()) cin >> v[i] >> w[i];
}
// clang-format off
template<typename T>
bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T>
int index(const T& vec, const typename T::iterator it) { return distance(vec.begin(), it); }
template <typename T = int>
mat<T> mmat(int n, int m) { return mat<T>(n, vector<T>(m)); }
template <typename T = int>
vector<T> ivec(int n) { vector<T> v(n); init(v); return v; }
// clang-format on
void yn(bool tf) { print(tf ? "Yes" : "No"); }
void YN(bool tf) { print(tf ? "YES" : "NO"); }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// -------------------------------------------------------------------
// sort 1 2 3 4
// pqr 1 2 3 must impl >
signed main() {
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vec v = ivec(5);
int idx = distance(v.begin(), min_element(all(v)));
int mid = (n + v[idx] - 1) / v[idx];
print(mid);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define itn int
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto &i : (arr))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << '\n'
#define dump2(x, y) \
cerr << #x << " = " << (x) << " " << #y << " = " << (y) << '\n'
#define SZ(x) ((int)(x).size())
#define bit(n) (1LL << (n))
constexpr int MOD = 1e9 + 7;
template <typename T> using pq = priority_queue<T>;
template <typename T> using pqr = priority_queue<T, vector<T>, greater<T>>;
const int INF = LLONG_MAX / 2;
using P = pair<int, int>;
using vec = vector<int>;
template <typename T> using mat = vector<vector<T>>;
template <typename T1, typename T2>
ostream &operator<<(ostream &stream, const pair<T1, T2> &p) {
return stream << p.first << " " << p.second;
}
template <typename T> void print(const vector<T> vec) {
unsigned int len = vec.size();
rep(i, len - 1) cout << vec[i] << ' ';
cout << vec[len - 1] << '\n';
}
template <typename Arg> void print(const Arg arg) { cout << arg << '\n'; }
template <typename Head, typename... Args>
void print(const Head head, const Args... args) {
cout << head << " ";
print(args...);
}
template <typename T> T sum_(vector<T> vec, T init = 0) {
return std::accumulate(all(vec), T(init));
}
template <typename T> void init(vector<T> &v) { rep(i, v.size()) cin >> v[i]; }
template <typename T, typename U> void init(vector<T> &v, vector<U> &w) {
assert(v.size() == w.size());
rep(i, v.size()) cin >> v[i] >> w[i];
}
// clang-format off
template<typename T>
bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T>
int index(const T& vec, const typename T::iterator it) { return distance(vec.begin(), it); }
template <typename T = int>
mat<T> mmat(int n, int m) { return mat<T>(n, vector<T>(m)); }
template <typename T = int>
vector<T> ivec(int n) { vector<T> v(n); init(v); return v; }
// clang-format on
void yn(bool tf) { print(tf ? "Yes" : "No"); }
void YN(bool tf) { print(tf ? "YES" : "NO"); }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// -------------------------------------------------------------------
// sort 1 2 3 4
// pqr 1 2 3 must impl >
signed main() {
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vec v = ivec(5);
int idx = distance(v.begin(), min_element(all(v)));
int mid = (n + v[idx] - 1) / v[idx];
print(mid + 4);
return 0;
}
| [
"expression.operation.binary.add"
] | 892,798 | 892,799 | u771524928 | 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 totalmin = min(A, min(B, min(C, min(D, E))));
int ans;
if (N % totalmin > 0)
ans = N / totalmin + 5;
else
ans = N / totalmin + 4;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long totalmin = min(A, min(B, min(C, min(D, E))));
long long ans;
if (N % totalmin > 0)
ans = N / totalmin + 5;
else
ans = N / totalmin + 4;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 892,802 | 892,803 | u132364782 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); i++)
typedef long long ll;
using namespace std;
struct Point {
int x, y;
};
struct Edge {
int to, cost;
};
struct Node {
int from, to, cost;
};
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};
int main(void) {
ll n, abcde[5];
cin >> n;
rep(i, 5) {
cin >> abcde[i];
if (i != 0) {
abcde[i] = min(abcde[i], abcde[i - 1]);
}
}
ll ans = 0;
rep(i, 5) {
ll need = n / abcde[i];
ans = max(ans, need + 5);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); i++)
typedef long long ll;
using namespace std;
struct Point {
int x, y;
};
struct Edge {
int to, cost;
};
struct Node {
int from, to, cost;
};
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};
int main(void) {
ll n, abcde[5];
cin >> n;
n--;
rep(i, 5) {
cin >> abcde[i];
if (i != 0) {
abcde[i] = min(abcde[i], abcde[i - 1]);
}
}
ll ans = 0;
rep(i, 5) {
ll need = n / abcde[i];
ans = max(ans, need + 5);
}
cout << ans << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 892,822 | 892,823 | u117734686 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
long long N;
long long fee[5];
cin >> N;
for (int cnt0 = 0; cnt0 < 5; cnt0++)
cin >> fee[cnt0];
long long minFee = 1e15;
for (int cnt0 = 0; cnt0 < 5; cnt0++)
minFee = min(minFee, fee[cnt0]);
long long addTime = 0;
if (N > minFee) {
if (N % (1 + minFee) == 0) {
addTime = N / minFee - 1;
} else {
addTime = N / minFee;
}
}
cout << 5 + addTime << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
long long N;
long long fee[5];
cin >> N;
for (int cnt0 = 0; cnt0 < 5; cnt0++)
cin >> fee[cnt0];
long long minFee = 1e15;
for (int cnt0 = 0; cnt0 < 5; cnt0++)
minFee = min(minFee, fee[cnt0]);
long long addTime = 0;
if (N > minFee) {
if (N % minFee == 0) {
addTime = N / minFee - 1;
} else {
addTime = N / minFee;
}
}
cout << 5 + addTime << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 892,826 | 892,827 | u998251394 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a;
cin >> a;
// vector<int> b(a,0);
int a1, a2, a3, a4, a5;
int b1, b2, b3, b4, b5;
cin >> a1 >> a2 >> a3 >> a4 >> a5;
b1 = $(a, a1), b2 = $(a, a2), b3 = $(a, a3), b4 = $(a, a4), b5 = $(a, a5);
cout << max(max(max(b1, b2), b3), max(b4, b5)) << endl;
}
// for(int ) | #include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a;
cin >> a;
// vector<int> b(a,0);
int a1, a2, a3, a4, a5;
int b1, b2, b3, b4, b5;
cin >> a1 >> a2 >> a3 >> a4 >> a5;
b1 = $(a, a1), b2 = $(a, a2), b3 = $(a, a3), b4 = $(a, a4), b5 = $(a, a5);
cout << max(max(max(b1, b2), b3), max(b4, b5)) + 4 << endl;
}
// for(int )
| [
"expression.operation.binary.add"
] | 892,838 | 892,839 | u322177979 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(0);
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << ceil(n / min(a, min(b, min(c, min(d, e))))) + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(0);
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << ceil((n - 1) / min(a, min(b, min(c, min(d, e))))) + 5 << endl;
} | [
"call.arguments.change"
] | 892,842 | 892,843 | u468647389 | cpp |
p03077 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << n / min(a, min(b, min(c, min(d, e)))) + 5 << endl;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << (n - 1) / min(a, min(b, min(c, min(d, e)))) + 5 << endl;
}
| [] | 892,858 | 892,859 | u185690073 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> t(5);
long long min_t = 1e15;
long long ans = 0;
long long n;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> t.at(i);
min_t = min(min_t, t.at(i));
}
ans = 5 + n / min_t;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> t(5);
long long min_t = 1e15;
long long ans = 0;
long long n;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> t.at(i);
min_t = min(min_t, t.at(i));
}
ans = 5 + (n - 1) / min_t;
cout << ans << endl;
} | [] | 892,860 | 892,861 | u756514276 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mi = min({a, b, c, d, e});
if (n % mi == 0)
cout << n / mi + 4;
else
cout << n / mi + 5;
}
| #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 mini = min({a, b, c, d, e});
if (n % mini == 0)
cout << n / mini + 4;
else
cout << n / mini + 5;
}
| [
"variable_declaration.type.change",
"variable_declaration.name.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 892,867 | 892,866 | u710135612 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll mi = min({a, b, c, d, e});
if (n % mi == 0)
cout << n / mi + 4;
else
cout << n / mi + 5;
}
| #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 mi = min({a, b, c, d, e});
if (n % mi == 0)
cout << n / mi + 4;
else
cout << n / mi + 5;
}
| [
"variable_declaration.type.change"
] | 892,867 | 892,868 | u710135612 | cpp |
p03077 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //__gnu_pbds::gp_hash_table<int, int> table;
// priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int,
// int>>> pq; //min heap
typedef int OwO;
typedef double UwU;
#define int long long
#define double long double
#define INF 1000000000
#define PI 3.14159265358979323846
#define watch(x) cout << (#x) << " is " << (x) << endl
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vvi vector<vector<int>>
#define vi vector<int>
using namespace std;
OwO main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
double N;
vector<double> c(6);
vector<double> t(5);
cin >> N >> t[0] >> t[1] >> t[2] >> t[3] >> t[4];
sort(t.begin(), t.end());
double p1 = min(t[0], N);
cout << fixed << (int)round(N / p1 + 4.0) << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //__gnu_pbds::gp_hash_table<int, int> table;
// priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int,
// int>>> pq; //min heap
typedef int OwO;
typedef double UwU;
#define int long long
#define double long double
#define INF 1000000000
#define PI 3.14159265358979323846
#define watch(x) cout << (#x) << " is " << (x) << endl
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vvi vector<vector<int>>
#define vi vector<int>
using namespace std;
OwO main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
double N;
vector<double> c(6);
vector<double> t(5);
cin >> N >> t[0] >> t[1] >> t[2] >> t[3] >> t[4];
sort(t.begin(), t.end());
double p1 = min(t[0], N);
cout << fixed << (int)ceil(N / p1 + 4.0) << endl;
return 0;
} | [
"identifier.change",
"call.function.near.change",
"io.output.change"
] | 892,869 | 892,870 | u769471034 | cpp |
p03077 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll inf = (ll)1e9;
const ll mod = (ll)1e9 + 7;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll m = min({a, b, c, d, e});
ll x = n / m;
cout << 5 + x << endl;
} | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll inf = (ll)1e9;
const ll mod = (ll)1e9 + 7;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll m = min({a, b, c, d, e});
ll x = (n - 1) / m;
cout << 5 + x << endl;
} | [] | 892,871 | 892,872 | u366125700 | cpp |
p03077 | /*
*
* Author : Amit Kumar
* Date : June 4 2019
*
*/
#include <bits/stdc++.h>
//#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#define msl map<string, long long>
#define umii unordered_map<int, int>
#define umll unordered_map<long long, long long>
#define umsi unordered_map<string, int>
#define umsl map<string, long long>
#define si set<int>
#define sl set<long long>
#define pii pair<int, int>
#define psi pair<string, int>
#define psl pair<string, long>
#define pll pair<long long, long long>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpsi vector<psi>
#define vpsl vector<psl>
#define pqi priority_queue<int>
#define pql priority_queue<long long>
#define ub upper_bound
#define lb lower_bound
#define bint long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define iv(v) \
for (auto &i : v) { \
cin >> i; \
}
#define ov(v) \
for (auto i : v) { \
cout << i << " "; \
} \
cout << endl;
#define ovn(v) \
for (auto i : v) { \
cout << i << endl; \
}
#define euv(v) \
for (auto i : v) { \
cerr << i << " "; \
} \
cerr << endl;
#define eovn(v) \
for (auto i : v) { \
cerr << i << endl; \
}
#define os(s) \
for (auto itr : s) { \
cout << itr << " "; \
} \
cout << endl;
#define osn(s) \
for (auto itr : s) { \
cout << itr << endl; \
}
#define eos(s) \
for (auto itr : s) { \
cerr << itr << " "; \
} \
cerr << endl;
#define eosn(s) \
for (auto itr : s) { \
cerr << itr << endl; \
}
#define rep(x) for (auto i = 0; i < (x); ++i)
#define _rep(a, b) for (auto i = (a); i < (b); ++i)
#define endl '\n'
using namespace std;
auto SOLUTION_FUNCTION(void) -> void {
// your solution goes here
bint n;
cin >> n;
vl v(5);
iv(v);
bint counter = 0;
rep(5) { counter = max(counter, n / v[i]); }
cout << counter + 5 << endl;
return;
}
int main(void) {
#ifdef FAST_INPUT_OUTPUT
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << setprecision(10);
cout << fixed;
cout << boolalpha;
#endif
#ifdef MY_LOCAL_PROJECT
freopen("cin", "r", stdin);
freopen("cout", "w", stdout);
#endif
int testcase = 1;
#ifdef MORE_THAN_ONE_TESTCASE
cin >> testcase;
#endif
while (testcase--) {
SOLUTION_FUNCTION();
}
#ifdef MY_LOCAL_PROJECT
cout << "Time : " << 1.0 * (double)clock() / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
| /*
*
* Author : Amit Kumar
* Date : June 4 2019
*
*/
#include <bits/stdc++.h>
//#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#define msl map<string, long long>
#define umii unordered_map<int, int>
#define umll unordered_map<long long, long long>
#define umsi unordered_map<string, int>
#define umsl map<string, long long>
#define si set<int>
#define sl set<long long>
#define pii pair<int, int>
#define psi pair<string, int>
#define psl pair<string, long>
#define pll pair<long long, long long>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpsi vector<psi>
#define vpsl vector<psl>
#define pqi priority_queue<int>
#define pql priority_queue<long long>
#define ub upper_bound
#define lb lower_bound
#define bint long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define iv(v) \
for (auto &i : v) { \
cin >> i; \
}
#define ov(v) \
for (auto i : v) { \
cout << i << " "; \
} \
cout << endl;
#define ovn(v) \
for (auto i : v) { \
cout << i << endl; \
}
#define euv(v) \
for (auto i : v) { \
cerr << i << " "; \
} \
cerr << endl;
#define eovn(v) \
for (auto i : v) { \
cerr << i << endl; \
}
#define os(s) \
for (auto itr : s) { \
cout << itr << " "; \
} \
cout << endl;
#define osn(s) \
for (auto itr : s) { \
cout << itr << endl; \
}
#define eos(s) \
for (auto itr : s) { \
cerr << itr << " "; \
} \
cerr << endl;
#define eosn(s) \
for (auto itr : s) { \
cerr << itr << endl; \
}
#define rep(x) for (auto i = 0; i < (x); ++i)
#define _rep(a, b) for (auto i = (a); i < (b); ++i)
#define endl '\n'
using namespace std;
auto SOLUTION_FUNCTION(void) -> void {
// your solution goes here
bint n;
cin >> n;
vl v(5);
iv(v);
bint counter = 0;
--n;
rep(5) { counter = max(counter, n / v[i]); }
cout << counter + 5 << endl;
return;
}
int main(void) {
#ifdef FAST_INPUT_OUTPUT
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << setprecision(10);
cout << fixed;
cout << boolalpha;
#endif
#ifdef MY_LOCAL_PROJECT
freopen("cin", "r", stdin);
freopen("cout", "w", stdout);
#endif
int testcase = 1;
#ifdef MORE_THAN_ONE_TESTCASE
cin >> testcase;
#endif
while (testcase--) {
SOLUTION_FUNCTION();
}
#ifdef MY_LOCAL_PROJECT
cout << "Time : " << 1.0 * (double)clock() / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 892,881 | 892,882 | u896543512 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 4);
// cout << min_trans << endl;
// cout <<(long dou-ble)(n/min_trans)<< endl;
res = ceil((double)(n / min_trans)) + 4;
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 5);
res = ceil((double)(n / min_trans)) + 4;
cout << res << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 892,883 | 892,884 | u914147249 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 4);
// cout << min_trans << endl;
// cout <<(long double)(n/min_trans)<< endl;
res = ceil((long double)(n / min_trans)) + 4;
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 5);
res = ceil((double)(n / min_trans)) + 4;
cout << res << endl;
return 0;
}
| [
"variable_declaration.type.narrow.change",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 892,885 | 892,884 | u914147249 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 4);
// cout << min_trans << endl;
// cout <<(long dou-ble)(n/min_trans)<< endl;
res = ceil((double)(n / min_trans)) + 4;
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 5);
// cout << min_trans << endl;
// cout <<(long dou-ble)(n/min_trans)<< endl;
res = ceil((double)(n / min_trans)) + 4;
cout << res;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 892,883 | 892,886 | u914147249 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 4);
// cout << min_trans << endl;
// cout <<(long double)(n/min_trans)<< endl;
res = ceil((long double)(n / min_trans)) + 4;
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 5);
// cout << min_trans << endl;
// cout <<(long dou-ble)(n/min_trans)<< endl;
res = ceil((double)(n / min_trans)) + 4;
cout << res;
return 0;
}
| [
"variable_declaration.type.narrow.change",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 892,885 | 892,886 | u914147249 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 4);
// cout << min_trans << endl;
// cout << n / min_trans << endl;
res = ceil(n / min_trans) + 4;
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double n, transfer[5], min_trans;
ll res;
int main() {
cin >> n;
for (int i = 0; i <= 4; i++)
cin >> transfer[i];
min_trans = *min_element(transfer, transfer + 5);
// cout << min_trans << endl;
// cout <<(long dou-ble)(n/min_trans)<< endl;
res = ceil((double)(n / min_trans)) + 4;
cout << res;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 892,887 | 892,886 | u914147249 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll nums[5];
int main() {
ll N;
ll m[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> m[i];
ll minflow = *min_element(m, m + 5);
ll res = ceil((double)(N / minflow)) + 5;
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll nums[5];
int main() {
double N;
double m[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> m[i];
double minflow = *min_element(m, m + 5);
ll res = ceil((double)(N / minflow)) + 4;
cout << res << endl;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 892,888 | 892,889 | u624923345 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[5];
long long trmin = 1e15;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] < trmin) {
trmin = a[i];
}
}
cout << (5 + n / trmin);
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[5];
long long trmin = 1e15;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] < trmin) {
trmin = a[i];
}
}
cout << (5 + (n - 1) / trmin);
return 0;
} | [] | 892,892 | 892,893 | u947304300 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a;
cin >> n;
long long mini = 10e15;
for (int i = 1; i <= 5; ++i) {
cin >> a;
mini = min(mini, a);
}
cout << n / mini + 5 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a;
cin >> n;
long long mini = 10e15;
for (int i = 0; i < 5; ++i) {
cin >> a;
mini = min(mini, a);
}
cout << (n - 1) / mini + 5 << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 892,900 | 892,901 | u848359007 | cpp |
p03077 | // besmellah
#include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long k, a[5];
cin >> k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cout << k / *(min_element(a, a + 5)) + 5;
} | // besmellah
#include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long k, a[5];
cin >> k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cout << (k - 1) / *(min_element(a, a + 5)) + 5;
} | [] | 892,902 | 892,903 | u170407818 | 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 a;
a = min(A, min(B, min(C, min(D, E))));
long long int ans = N / a + 5;
cout << ans << endl;
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 a;
a = min(A, min(B, min(C, min(D, E))));
long long int ans = (N - 1) / a + 5;
cout << ans << endl;
return 0;
} | [] | 892,904 | 892,905 | u661125964 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
a = min(a, b);
cin >> b;
a = min(a, b);
cin >> b;
a = min(a, b);
cin >> b;
a = min(a, b);
cin >> b;
a = min(a, b);
b = n / a;
if (n % a != 0ll)
b++;
cout << b + 5ll << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
a = min(a, b);
cin >> b;
a = min(a, b);
cin >> b;
a = min(a, b);
cin >> b;
a = min(a, b);
cin >> b;
a = min(a, b);
b = n / a;
if (n % a != 0ll)
b++;
cout << b + 4ll << endl;
} | [
"literal.number.change",
"io.output.change"
] | 892,910 | 892,911 | u952865396 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using lint = int64_t;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define in \
[] { \
lint n; \
cin >> n; \
return n; \
}()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lint N = in;
vector<lint> A(5);
rep(i, 5) A[i] = in;
sort(all(A));
cout << (5 + N / A[0]) << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
using lint = int64_t;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define in \
[] { \
lint n; \
cin >> n; \
return n; \
}()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lint N = in;
vector<lint> A(5);
rep(i, 5) A[i] = in;
sort(all(A));
cout << 5 + (N - 1) / A[0] << "\n";
}
| [] | 892,912 | 892,913 | u151724181 | 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;
int m;
m = min(a, min(b, min(c, min(d, e))));
int ans;
ans = (n + m - 1) / m + 4;
cout << ans << endl;
return 0;
} | #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 m;
m = min(a, min(b, min(c, min(d, e))));
long long ans;
ans = (n + m - 1) / m + 4;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 892,914 | 892,915 | u800100718 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long a, b, c, d, e;
cin >> n;
cin >> a >> b >> c >> d >> e;
long long cost = min(a, min(b, min(c, min(d, e))));
long long result = n / cost + 5;
cout << result << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long a, b, c, d, e;
cin >> n;
cin >> a >> b >> c >> d >> e;
long long cost = min(a, min(b, min(c, min(d, e))));
long long result = (n - 1) / cost + 5;
cout << result << endl;
} | [] | 892,916 | 892,917 | u627434558 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("file.1", "r", stdin);
ll n;
vector<ll> a(5);
cin >> n;
int i;
for (i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
ll c;
c = (n + a[0]) / a[0];
cout << c + 4 << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("file.1", "r", stdin);
ll n;
vector<ll> a(5);
cin >> n;
int i;
for (i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
ll c;
c = (n + a[0] - 1) / a[0];
cout << c + 4 << endl;
return 0;
}
| [
"assignment.change"
] | 892,953 | 892,954 | u147305315 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.