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 |
|---|---|---|---|---|---|---|---|
p03699 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int total = 0, min = -1;
REP(i, n) {
int s;
cin >> s;
if (s % 10 != 0 && s < min) {
min = s;
}
total += s;
}... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int total = 0, min = 101;
REP(i, n) {
int s;
cin >> s;
if (s % 10 != 0 && s < min) {
min = s;
}
total += s;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 1,371,588 | 1,371,589 | u111998129 | cpp |
p03699 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
#define NMAX 102
//コメントアウトするとdebug()を実行しない
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
#define NMAX 102
//コメントアウトするとdebug()を実行しない
#de... | [
"call.add"
] | 1,371,594 | 1,371,595 | u389055093 | cpp |
p03699 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int s[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
sum += s[i];
}
sort(s, s + N);
// 解答
if (sum % 10 != 0) {
cout << sum << endl;
} else {
bool flag = false;
for (int i = ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int s[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
sum += s[i];
}
sort(s, s + N);
// 解答
if (sum % 10 != 0) {
cout << sum << endl;
} else {
bool flag = false;
for (int i = ... | [
"control_flow.branch.if.add"
] | 1,371,596 | 1,371,597 | u063020782 | cpp |
p03699 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | [
"control_flow.branch.else.remove"
] | 1,371,600 | 1,371,601 | u026730198 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
vector<int> nn;
int n;
cin >> n;
int answer;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
nn.push_back(s);
}
sort(nn.begin(), nn.end());
answer = accumulate(nn.begin(), nn.en... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
vector<int> nn;
int n;
cin >> n;
int answer;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
nn.push_back(s);
}
sort(nn.begin(), nn.end());
answer = accumulate(nn.begin(), nn.en... | [
"control_flow.branch.if.condition.change"
] | 1,371,617 | 1,371,618 | u384877958 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
... | [
"variable_declaration.type.change"
] | 1,371,624 | 1,371,625 | u084949493 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a, b;
cin >> n >> a >> b;
vector<ll> h(n);
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a, b;
cin >> n >> a >> b;
vector<ll> h(n);
rep(i, ... | [
"call.add",
"literal.number.change",
"expression.operation.binary.change"
] | 1,371,626 | 1,371,627 | u455067221 | cpp |
p03700 | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include <bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
// using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len... | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include <bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
// using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len... | [] | 1,371,632 | 1,371,633 | u639426108 | cpp |
p03700 | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include <bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
// using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len... | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include <bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
// using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len... | [] | 1,371,634 | 1,371,633 | u639426108 | cpp |
p03700 | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include <bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
// using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len... | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include <bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
// using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,371,635 | 1,371,633 | u639426108 | cpp |
p03700 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
struct edge {
ll to;
ll cost;
};
using graph = vector<vector<edge>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
struct edge {
ll to;
ll cost;
};
using graph = vector<vector<edge>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,371,653 | 1,371,654 | u449123607 | cpp |
p03700 | // xtwakioi! xtwddYnoi(双重含义)!
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n + 1)
using namespace std;
const int N = 400010;
inline int read() {
int s = 0, w = 1;
ri char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
whil... | // xtwakioi! xtwddYnoi(双重含义)!
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n + 1)
using namespace std;
const int N = 400010;
inline int read() {
int s = 0, w = 1;
ri char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
whil... | [
"expression.operation.binary.remove"
] | 1,371,657 | 1,371,658 | u499810514 | cpp |
p03700 | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | [
"call.add",
"call.arguments.change"
] | 1,371,664 | 1,371,665 | u818349438 | cpp |
p03700 | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
#define fi first
#define se second
#define pb push_back
#define wzh(x) cerr << #x << '=' << x << endl;
int n, a, b;
int h[N];
int main() {
ios::sync_with_stdio(false);
cin >> n... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
#define fi first
#define se second
#define pb push_back
#define wzh(x) cerr << #x << '=' << x << endl;
int n, a, b;
int h[N];
int main() {
ios::sync_with_stdio(false);
cin >> n... | [] | 1,371,687 | 1,371,688 | u862237347 | cpp |
p03700 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
t... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
t... | [
"call.add",
"call.arguments.change"
] | 1,371,728 | 1,371,729 | u622045059 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 1,371,741 | 1,371,743 | u303884911 | cpp |
p03700 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAX = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, A, B, ans = 0, tmp = 0;
vector<ll> H;
signed main() {
cin >> N >> A >> B;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
H.push_b... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAX = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, A, B, ans = 0, tmp = 0;
vector<ll> H;
signed main() {
cin >> N >> A >> B;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
H.push_b... | [
"call.add",
"call.arguments.change"
] | 1,371,753 | 1,371,754 | u132452589 | cpp |
p03700 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
ll A, B;
cin >> N >> A >> B;
ll h[N];
ll mx_h = -1;
for (int i = 0; i < N; i++) {
cin >> h[i];
mx_h = max(mx_h, h[i]);
}
ll left... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
ll A, B;
cin >> N >> A >> B;
ll h[N];
ll mx_h = -1;
for (int i = 0; i < N; i++) {
cin >> h[i];
mx_h = max(mx_h, h[i]);
}
ll left... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,371,758 | 1,371,759 | u083494782 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9 + 7;
... | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9 + 7;
... | [] | 1,371,760 | 1,371,761 | u642657797 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a, b;
ll h[100005];
bool isok(ll key) {
ll count = 0;
for (ll i = 0; i < n; i++) {
count += (h[i] - (b * key) + a - b - 1) / (a - b);
}
return count <= key;
}
int main() {
cin >> n >> a >> b;
for (ll i = 0; i < n; i++)
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a, b;
ll h[100005];
bool isok(ll key) {
ll count = 0;
for (ll i = 0; i < n; i++) {
count += max((h[i] - (b * key) + a - b - 1) / (a - b), 0LL);
}
return count <= key;
}
int main() {
cin >> n >> a >> b;
for (ll i = 0; i < n; i++... | [
"call.add",
"call.arguments.add"
] | 1,371,768 | 1,371,769 | u955282280 | cpp |
p03700 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#... | [
"literal.number.change",
"io.output.change"
] | 1,371,770 | 1,371,771 | u385244248 | cpp |
p03700 | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,371,779 | 1,371,780 | u548791035 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
int N, A, B;
vector<long> H;
bool f(int mid) {
vector<long> V = H;
for (auto &v : V)
v -= (long)B * mid;
int cnt = 0, tmp = A - B;
for (auto v : V)
if (v > 0)
cnt += (v + tmp - 1) / tmp;
return (cnt <= mid) ? true : false;
}
int main() {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
long N, A, B;
vector<long> H;
bool f(int mid) {
vector<long> V = H;
for (auto &v : V)
v -= B * mid;
long cnt = 0, tmp = A - B;
for (auto v : V)
if (v > 0)
cnt += (v + tmp - 1) / tmp;
return (cnt <= mid) ? true : false;
}
int main() {
cin >> N >>... | [
"variable_declaration.type.primitive.change"
] | 1,371,781 | 1,371,782 | u045289115 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
int N, A, B;
vector<long> H;
bool f(int mid) {
vector<long> V = H;
for (auto &v : V)
v -= (long)B * mid;
int cnt = 0, tmp = A - B;
for (auto v : V)
if (v > 0)
cnt += (v + tmp - 1) / tmp;
return (cnt <= mid) ? true : false;
}
int main() {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
long N, A, B;
vector<long> H;
bool f(int mid) {
vector<long> V = H;
for (auto &v : V)
v -= (long)B * mid;
long cnt = 0, tmp = A - B;
for (auto v : V)
if (v > 0)
cnt += (v + tmp - 1) / tmp;
return (cnt <= mid) ? true : false;
}
int main() {
cin >... | [
"variable_declaration.type.primitive.change"
] | 1,371,781 | 1,371,783 | u045289115 | cpp |
p03700 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010, M = 110;
int n;
LL A, B;
LL a[N];
bool check(LL x) {
LL cnt = 0;
for (int i = 1; i <= n; i++)
cnt += (a[i] - x * B + A - B - 1) / (A - B);
return cnt <= ... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010, M = 110;
int n;
LL A, B;
LL a[N];
bool check(LL x) {
LL cnt = 0;
for (int i = 1; i <= n; i++)
cnt += max(0LL, (a[i] - x * B + A - B - 1) / (A - B));
retu... | [
"call.add",
"call.arguments.change"
] | 1,371,786 | 1,371,787 | u866538547 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << ... | [
"control_flow.branch.if.condition.change"
] | 1,371,795 | 1,371,796 | u298620933 | cpp |
p03700 | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
// problink link : https://atcoder.jp/contests/abc063/tasks/arc075_b
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
// problink link : https://atcoder.jp/contests/abc063/tasks/arc075_b
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#... | [
"expression.operation.binary.remove"
] | 1,371,813 | 1,371,814 | u931901821 | cpp |
p03700 |
// Problem : D - Widespread
// Contest : AtCoder - AtCoder Beginner Contest 063
// URL : https://atcoder.jp/contests/abc063/tasks/arc075_b
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loo... |
// Problem : D - Widespread
// Contest : AtCoder - AtCoder Beginner Contest 063
// URL : https://atcoder.jp/contests/abc063/tasks/arc075_b
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loo... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,371,829 | 1,371,830 | u768104057 | cpp |
p03700 |
// Problem : D - Widespread
// Contest : AtCoder - AtCoder Beginner Contest 063
// URL : https://atcoder.jp/contests/abc063/tasks/arc075_b
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loo... |
// Problem : D - Widespread
// Contest : AtCoder - AtCoder Beginner Contest 063
// URL : https://atcoder.jp/contests/abc063/tasks/arc075_b
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loo... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,371,831 | 1,371,830 | u768104057 | cpp |
p03700 | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | [
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"literal.number.change"
] | 1,371,836 | 1,371,837 | u554988565 | cpp |
p03700 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int IN... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int IN... | [
"variable_declaration.type.change"
] | 1,371,866 | 1,371,867 | u802434195 | cpp |
p03700 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto pitr = c.begin(); pitr != c.end(); ++pitr) { \
cout << *pitr;... | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto pitr = c.begin(); pitr != c.end(); ++pitr) { \
cout << *pitr;... | [
"call.add",
"call.arguments.add"
] | 1,371,871 | 1,371,872 | u135248164 | cpp |
p03700 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef long long ll;
const long long MOD = 1000000000 + 7;
bo... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef long long ll;
const long long MOD = 1000000000 + 7;
bo... | [
"call.function.change"
] | 1,371,873 | 1,371,874 | u006167882 | cpp |
p03700 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespac... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespac... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,371,875 | 1,371,876 | u716566635 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"variable_declaration.type.change"
] | 1,371,892 | 1,371,893 | u832995587 | cpp |
p03700 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"call.add",
"call.arguments.change"
] | 1,371,894 | 1,371,895 | u965730380 | cpp |
p03700 | #include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
long long n, a, b;
vector<lo... | #include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
long long n, a, b;
vector<lo... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,371,898 | 1,371,899 | u595984176 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, u = 1e9, l = 1;
cin >> N >> A >> B;
A -= B;
vector<long long int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
while (1 < u - l) {
long long int mid = (u + l) / 2, ans = 0;
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, u = 1e9, l = -1;
cin >> N >> A >> B;
A -= B;
vector<long long int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
while (1 < u - l) {
long long int mid = (u + l) / 2, ans = 0;
for (int i = 0; i < N; i++) ... | [
"expression.operation.unary.arithmetic.add"
] | 1,371,903 | 1,371,904 | u926416331 | cpp |
p03700 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
template <typename T> bool chmax(T &a, const T b) {
if (a <=... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
template <typename T> bool chmax(T &a, const T b) {
if (a <=... | [
"call.add",
"call.arguments.add"
] | 1,371,960 | 1,371,961 | u408910484 | cpp |
p03700 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,371,962 | 1,371,963 | u868099754 | cpp |
p03700 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespac... |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespac... | [
"identifier.change",
"io.output.change"
] | 1,371,966 | 1,371,967 | u194385557 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,371,975 | 1,371,976 | u139031151 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,371,977 | 1,371,976 | u139031151 | cpp |
p03700 | #include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) > (b) ? (b) : (a))
#define abs(x) ((x) > 0 ? (x) : -(x))
#define MOD (ll)1000000007 // 10^9 + 7
#define endl printf("\n")
typedef long lo... | #include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) > (b) ? (b) : (a))
#define abs(x) ((x) > 0 ? (x) : -(x))
#define MOD (ll)1000000007 // 10^9 + 7
#define endl printf("\n")
typedef long lo... | [
"variable_declaration.type.change"
] | 1,371,987 | 1,371,988 | u801102476 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pi;
typedef long long ll;
const int INF = 2000000000;
vector<int> health;
int N, A, B;... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pi;
typedef long long ll;
const int INF = 2000000000;
vector<int> health;
int N, A, B;... | [
"variable_declaration.type.change"
] | 1,371,989 | 1,371,990 | u117022482 | cpp |
p03700 | #include <bits/stdc++.h>
#define range(i, l, r) for (int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint ... | #include <bits/stdc++.h>
#define range(i, l, r) for (int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,008 | 1,372,009 | u069838609 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typed... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typed... | [
"call.add",
"call.arguments.add"
] | 1,372,010 | 1,372,011 | u317711717 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,372,017 | 1,372,018 | u069450081 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
long long n, a, b;
long long h[100100], tmp[100100];
bool check(int mid) {
for (int i = 1; i <= n; i++)
tmp[i] = max(h[i] - b * mid, 0LL);
for (int i = 1; i <= n; i++) {
if (tmp[i] > 0) {
mid = mid - (tmp[i] - 1) / (a - b) - 1;
}
}
return mid >= 0;... | #include <bits/stdc++.h>
using namespace std;
long long n, a, b;
long long h[100100], tmp[100100];
bool check(long long mid) {
for (int i = 1; i <= n; i++)
tmp[i] = max(h[i] - b * mid, 0LL);
for (int i = 1; i <= n; i++) {
if (tmp[i] > 0) {
mid = mid - (tmp[i] - 1) / (a - b) - 1;
}
}
return mid... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,372,062 | 1,372,063 | u313427116 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
long long h[100100];
long long tmp[100100];
bool chk(int mid) {
for (int i = 1; i <= n; i++)
tmp[i] = max(h[i] - mid * b, 0LL);
for (int i = 1; i <= n; i++) {
if (tmp[i] > 0) {
mid = mid - (tmp[i] - 1) / (a - b) - 1;
}
}
return mid >= ... | #include <bits/stdc++.h>
using namespace std;
long long n, a, b;
long long h[100100];
long long tmp[100100];
bool chk(long long mid) {
for (int i = 1; i <= n; i++)
tmp[i] = max(h[i] - mid * b, 0LL);
for (int i = 1; i <= n; i++) {
if (tmp[i] > 0) {
mid = mid - (tmp[i] - 1) / (a - b) - 1;
}
}
re... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,372,064 | 1,372,065 | u313427116 | cpp |
p03700 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace... | [] | 1,372,070 | 1,372,071 | u504098542 | cpp |
p03700 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int INF = 1 << 29;
int main() {
ios::sync_with_stdio(false);
ll N, A, B, Ans = LLONG_MAX;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
ll ok = 1, ng ... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int INF = 1 << 29;
int main() {
ios::sync_with_stdio(false);
ll N, A, B, Ans = LLONG_MAX;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
ll ok = 0, ng ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,092 | 1,372,093 | u019356802 | cpp |
p03700 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> V... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> V... | [
"assignment.change"
] | 1,372,102 | 1,372,103 | u304318875 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,108 | 1,372,109 | u344425917 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, A, B;
int h[100010];
int check(int m) {
int sum = 0;
for (int i = 0; i < N; i++) {
int tmp = h[i] - m * B;
if (tmp < 0)
continue;
sum += (tmp + (A - B) - 1) / (A - B);
}
return sum <= m;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, A, B;
int h[100010];
int check(int m) {
ll sum = 0;
for (int i = 0; i < N; i++) {
ll tmp = h[i] - (ll)m * B;
if (tmp < 0)
continue;
sum += (tmp + (A - B) - 1) / (A - B);
}
return sum <= m;
... | [
"variable_declaration.type.change"
] | 1,372,114 | 1,372,115 | u141642872 | cpp |
p03700 | #include <iostream>
#include <stdio.h>
#include <string.h>
#define int long long
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
signed main() {
int n, a, b;
cin >> n >> a >> b;
a = a - b;
int hp[100001] = {0}, h[100001] = {0};
REP(i, n) { cin >> h[i];... | #include <iostream>
#include <stdio.h>
#include <string.h>
#define int long long
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
signed main() {
int n, a, b;
cin >> n >> a >> b;
a = a - b;
int hp[100001] = {0}, h[100001] = {0};
REP(i, n) { cin >> h[i];... | [
"identifier.change",
"io.output.change"
] | 1,372,116 | 1,372,117 | u984730891 | cpp |
p03700 | #include <iostream>
#include <stdio.h>
#include <string.h>
//#define int long long
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
signed main() {
int n, a, b;
cin >> n >> a >> b;
a = a - b;
int hp[100001] = {0}, h[100001] = {0};
REP(i, n) { cin >> h[i... | #include <iostream>
#include <stdio.h>
#include <string.h>
#define int long long
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
signed main() {
int n, a, b;
cin >> n >> a >> b;
a = a - b;
int hp[100001] = {0}, h[100001] = {0};
REP(i, n) { cin >> h[i];... | [
"identifier.change",
"io.output.change"
] | 1,372,118 | 1,372,117 | u984730891 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
int n, a, b;
int h[100010], k[100010];
bool isOK(int x) { // x回の爆発で全部倒せるかどうか
int sum = 0;
rep(i, n) { k[i] -= b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
ll n, a, b;
ll h[100010], k[100010];
bool isOK(ll x) { // x回の爆発で全部倒せるかどうか
ll sum = 0;
rep(i, n) { k[i] -= b * x... | [
"variable_declaration.type.change"
] | 1,372,133 | 1,372,132 | u387258288 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
int n, a, b;
int h[100010], k[100010];
bool isOK(int x) { // x回の爆発で全部倒せるかどうか
int sum = 0;
rep(i, n) { k[i] -= b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
ll n, a, b;
ll h[100010], k[100010];
bool isOK(ll x) { // x回の爆発で全部倒せるかどうか
ll sum = 0;
rep(i, n) { k[i] -= b * x... | [
"variable_declaration.type.change"
] | 1,372,133 | 1,372,134 | u387258288 | cpp |
p03700 | #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... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 1,372,139 | 1,372,140 | u532065884 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,155 | 1,372,156 | u788341294 | cpp |
p03700 | #include <cfenv>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll h[n], sub[n];
ll max = 0;
for (ll i = 0; i < n; i++) {
cin >> h[i];
max += h[i] / b + 1;
sub[i] = h[i];
}
ll left = 0;
ll right = 1000000000;
whi... | #include <cfenv>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll h[n], sub[n];
ll max = 0;
for (ll i = 0; i < n; i++) {
cin >> h[i];
max += h[i] / b + 1;
sub[i] = h[i];
}
ll left = 0;
ll right = 1000000000;
whi... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,372,167 | 1,372,168 | u271545619 | cpp |
p03700 | #include <cfenv>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll h[n], sub[n];
ll max = 0;
for (ll i = 0; i < n; i++) {
cin >> h[i];
max += h[i] / b + 1;
sub[i] = h[i];
}
ll left = 0;
ll right = max + 1;
while ... | #include <cfenv>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll h[n], sub[n];
ll max = 0;
for (ll i = 0; i < n; i++) {
cin >> h[i];
max += h[i] / b + 1;
sub[i] = h[i];
}
ll left = 0;
ll right = 1000000000;
whi... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.value.change",
"call.arguments.change"
] | 1,372,169 | 1,372,168 | u271545619 | cpp |
p03700 | #include <cfenv>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll h[n], sub[n];
ll max = 0;
for (ll i = 0; i < n; i++) {
cin >> h[i];
max += h[i] / b + 1;
sub[i] = h[i];
}
ll left = 0;
ll right = max + 1;
while ... | #include <cfenv>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll h[n], sub[n];
ll max = 0;
for (ll i = 0; i < n; i++) {
cin >> h[i];
max += h[i] / b + 1;
sub[i] = h[i];
}
ll left = 0;
ll right = 1000000000;
whi... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 1,372,170 | 1,372,168 | u271545619 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, b, a, minT, maxT, maxh = 0, mid;
cin >> n >> a >> b;
vector<ll> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
maxh = max(maxh, h[i]);
}
minT = 0;
maxT = maxh / b + 1;
while (maxT - minT > 1) {
mid = (m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, b, a, minT, maxT, maxh = 0, mid;
cin >> n >> a >> b;
vector<ll> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
maxh = max(maxh, h[i]);
}
minT = 0;
maxT = maxh / b + 1;
while (maxT - minT > 1) {
mid = (m... | [
"assignment.change"
] | 1,372,178 | 1,372,179 | u853947407 | cpp |
p03700 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
ll N, A, B, H[101010];
b... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
ll N, A, B, H[101010];
b... | [
"control_flow.branch.if.condition.change"
] | 1,372,180 | 1,372,181 | u724732842 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,372,197 | 1,372,198 | u864171425 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, A, B;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i ... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 1,372,199 | 1,372,198 | u864171425 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, A, B;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i ... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 1,372,200 | 1,372,198 | u864171425 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, A, B;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B;
cin >> N >> A >> B;
vector<ll> h(N);
for (int i = 0; i ... | [
"variable_declaration.type.change"
] | 1,372,201 | 1,372,198 | u864171425 | cpp |
p03700 | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
long long int H[114514] = {};
for (int i = 0; i < N; i++) {
cin >> H[i];
}
long long int L = 1, R = 1e9;
while (R - L > 1) {
long long int K = (L + R) / 2;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
long long int H[114514] = {};
for (int i = 0; i < N; i++) {
cin >> H[i];
}
long long int L = 0, R = 1e9;
while (R - L > 1) {
long long int K = (L + R) / 2;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,206 | 1,372,207 | u465638326 | cpp |
p03700 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s; i <= n; i++)
#define rep_r(i, s, n) for (ll i = n - 1; i >= s; i--)
#define repe_r(i,... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s; i <= n; i++)
#define rep_r(i, s, n) for (ll i = n - 1; i >= s; i--)
#define repe_r(i,... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,372,208 | 1,372,209 | u685009987 | cpp |
p03700 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s; i <= n; i++)
#define rep_r(i, s, n) for (ll i = n - 1; i >= s; i--)
#define repe_r(i,... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s; i <= n; i++)
#define rep_r(i, s, n) for (ll i = n - 1; i >= s; i--)
#define repe_r(i,... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,372,210 | 1,372,209 | u685009987 | cpp |
p03700 | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ... | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"io.output.change"
] | 1,372,211 | 1,372,212 | u224756887 | cpp |
p03700 | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ... | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,213 | 1,372,212 | u224756887 | cpp |
p03700 | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | [
"assignment.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,372,221 | 1,372,222 | u468700753 | cpp |
p03700 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define ll long long int
#define pb push_back
#define mk make... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define ll long long int
#define pb push_back
#define mk make... | [
"variable_declaration.type.change"
] | 1,372,228 | 1,372,229 | u424110125 | cpp |
p03700 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define ll long long int
#define pb push_back
#define mk make... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define ll long long int
#define pb push_back
#define mk make... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,230 | 1,372,229 | u424110125 | cpp |
p03700 | #include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
int n, a, b;
cin >> n >> a >> b;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
ll right = h[n - 1], left = 0; //回数
while (right - left > 1) {
ll mid = (right + left) / 2;
ll s... | #include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
int n, a, b;
cin >> n >> a >> b;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
ll right = h[n - 1], left = 0; //回数
while (right - left > 1) {
ll mid = (right + left) / 2;
ll s... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,372,242 | 1,372,243 | u394482932 | cpp |
p03700 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a, b;
ll h[100000];
bool enough(ll t) {
int k = 0;
for (ll i = 0; i < n; i++) {
k += max(0ll, ((h[i] - t * b + a - b - 1ll) / (a - b)));
}
return k <= t;
}
ll bisearch(ll left, ll right) {
if (left + 1 >= right) {
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a, b;
ll h[100000];
bool enough(ll t) {
ll k = 0;
for (ll i = 0; i < n; i++) {
k += max(0ll, ((h[i] - t * b + a - b - 1ll) / (a - b)));
}
return k <= t;
}
ll bisearch(ll left, ll right) {
if (left + 1 >= right) {
... | [
"variable_declaration.type.change"
] | 1,372,263 | 1,372,264 | u653005308 | cpp |
p03700 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a, b;
ll h[100000];
bool enough(ll t) {
int k = 0;
for (int i = 0; i < n; i++) {
k += max(0ll, ((h[i] - t * b + a - b - 1ll) / (a - b)));
}
return k <= t;
}
ll bisearch(ll left, ll right) {
if (left + 1 >= right) {
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a, b;
ll h[100000];
bool enough(ll t) {
ll k = 0;
for (ll i = 0; i < n; i++) {
k += max(0ll, ((h[i] - t * b + a - b - 1ll) / (a - b)));
}
return k <= t;
}
ll bisearch(ll left, ll right) {
if (left + 1 >= right) {
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 1,372,265 | 1,372,264 | u653005308 | cpp |
p03700 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a, b;
ll h[100000];
bool enough(ll t) {
int k = 0;
for (int i = 0; i < n; i++) {
k += max(0ll, ((h[i] - t * b + a - b - 1ll) / (a - b)));
}
return k <= t;
}
ll bisearch(ll left, ll right) {
if (left + 1 >= right) {
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a, b;
ll h[100000];
bool enough(ll t) {
ll k = 0;
for (ll i = 0; i < n; i++) {
k += max(0ll, ((h[i] - t * b + a - b - 1ll) / (a - b)));
}
return k <= t;
}
ll bisearch(ll left, ll right) {
if (left + 1 >= right) {
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 1,372,266 | 1,372,264 | u653005308 | cpp |
p03700 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define repe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define repif(i, a, x) for (int(i) = (int)(a); (x); ++(i))
#define repr(i, a, n) for (int(i) = ((int)(a)-1); (i) >= (int)(n); --(i))
#define reper(i, a, n) f... | #include <bits/stdc++.h>
#define int llint
#define rep(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define repe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define repif(i, a, x) for (int(i) = (int)(a); (x); ++(i))
#define repr(i, a, n) for (int(i) = ((int)(a)-1); (i) >= (int)(n); --(i))
#defin... | [] | 1,372,273 | 1,372,274 | u660270504 | cpp |
p03700 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int n;
long long a, b;
long long t[100005];
bool can(long long mid) {
long long tmp = 0;
for (int i = 0; i < n; i++) {
long long... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int n;
long long a, b;
long long t[100005];
bool can(long long mid) {
long long tmp = 0;
for (int i = 0; i < n; i++) {
long long... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,372,288 | 1,372,289 | u803345299 | cpp |
p03700 | #include <iostream>
using namespace std;
int N;
long long int A, B;
long long int h[100005];
bool IsPossible(long long int K) {
long long int count = 0;
for (int i = 1; i <= N; i++) {
if (h[i] < K * B) {
continue;
} else {
count += (h[i] - K * B + A - B - 1) / (A - B);
}
}
// cout ... | #include <iostream>
using namespace std;
int N;
long long int A, B;
long long int h[100005];
bool IsPossible(long long int K) {
long long int count = 0;
for (int i = 1; i <= N; i++) {
if (h[i] < K * B) {
continue;
} else {
count += (h[i] - K * B + A - B - 1) / (A - B);
}
}
// cout ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,290 | 1,372,291 | u835297884 | cpp |
p03700 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,312 | 1,372,313 | u516353059 | cpp |
p03700 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,315 | 1,372,313 | u516353059 | cpp |
p03700 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using namespace std;
#define modmod 1000000007
int N;
ll h[100006];
ll A, B;
bool enough(ll t) {
ll sum = 0;
for (int i = 0; i < N; i++) {
if (h[i] - (B * t)... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using namespace std;
#define modmod 1000000007
int N;
ll h[100006];
ll A, B;
bool enough(ll t) {
ll sum = 0;
for (int i = 0; i < N; i++) {
if (h[i] - (B * t)... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,372,322 | 1,372,323 | u849513225 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
int h[100001];
int main() {
long long int n, a, b;
scanf("%lld %lld %lld", &n, &a, &b);
long long int sum = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &h[i]);
sum += h[i];
}
long long int mt = ceil((double)sum / b);
long long int left = 0, right = ... | #include <bits/stdc++.h>
using namespace std;
int h[100001];
int main() {
long long int n, a, b;
scanf("%lld %lld %lld", &n, &a, &b);
long long int sum = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &h[i]);
sum += h[i];
}
long long int mt = ceil((double)sum / b);
long long int left = 0, right = ... | [
"variable_declaration.type.widen.change"
] | 1,372,328 | 1,372,329 | u823112986 | cpp |
p03700 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,332 | 1,372,333 | u898651494 | cpp |
p03700 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 1,372,334 | 1,372,333 | u898651494 | cpp |
p03700 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 1,372,335 | 1,372,333 | u898651494 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
typedef long long cc;
const int N = 100005;
int n, A, B;
int h[N];
bool check(const int &m) {
int sum = 0;
for (int i = 0; i < n; i++)
if (h[i] - 1ll * m * B > 0) {
int val = max(0ll, (h[i] - 1ll * m * B) / (A - B) +
((h[i] - 1ll *... | #include <bits/stdc++.h>
using namespace std;
typedef long long cc;
const int N = 100005;
int n, A, B;
int h[N];
bool check(const int &m) {
cc sum = 0;
for (int i = 0; i < n; i++)
if (h[i] - 1ll * m * B > 0) {
int val = max(0ll, (h[i] - 1ll * m * B) / (A - B) +
((h[i] - 1ll * ... | [
"variable_declaration.type.change"
] | 1,372,336 | 1,372,337 | u075949767 | cpp |
p03700 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
//#define ll __i... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
//#define ll __i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,338 | 1,372,339 | u341406884 | cpp |
p03700 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
//#define ll __i... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
//#define ll __i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,340 | 1,372,339 | u341406884 | cpp |
p03700 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
//#define ll __i... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
//#define ll __i... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 1,372,341 | 1,372,339 | u341406884 | cpp |
p03700 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
//#define ll __i... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_back
//#define ll __i... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 1,372,342 | 1,372,339 | u341406884 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 1000111000111000111LL
#define mod 1000000007
#define endl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
#define all(cc) (cc).begin(), (cc).end()
using lli = long long int;
using pi... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 1000111000111000111LL
#define mod 1000000007
#define endl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
#define all(cc) (cc).begin(), (cc).end()
using lli = long long int;
using pi... | [
"call.arguments.change"
] | 1,372,345 | 1,372,346 | u089230684 | cpp |
p03700 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, b, h;
vector<int> monster, v;
cin >> n >> a >> b;
a = a - b;
for (int i = 0; i < n; i++) {
cin >> h;
monster.push_back(h);
}
int L = 0, R = 1000000000, M;
while (R - L >= 2) {
M = (L + R) / 2;
for (int i = ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, b, h;
vector<int> monster, v;
cin >> n >> a >> b;
a = a - b;
for (int i = 0; i < n; i++) {
cin >> h;
monster.push_back(h);
}
long long int L = 0, R = 10000000000000000, M;
while (R - L > 1) {
M = (L + R) / 2;
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,372,352 | 1,372,353 | u816631826 | cpp |
p03700 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
typedef long long LL;
const int INF = int(1e9);
LL N, A, B;
LL a[1000006];
bool pan(LL x) {
LL sum = 0;
for (int... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
typedef long long LL;
const int INF = int(1e9);
LL N, A, B;
LL a[1000006];
bool pan(LL x) {
LL sum = 0;
for (int... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,372,359 | 1,372,360 | u353919145 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.