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;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, MIN = INF;
cin >> n;
for (int i = 0; i < 5; i++) {
ll z;
cin >> z;
MIN = min(MIN, z);
}
cout << n / MIN + 5;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, MIN = INF;
cin >> n;
for (int i = 0; i < 5; i++) {
ll z;
cin >> z;
MIN = min(MIN, z);
}
cout << (n - 1) / MIN + 5;
}
| [] | 892,044 | 892,043 | u166378830 | cpp |
p03077 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long double n, a;
long double min = 10e15;
cin >> n;
for (int i = 0; i < 5; ++i) {
cin >> a;
if (a <= min)
min = a;
}
cout << ceil(n / min) + 4 << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long double n, a;
long double min = 10e15;
cin >> n;
for (int i = 0; i < 5; ++i) {
cin >> a;
if (a <= min)
min = a;
}
cout << (long long)ceil(n / min) + 4 << endl;
return 0;
}
| [
"type_conversion.add"
] | 892,049 | 892,050 | u510372936 | cpp |
p03077 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 892,053 | 892,054 | u264265458 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; ... | [
"identifier.change",
"io.output.change"
] | 892,055 | 892,056 | u264265458 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; ... | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 892,057 | 892,056 | u264265458 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
unsigned long long N;
cin >> N;
unsigned long long tmp;
unsigned long long minimum_transition = 1000000000000001;
for (int ii = 0; ii < 5; ++ii) {
cin >> tmp;
if (minimum_transition > tmp) {
minimum_transition = tmp;
}
}
unsigned ... | #include <iostream>
using namespace std;
int main() {
unsigned long long N;
cin >> N;
unsigned long long tmp;
unsigned long long minimum_transition = 1000000000000001;
for (int ii = 0; ii < 5; ++ii) {
cin >> tmp;
if (minimum_transition > tmp) {
minimum_transition = tmp;
}
}
unsigned ... | [] | 892,058 | 892,059 | u680331221 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> a(5);
long long int n, m;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
m = min(a[0], a[1]);
for (int i = 2; i < 4; i++)
m = min(m, a[i]);
long long int ans = ceil((double)n / m);
ans += 4;
cout << ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> a(5);
long long int n, m;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
m = min(a[0], a[1]);
for (int i = 2; i < 5; i++)
m = min(m, a[i]);
long long int ans = ceil((double)n / m);
ans += 4;
cout << ans... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 892,062 | 892,063 | u655844242 | cpp |
p03077 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
ll n;
vector<ll> vec;
cin >> n;
for (int i = 0; i < 5; i++) {
ll a;
cin >> a;
vec.push_back(a);
... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
ll n;
vector<ll> vec;
cin >> n;
for (int i = 0; i < 5; i++) {
ll a;
cin >> a;
vec.push_back(a);
... | [] | 892,073 | 892,074 | u519756887 | cpp |
p03077 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | [
"literal.number.change",
"variable_declaration.value.change",
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 892,075 | 892,076 | u324303263 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long m = min(min(min(a, b), c), min(d, e));
cout << 5 + n / m << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long m = min(min(min(a, b), c), min(d, e));
cout << 5 + (n - 1) / m << endl;
return 0;
} | [] | 892,077 | 892,078 | u110383054 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
long long n, a[5];
int main() {
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
long long b = (n / a[0]);
if (((n / a[0]) == 0) && (b != 0))
b -= 1;
cout << (5 + b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, a[5];
int main() {
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
long long b = (n / a[0]);
if (((n % a[0]) == 0) && (b != 0))
b--;
cout << (5 + b) << endl;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 892,079 | 892,080 | u477516105 | cpp |
p03077 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
unsigned long N;
long double A[5];
cin >> N >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
for (int i = 1; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[i] > A[j]) {
unsigned long tmp = A[i];
A[i] = A[j];
... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
unsigned long N;
long double A[5];
cin >> N >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[i] > A[j]) {
unsigned long tmp = A[i];
A[i] = A[j];
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 892,081 | 892,082 | u204523044 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,088 | 892,089 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,090 | 892,089 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | [
"variable_declaration.type.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,091 | 892,089 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,093 | 892,089 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,091 | 892,094 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,093 | 892,094 | u061071198 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(5);
rep(i, 5) cin >> a[i];
ll res = 1e16;
rep(i, 5) res = min(res, a[i]);
ll ans1 = n / res;
if (n =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(5);
rep(i, 5) cin >> a[i];
ll res = 1e16;
rep(i, 5) res = min(res, a[i]);
ll ans1 = (n - 1) / res;
i... | [] | 892,102 | 892,103 | u274883254 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.rbegin()) x = c.rbegin(); x != c.rend(); x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.rbegin()) x = c.rbegin(); x != c.rend(); x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#d... | [] | 892,104 | 892,105 | u682686221 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 892,106 | 892,107 | u926242698 | cpp |
p03077 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
const int INF = 1 << 28;
const long long MOD = 1000000007;
using namespace std;
using Graph = vector<vector<int>>;
template <class T> bool ch... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
const int INF = 1 << 28;
const long long MOD = 1000000007;
using namespace std;
using Graph = vector<vector<int>>;
template <class T> bool chm... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 892,108 | 892,109 | u586583774 | cpp |
p03077 | typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n--;
ll min1 = 1000000000000000;
rep(i, 5) {
ll a;
cin >> a;
min1 = min(min1, a);
}
cout << n / min1 + 5 << endl;
} | typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
cin >> n;
n--;
ll min1 = 1000000000000000;
rep(i, 5) {
ll a;
cin >> a;
min1 = min(min1, a);
}
cout << n / min1 + 5 << endl;
} | [
"variable_declaration.type.change"
] | 892,116 | 892,117 | u438592861 | cpp |
p03077 | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s),... | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s),... | [
"expression.operation.binary.change",
"call.arguments.add"
] | 892,118 | 892,119 | u209647862 | cpp |
p03077 | #include <bits/stdc++.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
ll N;
ll A[5];
cin >> N;
ll mini = 0;
ll m = 1000000000000001;
rep(i, 5) {
cin >> A[i];
if (m > A[i]) {
mini = i;
m = A[i];
}
}
... | #include <bits/stdc++.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
ll N;
ll A[5];
cin >> N;
ll mini = 0;
ll m = 1000000000000001;
rep(i, 5) {
cin >> A[i];
if (m > A[i]) {
mini = i;
m = A[i];
}
}
... | [
"literal.number.change",
"io.output.change"
] | 892,122 | 892,123 | u651802048 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll n, t[5];
cin >> n;
rep(i, 5) cin >> t[i];
// ll t_num[6] = {n, 0, 0, 0, 0, 0};
//
// ll count = 0;
// while(t_num[5] != n){
// ll current_num = 0;
// ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll n, t[5];
cin >> n;
rep(i, 5) cin >> t[i];
// ll t_num[6] = {n, 0, 0, 0, 0, 0};
//
// ll count = 0;
// while(t_num[5] != n){
// ll current_num = 0;
// ... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 892,124 | 892,125 | u326152409 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a... | [] | 892,128 | 892,129 | u984529214 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll X[5] = {};
ll mini = 1000000000000000;
for (int i = 0; i < 5; i++) {
cin >> X[i];
mini = min(mini, X[i]);
}
cout << (N + mini - 1) / mini + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll X[5] = {};
ll mini = 1000000000000000;
for (int i = 0; i < 5; i++) {
cin >> X[i];
mini = min(mini, X[i]);
}
cout << (N + mini - 1) / mini + 4 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 892,132 | 892,133 | u584520839 | cpp |
p03077 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
const ll MOD = 1000000007LL;
int main() {
ll n, a, b, c, d, e;
... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
const ll MOD = 1000000007LL;
int main() {
ll n, a, b, c, d, e;
... | [] | 892,134 | 892,135 | u614128939 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 5 + (n + 1) / mn << endl;
}
int main() ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 5 + (n - 1) / mn << endl;
}
int main() ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 892,136 | 892,137 | u973991908 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 4 + (n + 1) / mn << endl;
}
int main() ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 5 + (n - 1) / mn << endl;
}
int main() ... | [
"literal.number.change",
"io.output.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 892,138 | 892,137 | u973991908 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 4 + ceil(n / mn) << endl;
}
int main() ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
ll n;
cin >> n;
ll mn = (ll)1e16;
REP(i, 5) {
ll x;
cin >> x;
mn = min(mn, x);
}
cout << 5 + (n - 1) / mn << endl;
}
int main() ... | [
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 892,139 | 892,137 | u973991908 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll limit = min(a, min(b, min(c, min(d, e))));
ll times = ceil(n / limit);
cout << times + (ll)4 <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
double limit = min(a, min(b, min(c, min(d, e))));
ll times = ceil(double(n / limit));
cout << time... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 892,143 | 892,144 | u615662061 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long bottle = min(min(min(min(A, B), C), D), E);
// cout<<N<<" "<<bottle<<endl;
cout << setprecision(18) << ceil(N / bottle) + 4 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
double bottle = min(min(min(min(A, B), C), D), E);
// cout<<N<<" "<<bottle<<endl;
cout << setprecision(18) << ceil(N / bottle) + 4 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 892,145 | 892,146 | u469315559 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int X = min({A, B, C, D, E});
cout << (X + N - 1) / N + 4 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int X = min({A, B, C, D, E});
cout << (X + N - 1) / X + 4 << endl;
}
| [
"identifier.change",
"io.output.change"
] | 892,149 | 892,150 | u817769480 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | [
"variable_declaration.type.widen.change"
] | 892,154 | 892,155 | u852862907 | cpp |
p03077 | #include <bits/stdc++.h>
#include <map> // pair
using namespace std;
typedef long long ll;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i... | #include <bits/stdc++.h>
#include <map> // pair
using namespace std;
typedef long long ll;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i... | [
"assignment.change"
] | 892,156 | 892,157 | u906250335 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int ans = 0;
ans = N / min({A, B, C, D, E}) + 5;
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int ans = 0;
ans = (N - 1) / min({A, B, C, D, E}) + 5;
cout << ans;
return 0;
}
| [] | 892,160 | 892,161 | u231455327 | cpp |
p03077 | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
ll N, a[5];
cin >> N;
rep(i, 0, 5) cin >> a[i];
sort(a, a + 5);
if (N <= a[0])
cout << 5 << endl;
else
cout <<... | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
ll N, a[5];
cin >> N;
rep(i, 0, 5) cin >> a[i];
sort(a, a + 5);
if (N <= a[0])
cout << 5 << endl;
else
cout <<... | [
"type_conversion.add"
] | 892,164 | 892,165 | u293156359 | cpp |
p03077 | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
ll N, a[5];
cin >> N;
rep(i, 0, 5) cin >> a[i];
sort(a, a + 5);
if (N <= a[0])
cout << 5 << endl;
else
cout <<... | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
ll N, a[5];
cin >> N;
rep(i, 0, 5) cin >> a[i];
sort(a, a + 5);
if (N <= a[0])
cout << 5 << endl;
else
cout <<... | [
"type_conversion.add"
] | 892,166 | 892,165 | u293156359 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_I... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_I... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 892,179 | 892,180 | u170513117 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<i... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 892,185 | 892,186 | u720321944 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N / minv == 0)
cout << ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N % minv == 0)
cout << ... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 892,187 | 892,188 | u644568158 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N / minv == 0)
cout << ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N % minv == 0)
cout << ... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 892,189 | 892,188 | u644568158 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N / minv)
cout << N / m... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a[5], N;
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
long long minv = 10000000000000000LL;
for (int i = 0; i < 5; i++)
minv = min(minv, a[i]);
if (N % minv == 0)
cout << ... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 892,190 | 892,188 | u644568158 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
usin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
usin... | [
"variable_declaration.type.change"
] | 892,191 | 892,192 | u649915042 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
usin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
usin... | [
"variable_declaration.type.change"
] | 892,194 | 892,192 | u649915042 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | [
"expression.operation.binary.remove"
] | 892,202 | 892,203 | u809665051 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
vector<int> a(5);
rep(i, 5) cin >> a[i];
ll minmove = *std::min_element(a.begin(), a.end());
ll ans = ((n + minmove - 1) / minmove) + 4;
cout... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
ll minmove = *std::min_element(a.begin(), a.end());
ll ans = ((n + minmove - 1) / minmove) ... | [] | 892,213 | 892,211 | u447096097 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> H(5);
for (long long i = 0; i < 5; i++)
cin >> H[i];
sort(H.begin(), H.end());
cout << 4 + (N + 1) / H[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> H(5);
for (long long i = 0; i < 5; i++)
cin >> H[i];
sort(H.begin(), H.end());
cout << 5 + (N - 1) / H[0] << endl;
}
| [
"literal.number.change",
"io.output.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 892,214 | 892,215 | u406634703 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> H(5);
for (long long i = 0; i < 5; i++)
cin >> H[i];
sort(H.begin(), H.end());
cout << 5 + N / H[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> H(5);
for (long long i = 0; i < 5; i++)
cin >> H[i];
sort(H.begin(), H.end());
cout << 5 + (N - 1) / H[0] << endl;
}
| [] | 892,216 | 892,215 | u406634703 | cpp |
p03077 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | [] | 892,217 | 892,218 | u776056110 | cpp |
p03077 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | [
"literal.number.change",
"io.output.change"
] | 892,219 | 892,218 | u776056110 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 1e6;
static const int NIL = -1;
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg2.first;
}
int main(void) {
ll N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 1e6;
static const int NIL = -1;
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg2.first;
}
int main(void) {
ll N... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 892,227 | 892,228 | u616090453 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll m = min(a, min(b, min(c, min(d, e))));
cout << (n / m) + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll m = min(a, min(b, min(c, min(d, e))));
cout << ((n - 1) / m) + 5 << endl;
} | [] | 892,232 | 892,233 | u013069672 | cpp |
p03077 |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include ... |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 892,236 | 892,237 | u917972976 | cpp |
p03077 |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include ... |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"literal.number.type.widen.change"
] | 892,238 | 892,237 | u917972976 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long int n;
cin >> n;
vector<long long int> a(5);
rep(i, 5) cin >> a[i];
for (int i = 1; i < 5; i++) {
a[i] = min(a[i - 1], a[i]);
}
cout << (long long int)ceil(n / a[4]) + 5LL << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long int n;
cin >> n;
vector<long long int> a(5);
rep(i, 5) cin >> a[i];
for (int i = 1; i < 5; i++) {
a[i] = min(a[i - 1], a[i]);
}
cout << (long long int)ceil(1.0 * n / a[4]) + 4LL << en... | [
"literal.number.change",
"io.output.change"
] | 892,239 | 892,240 | u696865277 | cpp |
p03077 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | [
"call.arguments.change"
] | 892,243 | 892,244 | u438265890 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define dbg(x) #x "=" << x << " "
#define fore(i, a, b) for (int i = a, gon = b; i < gon; ++i)
#define pb push_back
#define F first
#define S second
typedef double lf;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#... | #include <bits/stdc++.h>
using namespace std;
#define dbg(x) #x "=" << x << " "
#define fore(i, a, b) for (int i = a, gon = b; i < gon; ++i)
#define pb push_back
#define F first
#define S second
typedef double lf;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#... | [] | 892,256 | 892,257 | u994510536 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#defi... | [
"variable_declaration.type.change"
] | 892,258 | 892,259 | u489108157 | cpp |
p03077 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | [
"misc.opposites",
"expression.operator.compare.change",
"expression.operation.binary.change",
"literal.number.change",
"io.output.change"
] | 892,260 | 892,261 | u938389536 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
int32_t main() {
int n, m = 1e16, tmp;
cin >> n;
for (int i = 1; i <= 5; i++) {
cin >> tmp;
m = min(m, tmp);
}
cout << n / m + 5;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
int32_t main() {
int n, m = 1e16, tmp;
cin >> n;
for (int i = 1; i <= 5; i++) {
cin >> tmp;
m = min(m, tmp);
}
cout << (n - 1) / m + ... | [] | 892,264 | 892,265 | u472645805 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
ll tmp = 1000000000000005;
rep(i, 5) {
cin >> a[i];
tmp = min(a[i], tmp);
}
cout << 5 + n / tmp << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
ll tmp = 1000000000000005;
rep(i, 5) {
cin >> a[i];
tmp = min(a[i], tmp);
}
cout << 5 + (n - 1) / tmp << endl;
} | [] | 892,273 | 892,274 | u924451152 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long N;
std::vector<long long> v(5);
std::cin >> N;
for (size_t i = 0; i < 5; i++) {
std::cin >> v[i];
}
sort(v.begin(), v.end());
if (N % v[0] == 0)
std::cout << N / v[0] + 5 << '\n';
else
std::cou... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long N;
std::vector<long long> v(5);
std::cin >> N;
for (size_t i = 0; i < 5; i++) {
std::cin >> v[i];
}
sort(v.begin(), v.end());
if (N % v[0] != 0)
std::cout << N / v[0] + 5 << '\n';
else
std::cou... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 892,281 | 892,282 | u053035261 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define __ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define forn(i, a, n) for (int i = a; i < n; i++)
#define fi first
#define se se... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define __ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define forn(i, a, n) for (int i = a; i < n; i++)
#define fi first
#define se se... | [
"expression.operation.binary.remove"
] | 892,283 | 892,284 | u801950866 | cpp |
p03077 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
long long int ans = -1;
for (int i = 0; i < 5; i++) {
if (ans == -1 || ans > a[i])
ans = a[i];
}
cout << (n + ans - 1) / ans * 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
long long int ans = -1;
for (int i = 0; i < 5; i++) {
if (ans == -1 || ans > a[i])
ans = a[i];
}
cout << (n + ans - 1) / ans + 4 << endl;
}
| [] | 892,287 | 892,288 | u595832794 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int ans = 0;
int x;
x = min(min(a, b), c);
x = ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll ans = 0;
ll x;
x = min(min(a, b), c);
x = min... | [
"variable_declaration.type.change"
] | 892,289 | 892,290 | u389766217 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long int lli;
int main() {
lli n;
cin >> n;
lli arr[5];
// reading into array
for (int i = 0; i < 5; i++)
cin >> arr[i];
// getting the minimum most element
lli mini = *min_element(arr, arr + 5);
(n % mini == 0) ? cout << n /... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long int lli;
int main() {
lli n;
cin >> n;
lli arr[5];
// reading into array
for (int i = 0; i < 5; i++)
cin >> arr[i];
// getting the minimum most element
lli mini = *min_element(arr, arr + 5);
(n % mini == 0) ? cout << n /... | [
"literal.number.change",
"expression.operation.binary.change"
] | 892,296 | 892,297 | u551519692 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
vector<int> pos, baad;
int main() {
long long n;
cin >> n;
long long arr[5];
for (long long i = 0; i < 5; i++)
cin >> arr[i];
sort(arr, arr + 5);
cout << ((n - arr[0] + 1) / arr[0]) + 5 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
vector<int> pos, baad;
int main() {
long long n;
cin >> n;
long long arr[5];
for (int i = 0; i < 5; i++)
cin >> arr[i];
sort(arr, arr + 5);
cout << ((n + arr[0] - 1) / arr[0]) + 4 << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 892,300 | 892,301 | u337550605 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
vector<int> pos, baad;
int main() {
long long n;
cin >> n;
long long arr[5];
for (int i = 0; i < 5; i++)
cin >> arr[i];
sort(arr, arr + 5);
cout << ((n - arr[0] + 1) / arr[0]) + 5 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
vector<int> pos, baad;
int main() {
long long n;
cin >> n;
long long arr[5];
for (int i = 0; i < 5; i++)
cin >> arr[i];
sort(arr, arr + 5);
cout << ((n + arr[0] - 1) / arr[0]) + 4 << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 892,302 | 892,301 | u337550605 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 892,305 | 892,306 | u401900157 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | [
"expression.unary.arithmetic.add"
] | 892,311 | 892,312 | u965730380 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
cin.tie(0);
ios::sync_wit... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
cin.tie(0);
ios::sync_wit... | [] | 892,313 | 892,314 | u340980616 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [
"assignment.change"
] | 892,315 | 892,316 | u222866518 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
using namespace std;
using ll = long long;
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
int main() {
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
sort(a, a + 5);
cout << 4 + (n + a[0]) / a[0] << ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
using namespace std;
using ll = long long;
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
int main() {
ll n;
cin >> n;
ll a[5];
rep(i, 5) cin >> a[i];
sort(a, a + 5);
cout << 4 + (n + a[0] - 1) / a[0]... | [
"expression.operation.binary.add"
] | 892,322 | 892,323 | u936602931 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int long key = min(A, B);
key = min(key, C);
key = min(key, D);
key = min(key, E);
int long p = (N - 1) / key + 1;
cout << p + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int long key = min(A, B);
key = min(key, C);
key = min(key, D);
key = min(key, E);
int long p = (N - 1) / key + 1;
cout << p + 4 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 892,324 | 892,325 | u936602931 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, a[5];
cin >> n;
rep(i, 5) cin >> a[i];
ll ans = n / *min_element(a, a + 5) + 5;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, a[5];
cin >> n;
n--;
rep(i, 5) cin >> a[i];
ll ans = n / *min_element(a, a + 5) + 5;
cout << ans << endl;
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 892,326 | 892,327 | u907525511 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
#define repe(i, f, n) for (int i = (f); (i) <= (n); i++)
using namespace std;
typedef long long ll;
ll INF = 1LL << 60;
ll MAX = 100010;
int main() {
ll n;
cin >> n;
ll min = INF;
rep(i, 0, 5) {
ll tmp;
cin >> tmp;
if ... | #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
#define repe(i, f, n) for (int i = (f); (i) <= (n); i++)
using namespace std;
typedef long long ll;
ll INF = 1LL << 60;
ll MAX = 100010;
int main() {
ll n;
cin >> n;
ll min = INF;
rep(i, 0, 5) {
ll tmp;
cin >> tmp;
if ... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 892,332 | 892,333 | u873269440 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main()... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main()... | [] | 892,344 | 892,345 | u480172743 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
ll damepo = min({a, b, c, d, e});
cout << (n + damepo - 1) / damepo + 4 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll damepo = min({a, b, c, d, e});
cout << (n + damepo - 1) / damepo + 4 << endl;
} | [
"expression.operation.binary.add"
] | 892,352 | 892,353 | u650236619 | cpp |
p03077 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vin = vector<int>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vin = vector<int>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
int main() {... | [
"variable_declaration.type.change"
] | 892,362 | 892,363 | u531461815 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
ll x = 100000000000000000;
rep(i, 4) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
ll x = 100000000000000000;
rep(i, 5) {... | [
"literal.number.change",
"call.arguments.change"
] | 892,364 | 892,365 | u459930111 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
ll x = 10000000000000000;
rep(i, 4) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
ll x = 100000000000000000;
rep(i, 5) {... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 892,366 | 892,365 | u459930111 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 5 + n / a[0];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 5 + (n - 1) / a[0];
cout << ans << endl;
return 0;
} | [] | 892,367 | 892,368 | u354281482 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
vector<int> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 5 + n / a[0];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 5 + (n - 1) / a[0];
cout << ans << endl;
return 0;
} | [] | 892,369 | 892,368 | u354281482 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | [
"call.arguments.change"
] | 892,375 | 892,376 | u088608223 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; ... | [
"expression.operation.binary.remove"
] | 892,377 | 892,378 | u254015449 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int... | [
"literal.number.change",
"io.output.change"
] | 892,379 | 892,380 | u504800764 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int... | [
"literal.number.change",
"io.output.change"
] | 892,381 | 892,380 | u504800764 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int... | [
"expression.operation.binary.add"
] | 892,382 | 892,380 | u504800764 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecis... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecis... | [] | 892,385 | 892,386 | u666490638 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vector<ll>> dist;
const int dx[4] = {0, -1,... | // ボトルネックのところにすべてが依存するのはわかったが 立式できなかった
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vec... | [
"call.add",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change",
"call.arguments.change"
] | 892,389 | 892,390 | u652037179 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> abc(5);
for (ll i = 0; i < abc.size(); i++) {
cin >> abc[i];
}
sort(abc.begin(), abc.end());
ll ans = 0;
if (abc[0] >= n) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> abc(5);
for (ll i = 0; i < abc.size(); i++) {
cin >> abc[i];
}
sort(abc.begin(), abc.end());
ll ans = 0;
if (abc[0] >= n) {
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 892,391 | 892,392 | u476027087 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> abc(5);
for (int i = 0; i < abc.size(); i++) {
cin >> abc[i];
}
sort(abc.begin(), abc.end());
ll ans = 0;
if (abc[0] >= n) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> abc(5);
for (ll i = 0; i < abc.size(); i++) {
cin >> abc[i];
}
sort(abc.begin(), abc.end());
ll ans = 0;
if (abc[0] >= n) {
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 892,393 | 892,392 | u476027087 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
ll dx[] = {1, 0};
ll dy[] = {0, 1};
int main() {
ll N;
vector<ll> a(5);
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
ll dx[] = {1, 0};
ll dy[] = {0, 1};
int main() {
ll N;
vector<ll> a(5);
cin >> N >> a[0] >> a[1] >> a[2] >> a[3] >> ... | [
"literal.number.type.widen.change"
] | 892,394 | 892,395 | u378155378 | cpp |
p03077 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i... | [] | 892,396 | 892,397 | u870074807 | cpp |
p03077 | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)... | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 892,405 | 892,406 | u519761526 | cpp |
p03077 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [
"type_conversion.add"
] | 892,409 | 892,410 | u337845373 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int q = (n - 1) / a;
int r = (n - 1) / b;
int s = (n - 1) / c;
int t = (n - 1) / d;
int u = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll q = (n - 1) / a;
ll r = (n - 1) / b;
ll s = (n - 1) / c;
ll t = (n - 1) / d;
ll u = (n - ... | [
"variable_declaration.type.change"
] | 892,415 | 892,416 | u816145694 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.