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 <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long a;
cin >> a;
for (int i = 1; i < 5; i++) {
long long temp;
cin >> temp;
if (temp < a)
a = temp;
}
if (n < a)
cout << 5;
else {
long long time = n / a + 4;
if (n & a == 0)
cout <... | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long a;
cin >> a;
for (int i = 1; i < 5; i++) {
long long temp;
cin >> temp;
if (temp < a)
a = temp;
}
if (n <= a)
cout << 5;
else {
long long time = n / a + 4;
if (n % a == 0)
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 893,472 | 893,471 | u606107557 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long a;
cin >> a;
for (int i = 1; i < 5; i++) {
long long temp;
cin >> temp;
if (temp < a)
a = temp;
}
if (n < a)
cout << 5;
else {
long long time = n / a + 4;
if (n & a == 0)
cout <... | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long a;
cin >> a;
for (int i = 1; i < 5; i++) {
long long temp;
cin >> temp;
if (temp < a)
a = temp;
}
if (n <= a)
cout << 5;
else {
long long time = n / a + 4;
if (n % a == 0)
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 893,473 | 893,471 | u606107557 | cpp |
p03077 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> t(5);
for (int i = 0; i < 5; ++i) {
cin >> t[i];
}
long long t_min = 0;
t_min = *min_element(t.begin(), t.end());
long long ans = 0;
if (N <= t_min) {
ans = 5;
} else {
... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> t(5);
for (int i = 0; i < 5; ++i) {
cin >> t[i];
}
long long t_min = 0;
t_min = *min_element(t.begin(), t.end());
long long ans = 0;
if (N <= t_min) {
ans = 5;
} else {
... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 893,476 | 893,477 | u701556979 | cpp |
p03077 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> t(5);
for (int i = 0; i < 5; ++i) {
cin >> t[i];
}
long long t_min = 0;
t_min = *min_element(t.begin(), t.end());
long long ans = 0;
if (N <= t_min) {
ans = 5;
} else {
... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> t(5);
for (int i = 0; i < 5; ++i) {
cin >> t[i];
}
long long t_min = 0;
t_min = *min_element(t.begin(), t.end());
long long ans = 0;
if (N <= t_min) {
ans = 5;
} else {
... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 893,479 | 893,477 | u701556979 | cpp |
p03077 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
unsigned long long N, min, tmp;
std::cin >> N >> min;
for (int i = 0; i < 4; i++) {
std::cin >> tmp;
if (tmp < min)
min = tmp;
}
if (N <= min) {
std::cout << 5 << std::endl;
return 0;
}
unsigned long lon... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
unsigned long long N, min, tmp;
std::cin >> N >> min;
for (int i = 0; i < 4; i++) {
std::cin >> tmp;
if (tmp < min)
min = tmp;
}
if (N <= min) {
std::cout << 5 << std::endl;
return 0;
}
unsigned long lon... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 893,480 | 893,481 | u481487723 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long int li;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long int li;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 893,493 | 893,492 | u795009336 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long long int n;
long long int a[5];
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a, a + 5);
if (n % a[0] == 10)
cout << 4 + n / a[0] << endl;
else
cout << 5 + n / a[0] << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long long int n;
long long int a[5];
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a, a + 5);
if (n % a[0] == 0)
cout << 4 + n / a[0] << endl;
else
cout << 5 + n / a[0] << endl;
return 0;
}... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 893,494 | 893,495 | u098700286 | cpp |
p03077 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < static_cast<long long>(n); i++)
#define repi(i, a, b) \
for (long long i = static_cast<long long>(a); i < static_cast<long long>(b); ... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < static_cast<long long>(n); i++)
#define repi(i, a, b) \
for (long long i = static_cast<long long>(a); i < static_cast<long long>(b); ... | [
"call.arguments.change",
"misc.opposites",
"identifier.change",
"expression.operation.binary.change",
"literal.number.change"
] | 893,502 | 893,503 | u897282055 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll min_value = 10000000000000000;
for (int i = 0; i < 5; i++) {
ll value;
cin >> value;
if (min_value > value) {
min_value = value;
}
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll min_value = 10000000000000000;
for (int i = 0; i < 5; i++) {
ll value;
cin >> value;
if (min_value > value) {
min_value = value;
}
}
... | [] | 893,506 | 893,507 | u389009751 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll min_value = 1000000000000001;
for (int i = 0; i < 5; i++) {
ll value;
cin >> value;
if (min_value > value) {
min_value = value;
}
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll min_value = 10000000000000000;
for (int i = 0; i < 5; i++) {
ll value;
cin >> value;
if (min_value > value) {
min_value = value;
}
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 893,508 | 893,507 | u389009751 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<long long int> A(5);
long long int N;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
if (A[0] % N == 0) {
co... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<long long int> A(5);
long long int N;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
if (N % A[0] == 0) {
co... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 893,521 | 893,522 | u684056175 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
#define INF 100000000
using namespace std;
int main(void) {
long N;
long trans1[5], trans2[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans1[i];
if (N % trans1[i] != 0) {
trans2[i] = N / trans1[i] + 1;
} els... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
#define INF 100000000
using namespace std;
int main(void) {
long N;
long trans1[5], trans2[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans1[i];
if (N % trans1[i] != 0) {
trans2[i] = N / trans1[i] + 1;
} els... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 893,523 | 893,524 | u238235808 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n, x;
cin >> n;
long long mini = 1e16;
for (int i = 0; i < 5; i++) {
cin >> x;
mini = min(mini, x);
}
long long ans = (n + mini) / mini +... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n, x;
cin >> n;
long long mini = 1e16;
for (int i = 0; i < 5; i++) {
cin >> x;
mini = min(mini, x);
}
long long ans = (n + mini - 1) / mi... | [
"assignment.change"
] | 893,536 | 893,537 | u590241855 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
ll min(ll a, ll b) {
if (a < b)
return a;
else... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
ll min(ll a, ll b) {
if (a < b)
return a;
else... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 893,542 | 893,543 | u608499300 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
ll min(ll a, ll b) {
if (a < b)
return a;
else... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
ll min(ll a, ll b) {
if (a < b)
return a;
else... | [] | 893,544 | 893,543 | u608499300 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, ans, tmp;
cin >> n;
vector<long long int> peo;
for (int i = 0; i < 5; i++) {
cin >> tmp;
peo.push_back(tmp);
}
sort(peo.begin(), peo.end());
long long int x = peo[0];
ans = n / x;
cout << ans + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, ans, tmp;
cin >> n;
vector<long long int> peo;
for (int i = 0; i < 5; i++) {
cin >> tmp;
peo.push_back(tmp);
}
sort(peo.begin(), peo.end());
long long int x = peo[0];
ans = (n - 1) / x;
cout << ans + 5 << endl;
} | [] | 893,547 | 893,548 | u148968106 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
int main() {
ull N, array[5];
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> array[i];
}
sort(array, array + 5);
cout << N / array[0] + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
int main() {
ull N, array[5];
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> array[i];
}
sort(array, array + 5);
cout << (N - 1) / array[0] + 5 << endl;
} | [] | 893,551 | 893,552 | u593081125 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long int N, A[5];
cin >> N >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
long long int step = 0;
long long int Ncity[6] = {0};
long long int mincap = 10000000000000000;
int mincapindex = 0;
for (int i = 0; i < 5; i++) {
if (A[i] < mincap)
min... | #include <iostream>
using namespace std;
int main() {
long long int N, A[5];
cin >> N >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
long long int step = 0;
long long int Ncity[6] = {0};
long long int mincap = 10000000000000000;
int mincapindex = 0;
for (int i = 0; i < 5; i++) {
if (A[i] < mincap)
min... | [
"literal.number.change",
"assignment.value.change"
] | 893,559 | 893,560 | u412038365 | cpp |
p03077 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long min_ = min(A, min(B, min(C, min(D, E))));
long ans;
if (min_ > N)
ans = 5;
else {
double tmp = ((double)N / min_);
ans = (long)round(tmp) - 1 + 5;
}
cout <<... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long min_ = min(A, min(B, min(C, min(D, E))));
long ans;
if (min_ > N)
ans = 5;
else {
double tmp = ((double)N / min_) + 0.9;
ans = (long)(tmp)-1 + 5;
}
cout << ... | [
"assignment.change"
] | 893,583 | 893,584 | u262733088 | cpp |
p03077 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
long long int n, a, b, c, d, e, mi;
long long int dure = 5;
cin >> n >> a >> b >> c >> d >> e;
mi = min(a, b);
mi = min(c, mi);
mi = min(d, mi);
mi = min(e, mi);
dure += n / mi;
cout << dure << endl;
} | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
long long int n, a, b, c, d, e, mi;
long long int dure = 5;
cin >> n >> a >> b >> c >> d >> e;
mi = min(a, b);
mi = min(c, mi);
mi = min(d, mi);
mi = min(e, mi);
dure += (n - 1) / mi;
cout << dure << endl;
} | [] | 893,589 | 893,590 | u672995180 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
int N;
int city[5];
int min = 0;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> city[i];
if (i == 0 || min > city[i]) {
min = city[i];
}
}
int ans;
if (N % min == 0) {
ans = N / min + 4;
} else {
ans = N / min + 5;
}
... | #include <iostream>
using namespace std;
int main() {
long int N;
long int city[5];
long int min = 0;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> city[i];
if (i == 0 || min > city[i]) {
min = city[i];
}
}
long int ans;
if (N % min == 0) {
ans = N / min + 4;
} else {
ans... | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 893,591 | 893,592 | u366677622 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
int N;
int T[5];
cin >> N >> T[0] >> T[1] >> T[2] >> T[3] >> T[4];
int i;
int min = T[0];
for (i = 1; i <= 4; i++)
if (min > T[i])
min = T[i];
int t;
if (N % min == 0)
t = N / min;
else
t = N / min + 1;
cout << t + 4 << endl;
}... | #include <iostream>
using namespace std;
int main() {
long int N;
long int T[5];
cin >> N >> T[0] >> T[1] >> T[2] >> T[3] >> T[4];
int i;
long int min = T[0];
for (i = 1; i <= 4; i++)
if (min > T[i])
min = T[i];
long int t;
if (N % min == 0)
t = N / min;
else
t = N / min + 1;
cout... | [
"variable_declaration.type.widen.change"
] | 893,593 | 893,594 | u362444129 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int ans, a, b, c, d, e, n;
ans = 0;
cin >> n >> a >> b >> c >> d >> e;
ans = (n + min({a, b, c, d, e})) / min({a, b, c, d, e}) + 4;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int ans, a, b, c, d, e, n;
ans = 0;
cin >> n >> a >> b >> c >> d >> e;
ans = (n + min({a, b, c, d, e}) - 1) / min({a, b, c, d, e}) + 4;
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 893,595 | 893,596 | u173648629 | cpp |
p03077 | // Shift-JIS（シフトジス）
#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 c[] = {A, B, C, D, E};
long long x;
x = A;
long long ans;
for (int i = 0; i < 5; i++) {
x = min(x, c[i]);
}
if (N % x == 0) {
ans = N / x + ... | // Shift-JIS（シフトジス）
#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 c[] = {A, B, C, D, E};
long long x;
x = A;
long long ans;
for (int i = 0; i < 5; i++) {
x = min(x, c[i]);
}
if (N % x == 0) {
ans = N / x + ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 893,597 | 893,598 | u380317210 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define clr(a, x) memset(a, x, sizeof(a))
#define SZ(x) ((int)(x).size())
#define lson rt << 1
#define rson rt << 1 | 1
#define pb push_back
#define fi first
#define se secon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define clr(a, x) memset(a, x, sizeof(a))
#define SZ(x) ((int)(x).size())
#define lson rt << 1
#define rson rt << 1 | 1
#define pb push_back
#define fi first
#define se secon... | [
"variable_declaration.type.change"
] | 893,599 | 893,600 | u749563575 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int n, a, b, c, d, e;
int minutes = 4;
int main() {
std::cin >> n >> a >> b >> c >> d >> e;
int x = std::min({a, b, c, d, e});
minutes += std::ceil(((double)n) / x);
std::cout << minutes << std::endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
long n, a, b, c, d, e;
long long minutes = 4;
int main() {
std::cin >> n >> a >> b >> c >> d >> e;
long long x = std::min({a, b, c, d, e});
minutes += std::ceil(((double)n) / x);
std::cout << minutes << std::endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,603 | 893,602 | u537538698 | cpp |
p03077 | #include <array>
#include <iostream>
int main() {
std::array<unsigned long long, 5> Five;
unsigned long long N;
std::cin >> N;
for (auto &f : Five)
std::cin >> f;
unsigned long long bn = Five[0];
for (int i = 1; i < 5; i++) {
if (Five[i] < bn)
bn = Five[i];
}
int ans = (N + bn - 1) / bn +... | #include <array>
#include <iostream>
int main() {
std::array<unsigned long long, 5> Five;
unsigned long long N;
std::cin >> N;
for (auto &f : Five)
std::cin >> f;
unsigned long long bn = Five[0];
for (int i = 1; i < 5; i++) {
if (Five[i] < bn)
bn = Five[i];
}
unsigned long long ans = (N +... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"expression.operation.binary.change"
] | 893,610 | 893,611 | u896932701 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long s[5];
for (int i = 0; i < 5; i++) {
cin >> s[i];
}
long long mini = s[0];
for (int i = 0; i < 5; i++) {
mini = min(s[i], mini);
}
int ans = 5;
if ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long s[5];
for (int i = 0; i < 5; i++) {
cin >> s[i];
}
long long mini = s[0];
for (int i = 0; i < 5; i++) {
mini = min(s[i], mini);
}
long long ans = 5;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,624 | 893,625 | u791220701 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
//最悪のケースからかかる時間を予測する
long long N; // 32bit seisu
std::cin >> N;
std::vector<long long> trafic_cap(5);
for (int i = 0; i < 5... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
//最悪のケースからかかる時間を予測する
long long N; // 32bit seisu
std::cin >> N;
std::vector<long long> trafic_cap(5);
for (int i = 0; i < 5... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 893,626 | 893,627 | u395248672 | 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 m = min(min(min(min(a, b), c), d), e);
long long ans = (n - m + 1) / m + 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 m = min(min(min(min(a, b), c), d), e);
long long ans = (n + m - 1) / m + 4;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 893,634 | 893,635 | u655975843 | 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 m = min(min(min(min(a, b), c), d), e);
long long ans = (n - m + 1) / m + 5;
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 m = min(min(min(min(a, b), c), d), e);
long long ans = (n + m - 1) / m + 4;
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"expression.operation.binary.change"
] | 893,636 | 893,635 | u655975843 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"identifier.change",
"function.return_type.change"
] | 893,637 | 893,638 | u144432905 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int k = min({a, b, c, d, e});
cout << (n / k) + ((n % k) != 0) + 4 << 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 k = min({a, b, c, d, e});
cout << (n / k) + (n % k != 0) + 4 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,646 | 893,647 | u704064492 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int k = min({a, b, c, d, e});
cout << (n / k) + (n % k != 0) + 4 << 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 k = min({a, b, c, d, e});
cout << (n / k) + (n % k != 0) + 4 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,648 | 893,647 | u704064492 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int k = min({a, b, c, d, e});
cout << (n / k) + ((n % k) != 0 ? 1 : 0) + 4 << 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 k = min({a, b, c, d, e});
cout << (n / k) + ((n % k) != 0 ? 1 : 0) + 4 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,649 | 893,650 | u704064492 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
long n, a, b, c, d, e;
scanf("%ld\n%ld\n%ld\n%ld\n%ld\n%ld", &n, &a, &b, &c, &d, &e);
long slow = min({a, b, c, d, e});
printf("%ld\n", 5 + n / slow);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
long n, a, b, c, d, e;
scanf("%ld\n%ld\n%ld\n%ld\n%ld\n%ld", &n, &a, &b, &c, &d, &e);
long slow = min({a, b, c, d, e});
printf("%ld\n", 5 + (n - 1) / slow);
return 0;
} | [
"call.arguments.change"
] | 893,653 | 893,654 | u956758464 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n, a, b, c, d, e;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
ll minN = min({a, b, c, d, e});
cout << 5 + n / minN << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n, a, b, c, d, e;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
ll minN = min({a, b, c, d, e});
cout << 5 + (n - 1) / minN << endl; //((n-minN)+minN-1)/minN
} | [] | 893,655 | 893,656 | u874723578 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n, a, b, c, d, e;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
ll minN = min({a, b, c, d, e});
cout << 5 + n / minN << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n, a, b, c, d, e;
scanf("%lld%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d, &e);
ll minN = min({a, b, c, d, e});
cout << 5 + (n - 1) / minN << endl;
} | [] | 893,655 | 893,657 | u874723578 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int Min = min(A, min(B, min(C, min(D, E))));
long long int kiriage = 0;
if (N % Min == 0) {
kiriage = N / Min;
} else {
kiriage = N / Min + 1;
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int Min = min(A, min(B, min(C, min(D, E))));
long long int kiriage = 0;
if (N % Min == 0) {
kiriage = N / Min;
} else {
kiriage = (N / Min) + 1;
}... | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 893,658 | 893,659 | u421308322 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int Min = min(A, min(B, min(C, min(D, E))));
long long int kiriage = 0;
if (N % Min == 0) {
kiriage = N / Min;
} else {
kiriage = N / Min + 1;
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int Min = min(A, min(B, min(C, min(D, E))));
long long int kiriage = 0;
if (N % Min == 0) {
kiriage = N / Min;
} else {
kiriage = (N / Min) + 1;
}... | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove",
"literal.number.change"
] | 893,660 | 893,659 | u421308322 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << (n + min({a, b, c, d, e})) / min({a, b, c, d, e}) + 4 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << (n - 1 + min({a, b, c, d, e})) / min({a, b, c, d, e}) + 4 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 893,661 | 893,662 | u568419568 | 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++)
#define repe(i, n) for (auto &&i : n)
#define all(v) (v).begin(), (v).end()
#define decimal fixed << setprecision(20)
#define fastcin() \... | #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++)
#define repe(i, n) for (auto &&i : n)
#define all(v) (v).begin(), (v).end()
#define decimal fixed << setprecision(20)
#define fastcin() \... | [] | 893,666 | 893,667 | u996252264 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, c, d, e, ans = 0;
cin >> n >> a >> b >> c >> d >> e;
long long mn = min(a, min(b, min(c, min(d, e))));
ans = ((n + mn) / mn) + 4;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, c, d, e, ans = 0;
cin >> n >> a >> b >> c >> d >> e;
long long mn = min(a, min(b, min(c, min(d, e))));
ans = ((n + mn - 1) / mn) + 4;
cout << ans;
} | [
"assignment.change"
] | 893,672 | 893,673 | u168820186 | cpp |
p03077 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int 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
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
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
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,684 | 893,685 | u959815036 | cpp |
p03077 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int 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
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
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
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 893,686 | 893,685 | u959815036 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n;
long long a[5];
long long m = 99999999;
cin >> n;
long long sum = 0;
long long tmp = 0;
for (int i = 0; i < 5; ++i) {
cin >> a[i];
}
for (int i = 0; i < 5; ++i) {
if (a[i] < m) {
m = a[i];
tmp ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n;
long long a[5];
long long m = 9223372036854775807;
cin >> n;
long long sum = 0;
long long tmp = 0;
for (int i = 0; i < 5; ++i) {
cin >> a[i];
}
for (int i = 0; i < 5; ++i) {
if (a[i] < m) {
m = a[i];... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 893,689 | 893,688 | u527806673 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> a(5);
cin >> n;
int min;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
min = *min_element(a.begin(), a.end());
cout << 4 + (n + min - 1) / min << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
vector<long long> a(5);
cin >> n;
long long min;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
min = *min_element(a.begin(), a.end());
cout << 4 + (n + min - 1) / min << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,692 | 893,691 | u843574076 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | [
"assignment.change"
] | 893,693 | 893,694 | u124992729 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | [
"expression.operator.change"
] | 893,695 | 893,696 | u124992729 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> X(5);
for (int i = 0; i < 5; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
long long ans = ceil((float)N / X[0]) + 4;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> X(5);
for (int i = 0; i < 5; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
long long ans = ceil((long double)N / X[0]) + 4;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,700 | 893,701 | u471030817 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> X(5);
for (int i = 0; i < 5; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
long long ans = ceil(N / X[0]) + 5;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> X(5);
for (int i = 0; i < 5; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
long long ans = ceil((long double)N / X[0]) + 4;
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 893,702 | 893,701 | u471030817 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
ll n, a, b, c, d, e;
cin >> n >> a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
ll n, a, b, c, d, e;
cin >> n >> a ... | [] | 893,703 | 893,704 | u214304095 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long min = A;
if (min > B)
min = B;
if (min > C)
min = C;
if (min > D)
min = D;
if ... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long min = A;
if (min > B)
min = B;
if (min > C)
min = C;
if (min > D)
min = D;
if ... | [] | 893,716 | 893,717 | u544361885 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int move(int move_num, int original_num) {
if (move_num > original_num)
move_num = original_num;
return move_num;
}
int main(void) {
long long a[5];
long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int move(int move_num, int original_num) {
if (move_num > original_num)
move_num = original_num;
return move_num;
}
int main(void) {
long long a[5];
long... | [
"literal.number.change",
"io.output.change"
] | 893,722 | 893,723 | u867671099 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> capacity(5);
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
}
sort(capacity.begin(), capacity.end());
if (n % capacity[0] == 0) {
n -= capacity[0];
}
cout << n / capacity[0] + 4;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> capacity(5);
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
}
sort(capacity.begin(), capacity.end());
if (n % capacity[0] == 0) {
n -= capacity[0];
}
cout << (n / capacity[0]) + 5;
}
| [
"literal.number.change",
"io.output.change"
] | 893,727 | 893,728 | u544165468 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> A(5);
for (auto &a : A)
cin >> a;
int64_t mi = *min_element(A.begin(), A.end());
cout << ((n + mi) / mi) + 4;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> A(5);
for (auto &a : A)
cin >> a;
int64_t mi = *min_element(A.begin(), A.end());
cout << ((n + mi - 1) / mi) + 4;
}
| [
"expression.operation.binary.add"
] | 893,729 | 893,730 | u268793453 | cpp |
p03077 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
using namespace std;
int main() {
long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int m;
m = min(min(min(min(A, B), C), D), E);
int t = (N + m - 1) / m; //一番遅い人がBまでいく時間
cout << t + 4 << endl;
} | #include <algorithm>
#include <cassert>
#include <functional>
#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;
m = min(min(min(min(A, B), C), D), E);
// m=min({A, B, C, D, E});
long long t = (N + m - 1) / m; //一番遅い人がBまでいく時... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 893,746 | 893,747 | u824310141 | cpp |
p03077 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int m;
m = min(min(min(min(A, B), C), D), E);
int t = (N + m - 1) / m; //一番遅い人がBまでいく時間
cout << t + 4 << endl;
} | #include <algorithm>
#include <cassert>
#include <functional>
#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;
m = min(min(min(min(A, B), C), D), E);
// m=min({A, B, C, D, E});
long long t = (N + m - 1) / m; //一番遅い人がBまでいく時... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,748 | 893,747 | u824310141 | cpp |
p03077 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
using namespace std;
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int m;
// m= min( min( min( min(A, B), C), D), E);
m = min({A, B, C, D, E});
int t = (N + m - 1) / m; //一番遅い人がBまでいく時間
cou... | #include <algorithm>
#include <cassert>
#include <functional>
#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;
// m= min( min( min( min(A, B), C), D), E);
m = min({A, B, C, D, E});
long long t = (N + m - 1) / m; //一番遅い人がBま... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,749 | 893,750 | u824310141 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long MinTime = min({A, B, C, D, E});
int ans = (N + MinTime - 1) / MinTime + 4;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long MinTime = min({A, B, C, D, E});
long long ans = (N + MinTime - 1) / MinTime + 4;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,756 | 893,757 | u652286295 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long MinTime = min({A, B, C, D, E});
int ans = (N + MinTime - 1) / MinTime + 4;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long MinTime = min({A, B, C, D, E});
long long ans = (N + MinTime - 1) / MinTime + 4;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,756 | 893,758 | u652286295 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
long long mn = 1e15 + 1;
cin >> n;
for (int i = 0; i < 5; i++) {
long long tmp;
cin >> tmp;
mn = min(mn, tmp);
}
long long ans = n / mn + 5;
if (n % mn == 0) {
ans++;
}
cout <<... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
long long mn = 1e16 + 1;
cin >> n;
for (int i = 0; i < 5; i++) {
long long tmp;
cin >> tmp;
mn = min(mn, tmp);
}
long long ans = n / mn + 4;
if (n % mn != 0) {
ans++;
}
cout <<... | [
"literal.number.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 893,764 | 893,765 | u696583119 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, A, B, C, D, E;
long long m;
long long tmp;
cin >> N >> A >> B >> C >> D >> E;
m = min(A, min(B, min(C, min(D, E))));
tmp = N / m == 0 ? N / m : N / m + 1;
cout << tmp + 4 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, A, B, C, D, E;
long long m;
long long tmp;
cin >> N >> A >> B >> C >> D >> E;
m = min(A, min(B, min(C, min(D, E))));
tmp = N % m == 0 ? N / m : N / m + 1;
cout << tmp + 4 << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 893,770 | 893,771 | u945273850 | 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 m = min({a, b, c, d, e});
cout << 4 + n / m + (n % m == 0) << 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 m = min({a, b, c, d, e});
cout << 4 + n / m + (n % m != 0) << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"io.output.change"
] | 893,773 | 893,774 | u706790759 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll a[5], n, mn = 200;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (int i = 0; i < 5; i++) {
mn = min(mn, a[i]);
}
cout << ((n - 1) / mn + 1) + 4 << endl;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll a[5], n, mn = 1e18;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (int i = 0; i < 5; i++) {
mn = min(mn, a[i]);
}
cout << ((n - 1) / mn + 1) + 4 << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 893,775 | 893,776 | u921168761 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long int n;
cin >> n;
long int min = LONG_MAX;
for (int i = 0; i < 5; i++) {
long int a;
cin >> a;
if (a < min)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long int n;
cin >> n;
long int min = LONG_MAX;
for (int i = 0; i < 5; i++) {
long int a;
cin >> a;
if (a < min)... | [
"literal.number.change",
"expression.operation.binary.change"
] | 893,800 | 893,801 | u254766083 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll N;
ll A, B, C, D, E;
cin >> N;
cin >> A >> B >> C >> D >> E;
ll MinMove = min({A, B, C, D, E});
ll ans = (N + MinMove - 1) / MinMove;
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll N;
ll A, B, C, D, E;
cin >> N;
cin >> A >> B >> C >> D >> E;
ll MinMove = min({A, B, C, D, E});
ll ans = (N + MinMove - 1) / MinMove;
cout << ans + 4 << endl;
}
| [
"expression.operation.binary.add"
] | 893,813 | 893,814 | u847913816 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = pow(10, 18) + 1;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
templa... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = pow(10, 18) + 1;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
templa... | [
"call.arguments.change"
] | 893,819 | 893,820 | u155088988 | cpp |
p03077 | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using... | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using... | [
"literal.number.type.widen.change"
] | 893,821 | 893,822 | u262288723 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define per(i, a, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define per(i, a, n) for (int i = ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 893,825 | 893,826 | u148555958 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define per(i, a, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define per(i, a, n) for (int i = ... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 893,827 | 893,826 | u148555958 | cpp |
p03077 | // Bartek Kostka
// You are not prepared!
#include "bits/stdc++.h"
using namespace std;
#define x first
#define y second
#define SZ(x) int(x.size())
#define ll long long
#define pii pair<int, int>
#define vi vector<int>
#define ALL(x) x.begin(), x.end()
#ifdef LOCAL
template <class TH> void _dbg(const char *sdbg, ... | // Bartek Kostka
// You are not prepared!
#include "bits/stdc++.h"
using namespace std;
#define x first
#define y second
#define SZ(x) int(x.size())
#define ll long long
#define pii pair<int, int>
#define vi vector<int>
#define ALL(x) x.begin(), x.end()
#ifdef LOCAL
template <class TH> void _dbg(const char *sdbg, ... | [
"expression.operation.binary.add"
] | 893,830 | 893,831 | u805485630 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int num_min = min(A, min(B, min(C, min(D, E))));
long long int time2pass;
if (N % num_min == 0) {
time2pass = N / num... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int num_min = min(A, min(B, min(C, min(D, E))));
long long int time2pass;
if (N % num_min == 0) {
time2pass = N / num... | [] | 893,832 | 893,833 | u860597287 | cpp |
p03077 | #include <iostream>
using namespace std;
typedef long long ll;
ll N, A[5], ans, mini = 1000000000000000;
int main() {
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> A[i];
mini = min(mini, A[i]);
}
ans = N / mini;
cout << ans + 5 << endl;
}
| #include <iostream>
using namespace std;
typedef long long ll;
ll N, A[5], ans, mini = 1000000000000000;
int main() {
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> A[i];
mini = min(mini, A[i]);
}
ans = (N - 1) / mini;
cout << ans + 5 << endl;
} | [] | 893,834 | 893,835 | u016531517 | cpp |
p03077 | #include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ull N;
int main() {
cin >> N;
ll minrate = 1.1e15;
int minidx = 0;
vector<ll> v;
for (int i = 0; i < 5; i++) {
ll a;
cin >> a;
v.push_back(a);
... | #include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ull N;
int main() {
cin >> N;
ll minrate = 1.1e15;
int minidx = 0;
vector<ull> v;
for (int i = 0; i < 5; i++) {
ull a;
cin >> a;
v.push_back(a);... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 893,840 | 893,841 | u286493216 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll min = A;
if (B < min)
min = B;
if (C < min)
min = C;
if (D < min)
min = D;
if (E < min)
min = E;
cout << N / min + 5;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll min = A;
if (B < min)
min = B;
if (C < min)
min = C;
if (D < min)
min = D;
if (E < min)
min = E;
cout << (N - 1) / min + 5;
} | [] | 893,842 | 893,843 | u671687924 | cpp |
p03077 | #include <algorithm>
#include <iostream>
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);
cout << N / A[0] + 5;
return 0;
} | #include <algorithm>
#include <iostream>
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);
cout << (N - 1) / A[0] + 5;
return 0;
} | [] | 893,848 | 893,849 | u740232619 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long trips[5];
scanf("%lld", &n);
if (n == 0) {
printf("0");
return 0;
}
scanf("%lld", &trips[0]);
for (int i = 1; i < 5; i++) {
scanf("%d", &trips[i]);
trips[i] = min(trips[i], trips[i - 1]);
}
printf("%lld"... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long trips[5];
scanf("%lld", &n);
if (n == 0) {
printf("0");
return 0;
}
scanf("%lld", &trips[0]);
for (int i = 1; i < 5; i++) {
scanf("%lld", &trips[i]);
trips[i] = min(trips[i], trips[i - 1]);
// printf("%l... | [
"literal.string.change",
"call.arguments.change"
] | 893,850 | 893,851 | u887755635 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N;
cin >> N;
vector<ll> Q(5);
for (int i = 0; i < 5; i++) {
cin >> Q[i];
}
sort(Q.begin(), Q.end());
cout << N / Q[0] + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N;
cin >> N;
vector<ll> Q(5);
for (int i = 0; i < 5; i++) {
cin >> Q[i];
}
sort(Q.begin(), Q.end());
cout << (N - 1) / Q[0] + 5 << endl;
} | [] | 893,854 | 893,855 | u045811375 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N;
cin >> N;
vector<int> Q(5);
for (int i = 0; i < 5; i++) {
cin >> Q[i];
}
sort(Q.begin(), Q.end());
cout << N / Q[0] + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N;
cin >> N;
vector<ll> Q(5);
for (int i = 0; i < 5; i++) {
cin >> Q[i];
}
sort(Q.begin(), Q.end());
cout << (N - 1) / Q[0] + 5 << endl;
} | [] | 893,856 | 893,855 | u045811375 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | [
"call.arguments.change"
] | 893,857 | 893,858 | u107995903 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, a, b, c, d, e, ans = 0;
cin >> n >> a >> b >> c >> d >> e;
long long mi = min(a, min(b, min(c, min(d, e))));
cout << (n - mi + 1) / mi + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, a, b, c, d, e, ans = 0;
cin >> n >> a >> b >> c >> d >> e;
long long mi = min(a, min(b, min(c, min(d, e))));
cout << (n + mi - 1) / mi + 4 << endl;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 893,861 | 893,862 | u314988220 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, t, Min = -1;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> t;
if (Min == -1)
Min = t;
Min = min(Min, t);
}
cout << n / Min + 5;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, t, Min = -1;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> t;
if (Min == -1)
Min = t;
Min = min(Min, t);
}
cout << (n - 1) / Min + 5;
return 0;
}
| [] | 893,884 | 893,885 | u047554023 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int MIN = min({a, b, c, d, e});
cout << 5 + (n - 1) / MIN;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int MIN = min({a, b, c, d, e});
cout << 5 + (n - 1) / MIN;
}
| [] | 893,886 | 893,887 | u016612263 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | [
"call.arguments.change"
] | 893,888 | 893,889 | u656771711 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(5);
for (auto &e : a) {
cin >> e;
}
ll b = a.front();
for (auto e : a) {
b = min(b, e);
}
cout << 5 + n / b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(5);
for (auto &e : a) {
cin >> e;
}
ll b = a.front();
for (auto e : a) {
b = min(b, e);
}
cout << 5 + (n - 1) / b << endl;
}
| [] | 893,896 | 893,897 | u848737670 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
signed main() {
int a[5], n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
cout << 5 + n / a[0];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
signed main() {
int a[5], n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
cout << 5 + (n - 1) / a[0];
return 0;
} | [] | 893,902 | 893,903 | u651317892 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long a[5], n;
cin >> n;
long m;
cin >> a[0];
m = a[0];
for (int i = 1; i < 5; i++) {
cin >> a[i];
m = min(m, a[i]);
}
int c ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long a[5], n;
cin >> n;
long m;
cin >> a[0];
m = a[0];
for (int i = 1; i < 5; i++) {
cin >> a[i];
m = min(m, a[i]);
}
long c... | [
"variable_declaration.type.primitive.change"
] | 893,910 | 893,911 | u793275002 | cpp |
p03077 |
#include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctgmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include ... |
#include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctgmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | [] | 893,912 | 893,913 | u972954150 | cpp |
p03077 | // スタックサイズ: 100MB
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
... | // スタックサイズ: 100MB
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
... | [] | 893,914 | 893,915 | u511401499 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using ull = unsigned long long;
us... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using ull = unsigned long long;
us... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 893,916 | 893,917 | u211681714 | cpp |
p03078 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 893,918 | 893,919 | u927801748 | cpp |
p03078 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"identifier.change",
"io.output.change"
] | 893,924 | 893,925 | u493520238 | cpp |
p03078 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"call.arguments.change"
] | 893,926 | 893,925 | u493520238 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 all(a) (a).begin(), (a).end()
#define bit(k) (1LL << (k))
#define SUM(v) accumulate(all(v), 0LL)
typedef pair<int, int> i_i;
typedef pair<ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 all(a) (a).begin(), (a).end()
#define bit(k) (1LL << (k))
#define SUM(v) accumulate(all(v), 0LL)
typedef pair<int, int> i_i;
typedef pair<ll... | [
"call.arguments.change",
"call.add"
] | 893,941 | 893,942 | u106297876 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long int people[5], n;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> people[i];
}
lo... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long int people[5], n;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> people[i];
}
lo... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 893,944 | 893,945 | u227379863 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a;
cin >> n >> a;
for (int i = 1; i < 5; i++) {
long b;
cin >> b;
a = min(a, b);
}
cout << 5 + n / a << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a;
cin >> n >> a;
for (int i = 1; i < 5; i++) {
long b;
cin >> b;
a = min(a, b);
}
cout << 5 + (n - 1) / a << endl;
return 0;
}
| [] | 893,963 | 893,964 | u280512618 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long n[5] = {A, B, C, D, E};
sort(n, n + 5);
int a = n[0];
int v = 4;
if (N % a != 0) {
v += N / a + 1;
} else {
v += N / a;
}
cout << v << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long n[5] = {A, B, C, D, E};
sort(n, n + 5);
long a = n[0];
long v = 4;
if (N % a != 0) {
v += N / a + 1;
} else {
v += N / a;
}
cout << v << endl;
} | [
"variable_declaration.type.primitive.change"
] | 893,967 | 893,968 | u288905450 | cpp |
p03077 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll train = A;
ll bus = min(train, B);
ll taxi = min(bus, C);
ll plane = min(taxi, D);
ll ship = min(plane, E);
ll ans;
if (N == ship) {
ans = 4 + (N / ship);
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll train = A;
ll bus = min(train, B);
ll taxi = min(bus, C);
ll plane = min(taxi, D);
ll ship = min(plane, E);
ll ans;
if (N % ship == 0) {
ans = 4 + (N / shi... | [
"control_flow.branch.if.condition.change"
] | 893,969 | 893,970 | u394759653 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ll N;
cin >> N;
ll mini = INF;
ll A[5];
for (int i = 0; i < 5; i++) {
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ll N;
cin >> N;
ll mini = INF;
ll A[5];
for (int i = 0; i < 5; i++) {
cin ... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 893,971 | 893,972 | u508571192 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.