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>
int main() {
uint64_t a, b, c, d, e, n;
std::cin >> n >> a >> b >> c >> d >> e;
uint64_t min = std::min(a, b);
min = std::min(min, c);
min = std::min(min, d);
min = std::min(min, e);
uint64_t time = 0;
if (min >= n)
time = 1;
else if (n % 2 == 0)
time = n / min;
else
... | #include <iostream>
int main() {
uint64_t a, b, c, d, e, n;
std::cin >> n >> a >> b >> c >> d >> e;
uint64_t min = std::min(a, b);
min = std::min(min, c);
min = std::min(min, d);
min = std::min(min, e);
uint64_t time = 0;
if (min >= n)
time = 1;
else if (n % min == 0)
time = n / min;
else
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 893,975 | 893,976 | u100825466 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long p[5];
long long minp;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> p[i];
if (i == 0)
minp = p[i];
else
minp = min(minp, p[i]);
}
if (N % minp == 0) {
cout << 5 + (long long)(... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long p[5];
long long minp;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> p[i];
if (i == 0)
minp = p[i];
else
minp = min(minp, p[i]);
}
if (N % minp == 0) {
cout << 5 + (long long)(... | [
"expression.operation.binary.remove"
] | 893,986 | 893,987 | u119477929 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b, c, d, e, mi, ans;
cin >> n >> a >> b >> c >> d >> e;
mi = min(a, min(b, min(c, min(d, e))));
ans = 5 + n / mi;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b, c, d, e, mi, ans;
cin >> n >> a >> b >> c >> d >> e;
mi = min(a, min(b, min(c, min(d, e))));
ans = 5 + (n - 1) / mi;
cout << ans << endl;
} | [] | 893,990 | 893,991 | u916256067 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); ... | [] | 893,998 | 893,999 | u904833081 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, Amin = -1;
cin >> N;
for (int i = 0; i < 5; i++) {
long long temp;
cin >> temp;
if (Amin == -1 || temp < Amin) {
Amin = temp;
}
}
long long ans = 0;
if (Amin < N) {
ans = N / Amin + 5;
} ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, Amin = -1;
cin >> N;
for (int i = 0; i < 5; i++) {
long long temp;
cin >> temp;
if (Amin == -1 || temp < Amin) {
Amin = temp;
}
}
long long ans = 0;
if (Amin < N) {
ans = (N - 1) / Amin + 5... | [] | 894,000 | 894,001 | u426449570 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
long long int N, A, B, C, D, E;
vector<long long int> city;
int main(void) {
cin >> N >> A >> B >> C >> D >> E;
city.push_back(A);
city.push_back(B);
city.push_back(C);
city.push_back(D);
city.push_back(E);
long long int min = *min_element(city.begin(), city.... | #include <bits/stdc++.h>
using namespace std;
long long int N, A, B, C, D, E;
vector<long long int> city;
int main(void) {
cin >> N >> A >> B >> C >> D >> E;
city.push_back(A);
city.push_back(B);
city.push_back(C);
city.push_back(D);
city.push_back(E);
long long int min = *min_element(city.begin(), city.... | [] | 894,006 | 894,007 | u793136026 | cpp |
p03077 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove",
"assignment.change"
] | 894,008 | 894,009 | u949798495 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#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--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | #include <bits/stdc++.h>
using namespace std;
#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--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | [] | 894,010 | 894,011 | u986276444 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N;
vector<long long int> cap(5);
cin >> N;
for (auto &c : cap)
cin >> c;
if (N == 0) {
cout << 0 << endl;
return 0;
}
int minimum = *min_element(ca... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N;
vector<long long int> cap(5);
cin >> N;
for (auto &c : cap)
cin >> c;
if (N == 0) {
cout << 0 << endl;
return 0;
}
long long int minimum = *min_... | [
"variable_declaration.type.widen.change"
] | 894,016 | 894,015 | u050706842 | cpp |
p03077 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | [] | 894,021 | 894,022 | u199808440 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N;
long long X[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> X[i];
}
sort(X, X + 5, greater<long long>());
long long S;
S = N / X[4];
long long goukei;
goukei = S + 5;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N;
long long X[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> X[i];
}
sort(X, X + 5, greater<long long>());
long long S;
S = (N - 1) / X[4];
long long goukei;
goukei = S +... | [] | 894,027 | 894,028 | u573019226 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
int min_index = 0;
long long trans[5], min, N;
cin >> N >> trans[0];
min = trans[0];
for (int i = 1; i < 5; i++) {
cin >> trans[i];
if (min > trans[i]) {
min = trans[i];
}
}
cout << N / min + 5;
} | #include <iostream>
using namespace std;
int main() {
int min_index = 0;
long long trans[5], min, N;
cin >> N >> trans[0];
min = trans[0];
for (int i = 1; i < 5; i++) {
cin >> trans[i];
if (min > trans[i]) {
min = trans[i];
}
}
cout << (N - 1) / min + 5;
} | [] | 894,029 | 894,030 | u554988565 | cpp |
p03077 | //#define DEB1 //output check function
//#define DEB2 //same output, input from input.txt
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <sta... | //#define DEB1 //output check function
//#define DEB2 //same output, input from input.txt
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <sta... | [
"expression.operation.binary.add"
] | 894,037 | 894,038 | u495072453 | cpp |
p03077 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
vector<long long> v(5, 0);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
sort(v.begin(), v.e... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
vector<long long> v(5, 0);
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
sort(v.begin(), v.e... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 894,039 | 894,040 | u468862268 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 10000000000000000;
int main() {
ll n;
cin >> n;
ll a[5];
ll les = INF;
for (int i = 0; i < 5; i++) {
cin >> a[i];
les = min(les, a[i]);
}
cout << n / les + 5 << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 10000000000000000;
int main() {
ll n;
cin >> n;
ll a[5];
ll les = INF;
for (int i = 0; i < 5; i++) {
cin >> a[i];
les = min(les, a[i]);
}
cout << (n - 1) / les + 5 << endl;
} | [] | 894,050 | 894,051 | u681557252 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long n, a[5], minn, necknum, ans;
int main(void) {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
minn = a[i];
else
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long n, a[5], minn, necknum, ans;
int main(void) {
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
minn = a[i];
else
... | [
"assignment.change"
] | 894,054 | 894,055 | u217596176 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const int INF = 1e9;
template <cl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const int INF = 1e9;
template <cl... | [] | 894,064 | 894,065 | u863279562 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
vector<int> v(5, 0);
for (auto &&x : v)
cin >> x;
int a = v[0];
for (auto &&x : v)
a = min(a, x);
// cout<<a;
cout << 5 + n / a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
vector<int> v(5, 0);
for (auto &&x : v)
cin >> x;
int a = v[0];
for (auto &&x : v)
a = min(a, x);
// cout<<a;
cout << 5 + (n - 1) / a << endl;
}
| [] | 894,066 | 894,067 | u731175398 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i;
long long n;
long long temp;
vector<long long> list;
cin >> n;
for (i = 0; i < 5; i++) {
cin >> temp;
list.push_back(temp);
}
sort(list.begin(), list.end());
if (n / list[0] <= 1) {
cou... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i;
long long n;
long long temp;
vector<long long> list;
cin >> n;
for (i = 0; i < 5; i++) {
cin >> temp;
list.push_back(temp);
}
sort(list.begin(), list.end());
if (n / list[0] < 1) {
cout... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 894,079 | 894,080 | u875367173 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long> cap(5);
long n;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> cap.at(i);
}
vector<long>::iterator minIt = min_element(cap.begin(), cap.end());
int minIdx = distance(cap.begin(), minIt);
long min = cap.at(minIdx);
int ans = 4... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long> cap(5);
long n;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> cap.at(i);
}
vector<long>::iterator minIt = min_element(cap.begin(), cap.end());
int minIdx = distance(cap.begin(), minIt);
long min = cap.at(minIdx);
long ans = ... | [
"variable_declaration.type.primitive.change"
] | 894,085 | 894,086 | u461393490 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
ret... | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
ret... | [
"call.add",
"expression.operation.binary.change",
"assignment.change"
] | 894,087 | 894,088 | u811472478 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long long> cp(5);
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> cp[i];
}
sort(cp.begin(), cp.end());
cout << (N + cp[0]) / cp[0] + (5 - 1) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long long> cp(5);
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> cp[i];
}
sort(cp.begin(), cp.end());
cout << (N + cp[0] - 1) / cp[0] + (5 - 1) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 894,097 | 894,098 | u736339585 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long> cp(5);
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> cp[i];
}
sort(cp.begin(), cp.end());
cout << (N + cp[0]) / cp[0] + (5 - 1) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
vector<long long> cp(5);
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> cp[i];
}
sort(cp.begin(), cp.end());
cout << (N + cp[0] - 1) / cp[0] + (5 - 1) << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 894,099 | 894,098 | u736339585 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[5];
long long int min = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
min = a[i];
if (a[i] < min) {
min = a[i];
}
}
long long int... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[5];
long long int min = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0)
min = a[i];
if (a[i] < min) {
min = a[i];
}
}
long long int... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 894,106 | 894,107 | u875377810 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define repr(i, b, e) for (int(i)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define repr(i, b, e) for (int(i)... | [
"call.arguments.change"
] | 894,116 | 894,117 | u569690172 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
// long long double N;
long long m[6];
// cin >> N;
long long i;
long long ans = 0;
long long min;
for (i = 0; i < 6; i++) {
cin >> m[i];
}
sort(m + 1, m + 6);
ans += 5 + m[0] / m[1];
if (m[0] ... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
// long long double N;
long long m[6];
// cin >> N;
long long i;
long long ans = 0;
long long min;
for (i = 0; i < 6; i++) {
cin >> m[i];
}
sort(m + 1, m + 6);
ans += 5 + m[0] / m[1];
if (m[0] ... | [
"control_flow.branch.if.condition.change"
] | 894,118 | 894,119 | u586244382 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | [] | 894,120 | 894,121 | u759266806 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1918;
// vi ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1918;
// vi ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 894,131 | 894,132 | u415518175 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#... | [
"literal.number.change",
"variable_declaration.value.change"
] | 894,135 | 894,136 | u679071005 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#... | [
"literal.number.change",
"variable_declaration.value.change"
] | 894,137 | 894,136 | u679071005 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; i++)
#define FOR(i, k, n) for (signed i = k; i < n; i++)
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "No") << endl
#define pr(r) cout << r << endl
#define min(x, y) (x < y) ? x : y
#defi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; i++)
#define FOR(i, k, n) for (signed i = k; i < n; i++)
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "No") << endl
#define pr(r) cout << r << endl
#define min(x, y) (x < y) ? x : y
#defi... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 894,142 | 894,143 | u222965004 | 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 x, y, z, w;
x = min(a, b);
y = min(c, d);
z = min(x, y);
w = min(e, z);
int t = 0;
if (n % w == 0) {
t += n / w;
}
else if (n % w > 0) {
t += n / w + 1;
}
cout <... | #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 x, y, z, w;
x = min(a, b);
y = min(c, d);
z = min(x, y);
w = min(e, z);
long long t = 0;
if (n % w == 0) {
t += n / w;
}
else if (n % w > 0) {
t += n / w ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,150 | 894,151 | u979163294 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
vector<long long> val(5);
long long x = 0;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> val[i];
}
x = n / (*min_element(val.begin(), val.end())) + 5;
// cout << *min_element(val.begin(), v... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
vector<long long> val(5);
long long x = 0;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> val[i];
}
x = (n - 1) / (*min_element(val.begin(), val.end())) + 5;
// cout << *min_element(val.begi... | [] | 894,162 | 894,163 | u227764848 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
u... | [] | 894,184 | 894,185 | u711985352 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
c... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
c... | [
"expression.operation.binary.remove",
"assignment.change"
] | 894,194 | 894,195 | u762703573 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; i < (n); i++)
#define rrep(i, n) for (int(i) = 1; i <= (n); i++)
#define REP(i, m, n) for (int(i) = (m); (i) < ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; i < (n); i++)
#define rrep(i, n) for (int(i) = 1; i <= (n); i++)
#define REP(i, m, n) for (int(i) = (m); (i) < ... | [
"call.arguments.change",
"expression.operation.binary.change",
"call.remove"
] | 894,199 | 894,200 | u681869152 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 1e5 + 23;
long long a[N], b[N], c[N];
void solve() {
int x, y, z, K;
... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 1e5 + 23;
long long a[N], b[N], c[N];
void solve() {
int x, y, z, K;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,218 | 894,219 | u953463534 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
vec... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
vec... | [
"io.output.newline.add"
] | 894,220 | 894,221 | u702118111 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | [] | 894,222 | 894,223 | u489823438 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | [
"identifier.change",
"call.arguments.change"
] | 894,224 | 894,223 | u489823438 | cpp |
p03078 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<int> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vector<ll>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vector<ll> ... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,227 | 894,226 | u754114382 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1006;
int X, Y, Z, K;
int A[MAX_N], B[MAX_N], C[MAX_N];
void solve() {
sort(A, A + X, greater<int>());
sort(B, B + Y, greater<int>());
sort(C, C + Z, greater<int>());
vector<ll> v;
for (int i = 0; i < X; ++i)
for (int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1006;
int X, Y, Z, K;
ll A[MAX_N], B[MAX_N], C[MAX_N];
void solve() {
sort(A, A + X, greater<ll>());
sort(B, B + Y, greater<ll>());
sort(C, C + Z, greater<ll>());
vector<ll> v;
for (int i = 0; i < X; ++i)
for (int j = ... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 894,232 | 894,233 | u570770016 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> A(X);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
vector<long long> B(Y);
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
vector<long long> C(Z);
for (int i = 0; i < Z; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> A(X);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
vector<long long> B(Y);
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
vector<long long> C(Z);
for (int i = 0; i < Z; i++) {
... | [
"call.function.change",
"call.arguments.change"
] | 894,244 | 894,245 | u424374375 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> C(Z);
vector<ll> D;
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> C(Z);
vector<ll> D;
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < ... | [
"call.arguments.change"
] | 894,255 | 894,256 | u083494782 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout << n << "\n"
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> P;
typedef pair<string, int> Psi;
vector<ll> A(1010), B(1010), C(1010);
int main() {
cin.tie(0);
ios... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout << n << "\n"
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> P;
typedef pair<string, int> Psi;
vector<ll> A(1010), B(1010), C(1010);
int main() {
cin.tie(0);
ios... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 894,266 | 894,267 | u020238108 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 58;
// aを常に小さい値にする 大きい値にする
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> void chmax(T &a, T b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 58;
// aを常に小さい値にする 大きい値にする
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> void chmax(T &a, T b... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 894,270 | 894,271 | u067267880 | cpp |
p03078 | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
constexpr int MAX = 1010;
using ll = long long int;
using T = std::tuple<ll, int, int, int>;
ll a[MAX], b[MAX], c[MAX];
std::set<T> used;
std::priority_queue<T> que;
int dx[] = {1, 0, 0... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
constexpr int MAX = 1010;
using ll = long long int;
using T = std::tuple<ll, int, int, int>;
ll a[MAX], b[MAX], c[MAX];
std::set<T> used;
std::priority_queue<T> que;
int dx[] = {1, 0, 0... | [
"variable_declaration.remove",
"variable_declaration.add",
"variable_declaration.type.change"
] | 894,272 | 894,273 | u332570575 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << var << std::endl
#define pp(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define p(var) std::cout << var << std::endl
#define pp(var) std::cout << #var " = " << var << std::endl
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repeq(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).... | [
"call.remove"
] | 894,277 | 894,278 | u061071198 | cpp |
p03078 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#... | [
"control_flow.continue.remove",
"control_flow.break.add",
"identifier.change",
"call.arguments.change"
] | 894,287 | 894,288 | u354567428 | cpp |
p03078 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#... | [
"identifier.change",
"call.arguments.change"
] | 894,287 | 894,289 | u354567428 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rr... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rr... | [
"expression.operation.binary.remove"
] | 894,298 | 894,299 | u502389123 | cpp |
p03078 | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int x, y, z, K;
cin >> x >... | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int x, y, z, K;
cin >> x >... | [
"expression.operation.binary.remove"
] | 894,302 | 894,303 | u247576416 | cpp |
p03078 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end(), greater<ll>())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
templ... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end(), greater<ll>())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
templ... | [
"variable_declaration.type.change"
] | 894,306 | 894,307 | u556276145 | cpp |
p03078 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
int X, Y, Z, K;
vector<long long> A, B, C;
priority_queue<long long> Q;
int main() {
cin >> X >> Y >> Z >> K;
int i, j, k;
long long num;
A.assign(X, 0);
B.assign(Y, 0)... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
int X, Y, Z, K;
vector<long long> A, B, C;
priority_queue<long long> Q;
int main() {
cin >> X >> Y >> Z >> K;
int i, j, k;
long long num;
A.assign(X, 0);
B.assign(Y, 0)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,311 | 894,312 | u596430580 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
priority_queue<pair<ll, tuple<ll, ll, ll>>> q;
int x, y, z, k;
vector<ll> a;
vector<ll> b;
vector<ll> c;
unordered_set<ll> us;
int main() {
int d;
cin >... | #include <algorithm>
#include <iostream>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
priority_queue<pair<ll, tuple<ll, ll, ll>>> q;
ll x, y, z, k;
vector<ll> a;
vector<ll> b;
vector<ll> c;
unordered_set<ll> us;
int main() {
ll d;
cin >> ... | [
"variable_declaration.type.change"
] | 894,332 | 894,333 | u705230587 | cpp |
p03078 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | [
"call.remove"
] | 894,337 | 894,338 | u752814744 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
cons... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
cons... | [] | 894,339 | 894,340 | u427344224 | cpp |
p03078 | /**
* Created by hiramekun at 20:07 on 2019-08-27.
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(obj) (obj).begin(), (obj).end()
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vl a(x), b(y), c... | /**
* Created by hiramekun at 20:07 on 2019-08-27.
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(obj) (obj).begin(), (obj).end()
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vl a(x), b(y), c... | [
"call.add",
"call.arguments.add"
] | 894,350 | 894,351 | u136378781 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
long long X, Y, Z, K, A[1009], B[1009], C[1009];
vector<long long> vec;
int main() {
cin >> X >> Y >> Z >> K;
for (int i = 0; i < X; i++)
cin >> A[i];
sort(A, A + X, greater<long long>());
for (int i = 0; i < Y; i++)
cin >> B[i];
sort(B, B + Y, greater<l... | #include <bits/stdc++.h>
using namespace std;
long long X, Y, Z, K, A[1009], B[1009], C[1009];
vector<long long> vec;
int main() {
cin >> X >> Y >> Z >> K;
for (int i = 0; i < X; i++)
cin >> A[i];
sort(A, A + X, greater<long long>());
for (int i = 0; i < Y; i++)
cin >> B[i];
sort(B, B + Y, greater<l... | [
"control_flow.loop.for.condition.change"
] | 894,352 | 894,353 | u832995587 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int> S, A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A.at(i);
}
for (int i = 0; i < Y; i++) {
cin >> B.at(i);
}
for (int i = 0; i < Z; i++) {
cin >> C.at(i);
}
sort... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int64_t> S, A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) {
cin >> A.at(i);
}
for (int i = 0; i < Y; i++) {
cin >> B.at(i);
}
for (int i = 0; i < Z; i++) {
cin >> C.at(i);
}
... | [
"variable_declaration.type.primitive.change"
] | 894,360 | 894,361 | u170324846 | cpp |
p03078 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_D main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int... | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_D main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 894,362 | 894,363 | u404244809 | cpp |
p03078 | #include <algorithm>
#include <array>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int X, Y, Z, num;
cin >> X >> Y >> Z >> num;
array<long, 1001> cake1;
array<long, 1001> cake2;
array<long, 1001> cake3;
for (int i = 0; i < X; i++) {
cin >> cake1[i];
}... | #include <algorithm>
#include <array>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int X, Y, Z, num;
cin >> X >> Y >> Z >> num;
array<long, 1001> cake1;
array<long, 1001> cake2;
array<long, 1001> cake3;
for (int i = 0; i < X; i++) {
cin >> cake1[i];
}... | [
"control_flow.loop.for.condition.change"
] | 894,378 | 894,379 | u881705752 | cpp |
p03078 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], C[Z];
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
for (int i = ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], C[Z];
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < Y; i++) {
cin >> B[i];
}
for (int i = ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 894,395 | 894,396 | u102334466 | cpp |
p03078 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
for (int i = 0; i < x; i++) {
cin >> a[i];
}
for (int i = 0; i < y; i++) {
cin >> b[i];
}
for (int i = 0; i < z; i++) {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
for (int i = 0; i < x; i++) {
cin >> a[i];
}
for (int i = 0; i < y; i++) {
cin >> b[i];
}
for (int i = 0; i < z; i++) {
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,407 | 894,408 | u066855390 | cpp |
p03078 | #include <bits/stdc++.h>
using namespace std;
#define el '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define DEBUG cerr << "DEBUG >>> "
#define ms(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const int nax = 1005;
int ax[nax], ay[nax], az[nax];
int main() {
ios_base::s... | #include <bits/stdc++.h>
using namespace std;
#define el '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define DEBUG cerr << "DEBUG >>> "
#define ms(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const int nax = 1005;
ll ax[nax], ay[nax], az[nax];
int main() {
ios_base::sy... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 894,411 | 894,412 | u420202803 | cpp |
p03078 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> A(x), B(y), C(z);
for (int i = 0; i < x; ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> A(x), B(y), C(z);
for (int i = 0; i < x; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 894,413 | 894,414 | u110653681 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n)... | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 894,421 | 894,422 | u840105874 | cpp |
p03078 | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n)... | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 894,423 | 894,422 | u840105874 | cpp |
p03078 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ll;
typedef pair<ll, ll> curr;
const int MOD = 998244353;
int gcd(int a, int b) {
if (b... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ll;
typedef pair<ll, ll> curr;
const int MOD = 998244353;
int gcd(int a, int b) {
if (b... | [] | 894,426 | 894,427 | u554988565 | cpp |
p03078 | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> xx(X), yy(Y), zz(Z);
for (int i = 0; i < X; ++i)
cin >> xx[i];
sort(all(xx), greater<long long>());
for (int i = 0; i < Y; ++i)
cin >> yy[i];
sor... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> xx(X), yy(Y), zz(Z);
for (int i = 0; i < X; ++i)
cin >> xx[i];
sort(all(xx), greater<long long>());
for (int i = 0; i < Y; ++i)
cin >> yy[i];
sor... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 894,435 | 894,436 | u882821419 | cpp |
p03078 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[1001], b[1001], c[1001], d[1000001];
int x, y, z, k;
int p, q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[1001], b[1001], c[1001], d[1000001];
int x, y, z, k;
int p, q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,439 | 894,440 | u562319622 | cpp |
p03078 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[1001], b[1001], c[1001], d[1000001];
int x, y, z, k;
int p, q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[1001], b[1001], c[1001], d[1000001];
int x, y, z, k;
int p, q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
... | [
"variable_declaration.type.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 894,441 | 894,440 | u562319622 | cpp |
p03078 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 894,444 | 894,445 | u900727536 | cpp |
p03078 | #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"
] | 894,466 | 894,467 | u749563575 | cpp |
p03078 | #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"
] | 894,468 | 894,467 | u749563575 | cpp |
p03078 | #include <algorithm>
#include <stdio.h>
#include <vector>
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
typedef long long ll;
using namespace std;
const int N = 1010;
int x, y, z, k;
ll a[N], b[N], c[N];
vector<ll> ab;
vector<ll> abc;
int main() {
scanf("%d%d%d%d", &x, &y, &z, &k);
REP(i, 0, x) scanf("%l... | #include <algorithm>
#include <stdio.h>
#include <vector>
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
typedef long long ll;
using namespace std;
const int N = 1010;
int x, y, z, k;
ll a[N], b[N], c[N];
vector<ll> ab;
vector<ll> abc;
int main() {
scanf("%d%d%d%d", &x, &y, &z, &k);
REP(i, 0, x) scanf("%l... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 894,476 | 894,477 | u459746049 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e15 + 5);
const int MAX_N = (int)(1e1 + 5);
ll n;
ll a[MAX_N];
ll ans;
int main(void) {
// Here your code !
scanf("%lld", &n);
for (int i = 0; i < 5; ++i) {
scanf("%lld", &(a[i])... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e15 + 5);
const int MAX_N = (int)(1e1 + 5);
ll n;
ll a[MAX_N];
ll ans;
int main(void) {
// Here your code !
scanf("%lld", &n);
for (int i = 0; i < 5; ++i) {
scanf("%lld", &(a[i])... | [] | 894,480 | 894,481 | u497422208 | cpp |
p03077 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
if (n % min({a[0], a[1], a[2], a[3], a[4]}) == 0) {
cout << (n) / min... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
if (n % min({a[0], a[1], a[2], a[3], a[4]}) == 0) {
cout << (n) / min... | [
"literal.number.change",
"io.output.change"
] | 894,485 | 894,486 | u114838227 | cpp |
p03077 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
cout << ceil(n / min({a[0], a[1], a[2], a[3], a[4]})) + 5 << endl;
retu... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
cout << (n - 1) / min({a[0], a[1], a[2], a[3], a[4]}) + 5 << endl;
retu... | [
"call.arguments.change"
] | 894,487 | 894,488 | u114838227 | cpp |
p03077 | #include "math.h"
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main() {
long int N, A, B, C, D, E;
cin >> N;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
cin >> E;
long int minhuman = A;
if (B < minhuman) {
minhuman = B;
... | #include "math.h"
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main() {
long double N, A, B, C, D, E;
cin >> N;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
cin >> E;
long double minhuman = A;
if (B < minhuman) {
minhuman =... | [
"variable_declaration.type.primitive.change"
] | 894,493 | 894,494 | u313994303 | cpp |
p03077 | #include <iostream>
#include <string>
using namespace std;
int main() {
long long int N;
long long int CAP[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> CAP[i];
long long int min = CAP[0];
for (int i = 1; i < 5; i++)
if (min > CAP[i])
min = CAP[i];
long long int adtime = N / min;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
long long int N;
long long int CAP[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> CAP[i];
long long int min = CAP[0];
for (int i = 1; i < 5; i++)
if (min > CAP[i])
min = CAP[i];
long long int adtime = (N - 1) / mi... | [] | 894,495 | 894,496 | u783809618 | cpp |
p03077 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"type_conversion.add"
] | 894,503 | 894,504 | u874996917 | cpp |
p03077 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 894,505 | 894,504 | u874996917 | cpp |
p03077 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
long long int a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
long long int ans = ceil(n / (float)a[0]) - 1 + 5;
cout... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
long long int a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
long long int ans = ceil(n / (double)a[0]) - 1 + 5;
cou... | [
"variable_declaration.type.primitive.change"
] | 894,512 | 894,513 | u179987763 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"io.output.change"
] | 894,536 | 894,537 | u953532675 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,538 | 894,537 | u953532675 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 894,539 | 894,537 | u953532675 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 894,540 | 894,537 | u953532675 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c = 0, d, e, k, l, m, n, o = 1, p = 0, q, x, y, z, max1 = 0, ans = 0,
min1 = 10000000000000000;
string s, t, u;
ll a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (ll ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,543 | 894,537 | u953532675 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, mini = 10000000, a;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a;
mini = min(a, mini);
}
cout << 5 + (N / mini) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N, mini = 1000000000000001, a;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a;
mini = min(a, mini);
}
N--;
cout << 5 + (N / mini) << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.unary.arithmetic.add"
] | 894,544 | 894,545 | u239087789 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, mini = 10000000, a;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a;
mini = min(a, mini);
}
cout << 5 + (N / mini) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N, mini = 1000000000000001, a;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> a;
mini = min(a, mini);
}
N--;
cout << 5 + (N / mini) << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.unary.arithmetic.add"
] | 894,546 | 894,545 | u239087789 | cpp |
p03077 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, n[6];
cin >> N;
long long c; //一番小さいキャパ
for (int i = 0; i < 6; i++) {
cin >> n[i];
}
c = n[0];
for (int i = 1; i < 6; i++) {
if (c > n[i]) {
c = n[i];
}
}
long long t; //一番小さいキャパのところで何分かかるか
... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, n[5];
cin >> N;
long long c; //一番小さいキャパ
for (int i = 0; i < 5; i++) {
cin >> n[i];
}
c = n[0];
for (int i = 1; i < 5; i++) {
if (c > n[i]) {
c = n[i];
}
}
long long t; //一番小さいキャパのところで何分かかるか
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,547 | 894,548 | u942534145 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define PB push_back
#define ALL(v) (v).begin(), (v).end()
#define SZ size()
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR((i), 0, (n))
#define GET(a)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define PB push_back
#define ALL(v) (v).begin(), (v).end()
#define SZ size()
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR((i), 0, (n))
#define GET(a)... | [
"call.arguments.change"
] | 894,549 | 894,550 | u419383010 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int a[5], N, m = 10000000000000000;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> a[i];
m = min(a[i], m);
}
cout << N / m + 5 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int a[5], N, m = 10000000000000000;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> a[i];
m = min(a[i], m);
}
cout << (N - 1) / m + 5 << endl;
return 0;
}
| [] | 894,551 | 894,552 | u823974338 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll N;
ll M;
string s;
vector<ll> input1;
vector<vector<... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
double N;
ll M;
string s;
vector<ll> input1;
vector<vec... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 894,556 | 894,557 | u048791623 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a[5], time = 0;
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 <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a[5], time = 0;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5;
return 0;
} | [] | 894,558 | 894,559 | u203891294 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a[5], time = 0;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << time / a[0] + 5;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a[5], time = 0;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5;
return 0;
} | [
"io.output.change"
] | 894,560 | 894,559 | u203891294 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long N;
long trans[5];
long min_trans;
long time;
cin >> N;
for (int i = 0; i < 4; ++i) {
cin >> trans[i];
}
min_trans = N;
for (const long &tr : trans) {
min_trans = min(min_trans, tr);
}
time = 4 + N / min_tran... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
unsigned long N;
unsigned long trans[5];
unsigned long min_trans;
unsigned long time;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> trans[i];
}
min_trans = N;
for (unsigned long &tr : trans) {
min_trans = min(min_tra... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,561 | 894,562 | u969265031 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 4; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 4; ++i) {
min_trans = min(min_trans, trans[i]);
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
unsigned long N;
unsigned long trans[5];
unsigned long min_trans;
unsigned long time;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 5; ++i) {
min_trans = min(min_trans, ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,563 | 894,564 | u969265031 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N;
long long trans[5];
long long min_trans;
long long time;
cin >> N;
for (int i = 0; i < 4; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 5; ++i) {
min_trans = min(min_trans, trans[i]);
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
unsigned long N;
unsigned long trans[5];
unsigned long min_trans;
unsigned long time;
cin >> N;
for (int i = 0; i < 5; ++i) {
cin >> trans[i];
}
min_trans = N;
for (int i = 0; i < 5; ++i) {
min_trans = min(min_trans, ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 894,565 | 894,564 | u969265031 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.