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 8
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 += ... | #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 += ... | [
"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;
... | #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;
... | [
"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 <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>... | [] | 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... | #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... | [
"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.en... | #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.en... | [
"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>
#incl... | #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>
#incl... | [
"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()
#defin... | #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()
#defin... | [
"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>;
... | #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>;
... | [
"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 (in... | #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 (in... | [
"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, in... | #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, in... | [
"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) fo... | #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) fo... | [] | 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, i... | #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, i... | [
"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 ... | #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 ... | [
"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... | #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... | [
"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... | #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... | [
"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;
... | #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;
... | [] | 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<p... | #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<p... | [
"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... | #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... | [
"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.e... | #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.e... | [
"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).... | #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).... | [
"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)... | #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)... | [] | 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 + mi... | #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)... | [
"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 chmi... | #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 chmi... | [] | 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) noexcep... | #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) noexcep... | [
"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;
a... | #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... | [
"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()
//入力は空白で切... | // 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()
//入力は空白で切... | [
"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()
//入力は空白で切... | // 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()
//入力は空白で切... | [
"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(... | #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(... | [
"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... | #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... | [] | 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; }
tem... | #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; }
tem... | [] | 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) ... | #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) ... | [
"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];
}
... | #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];
}
... | [
"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;
... | #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;
... | [
"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 vect... | #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 vect... | [
"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();
ty... | #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();
ty... | [
"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... | #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... | [] | 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... | #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... | [
"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)
... | #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)
... | [
"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;
... | [
"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)) ... | #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)) ... | [] | 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... | #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... | [
"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>>... | #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>>... | [] | 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];
... | #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];
... | [] | 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];
... | #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];
... | [
"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--)
#def... | #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--)
#def... | [
"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;
e... | #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 += ... | [
"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... | #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... | [
"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 << le... | #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 << le... | [
"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;
in... | #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;
in... | [] | 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... | #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... | [] | 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... | #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 ... | [
"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) ... | #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) ... | [
"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... | #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... | [
"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 >>... | #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 >>... | [
"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);... | #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);... | [
"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 ? ... | #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 ? ... | [
"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) { ... | #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) { ... | [] | 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)... | #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)... | [
"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
#defi... | #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
#defi... | [
"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;
... | #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;
... | [
"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... | #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... | [
"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 1000000... | #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 1000000... | [
"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 <... | #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 <... | [] | 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>
#def... | /*
*
* 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>
#def... | [
"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)<<... | #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;
retur... | [
"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_tran... | #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;
retur... | [
"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)<<... | #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)<<... | [
"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_tran... | #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)<<... | [
"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... | #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)<<... | [
"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] < trm... | #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] < trm... | [] | 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 \
[] { \
... | #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 \
[] { \
... | [] | 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 >>... | #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 >>... | [
"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.