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 <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [] | 892,959 | 892,960 | u946378574 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"literal.number.change",
"expression.operation.binary.change"
] | 892,963 | 892,964 | u255001744 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"literal.number.change",
"expression.operation.binary.change"
] | 892,965 | 892,964 | u255001744 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"assignment.change"
] | 892,966 | 892,964 | u255001744 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, a[5];
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
cout << setprecision(16) << 4 + ceil(n * 1.0 / a[0]);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
long long int n, a[5];
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
cout << setprecision(16) << 4 + ceil(n * 1.0 / a[0]);
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 892,967 | 892,968 | u340494803 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N, A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
cout << max... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
cout <... | [
"expression.operation.binary.add"
] | 892,976 | 892,977 | u489117389 | cpp |
p03077 | #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ll n, m;
ll Min = 1e18;
cin >> n;
... | #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
ll n, m;
ll Min = 1e18;
cin >> n;
in... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 892,978 | 892,979 | u066910956 | cpp |
p03077 | #include <bits/stdc++.h>
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin); i > (end); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.end(), greater<ll>())
#def... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin); i > (end); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.end(), greater<ll>())
#def... | [
"literal.number.change",
"io.output.change",
"expression.operation.binary.remove"
] | 892,984 | 892,985 | u973797979 | cpp |
p03077 | #include <algorithm>
#include <array>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef int value_type; /* ソートするキーの型 */
value_type med3(value_type x, value_... | #include <algorithm>
#include <array>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef int value_type; /* ソートするキーの型 */
value_type med3(value_type x, value_... | [] | 892,989 | 892,990 | u920434083 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long n, min = 1000000000000000, a[5];
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (min > a[i])
min = a[i];
}
int sub = 4;
if (n % min == 0)
sub++;
cout << n / min + sub << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n, min = 1000000000000000, a[5];
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (min > a[i])
min = a[i];
}
int sub = 5;
if (n % min == 0)
sub--;
cout << n / min + sub << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 892,993 | 892,994 | u112766430 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
... | [] | 892,997 | 892,998 | u507128581 | 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 f = 5 + (n + 1) / min(min(min(a, b), min(c, d)), e);
cout << f << 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 f = 5 + (n - 1) / min(min(min(a, b), min(c, d)), e);
cout << f << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 893,008 | 893,009 | u412025794 | 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 f = 5 + n / min(min(min(a, b), min(c, d)), e);
cout << f << 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 f = 5 + (n - 1) / min(min(min(a, b), min(c, d)), e);
cout << f << endl;
} | [] | 893,010 | 893,009 | u412025794 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
long f = 5 + n / min(min(min(a, b), min(c, d)), e);
cout << f << 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 f = 5 + (n - 1) / min(min(min(a, b), min(c, d)), e);
cout << f << endl;
} | [
"variable_declaration.type.widen.change"
] | 893,011 | 893,009 | u412025794 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << ceil(n / min({a, b, c, d, e})) + 4 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long long n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << (n - 1) / min({a, b, c, d, e}) + 5 << endl;
return 0;
}
| [
"call.arguments.change",
"literal.number.change",
"io.output.change"
] | 893,024 | 893,025 | u256027816 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >>... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >>... | [
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 893,034 | 893,035 | u673474826 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, A, B, C, D, E;
cin >> N >> A >> B >... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N, A, B, C, D, E;
cin >> N >> A >> B >>... | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 893,036 | 893,035 | u673474826 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, m = pow(10, 15) + 500;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> t;
m = min(m, t);
}
long long ans = (long long)floor(n / m);
cout << ans + 5;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, m = pow(10, 16);
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> t;
m = min(m, t);
}
long long ans = (long long)ceil(n / m);
cout << ans + 4;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 893,039 | 893,040 | u443404767 | cpp |
p03077 | #include <algorithm>
#include <cstdint>
#include <iostream>
auto main() -> int {
std::int64_t N;
std::cin >> N;
std::int64_t ms[5];
for (int i = 0; i < 5; ++i) {
std::cin >> ms[i];
}
const auto m = std::min_element(std::begin(ms), std::end(ms));
std::cout << ((N / *m) + 5) << "\n";
}
| #include <algorithm>
#include <cstdint>
#include <iostream>
auto main() -> int {
std::int64_t N;
std::cin >> N;
std::int64_t ms[5];
for (int i = 0; i < 5; ++i) {
std::cin >> ms[i];
}
const auto m = std::min_element(std::begin(ms), std::end(ms));
std::cout << (((N - 1) / *m) + 5) << "\n";
}
| [] | 893,041 | 893,042 | u646965135 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
// your code goes here
long int N, trans[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans[i];
}
long int min = trans[0];
for (int i = 1; i < 5; i++) {
if (min > trans[i])
min = trans[i];
}
cout << 5 + N ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
// your code goes here
long int N, trans[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans[i];
}
long int min = trans[0];
for (int i = 1; i < 5; i++) {
if (min > trans[i])
min = trans[i];
}
cout << 5 + (N... | [] | 893,043 | 893,044 | u939903905 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, E, X;
cin >> N >> A >> B >> C >> D >> E;
X = min(A, min(B, min(C, min(D, E))));
if (N % X != 0) {
cout << N / X + 5 << endl;
} else {
cout << N / X + 4 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, C, D, E, X;
cin >> N >> A >> B >> C >> D >> E;
X = min(A, min(B, min(C, min(D, E))));
if (N % X != 0) {
cout << N / X + 5 << endl;
} else {
cout << N / X + 4 << endl;
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,045 | 893,046 | u717501752 | cpp |
p03077 | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <ve... | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <ve... | [
"variable_declaration.type.change",
"call.add",
"literal.number.change",
"io.output.change",
"call.arguments.change"
] | 893,049 | 893,050 | u226951654 | cpp |
p03077 | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <ve... | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <ve... | [
"variable_declaration.type.change",
"call.arguments.change",
"literal.number.change",
"io.output.change"
] | 893,051 | 893,050 | u226951654 | cpp |
p03077 | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <ve... | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <ve... | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change"
] | 893,052 | 893,050 | u226951654 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pi;
#define trace(x) cout << #x << "... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pi;
#define trace(x) cout << #x << "... | [] | 893,055 | 893,056 | u946432910 | cpp |
p03077 | // #pragma GCC optimize ("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
// #include <type_traits>
using namespace std;
// using namespace __gnu_pbds;
// using namespace __g... | // #pragma GCC optimize ("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
// #include <type_traits>
using namespace std;
// using namespace __gnu_pbds;
// using namespace __g... | [] | 893,067 | 893,068 | u408927978 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 893,069 | 893,070 | u650565403 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | [
"type_conversion.add"
] | 893,071 | 893,070 | u650565403 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a, b, c, d, e, x, ans;
cin >> n >> a >> b >> c >> d >> e;
x = min(min(min(min(a, b), c), d), e);
ans = (n - 1) / x + 5;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
long long n, a, b, c, d, e, x, ans;
cin >> n >> a >> b >> c >> d >> e;
x = min(min(min(min(a, b), c), d), e);
ans = (n - 1) / x + 5;
cout << ans <<... | [
"preprocessor.define.value.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 893,072 | 893,073 | u352228045 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
long long roundup(long long N, long long a) {
long long result;
if (N % a == 0) {
return N / a;
} else {
return N / a + N - N % a;
}
}
int main() {
long long N;
vector<long long> a(5);
vector<long long> b(5);
cin >> N;
long long m = 0;
for (i... | #include <bits/stdc++.h>
using namespace std;
long long roundup(long long N, long long a) {
long long result;
if (N % a == 0) {
return N / a;
} else {
return N / a + 1;
}
}
int main() {
long long N;
vector<long long> a(5);
vector<long long> b(5);
cin >> N;
long long m = 0;
for (int i = 0... | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 893,074 | 893,075 | u311517735 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, x, mn = 123;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> x;
mn = min(x, mn);
}
cout << n / mn + (n % mn == 0 ? 4 : 5) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, x, mn = 1e+16;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> x;
mn = min(x, mn);
}
cout << n / mn + (n % mn == 0 ? 4 : 5) << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 893,080 | 893,081 | u798086274 | cpp |
p03077 | #define ll long long
#define vv(t) vector<vector<t>>
#define v(t) vector<t>
#define vvi vector<vector<int>>
#define vi vector<int>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#include <algorithm>
#include... | #define ll long long
#define vv(t) vector<vector<t>>
#define v(t) vector<t>
#define vvi vector<vector<int>>
#define vi vector<int>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#include <algorithm>
#include... | [] | 893,094 | 893,095 | u602301472 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define kuriage(x) x += 10 - x % 10;
#define mod(cans) cans % 10 * *9 + 7;
#define vecin(x, y) \
for (int i = 0; i < x; i++) { \
c... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define kuriage(x) x += 10 - x % 10;
#define mod(cans) cans % 10 * *9 + 7;
#define vecin(x, y) \
for (int i = 0; i < x; i++) { \
c... | [] | 893,103 | 893,104 | u001577246 | cpp |
p03077 | #include <cstdio>
#include <string>
using namespace std;
#define COUNT 5
int main(void) {
int a, b, c, d, e;
long long int n;
long long int capa[COUNT];
int i;
scanf("%lld", &n);
for (i = 0; i < COUNT; i++) {
scanf("%d", &capa[i]);
}
long long int minCapa = capa[0];
for (i = 1; i < COUNT; i++) ... | #include <cstdio>
#include <string>
using namespace std;
#define COUNT 5
int main(void) {
int a, b, c, d, e;
long long int n;
long long int capa[COUNT];
int i;
scanf("%lld", &n);
for (i = 0; i < COUNT; i++) {
scanf("%lld", &capa[i]);
}
long long int minCapa = capa[0];
for (i = 1; i < COUNT; i++... | [
"literal.string.change",
"call.arguments.change"
] | 893,110 | 893,111 | u925478083 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
ll n, a, b, c, d, e, ans = 5;
cin >> n >> a >> b >> c >> d >> e;
ans += n /
max({(n - 1) / a, (n - 1) / b, (n - 1) / c, (n - 1) / d, (n - 1) / e});
cout << ans << en... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
ll n, a, b, c, d, e, ans = 5;
cin >> n >> a >> b >> c >> d >> e;
ans += max({(n - 1) / a, (n - 1) / b, (n - 1) / c, (n - 1) / d, (n - 1) / e});
cout << ans << endl;
return ... | [
"expression.operation.binary.remove"
] | 893,120 | 893,121 | u997023236 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<unsigned long> a(5);
vector<unsigned long> c(5);
unsigned long n;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
c[0] = n;
for (unsigned long i = 0; i < 5; i++) {
c[i] = (unsigned ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<unsigned long> a(5);
vector<unsigned long> c(5);
unsigned long n;
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
c[0] = n;
for (unsigned long i = 0; i < 5; i++) {
c[i] = (unsigned ... | [
"literal.number.change",
"assignment.value.change"
] | 893,122 | 893,123 | u234531758 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
void solve(long long N, long long A, long long B, long long C, long long D,
long long E) {
vector<ll> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
vec.push_back(D);
v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
void solve(long long N, long long A, long long B, long long C, long long D,
long long E) {
vector<ll> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
vec.push_back(D);
v... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 893,126 | 893,127 | u302684639 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
void solve(long long N, long long A, long long B, long long C, long long D,
long long E) {
vector<ll> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
vec.push_back(D);
v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
void solve(long long N, long long A, long long B, long long C, long long D,
long long E) {
vector<ll> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
vec.push_back(D);
v... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 893,128 | 893,127 | u302684639 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long a;
cin >> n >> a;
long long m = a;
for (int i = 0; i < 4; i++) {
cin >> a;
m = min(m, a);
}
cout << n / m + 5 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long a;
cin >> n >> a;
long long m = a;
for (int i = 0; i < 4; i++) {
cin >> a;
m = min(m, a);
}
cout << (n - 1) / m + 5 << endl;
}
| [] | 893,140 | 893,141 | u685726857 | cpp |
p03077 | #include <iostream>
using namespace std;
#define CAP_MIN 1000000000000001
int main(void) {
long long n, capacity[5];
// long long cap_min = long long(pow(10, 15))+1;
long long cap_min = CAP_MIN;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
if (cap_min > capacity[i]) {
cap_min = c... | #include <iostream>
using namespace std;
#define CAP_MIN 1000000000000001
int main(void) {
long long n, capacity[5];
// long long cap_min = long long(pow(10, 15))+1;
long long cap_min = CAP_MIN;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
if (cap_min > capacity[i]) {
cap_min = c... | [] | 893,142 | 893,143 | u728082661 | cpp |
p03077 | #include <iostream>
using namespace std;
#define CAP_MIN 1000000000000001
int main(void) {
long long n, capacity[5];
// long long cap_min = long long(pow(10, 15))+1;
long long cap_min = CAP_MIN;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
if (cap_min > capacity[i]) {
cap_min = c... | #include <iostream>
using namespace std;
#define CAP_MIN 1000000000000001
int main(void) {
long long n, capacity[5];
// long long cap_min = long long(pow(10, 15))+1;
long long cap_min = CAP_MIN;
cin >> n;
for (int i = 0; i < 5; i++) {
cin >> capacity[i];
if (cap_min > capacity[i]) {
cap_min = c... | [] | 893,144 | 893,143 | u728082661 | cpp |
p03077 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 893,145 | 893,146 | u791593901 | cpp |
p03077 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL... | #include <bits/stdc++.h>
//#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL... | [
"expression.unary.arithmetic.add"
] | 893,151 | 893,152 | u544732702 | cpp |
p03077 |
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
long long int n;
scanf("%lld", &n);
long long int c[5];
for (int i = 0; i < 5; i++) {
scanf("%d", &c[i]);
}
long long int min_c = c[0];
for (int i = 0; i < 5; i++) {
min_c = min(min_c, c[i]);
}
printf("%lld\n", (n + m... |
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
long long int n;
scanf("%lld", &n);
long long int c[5];
for (int i = 0; i < 5; i++) {
scanf("%lld", &c[i]);
}
long long int min_c = c[0];
for (int i = 0; i < 5; i++) {
min_c = min(min_c, c[i]);
}
printf("%lld\n", (n +... | [
"literal.string.change",
"call.arguments.change"
] | 893,153 | 893,154 | u289709148 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long sum, temp, min;
cin >> sum >> min;
for (int i = 0; i < 4; i++) {
cin >> temp;
if (temp < min)
min = temp;
}
cout << 5 + (sum + min - 1) / min << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long sum, temp, min;
cin >> sum >> min;
for (int i = 0; i < 4; i++) {
cin >> temp;
if (temp < min)
min = temp;
}
cout << 4 + (sum + min - 1) / min << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 893,162 | 893,163 | u905802918 | cpp |
p03077 | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
ll N, A[5];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
REP(i, 5) cin >> A[i];
ll mn = *min_element(A, A + 5);
cout << 5 + N / mn << endl... | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
ll N, A[5];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
REP(i, 5) cin >> A[i];
ll mn = *min_element(A, A + 5);
cout << 5 + (N - 1) / mn <... | [] | 893,168 | 893,169 | u533920479 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int a[5] = {A, B, C, D, E};
sort(a, a + 5);
cout << N / a[0] + 5;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long int a[5] = {A, B, C, D, E};
sort(a, a + 5);
cout << (N - 1) / a[0] + 5;
} | [] | 893,170 | 893,171 | u582357587 | cpp |
p03077 | #include <stdio.h>
int main() {
long long N;
long long move[5];
scanf("%lld", &N);
scanf("%lld", &move[0]);
long long min = move[0];
for (int i = 0; i < 5; i++) {
scanf("%lld", &move[i]);
if (min > move[i]) {
min = move[i];
}
}
long long ans = ((N + min - 1) / min) + 4;
printf("%lld\... | #include <stdio.h>
int main() {
long long N;
long long move[5];
scanf("%lld", &N);
scanf("%lld", &move[0]);
long long min = move[0];
for (int i = 1; i < 5; i++) {
scanf("%lld", &move[i]);
if (min > move[i]) {
min = move[i];
}
}
long long ans = ((N + min - 1) / min) + 4;
printf("%lld\... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 893,172 | 893,173 | u303722032 | cpp |
p03077 | #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) ... | [
"variable_declaration.value.change"
] | 893,180 | 893,181 | u040490988 | cpp |
p03077 | #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) ... | [
"variable_declaration.value.change"
] | 893,182 | 893,181 | u040490988 | cpp |
p03077 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int i;
long long min = 0;
long long a;
long double N;
long long T;
long double t;
long long ANS;
vector<long long> A;
cin >> N;
for (i = 0; i < 5; i++)... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int i;
long long min = 0;
long long a;
long double N;
long long T;
long double t;
long long ANS;
vector<long long> A;
cin >> N;
for (i = 0; i < 5; i++)... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 893,183 | 893,184 | u230139835 | cpp |
p03077 | #include <cstring>
#include <iostream>
//#include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#define si(a) scanf("%d", &a)
#define sl(a) scanf("%lld", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define sll(a, b) scanf("%lld%ll... | #include <cstring>
#include <iostream>
//#include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#define si(a) scanf("%d", &a)
#define sl(a) scanf("%lld", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define sll(a, b) scanf("%lld%ll... | [
"variable_declaration.type.change"
] | 893,187 | 893,188 | u114362525 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B, C, D, E, m;
cin >> N >> A >> B >> C >> D >> E;
m = min(N, min(A, min(B, min(C, min(D, E)))));
if (m % N == 0)
cout << 4 + N / m << endl;
else
cout << 5 + N / m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B, C, D, E, m;
cin >> N >> A >> B >> C >> D >> E;
m = min(N, min(A, min(B, min(C, min(D, E)))));
if (N % m == 0)
cout << 4 + N / m << endl;
else
cout << 5 + N / m << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 893,196 | 893,197 | u732571394 | cpp |
p03077 | #include <iostream>
using namespace std;
#define LL long long
int main() {
LL n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
a = min(a, b);
a = min(a, c);
a = min(a, d);
a = min(a, e);
cout << (n + a - 1) / a << '\n';
return 0;
} | #include <iostream>
using namespace std;
#define LL long long
int main() {
LL n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
a = min(a, b);
a = min(a, c);
a = min(a, d);
a = min(a, e);
cout << (n + a - 1) / a + 4 << '\n';
return 0;
} | [
"expression.operation.binary.add"
] | 893,202 | 893,203 | u440556285 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<long long> n(5);
long long k, ans;
std::cin >> k;
for (int i = 0; i < 5; i++) {
std::cin >> n[i];
}
ans = k / *(std::min_element(n.begin(), n.end())) + 5;
std::cout << ans << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<long long> n(5);
long long k, ans;
std::cin >> k;
for (int i = 0; i < 5; i++) {
std::cin >> n[i];
}
ans = (k - 1) / *(std::min_element(n.begin(), n.end())) + 5;
std::cout << ans << std::endl;
return 0;
} | [] | 893,206 | 893,207 | u133607477 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
#define NUM 5
int main(void) {
LL N, a[NUM];
cin >> N;
for (int i = 0; i < NUM; i++) {
cin >> a[i];
}
cout << 4 + ceil((doub... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
#define NUM 5
int main(void) {
LL N, a[NUM];
cin >> N;
for (int i = 0; i < NUM; i++) {
cin >> a[i];
}
cout << (LL)(4 + ceil(... | [
"call.add",
"call.arguments.change"
] | 893,215 | 893,216 | u843830192 | cpp |
p03077 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 893,226 | 893,227 | u696415377 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
double A;
double minimum = 0;
for (int i = 0; i < 5; i++) {
cin >> A;
minimum = min(minimum, A);
}
cout << (long long)ceil(N / minimum) + 4 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
double A;
double minimum = 10000000000000010LL;
for (int i = 0; i < 5; i++) {
cin >> A;
minimum = min(minimum, A);
}
cout << (long long)ceil(N / minimum) + 4 << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"literal.number.type.widen.change"
] | 893,236 | 893,237 | u609576113 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | [
"call.add",
"io.output.change",
"call.arguments.change",
"literal.number.change"
] | 893,250 | 893,251 | u164300951 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | [] | 893,250 | 893,252 | u164300951 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
long n, a, b, c, d, e, m;
cin >> n >> a >> b >> c >> d >> e;
m = min({a, b, c, d, e});
// cout << "min:" << m << endl;
cout << setprecision(10) << ceil((double)n / m) + 4 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
long n, a, b, c, d, e, m;
cin >> n >> a >> b >> c >> d >> e;
m = min({a, b, c, d, e});
// cout << "min:" << m << endl;
cout << setprecision(16) << ceil((double)n / m) + 4 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 893,253 | 893,254 | u477694598 | cpp |
p03077 | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 893,259 | 893,260 | u698760125 | cpp |
p03077 | #include <iostream>
using namespace std;
long long int mini(long long int a, long long int b) {
return ((b == 0) ? a : (a < b) ? a : b);
}
int main() {
long long int a[5] = {}, N = 0;
long long int ans = 0;
long long int min = 1000000000000001;
// int minum = 0,tmp = 0;
cin >> N;
for (int i = 0; i < 5; ... | #include <iostream>
using namespace std;
long long int mini(long long int a, long long int b) {
return ((b == 0) ? a : (a < b) ? a : b);
}
int main() {
long long int a[5] = {}, N = 0;
long long int ans = 0;
long long int min = 1000000000000001;
// int minum = 0,tmp = 0;
cin >> N;
for (int i = 0; i < 5; ... | [] | 893,261 | 893,262 | u444349080 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n"
#define ll long long
int main() {
ll n;
vector<ll> a(5);
cin >> n;
REP(i, 5) cin >> a[i];... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n"
#define ll long long
int main() {
ll n;
vector<ll> a(5);
cin >> n;
REP(i, 5) cin >> a[i];... | [
"expression.operation.binary.remove"
] | 893,270 | 893,271 | u860374704 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n"
#define ll long long
int main() {
int n;
vector<int> a(5);
cin >> n;
REP(i, 5) cin >> a[i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n"
#define ll long long
int main() {
ll n;
vector<ll> a(5);
cin >> n;
REP(i, 5) cin >> a[i];... | [
"variable_declaration.type.change"
] | 893,272 | 893,271 | u860374704 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define fore(i, s, e) for (int i = s; i < e; i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[5];
fore(i, 0, 5) cin >> a[i];
sort(a, a + 5);
cout << 5 + n / a[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fore(i, s, e) for (int i = s; i < e; i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[5];
fore(i, 0, 5) cin >> a[i];
sort(a, a + 5);
cout << 5 + (n - 1) / a[0] << endl;
return 0;
} | [] | 893,275 | 893,276 | u783593194 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef ... | [] | 893,279 | 893,280 | u644070128 | cpp |
p03077 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#... | [
"type_conversion.add"
] | 893,283 | 893,284 | u800551451 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long ca[5];
long long N;
cin >> N;
for (int i = 0; i < 5; i++)
cin >> ca[i];
long long min = ca[0];
long long ans;
for (int i = 0; i < 5; i++) {
if (min > ca[i])
min = ca[i];
}
ans = N / min;
if (N % min)
ans++;
cout << a... | #include <iostream>
using namespace std;
int main() {
long long ca[5];
long long N;
cin >> N;
for (int i = 0; i < 5; i++)
cin >> ca[i];
long long min = ca[0];
long long ans;
for (int i = 0; i < 5; i++) {
if (min > ca[i])
min = ca[i];
}
ans = N / min;
if (N % min)
ans++;
ans += 4;... | [
"assignment.add"
] | 893,292 | 893,293 | u058186113 | cpp |
p03077 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | [
"expression.operation.binary.change",
"assignment.change"
] | 893,307 | 893,308 | u566864240 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | [
"variable_declaration.value.change"
] | 893,315 | 893,316 | u666394517 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 893,331 | 893,332 | u212904724 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
void solveA() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
void solveB() {
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
int min = 9;
int minad = ... | #include <bits/stdc++.h>
using namespace std;
void solveA() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
}
void solveB() {
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
int min = 9;
int minad = ... | [] | 893,333 | 893,334 | u735499035 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | [] | 893,336 | 893,337 | u049420296 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
int main() {
int i, j, k, m, l, f, x, ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
int main() {
int i, j, k, m, l, f, x, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 893,338 | 893,339 | u854612287 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
int main() {
int i, j, k, m, l, f, x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
int main() {
int i, j, k, m, l, f, x, ... | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 893,340 | 893,339 | u854612287 | cpp |
p03077 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
long long a[10];
while (cin >> n) {
for (int i =... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
long long a[10];
while (cin >> n) {
for (int i =... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 893,347 | 893,348 | u234252849 | cpp |
p03077 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> a(5);
long long i, n;
cin >> n;
for (i = 0; i < 5; ++i) {
cin >> a.at(i);
}
long long min = a.at(0);
for (i = 1; i < 5; ++i) {
if (min > a.at(i)) {
min = a.at(i);
}
}
if (min % n) {
cout <<... | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> a(5);
long long i, n;
cin >> n;
for (i = 0; i < 5; ++i) {
cin >> a.at(i);
}
long long min = a.at(0);
for (i = 1; i < 5; ++i) {
if (min > a.at(i)) {
min = a.at(i);
}
}
if (n % min) {
cout <<... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 893,355 | 893,356 | u446795710 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* define const */
const long long INF = (... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* define const */
const long long INF = (... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 893,357 | 893,358 | u218759384 | cpp |
p03077 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll a[5], n, t;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
if (n > a[0]) {
if (n / a[0] == 0)
t = n / a[0];
else
t = n / a[0] + 1;
} else if (n <= a[0])
t = 1;
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll a[5], n, t;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> a[i];
sort(a, a + 5);
if (n > a[0]) {
if (n % a[0] == 0)
t = n / a[0];
else
t = n / a[0] + 1;
} else if (n <= a[0])
t = 1;... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 893,363 | 893,364 | u543120093 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 300010
ll n, a, b, c, d, e;
int main() {
cin >> n >> a >> b >> c >> d >> e;
ll ans = 0;
a = min(a, min(b, min(c, d)));
a = min(a, e);
ans = ceil(n / a) + 5ll;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 300010
ll n, a, b, c, d, e;
int main() {
cin >> n >> a >> b >> c >> d >> e;
ll ans = 0;
a = min(a, min(b, min(c, d)));
a = min(a, e);
ans = (n - 1) / a + 5ll;
cout << ans;
} | [
"call.arguments.change"
] | 893,368 | 893,369 | u993519359 | cpp |
p03077 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | [] | 893,373 | 893,374 | u334624175 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | [
"expression.operation.binary.remove"
] | 893,375 | 893,376 | u141378465 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, ... | [
"io.output.change"
] | 893,377 | 893,378 | u277556971 | cpp |
p03077 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | [] | 893,379 | 893,380 | u962966398 | cpp |
p03077 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int x = 0;
if (n % min(a, min(b, min(c, min(d, e)))) != 0... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int x = 0;
if (n % min(a, min(b, min(c, min(d, e)))) != 0)... | [
"variable_declaration.type.change"
] | 893,388 | 893,389 | u678503521 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repbit(n) for (ll bit = 0, bit < (1 << n), bit++)
i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repbit(n) for (ll bit = 0, bit < (1 << n), bit++)
i... | [] | 893,396 | 893,397 | u356489231 | cpp |
p03077 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
long long n;
std::vector<long long> aList(5);
std::cin >> n;
for (int i = 0; i < 5; i++)
std::cin >> aList[i];
std::sort(aList.begin(), aList.end());
long long ans = n / aList[0] + 5;
if (n % aList[0] == 0)
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
long long n;
std::vector<long long> aList(5);
std::cin >> n;
for (int i = 0; i < 5; i++)
std::cin >> aList[i];
std::sort(aList.begin(), aList.end());
long long ans = n / aList[0] + 5;
if (n % aList[0] == 0)
... | [] | 893,412 | 893,413 | u865621256 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define l... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define l... | [] | 893,414 | 893,415 | u235155157 | cpp |
p03077 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define l... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define l... | [
"literal.number.type.widen.change"
] | 893,416 | 893,415 | u235155157 | cpp |
p03077 | #include <iostream>
using namespace std;
int MinIndex(const unsigned long long int *const array, const int size);
int main() {
unsigned long long int N;
unsigned long long int board[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> board[i];
int bottleNeckIndex = MinIndex(board, sizeof(board));
uns... | #include <iostream>
using namespace std;
int MinIndex(const unsigned long long int *const array, const int size);
int main() {
unsigned long long int N;
unsigned long long int board[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> board[i];
int bottleNeckIndex = MinIndex(board, 5);
unsigned long l... | [
"call.arguments.change"
] | 893,423 | 893,424 | u045289957 | cpp |
p03077 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#define P pair
// stoi(s): string to i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#define P pair
// stoi(s): string to i... | [
"assignment.change"
] | 893,425 | 893,426 | u493080913 | cpp |
p03077 | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queu... | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queu... | [] | 893,438 | 893,439 | u692176965 | cpp |
p03077 | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queu... | // ~/Remember,remember the 6th of March
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queu... | [
"expression.operation.binary.remove"
] | 893,440 | 893,439 | u692176965 | cpp |
p03077 | #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long N;
vector<unsigned long long> trans(5);
unsigned long long time = 0;
int min_i = 0;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans[i];
}
sort(trans.begin(), trans... | #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long N;
vector<unsigned long long> trans(5);
unsigned long long time = 0;
int min_i = 0;
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans[i];
}
sort(trans.begin(), trans... | [] | 893,444 | 893,445 | u774910314 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
int n[8];
n[7] = 1;
n[6] = 0;
for (int i = 0; i < 6; i++) {
cin >> n[i];
}
for (int j = 2; j < 6; j++) {
if (n[1] > n[j]) {
n[7] = j;
n[6] = n[1];
n[1] = n[j];
n[j] = n[6];
} else {
}
}
int a;
if (n[0] % n[1]... | #include <iostream>
using namespace std;
int main() {
long n[8];
n[7] = 1;
n[6] = 0;
for (int i = 0; i < 6; i++) {
cin >> n[i];
}
for (int j = 2; j < 6; j++) {
if (n[1] > n[j]) {
n[7] = j;
n[6] = n[1];
n[1] = n[j];
n[j] = n[6];
} else {
}
}
long a;
if (n[0] % n[... | [
"variable_declaration.type.primitive.change"
] | 893,462 | 893,463 | u461896927 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k + 1) / k + 4;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k - 1) / k + 4;
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 893,464 | 893,465 | u684556267 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k) / k + 4;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k - 1) / k + 4;
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 893,466 | 893,465 | u684556267 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + 1) / k + 4;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long N, k, ans;
long A[5];
cin >> N;
k = N;
for (int i = 0; i < 5; ++i) {
cin >> A[i];
if (k > A[i])
k = A[i];
}
if (k == N)
ans = 5;
else
ans = (N + k - 1) / k + 4;
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 893,467 | 893,465 | u684556267 | cpp |
p03077 | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long a;
cin >> a;
for (int i = 1; i < 5; i++) {
long long temp;
cin >> temp;
if (temp < a)
a = temp;
}
if (n < a)
cout << 5;
else {
long long time = n / a + 4;
if (n & a == 0)
cout <... | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long a;
cin >> a;
for (int i = 1; i < 5; i++) {
long long temp;
cin >> temp;
if (temp < a)
a = temp;
}
if (n <= a)
cout << 5;
else {
long long time = n / a + 4;
if (n % a == 0)
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 893,470 | 893,471 | u606107557 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.