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 |
|---|---|---|---|---|---|---|---|
p03076 | #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) ... | #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) ... | [
"identifier.change",
"expression.operation.binary.change"
] | 890,971 | 890,972 | u040490988 | cpp |
p03076 | #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) ... | #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) ... | [
"literal.number.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 890,973 | 890,972 | u040490988 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<int> A(5);
vector<int> B(5);
for (int i = 0; i < 5; i++) {
cin >> A[i];
if (A[i] % 10 == 0) {
B[i] = 0;
} else {
B[i] = 10 - A[i] % 10;
}
}
// 添え字取得
vector<int>::iterator max = min_element(B.begin(), B.end());... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<int> A(5);
vector<int> B(5);
for (int i = 0; i < 5; i++) {
cin >> A[i];
if (A[i] % 10 == 0) {
B[i] = 0;
} else {
B[i] = 10 - A[i] % 10;
}
}
// 添え字取得
vector<int>::iterator max = max_element(B.begin(), B.end());... | [
"identifier.change",
"call.function.change"
] | 890,996 | 890,997 | u934246119 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int a[10];
bool cmp(int a, int b) {
int t = (a % 10 == 0) ? 10 : a % 10;
int t1 = (b % 10 == 0) ? 10 : b % 10;
return t < t1;
}
int main() {
int n = 5;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, cmp);
long long res = 0;
for (int i = 1;... | #include <bits/stdc++.h>
using namespace std;
int a[10];
bool cmp(int a, int b) {
int t = (a % 10 == 0) ? 10 : a % 10;
int t1 = (b % 10 == 0) ? 10 : b % 10;
return t < t1;
}
int main() {
int n = 5;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, cmp);
long long res = 0;
for (int i = 1;... | [
"assignment.change"
] | 891,056 | 891,057 | u232901495 | cpp |
p03076 | #include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <istream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> a;
int s[4];
int m = 0;
int min = 0;
int i;
int j;
int t = 0;
for (i = 0; i < 5; i++) {
cin >> j;
... | #include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <istream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> a;
int s[4];
int m = 0;
int min = 0;
int i;
int j;
int t = 0;
for (i = 0; i < 5; i++) {
cin >> j;
... | [
"assignment.add"
] | 891,058 | 891,059 | u230139835 | cpp |
p03076 | #include <bits/stdc++.h>
int main() {
int ans = 0, min = 0;
for (int i = 0, a; i < 5; i++) {
std::cin >> a, ans += (a + 9) / 10 * 10,
min = std::min(min, (a + 9) / 10 * 10 - a);
}
std::cout << ans - min << std::endl;
return 0;
}
| #include <bits/stdc++.h>
int main() {
int ans = 0, min = 0;
for (int i = 0, a; i < 5; i++) {
std::cin >> a, ans += (a + 9) / 10 * 10,
min = std::max(min, (a + 9) / 10 * 10 - a);
}
std::cout << ans - min << std::endl;
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 891,093 | 891,094 | u603303736 | cpp |
p03076 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define INF (1000000007)
#define distance(x1, y1, x2, y2) \
sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define INF (1000000007)
#define distance(x1, y1, x2, y2) \
sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2... | [
"control_flow.branch.if.condition.change"
] | 891,114 | 891,115 | u396824275 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
int b = 10;
int c = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] % 10 < b && a[i] % 10 != 0) {
c = i;
b = a[i];
}
}
int ans = 0;
for (int i = 0; i < 5; i++) {
if (i == c) {
ans += a[i];
} ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
int b = 10;
int c = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] % 10 < b && a[i] % 10 != 0) {
c = i;
b = a[i] % 10;
}
}
int ans = 0;
for (int i = 0; i < 5; i++) {
if (i == c) {
ans += a[i];
... | [
"assignment.change"
] | 891,126 | 891,127 | u578806044 | cpp |
p03076 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int menu[5];
int mod[5];
int ans = 0;
int last = 10... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int menu[5];
int mod[5];
int ans = 0;
int last = 10... | [
"assignment.value.change",
"identifier.change"
] | 891,148 | 891,149 | u019780057 | cpp |
p03076 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int menu[5];
int mod[5];
int ans = 0;
int last = 10... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int menu[5];
int mod[5];
int ans = 0;
int last = 10... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.value.change",
"identifier.change"
] | 891,150 | 891,149 | u019780057 | cpp |
p03076 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long mod = 1000000000 + 7;
int main() {
vector<int> time;
for (int i = 0; i < 5; i++) {
int k = 0;
cin >> k;
time.push_back(k);
}
sort(time.begin(), time.end());
int ans = 0;... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long mod = 1000000000 + 7;
int main() {
vector<int> time;
for (int i = 0; i < 5; i++) {
int k = 0;
cin >> k;
time.push_back(k);
}
sort(time.begin(), time.end());
int ans = 0;... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 891,186 | 891,187 | u289871545 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a[5], ans = 0, k = 1000, c = 0;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
rep(i, 5) if (a[i] % 10 != 0 && a[i] % 10 < k) k = a[i], c = i;
rep(i, 5) {
if (a[i] % 10 == 0 || i == c)
ans += a[i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a[5], ans = 0, k = 1000, c = 0;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
rep(i, 5) if (a[i] % 10 != 0 && a[i] % 10 < k) k = a[i] % 10, c = i;
rep(i, 5) {
if (a[i] % 10 == 0 || i == c)
ans +... | [
"assignment.change"
] | 891,192 | 891,193 | u441296840 | cpp |
p03076 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a[5];
int loss[5];
int maxloss = 0;
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
loss[i] = 10 - (a[i] % 10);
if (maxloss < loss[i]) {
maxloss = loss[i];
}
sum += (a[i] + loss[i]);
}
sum -= max... | #include <iostream>
#include <string>
using namespace std;
int main() {
int a[5];
int loss[5];
int maxloss = 0;
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
loss[i] = (10 - (a[i] % 10)) % 10;
if (maxloss < loss[i]) {
maxloss = loss[i];
}
sum += (a[i] + loss[i]);
}
sum... | [
"assignment.change"
] | 891,236 | 891,237 | u982234424 | cpp |
p03076 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
// cout << << endl;
int main() {
int a, b, c, e, f, g;
int d[5];
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
// cout << << endl;
int main() {
int a, b, c, e, f, g;
int d[5];
... | [
"variable_declaration.value.change"
] | 891,257 | 891,258 | u775451660 | cpp |
p03076 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a[5], k, i, a1[5];
for (int i = 0; i < 5; i++) {
scanf("%d", &a[i]);
a1[i] = a[i] % 10;
}
int zj = 1;
for (int i = 0; i < 5; i++) {
if (a1[i] != 0) {
zj = 0;
}
}
if (zj == 1)
k = 0;... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a[5], k, i, a1[5];
for (int i = 0; i < 5; i++) {
scanf("%d", &a[i]);
a1[i] = a[i] % 10;
}
int zj = 1;
for (int i = 0; i < 5; i++) {
if (a1[i] != 0) {
zj = 0;
}
}
if (zj == 1)
k = 10... | [
"literal.number.change",
"assignment.value.change"
] | 891,288 | 891,289 | u977890326 | cpp |
p03076 |
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999
#define INTBIG 1111... |
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999
#define INTBIG 1111... | [] | 891,311 | 891,312 | u657512990 | cpp |
p03076 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int a, b, c, d, e, x, y, z, h, w;
int sum = 0;
void input() {
cin >> a >> b >> c >> d >> e;
sum += a + b + c + d + e;
}
void solve() {
sum += a % 10 == 0 ? 0 : 10 - a % 10;
sum += b % 10 == 0 ? 0 : 10 - b % 10;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int a, b, c, d, e, x, y, z, h, w;
int sum = 0;
void input() {
cin >> a >> b >> c >> d >> e;
sum += a + b + c + d + e;
}
void solve() {
sum += a % 10 == 0 ? 0 : 10 - a % 10;
sum += b % 10 == 0 ? 0 : 10 - b % 10;
... | [] | 891,317 | 891,318 | u789199225 | cpp |
p03076 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int input[5];
for (int i = 0; i < 5; i++) {
cin >> input[i];
}
vector<int> n;
for (int i = 0; i < 5; i++) {
n.push_back(input[i] % 10);
}
int lastDigit = -1;
int index;
for (int i = 1; i < 11; i++) {... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int input[5];
for (int i = 0; i < 5; i++) {
cin >> input[i];
}
vector<int> n;
for (int i = 0; i < 5; i++) {
n.push_back(input[i] % 10);
}
int lastDigit = -1;
int index;
for (int i = 1; i < 10; i++) {... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 891,333 | 891,334 | u650163631 | cpp |
p03076 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int input[5];
for (int i = 0; i < 5; i++) {
cin >> input[i];
}
vector<int> n;
for (int i = 0; i < 5; i++) {
n.push_back(input[i] % 10);
}
int lastDigit = -1;
int index;
for (int i = 1; i < 11; i++) {... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int input[5];
for (int i = 0; i < 5; i++) {
cin >> input[i];
}
vector<int> n;
for (int i = 0; i < 5; i++) {
n.push_back(input[i] % 10);
}
int lastDigit = -1;
int index;
for (int i = 1; i < 10; i++) {... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 891,335 | 891,334 | u650163631 | cpp |
p03076 | /* https://atcoder.jp/contests/abc123/tasks/abc123_b */
#include <cmath>
#include <iostream>
#include <vector>
std::vector<int> X(5);
void solve() {
int min_cost = 123 * 5;
for (int i = 0; i < 5; ++i) {
int cost_i = std::ceil(X.at(i) * 0.1) * 10;
for (int j = 0; j < 5; ++j) {
if (i == j) {
... | /* https://atcoder.jp/contests/abc123/tasks/abc123_b */
#include <cmath>
#include <iostream>
#include <vector>
std::vector<int> X(5);
void solve() {
int min_cost = 1e9;
for (int i = 0; i < 5; ++i) {
int cost_i = std::ceil(X.at(i) * 0.1) * 10;
for (int j = 0; j < 5; ++j) {
if (i == j) {
con... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 891,340 | 891,341 | u969227675 | cpp |
p03076 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #include "prettyprint.hpp"
typedef long lo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #include "prettyprint.hpp"
typedef long lo... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 891,349 | 891,350 | u162172626 | cpp |
p03076 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a[5], b[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
for (int i = 0; i < 5; i++) {
b[i] = ((a[i] + (9)) / 10) * 10;
}
int res[5];
res[0] = b[0] + b[1] + b[2] + b[3] +... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a[5], b[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
for (int i = 0; i < 5; i++) {
b[i] = ((a[i] + (9)) / 10) * 10;
}
int res[5];
res[0] = b[0] + b[1] + b[2] + b[3] +... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 891,364 | 891,365 | u360180938 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
//入力
vector<int> abc(5);
for (int i = 0; i < 5; i++) {
cin >> abc[i];
}
//処理
int ans = 0;
for (int i = 0; i < 5; i++) {
ans += abc[i];
abc[i] = abc[i] % 10;
}
sort(abc.begin(), abc.end());
// reverse(abc.begin(),abc.end());
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
//入力
vector<int> abc(5);
for (int i = 0; i < 5; i++) {
cin >> abc[i];
}
//処理
int ans = 0;
for (int i = 0; i < 5; i++) {
ans += abc[i];
abc[i] = abc[i] % 10;
}
sort(abc.begin(), abc.end());
// reverse(abc.begin(),abc.end());
i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 891,366 | 891,367 | u775507068 | cpp |
p03076 | #include <iostream>
using namespace std;
int main() {
int n[7];
n[6] = 0;
for (int i = 0; i < 6; i++) {
cin >> n[i];
}
for (int j = 1; j < 5; j++) {
if (n[0] % 10 == 0) {
n[5] = n[0];
n[0] = n[j];
n[j] = n[5];
} else if (n[0] % 10 > n[j] % 10 && n[j] % 10 != 0) {
n[5] = n[0... | #include <iostream>
using namespace std;
int main() {
int n[7];
n[6] = 0;
for (int i = 0; i < 5; i++) {
cin >> n[i];
}
for (int j = 1; j < 5; j++) {
if (n[0] % 10 == 0) {
n[5] = n[0];
n[0] = n[j];
n[j] = n[5];
} else if (n[0] % 10 > n[j] % 10 && n[j] % 10 != 0) {
n[5] = n[0... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 891,371 | 891,372 | u461896927 | cpp |
p03076 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int timeNeeded(int time) {
if (time % 10 == 0) {
return time;
} else {
return time - (time % 10) + 10;
}
}
int main() {
int a, min = 10, min_idx = -1, res;
vector<int> time, mod;
for... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int timeNeeded(int time) {
if (time % 10 == 0) {
return time;
} else {
return time - (time % 10) + 10;
}
}
int main() {
int a, min = 10, min_idx = -1, res;
vector<int> time;
for (int... | [
"variable_declaration.remove",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 891,397 | 891,398 | u981890679 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
int a, b, c, d, e;
a = A % 10;
b = B % 10;
c = C % 10;
d = D % 10;
e = E % 10;
int k;
k = 10;
if (k > a && a != 0) {
k = b;
}
if (k > b && b != 0) {
k = b;
}
if (k > c && ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
int a, b, c, d, e;
a = A % 10;
b = B % 10;
c = C % 10;
d = D % 10;
e = E % 10;
int k;
k = 10;
if (k > a && a != 0) {
k = a;
}
if (k > b && b != 0) {
k = b;
}
if (k > c && ... | [
"assignment.value.change",
"identifier.change"
] | 891,403 | 891,404 | u478094431 | cpp |
p03076 | #include <stdio.h>
int main() {
int a, b, c, d, e, n = 9, i = 1, t;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
if (n > a % 10 && a % 10 != 0) {
n = a % 10;
}
if (n > b % 10 && b % 10 != 0) {
n = b % 10;
}
if (n > c % 10 && c % 10 != 0) {
n = c % 10;
}
if (n > d % 10 && d % 10 != 0) {
n =... | #include <stdio.h>
int main() {
int a, b, c, d, e, n = 9, i = 1, t;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
if (n > a % 10 && a % 10 != 0) {
n = a % 10;
}
if (n > b % 10 && b % 10 != 0) {
n = b % 10;
}
if (n > c % 10 && c % 10 != 0) {
n = c % 10;
}
if (n > d % 10 && d % 10 != 0) {
n =... | [
"assignment.change"
] | 891,422 | 891,423 | u433204705 | cpp |
p03076 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
vector<int> v;
int Max = 0;
void load(int a) {
if (a % 10 != 0)
v.push_back(10 - (a % 10));
Max = max(Max, 10 - (a % 10));
}
int main() {
int a, b, c, d, e;
scanf("%d", &a);
load(a);
sc... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
vector<int> v;
int Max = 0;
void load(int a) {
if (a % 10 != 0) {
v.push_back(10 - (a % 10));
Max = max(Max, 10 - (a % 10));
}
}
int main() {
int a, b, c, d, e;
scanf("%d", &a);
load(... | [] | 891,424 | 891,425 | u325138098 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
int min = 10, count = 0, m;
for (int i = 0; i < 5; i++) {
if (min > a[i] % 10 && a[i] % 10 != 0) {
min = a[i];
m = i;
}
}
for (int i = 0; i < 5; i++) {
if (a[i] < 10 &&... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
int min = 10, count = 0, m;
for (int i = 0; i < 5; i++) {
if (min > a[i] % 10 && a[i] % 10 != 0) {
min = a[i] % 10;
m = i;
}
}
for (int i = 0; i < 5; i++) {
if (a[i] < ... | [
"assignment.change"
] | 891,439 | 891,440 | u072320198 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
#define INF 99999
int main() {
int input[5];
cin >> input[0];
cin >> input[1];
cin >> input[2];
cin >> input[3];
cin >> input[4];
int time = 0;
const int N = 5;
vector<int> v(N);
iota(v.begin(), v.end(), 0);
int min = INF;
do {
time = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define INF 99999
int main() {
int input[5];
cin >> input[0];
cin >> input[1];
cin >> input[2];
cin >> input[3];
cin >> input[4];
int time = 0;
const int N = 5;
vector<int> v(N);
iota(v.begin(), v.end(), 0);
int min = INF;
do {
time = 0;
... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 891,459 | 891,460 | u761335395 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
int a[5], b[5];
int last = INF;
int mem1, mem2, sum = 0;
for (int i = 0; i < 5; i++) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
int a[5], b[5];
int last = INF;
int mem1, mem2, sum = 0;
for (int i = 0; i < 5; i++) ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 891,500 | 891,501 | u324219643 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
using ll = long;
int main() {
ll ans = 0, last = 0;
for (ll i = 0; i < 5; i++) {
ll a;
cin >> a;
ans += (a + 9) / 10;
last = max(last, (1000 - a) % 10);
}
cout << ans - last;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long;
int main() {
ll ans = 0, last = 0;
for (ll i = 0; i < 5; i++) {
ll a;
cin >> a;
ans += (a + 9) / 10 * 10;
last = max(last, (1000 - a) % 10);
}
cout << ans - last;
} | [
"assignment.change"
] | 891,509 | 891,510 | u874644572 | cpp |
p03076 | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | [
"call.arguments.change",
"call.arguments.add"
] | 891,515 | 891,516 | u579152247 | cpp |
p03076 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | [
"control_flow.branch.if.add"
] | 891,517 | 891,518 | u016572066 | cpp |
p03076 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#incl... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 891,519 | 891,520 | u219786796 | cpp |
p03076 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int times[5] = {0, 0, 0, 0, 0};
for (int i = 0; i < 5; i++) {
cin >> times[i];
}
int mintime = 124;
int pastTime = 0;
for (int i = 0; i < 5; i++) {
if (mintime > times[i] % 10 && times[i] % 10 != 0) {
mintime =... | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int times[5] = {0, 0, 0, 0, 0};
for (int i = 0; i < 5; i++) {
cin >> times[i];
}
int mintime = 124;
int pastTime = 0;
for (int i = 0; i < 5; i++) {
if (mintime > times[i] % 10 && times[i] % 10 != 0) {
mintime =... | [
"assignment.change"
] | 891,525 | 891,526 | u655548174 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int order[5];
int loss[5];
int time = 0;
for (int i = 0; i < 5; i++) {
cin >> order[i];
}
for (int i = 0; i < 5; i++) {
int hoge;
hoge = order[i];
for (int j = 0; j <= 9; j++) {
if (hoge % 10 != 0) {
hoge += j;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int order[5];
int loss[5];
int time = 0;
for (int i = 0; i < 5; i++) {
cin >> order[i];
}
for (int i = 0; i < 5; i++) {
int hoge;
hoge = order[i];
for (int j = 0; j <= 9; j++) {
if (hoge % 10 != 0) {
hoge++;
}... | [] | 891,552 | 891,553 | u839938263 | cpp |
p03076 | #include <iostream>
using namespace std;
int main(void) {
int a[5];
int b, b_b = 10;
int last;
int val;
int time = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
for (int i = 0; i < 5; i++) {
b = a[i] % 10;
if ((b_b > b) && (b != 0)) {
b_b = b;
last = b;
}
}
for (in... | #include <iostream>
using namespace std;
int main(void) {
int a[5];
int b, b_b = 10;
int last;
int val;
int time = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
for (int i = 0; i < 5; i++) {
b = a[i] % 10;
if ((b_b > b) && (b != 0)) {
b_b = b;
last = 10 - b;
}
}
fo... | [
"assignment.change"
] | 891,554 | 891,555 | u510688220 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int a[6], ans = 0, mi = 10;
int main() {
for (int i = 1; i <= 5; i++) {
cin >> a[i];
if (a[i] % 10 == 0) {
ans += a[i];
} else {
ans += a[i] + 10 - a[i] % 10;
mi = min(mi, a[i] % 11);
}
// cout<<ans;
}
if (mi == 10) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int a[6], ans = 0, mi = 10;
int main() {
for (int i = 1; i <= 5; i++) {
cin >> a[i];
if (a[i] % 10 == 0) {
ans += a[i];
} else {
ans += a[i] + 10 - a[i] % 10;
mi = min(mi, a[i] % 10);
}
// cout<<ans;
}
if (mi == 10) {
cout <<... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 891,567 | 891,568 | u547457320 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int a[6], ans = 0, mi = 11;
int main() {
for (int i = 1; i <= 5; i++) {
cin >> a[i];
if (a[i] % 10 == 0) {
ans += a[i];
} else {
ans += a[i] + 10 - a[i] % 10;
mi = min(mi, a[i] % 10);
}
// cout<<ans;
}
if (mi == 10) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int a[6], ans = 0, mi = 10;
int main() {
for (int i = 1; i <= 5; i++) {
cin >> a[i];
if (a[i] % 10 == 0) {
ans += a[i];
} else {
ans += a[i] + 10 - a[i] % 10;
mi = min(mi, a[i] % 10);
}
// cout<<ans;
}
if (mi == 10) {
cout <<... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 891,569 | 891,568 | u547457320 | cpp |
p03076 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int all = 0;
int a[5] = {0}, b = 0, c = 10;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] % 10 != 0) {
all += 10;
}
b = a[i] / 10;
all += b * 10;
if (a[i] - b * 10 > c && a[i] % 10 ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int all = 0;
int a[5] = {0}, b = 0, c = 10;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] % 10 != 0) {
all += 10;
}
b = a[i] / 10;
all += b * 10;
if (a[i] - b * 10 < c && a[i] % 10 ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 891,623 | 891,624 | u440140106 | cpp |
p03076 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n[5];
rep(i, 5) { cin >> n[i]; }
int digit[5];
rep(i, 5) { digit[i] = (n[i] % 100) % 10; }
int sum, ans = 0;
rep(i, 5) { sum += digit[i]; }
if (sum == 0) {
rep(i, 5) { ans += n[i]; }
cou... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n[5];
rep(i, 5) { cin >> n[i]; }
int digit[5];
rep(i, 5) { digit[i] = (n[i] % 100) % 10; }
int sum, ans = 0;
rep(i, 5) { sum += digit[i]; }
if (sum == 0) {
rep(i, 5) { ans += n[i]; }
cou... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 891,627 | 891,628 | u532086793 | cpp |
p03076 | #include <iostream>
int main(void) {
int a, b, c, d, e, sum, min = 11, flag = 0;
std::cin >> a >> b >> c >> d >> e;
if (a % 10 == 0) {
flag++;
}
if (b % 10 == 0) {
flag++;
}
if (c % 10 == 0) {
flag++;
}
if (d % 10 == 0) {
flag++;
}
if (e % 10 == 0) {
flag++;
}
if (flag == ... | #include <iostream>
int main(void) {
int a, b, c, d, e, sum, min = 11, flag = 0;
std::cin >> a >> b >> c >> d >> e;
if (a % 10 == 0) {
flag++;
}
if (b % 10 == 0) {
flag++;
}
if (c % 10 == 0) {
flag++;
}
if (d % 10 == 0) {
flag++;
}
if (e % 10 == 0) {
flag++;
}
if (flag == ... | [
"expression.operation.binary.remove"
] | 891,681 | 891,682 | u934064105 | cpp |
p03076 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, count = 0, modmin = 9;
bool flag = false;
for (int i = 0; i < 5; i++) {
if (a % 10 > 0) {
flag = true;
modmin = min(modm... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, count = 0, modmin = 9;
bool flag = false;
for (int i = 0; i < 5; i++) {
cin >> a;
if (a % 10 > 0) {
flag = true;
mod... | [] | 891,704 | 891,705 | u793275002 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << ll(5) + n / (min({a, b, c, d, e})) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << ll(5) + (n - 1) / (min({a, b, c, d, e})) << endl;
return 0;
}
| [] | 891,728 | 891,729 | u027630431 | cpp |
p03077 | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define mod 1000000007
#define inf 1000000000000000001;
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// // for getting input from input.txt
// freopen("input.txt", "r", stdin);
// // for writing output to output.txt
// freop... | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define mod 1000000007
#define inf 1000000000000000001;
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// for getting input from input.txt
// freopen("input.txt", "r", stdin);
// for writing output to output.txt
// freopen("output.... | [
"call.arguments.change"
] | 891,732 | 891,733 | u219987462 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int m = min({a, b, c, d, e});
cout << (n + m - 1) / m + 4 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#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({a, b, c, d, e});
cout << (n + m - 1) / m + 4 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 891,750 | 891,751 | u994074033 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long double m = min({a, b, c, d, e});
cout << (n + m - 1) / m + 4 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#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({a, b, c, d, e});
cout << (n + m - 1) / m + 4 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 891,752 | 891,751 | u994074033 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"call.add"
] | 891,755 | 891,756 | u832995587 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"variable_declaration.type.change"
] | 891,757 | 891,758 | u832995587 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"variable_declaration.type.change"
] | 891,759 | 891,758 | u832995587 | cpp |
p03077 | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll n, i, c, bn;
cin >> n;
for (i = 0; i < 5; ++i) {
cin >> c;
bn = min(bn, c);
}
if (n % bn == 0)
cout << n / bn + 4 << endl;
else
cout << n / bn + 5 << endl;
return 0;
} | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll n, i, c, bn = 1e15 + 1;
cin >> n;
for (i = 0; i < 5; ++i) {
cin >> c;
bn = min(bn, c);
}
if (n % bn == 0)
cout << n / bn + 4 << endl;
else
cout << n / bn + 5 << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 891,760 | 891,761 | u714732628 | cpp |
p03077 | #include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i, a, b) for (i = a; i < b; i++)
#define RFOR(i, a, b) for (... | #include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i, a, b) for (i = a; i < b; i++)
#define RFOR(i, a, b) for (... | [
"type_conversion.add"
] | 891,763 | 891,764 | u587086245 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr ll INFLL = 1e18;
constexpr int MOD = 1e9 + 7;
const ld PI = acosl(-1);
#define rep(i, n) for (int i = 0; i < (n); ++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr ll INFLL = 1e18;
constexpr int MOD = 1e9 + 7;
const ld PI = acosl(-1);
#define rep(i, n) for (int i = 0; i < (n); ++... | [
"assignment.change"
] | 891,788 | 891,789 | u959682820 | 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 pos = 0;
long long time = 0;
time = (n + (a - 1)) / a;
pos++;
if (a <= b) {
time++;
b = a;
} else
time = (n + (b - 1)) / b + pos;
pos++;
if (b <= c) {
time+... | #include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long long pos = 0;
long long time = 0;
time = (n + (a - 1)) / a;
pos++;
if (a <= b) {
time++;
b = a;
} else
time = (n + (b - 1)) / b + pos;
pos++;
if (b <= c) {
time+... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 891,792 | 891,793 | u509420256 | cpp |
p03077 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX... | [
"literal.number.change",
"expression.operation.binary.change"
] | 891,806 | 891,807 | u511096055 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll N;
cin >> N;
vector<ll> V(5);
ll min_v = 1e16;
for (int i = 0; i < 5; i++) {
cin >> V[i];
min_v = min(min_v, V[i]);
}
ll X = N / min_v;
if (N % min_v == 0) {
X--;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll N;
cin >> N;
vector<ll> V(5);
ll min_v = 1e16;
for (int i = 0; i < 5; i++) {
cin >> V[i];
min_v = min(min_v, V[i]);
}
ll X = N / min_v;
if (N % min_v == 0) {
X--;
}
cout ... | [
"io.output.change",
"expression.operation.binary.remove"
] | 891,808 | 891,809 | u418892821 | cpp |
p03077 | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, n, m) for (int i = m; i < (n); ++i)
#define repl(i, n) for (long long i = 0; i < (n); ++i)
#d... | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, n, m) for (int i = m; i < (n); ++i)
#define repl(i, n) for (long long i = 0; i < (n); ++i)
#d... | [] | 891,816 | 891,817 | u772395065 | cpp |
p03077 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
int my_ceil(int a, int b) { return (a + b - 1) / b; }
ll N, A, B, C, D, E;
int main() {
cin >> N >> A >> B ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
ll my_ceil(ll a, ll b) { return (a + b - 1) / b; }
ll N, A, B, C, D, E;
int main() {
cin >> N >> A >> B >> ... | [] | 891,818 | 891,819 | u805392425 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main() {
ll n;
cin >> n;
ll arr[5];
int mini = LONG_MAX;
for (int i = 0; i < 5; i++) {
cin >> arr[i];
if (arr[i] < mini)
mini = arr[i];
}
ll time = 4;
if (n % mini == 0)
time += n / mini;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main() {
ll n;
cin >> n;
ll arr[5];
ll mini = LONG_MAX;
for (int i = 0; i < 5; i++) {
cin >> arr[i];
if (arr[i] < mini)
mini = arr[i];
}
ll time = 4;
if (n % mini == 0)
time += n / mini;
... | [
"variable_declaration.type.change"
] | 891,822 | 891,823 | u511332668 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > (b); i += (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > (b); i += (... | [
"call.arguments.change"
] | 891,824 | 891,825 | u626618167 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > (b); i += (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > (b); i += (... | [
"call.arguments.change"
] | 891,826 | 891,825 | u626618167 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > (b); i += (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > (b); i += (... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 891,827 | 891,825 | u626618167 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | [
"expression.operation.binary.remove"
] | 891,828 | 891,829 | u280175105 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | [
"expression.operation.binary.add"
] | 891,830 | 891,829 | u280175105 | cpp |
p03077 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define NUM 1000000000000010
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define NUM 1000000000000010
using namespace std;
typedef long long ll;
typedef... | [] | 891,835 | 891,836 | u151236434 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long v, a, b, c, d, e;
cin >> v >> a >> b >> c >> d >> e;
long long slow = min({a, b, c, d, e});
cout << 4LL + v + slow - 1LL / slow;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long v, a, b, c, d, e;
cin >> v >> a >> b >> c >> d >> e;
long long slow = min({a, b, c, d, e});
cout << (v + slow - 1) / slow + 4;
return 0;
} | [
"io.output.change",
"expression.operation.binary.remove"
] | 891,837 | 891,838 | u118058164 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long> t;
cin >> N;
for (int i = 0; i < 5; ++i) {
long k;
cin >> k;
t.push_back(k);
}
long min = *min_element(begin(t), end(t));
cout << (N / min) + 5 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long> t;
cin >> N;
for (int i = 0; i < 5; ++i) {
long k;
cin >> k;
t.push_back(k);
}
long min = *min_element(begin(t), end(t));
cout << ((N - 1) / min) + 5 << endl;
return 0;
}
| [] | 891,844 | 891,845 | u357724709 | 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 vi = vector<int>;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args... | [] | 891,853 | 891,854 | u070335689 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t memo = 10000000000000000;
for (int i = 0; i < 5; i++) {
int64_t memo2;
cin >> memo2;
memo = min(memo2, memo);
}
cout << 5 + N / memo << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t memo = 10000000000000000;
for (int i = 0; i < 5; i++) {
int64_t memo2;
cin >> memo2;
memo = min(memo2, memo);
}
cout << 5 + (N - 1) / memo << endl;
} | [] | 891,859 | 891,860 | u453366189 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> v(5);
rep(i, 0, 4) cin >> v[i];
ll min = *min_element(v.begin(), v.end());
if (N <= min) {
cout << 5 << endl;
return 0;
}
ll t = (N +... | #include <bits/stdc++.h>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> v(5);
rep(i, 0, 4) cin >> v[i];
ll min = *min_element(v.begin(), v.end());
if (N <= min) {
cout << 5 << endl;
return 0;
}
ll t = (N +... | [
"assignment.change"
] | 891,868 | 891,869 | u752006685 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, n, j) for (int i = (j); i < (n); ++i)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
#define ssort(n) sort((n).begin(), (n).end())
#define rsort(n) sort((n).begin(), (n).end(), greater<ll>())
using ll = long ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, n, j) for (int i = (j); i < (n); ++i)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
#define ssort(n) sort((n).begin(), (n).end())
#define rsort(n) sort((n).begin(), (n).end(), greater<ll>())
using ll = long ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 891,870 | 891,871 | u149757670 | cpp |
p03077 | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 891,876 | 891,877 | u442810826 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change"
] | 891,878 | 891,879 | u617826263 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
long long *a = new long long[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
long long min = n;
for (int i = 0; i < 4; i++) {
if (min ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
long long *a = new long long[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
long long min = n;
for (int i = 0; i < 5; i++) {
if (min ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 891,882 | 891,883 | u712993629 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(), v.end())
#define reverse(v) reverse(v.begin(), v.end())
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template ... | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(), v.end())
#define reverse(v) reverse(v.begin(), v.end())
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template ... | [
"expression.operation.binary.remove"
] | 891,884 | 891,885 | u332253305 | cpp |
p03077 | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright © 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i <... | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright © 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i <... | [] | 891,886 | 891,887 | u332253305 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << (n + min({a, b, c, d, e}) - 1 / min({a, b, c, d, e})) + 4 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << (n + min({a, b, c, d, e}) - 1) / min({a, b, c, d, e}) + 4 << endl;
}
| [] | 891,892 | 891,893 | u371051907 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
//
long long num;
long long a, b, c, d, e;
long long numA = 0;
long long numB = 0;
long long numC = 0;
long long numD = 0;
long long numE = 0;
long long cnt = 0;
long long Min;
cin >> num >> a >> b >> c >> d >> e;
numA = num;
Min = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
//
long long num;
long long a, b, c, d, e;
long long numA = 0;
long long numB = 0;
long long numC = 0;
long long numD = 0;
long long numE = 0;
long long cnt = 0;
long long Min;
cin >> num >> a >> b >> c >> d >> e;
numA = num;
Min = ... | [
"assignment.change"
] | 891,906 | 891,907 | u367131219 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int64_t F = min(A, min(B, min(C, min(D, min(E, F)))));
if (N % F == 0) {
cout << N / F + 4 << endl;
} else {
cout << N / F + 5 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int64_t F = min(A, min(B, min(C, min(D, E))));
if (N % F == 0) {
cout << N / F + 4 << endl;
} else {
cout << N / F + 5 << endl;
}
return 0;
}
| [
"call.remove",
"call.arguments.change"
] | 891,916 | 891,917 | u124187388 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | [
"assignment.change"
] | 891,918 | 891,919 | u900485130 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, n) for (ll i = a; i < (ll)(n); i++)
int main() {
ll N;
cin >> N;
ll min = 10e15;
rep(i, 5) {
ll x;
cin >> x;
min = std::min(x, min);
}
cout << ceil(N / (doub... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, n) for (ll i = a; i < (ll)(n); i++)
int main() {
ll N;
cin >> N;
ll min = 10e15;
rep(i, 5) {
ll x;
cin >> x;
min = std::min(x, min);
}
cout << (ll)ceil(N / (... | [
"type_conversion.add"
] | 891,920 | 891,921 | u526365587 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int64_t cc = pow(10, 9) + 7;
int main() {
int64_t a, b, c, d;
std::cin >> a;
c = 5;
d = 0;
for (int i = 0; i < 5; i++) {
std::ci... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int64_t cc = pow(10, 9) + 7;
int main() {
int64_t a, b, c, d;
std::cin >> a;
c = 5;
d = 0;
for (int i = 0; i < 5; i++) {
std::ci... | [] | 891,942 | 891,943 | u184115330 | cpp |
p03077 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll n, a[5];
int main() {
cin >> n;
for (int i = 0; i < 5; ++i)
cin >> a[i];
ll mi = (ll)1e15;
for (int i = 0; i < 4; ++i)
mi = min(mi, a[i]);
cout << (ll)ceil(1.0 * n / mi) + 4 << endl;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll n, a[5];
int main() {
cin >> n;
for (int i = 0; i < 5; ++i)
cin >> a[i];
ll mi = (ll)1e15;
for (int i = 0; i < 5; ++i)
mi = min(mi, a[i]);
cout << (ll)ceil(1.0 * n / mi) + 4 << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 891,946 | 891,947 | u694951525 | 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());
cout << n / capacity[0] + 5 << endl;
return 0;
} | #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());
cout << (n - 1) / capacity[0] + 5 << endl;
return 0;
} | [] | 891,950 | 891,951 | u180716041 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<int> capacity(5);
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
}
sort(capacity.begin(), capacity.end());
cout << n / capacity[0] + 5 << endl;
return 0;
} | #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());
cout << (n - 1) / capacity[0] + 5 << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 891,952 | 891,951 | u180716041 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll K = 1000000007;
int Kuriage(ll a, ll b) {
if (a % b) {
return a / b + 1;
} else {
return a / b;
}
}
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll O, P, Q, R, S, T;
O = Kuriage(N, A);
P = Kuriage(N, B... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll K = 1000000007;
ll Kuriage(ll a, ll b) {
if (a % b) {
return a / b + 1;
} else {
return a / b;
}
}
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
ll O, P, Q, R, S, T;
O = Kuriage(N, A);
P = Kuriage(N, B)... | [] | 891,958 | 891,959 | u196629968 | 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 minmove = min({a, b, c, d, e});
int ans = (n + minmove - 1) / minmove + 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 minmove = min({a, b, c, d, e});
long long ans = (n + minmove - 1) / minmove + 4;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 891,965 | 891,966 | u880909682 | cpp |
p03077 | #include <iostream>
using namespace std;
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int p[6];
for (int i = 0; i < 6; ++i) {
... | #include <iostream>
using namespace std;
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int p[6];
for (int i = 0; i < 6; ++i) {
... | [
"call.arguments.change"
] | 891,973 | 891,974 | u266763028 | cpp |
p03077 | #include <iostream>
using namespace std;
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int p[6];
for (int i = 0; i < 6; ++i) {
... | #include <iostream>
using namespace std;
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int p[6];
for (int i = 0; i < 6; ++i) {
... | [
"call.arguments.change"
] | 891,975 | 891,974 | u266763028 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x;... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x;... | [
"identifier.change",
"call.arguments.change"
] | 891,976 | 891,977 | u004411048 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, hoge[5], neck, ans;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> hoge[i];
}
neck = 10000000000000001;
for (int i = 0; i < 5; i++) {
neck = min(neck, hoge[i]);
}
ans = 5 + n / neck;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, hoge[5], neck, ans;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> hoge[i];
}
neck = 10000000000000001;
for (int i = 0; i < 5; i++) {
neck = min(neck, hoge[i]);
}
ans = 5 + (n - 1) / neck;
cout << ans << en... | [] | 891,994 | 891,995 | u364916333 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, hoge[5], neck, ans;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> hoge[i];
}
neck = 1000000000000001;
for (int i = 0; i < 5; i++) {
neck = min(neck, hoge[i]);
}
ans = 5 + n / neck;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, hoge[5], neck, ans;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> hoge[i];
}
neck = 10000000000000001;
for (int i = 0; i < 5; i++) {
neck = min(neck, hoge[i]);
}
ans = 5 + (n - 1) / neck;
cout << ans << en... | [
"literal.number.change",
"assignment.value.change"
] | 891,996 | 891,995 | u364916333 | cpp |
p03077 | #include <iostream>
int main() {
long n, a, t;
std::cin >> n >> a;
while (std::cin >> t) {
a = (t < a ? t : a);
}
std::cout << n / a + 5 << "\n";
} | #include <iostream>
int main() {
long n, a, t;
std::cin >> n >> a;
while (std::cin >> t) {
a = (t < a ? t : a);
}
std::cout << (n - 1) / a + 5 << "\n";
} | [] | 892,016 | 892,017 | u854175276 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(5);
rep(i, 5) cin >> A.at(i);
ll ans = 10e16;
rep(i, 5) ans = min(ans, A.at(i));
if (ans % N == 0)
cout << (ll)5 + N / ans - 1 << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(5);
rep(i, 5) cin >> A.at(i);
ll ans = 10e16;
rep(i, 5) ans = min(ans, A.at(i));
if (N % ans == 0)
cout << (ll)5 + N / ans - 1 << endl;
else
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 892,018 | 892,019 | u854161810 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | [
"literal.number.change",
"expression.operation.binary.change"
] | 892,020 | 892,021 | u654115433 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll num[5];
for (int i = 0; i < 5; i++)
cin >> num[i];
sort(num, num + 5);
cout << n / num[0] + 5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll num[5];
for (int i = 0; i < 5; i++)
cin >> num[i];
sort(num, num + 5);
cout << (n - 1) / num[0] + 5 << endl;
}
| [] | 892,028 | 892,029 | u351265848 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, mi = 1e15;
cin >> n;
for (int i = 0; i < 5; i++) {
long long tmp;
cin >> tmp;
mi = min(mi, tmp);
}
cout << n / mi + 5;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, mi = 1e15;
cin >> n;
for (int i = 0; i < 5; i++) {
long long tmp;
cin >> tmp;
mi = min(mi, tmp);
}
cout << (n - 1) / mi + 5;
} | [] | 892,034 | 892,035 | u082801599 | cpp |
p03077 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define pp pair<ll, ll>
#define mp make_pair
#define all(v) v.begin(), v.end()
#define pb push_back
#define FOR(i, a, b) for (i = a; i < b; i++)
#define FREV(i, a, b) for (i = a; i >= b; i--)
#define DEBUG(x) ... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define pp pair<ll, ll>
#define mp make_pair
#define all(v) v.begin(), v.end()
#define pb push_back
#define FOR(i, a, b) for (i = a; i < b; i++)
#define FREV(i, a, b) for (i = a; i >= b; i--)
#define DEBUG(x) ... | [] | 892,036 | 892,037 | u500006160 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, MIN = 1000000000000010;
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;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 892,042 | 892,043 | u166378830 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.