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 9 values |
|---|---|---|---|---|---|---|---|
p02959 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int n, i;
cin >> n;
vector<int> a(n + 1), b(n);
int answer = 0;
int margin;
for (i = 0; i < n + 1; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
if (a[i] >= b[i]) {
answer += b[i];
a[i] -= b[i];
} else {
margin = b[i] - a[i];
answer += a[i];
a[i] = 0;
if (margin > a[i + 1]) {
answer += a[i + 1];
a[i + 1] = 0;
} else {
answer += margin;
a[i + 1] -= margin;
}
}
}
cout << answer << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ll n, i;
cin >> n;
vector<ll> a(n + 1), b(n);
ll answer = 0;
ll margin;
for (i = 0; i < n + 1; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
if (a[i] >= b[i]) {
answer += b[i];
a[i] -= b[i];
} else {
margin = b[i] - a[i];
answer += a[i];
a[i] = 0;
if (margin > a[i + 1]) {
answer += a[i + 1];
a[i + 1] = 0;
} else {
answer += margin;
a[i + 1] -= margin;
}
}
}
cout << answer << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,431 | 766,432 | u202813867 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, answer = 0;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) {
answer += B.at(i);
A.at(i) = A.at(i) - B.at(i);
}
else {
answer += A.at(i);
if (A.at(i + 1) + A.at(i) - B.at(i) >= 0) {
answer += B.at(i) - A.at(i);
A.at(i + 1) -= B.at(i) - A.at(i);
A.at(i) = 0;
} else {
answer += A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << answer;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t answer = 0;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) {
answer += B.at(i);
A.at(i) = A.at(i) - B.at(i);
}
else {
answer += A.at(i);
if (A.at(i + 1) + A.at(i) - B.at(i) >= 0) {
answer += B.at(i) - A.at(i);
A.at(i + 1) -= B.at(i) - A.at(i);
A.at(i) = 0;
} else {
answer += A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << answer;
} | [
"variable_declaration.type.change"
] | 766,438 | 766,439 | u000993607 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, answer = 0;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) {
answer += B.at(i);
A.at(i) = A.at(i) - B.at(i);
}
else {
answer += A.at(i);
if (A.at(i + 1) + A.at(i) - B.at(i) >= 0) {
answer += B.at(i) - A.at(i);
A.at(i + 1) -= B.at(i) - A.at(i);
A.at(i) = 0;
} else {
answer += A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << answer;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t answer = 0;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) {
answer += B.at(i);
A.at(i) = A.at(i) - B.at(i);
}
else {
answer += A.at(i);
if (A.at(i + 1) + A.at(i) - B.at(i) >= 0) {
answer += B.at(i) - A.at(i);
A.at(i + 1) -= B.at(i) - A.at(i);
A.at(i) = 0;
} else {
answer += A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << answer;
} | [
"variable_declaration.type.change"
] | 766,440 | 766,439 | u000993607 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int c(0);
int k(0);
int q(0);
rep(i, n) {
q = min(a[i] - k, b[i]);
c += q;
k = min(a[i + 1], b[i] - q);
c += k;
}
cout << c;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll c(0);
ll k(0);
ll q(0);
rep(i, n) {
q = min(a[i] - k, b[i]);
c += q;
k = min(a[i + 1], b[i] - q);
c += k;
}
cout << c;
return 0;
} | [
"variable_declaration.type.change"
] | 766,441 | 766,442 | u872982453 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
// repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
//階乗
int factorial(int k) {
int result = 1;
for (int i = 1; i <= k; ++i) {
result *= i;
}
return result;
}
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int sum = 0;
rep(i, n) {
sum += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
sum += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
// repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
//階乗
int factorial(int k) {
int result = 1;
for (int i = 1; i <= k; ++i) {
result *= i;
}
return result;
}
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll sum = 0;
rep(i, n) {
sum += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
sum += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << sum << endl;
}
| [
"variable_declaration.type.change"
] | 766,443 | 766,444 | u931071094 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
// repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
//階乗
int factorial(int k) {
int result = 1;
for (int i = 1; i <= k; ++i) {
result *= i;
}
return result;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int sum = 0;
rep(i, n) {
sum += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
sum += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
// repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
//階乗
int factorial(int k) {
int result = 1;
for (int i = 1; i <= k; ++i) {
result *= i;
}
return result;
}
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll sum = 0;
rep(i, n) {
sum += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
sum += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << sum << endl;
}
| [
"variable_declaration.type.change"
] | 766,445 | 766,444 | u931071094 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n + 1) cin >> a[i];
int ans = 0;
rep(i, n) {
int b;
cin >> b;
int t = min(b, a[i] + a[i + 1]);
ans += t;
a[i + 1] -= t - min(b, a[i]);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
rep(i, n + 1) cin >> a[i];
ll ans = 0;
rep(i, n) {
ll b;
cin >> b;
ll t = min(b, a[i] + a[i + 1]);
ans += t;
a[i + 1] -= t - min(b, a[i]);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,448 | 766,449 | u907525511 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
ll a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
ll res = b[i] - a[i + 1];
if (res >= 0) {
if (a[i] - res >= 0) {
ans += b[i];
a[i] -= res;
} else {
ans += a[i + 1] + a[i];
a[i] = 0;
}
} else {
ans += b[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
ll a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rrep(i, n) {
ll res = b[i] - a[i + 1];
if (res >= 0) {
if (a[i] - res >= 0) {
ans += b[i];
a[i] -= res;
} else {
ans += a[i + 1] + a[i];
a[i] = 0;
}
} else {
ans += b[i];
}
}
cout << ans << endl;
} | [
"identifier.change"
] | 766,452 | 766,453 | u501163846 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
{ \
for (auto i : x) { \
cout << i << " "; \
} \
cout << endl; \
}
#define showm(m) \
{ \
for (auto i : m) { \
cout << m.x << " "; \
} \
cout << endl; \
}
typedef long long ll;
typedef pair<int, int> P;
ll gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }
int main() {
int n;
cin >> n;
vector<int> a, b;
rep(i, n + 1) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
rep(i, n) {
int tmp;
cin >> tmp;
b.push_back(tmp);
}
int ans = 0;
rep(i, n) {
if (b[i] > a[i]) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
} else {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
{ \
for (auto i : x) { \
cout << i << " "; \
} \
cout << endl; \
}
#define showm(m) \
{ \
for (auto i : m) { \
cout << m.x << " "; \
} \
cout << endl; \
}
typedef long long ll;
typedef pair<int, int> P;
ll gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }
int main() {
int n;
cin >> n;
vector<ll> a, b;
rep(i, n + 1) {
ll tmp;
cin >> tmp;
a.push_back(tmp);
}
rep(i, n) {
ll tmp;
cin >> tmp;
b.push_back(tmp);
}
ll ans = 0;
rep(i, n) {
if (b[i] > a[i]) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
} else {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 766,454 | 766,455 | u317715099 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
{ \
for (auto i : x) { \
cout << i << " "; \
} \
cout << endl; \
}
#define showm(m) \
{ \
for (auto i : m) { \
cout << m.x << " "; \
} \
cout << endl; \
}
typedef long long ll;
typedef pair<int, int> P;
ll gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }
int main() {
int n;
cin >> n;
vector<int> a;
vector<int> b;
rep(i, n + 1) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
rep(i, n) {
int tmp;
cin >> tmp;
b.push_back(tmp);
}
int ans = 0;
rep(i, n) {
if (b[i] > a[i]) {
ans += a[i];
b[i] -= a[i];
//次の街
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
} else {
ans += b[i];
b[i] = 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
{ \
for (auto i : x) { \
cout << i << " "; \
} \
cout << endl; \
}
#define showm(m) \
{ \
for (auto i : m) { \
cout << m.x << " "; \
} \
cout << endl; \
}
typedef long long ll;
typedef pair<int, int> P;
ll gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }
int main() {
int n;
cin >> n;
vector<ll> a;
vector<ll> b;
rep(i, n + 1) {
ll tmp;
cin >> tmp;
a.push_back(tmp);
}
rep(i, n) {
ll tmp;
cin >> tmp;
b.push_back(tmp);
}
ll ans = 0;
rep(i, n) {
if (b[i] > a[i]) {
ans += a[i];
b[i] -= a[i];
//次の街
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
} else {
ans += b[i];
b[i] = 0;
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 766,456 | 766,457 | u317715099 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
cin >> b.at(i);
}
for (int i = 0; i < N; i++) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
} else {
ans += a.at(i);
ans += min(b.at(i) - a.at(i), a.at(i + 1));
a.at(i + 1) = max(a.at(i + 1) - b.at(i) + a.at(i), 0);
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long ans = 0;
cin >> N;
vector<int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
cin >> b.at(i);
}
for (int i = 0; i < N; i++) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
} else {
ans += a.at(i);
ans += min(b.at(i) - a.at(i), a.at(i + 1));
a.at(i + 1) = max(a.at(i + 1) - b.at(i) + a.at(i), 0);
}
}
cout << ans;
}
| [
"variable_declaration.type.widen.change"
] | 766,458 | 766,459 | u160429264 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define printd(x) printf("%.12f\n", ans);
#define print(x) cout << (x) << endl;
#define Yes() cout << "Yes" << endl;
#define No() cout << "No" << endl;
#define YES() cout << "YES" << endl;
#define NO() cout << "NO" << endl;
#define all(x) (x).begin(), (x).end()
#define printa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " "; \
} \
cout << endl;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
int main(void) {
int n;
cin >> n;
int a[n + 1], b[n], aa[n + 1], bb[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n + 1) aa[i] = a[i];
rep(i, n) bb[i] = b[i];
ll ans1 = 0, ans2 = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
ans1 += a[i];
b[i] -= a[i];
} else {
ans1 += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans1 += a[i + 1];
a[i + 1] = 0;
} else {
ans1 += b[i];
a[i] -= b[i];
}
}
for (int i = n - 1; i >= 0; i--) {
if (bb[i] >= aa[i + 1]) {
ans2 += aa[i + 1];
bb[i] -= aa[i + 1];
} else {
ans2 += bb[i];
bb[i] = 0;
}
if (bb[i] >= aa[i]) {
ans2 += aa[i];
aa[i] = 0;
} else {
ans2 += bb[i];
aa[i] -= bb[i];
}
}
cout << max(ans1, ans2) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define printd(x) printf("%.12f\n", ans);
#define print(x) cout << (x) << endl;
#define Yes() cout << "Yes" << endl;
#define No() cout << "No" << endl;
#define YES() cout << "YES" << endl;
#define NO() cout << "NO" << endl;
#define all(x) (x).begin(), (x).end()
#define printa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " "; \
} \
cout << endl;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
int main(void) {
int n;
cin >> n;
int a[n + 1], b[n], aa[n + 1], bb[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n + 1) aa[i] = a[i];
rep(i, n) bb[i] = b[i];
ll ans1 = 0, ans2 = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
ans1 += a[i];
b[i] -= a[i];
} else {
ans1 += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans1 += a[i + 1];
a[i + 1] = 0;
} else {
ans1 += b[i];
a[i + 1] -= b[i];
}
}
for (int i = n - 1; i >= 0; i--) {
if (bb[i] >= aa[i + 1]) {
ans2 += aa[i + 1];
bb[i] -= aa[i + 1];
} else {
ans2 += bb[i];
bb[i] = 0;
}
if (bb[i] >= aa[i]) {
ans2 += aa[i];
aa[i] = 0;
} else {
ans2 += bb[i];
aa[i] -= bb[i];
}
}
cout << max(ans1, ans2) << endl;
return 0;
}
| [
"assignment.change"
] | 766,464 | 766,465 | u174509352 | cpp |
p02959 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) REV(SORT(V)) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V).at(i) << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V).at(i) << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define Vd vector<double>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最小公倍数
// デフォルト変数定義
int n, m, a, b, c = 0, x, y, z;
double d, e, f;
string s, t;
//
signed main() {
RAPID;
IN(n);
Vi A(n + 1);
Vi B(n);
VIN(A)
VIN(B)
REP(i, n + 1) {
if (A.at(i) <= B.at(i)) {
c += A.at(i);
B.at(i) -= A.at(i);
A.at(i) = 0;
} else {
c += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
}
if (A.at(i + 1) <= B.at(i)) {
c += A.at(i + 1);
B.at(i) -= A.at(i + 1);
A.at(i + 1) = 0;
} else {
c += B.at(i);
A.at(i + 1) -= B.at(i);
B.at(i) = 0;
}
}
OUT(c);
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) REV(SORT(V)) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V).at(i) << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V).at(i) << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define Vd vector<double>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最小公倍数
// デフォルト変数定義
int n, m, a, b, c = 0, x, y, z;
double d, e, f;
string s, t;
//
signed main() {
RAPID;
IN(n);
Vi A(n + 1);
Vi B(n);
VIN(A)
VIN(B)
REP(i, n) {
if (A.at(i) <= B.at(i)) {
c += A.at(i);
B.at(i) -= A.at(i);
A.at(i) = 0;
} else {
c += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
}
if (A.at(i + 1) <= B.at(i)) {
c += A.at(i + 1);
B.at(i) -= A.at(i + 1);
A.at(i + 1) = 0;
} else {
c += B.at(i);
A.at(i + 1) -= B.at(i);
B.at(i) = 0;
}
}
OUT(c);
} | [
"expression.operation.binary.remove"
] | 766,468 | 766,469 | u154645927 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
const int MAX = 510000;
const int MOD = 1000000007;
// 約数の列挙
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) {
res.push_back(n / i);
}
}
}
return res;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> v(N);
rep(i, N) cin >> v[i];
ll sum = 0;
rep(i, N) sum += v[i];
//約数vectorを作成
vector<ll> a;
a = divisor(sum);
a.pb(1);
a.pb(sum);
SORT(a);
ll d = a.size();
for (ll i = d - 1; i >= 0; i--) {
vector<ll> cnt(N);
ll re = 0;
rep(j, N) {
cnt[j] = v[j] % a[i];
re += cnt[j];
}
SORT(cnt);
ll c = re / a[i];
ll check = 0;
rep(j, N - c) { check += cnt[j]; }
if (check <= 2 * K) {
cout << a[i] << endl;
return 0;
}
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
const int MAX = 510000;
const int MOD = 1000000007;
// 約数の列挙
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) {
res.push_back(n / i);
}
}
}
return res;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> v(N);
rep(i, N) cin >> v[i];
ll sum = 0;
rep(i, N) sum += v[i];
//約数vectorを作成
vector<ll> a;
a = divisor(sum);
a.pb(1);
a.pb(sum);
SORT(a);
ll d = a.size();
for (ll i = d - 1; i >= 0; i--) {
vector<ll> cnt(N);
ll re = 0;
rep(j, N) {
cnt[j] = v[j] % a[i];
re += cnt[j];
}
SORT(cnt);
// cはそこからひく場所
ll c = re / a[i];
ll check = 0;
rep(j, N - c) { check += cnt[j]; }
if (check <= K) {
cout << a[i] << endl;
return 0;
}
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 766,485 | 766,486 | u284045566 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
const int MAX = 5100000;
const int MOD = 1000000007;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> a(N);
rep(i, N) cin >> a[i];
ll amax = 0;
rep(i, N) amax = max(amax, a[i]);
ll sum = 0;
rep(i, N) sum += a[i];
if (K >= (sum - amax)) {
cout << sum << endl;
return 0;
}
vector<ll> ret;
ll i, j, k, l;
for (i = 2; i < sum; i++) {
//約数の列挙
if (i * i > sum)
break;
if (sum % i == 0) {
ret.pb(i);
ret.pb(sum / i);
}
}
sort(ret.begin(), ret.end(), greater<ll>());
rep(i, ret.size()) {
//約数を大きい順に見ていく
vector<ll> d;
rep(j, N) {
if (a[j] % ret[i] != 0) {
d.pb(a[j] % ret[i]);
}
}
sort(d.begin(), d.end());
ll tmp1 = 0, tmp2 = 0;
ll x = d.size();
rep(j, x) { tmp2 += (ret[i] - d[j]); }
repn(j, x - 1) {
tmp1 += d[j];
tmp2 -= ret[i] - d[j];
if (tmp1 == tmp2 and tmp1 <= K) {
cout << ret[i] << endl;
return 0;
}
}
}
cout << 1 << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
const int MAX = 5100000;
const int MOD = 1000000007;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> a(N);
rep(i, N) cin >> a[i];
ll amax = 0;
rep(i, N) amax = max(amax, a[i]);
ll sum = 0;
rep(i, N) sum += a[i];
if (K >= (sum - amax)) {
cout << sum << endl;
return 0;
}
vector<ll> ret;
ll i, j, k, l;
for (i = 2; i < sum; i++) {
//約数の列挙
if (i * i > sum)
break;
if (sum % i == 0) {
ret.pb(i);
ret.pb(sum / i);
}
}
sort(ret.begin(), ret.end(), greater<ll>());
rep(i, ret.size()) {
//約数を大きい順に見ていく
vector<ll> d;
rep(j, N) {
if (a[j] % ret[i] != 0) {
d.pb(a[j] % ret[i]);
}
}
sort(d.begin(), d.end());
ll tmp1 = 0, tmp2 = 0;
ll x = d.size();
rep(j, x) { tmp2 += (ret[i] - d[j]); }
rep(j, x) {
tmp1 += d[j];
tmp2 -= ret[i] - d[j];
if (tmp1 == tmp2 and tmp1 <= K) {
cout << ret[i] << endl;
return 0;
}
}
}
cout << 1 << endl;
}
| [
"expression.operation.binary.remove"
] | 766,487 | 766,488 | u284045566 | cpp |
p02955 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void swap(T &a, T &b) {
T c = a;
a = b;
b = c;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll GetDiviserCount(ll N) //約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) //約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
ll ans;
ll sum;
void solve(ll x) // x はsumの約数
{
vll p;
rep(i, n) {
if (v[i] % x) {
p.pb(v[i] % x);
}
}
sort(All(p));
N = sz(p);
ll B = 0;
rep(i, N) B += x - p[i];
ll A = 0;
ll tmp = INFL;
rep(i, N) {
A += p[i];
B -= x - p[i];
chmin(tmp, max(A, B));
}
if (tmp <= k)
chmax(ans, x);
/*
dump(x);
for(auto c : ruiseki)
{
cout << c << " ";
}
dump(res);
OUT();
*/
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n, k);
sum = 0;
ans = 0;
v = vi(n);
rep(i, n) IN(v[i]);
rep(i, n) sum += v[i];
vll res = GetDivisor(sum);
// dump(sum);
m = sz(res);
drep(i, m - 1) {
if (i == 0)
continue;
// dump(res[i]);
solve(res[i]);
}
cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void swap(T &a, T &b) {
T c = a;
a = b;
b = c;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll GetDiviserCount(ll N) //約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) //約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
ll ans;
ll sum;
void solve(ll x) // x はsumの約数
{
vll p;
rep(i, n) {
if (v[i] % x) {
p.pb(v[i] % x);
}
}
sort(All(p));
N = sz(p);
ll B = 0;
rep(i, N) B += x - p[i];
ll A = 0;
ll tmp = INFL;
rep(i, N) {
A += p[i];
B -= x - p[i];
chmin(tmp, max(A, B));
}
if (tmp <= k)
chmax(ans, x);
/*
dump(x);
for(auto c : ruiseki)
{
cout << c << " ";
}
dump(res);
OUT();
*/
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n, k);
sum = 0;
ans = 1;
v = vi(n);
rep(i, n) IN(v[i]);
rep(i, n) sum += v[i];
vll res = GetDivisor(sum);
// dump(sum);
m = sz(res);
drep(i, m - 1) {
if (i == 0)
continue;
// dump(res[i]);
solve(res[i]);
}
cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 766,489 | 766,490 | u264405855 | cpp |
p02955 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void swap(T &a, T &b) {
T c = a;
a = b;
b = c;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll GetDiviserCount(ll N) //約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) //約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
ll ans;
ll sum;
void solve(ll x) // x はsumの約数
{
vll p;
rep(i, n) {
if (v[i] % x) {
p.pb(v[i] % x);
}
}
sort(All(p));
N = sz(p);
ll B = 0;
rep(i, N) B += x - p[i];
ll A = 0;
ll tmp = INF;
rep(i, N) {
A += p[i];
B -= x - p[i];
chmin(tmp, max(A, B));
}
if (tmp <= k)
chmax(ans, x);
/*
dump(x);
for(auto c : ruiseki)
{
cout << c << " ";
}
dump(res);
OUT();
*/
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n, k);
sum = 0;
ans = 0;
v = vi(n);
rep(i, n) IN(v[i]);
rep(i, n) sum += v[i];
vll res = GetDivisor(sum);
// dump(sum);
m = sz(res);
drep(i, m - 1) {
if (i == 0)
continue;
// dump(res[i]);
solve(res[i]);
}
cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void swap(T &a, T &b) {
T c = a;
a = b;
b = c;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll GetDiviserCount(ll N) //約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) //約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
ll ans;
ll sum;
void solve(ll x) // x はsumの約数
{
vll p;
rep(i, n) {
if (v[i] % x) {
p.pb(v[i] % x);
}
}
sort(All(p));
N = sz(p);
ll B = 0;
rep(i, N) B += x - p[i];
ll A = 0;
ll tmp = INFL;
rep(i, N) {
A += p[i];
B -= x - p[i];
chmin(tmp, max(A, B));
}
if (tmp <= k)
chmax(ans, x);
/*
dump(x);
for(auto c : ruiseki)
{
cout << c << " ";
}
dump(res);
OUT();
*/
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n, k);
sum = 0;
ans = 1;
v = vi(n);
rep(i, n) IN(v[i]);
rep(i, n) sum += v[i];
vll res = GetDivisor(sum);
// dump(sum);
m = sz(res);
drep(i, m - 1) {
if (i == 0)
continue;
// dump(res[i]);
solve(res[i]);
}
cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.change",
"literal.number.change",
"assignment.value.change"
] | 766,491 | 766,490 | u264405855 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
#define tii tuple<int, int, int>
#define Priq priority_queue<int, vi, greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll << 60)
signed main() {
int N, K;
cin >> N >> K;
vi A(N);
int sum = 0;
rep(i, 0, N) {
cin >> A[i];
sum += A[i];
}
set<int> S;
REP(i, 1, sqrt(sum)) {
if (sum % i == 0) {
S.insert(i);
S.insert(sum / i);
}
}
int ans = 1;
for (auto p : S) {
vi B(N);
int me = 0;
rep(i, 0, N) {
B[i] = A[i] % p;
me += B[i];
}
sort(ALL(B), greater<int>());
int mem = 0;
rep(i, 0, me / p) mem += B[i];
if (mem <= K)
ans = p;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
#define tii tuple<int, int, int>
#define Priq priority_queue<int, vi, greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll << 60)
signed main() {
int N, K;
cin >> N >> K;
vi A(N);
int sum = 0;
rep(i, 0, N) {
cin >> A[i];
sum += A[i];
}
set<int> S;
REP(i, 1, sqrt(sum)) {
if (sum % i == 0) {
S.insert(i);
S.insert(sum / i);
}
}
int ans = 1;
for (auto p : S) {
vi B(N);
int me = 0;
rep(i, 0, N) {
B[i] = A[i] % p;
me += B[i];
}
sort(ALL(B), greater<int>());
int mem = 0;
rep(i, 0, me / p) mem += B[i];
if (me - mem <= K)
ans = p;
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 766,494 | 766,495 | u347057617 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, k, a[1000];
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
int sum = 0;
rep(i, n) sum += a[i];
vector<int> g(0);
for (int i = 1; i * i <= sum; i++) {
if (sum % i == 0) {
g.emplace_back(i);
g.emplace_back(sum / i);
}
}
sort(g.begin(), g.end(), greater<int>());
int res = 0;
for (auto x : g) {
int b[n];
rep(i, n) b[n] = a[n] % x;
sort(b, b + n, greater<int>());
int sum = 0;
rep(i, n) sum += b[i];
int tmp = 0;
rep(i, sum / x) tmp += b[i];
sum -= tmp;
if (sum <= k) {
cout << x << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, k, a[1000];
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
int sum = 0;
rep(i, n) sum += a[i];
vector<int> g(0);
for (int i = 1; i * i <= sum; i++) {
if (sum % i == 0) {
g.emplace_back(i);
g.emplace_back(sum / i);
}
}
sort(g.begin(), g.end(), greater<int>());
int res = 0;
for (auto x : g) {
int b[n];
rep(i, n) b[i] = a[i] % x;
sort(b, b + n, greater<int>());
int sum = 0;
rep(i, n) sum += b[i];
int tmp = 0;
rep(i, sum / x) tmp += b[i];
sum -= tmp;
if (sum <= k) {
cout << x << endl;
break;
}
}
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 766,499 | 766,500 | u389007679 | cpp |
p02955 | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751L
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": ";
for1(i, size) {
if (i != 0) {
cerr << ' ';
}
cerr << v[i];
}
cerr << '\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
ll divup(ll nume, ll deno) {
assert(nume >= 0);
assert(deno > 0);
return (nume + deno - 1) / deno;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void vin(vector<T> &v) {
ll len = v.size();
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
cin >> h;
in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
const ll mod = 1000000007LL; // 10**9 + 7
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &v) {
os << v.x;
return os;
}
};
//---------------------------------------------------------
struct mintcomb {
vector<mint> fact, ifact;
mintcomb(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i) {
fact[i] = fact[i - 1] * i;
}
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i) {
ifact[i - 1] = ifact[i] * i;
}
}
mint permutation(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[n - k];
}
mint combination(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
//---------------------------------------------------------
void solve() {
ll N, K;
in(N, K);
vll A(N);
vin(A);
ll sum1 = 0;
for1(i, N) { sum1 += A[i]; }
vll div;
for (ll d = 1; d * d <= sum1; ++d) {
if (sum1 % d == 0) {
div.push_back(d);
if (d != sum1 / d) {
div.push_back(sum1 / d);
}
}
}
sort(all(div), greater<ll>());
for (ll d : div) {
vll B(N);
for1(i, N) { B[i] = A[i] % d; }
sort(all(B));
vll P(N + 1);
vll M(N + 1);
for1(i, N) { P[i + 1] = P[i] + B[i]; }
rfor2(i, N - 1, -1) { M[i] = M[i + 1] + (d - B[i]); }
for2(i, 1, N) {
ll l = P[i];
ll r = M[i];
if (l == r && l <= K) {
print(d);
return;
}
}
}
}
//---------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
}
| #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751L
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": ";
for1(i, size) {
if (i != 0) {
cerr << ' ';
}
cerr << v[i];
}
cerr << '\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
ll divup(ll nume, ll deno) {
assert(nume >= 0);
assert(deno > 0);
return (nume + deno - 1) / deno;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void vin(vector<T> &v) {
ll len = v.size();
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
cin >> h;
in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
const ll mod = 1000000007LL; // 10**9 + 7
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &v) {
os << v.x;
return os;
}
};
//---------------------------------------------------------
struct mintcomb {
vector<mint> fact, ifact;
mintcomb(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i) {
fact[i] = fact[i - 1] * i;
}
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i) {
ifact[i - 1] = ifact[i] * i;
}
}
mint permutation(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[n - k];
}
mint combination(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
//---------------------------------------------------------
void solve() {
ll N, K;
in(N, K);
vll A(N);
vin(A);
ll sum1 = 0;
for1(i, N) { sum1 += A[i]; }
vll div;
for (ll d = 1; d * d <= sum1; ++d) {
if (sum1 % d == 0) {
div.push_back(d);
if (d != sum1 / d) {
div.push_back(sum1 / d);
}
}
}
sort(all(div), greater<ll>());
for (ll d : div) {
vll B(N);
for1(i, N) { B[i] = A[i] % d; }
sort(all(B));
vll P(N + 1);
vll M(N + 1);
for1(i, N) { P[i + 1] = P[i] + B[i]; }
rfor2(i, N - 1, -1) { M[i] = M[i + 1] + (d - B[i]); }
for1(i, N + 1) {
ll l = P[i];
ll r = M[i];
if (l == r && l <= K) {
print(d);
return;
}
}
}
}
//---------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
}
| [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 766,501 | 766,502 | u426683236 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
};
} fio;
int N, K;
vector<int> A;
bool solve(int num) {
vector<int> B, sum;
for (int i = 0; i < N; i++) {
if (A[i] % num)
B.push_back(A[i] % num);
}
if (B.size() == 0)
return true;
sort(B.begin(), B.end());
sum.resize(B.size() + 1);
// cout<<endl;
// cout<<"num = "<<num<<endl;
for (int i = 0; i < B.size(); i++) {
sum[i + 1] += sum[i] + num - B[i];
// cout<<"B = "<<B[i]<<" "<<sum[i+1]<<endl;
}
for (int i = 0, s = 0; i < B.size(); i++) {
// cout<<s<<" == "<<sum[B.size()] - sum[i]<<endl;
if (sum[B.size()] - sum[i] + s <= K)
return true;
s += B[i];
}
return false;
}
signed main() {
cout << fixed << setprecision(10);
int sum = 0;
int ans = 1;
cin >> N >> K;
A.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
for (int i = 1; i * i <= sum; i++) {
if (sum % i)
continue;
if (solve(i))
ans = max(ans, i);
if (solve(sum / i))
ans = max(ans, sum / i);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
};
} fio;
int N, K;
vector<int> A;
bool solve(int num) {
vector<int> B, sum;
for (int i = 0; i < N; i++) {
if (A[i] % num)
B.push_back(A[i] % num);
}
if (B.size() == 0)
return true;
sort(B.begin(), B.end());
sum.resize(B.size() + 1);
// cout<<endl;
// cout<<"num = "<<num<<endl;
for (int i = 0; i < B.size(); i++) {
sum[i + 1] += sum[i] + num - B[i];
// cout<<"B = "<<B[i]<<" "<<sum[i+1]<<endl;
}
for (int i = 0, s = 0; i < B.size(); i++) {
// cout<<s<<" == "<<sum[B.size()] - sum[i]<<endl;
// if(s == sum[B.size()] - sum[i] && s <= K) return true;
if (max(sum[B.size()] - sum[i], s) <= K)
return true;
s += B[i];
}
return false;
}
signed main() {
cout << fixed << setprecision(10);
int sum = 0;
int ans = 1;
cin >> N >> K;
A.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
for (int i = 1; i * i <= sum; i++) {
if (sum % i)
continue;
if (solve(i))
ans = max(ans, i);
if (solve(sum / i))
ans = max(ans, sum / i);
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 766,503 | 766,504 | u233393801 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
vector<int> A(n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
auto F = factorize(accumulate(A.begin(), A.end(), 0));
sort(F.begin(), F.end(), greater<int>());
for (const auto &f : F) {
vector<int> B(n);
for (int i = 0; i < n; i++)
B[i] = A[i] % f;
if (accumulate(B.begin(), B.end(), 0, [&](const auto &l, const auto &r) {
return l + min(r, f - r);
}) > k)
continue;
const auto S = accumulate(B.begin(), B.end(), 0);
const auto i = S / f;
nth_element(B.begin(), B.begin() + (n - i), B.end());
if (max(accumulate(B.begin(), B.begin() + (n - i), 0),
S - accumulate(B.begin() + (n - i), B.end(), 0)) <= k) {
printf("%d\n", f);
return 0;
}
}
puts("0");
} | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
vector<int> A(n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
auto F = factorize(accumulate(A.begin(), A.end(), 0));
sort(F.begin(), F.end(), greater<int>());
for (const auto &f : F) {
vector<int> B(n);
for (int i = 0; i < n; i++)
B[i] = A[i] % f;
if (accumulate(B.begin(), B.end(), 0, [&](const auto &l, const auto &r) {
return l + min(r, f - r);
}) > k + k)
continue;
const auto S = accumulate(B.begin(), B.end(), 0);
const auto i = S / f;
nth_element(B.begin(), B.begin() + (n - i), B.end());
if (max(accumulate(B.begin(), B.begin() + (n - i), 0),
S - accumulate(B.begin() + (n - i), B.end(), 0)) <= k) {
printf("%d\n", f);
return 0;
}
}
puts("0");
} | [
"control_flow.branch.if.condition.change"
] | 766,516 | 766,517 | u268793453 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
vector<int> A(n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
auto F = factorize(accumulate(A.begin(), A.end(), 0));
sort(F.begin(), F.end(), greater<int>());
for (const auto &f : F) {
vector<int> B(n);
for (int i = 0; i < n; i++)
B[i] = A[i] % f;
if (accumulate(B.begin(), B.end(), 0, [&](const auto &l, const auto &r) {
return l + min(r, f - r);
}) > k)
continue;
const auto S = accumulate(B.begin(), B.end(), 0);
const auto i = S / f;
nth_element(B.begin(), B.begin() + (n - i), B.end());
if (max(accumulate(B.begin(), B.begin() + (n - i), 0),
S - accumulate(B.begin() + (n - i), B.end(), 0)) <= k) {
printf("%d\n", f);
return 0;
}
}
puts("0");
} | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
vector<int> A(n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
auto F = factorize(accumulate(A.begin(), A.end(), 0));
sort(F.begin(), F.end(), greater<int>());
for (const auto &f : F) {
vector<int> B(n);
for (int i = 0; i < n; i++)
B[i] = A[i] % f;
if (accumulate(
B.begin(), B.end(), 0,
[&](const auto &l, const auto &r) { return l + min(r, f - r); }) /
2 >
k)
continue;
const auto S = accumulate(B.begin(), B.end(), 0);
const auto i = S / f;
nth_element(B.begin(), B.begin() + (n - i), B.end());
if (max(accumulate(B.begin(), B.begin() + (n - i), 0),
S - accumulate(B.begin() + (n - i), B.end(), 0)) <= k) {
printf("%d\n", f);
return 0;
}
}
puts("0");
} | [
"control_flow.branch.if.condition.change"
] | 766,516 | 766,518 | u268793453 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
cin >> n >> k;
vector<int64_t> A(n);
copy_n(istream_iterator<int64_t>(cin), n, A.begin());
auto factors = factorize(accumulate(A.begin(), A.end(), 0L));
int64_t ans = 0;
for (const auto &f : factors) {
vector<int64_t> B(n);
for (int i = 0; i < n; i++)
B[i] = A[i] % f;
auto S = accumulate(B.begin(), B.end(), 0L);
auto i = S / f;
nth_element(B.begin(), B.begin() + i, B.end());
if (max(accumulate(B.begin(), B.begin() + (n - i), 0L),
i * f - accumulate(B.begin() + (n - i), B.end(), 0L)) <= k)
ans = max(ans, f);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
cin >> n >> k;
vector<int64_t> A(n);
copy_n(istream_iterator<int64_t>(cin), n, A.begin());
auto factors = factorize(accumulate(A.begin(), A.end(), 0L));
int64_t ans = 0;
for (const auto &f : factors) {
vector<int64_t> B(n);
for (int i = 0; i < n; i++)
B[i] = A[i] % f;
auto S = accumulate(B.begin(), B.end(), 0L);
auto i = S / f;
nth_element(B.begin(), B.begin() + (n - i), B.end());
if (max(accumulate(B.begin(), B.begin() + (n - i), 0L),
i * f - accumulate(B.begin() + (n - i), B.end(), 0L)) <= k)
ans = max(ans, f);
}
cout << ans << endl;
} | [
"call.arguments.change"
] | 766,519 | 766,520 | u268793453 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
const int INF = 1 << 30;
const ll INFll = 1ll << 62;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
ll N, K;
cin >> N >> K;
Vll A(N);
rep(i, N) cin >> A[i];
ll sum = 0;
rep(i, N) sum += A[i];
auto div = divisor(sum);
reverse(ALL(div));
for (auto e : div) {
Vll b(N);
rep(i, N) { b[i] = A[i] % e; }
sort(ALL(b));
Vll s1(N + 1), s2(N + 1);
rep(i, N) {
s1[i + 1] += s1[i] + b[i];
s2[i + 1] += s2[i] + e - b[N - i - 1];
}
ll cmin = 0;
rep(i, N + 1) { chmin(cmin, max(s1[i], s2[N - i])); }
if (cmin <= K) {
cout << e << endl;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
const int INF = 1 << 30;
const ll INFll = 1ll << 62;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
ll N, K;
cin >> N >> K;
Vll A(N);
rep(i, N) cin >> A[i];
ll sum = 0;
rep(i, N) sum += A[i];
auto div = divisor(sum);
reverse(ALL(div));
for (auto e : div) {
Vll b(N);
rep(i, N) { b[i] = A[i] % e; }
sort(ALL(b));
Vll s1(N + 1), s2(N + 1);
rep(i, N) {
s1[i + 1] += s1[i] + b[i];
s2[i + 1] += s2[i] + e - b[N - i - 1];
}
ll cmin = INFll;
rep(i, N + 1) { chmin(cmin, max(s1[i], s2[N - i])); }
if (cmin <= K) {
cout << e << endl;
return 0;
}
}
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 766,521 | 766,522 | u366381207 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CONST = 1000000007;
const int BIG_INT = 1000000000;
const ll BIG_NUM = 1000000000000000000;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
int maxG = sum / n;
if (sum % n != 0) {
maxG++;
}
set<int> cd;
for (int i = 1; i <= maxG; i++) {
if (i > sum) {
break;
}
if (sum % i == 0) {
cd.insert(i);
}
}
for (int i = 1; i < n; i++) {
if (sum % i == 0) {
cd.insert(sum / i);
}
}
int ans = 0;
for (auto it = cd.begin(); it != cd.end(); it++) {
vector<int> rem(n);
for (int i = 0; i < n; i++) {
rem[i] = a[i] % (*it);
}
sort(rem.begin(), rem.end());
int cnt = 0;
int rp = n - 1;
int r = 0;
for (int i = 0; i < n; i++) {
if (i == rp) {
break;
}
r += rem[i];
cnt += rem[i];
while (r > 0) {
if (rem[rp] + r > (*it)) {
r -= (*it) - rem[rp];
rp--;
} else {
rem[rp] += r;
r = 0;
}
}
}
if (cnt < k) {
ans = max(ans, *it);
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CONST = 1000000007;
const int BIG_INT = 1000000000;
const ll BIG_NUM = 1000000000000000000;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
int maxG = sum / n;
if (sum % n != 0) {
maxG++;
}
set<int> cd;
for (int i = 1; i <= maxG; i++) {
if (i > sum) {
break;
}
if (sum % i == 0) {
cd.insert(i);
}
}
for (int i = 1; i < n; i++) {
if (sum % i == 0) {
cd.insert(sum / i);
}
}
int ans = 0;
for (auto it = cd.begin(); it != cd.end(); it++) {
vector<int> rem(n);
for (int i = 0; i < n; i++) {
rem[i] = a[i] % (*it);
}
sort(rem.begin(), rem.end());
int cnt = 0;
int rp = n - 1;
int r = 0;
for (int i = 0; i < n; i++) {
if (i == rp) {
break;
}
r += rem[i];
cnt += rem[i];
while (r > 0) {
if (rem[rp] + r > (*it)) {
r -= (*it) - rem[rp];
rp--;
} else {
rem[rp] += r;
r = 0;
}
}
}
if (cnt <= k) {
ans = max(ans, *it);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,523 | 766,524 | u156778176 | cpp |
p02955 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n, K;
cin >> n >> K;
vector<ll> a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
ll ans = 0;
for (int i = 2; i <= sqrt(sum); i++) {
if (sum % i != 0)
continue;
vector<ll> p = {i, sum / i};
rep(k, 2) {
vector<ll> b = a;
rep(j, n) { b[j] %= p[k]; }
sort(all(b));
vector<ll> s(n + 1);
s[0] = 0;
rep(j, n) { s[j + 1] = s[j] + b[j]; }
rep(j, n + 1) {
ll mns = s[j];
ll pls = p[k] * (n - j) - (s[n] - s[j]);
if (mns == pls && pls <= K)
chmax(ans, p[k]);
}
}
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n, K;
cin >> n >> K;
vector<ll> a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
ll ans = 0;
for (int i = 1; i <= sqrt(sum); i++) {
if (sum % i != 0)
continue;
vector<ll> p = {i, sum / i};
rep(k, 2) {
vector<ll> b = a;
rep(j, n) { b[j] %= p[k]; }
sort(all(b));
vector<ll> s(n + 1);
s[0] = 0;
rep(j, n) { s[j + 1] = s[j] + b[j]; }
rep(j, n + 1) {
ll mns = s[j];
ll pls = p[k] * (n - j) - (s[n] - s[j]);
if (mns == pls && pls <= K)
chmax(ans, p[k]);
}
}
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 766,525 | 766,526 | u136342563 | cpp |
p02955 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> div(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.emplace_back(i);
if (i != n / i)
res.emplace_back(n / i);
}
}
return res;
}
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> divs = div(accumulate(a.begin(), a.end(), 0LL));
long long ans = 0;
for (auto &e : divs) {
vector<long long> mods(n);
for (int i = 0; i < n; i++)
mods[i] = a[i] % e;
sort(mods.begin(), mods.end());
vector<long long> minus(n + 1);
for (int i = 0; i < n; i++)
minus[i + 1] = minus[i] + mods[i];
vector<long long> plus(n + 1);
for (int i = n - 1; i >= 0; i++)
plus[i] = plus[i + 1] + e - mods[i];
for (long long i = 0; i <= n; ++i) {
if (max(plus[i], minus[i]) <= k)
ans = max(ans, e);
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> div(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.emplace_back(i);
if (i != n / i)
res.emplace_back(n / i);
}
}
return res;
}
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> divs = div(accumulate(a.begin(), a.end(), 0LL));
long long ans = 0;
for (auto &e : divs) {
vector<long long> mods(n);
for (int i = 0; i < n; i++)
mods[i] = a[i] % e;
sort(mods.begin(), mods.end());
vector<long long> minus(n + 1);
for (int i = 0; i < n; i++)
minus[i + 1] = minus[i] + mods[i];
vector<long long> plus(n + 1);
for (int i = n - 1; i >= 0; i--)
plus[i] = plus[i + 1] + e - mods[i];
for (long long i = 0; i <= n; ++i) {
if (max(plus[i], minus[i]) <= k)
ans = max(ans, e);
}
}
cout << ans << endl;
}
| [] | 766,534 | 766,535 | u530329977 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
vector<long long> yaku(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
long long sum = 0;
rep(i, 0, N) {
cin >> A[i];
sum += A[i];
}
vector<long long> v = yaku(sum);
sort(v.begin(), v.end(), greater<long long>());
// for (auto m : v)
// {
// cout << m << endl;
// }
for (auto m : v) {
vector<long long> modA(N);
rep(i, 0, N) { modA[i] = A[i] % m; }
sort(modA.begin(), modA.end());
int l = 0;
int r = N - 1;
long long tmp = 0;
bool kekka = false;
long long count = 0;
while (true) {
// cout << m << "," << l << "," << r << endl;
if (l == r) {
if (tmp <= 0) {
count += modA[l];
}
if ((modA[l] + tmp) % m == 0 && count <= K) {
kekka = true;
}
break;
} else if (modA[l] == 0) {
l++;
continue;
} else if (tmp <= 0) {
tmp += modA[l];
count += modA[l];
l++;
} else {
tmp -= m - modA[r];
r--;
}
}
if (kekka) {
cout << m << endl;
break;
}
}
} | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
vector<long long> yaku(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
long long sum = 0;
rep(i, 0, N) {
cin >> A[i];
sum += A[i];
}
vector<long long> v = yaku(sum);
sort(v.begin(), v.end(), greater<long long>());
// for (auto m : v)
// {
// cout << m << endl;
// }
for (auto m : v) {
vector<long long> modA(N);
rep(i, 0, N) { modA[i] = A[i] % m; }
sort(modA.begin(), modA.end());
int l = 0;
int r = N - 1;
long long tmp = 0;
bool kekka = false;
long long count = 0;
while (true) {
// cout << m << "," << l << "," << r << endl;
if (l == r) {
if (tmp <= 0) {
count += modA[l];
}
if ((modA[l] + tmp) % m == 0 && count <= K) {
kekka = true;
}
break;
} else if (modA[l] == 0) {
l++;
continue;
} else if (tmp <= 0) {
tmp += modA[l];
count += modA[l];
l++;
} else {
tmp -= m - modA[r];
r--;
}
}
if (kekka) {
cout << m << endl;
break;
}
}
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 766,539 | 766,540 | u183971632 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int n, a[N];
ll check(int x) {
vector<int> v;
ll s = 0;
for (int i = 0; i < n; i++) {
v.push_back(a[i] % x);
s += v.back();
}
sort(v.begin(), v.end());
int c = s / x;
ll ret = 0;
for (int i = int(v.size()) - 1; i >= 0 && c; i--) {
ret += x - v[i];
c--;
}
return ret;
}
int main() {
ll k;
cin >> n >> k;
ll s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
ll ans = 1;
for (ll i = 2; i * i <= s; i++) {
if (s % i == 0 && check(i) <= k)
ans = max(ans, i);
if (s % i == 0 && check(s / i) <= k)
ans = max(ans, s / i);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int n, a[N];
ll check(int x) {
vector<int> v;
ll s = 0;
for (int i = 0; i < n; i++) {
v.push_back(a[i] % x);
s += v.back();
}
sort(v.begin(), v.end());
int c = s / x;
ll ret = 0;
for (int i = int(v.size()) - 1; i >= 0 && c; i--) {
ret += x - v[i];
c--;
}
return ret;
}
int main() {
ll k;
cin >> n >> k;
ll s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
ll ans = 1;
for (ll i = 1; i * i <= s; i++) {
if (s % i == 0 && check(i) <= k)
ans = max(ans, i);
if (s % i == 0 && check(s / i) <= k)
ans = max(ans, s / i);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 766,543 | 766,544 | u513000862 | cpp |
p02955 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int s = 0;
rep(i, n) s += a[i];
vector<int> divisor;
for (int i = 1; i * i <= s; i++) {
if (i * i == s) {
divisor.push_back(i);
break;
}
if (s % i == 0) {
divisor.push_back(i);
divisor.push_back(s / i);
}
}
int ans = 1;
for (int d : divisor) {
vector<int> b(n);
rep(i, n) { b[i] = a[i] % d; }
sort(b.begin(), b.end());
vector<ll> upcum(n + 1, 0);
vector<ll> downcum(n + 1, 0);
rep(i, n) {
upcum[i + 1] = upcum[i] + (d - b[i]);
downcum[i + 1] = downcum[i] + b[i];
}
ll mi = 1 << 60;
rep(i, n + 1) { mi = min(mi, max(downcum[i], (upcum[n] - upcum[i]))); }
if (mi <= k)
ans = max(ans, d);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int s = 0;
rep(i, n) s += a[i];
vector<int> divisor;
for (int i = 1; i * i <= s; i++) {
if (i * i == s) {
divisor.push_back(i);
break;
}
if (s % i == 0) {
divisor.push_back(i);
divisor.push_back(s / i);
}
}
int ans = 1;
for (int d : divisor) {
vector<int> b(n);
rep(i, n) { b[i] = a[i] % d; }
sort(b.begin(), b.end());
vector<ll> upcum(n + 1, 0);
vector<ll> downcum(n + 1, 0);
rep(i, n) {
upcum[i + 1] = upcum[i] + (d - b[i]);
downcum[i + 1] = downcum[i] + b[i];
}
ll mi = 1L << 60;
rep(i, n + 1) { mi = min(mi, max(downcum[i], (upcum[n] - upcum[i]))); }
if (mi <= k)
ans = max(ans, d);
}
cout << ans << endl;
return 0;
} | [
"literal.number.type.widen.change"
] | 766,560 | 766,561 | u270681687 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <class A, class B>
ostream &operator<<(ostream &ost, const pair<A, B> &p) {
ost << "{" << p.first << "," << p.second << "}";
return ost;
}
template <class T> ostream &operator<<(ostream &ost, const vector<T> &v) {
ost << "{";
for (int i = 0; i < v.size(); i++) {
if (i)
ost << ",";
ost << v[i];
}
ost << "}";
return ost;
}
int N, K;
int A[555];
bool check(int g) {
vint lis;
rep(i, N) {
if (A[i] % g == 0)
continue;
lis.pb(A[i] % g);
}
sort(all(lis));
for (int i = 1; i < lis.size(); i++) {
int p = 0, s = 0;
rep(j, i) p += lis[j];
for (int j = i; j < lis.size(); j++)
s += g - lis[j];
if (p != s)
continue;
if (p <= K)
return true;
}
return false;
}
signed main() {
cin >> N >> K;
rep(i, N) cin >> A[i];
int sum = accumulate(A, A + N, 0ll);
int ans = 0;
for (int g = 1; g * g <= sum; g++) {
if (sum % g)
continue;
if (check(g))
chmax(ans, g);
if (check(sum / g))
chmax(ans, sum / g);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <class A, class B>
ostream &operator<<(ostream &ost, const pair<A, B> &p) {
ost << "{" << p.first << "," << p.second << "}";
return ost;
}
template <class T> ostream &operator<<(ostream &ost, const vector<T> &v) {
ost << "{";
for (int i = 0; i < v.size(); i++) {
if (i)
ost << ",";
ost << v[i];
}
ost << "}";
return ost;
}
int N, K;
int A[555];
bool check(int g) {
vint lis;
rep(i, N) {
if (A[i] % g == 0)
continue;
lis.pb(A[i] % g);
}
sort(all(lis));
for (int i = 0; i <= lis.size(); i++) {
int p = 0, s = 0;
rep(j, i) p += lis[j];
for (int j = i; j < lis.size(); j++)
s += g - lis[j];
if (p != s)
continue;
if (p <= K)
return true;
}
return false;
}
signed main() {
cin >> N >> K;
rep(i, N) cin >> A[i];
int sum = accumulate(A, A + N, 0ll);
int ans = 0;
for (int g = 1; g * g <= sum; g++) {
if (sum % g)
continue;
if (check(g))
chmax(ans, g);
if (check(sum / g))
chmax(ans, sum / g);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 766,562 | 766,563 | u685892567 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
vector<int> vec;
for (int i = 1; i <= sqrt(sum); i++) {
if (sum % i == 0) {
vec.push_back(i);
vec.push_back(sum / i);
}
}
int ans = 0;
for (int p : vec) {
auto v = a;
for (int i = 0; i < n; i++) {
v[i] = a[i] % p;
}
sort(v.begin(), v.end());
vector<int> left(n + 1, v[0]), right(n + 1, 0);
for (int i = 1; i < n; i++) {
left[i] = left[i - 1] + v[i];
}
for (int i = n - 1; i >= 0; i--) {
right[i] = right[i + 1] + v[i];
}
for (int i = 1; i < n; i++) {
int res = max(left[i - 1], right[i]);
if (res <= k)
ans = max(ans, p);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
vector<int> vec;
for (int i = 1; i <= sqrt(sum); i++) {
if (sum % i == 0) {
vec.push_back(i);
vec.push_back(sum / i);
}
}
int ans = 0;
for (int p : vec) {
auto v = a;
for (int i = 0; i < n; i++) {
v[i] = a[i] % p;
}
sort(v.begin(), v.end());
vector<int> left(n + 1, v[0]), right(n + 1, 0);
for (int i = 1; i < n; i++) {
left[i] = left[i - 1] + v[i];
}
for (int i = n - 1; i >= 0; i--) {
right[i] = right[i + 1] + p - v[i];
}
for (int i = 1; i <= n; i++) {
int res = max(left[i - 1], right[i]);
if (res <= k)
ans = max(ans, p);
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 766,574 | 766,575 | u344122377 | cpp |
p02955 | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using namespace std;
const int N = 4e3 + 219;
const ll M = 3e5 + 19;
const ll inf = 1e15 + 10;
const ll mod = 1e9 + 7;
ll n, k, a[N], r[N], p[N], s[N], ans = 0;
vector<ll> d;
int main() {
cin >> n >> k;
ll S = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
S += a[i];
}
ll t = sqrt(S + 0.5);
for (ll i = 1; i <= t; i++) {
if (S % i == 0) {
d.pb(i);
if (S / i != i)
d.pb(S / i);
}
}
for (int i = 0; i < d.size(); i++) {
for (int j = 1; j <= n; j++)
r[j] = a[j] % d[i];
sort(r + 1, r + n + 1);
p[0] = s[n + 1] = 0;
for (int j = 1; j <= n; j++)
p[j] = p[j - 1] + r[j];
for (int j = n; j >= 1; j--) {
if (r[j] == 0)
s[j] = s[j + 1];
else
s[j] = s[j + 1] + d[i] - r[j];
}
bool is = 0;
for (int j = 1; j < n; j++) {
if ((p[j] - s[j + 1]) % d[i] == 0) {
if (p[j] >= s[j + 1] && p[j] < k) {
is = 1;
break;
}
if (p[j] < s[j + 1] && s[j + 1] < k) {
is = 1;
break;
}
}
}
if (is)
ans = max(ans, d[i]);
}
cout << ans;
} | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using namespace std;
const int N = 4e3 + 219;
const ll M = 3e5 + 19;
const ll inf = 1e15 + 10;
const ll mod = 1e9 + 7;
ll n, k, a[N], r[N], p[N], s[N], ans = 0;
vector<ll> d;
int main() {
cin >> n >> k;
ll S = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
S += a[i];
}
ll t = sqrt(S + 0.5);
for (ll i = 1; i <= t; i++) {
if (S % i == 0) {
d.pb(i);
if (S / i != i)
d.pb(S / i);
}
}
for (int i = 0; i < d.size(); i++) {
for (int j = 1; j <= n; j++)
r[j] = a[j] % d[i];
sort(r + 1, r + n + 1);
p[0] = s[n + 1] = 0;
for (int j = 1; j <= n; j++)
p[j] = p[j - 1] + r[j];
for (int j = n; j >= 1; j--) {
if (r[j] == 0)
s[j] = s[j + 1];
else
s[j] = s[j + 1] + d[i] - r[j];
}
bool is = 0;
for (int j = 1; j < n; j++) {
if ((p[j] - s[j + 1]) % d[i] == 0) {
if (p[j] >= s[j + 1] && p[j] <= k) {
is = 1;
break;
}
if (p[j] < s[j + 1] && s[j + 1] <= k) {
is = 1;
break;
}
}
}
if (is)
ans = max(ans, d[i]);
}
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,587 | 766,588 | u892889246 | cpp |
p02955 | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using namespace std;
const int N = 4e3 + 219;
const ll M = 3e5 + 19;
const ll inf = 1e15 + 10;
const ll mod = 1e9 + 7;
ll n, k, a[N], r[N], p[N], s[N], ans = 0;
vector<ll> d;
int main() {
cin >> n >> k;
ll S = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
S += a[i];
}
ll t = sqrt(S + 0.5);
for (ll i = 1; i <= t; i++) {
if (S % i == 0) {
d.pb(i);
if (S / i != i)
d.pb(S / i);
}
}
for (int i = 0; i < d.size(); i++) {
for (int j = 1; j <= n; j++)
r[j] = a[j] % d[i];
sort(r + 1, r + n + 1);
p[0] = s[n + 1] = 0;
for (int j = 1; j <= n; j++)
p[j] = p[j - 1] + r[j];
for (int j = n; j >= 1; j--) {
if (r[j] == 0)
s[j] = s[j + 1];
else
s[j] = s[j + 1] + d[i] - r[j];
}
bool is = 0;
for (int j = 0; j <= n; j++) {
if ((p[j] - s[j + 1]) % d[i] == 0) {
if (p[j] >= s[j + 1] && p[j] < k) {
is = 1;
break;
}
if (p[j] < s[j + 1] && s[j + 1] < k) {
is = 1;
break;
}
}
}
if (is)
ans = max(ans, d[i]);
}
cout << ans;
} | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using namespace std;
const int N = 4e3 + 219;
const ll M = 3e5 + 19;
const ll inf = 1e15 + 10;
const ll mod = 1e9 + 7;
ll n, k, a[N], r[N], p[N], s[N], ans = 0;
vector<ll> d;
int main() {
cin >> n >> k;
ll S = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
S += a[i];
}
ll t = sqrt(S + 0.5);
for (ll i = 1; i <= t; i++) {
if (S % i == 0) {
d.pb(i);
if (S / i != i)
d.pb(S / i);
}
}
for (int i = 0; i < d.size(); i++) {
for (int j = 1; j <= n; j++)
r[j] = a[j] % d[i];
sort(r + 1, r + n + 1);
p[0] = s[n + 1] = 0;
for (int j = 1; j <= n; j++)
p[j] = p[j - 1] + r[j];
for (int j = n; j >= 1; j--) {
if (r[j] == 0)
s[j] = s[j + 1];
else
s[j] = s[j + 1] + d[i] - r[j];
}
bool is = 0;
for (int j = 1; j < n; j++) {
if ((p[j] - s[j + 1]) % d[i] == 0) {
if (p[j] >= s[j + 1] && p[j] <= k) {
is = 1;
break;
}
if (p[j] < s[j + 1] && s[j + 1] <= k) {
is = 1;
break;
}
}
}
if (is)
ans = max(ans, d[i]);
}
cout << ans;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 766,589 | 766,588 | u892889246 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef int64_t ll;
const ll MOD = 1000000007;
ll K, N;
vector<ll> A(500, 0);
int main() {
ll at = 0;
cin >> N >> K;
REP(i, N) {
cin >> A[i];
at += A[i];
}
vector<ll> d;
vector<ll> am(N, 0);
vector<ll> amn(N, 0);
// 合計の約数のリストを求める
for (ll i = 1; i * i <= at; ++i) {
if (at % i == 0) {
d.push_back(i);
if (at / i != i) {
d.push_back(at / i);
}
}
}
ll ans = 0;
for (auto di : d) {
// 約数候補diに対して、各A要素での余りを求める
ll num = 0;
REP(i, N) { am[i] = A[i] % di; }
#if 0
cout << di << " : ";
REP(i,N) cout << am[i] << " ";
cout << endl;
#endif
sort(am.begin(), am.end());
amn[N - 1] = di - am[N - 1];
for (int i = N - 1; i > 0; --i) {
// diにするのに必要な数の累積和
amn[i - 1] = amn[i] + (di - am[i - 1]);
}
REP(i, N - 1) {
// 0にするのに必要な数の累積和
am[i + 1] += am[i];
}
#if 0
cout << " "; REP(i,N) cout << am[i] << " "; cout << endl;
cout << " "; REP(i,N) cout << amn[i] << " "; cout << endl;
#endif
REP(i, N - 1) {
if (am[i] == amn[i + 1]) {
// 2つの累積和が左右で同じになるポイントを探す
num = di;
if (am[i] > K) {
num = 0;
}
break;
}
}
ans = max(ans, num);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef int64_t ll;
const ll MOD = 1000000007;
ll K, N;
vector<ll> A(500, 0);
int main() {
ll at = 0;
cin >> N >> K;
REP(i, N) {
cin >> A[i];
at += A[i];
}
vector<ll> d;
vector<ll> am(N, 0);
vector<ll> amn(N, 0);
// 合計の約数のリストを求める
for (ll i = 1; i * i <= at; ++i) {
if (at % i == 0) {
d.push_back(i);
if (at / i != i) {
d.push_back(at / i);
}
}
}
ll ans = 1;
for (auto di : d) {
// 約数候補diに対して、各A要素での余りを求める
ll num = 0;
REP(i, N) { am[i] = A[i] % di; }
#if 0
cout << di << " : ";
REP(i,N) cout << am[i] << " ";
cout << endl;
#endif
sort(am.begin(), am.end());
amn[N - 1] = di - am[N - 1];
for (int i = N - 1; i > 0; --i) {
// diにするのに必要な数の累積和
amn[i - 1] = amn[i] + (di - am[i - 1]);
}
REP(i, N - 1) {
// 0にするのに必要な数の累積和
am[i + 1] += am[i];
}
#if 0
cout << " "; REP(i,N) cout << am[i] << " "; cout << endl;
cout << " "; REP(i,N) cout << amn[i] << " "; cout << endl;
#endif
REP(i, N - 1) {
if (am[i] == amn[i + 1]) {
// 2つの累積和が左右で同じになるポイントを探す
num = di;
if (am[i] > K) {
num = 0;
}
break;
}
}
ans = max(ans, num);
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 766,595 | 766,596 | u107091170 | cpp |
p02955 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define cst first
#define dur second
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
const int N = 5e2 + 5, M = 2 * N + 5;
int n, x[N], k, sum;
int a[N], b[N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i)
scanf("%d", x + i), sum += x[i];
vector<int> div;
for (ll i = 2; i * i <= sum; ++i) {
if (sum % i)
continue;
div.emplace_back(i);
div.emplace_back(sum / i);
}
sort(div.rbegin(), div.rend());
for (auto num : div) {
vector<int> v;
for (int i = 0; i < n; ++i)
v.emplace_back(x[i] % num);
sort(v.begin(), v.end());
for (int i = 1; i <= n; ++i)
a[i] = a[i - 1] + v[i - 1];
b[n + 1] = 0;
for (int i = n; i; --i) {
int tmp = (num - v[i - 1]);
if (tmp == num)
tmp = 0;
b[i] = b[i + 1] + tmp;
}
bool ok = false;
for (int i = 1; i < n && !ok; ++i)
if (a[i] == b[i + 1] && a[i] <= k)
ok = true;
if (ok) {
printf("%d\n", num);
break;
}
}
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define cst first
#define dur second
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
const int N = 5e2 + 5, M = 2 * N + 5;
int n, x[N], k, sum;
int a[N], b[N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i)
scanf("%d", x + i), sum += x[i];
vector<int> div;
for (ll i = 1; i * i <= sum; ++i) {
if (sum % i)
continue;
div.emplace_back(i);
div.emplace_back(sum / i);
}
sort(div.rbegin(), div.rend());
for (auto num : div) {
// cout << "Num = " << num << endl;
vector<int> v;
for (int i = 0; i < n; ++i)
v.emplace_back(x[i] % num);
sort(v.begin(), v.end());
for (int i = 1; i <= n; ++i)
a[i] = a[i - 1] + v[i - 1];
b[n + 1] = 0;
for (int i = n; i; --i) {
int tmp = (num - v[i - 1]);
if (tmp == num)
tmp = 0;
b[i] = b[i + 1] + tmp;
}
bool ok = false;
for (int i = 1; i < n && !ok; ++i)
if (a[i] == b[i + 1] && a[i] <= k)
ok = true;
if (ok) {
printf("%d\n", num);
return 0;
}
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 766,599 | 766,600 | u775315680 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
vector<int> divisors(int n) {
vector<int> ds;
for (int i = 1; i * i <= n; i++)
if (n % i == 0) {
ds.push_back(i);
if (i * i != n)
ds.push_back(n / i);
}
sort(ds.begin(), ds.end());
return ds;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
const int sum = accumulate(A.begin(), A.end(), 0);
auto divs = divisors(sum);
reverse(divs.begin(), divs.end());
for (int i = 0; i < (int)divs.size(); i++) {
int val = divs[i];
vector<int> rs(N);
int ts = 0;
for (int j = 0; j < N; j++) {
ts += A[j] / val;
rs[j] = A[j] % val;
}
int cnt = sum / val - ts;
sort(rs.begin(), rs.end());
int dist = 0;
for (int j = 0; j < N; j++) {
if (j < N - cnt) {
dist += rs[i];
} else {
dist += val - rs[i];
}
}
if (dist / 2 <= K) {
cout << val << endl;
break;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
vector<int> divisors(int n) {
vector<int> ds;
for (int i = 1; i * i <= n; i++)
if (n % i == 0) {
ds.push_back(i);
if (i * i != n)
ds.push_back(n / i);
}
sort(ds.begin(), ds.end());
return ds;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
const int sum = accumulate(A.begin(), A.end(), 0);
auto divs = divisors(sum);
reverse(divs.begin(), divs.end());
for (int i = 0; i < (int)divs.size(); i++) {
int val = divs[i];
vector<int> rs(N);
int ts = 0;
for (int j = 0; j < N; j++) {
ts += A[j] / val;
rs[j] = A[j] % val;
}
int cnt = sum / val - ts;
sort(rs.begin(), rs.end());
int dist = 0;
for (int j = 0; j < N; j++) {
if (j < N - cnt) {
dist += rs[j];
} else {
dist += val - rs[j];
}
}
if (dist / 2 <= K) {
cout << val << endl;
break;
}
}
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 766,601 | 766,602 | u752161277 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int N, K;
vector<int> A;
int main() {
cin >> N;
cin >> K;
A = vector<int>(N + 1);
int sum = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
sum += A[i];
}
set<int> sumcd;
int s = 2;
while (s * s <= sum) {
if (sum % s == 0) {
sumcd.insert(s);
sumcd.insert(sum / s);
}
s++;
}
sumcd.insert(sum);
int ans = 1;
for (auto it = sumcd.rbegin(); it != sumcd.rend(); it++) {
int g = *it;
vector<int> remainder_list;
for (int i = 1; i <= N; i++) {
int r = A[i] % g;
if (r > 0) {
remainder_list.push_back(r);
}
}
sort(remainder_list.begin(), remainder_list.end());
int p = 0;
int m = (int)remainder_list.size() - 1;
int libra = 0;
int k = 0;
while (p < m && k <= K) {
if (libra <= 0) {
libra += remainder_list[p];
k += remainder_list[p];
p++;
} else {
libra += -g + remainder_list[m];
m--;
}
}
if (k <= K) {
ans = g;
break;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int N, K;
vector<int> A;
int main() {
cin >> N;
cin >> K;
A = vector<int>(N + 1);
int sum = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
sum += A[i];
}
set<int> sumcd;
int s = 2;
while (s * s <= sum) {
if (sum % s == 0) {
sumcd.insert(s);
sumcd.insert(sum / s);
}
s++;
}
sumcd.insert(sum);
int ans = 1;
for (auto it = sumcd.rbegin(); it != sumcd.rend(); it++) {
int g = *it;
vector<int> remainder_list;
for (int i = 1; i <= N; i++) {
int r = A[i] % g;
if (r > 0) {
remainder_list.push_back(r);
}
}
sort(remainder_list.begin(), remainder_list.end());
int p = 0;
int m = (int)remainder_list.size() - 1;
int libra = 0;
int k = 0;
while (p <= m && k <= K) {
if (libra <= 0) {
libra += remainder_list[p];
k += remainder_list[p];
p++;
} else {
libra += -g + remainder_list[m];
m--;
}
}
if (k <= K) {
ans = g;
break;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 766,603 | 766,604 | u647974562 | cpp |
p02959 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
int asum = 0, count = 0;
rep(i, 0, n) {
asum = a[i] + a[i + 1];
if (asum >= b[i]) {
count += b[i];
b[i] -= a[i];
if (b[i] > 0)
a[i + 1] -= b[i];
} else {
count += asum;
a[i] = 0;
a[i + 1] = 0;
}
asum = 0;
}
cout << count << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
ll asum = 0, count = 0;
rep(i, 0, n) {
asum = a[i] + a[i + 1];
if (asum >= b[i]) {
count += b[i];
b[i] -= a[i];
if (b[i] > 0)
a[i + 1] -= b[i];
} else {
count += asum;
a[i] = 0;
a[i + 1] = 0;
}
asum = 0;
}
cout << count << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,607 | 766,608 | u870074807 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep(i, N + 1) cin >> A.at(i);
vector<int> B(N);
rep(i, N) cin >> B.at(i);
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] > B[i]) {
cnt += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
cnt += A[i];
B[i] -= A[i];
A[i] = 0;
}
if (A[i + 1] > B[i]) {
cnt += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
cnt += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
rep(i, N + 1) cin >> A.at(i);
vector<ll> B(N);
rep(i, N) cin >> B.at(i);
ll cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] > B[i]) {
cnt += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
cnt += A[i];
B[i] -= A[i];
A[i] = 0;
}
if (A[i + 1] > B[i]) {
cnt += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
cnt += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
cout << cnt << endl;
}
| [
"variable_declaration.type.change"
] | 766,609 | 766,610 | u823855263 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<ll> b(n);
rep(i, n) cin >> b[i];
int cnt = 0;
for (int i = n - 1; i >= 0; i--) {
// cout << b[i] << endl;
if (b[i] >= a[i] + a[i + 1]) {
cnt += a[i] + a[i + 1];
a[i] = 0;
a[i + 1] = 0;
} else if (b[i] >= a[i + 1]) {
cnt += b[i];
a[i] = a[i] + a[i + 1] - b[i];
a[i + 1] = 0;
} else {
cnt += b[i];
a[i + 1] = a[i + 1] - b[i];
}
// cout << cnt << endl;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<ll> b(n);
rep(i, n) cin >> b[i];
ll cnt = 0;
for (int i = n - 1; i >= 0; i--) {
// cout << b[i] << endl;
if (b[i] >= a[i] + a[i + 1]) {
cnt += a[i] + a[i + 1];
a[i] = 0;
a[i + 1] = 0;
} else if (b[i] >= a[i + 1]) {
cnt += b[i];
a[i] = a[i] + a[i + 1] - b[i];
a[i + 1] = 0;
} else {
cnt += b[i];
a[i + 1] = a[i + 1] - b[i];
}
// cout << cnt << endl;
}
cout << cnt << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,611 | 766,612 | u965095643 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
long long a[N + 1];
for (int i = 0; i < N + 1; ++i)
cin >> a[i];
long long b[N];
for (int i = 0; i < N; ++i)
cin >> b[i];
int ret = 0;
for (int i = 0; i < N; ++i) {
// defeat his town
if (a[i] > b[i]) {
a[i] -= b[i];
ret += b[i];
b[i] = 0;
} else {
ret += a[i];
b[i] -= a[i];
a[i] = 0;
}
// defeat next town
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
ret += b[i];
b[i] = 0;
} else {
ret += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
cout << ret << endl;
} | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
long long a[N + 1];
for (int i = 0; i < N + 1; ++i)
cin >> a[i];
long long b[N];
for (int i = 0; i < N; ++i)
cin >> b[i];
long long ret = 0;
for (int i = 0; i < N; ++i) {
// defeat his town
if (a[i] > b[i]) {
a[i] -= b[i];
ret += b[i];
b[i] = 0;
} else {
ret += a[i];
b[i] -= a[i];
a[i] = 0;
}
// defeat next town
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
ret += b[i];
b[i] = 0;
} else {
ret += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
cout << ret << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,613 | 766,614 | u894471318 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int sum = 0;
int rest;
if (a[0] <= b[0]) {
sum += a[0];
rest = b[0] - a[0];
} else {
sum += b[0];
rest = 0;
}
for (int i = 1; i < n + 1; i++) {
if (i == n) {
if (rest >= a[i]) {
sum += a[i];
} else {
sum += rest;
}
} else if (rest >= a[i]) {
sum += a[i];
rest = b[i];
} else if (rest + b[i] >= a[i]) {
sum += a[i];
rest = rest + b[i] - a[i];
} else {
sum += rest + b[i];
rest = 0;
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll sum = 0;
int rest;
if (a[0] <= b[0]) {
sum += a[0];
rest = b[0] - a[0];
} else {
sum += b[0];
rest = 0;
}
for (int i = 1; i < n + 1; i++) {
if (i == n) {
if (rest >= a[i]) {
sum += a[i];
} else {
sum += rest;
}
} else if (rest >= a[i]) {
sum += a[i];
rest = b[i];
} else if (rest + b[i] >= a[i]) {
sum += a[i];
rest = rest + b[i] - a[i];
} else {
sum += rest + b[i];
rest = 0;
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,615 | 766,616 | u917518913 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll ans;
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
ans = accumulate(a.begin(), a.end(), 0);
for (int i = 0; i < n; i++) {
ll rem = a.at(i) - b.at(i);
if (rem < 0) {
a.at(i) = 0;
a.at(i + 1) += rem;
if (a.at(i + 1) < 0) {
a.at(i + 1) = 0;
}
} else {
a.at(i) = rem;
}
}
ans -= accumulate(a.begin(), a.end(), 0);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll ans;
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
ans = accumulate(a.begin(), a.end(), 0LL);
for (int i = 0; i < n; i++) {
ll rem = a.at(i) - b.at(i);
if (rem < 0) {
a.at(i) = 0;
a.at(i + 1) += rem;
if (a.at(i + 1) < 0) {
a.at(i + 1) = 0;
}
} else {
a.at(i) = rem;
}
}
// for(auto a:a){ cout << a << " ";} cout << endl;
ans -= accumulate(a.begin(), a.end(), 0LL);
cout << ans << endl;
} | [
"literal.number.type.widen.change"
] | 766,619 | 766,620 | u185935459 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int ans;
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
ans = accumulate(a.begin(), a.end(), 0);
for (int i = 0; i < n; i++) {
int rem = a.at(i) - b.at(i);
if (rem < 0) {
a.at(i) = 0;
a.at(i + 1) += rem;
if (a.at(i + 1) < 0) {
a.at(i + 1) = 0;
}
} else {
a.at(i) = rem;
}
}
ans -= accumulate(a.begin(), a.end(), 0);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll ans;
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
ans = accumulate(a.begin(), a.end(), 0LL);
for (int i = 0; i < n; i++) {
ll rem = a.at(i) - b.at(i);
if (rem < 0) {
a.at(i) = 0;
a.at(i + 1) += rem;
if (a.at(i + 1) < 0) {
a.at(i + 1) = 0;
}
} else {
a.at(i) = rem;
}
}
// for(auto a:a){ cout << a << " ";} cout << endl;
ans -= accumulate(a.begin(), a.end(), 0LL);
cout << ans << endl;
} | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 766,621 | 766,620 | u185935459 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long sum = 0;
for (int i = 0; i < N; i++) {
if (B.at(i) >= A.at(i)) {
sum = sum + A.at(i);
B.at(i) = B.at(i) - A.at(i);
if (B.at(i) >= A.at(i + 1)) {
sum = sum + A.at(i + 1);
A.at(i + 1) = 0;
} else {
sum = sum + B.at(i);
A.at(i + 1) = A.at(i + 1) + B.at(i);
}
} else {
sum = sum + B.at(i);
A.at(i) = A.at(i) - B.at(i);
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long sum = 0;
for (int i = 0; i < N; i++) {
if (B.at(i) >= A.at(i)) {
sum = sum + A.at(i);
B.at(i) = B.at(i) - A.at(i);
if (B.at(i) >= A.at(i + 1)) {
sum = sum + A.at(i + 1);
A.at(i + 1) = 0;
} else {
sum = sum + B.at(i);
A.at(i + 1) = A.at(i + 1) - B.at(i);
}
} else {
sum = sum + B.at(i);
A.at(i) = A.at(i) - B.at(i);
}
}
cout << sum << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 766,622 | 766,623 | u028061225 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monster(n + 1), player(n);
for (int i = 0; i < n + 1; ++i)
cin >> monster[i];
for (int i = 0; i < n; ++i)
cin >> player[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
if (player[i] > monster[i]) {
ans += monster[i];
player[i] -= monster[i];
if (player[i] > monster[i + 1]) {
ans += monster[i + 1];
monster[i + 1] = 0;
} else {
ans += player[i];
monster[i + 1] -= player[i];
}
} else {
ans += player[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monster(n + 1), player(n);
for (int i = 0; i < n + 1; ++i)
cin >> monster[i];
for (int i = 0; i < n; ++i)
cin >> player[i];
long long ans = 0;
for (int i = 0; i < n; ++i) {
if (player[i] > monster[i]) {
ans += monster[i];
player[i] -= monster[i];
if (player[i] > monster[i + 1]) {
ans += monster[i + 1];
monster[i + 1] = 0;
} else {
ans += player[i];
monster[i + 1] -= player[i];
}
} else {
ans += player[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,628 | 766,629 | u706341784 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monster(n + 1), player(n);
for (int i = 0; i < n + 1; ++i)
cin >> monster[i];
for (int i = 0; i < n; ++i)
cin >> player[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
if (player[i] > monster[i]) {
ans += monster[i];
player[i] -= monster[i];
if (player[i] > monster[i + 1]) {
ans += monster[i + 1];
monster[i + 1] = 0;
} else {
ans += player[i];
monster[i + 1] -= player[i];
}
} else {
ans += player[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> monster(n + 1), player(n);
for (int i = 0; i < n + 1; ++i)
cin >> monster[i];
for (int i = 0; i < n; ++i)
cin >> player[i];
long long ans = 0;
for (int i = 0; i < n; ++i) {
if (player[i] > monster[i]) {
ans += monster[i];
player[i] -= monster[i];
if (player[i] > monster[i + 1]) {
ans += monster[i + 1];
monster[i + 1] = 0;
} else {
ans += player[i];
monster[i + 1] -= player[i];
}
} else {
ans += player[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,628 | 766,630 | u706341784 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> a(N + 1), b(N);
rep(i, N + 1) cin >> a[i];
rep(i, N) cin >> b[i];
int ans = 0;
rep(i, N) {
if (b[i] <= a[i]) {
ans += b[i];
continue;
} else if (b[i] <= a[i] + a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
continue;
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> a(N + 1), b(N);
rep(i, N + 1) cin >> a[i];
rep(i, N) cin >> b[i];
long long ans = 0;
rep(i, N) {
if (b[i] <= a[i]) {
ans += b[i];
continue;
} else if (b[i] <= a[i] + a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
continue;
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,631 | 766,632 | u914707890 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n, s) for (int i = s; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, N + 1, 0) cin >> A[i];
rep(i, N, 0) cin >> B[i];
int sum = 0;
rep(i, N, 0) {
if (A[i] < B[i]) {
sum += A[i];
if (A[i + 1] < abs(B[i] - A[i])) {
sum += A[i + 1];
A[i + 1] = 0;
} else {
sum += abs(B[i] - A[i]);
A[i + 1] = A[i + 1] - abs(B[i] - A[i]);
}
} else {
sum += B[i];
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n, s) for (int i = s; i < n; i++)
using namespace std;
int main() {
long int N;
cin >> N;
long int A[N + 1], B[N];
rep(i, N + 1, 0) cin >> A[i];
rep(i, N, 0) cin >> B[i];
long int sum = 0;
rep(i, N, 0) {
if (A[i] < B[i]) {
sum += A[i];
if (A[i + 1] < abs(B[i] - A[i])) {
sum += A[i + 1];
A[i + 1] = 0;
} else {
sum += abs(B[i] - A[i]);
A[i + 1] = A[i + 1] - abs(B[i] - A[i]);
}
} else {
sum += B[i];
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 766,633 | 766,634 | u786667376 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n, s) for (int i = s; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, N + 1, 0) cin >> A[i];
rep(i, N, 0) cin >> B[i];
int sum = 0;
rep(i, N, 0) {
if (A[i] <= B[i]) {
sum += A[i];
if (A[i + 1] <= abs(B[i] - A[i])) {
sum += A[i + 1];
A[i + 1] = 0;
} else {
sum += abs(B[i] - A[i]);
A[i + 1] = A[i + 1] - abs(B[i] - A[i]);
}
} else {
sum += B[i];
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n, s) for (int i = s; i < n; i++)
using namespace std;
int main() {
long int N;
cin >> N;
long int A[N + 1], B[N];
rep(i, N + 1, 0) cin >> A[i];
rep(i, N, 0) cin >> B[i];
long int sum = 0;
rep(i, N, 0) {
if (A[i] < B[i]) {
sum += A[i];
if (A[i + 1] < abs(B[i] - A[i])) {
sum += A[i + 1];
A[i + 1] = 0;
} else {
sum += abs(B[i] - A[i]);
A[i + 1] = A[i + 1] - abs(B[i] - A[i]);
}
} else {
sum += B[i];
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,635 | 766,634 | u786667376 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> monsters(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> monsters[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int panch;
panch = min(b[i], monsters[i]);
b[i] -= panch;
ans += panch;
panch = min(b[i], monsters[i + 1]);
b[i] -= panch;
ans += panch;
monsters[i + 1] -= panch;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> monsters(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> monsters[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
int panch;
panch = min(b[i], monsters[i]);
b[i] -= panch;
ans += panch;
panch = min(b[i], monsters[i + 1]);
b[i] -= panch;
ans += panch;
monsters[i + 1] -= panch;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,640 | 766,641 | u957377447 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#define rep(k, i, n) for (int i = k; i < n; ++i)
using namespace std;
typedef long long ll;
int N;
long a[10001], b[10000];
ll sum = 0;
int main(void) {
// Your code here!
cin >> N;
rep(0, i, N + 1) cin >> a[i];
rep(0, i, N) {
cin >> b[i];
if (b[i] < a[i]) {
a[i] -= b[i];
sum += b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] > b[i]) {
sum += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
sum += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
#define rep(k, i, n) for (int i = k; i < n; ++i)
using namespace std;
typedef long long ll;
int N;
long a[100001], b[100000];
ll sum = 0;
int main(void) {
// Your code here!
cin >> N;
rep(0, i, N + 1) cin >> a[i];
rep(0, i, N) {
cin >> b[i];
if (b[i] < a[i]) {
a[i] -= b[i];
sum += b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] > b[i]) {
sum += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
sum += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 766,644 | 766,645 | u246366098 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
for (int i = 0; i < n; i++) {
int dif = a[i] - b[i];
if (dif < 0) {
ans += a[i];
a[i] = 0;
int in = a[i + 1];
a[i + 1] += dif;
if (a[i + 1] < 0) {
ans -= in;
a[i + 1] = 0;
} else
ans -= dif;
} else {
ans += b[i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
for (int i = 0; i < n; i++) {
int dif = a[i] - b[i];
if (dif < 0) {
ans += a[i];
a[i] = 0;
int in = a[i + 1];
a[i + 1] += dif;
if (a[i + 1] < 0) {
ans += in;
a[i + 1] = 0;
} else
ans -= dif;
} else {
ans += b[i];
}
}
cout << ans << endl;
}
| [
"expression.operator.change"
] | 766,648 | 766,649 | u726957641 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int sum = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) > b.at(i)) {
sum += b.at(i);
a.at(i) -= b.at(i);
b.at(i) = 0;
} else {
sum += a.at(i);
b.at(i) -= a.at(i);
a.at(i) = 0;
if (a.at(i + 1) > b.at(i)) {
sum += b.at(i);
a.at(i + 1) -= b.at(i);
b.at(i) = 0;
} else {
sum += a.at(i + 1);
b.at(i) -= a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << sum << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long long sum = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) > b.at(i)) {
sum += b.at(i);
a.at(i) -= b.at(i);
b.at(i) = 0;
} else {
sum += a.at(i);
b.at(i) -= a.at(i);
a.at(i) = 0;
if (a.at(i + 1) > b.at(i)) {
sum += b.at(i);
a.at(i + 1) -= b.at(i);
b.at(i) = 0;
} else {
sum += a.at(i + 1);
b.at(i) -= a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,650 | 766,651 | u195563735 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int sum = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >= b.at(i)) {
sum += b.at(i);
a.at(i) -= b.at(i);
b.at(i) = 0;
} else {
sum += a.at(i);
b.at(i) -= a.at(i);
a.at(i) = 0;
if (a.at(i + 1) >= b.at(i)) {
sum += b.at(i);
a.at(i + 1) -= b.at(i);
b.at(i) = 0;
} else {
sum += a.at(i + 1);
b.at(i) -= a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << sum << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long long sum = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) > b.at(i)) {
sum += b.at(i);
a.at(i) -= b.at(i);
b.at(i) = 0;
} else {
sum += a.at(i);
b.at(i) -= a.at(i);
a.at(i) = 0;
if (a.at(i + 1) > b.at(i)) {
sum += b.at(i);
a.at(i + 1) -= b.at(i);
b.at(i) = 0;
} else {
sum += a.at(i + 1);
b.at(i) -= a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,652 | 766,651 | u195563735 | cpp |
p02959 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v) {
s >> x;
}
return s;
}
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
int SIZE(string s) { return (int)s.size(); }
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
int num = min(a[i], b[i]);
ans += num;
b[i] -= num;
int num2 = min(a[i + 1], b[i]);
ans += num2;
a[i + 1] -= num2;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v) {
s >> x;
}
return s;
}
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
int SIZE(string s) { return (int)s.size(); }
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
int num = min(a[i], b[i]);
ans += num;
b[i] -= num;
int num2 = min(a[i + 1], b[i]);
ans += num2;
a[i + 1] -= num2;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,653 | 766,654 | u891346638 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
int A[100010];
int B[100000];
cin >> N;
for (int a = 0; a < N + 1; a++) {
cin >> A[a];
}
for (int b = 0; b < N; b++) {
cin >> B[b];
}
int answer = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) { //全力
// A[i] -= B[i];
answer += B[i];
} else { //余力あり
if (A[i + 1] >= B[i] - A[i]) { // i+1のモンスターあまる
answer += A[i];
A[i + 1] -= B[i] - A[i];
answer += B[i] - A[i];
} else { //あまらない
answer += A[i] + A[i + 1];
A[i + 1] = 0;
}
// A[i] = 0;
}
}
cout << answer;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
int A[100010];
int B[100000];
cin >> N;
for (int a = 0; a < N + 1; a++) {
cin >> A[a];
}
for (int b = 0; b < N; b++) {
cin >> B[b];
}
long long answer = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) { //全力
// A[i] -= B[i];
answer += B[i];
} else { //余力あり
if (A[i + 1] >= B[i] - A[i]) { // i+1のモンスターあまる
answer += A[i];
A[i + 1] -= B[i] - A[i];
answer += B[i] - A[i];
} else { //あまらない
answer += A[i] + A[i + 1];
A[i + 1] = 0;
}
// A[i] = 0;
}
}
cout << answer;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,655 | 766,656 | u235745986 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int i;
for (i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (i = 0; i < n; i++) {
cin >> b.at(i);
}
int ans = 0;
for (int x : a) {
ans += x;
}
for (i = 0; i < n; i++) {
if (a.at(i) <= b.at(i)) {
a.at(i + 1) -= b.at(i) - a.at(i);
if (a.at(i + 1) < 0) {
a.at(i + 1) = 0;
}
a.at(i) = 0;
} else {
a.at(i) -= b.at(i);
}
}
for (int x : a) {
ans -= x;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int i;
for (i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (i = 0; i < n; i++) {
cin >> b.at(i);
}
int64_t ans = 0;
for (int x : a) {
ans += x;
}
for (i = 0; i < n; i++) {
if (a.at(i) <= b.at(i)) {
a.at(i + 1) -= b.at(i) - a.at(i);
if (a.at(i + 1) < 0) {
a.at(i + 1) = 0;
}
a.at(i) = 0;
} else {
a.at(i) -= b.at(i);
}
}
for (int x : a) {
ans -= x;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 766,657 | 766,658 | u748616342 | cpp |
p02959 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
// constant
const int MOD = (int)1e9 + 7;
const int INF = (int)1e18;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
//
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
//
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<lint> a(n + 2), b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (0 < b[i]) {
if (a[i + 1] <= b[i]) {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
// constant
const int MOD = (int)1e9 + 7;
const int INF = (int)1e18;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
//
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
//
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<lint> a(n + 2), b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
lint ans = 0;
rep(i, n) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (0 < b[i]) {
if (a[i + 1] <= b[i]) {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,663 | 766,664 | u764228018 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
// ith town
if (a[i] >= b[i]) {
sum += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
a[i] = 0;
}
// ith + 1 town
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
sum += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n, sum = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
// ith town
if (a[i] >= b[i]) {
sum += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
a[i] = 0;
}
// ith + 1 town
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
sum += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 766,665 | 766,666 | u918865212 | cpp |
p02959 | #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 = (int)N - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
int sum = 0;
REP(i, n + 1) { cin >> a[i]; }
REP(i, n) {
int b;
cin >> b;
if (b > a[i]) {
b = b - a[i];
sum += a[i];
a[i] = 0;
if (b > a[i + 1]) {
b = b - a[i + 1];
sum += a[i + 1];
a[i + 1] = 0;
} else {
sum += b;
a[i + 1] -= b;
}
} else {
sum += b;
}
}
cout << sum << endl;
}
| #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 = (int)N - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
ll sum = 0;
REP(i, n + 1) { cin >> a[i]; }
REP(i, n) {
int b;
cin >> b;
if (b > a[i]) {
b = b - a[i];
sum += a[i];
a[i] = 0;
if (b > a[i + 1]) {
b = b - a[i + 1];
sum += a[i + 1];
a[i + 1] = 0;
} else {
sum += b;
a[i + 1] -= b;
}
} else {
sum += b;
}
}
cout << sum << endl;
} | [
"variable_declaration.type.change"
] | 766,667 | 766,668 | u458311335 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
long long count = 0;
rep(i, n) {
if (b.at(i) > a.at(i)) {
count += a.at(i);
b.at(i) -= a.at(i);
if (b.at(i) > a.at(i + 1)) {
count += a.at(i + 1);
a.at(i) = 0;
} else {
a.at(i + 1) -= b.at(i);
count += b.at(i);
}
} else {
count += b.at(i);
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
long long count = 0;
rep(i, n) {
if (b.at(i) > a.at(i)) {
count += a.at(i);
b.at(i) -= a.at(i);
if (b.at(i) > a.at(i + 1)) {
count += a.at(i + 1);
a.at(i + 1) = 0;
} else {
a.at(i + 1) -= b.at(i);
count += b.at(i);
}
} else {
count += b.at(i);
}
}
cout << count << endl;
return 0;
} | [
"assignment.change"
] | 766,669 | 766,670 | u690475097 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = n; i > 0; i--) {
cnt += min(b[i - 1], a[i]);
b[i - 1] -= min(b[i - 1], a[i]);
cnt += min(b[i - 1], a[i - 1]);
a[i - 1] -= min(b[i - 1], a[i - 1]); //自分の持ち場が終わった
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll cnt = 0;
for (int i = n; i > 0; i--) {
cnt += min(b[i - 1], a[i]);
b[i - 1] -= min(b[i - 1], a[i]);
cnt += min(b[i - 1], a[i - 1]);
a[i - 1] -= min(b[i - 1], a[i - 1]);
}
cout << cnt << endl;
} | [
"variable_declaration.type.change"
] | 766,677 | 766,678 | u191484928 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int tot = 0;
rep(i, n) {
int dmg1 = min(a[i], b[i]);
a[i] -= dmg1;
b[i] -= dmg1;
tot += dmg1;
int dmg2 = min(a[i + 1], b[i]);
a[i + 1] -= dmg2;
tot += dmg2;
}
cout << tot << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll tot = 0;
rep(i, n) {
int dmg1 = min(a[i], b[i]);
a[i] -= dmg1;
b[i] -= dmg1;
tot += dmg1;
int dmg2 = min(a[i + 1], b[i]);
a[i + 1] -= dmg2;
tot += dmg2;
}
cout << tot << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,683 | 766,684 | u194930818 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> city(n + 1), brave(n);
for (int i = 0; i < n + 1; i++)
cin >> city.at(i);
for (int i = 0; i < n; i++)
cin >> brave.at(i);
ll cnt = 0;
for (int i = 0; i < n; i++) {
ll f1 = min(brave.at(i), city.at(i));
cnt += min(brave.at(i) - f1, city.at(i + 1)) + f1;
city.at(i) = max(city.at(i + 1) - brave.at(i) + f1, 0LL);
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> city(n + 1), brave(n);
for (int i = 0; i < n + 1; i++)
cin >> city.at(i);
for (int i = 0; i < n; i++)
cin >> brave.at(i);
ll cnt = 0;
for (int i = 0; i < n; i++) {
ll f1 = min(brave.at(i), city.at(i));
cnt += min(brave.at(i) - f1, city.at(i + 1)) + f1;
city.at(i + 1) = max(city.at(i + 1) - brave.at(i) + f1, 0LL);
}
cout << cnt << endl;
}
| [
"assignment.change"
] | 766,685 | 766,686 | u050087249 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<long long> h(a + 1);
long long v = 0;
for (int i = 0; i < a + 1; i++) {
cin >> h.at(i);
v += h.at(i);
}
for (int i = 0; i < a; i++) {
long long t;
cin >> t;
if (h.at(i) < t) {
long long x = h.at(i) - t + h.at(i + 1);
long long s = 0;
h.at(i + 1) = max(x, s);
h.at(i) = 0;
} else {
h.at(i) -= t;
}
}
int ans = 0;
for (int i = 0; i < a + 1; i++) {
ans += h.at(i);
}
cout << v - ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<long long> h(a + 1);
long long v = 0;
for (int i = 0; i < a + 1; i++) {
cin >> h.at(i);
v += h.at(i);
}
for (int i = 0; i < a; i++) {
long long t;
cin >> t;
if (h.at(i) < t) {
long long x = h.at(i) - t + h.at(i + 1);
long long s = 0;
h.at(i + 1) = max(x, s);
h.at(i) = 0;
} else {
h.at(i) -= t;
}
}
long long ans = 0;
for (int i = 0; i < a + 1; i++) {
ans += h.at(i);
}
cout << v - ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,689 | 766,690 | u577774192 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> A(N + 1);
rep(i, N + 1) cin >> A[i];
vector<int> B(N);
rep(i, N) cin >> B[i];
int sum = 0;
rep(i, N) {
if (0 > A[i] - B[i]) {
sum += A[i];
B[i] -= A[i];
} else {
sum += B[i];
continue;
}
if (0 > A[i + 1] - B[i]) {
sum += A[i + 1];
A[i + 1] = 0;
} else {
sum += B[i];
A[i + 1] -= B[i];
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll N;
cin >> N;
vector<int> A(N + 1);
rep(i, N + 1) cin >> A[i];
vector<int> B(N);
rep(i, N) cin >> B[i];
ll sum = 0;
rep(i, N) {
if (0 > A[i] - B[i]) {
sum += A[i];
B[i] -= A[i];
} else {
sum += B[i];
continue;
}
if (0 > A[i + 1] - B[i]) {
sum += A[i + 1];
A[i + 1] = 0;
} else {
sum += B[i];
A[i + 1] -= B[i];
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,691 | 766,692 | u389577910 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
long long int a, b;
std::deque<long long int> A;
std::deque<long long int> B;
for (int i = 0; i < n + 1; i++) {
cin >> a;
A.emplace_back(a);
}
for (int j = 0; j < n; j++) {
cin >> b;
B.emplace_back(b);
}
long long int sum = 0;
long long int one = A[0], another;
for (int k = 0; k < n; k++) {
another = A[k + 1];
if (one <= B[k]) {
sum += one;
B[k] -= one;
} else {
sum += B[k];
one -= B[k];
B[k] = 0;
}
if (another <= B[k]) {
sum += another;
B[k] -= another;
} else {
sum += B[k];
another -= B[k];
B[k] = 0;
}
one = another;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
long long int a, b;
std::deque<long long int> A;
std::deque<long long int> B;
for (int i = 0; i < n + 1; i++) {
cin >> a;
A.emplace_back(a);
}
for (int j = 0; j < n; j++) {
cin >> b;
B.emplace_back(b);
}
long long int sum = 0;
long long int one = A[0], another;
for (int k = 0; k < n; k++) {
another = A[k + 1];
if (one <= B[k]) {
sum += one;
B[k] -= one;
} else {
sum += B[k];
one -= B[k];
B[k] = 0;
}
if (another <= B[k]) {
sum += another;
another = 0;
B[k] -= another;
} else {
sum += B[k];
another -= B[k];
B[k] = 0;
}
one = another;
}
cout << sum << endl;
} | [
"assignment.add"
] | 766,693 | 766,694 | u485821416 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int min(int x, int y) {
if (x <= y)
return x;
return y;
}
int max(int x, int y) {
if (x <= y)
return y;
return x;
}
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
b[i] -= a[i];
ans += a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] = max(0, a[i + 1] - b[i]);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int min(int x, int y) {
if (x <= y)
return x;
return y;
}
int max(int x, int y) {
if (x <= y)
return y;
return x;
}
int main() {
int n;
cin >> n;
long long a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
// ans+=b[i] ;
} else {
b[i] -= a[i];
ans += a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] = max(0, a[i + 1] - b[i]);
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,695 | 766,696 | u904995051 | cpp |
p02959 | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void co(First first, Rest... rest) {
cout << first << " ";
co(rest...);
return;
}
#define ll long long
#define ld long double
#define st string
#define dl double
#define wh while
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define tp tuple
#define ft first
#define sc second
#define ve vector
#define tos to_string
#define len length
#define rt return 0
#define gcd __gcd
#define lcm(n, m) n *m / gcd(n, m)
#define np next_permutation
#define repi(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) repi(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for (auto &&i : n)
#define so(n) sort(n.begin(), n.end())
#define rev(n) reverse(n.begin(), n.end())
#define sp(n) cout << fixed << setprecision(n)
#pragma endregion
// sqrt ルート, int 2*10^9, gcd 最大公約数
int main() {
int N, a = 0;
ci(N);
ve<int> A(N + 1), B(N);
rep(i, N + 1) { ci(A.at(i)); }
rep(i, N) { ci(B.at(i)); }
rep(i, N) {
a += min(A.at(i) + A.at(i + 1), B.at(i));
if (A.at(i) - B.at(i) < 0) {
if (A.at(i + 1) > B.at(i) - A.at(i)) {
A.at(i + 1) -= B.at(i) - A.at(i);
} else if (A.at(i + 1) <= B.at(i) - A.at(i)) {
A.at(i + 1) = 0;
}
}
}
co(a);
} | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void co(First first, Rest... rest) {
cout << first << " ";
co(rest...);
return;
}
#define ll long long
#define ld long double
#define st string
#define dl double
#define wh while
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define tp tuple
#define ft first
#define sc second
#define ve vector
#define tos to_string
#define len length
#define rt return 0
#define gcd __gcd
#define lcm(n, m) n *m / gcd(n, m)
#define np next_permutation
#define repi(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) repi(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for (auto &&i : n)
#define so(n) sort(n.begin(), n.end())
#define rev(n) reverse(n.begin(), n.end())
#define sp(n) cout << fixed << setprecision(n)
#pragma endregion
// sqrt ルート, int 2*10^9, gcd 最大公約数
int main() {
int N;
ll a = 0;
ci(N);
ve<ll> A(N + 1), B(N);
rep(i, N + 1) { ci(A.at(i)); }
rep(i, N) { ci(B.at(i)); }
rep(i, N) {
a += min(A.at(i) + A.at(i + 1), B.at(i));
if (A.at(i) - B.at(i) < 0) {
if (A.at(i + 1) > B.at(i) - A.at(i)) {
A.at(i + 1) -= B.at(i) - A.at(i);
} else if (A.at(i + 1) <= B.at(i) - A.at(i)) {
A.at(i + 1) = 0;
}
}
}
co(a);
} | [] | 766,701 | 766,702 | u449573758 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
ll count = 0;
rep(i, n) {
int num = min(a.at(i), b.at(i));
count += num;
b.at(i) -= num;
num = min(a.at(i + 1), b.at(i));
count += num;
a.at(i) -= num;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
ll count = 0;
rep(i, n) {
int num = min(a.at(i), b.at(i));
count += num;
b.at(i) -= num;
num = min(a.at(i + 1), b.at(i));
count += num;
a.at(i + 1) -= num;
}
cout << count << endl;
}
| [
"assignment.change"
] | 766,703 | 766,704 | u474760662 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <vector>
using namespace std;
int a[100020];
int b[100030];
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 0; i <= N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
if (b[i] <= a[i]) {
sum = sum + b[i];
b[i] = 0;
} else {
sum = sum + a[i];
b[i] = b[i] - a[i];
}
if (b[i] >= a[i + 1]) {
sum = sum + a[i + 1];
a[i + 1] = 0;
} else {
sum = sum + b[i];
a[i + 1] = a[i + 1] - b[i];
}
}
cout << sum;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <vector>
using namespace std;
int a[1000000];
int b[1000000];
int main() {
int N;
cin >> N;
long long int sum = 0;
for (int i = 0; i <= N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
if (b[i] <= a[i]) {
sum = sum + b[i];
b[i] = 0;
} else {
sum = sum + a[i];
b[i] = b[i] - a[i];
}
if (b[i] >= a[i + 1]) {
sum = sum + a[i + 1];
a[i + 1] = 0;
} else {
sum = sum + b[i];
a[i + 1] = a[i + 1] - b[i];
}
}
cout << sum;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 766,707 | 766,708 | u473116917 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <vector>
using namespace std;
int a[1000000];
int b[1000000];
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 0; i <= N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
if (b[i] <= a[i]) {
sum = sum + b[i];
b[i] = 0;
} else {
sum = sum + a[i];
b[i] = b[i] - a[i];
}
if (b[i] >= a[i + 1]) {
sum = sum + a[i + 1];
a[i + 1] = 0;
} else {
sum = sum + b[i];
a[i + 1] = a[i + 1] - b[i];
}
}
cout << sum;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <vector>
using namespace std;
int a[1000000];
int b[1000000];
int main() {
int N;
cin >> N;
long long int sum = 0;
for (int i = 0; i <= N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
if (b[i] <= a[i]) {
sum = sum + b[i];
b[i] = 0;
} else {
sum = sum + a[i];
b[i] = b[i] - a[i];
}
if (b[i] >= a[i + 1]) {
sum = sum + a[i + 1];
a[i + 1] = 0;
} else {
sum = sum + b[i];
a[i + 1] = a[i + 1] - b[i];
}
}
cout << sum;
}
| [
"variable_declaration.type.widen.change"
] | 766,709 | 766,708 | u473116917 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A1(N + 1);
vector<int> B1(N);
vector<int> A2(N + 1);
vector<int> B2(N);
for (int i = 0; i < N + 1; i++) {
cin >> A1.at(i);
A2.at(i) = A1.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B1.at(i);
B2.at(i) = B1.at(i);
}
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < N; i++) {
if (A1.at(i) < B1.at(i)) {
ans1 += A1.at(i);
B1.at(i) -= A1.at(i);
A1.at(i) = 0;
if (A1.at(i + 1) <= B1.at(i)) {
ans1 += A1.at(i + 1);
A1.at(i + 1) = 0;
} else {
ans1 += B1.at(i);
A1.at(i + 1) -= B1.at(i);
}
} else {
ans1 += B1.at(i);
A1.at(i) -= B1.at(i);
}
}
cout << ans1;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A1(N + 1);
vector<int> B1(N);
vector<int> A2(N + 1);
vector<int> B2(N);
for (int i = 0; i < N + 1; i++) {
cin >> A1.at(i);
A2.at(i) = A1.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B1.at(i);
B2.at(i) = B1.at(i);
}
ll ans1 = 0;
ll ans2 = 0;
for (int i = 0; i < N; i++) {
if (A1.at(i) < B1.at(i)) {
ans1 += A1.at(i);
B1.at(i) -= A1.at(i);
A1.at(i) = 0;
if (A1.at(i + 1) <= B1.at(i)) {
ans1 += A1.at(i + 1);
A1.at(i + 1) = 0;
} else {
ans1 += B1.at(i);
A1.at(i + 1) -= B1.at(i);
}
} else {
ans1 += B1.at(i);
A1.at(i) -= B1.at(i);
}
}
cout << ans1;
} | [
"variable_declaration.type.change"
] | 766,710 | 766,711 | u574687269 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int n, count = 0;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
rep(i, n) {
if (a.at(i) + a.at(i + 1) < b.at(i)) {
count += a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
} else if (a.at(i) < b.at(i)) {
count += b.at(i);
a.at(i + 1) -= b.at(i) - a.at(i);
} else {
count += b.at(i);
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int n;
ll count = 0;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
rep(i, n) {
if (a.at(i) + a.at(i + 1) <= b.at(i)) {
count += a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
} else if (a.at(i) < b.at(i)) {
count += b.at(i);
a.at(i + 1) -= b.at(i) - a.at(i);
} else {
count += b.at(i);
}
}
cout << count << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,714 | 766,715 | u147331814 | cpp |
p02959 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
long long a[100002] = {}, b[100002] = {}, m = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i <= n; i++) {
if (b[i] >= a[i]) {
m += a[i];
b[i + 1] += max(a[i + 1], b[i] - a[i]);
} else
m += b[i];
}
cout << m << endl;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
long long a[100002] = {}, b[100002] = {}, m = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i <= n; i++) {
if (b[i] >= a[i]) {
m += a[i];
b[i + 1] += min(a[i + 1], b[i] - a[i]);
} else
m += b[i];
}
cout << m << endl;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 766,716 | 766,717 | u120050685 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int ans = 0;
for (int i = 0; i < N; i++) {
ans += min(A.at(i), B.at(i));
B.at(i) = max(0, B.at(i) - A.at(i));
ans += min(A.at(i + 1), B.at(i));
A.at(i + 1) = max(0, A.at(i + 1) - B.at(i));
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += min(A.at(i), B.at(i));
B.at(i) = max(0, B.at(i) - A.at(i));
ans += min(A.at(i + 1), B.at(i));
A.at(i + 1) = max(0, A.at(i + 1) - B.at(i));
}
cout << ans << "\n";
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,718 | 766,719 | u045289115 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int ans = 0;
for (int i = 0; i < N; i++) {
int X = min(A.at(i), B.at(i));
A.at(i) -= X;
B.at(i) -= X;
ans += X;
if (B.at(i) > 0) {
int Y = min(B.at(i), A.at(i + 1));
B.at(i) -= Y;
A.at(i + 1) -= Y;
ans += Y;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long ans = 0;
for (int i = 0; i < N; i++) {
int X = min(A.at(i), B.at(i));
A.at(i) -= X;
B.at(i) -= X;
ans += X;
if (B.at(i) > 0) {
int Y = min(B.at(i), A.at(i + 1));
B.at(i) -= Y;
A.at(i + 1) -= Y;
ans += Y;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,720 | 766,721 | u045289115 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int ans = 0;
for (int i = N - 1; i >= 0; i--) {
int first = B[i];
int C = min(A[i + 1], B[i]);
A[i + 1] -= C;
B[i] -= C;
C = min(A[i], B[i]);
A[i] -= C;
B[i] -= C;
ans += first - B[i];
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long long ans = 0;
for (int i = N - 1; i >= 0; i--) {
int first = B[i];
int C = min(A[i + 1], B[i]);
A[i + 1] -= C;
B[i] -= C;
C = min(A[i], B[i]);
A[i] -= C;
B[i] -= C;
ans += first - B[i];
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,726 | 766,727 | u868132236 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end()
int main() {
int n, ans = 0;
cin >> n;
vi a(n + 1);
vi b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if (a[i] < b[i]) {
ans += min(a[i + 1] + a[i], b[i]);
a[i + 1] = max(0, a[i + 1] - (b[i] - a[i]));
} else {
ans += b[i];
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end()
int main() {
ll n, ans = 0;
cin >> n;
vl a(n + 1);
vl b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if (a[i] < b[i]) {
ans += min(a[i + 1] + a[i], b[i]);
a[i + 1] = max(0LL, a[i + 1] - (b[i] - a[i]));
} else {
ans += b[i];
}
}
cout << ans;
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 766,728 | 766,729 | u688825490 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100005], b[100005], ans = 0, k, l, m;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
k = a[i];
l = b[i];
m = a[i + 1];
ans += min(a[i], b[i]);
a[i] = max(k - l, 0);
b[i] = max(l - k, 0);
ans += min(a[i + 1], b[i]);
a[i + 1] = max(m - b[i], 0);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100005], b[100005], ans = 0, k, l, m;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
k = a[i];
l = b[i];
m = a[i + 1];
ans += min(a[i], b[i]);
a[i] = max(k - l, 0LL);
b[i] = max(l - k, 0LL);
ans += min(a[i + 1], b[i]);
a[i + 1] = max(m - b[i], 0LL);
}
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 766,732 | 766,733 | u732421371 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
int N;
cin >> N;
N++;
int saved = 0;
vector<int> A(N), B(N);
rep(i, N) {
cin >> A[i];
// cout << A[i] << endl;
}
rep(i, N - 1) {
cin >> B[i];
// cout << B[i] << endl;
}
rep(i, N - 1) {
saved += min(A[i], B[i]);
// cout << saved << endl;
B[i] = max(B[i] - A[i], 0);
saved += min(B[i], A[i + 1]);
// cout << saved << endl;
A[i + 1] = max(A[i + 1] - B[i], 0);
}
cout << saved << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
Main();
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
int N;
cin >> N;
N++;
ll saved = 0;
vector<int> A(N), B(N);
rep(i, N) {
cin >> A[i];
// cout << A[i] << endl;
}
rep(i, N - 1) {
cin >> B[i];
// cout << B[i] << endl;
}
rep(i, N - 1) {
saved += min(A[i], B[i]);
// cout << saved << endl;
B[i] = max(B[i] - A[i], 0);
saved += min(B[i], A[i + 1]);
// cout << saved << endl;
A[i + 1] = max(A[i + 1] - B[i], 0);
}
cout << saved << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
Main();
return 0;
} | [
"variable_declaration.type.change"
] | 766,738 | 766,739 | u900523387 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++)
cin >> A.at(i);
for (int i = 0; i < n; i++)
cin >> B.at(i);
ll ans = 0ll;
for (int i = 0; i < n; i++) {
if (A.at(i) <= B.at(i)) {
ans += A.at(i);
B.at(i) -= A.at(i);
A.at(i) = 0ll;
if (A.at(i + 1) <= B.at(i)) {
ans += A.at(i + 1);
B.at(i) -= A.at(i + 1);
A.at(i) = 0ll;
} else {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
B.at(i) = 0ll;
}
} else {
ans += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0ll;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++)
cin >> A.at(i);
for (int i = 0; i < n; i++)
cin >> B.at(i);
ll ans = 0ll;
for (int i = 0; i < n; i++) {
if (A.at(i) <= B.at(i)) {
ans += A.at(i);
B.at(i) -= A.at(i);
A.at(i) = 0ll;
if (A.at(i + 1) <= B.at(i)) {
ans += A.at(i + 1);
B.at(i) -= A.at(i + 1);
A.at(i + 1) = 0ll;
} else {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
B.at(i) = 0ll;
}
} else {
ans += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0ll;
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 766,744 | 766,745 | u180029567 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
long long ans = 0;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else if (a[i + 1] > b[i] - a[i]) {
ans += b[i];
a[i + 1] = a[i + 1] + b[i] - a[i];
} else if (a[i + 1] <= b[i] - a[i]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
long long ans = 0;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else if (a[i + 1] > b[i] - a[i]) {
ans += b[i];
a[i + 1] = a[i + 1] - (b[i] - a[i]);
} else if (a[i + 1] <= b[i] - a[i]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 766,746 | 766,747 | u297195722 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n, A[10000], B[10000], c = 0;
cin >> n;
for (int i = 0; i < n + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < n; ++i) {
cin >> B[i];
}
for (int i = 0; i < n; ++i) {
long long int h = min(A[i], B[i]);
A[i] -= h;
B[i] -= h;
c += h;
h = min(A[i + 1], B[i]);
A[i + 1] -= h;
c += h;
}
cout << c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n, A[100007], B[100007], c = 0;
cin >> n;
for (int i = 0; i < n + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < n; ++i) {
cin >> B[i];
}
for (int i = 0; i < n; ++i) {
long long int h = min(A[i], B[i]);
A[i] -= h;
B[i] -= h;
c += h;
h = min(A[i + 1], B[i]);
A[i + 1] -= h;
c += h;
}
cout << c;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 766,748 | 766,749 | u022688266 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, sum = 0, b, f;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, n + 1) cin >> a[i];
rep(i, n) {
cin >> b;
sum += min(a[i], b);
b -= min(a[i], b);
sum += min(a[i + 1], b);
a[i + 1] -= min(a[i + 1], b);
}
cout << sum << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, sum = 0, b, f;
cin >> n;
vector<ll> a(n + 1, 0);
rep(i, n + 1) cin >> a[i];
rep(i, n) {
cin >> b;
sum += min(a[i], b);
b -= min(a[i], b);
sum += min(a[i + 1], b);
a[i + 1] -= min(a[i + 1], b);
}
cout << sum << endl;
} | [
"variable_declaration.type.change"
] | 766,750 | 766,751 | u670898337 | cpp |
p02959 | ///答え見ました
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
count += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] < b[i]) {
count += a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] -= b[i];
}
}
else {
count += b[i];
a[i] -= b[i];
}
}
cout << count << endl;
}
| ///答え見ました
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int64_t count = 0;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
count += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] < b[i]) {
count += a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] -= b[i];
}
}
else {
count += b[i];
a[i] -= b[i];
}
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 766,752 | 766,753 | u028906014 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
rep(i, n + 1) { cin >> A[i]; }
vector<int> B(n);
rep(i, n) { cin >> B[i]; }
vector<int> f(n);
vector<int> g(n);
f[0] = min(A[0], B[0]);
g[0] = min(A[1], B[0] - f[0]);
for (int i = 1; i < n; i++) {
f[i] = min(A[i] - g[i - 1], B[i]);
g[i] = min(A[i + 1], B[i] - f[i]);
}
int ans = 0;
rep(i, n) { ans += f[i] + g[i]; }
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
rep(i, n + 1) { cin >> A[i]; }
vector<int> B(n);
rep(i, n) { cin >> B[i]; }
vector<int> f(n);
vector<int> g(n);
f[0] = min(A[0], B[0]);
g[0] = min(A[1], B[0] - f[0]);
for (int i = 1; i < n; i++) {
f[i] = min(A[i] - g[i - 1], B[i]);
g[i] = min(A[i + 1], B[i] - f[i]);
}
ll ans = 0;
rep(i, n) { ans += f[i] + g[i]; }
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,754 | 766,755 | u745267317 | cpp |
p02959 | #include <iostream>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 0; i < n + 1; i++)
cin >> arr[i];
int brr[n];
for (int i = 0; i < n; i++)
cin >> brr[i];
int ans = 0;
for (int i = 0; i < n - 1; i++) {
int tm = min(brr[i], arr[i]);
brr[i] -= tm;
int a = min(brr[i], arr[i + 1]);
arr[i] -= a;
ans += tm + a;
}
cout << ans;
} | #include <iostream>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 0; i < n + 1; i++)
cin >> arr[i];
int brr[n];
for (int i = 0; i < n; i++)
cin >> brr[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int tm = min(brr[i], arr[i]);
brr[i] -= tm;
int a = min(brr[i], arr[i + 1]);
arr[i + 1] -= a;
ans += tm + a;
}
cout << ans;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 766,756 | 766,757 | u915287802 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (b[i] <= a[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= a[i] - b[i];
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (b[i] <= a[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (b[i] > a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 766,764 | 766,765 | u068713120 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<int> l(N + 1), b(N);
for (int i = 0; i <= N; i++) {
cin >> l[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
int x = min(l[i], b[i]);
ans += x;
if (b[i] - x > 0) {
int y = min(b[i] - x, l[i + 1]);
ans += y;
l[i + 1] -= y;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<int> l(N + 1), b(N);
for (int i = 0; i <= N; i++) {
cin >> l[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < N; i++) {
int x = min(l[i], b[i]);
ans += x;
if (b[i] - x > 0) {
int y = min(b[i] - x, l[i + 1]);
ans += y;
l[i + 1] -= y;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,766 | 766,767 | u146594935 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<int> l(N + 1), b(N);
for (int i = 0; i <= N; i++) {
cin >> l[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
int left = min(l[i], b[i]);
ans += left;
l[i] -= left;
b[i] -= left;
int right = min(l[i + 1], b[i]);
ans += right;
l[i + 1] -= right;
b[i] -= right;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<int> l(N + 1), b(N);
for (int i = 0; i <= N; i++) {
cin >> l[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < N; i++) {
int left = min(l[i], b[i]);
ans += left;
l[i] -= left;
b[i] -= left;
int right = min(l[i + 1], b[i]);
ans += right;
l[i + 1] -= right;
b[i] -= right;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,768 | 766,769 | u146594935 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int result = 0;
for (int i = 0, d; i < n; i++) {
d = min(a[i], b[i]);
result += d;
b[i] -= d;
d = min(a[i + 1], b[i]);
result += d;
a[i + 1] -= d;
b[i] -= d;
}
cout << result << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long result = 0;
for (int i = 0, d; i < n; i++) {
d = min(a[i], b[i]);
result += d;
b[i] -= d;
d = min(a[i + 1], b[i]);
result += d;
a[i + 1] -= d;
b[i] -= d;
}
cout << result << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,770 | 766,771 | u154898295 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
ans += b[i];
else {
ans += a[i];
if (b[i] - a[i] <= a[i + 1]) {
ans += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
ans += b[i];
else {
ans += a[i];
if (b[i] - a[i] <= a[i + 1]) {
ans += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 766,778 | 766,779 | u107406081 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int cnt = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
if (A.at(i / 2) >= B.at(i / 2)) {
cnt += B.at(i / 2);
A.at(i / 2) -= B.at(i / 2);
B.at(i / 2) = 0;
} else if (A.at(i / 2) + A.at(i / 2 + 1) <= B.at(i / 2)) {
cnt += (A.at(i / 2) + A.at(i / 2 + 1));
B.at(i / 2) -= (A.at(i / 2) + A.at(i / 2 + 1));
A.at(i / 2) = 0;
A.at(i / 2 + 1) = 0;
} else if (A.at(i / 2) + A.at(i / 2 + 1) > B.at(i / 2)) {
cnt += B.at(i / 2);
A.at(i / 2 + 1) -= (B.at(i / 2) - A.at(i / 2));
A.at(i / 2) = 0;
B.at(i / 2) = 0;
}
} else {
if (A.at(N - (i + 1) / 2 + 1) >= B.at(N - (i + 1) / 2)) {
cnt += B.at(N - (i + 1) / 2);
A.at(N - (i + 1) / 2 + 1) -= B.at(N - (i + 1) / 2);
B.at(N - (i + 1) / 2) = 0;
} else if (A.at(N - (i + 1) / 2 + 1) + A.at(N - (i + 1) / 2) <=
B.at(N - (i + 1) / 2)) {
cnt += (A.at(N - (i + 1) / 2 + 1) + A.at(N - (i + 1) / 2));
B.at(N - (i + 1) / 2) -=
(A.at(N - (i + 1) / 2 + 1) + A.at(N - (i + 1) / 2));
A.at(N - (i + 1) / 2 + 1) = 0;
A.at(N - (i + 1) / 2) = 0;
} else if (A.at(N - (i + 1) / 2 + 1) + A.at(N - (i + 1) / 2) >
B.at(N - (i + 1) / 2)) {
cnt += B.at(N - (i + 1) / 2);
A.at(N - (i + 1) / 2) -=
(B.at(N - (i + 1) / 2) - A.at(N - (i + 1) / 2 + 1));
A.at(N - (i + 1) / 2 + 1) = 0;
B.at(N - (i + 1) / 2) = 0;
}
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long cnt = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
if (A.at(i / 2) >= B.at(i / 2)) {
cnt += B.at(i / 2);
A.at(i / 2) -= B.at(i / 2);
B.at(i / 2) = 0;
} else if (A.at(i / 2) + A.at(i / 2 + 1) <= B.at(i / 2)) {
cnt += (A.at(i / 2) + A.at(i / 2 + 1));
B.at(i / 2) -= (A.at(i / 2) + A.at(i / 2 + 1));
A.at(i / 2) = 0;
A.at(i / 2 + 1) = 0;
} else if (A.at(i / 2) + A.at(i / 2 + 1) > B.at(i / 2)) {
cnt += B.at(i / 2);
A.at(i / 2 + 1) -= (B.at(i / 2) - A.at(i / 2));
A.at(i / 2) = 0;
B.at(i / 2) = 0;
}
} else {
if (A.at(N - (i + 1) / 2 + 1) >= B.at(N - (i + 1) / 2)) {
cnt += B.at(N - (i + 1) / 2);
A.at(N - (i + 1) / 2 + 1) -= B.at(N - (i + 1) / 2);
B.at(N - (i + 1) / 2) = 0;
} else if (A.at(N - (i + 1) / 2 + 1) + A.at(N - (i + 1) / 2) <=
B.at(N - (i + 1) / 2)) {
cnt += (A.at(N - (i + 1) / 2 + 1) + A.at(N - (i + 1) / 2));
B.at(N - (i + 1) / 2) -=
(A.at(N - (i + 1) / 2 + 1) + A.at(N - (i + 1) / 2));
A.at(N - (i + 1) / 2 + 1) = 0;
A.at(N - (i + 1) / 2) = 0;
} else if (A.at(N - (i + 1) / 2 + 1) + A.at(N - (i + 1) / 2) >
B.at(N - (i + 1) / 2)) {
cnt += B.at(N - (i + 1) / 2);
A.at(N - (i + 1) / 2) -=
(B.at(N - (i + 1) / 2) - A.at(N - (i + 1) / 2 + 1));
A.at(N - (i + 1) / 2 + 1) = 0;
B.at(N - (i + 1) / 2) = 0;
}
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change"
] | 766,782 | 766,783 | u623391301 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
cnt += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
} else if (A.at(i) + A.at(i + 1) <= B.at(i)) {
cnt += (A.at(i) + A.at(i + 1));
B.at(i) -= (A.at(i) + A.at(i + 1));
A.at(i) = 0;
A.at(i + 1) = 0;
} else if (A.at(i) + A.at(i + 1) > B.at(i)) {
cnt += B.at(i);
A.at(i + 1) -= (B.at(i) - A.at(i));
A.at(i) = 0;
B.at(i) = 0;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long cnt = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
cnt += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
} else if (A.at(i) + A.at(i + 1) <= B.at(i)) {
cnt += (A.at(i) + A.at(i + 1));
B.at(i) -= (A.at(i) + A.at(i + 1));
A.at(i) = 0;
A.at(i + 1) = 0;
} else if (A.at(i) + A.at(i + 1) > B.at(i)) {
cnt += B.at(i);
A.at(i + 1) -= (B.at(i) - A.at(i));
A.at(i) = 0;
B.at(i) = 0;
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change"
] | 766,784 | 766,785 | u623391301 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
cnt += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
} else if (A.at(i) + A.at(i + 1) <= B.at(i)) {
cnt += (A.at(i) + A.at(i + 1));
B.at(i) -= (A.at(i) + A.at(i + 1));
A.at(i) = 0;
A.at(i + 1) = 0;
} else if (A.at(i) + A.at(i + 1) > B.at(i)) {
cnt += B.at(i);
A.at(i + 1) -= (B.at(i) - A.at(i));
A.at(i) = 0;
B.at(i) = 0;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long cnt = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
cnt += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
} else if (A.at(i) + A.at(i + 1) <= B.at(i)) {
cnt += (A.at(i) + A.at(i + 1));
B.at(i) -= (A.at(i) + A.at(i + 1));
A.at(i) = 0;
A.at(i + 1) = 0;
} else if (A.at(i) + A.at(i + 1) > B.at(i)) {
cnt += B.at(i);
A.at(i + 1) -= (B.at(i) - A.at(i));
A.at(i) = 0;
B.at(i) = 0;
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change"
] | 766,786 | 766,785 | u623391301 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n + 1) {
ll min1 = min(a[i], b[i]);
a[i] -= min1;
b[i] -= min1;
ans += min1;
ll min2 = min(a[i + 1], b[i]);
a[i + 1] -= min2;
b[i] -= min2;
ans += min2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n) {
ll min1 = min(a[i], b[i]);
a[i] -= min1;
b[i] -= min1;
ans += min1;
ll min2 = min(a[i + 1], b[i]);
a[i + 1] -= min2;
b[i] -= min2;
ans += min2;
}
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 766,792 | 766,793 | u233586402 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.