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 <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class Read> void in(Read &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
f |= (ch == '-');
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
x = f ? -x : x;
return;
}
int n, ans, a[100005], b[100005];
int main() {
in(n);
n++;
for (int i = 1; i <= n; i++)
in(a[i]);
for (int i = 1; i < n; i++)
in(b[i]);
for (int i = 1; i < n; i++) {
if (b[i] > a[i]) {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
if (b[i] > a[i + 1]) {
b[i] -= a[i + 1];
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
b[i] = 0;
}
} else
a[i] -= b[i], ans += b[i], b[i] = 0;
}
printf("%d\n", ans);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class Read> void in(Read &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
f |= (ch == '-');
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
x = f ? -x : x;
return;
}
int n;
ll ans, a[100005], b[100005];
int main() {
in(n);
n++;
for (int i = 1; i <= n; i++)
in(a[i]);
for (int i = 1; i < n; i++)
in(b[i]);
for (int i = 1; i < n; i++) {
if (b[i] > a[i]) {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
if (b[i] > a[i + 1]) {
b[i] -= a[i + 1];
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
b[i] = 0;
}
} else
a[i] -= b[i], ans += b[i], b[i] = 0;
}
printf("%lld\n", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,841 | 768,842 | u591725500 | cpp |
p02959 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip> // std::std::setprecision(X)
#include <iostream>
#include <limits> //std::numeric_limits<int>::max(), min()
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
int main(void) {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
for (int i = 0; i <= N; i++)
std::cin >> A[i];
int ans = 0;
for (int i = 0; i < N; i++) {
int B;
std::cin >> B;
if (A[i] >= B)
ans += B;
else {
ans += A[i];
B -= A[i];
if (A[i + 1] >= B) {
ans += B;
A[i + 1] -= B;
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
std::cout << ans << std::endl;
return 0;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip> // std::std::setprecision(X)
#include <iostream>
#include <limits> //std::numeric_limits<int>::max(), min()
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
int main(void) {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
for (int i = 0; i <= N; i++)
std::cin >> A[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
int B;
std::cin >> B;
if (A[i] >= B)
ans += B;
else {
ans += A[i];
B -= A[i];
if (A[i + 1] >= B) {
ans += B;
A[i + 1] -= B;
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
std::cout << ans << std::endl;
return 0;
} | [
"variable_declaration.type.change"
] | 768,843 | 768,844 | u967843578 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR(i, 0, n)
#define SORT(V) sort((V).begin(), (V).end())
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
using namespace std;
int main() {
ll N, ans = 0;
cin >> N;
ll A[N + 1], B[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 (A[i + 1] + A[i] <= B[i]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
A[i] = 0;
} else if (A[i] <= B[i]) {
if (i == N - 1)
ans += B[i];
else
ans += A[i];
A[i + 1] -= (B[i] - A[i]);
} else
ans += B[i];
}
cout << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR(i, 0, n)
#define SORT(V) sort((V).begin(), (V).end())
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
using namespace std;
int main() {
ll N, ans = 0;
cin >> N;
ll A[N + 1], B[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 (A[i + 1] + A[i] <= B[i]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
A[i] = 0;
} else if (A[i] <= B[i]) {
if (i == N - 1)
ans += B[i];
else
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else
ans += B[i];
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 768,847 | 768,848 | u041282550 | cpp |
p02959 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define LL long long
#define pb push_back
#define mp make_pair
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int, int> pii;
int n, ans;
int a[100010], b[100010];
int c[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 1; i <= n + 1; i++) {
int need = a[i] - c[i];
if (need < 0) {
c[i + 1] = b[i];
c[i] = a[i];
} else {
if (need > b[i]) {
c[i + 1] = 0;
c[i] += b[i];
} else {
c[i + 1] = b[i] - need;
c[i] = a[i];
}
}
}
for (int i = 1; i <= n + 1; i++)
ans += c[i];
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define int long long
#define pb push_back
#define mp make_pair
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int, int> pii;
int n, ans;
int a[100010], b[100010];
int c[100010];
signed main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 1; i <= n + 1; i++) {
int need = a[i] - c[i];
if (need < 0) {
c[i + 1] = b[i];
c[i] = a[i];
} else {
if (need > b[i]) {
c[i + 1] = 0;
c[i] += b[i];
} else {
c[i + 1] = b[i] - need;
c[i] = a[i];
}
}
}
for (int i = 1; i <= n + 1; i++)
ans += c[i];
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"variable_declaration.type.primitive.change"
] | 768,849 | 768,850 | u452379143 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[100009], b[100009], ans = 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 + 1; i++) {
if (i) {
int t = min(a[i], b[i - 1]);
a[i] -= t;
ans += t;
}
int t = min(a[i], b[i]);
a[i] -= t;
b[i] -= t;
ans += t;
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[100009], b[100009] = {};
long long ans = 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 + 1; i++) {
if (i) {
int t = min(a[i], b[i - 1]);
a[i] -= t;
ans += t;
}
int t = min(a[i], b[i]);
a[i] -= t;
b[i] -= t;
ans += t;
}
cout << ans << endl;
} | [
"variable_declaration.add"
] | 768,861 | 768,860 | u047554023 | cpp |
p02959 | #include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<int, int> P;
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 res = 0;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
res += a[i];
b[i] -= a[i];
if (a[i + 1] < b[i]) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b[i];
a[i + 1] -= b[i];
}
} else {
res += b[i];
}
}
cout << res << "\n";
}
/*
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) cin >> p[i];
for (int i = 0; i < n; i++) {
for (int j = 1; j < n; j++) {
swap(p[i],p[j]);
int count = 0;
for (int k = 0; k < n - 1; k++) {
if (p[k] < p[k+1]) count++;
}
if (count == n - 1) {
cout << "YES\n";
return 0;
}
swap(p[i],p[j]);
}
}
cout << "NO\n";
}
*/
/*
int main() {
int a, b;
cin >> a >> b;
int tmp = abs(a - b);
if (tmp % 2 == 1) {
cout << "IMPOSSIBLE\n";
} else {
cout << (a+b)/2 << "\n";
}
}*/ | #include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll res = 0;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
res += a[i];
b[i] -= a[i];
if (a[i + 1] < b[i]) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b[i];
a[i + 1] -= b[i];
}
} else {
res += b[i];
}
}
cout << res << "\n";
} | [
"variable_declaration.type.change"
] | 768,862 | 768,863 | u026537738 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
std::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 count = 0;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
count += a[i];
b[i] -= a[i];
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];
}
}
cout << count << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
std::cin >> n;
vector<long int> a(n + 1);
vector<long 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 int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
count += a[i];
b[i] -= a[i];
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];
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,864 | 768,865 | u452933618 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, m, n) for (int i = m; i < n; ++i)
ll solve(vector<int> A, vector<int> B, int N) {
ll res = 0;
rep(i, 0, N) {
int d = min(A[i], B[i]);
A[i] -= d;
B[i] -= d;
res += d;
d = min(A[i + 1], B[i]);
A[i] -= d;
B[i] -= d;
res += d;
}
return res;
}
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 ans = solve(A, B, N);
reverse(A.begin(), A.end());
reverse(B.begin(), B.end());
ans = max(ans, solve(A, B, N));
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, m, n) for (int i = m; i < n; ++i)
ll solve(vector<int> A, vector<int> B, int N) {
ll res = 0;
rep(i, 0, N) {
int d = min(A[i], B[i]);
A[i] -= d;
B[i] -= d;
res += d;
d = min(A[i + 1], B[i]);
A[i + 1] -= d;
B[i] -= d;
res += d;
}
return res;
}
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 ans = solve(A, B, N);
reverse(A.begin(), A.end());
reverse(B.begin(), B.end());
ans = max(ans, solve(A, B, N));
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 768,866 | 768,867 | u756388720 | cpp |
p02959 | /*
C++
encoding: UTF-8
Modified: <27/Jul/2019 05:46:48 PM>
✪ H4WK3yE乡
Mohd. Farhan Tahir
Indian Institute Of Information Technology
(IIIT), Gwalior
*/
#include <bits/stdc++.h>
#ifdef LOCAL_PROJECT
#include <prettyprint.hpp>
#endif
using namespace std;
// clang-format off
#define int long long
#define ll long long
#define mod 1000000007
#define ve vector
#define pb push_back
#define endl "\n";
#define ff first
#define ss second
#define pii pair<int, int>
#define len(v) int(v.size())
#define all(v) v.begin(), v.end()
#define reset(a, b) memset(a, b, sizeof(a));
#define fr(i, s, n) for (ll i = s ; i < n ; ++i)
#define dfr(i, s, n) for (ll i = s ; i > n ; --i)
void print (string sep = "\n") {
cout << sep;
}
template < typename T, typename... TAIL > void print (const T& t, TAIL... tail) {
cout << t << " ";
print (tail...);
}
// clang-format on
signed main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int n;
cin >> n;
int a[n + 1];
fr(i, 0, n + 1) cin >> a[i];
int b[n];
fr(i, 0, n) cin >> b[i];
int ans = 0, curr = 0;
fr(i, 0, n) {
curr = min(a[i], b[i]);
ans += curr;
b[i] -= curr;
curr = min(a[i + 1], b[i]);
b[i] -= curr;
ans += curr;
}
print(ans);
return 0;
}
| /*
C++
encoding: UTF-8
Modified: <27/Jul/2019 05:48:35 PM>
✪ H4WK3yE乡
Mohd. Farhan Tahir
Indian Institute Of Information Technology
(IIIT), Gwalior
*/
#include <bits/stdc++.h>
#ifdef LOCAL_PROJECT
#include <prettyprint.hpp>
#endif
using namespace std;
// clang-format off
#define int long long
#define ll long long
#define mod 1000000007
#define ve vector
#define pb push_back
#define endl "\n";
#define ff first
#define ss second
#define pii pair<int, int>
#define len(v) int(v.size())
#define all(v) v.begin(), v.end()
#define reset(a, b) memset(a, b, sizeof(a));
#define fr(i, s, n) for (ll i = s ; i < n ; ++i)
#define dfr(i, s, n) for (ll i = s ; i > n ; --i)
void print (string sep = "\n") {
cout << sep;
}
template < typename T, typename... TAIL > void print (const T& t, TAIL... tail) {
cout << t << " ";
print (tail...);
}
// clang-format on
signed main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int n;
cin >> n;
int a[n + 1];
fr(i, 0, n + 1) cin >> a[i];
int b[n];
fr(i, 0, n) cin >> b[i];
int ans = 0, curr = 0;
fr(i, 0, n) {
curr = min(a[i], b[i]);
ans += curr;
b[i] -= curr;
curr = min(a[i + 1], b[i]);
a[i + 1] -= curr;
ans += curr;
}
print(ans);
return 0;
}
| [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 768,868 | 768,869 | u907206514 | cpp |
p02959 | //
// Created by yuu on 2019-07-27.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[100010];
int B[100010];
int main(void) {
int N;
cin >> N;
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
int e_count = 0;
for (int i = 0; i < N; ++i) {
if (B[i] >= A[i]) {
e_count += A[i];
B[i] -= A[i];
if (B[i] >= A[i + 1]) {
e_count += A[i + 1];
A[i + 1] = 0;
} else {
e_count += B[i];
A[i + 1] -= B[i];
}
} else {
e_count += B[i];
}
}
cout << e_count << endl;
return 0;
} | //
// Created by yuu on 2019-07-27.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[100010];
int B[100010];
int main(void) {
int N;
cin >> N;
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
long long e_count = 0;
for (int i = 0; i < N; ++i) {
if (B[i] >= A[i]) {
e_count += A[i];
B[i] -= A[i];
if (B[i] >= A[i + 1]) {
e_count += A[i + 1];
A[i + 1] = 0;
} else {
e_count += B[i];
A[i + 1] -= B[i];
}
} else {
e_count += B[i];
}
}
cout << e_count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,872 | 768,873 | u149583407 | cpp |
p02959 | //
// Created by yuu on 2019-07-27.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[100010];
int B[100010];
int main(void) {
int N;
cin >> N;
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
int e_count = 0;
for (int i = 0; i < N; ++i) {
if (B[i] > A[i]) {
e_count += A[i];
B[i] -= A[i];
if (B[i] > A[i + 1]) {
e_count += A[i + 1];
A[i + 1] = 0;
} else {
e_count += B[i];
A[i + 1] -= B[i];
}
} else {
e_count += B[i];
}
}
cout << e_count << endl;
return 0;
} | //
// Created by yuu on 2019-07-27.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[100010];
int B[100010];
int main(void) {
int N;
cin >> N;
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
long long e_count = 0;
for (int i = 0; i < N; ++i) {
if (B[i] >= A[i]) {
e_count += A[i];
B[i] -= A[i];
if (B[i] >= A[i + 1]) {
e_count += A[i + 1];
A[i + 1] = 0;
} else {
e_count += B[i];
A[i + 1] -= B[i];
}
} else {
e_count += B[i];
}
}
cout << e_count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 768,874 | 768,873 | u149583407 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9, mod = 1e9 + 7;
typedef long long ll;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9')
f = (c == '-') ? -1 : 1, c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
int a[100001], b[100001];
main() {
int n = read(), ans = 0, x;
for (int i = 1; i <= n + 1; i++)
a[i] = read();
for (int i = 1; i <= n; i++)
b[i] = read();
for (int i = n + 1; i >= 1; i--) {
if (b[i] != 0)
x = min(b[i], a[i]), ans += min(b[i], a[i]), a[i] -= x, b[i] -= x;
if (b[i] == 0) {
ans += min(b[i - 1], a[i]);
b[i - 1] -= min(b[i - 1], a[i]);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int inf = 1e9, mod = 1e9 + 7;
typedef long long ll;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9')
f = (c == '-') ? -1 : 1, c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
int a[100001], b[100001];
main() {
int n = read(), ans = 0, x;
for (int i = 1; i <= n + 1; i++)
a[i] = read();
for (int i = 1; i <= n; i++)
b[i] = read();
for (int i = n + 1; i >= 1; i--) {
if (b[i] != 0)
x = min(b[i], a[i]), ans += min(b[i], a[i]), a[i] -= x, b[i] -= x;
if (b[i] == 0) {
ans += min(b[i - 1], a[i]);
b[i - 1] -= min(b[i - 1], a[i]);
}
}
cout << ans << endl;
} | [] | 768,875 | 768,876 | u699008937 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 1 << 29;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, Ans = 0;
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];
for (int i = 0; i < N; i++) {
int tmp = min(A[i], B[i]);
A[i] -= tmp;
B[i] -= tmp;
Ans += tmp;
int tmp2 = min(A[i + 1], B[i]);
A[i + 1] -= tmp2;
B[i] -= tmp2;
Ans += tmp2;
}
cout << Ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 1 << 29;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, Ans = 0;
cin >> N;
vector<ll> 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];
for (int i = 0; i < N; i++) {
ll tmp = min(A[i], B[i]);
A[i] -= tmp;
B[i] -= tmp;
Ans += tmp;
ll tmp2 = min(A[i + 1], B[i]);
A[i + 1] -= tmp2;
B[i] -= tmp2;
Ans += tmp2;
}
cout << Ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 768,877 | 768,878 | u019356802 | cpp |
p02959 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
#define ff first
#define ss second
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int &i : a)
cin >> i;
for (int &i : b)
cin >> i;
int ans = 0;
for (int i = 0; i < n; i++) {
int c = min(a[i], b[i]);
ans += c;
a[i] -= c;
b[i] -= c;
c = min(a[i + 1], b[i]);
ans += c;
a[i + 1] -= c;
}
cout << ans << endl;
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
#define ff first
#define ss second
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int &i : a)
cin >> i;
for (int &i : b)
cin >> i;
ll ans = 0;
for (int i = 0; i < n; i++) {
int c = min(a[i], b[i]);
ans += c;
a[i] -= c;
b[i] -= c;
c = min(a[i + 1], b[i]);
ans += c;
a[i + 1] -= c;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,879 | 768,880 | u866482228 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i)
cin >> b[i];
ll ans = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] + a[i] + 1 >= b[i]) {
ans += b[i];
b[i] -= a[i];
if (b[i] < 0)
b[i] = 0;
a[i + 1] -= b[i];
} else {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i)
cin >> b[i];
ll ans = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] + a[i + 1] >= b[i]) {
ans += b[i];
b[i] -= a[i];
if (b[i] < 0)
b[i] = 0;
a[i + 1] -= b[i];
} else {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0;
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 768,881 | 768,882 | u113973663 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i)
cin >> b[i];
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] + a[i] + 1 >= b[i]) {
ans += b[i];
b[i] -= a[i];
if (b[i] < 0)
b[i] = 0;
a[i + 1] -= b[i];
} else {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i)
cin >> b[i];
ll ans = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] + a[i + 1] >= b[i]) {
ans += b[i];
b[i] -= a[i];
if (b[i] < 0)
b[i] = 0;
a[i + 1] -= b[i];
} else {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 768,883 | 768,882 | u113973663 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
#define N 100005
using namespace std;
ll a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, s = 0, i, x;
cin >> n;
for (i = 1; i <= n + 1; ++i)
cin >> a[i];
for (i = 1; i <= n; ++i) {
cin >> x;
if (x >= a[i])
s += a[i], x -= a[i];
else
s += x;
if (x >= a[i + 1])
s += a[i + 1], a[i + 1] = 0;
else
s += x, a[i + 1] -= x;
}
cout << s;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define N 100005
using namespace std;
ll a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, s = 0, i, x;
cin >> n;
for (i = 1; i <= n + 1; ++i)
cin >> a[i];
for (i = 1; i <= n; ++i) {
cin >> x;
if (x >= a[i])
s += a[i], x -= a[i];
else
s += x, x = 0;
if (x >= a[i + 1])
s += a[i + 1], a[i + 1] = 0;
else
s += x, a[i + 1] -= x;
}
cout << s;
return 0;
}
| [] | 768,884 | 768,885 | u130151909 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); i >= (l); --i)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
template <typename T> bool setmin(T &a, T b) {
if (b < a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmax(T &a, T b) {
if (b > a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmineq(T &a, T b) {
if (b <= a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmaxeq(T &a, T b) {
if (b >= a) {
a = b;
return true;
} else {
return false;
}
}
LL mo(LL a, LL b) {
assert(b > 0);
a %= b;
if (a < 0) {
a += b;
}
return a;
}
LL fl(LL a, LL b) {
assert(b > 0);
return (a > 0 ? a / b : (a - b + 1) / b);
}
LL ce(LL a, LL b) {
assert(b > 0);
return (a < 0 ? a / b : (a + b - 1) / b);
}
template <typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL>(v.size())
#define RF(e, v) for (auto &e : v)
#define ef else if
#define UR assert(false)
// ---- ----
LL n, a[100001], b[100000];
int main() {
cin >> n;
inc(i, n + 1) { cin >> a[i]; }
inc(i, n) { cin >> b[i]; }
LL ans = 0;
inc(i, n) {
LL c = min(a[i], b[i]);
ans += c;
a[i] -= c;
b[i] -= c;
c = min(a[i + 1], b[i]);
ans += c;
a[i] -= c;
b[i] -= c;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); i >= (l); --i)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
template <typename T> bool setmin(T &a, T b) {
if (b < a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmax(T &a, T b) {
if (b > a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmineq(T &a, T b) {
if (b <= a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmaxeq(T &a, T b) {
if (b >= a) {
a = b;
return true;
} else {
return false;
}
}
LL mo(LL a, LL b) {
assert(b > 0);
a %= b;
if (a < 0) {
a += b;
}
return a;
}
LL fl(LL a, LL b) {
assert(b > 0);
return (a > 0 ? a / b : (a - b + 1) / b);
}
LL ce(LL a, LL b) {
assert(b > 0);
return (a < 0 ? a / b : (a + b - 1) / b);
}
template <typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL>(v.size())
#define RF(e, v) for (auto &e : v)
#define ef else if
#define UR assert(false)
// ---- ----
LL n, a[100001], b[100000];
int main() {
cin >> n;
inc(i, n + 1) { cin >> a[i]; }
inc(i, n) { cin >> b[i]; }
LL ans = 0;
inc(i, n) {
LL c = min(a[i], b[i]);
ans += c;
a[i] -= c;
b[i] -= c;
c = min(a[i + 1], b[i]);
ans += c;
a[i + 1] -= c;
b[i] -= c;
}
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 768,886 | 768,887 | u568652083 | cpp |
p02959 | // abc135_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define ALL(x) x.begin(), x.end()
#define INF ((1 << 29) - 1)
#define MOD (1000000007)
#define print2D(h, w, arr) \
REP(i, h) { \
REP(j, w) cout << arr[i][j] << " "; \
cout << endl; \
}
template <class T> void print(const T &x) { cout << x << endl; }
template <class T, class... A> void print(const T &first, const A &...rest) {
cout << first << " ";
print(rest...);
}
struct PreMain {
PreMain() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} premain;
int main() {
#ifdef LOCAL
ifstream in("../arg.txt");
cin.rdbuf(in.rdbuf());
#endif
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 before = accumulate(ALL(A), 0);
REP(i, N) {
if (B[i] >= A[i]) {
B[i] -= A[i];
A[i] = 0;
A[i + 1] = max(0, A[i + 1] - B[i]);
} else {
A[i] -= B[i];
}
}
int after = accumulate(ALL(A), 0);
print(before - after);
return 0;
}
| // abc135_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define ALL(x) x.begin(), x.end()
#define INF ((1 << 29) - 1)
#define MOD (1000000007)
#define print2D(h, w, arr) \
REP(i, h) { \
REP(j, w) cout << arr[i][j] << " "; \
cout << endl; \
}
template <class T> void print(const T &x) { cout << x << endl; }
template <class T, class... A> void print(const T &first, const A &...rest) {
cout << first << " ";
print(rest...);
}
struct PreMain {
PreMain() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} premain;
int main() {
#ifdef LOCAL
ifstream in("../arg.txt");
cin.rdbuf(in.rdbuf());
#endif
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
REP(i, N + 1) cin >> A[i];
REP(i, N) cin >> B[i];
ll before = accumulate(ALL(A), 0ll);
REP(i, N) {
if (B[i] >= A[i]) {
B[i] -= A[i];
A[i] = 0;
A[i + 1] = max(0ll, A[i + 1] - B[i]);
} else {
A[i] -= B[i];
}
}
ll after = accumulate(ALL(A), 0ll);
print(before - after);
return 0;
}
| [
"variable_declaration.type.change",
"call.arguments.change"
] | 768,888 | 768,889 | u614550445 | cpp |
p02959 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<vector<int>> VVI;
typedef vector<vector<bool>> VVB;
typedef vector<vector<double>> VVD;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(a) (a).begin(), (a).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
VI a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
int ans = 0;
rep(i, n) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
a.at(i) -= b.at(i);
continue;
}
ans += a.at(i);
b.at(i) -= a.at(i);
if (a.at(i + 1) >= b.at(i)) {
ans += b.at(i);
a.at(i + 1) -= b.at(i);
continue;
}
ans += a.at(i + 1);
a.at(i + 1) = 0;
}
cout << ans << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<vector<int>> VVI;
typedef vector<vector<bool>> VVB;
typedef vector<vector<double>> VVD;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(a) (a).begin(), (a).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
LL n;
cin >> n;
VLL a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
LL ans = 0;
rep(i, n) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
a.at(i) -= b.at(i);
continue;
}
ans += a.at(i);
b.at(i) -= a.at(i);
if (a.at(i + 1) >= b.at(i)) {
ans += b.at(i);
a.at(i + 1) -= b.at(i);
continue;
}
ans += a.at(i + 1);
a.at(i + 1) = 0;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,892 | 768,893 | u662614053 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i <= n; i++)
cin >> a[i];
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0;
for (int i = 0; i <= n; i++) {
if (i > 0)
if (h[i - 1] >= a[i]) {
h[i - 1] -= a[i];
ans += a[i];
a[i] = 0;
continue;
} else {
ans += h[i - 1];
a[i] -= h[i - 1];
h[i - 1] = 0;
}
if (i < n)
if (h[i] >= a[i]) {
h[i] -= a[i];
ans += a[i];
a[i] = 0;
continue;
} else {
ans += h[i];
a[i] -= h[i];
h[i] = 0;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i <= n; i++)
cin >> a[i];
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
long long ans = 0;
for (int i = 0; i <= n; i++) {
if (i > 0)
if (h[i - 1] >= a[i]) {
h[i - 1] -= a[i];
ans += a[i];
a[i] = 0;
continue;
} else {
ans += h[i - 1];
a[i] -= h[i - 1];
h[i - 1] = 0;
}
if (i < n)
if (h[i] >= a[i]) {
h[i] -= a[i];
ans += a[i];
a[i] = 0;
continue;
} else {
ans += h[i];
a[i] -= h[i];
h[i] = 0;
}
}
cout << ans;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,898 | 768,899 | u933786880 | cpp |
p02959 | //
// main.cpp
// C - City Savers
//
// Created by Hashizo on 2019/07/27.
// Copyright © 2019 Hashizo. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <regex>
#include <string>
#include <vector>
using namespace std;
#undef INT_MAX
#undef INT_MIN
#define INT_MAX 2147483647
#define INT_MIN (-INT_MAX - 1)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define REPLACE(s, f, t) regex_replace(s, regex(f), t)
int main(int argc, const char *argv[]) {
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 cnt = 0;
REP(i, n) {
if (a[i] > b[i]) {
cnt += b[i];
continue;
} else {
cnt += a[i];
b[i] -= a[i];
}
if (a[i + 1] > b[i]) {
cnt += b[i];
a[i + 1] -= b[i];
continue;
} else {
cnt += a[i + 1];
a[i + 1] = 0;
}
}
cout << cnt << endl;
return 0;
}
| //
// main.cpp
// C - City Savers
//
// Created by Hashizo on 2019/07/27.
// Copyright © 2019 Hashizo. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <regex>
#include <string>
#include <vector>
using namespace std;
#undef INT_MAX
#undef INT_MIN
#define INT_MAX 2147483647
#define INT_MIN (-INT_MAX - 1)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define REPLACE(s, f, t) regex_replace(s, regex(f), t)
int main(int argc, const char *argv[]) {
int n;
cin >> n;
long a[n + 1];
long b[n];
REP(i, n + 1) { cin >> a[i]; }
REP(i, n) { cin >> b[i]; }
long cnt = 0;
REP(i, n) {
if (a[i] > b[i]) {
cnt += b[i];
continue;
} else {
cnt += a[i];
b[i] -= a[i];
}
if (a[i + 1] > b[i]) {
cnt += b[i];
a[i + 1] -= b[i];
continue;
} else {
cnt += a[i + 1];
a[i + 1] = 0;
}
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 768,902 | 768,903 | u156723325 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, cnt = 0, enemy = 0;
cin >> N;
vector<int> A(N + 1);
REP(i, N + 1) cin >> A[i];
vector<int> B(N);
REP(i, N) cin >> B[i];
REP(i, N) {
if (A[i] >= B[i])
cnt += B[i];
else {
enemy = A[i] + A[i + 1];
if (enemy >= B[i]) {
cnt += B[i];
A[i + 1] -= B[i] - A[i];
} else {
cnt += enemy;
A[i + 1] = 0;
}
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
ll cnt = 0, enemy = 0;
cin >> N;
vector<int> A(N + 1);
REP(i, N + 1) cin >> A[i];
vector<int> B(N);
REP(i, N) cin >> B[i];
REP(i, N) {
if (A[i] >= B[i])
cnt += B[i];
else {
enemy = A[i] + A[i + 1];
if (enemy >= B[i]) {
cnt += B[i];
A[i + 1] -= B[i] - A[i];
} else {
cnt += enemy;
A[i + 1] = 0;
}
}
}
cout << cnt << endl;
}
| [] | 768,905 | 768,906 | u717501752 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (auto &a : A) {
cin >> a;
}
for (auto &b : B) {
cin >> b;
}
int ans = 0;
for (int ii = 0; ii < N; ii++) {
int removed_mobs = min(A[ii], B[ii]);
ans += removed_mobs;
A[ii] -= removed_mobs;
B[ii] -= removed_mobs;
removed_mobs = min(A[ii + 1], B[ii]);
ans += removed_mobs;
A[ii + 1] -= removed_mobs;
B[ii] -= removed_mobs;
}
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);
for (auto &a : A) {
cin >> a;
}
for (auto &b : B) {
cin >> b;
}
long long int ans = 0;
for (int ii = 0; ii < N; ii++) {
int removed_mobs = min(A[ii], B[ii]);
ans += removed_mobs;
A[ii] -= removed_mobs;
B[ii] -= removed_mobs;
removed_mobs = min(A[ii + 1], B[ii]);
ans += removed_mobs;
A[ii + 1] -= removed_mobs;
B[ii] -= removed_mobs;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 768,907 | 768,908 | u471342385 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
int monsterSum = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
// monsterSum += A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int m = min(A[i], B[i]);
A[i] -= m;
B[i] -= m;
// cout<<A[i]<<" ";
monsterSum += m;
// cout<<m << " ";
if (i + 1 < N + 1) {
m = min(A[i + 1], B[i]);
// cout<<m<<endl;
A[i + 1] -= m;
B[i] -= m;
monsterSum += m;
// cout<<A[i]<<" ";
}
// cout<<endl;
}
cout << monsterSum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
long monsterSum = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
// monsterSum += A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int m = min(A[i], B[i]);
A[i] -= m;
B[i] -= m;
// cout<<A[i]<<" ";
monsterSum += m;
// cout<<m << " ";
if (i + 1 < N + 1) {
m = min(A[i + 1], B[i]);
// cout<<m<<endl;
A[i + 1] -= m;
B[i] -= m;
monsterSum += m;
// cout<<A[i]<<" ";
}
// cout<<endl;
}
cout << monsterSum << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,911 | 768,912 | u117345342 | 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[i];
vector<int> b(n);
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 += a[i];
if (a[i + 1] - (b[i] - a[i]) < 0) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | #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[i];
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> b[i];
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
if (a[i + 1] - (b[i] - a[i]) < 0) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,914 | 768,915 | u355520191 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rop(i, n) for (int i = 1; i < n + 1; i++)
using namespace std;
using std::swap;
vector<int> p;
vector<int> q;
int main() {
int N, t = 0;
cin >> N;
p.resize(N + 1);
q.resize(N);
rep(i, N + 1) cin >> p[i];
rep(i, N) cin >> q[i];
rep(i, N) {
if (q[i] > p[i]) {
t += p[i];
q[i] -= p[i];
p[i] = 0;
} else {
t += q[i];
p[i] -= q[i];
q[i] = 0;
}
if (q[i] > p[i + 1]) {
t += p[i + 1];
q[i] -= p[i + 1];
p[i + 1] = 0;
} else {
t += q[i];
p[i + 1] -= q[i];
q[i] = 0;
}
if (i == N - i - 1)
break;
if (q[N - i - 1] > p[N - i]) {
t += p[N - i];
q[N - i - 1] -= p[N - i];
p[N - i] = 0;
} else {
t += q[N - i - 1];
p[N - i] -= q[N - i - 1];
q[N - i - 1] = 0;
}
if (q[N - i - 1] > p[N - i - 1]) {
t += p[N - i - 1];
q[N - i - 1] -= p[N - i - 1];
p[N - i - 1] = 0;
} else {
t += q[N - i - 1];
p[N - i - 1] -= q[N - i - 1];
q[N - i - 1] = 0;
}
if (i + 1 == N - i - 1)
break;
}
cout << t << "\n";
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rop(i, n) for (int i = 1; i < n + 1; i++)
using namespace std;
using std::swap;
vector<long long int> p;
vector<long long int> q;
int main() {
long long int N, t = 0;
cin >> N;
p.resize(N + 1);
q.resize(N);
rep(i, N + 1) cin >> p[i];
rep(i, N) cin >> q[i];
rep(i, N) {
if (q[i] > p[i]) {
t += p[i];
q[i] -= p[i];
p[i] = 0;
} else {
t += q[i];
p[i] -= q[i];
q[i] = 0;
}
if (q[i] > p[i + 1]) {
t += p[i + 1];
q[i] -= p[i + 1];
p[i + 1] = 0;
} else {
t += q[i];
p[i + 1] -= q[i];
q[i] = 0;
}
if (i == N - i - 1)
break;
if (q[N - i - 1] > p[N - i]) {
t += p[N - i];
q[N - i - 1] -= p[N - i];
p[N - i] = 0;
} else {
t += q[N - i - 1];
p[N - i] -= q[N - i - 1];
q[N - i - 1] = 0;
}
if (q[N - i - 1] > p[N - i - 1]) {
t += p[N - i - 1];
q[N - i - 1] -= p[N - i - 1];
p[N - i - 1] = 0;
} else {
t += q[N - i - 1];
p[N - i - 1] -= q[N - i - 1];
q[N - i - 1] = 0;
}
if (i + 1 == N - i - 1)
break;
}
cout << t << "\n";
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,918 | 768,919 | u196471026 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N, sum = 0;
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];
}
for (int i = 0; i < N; i++) {
int mons_sum = A[i] + A[i + 1];
int min_val = min(mons_sum, B[i]);
sum += min_val;
if ((A[i] < B[i])) {
A[i + 1] = mons_sum - B[i];
if (A[i + 1] < 0) {
A[i + 1] = 0;
}
}
}
cout << sum;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long N, sum = 0;
cin >> N;
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];
}
for (int i = 0; i < N; i++) {
long mons_sum = A[i] + A[i + 1];
long min_val = min(mons_sum, B[i]);
sum += min_val;
if ((A[i] < B[i])) {
A[i + 1] = mons_sum - B[i];
if (A[i + 1] < 0) {
A[i + 1] = 0;
}
}
}
cout << sum;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 768,923 | 768,924 | u515328251 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
ans += B.at(i);
} else {
if ((A.at(i) + A.at(i + 1)) >= B.at(i)) {
ans += B.at(i);
long long remon = B.at(i) - A.at(i);
A.at(i + 1) -= remon;
} else {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
ans += B.at(i);
} else {
if (A.at(i) + A.at(i + 1) >= B.at(i)) {
ans += B.at(i);
long long remon = B.at(i) - A.at(i);
A.at(i + 1) -= remon;
} else {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 768,928 | 768,929 | u265341684 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
ans += B.at(i);
} else {
if (A.at(i) + A.at(i + 1) >= B.at(i)) {
ans += B.at(i);
long long remon = B.at(i) - A.at(i);
A.at(i + 1) -= remon;
} else {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
ans += B.at(i);
} else {
if (A.at(i) + A.at(i + 1) >= B.at(i)) {
ans += B.at(i);
long long remon = B.at(i) - A.at(i);
A.at(i + 1) -= remon;
} else {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,930 | 768,929 | u265341684 | cpp |
p02959 | #include <stdio.h>
#include <stdlib.h>
long A[100000 + 1];
long B[100000];
int main(int argc, char *argv[]) {
long N;
long i;
long sum;
scanf("%ld", &N);
for (i = 0; i < N + 1; i++) {
scanf("%ld", &A[i]);
}
for (i = 0; i < N; i++) {
scanf("%ld", &B[i]);
}
sum = 0;
for (i = 0; i < N; i++) {
if (A[i] > B[i]) {
sum += B[i];
} else {
sum += A[i];
if (A[i + 1] > (B[i] - A[i])) {
sum += (B[i] - A[i]);
A[i + 1] -= (B[i] - A[i]);
} else {
sum += A[i];
A[i + 1] = 0;
}
}
}
printf("%ld\n", sum);
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
long A[100000 + 1];
long B[100000];
int main(int argc, char *argv[]) {
long N;
long i;
long sum;
scanf("%ld", &N);
for (i = 0; i < N + 1; i++) {
scanf("%ld", &A[i]);
}
for (i = 0; i < N; i++) {
scanf("%ld", &B[i]);
}
sum = 0;
for (i = 0; i < N; i++) {
if (A[i] > B[i]) {
sum += B[i];
} else {
sum += A[i];
if (A[i + 1] > (B[i] - A[i])) {
sum += (B[i] - A[i]);
A[i + 1] -= (B[i] - A[i]);
} else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
}
printf("%ld\n", sum);
return 0;
}
| [
"assignment.change"
] | 768,935 | 768,936 | u221652877 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll N = 1e3 + 200;
const ll INF = 0x3f3f3f;
const ll Mode = 1e9 + 7;
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 rst = 0;
ll k = 0;
rep(i, n) {
// cout<<rst<<endl;
if (k >= a[i]) {
rst += a[i];
k -= a[i];
a[i] = 0;
if (k >= a[i + 1]) {
rst += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= k;
rst += k;
}
} else {
a[i] -= k;
rst += k;
}
k = 0;
if (a[i] >= b[i]) {
rst += b[i];
a[i] -= b[i];
k = 0;
} else {
rst += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
rst += b[i];
a[i + 1] -= b[i];
b[i] = 0;
k = 0;
} else {
rst += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
k = b[i];
}
}
}
cout << rst << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll N = 1e3 + 200;
const ll INF = 0x3f3f3f;
const ll Mode = 1e9 + 7;
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 rst = 0;
ll k = 0;
rep(i, n) {
// cout<<rst<<endl;
if (k >= a[i]) {
rst += a[i];
k -= a[i];
a[i] = 0;
if (k >= a[i + 1]) {
rst += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= k;
rst += k;
}
} else {
a[i] -= k;
rst += k;
}
k = 0;
if (a[i] >= b[i]) {
rst += b[i];
a[i] -= b[i];
k = 0;
} else {
rst += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
rst += b[i];
a[i + 1] -= b[i];
b[i] = 0;
k = 0;
} else {
rst += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
k = 0;
}
}
}
cout << rst << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 768,937 | 768,938 | u624688258 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
int ct = 0;
for (int k = 0; k <= n; k++) {
int dif = 0;
if (a[k] >= b[k])
ct += b[k];
else {
ct += a[k];
dif = b[k] - a[k];
if (dif < a[k + 1]) {
ct += dif;
a[k + 1] -= dif;
} else {
ct += a[k + 1];
a[k + 1] = 0;
}
}
}
cout << ct << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
long long ct = 0;
for (int k = 0; k < n; k++) {
int dif = 0;
if (a[k] >= b[k])
ct += b[k];
else {
ct += a[k];
dif = b[k] - a[k];
if (dif < a[k + 1]) {
ct += dif;
a[k + 1] -= dif;
} else {
ct += a[k + 1];
a[k + 1] = 0;
}
}
}
cout << ct << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 768,939 | 768,940 | u464527162 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
int ct = 0;
for (int k = 0; k < n; k++) {
int dif = 0;
if (a[k] >= b[k])
ct += b[k];
else {
ct += a[k];
dif = b[k] - a[k];
if (dif < a[k + 1]) {
ct += dif;
a[k + 1] -= dif;
} else {
ct += a[k + 1];
a[k + 1] = 0;
}
}
}
cout << ct << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
long long ct = 0;
for (int k = 0; k < n; k++) {
int dif = 0;
if (a[k] >= b[k])
ct += b[k];
else {
ct += a[k];
dif = b[k] - a[k];
if (dif < a[k + 1]) {
ct += dif;
a[k + 1] -= dif;
} else {
ct += a[k + 1];
a[k + 1] = 0;
}
}
}
cout << ct << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,941 | 768,940 | u464527162 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
// long long…2^64-1 = 9223372036854775807まで
void _main() {
int N;
cin >> N;
int A[100001];
rep(i, 0, N + 1) cin >> A[i];
int B[100000];
rep(i, 0, N) cin >> B[i];
int count = 0;
rep(i, 0, N) { count += B[i]; }
rep(i, 0, N) {
A[i] -= B[i];
if (A[i] < 0)
A[i + 1] += A[i];
if (A[i + 1] < 0) {
count += A[i + 1];
A[i + 1] = 0;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
// long long…2^64-1 = 9223372036854775807まで
void _main() {
int N;
cin >> N;
ll A[100001];
rep(i, 0, N + 1) cin >> A[i];
ll B[100000];
rep(i, 0, N) cin >> B[i];
ll count = 0;
rep(i, 0, N) { count += B[i]; }
rep(i, 0, N) {
A[i] -= B[i];
if (A[i] < 0)
A[i + 1] += A[i];
if (A[i + 1] < 0) {
count += A[i + 1];
A[i + 1] = 0;
}
}
cout << count << endl;
} | [
"variable_declaration.type.change"
] | 768,946 | 768,947 | u687529684 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cstdlib>
#include <ctime>
#define rep(i, N) for (long i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
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 S, count = 0;
rep(i, N) {
S = B[i] - A[i];
if (S >= 0) {
count += A[i];
A[i] = 0;
if (S >= A[i + 1]) {
count += A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= S;
count += S;
}
} else {
count += B[i];
A[i] -= B[i];
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
#include <cstdlib>
#include <ctime>
#define rep(i, N) for (long i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1), B(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long S, count = 0;
rep(i, N) {
S = B[i] - A[i];
if (S >= 0) {
count += A[i];
A[i] = 0;
if (S >= A[i + 1]) {
count += A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= S;
count += S;
}
} else {
count += B[i];
A[i] -= B[i];
}
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 768,948 | 768,949 | u466393447 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (auto &&s : a) {
cin >> s;
}
for (auto &&s : b) {
cin >> s;
}
ll sum = 0, diff = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) + diff < a.at(i)) {
sum += b.at(i);
diff = 0;
} else {
diff = b.at(i) - (a.at(i) > diff ? a.at(i) - diff : 0);
sum += a.at(i);
}
}
cout << sum + (a.at(n) > diff ? diff : a.at(n)) << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (auto &&s : a) {
cin >> s;
}
for (auto &&s : b) {
cin >> s;
}
ll sum = 0, diff = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) + diff < a.at(i)) {
sum += b.at(i) + diff;
diff = 0;
} else {
diff = b.at(i) - (a.at(i) > diff ? a.at(i) - diff : 0);
sum += a.at(i);
}
}
cout << sum + (a.at(n) > diff ? diff : a.at(n)) << endl;
}
| [
"assignment.change"
] | 768,950 | 768,951 | u040700157 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int a[n + 5], b[n + 5];
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 (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
}
} else {
ans += b[i];
a[i] -= b[i];
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int a[n + 5], b[n + 5];
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 (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
}
} else {
ans += b[i];
a[i] -= b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,952 | 768,953 | u697325966 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
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 result = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
result += b[i];
} else {
b[i] -= a[i];
result += a[i];
if (b[i] > a[i + 1]) {
result += a[i + 1];
a[i] = 0;
} else {
result += b[i];
a[i + 1] -= b[i];
}
}
}
cout << result << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
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 result = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
result += b[i];
} else {
b[i] -= a[i];
result += a[i];
if (b[i] > a[i + 1]) {
result += a[i + 1];
a[i + 1] = 0;
} else {
result += b[i];
a[i + 1] -= b[i];
}
}
}
cout << result << endl;
}
| [
"assignment.change"
] | 768,954 | 768,955 | u911147723 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
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 result = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
result += b[i];
} else {
b[i] -= a[i];
result += a[i];
if (b[i] > a[i + 1]) {
result += a[i + 1];
a[i] = 0;
} else {
result += b[i];
a[i + 1] -= b[i];
}
}
}
cout << result << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
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 result = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
result += b[i];
} else {
b[i] -= a[i];
result += a[i];
if (b[i] > a[i + 1]) {
result += a[i + 1];
a[i + 1] = 0;
} else {
result += b[i];
a[i + 1] -= b[i];
}
}
}
cout << result << endl;
}
| [
"variable_declaration.type.primitive.change",
"assignment.change"
] | 768,956 | 768,955 | u911147723 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int N;
vector<int> A, B;
int main() {
int ans = 0;
cin >> N;
A = vector<int>(N + 2);
B = vector<int>(N + 1);
for (int i = 1; i < N + 2; i++) {
cin >> A.at(i);
}
for (int i = 1; i < N + 1; i++) {
cin >> B.at(i);
}
for (int i = 1; i < N + 1; i++) {
int de = (A.at(i) <= B.at(i)) ? A.at(i) : B.at(i);
ans += de;
B.at(i) -= de;
de = (A.at(i + 1) <= B.at(i)) ? A.at(i + 1) : B.at(i);
ans += de;
A.at(i + 1) -= de;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int N;
vector<int> A, B;
int main() {
long long ans = 0;
cin >> N;
A = vector<int>(N + 2);
B = vector<int>(N + 1);
for (int i = 1; i < N + 2; i++) {
cin >> A.at(i);
}
for (int i = 1; i < N + 1; i++) {
cin >> B.at(i);
}
for (int i = 1; i < N + 1; i++) {
int de = (A.at(i) <= B.at(i)) ? A.at(i) : B.at(i);
ans += de;
B.at(i) -= de;
de = (A.at(i + 1) <= B.at(i)) ? A.at(i + 1) : B.at(i);
ans += de;
A.at(i + 1) -= de;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,963 | 768,964 | u647974562 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A1(N + 1);
vector<int> B1(N);
vector<int> A2(N + 1);
vector<int> B2(N);
int sum = 0;
int max = 0;
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);
}
for (int i = N; i > 0; i--) {
if (B1.at(i - 1) - A1.at(i) > 0) {
sum += A1.at(i);
B1.at(i - 1) -= A1.at(i);
A1.at(i) = 0;
} else {
sum += B1.at(i - 1);
A1.at(i) -= B1.at(i - 1);
B1.at(i - 1) = 0;
}
if (B1.at(i - 1) - A1.at(i - 1) > 0) {
sum += A1.at(i - 1);
B1.at(i - 1) -= A1.at(i - 1);
A1.at(i - 1) = 0;
} else {
sum += B1.at(i - 1);
A1.at(i - 1) -= B1.at(i - 1);
B1.at(i - 1) = 0;
}
}
max = sum;
sum = 0;
for (int i = 0; i < N; i++) {
if (B2.at(i) - A2.at(i) > 0) {
sum += A2.at(i);
B2.at(i) -= A2.at(i);
A2.at(i) = 0;
} else {
sum += B2.at(i);
A2.at(i) -= B2.at(i);
B2.at(i) = 0;
}
if (B2.at(i) - A2.at(i + 1) > 0) {
sum += A2.at(i + 1);
B2.at(i) -= A2.at(i + 1);
A2.at(i + 1) = 0;
} else {
sum += B2.at(i);
A2.at(i + 1) -= B2.at(i);
B2.at(i) = 0;
}
}
if (sum > max) {
cout << sum << endl;
} else {
cout << max << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A1(N + 1);
vector<int> B1(N);
vector<int> A2(N + 1);
vector<int> B2(N);
int64_t sum = 0;
int64_t max = 0;
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);
}
for (int i = N; i > 0; i--) {
if (B1.at(i - 1) - A1.at(i) > 0) {
sum += A1.at(i);
B1.at(i - 1) -= A1.at(i);
A1.at(i) = 0;
} else {
sum += B1.at(i - 1);
A1.at(i) -= B1.at(i - 1);
B1.at(i - 1) = 0;
}
if (B1.at(i - 1) - A1.at(i - 1) > 0) {
sum += A1.at(i - 1);
B1.at(i - 1) -= A1.at(i - 1);
A1.at(i - 1) = 0;
} else {
sum += B1.at(i - 1);
A1.at(i - 1) -= B1.at(i - 1);
B1.at(i - 1) = 0;
}
}
max = sum;
sum = 0;
for (int i = 0; i < N; i++) {
if (B2.at(i) - A2.at(i) > 0) {
sum += A2.at(i);
B2.at(i) -= A2.at(i);
A2.at(i) = 0;
} else {
sum += B2.at(i);
A2.at(i) -= B2.at(i);
B2.at(i) = 0;
}
if (B2.at(i) - A2.at(i + 1) > 0) {
sum += A2.at(i + 1);
B2.at(i) -= A2.at(i + 1);
A2.at(i + 1) = 0;
} else {
sum += B2.at(i);
A2.at(i + 1) -= B2.at(i);
B2.at(i) = 0;
}
}
if (sum > max) {
cout << sum << endl;
} else {
cout << max << endl;
}
}
| [
"variable_declaration.type.primitive.change"
] | 768,968 | 768,969 | u596200441 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A;
vector<int> B;
int solve(int as, int ae) {
if (as >= ae)
return 0;
int sum = 0;
int ds = min(A[as], B[as]);
A[as] -= ds;
B[as] -= ds;
sum += ds;
int de = min(A[ae], B[ae - 1]);
A[ae] -= de;
B[ae - 1] -= de;
sum += de;
ds = min(A[as + 1], B[as]);
A[as + 1] -= ds;
B[as] -= ds;
sum += ds;
de = min(A[ae - 1], B[ae - 1]);
A[ae - 1] -= de;
B[ae - 1] -= de;
sum += de;
return sum + solve(as + 1, ae - 1);
}
int main() {
cin >> N;
A.resize(N + 1);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
B.resize(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
cout << solve(0, N);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A;
vector<int> B;
long solve(int as, int ae) {
if (as >= ae)
return 0;
long sum = 0;
int ds = min(A[as], B[as]);
A[as] -= ds;
B[as] -= ds;
sum += ds;
int de = min(A[ae], B[ae - 1]);
A[ae] -= de;
B[ae - 1] -= de;
sum += de;
ds = min(A[as + 1], B[as]);
A[as + 1] -= ds;
B[as] -= ds;
sum += ds;
de = min(A[ae - 1], B[ae - 1]);
A[ae - 1] -= de;
B[ae - 1] -= de;
sum += de;
return sum + solve(as + 1, ae - 1);
}
int main() {
cin >> N;
A.resize(N + 1);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
B.resize(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
cout << solve(0, N);
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 768,973 | 768,974 | u269291896 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A;
vector<int> B;
int solve(int as, int ae) {
if (as >= ae)
return 0;
int sum = 0;
int ds = min(A[as], B[as]);
A[as] -= ds;
B[as] -= ds;
sum += ds;
int de = min(A[ae], B[ae - 1]);
A[ae] -= de;
B[ae - 1] -= de;
sum += de;
ds = min(A[as + 1], B[as]);
A[as + 1] -= ds;
B[as] -= ds;
sum += ds;
de = min(A[ae - 1], B[ae - 1]);
A[ae - 1] -= de;
B[ae - 1] -= ds;
sum += de;
return sum + solve(as + 1, ae - 1);
}
int main() {
cin >> N;
A.resize(N + 1);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
B.resize(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
cout << solve(0, N);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A;
vector<int> B;
long solve(int as, int ae) {
if (as >= ae)
return 0;
long sum = 0;
int ds = min(A[as], B[as]);
A[as] -= ds;
B[as] -= ds;
sum += ds;
int de = min(A[ae], B[ae - 1]);
A[ae] -= de;
B[ae - 1] -= de;
sum += de;
ds = min(A[as + 1], B[as]);
A[as + 1] -= ds;
B[as] -= ds;
sum += ds;
de = min(A[ae - 1], B[ae - 1]);
A[ae - 1] -= de;
B[ae - 1] -= de;
sum += de;
return sum + solve(as + 1, ae - 1);
}
int main() {
cin >> N;
A.resize(N + 1);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
B.resize(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
cout << solve(0, N);
return 0;
} | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change"
] | 768,975 | 768,974 | u269291896 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> town;
vector<int> hunter;
for (int i = 0; i < n + 1; i++) {
int num;
cin >> num;
town.push_back(num);
}
for (int i = 0; i < n; i++) {
int num;
cin >> num;
hunter.push_back(num);
}
int previousTown = 0;
int count = 0;
for (int i = 0; i < n; i++) {
if (previousTown > town[i]) {
count += town[i];
town[i] = 0;
} else {
count += previousTown;
town[i] = town[i] - previousTown;
}
if (town[i] >= hunter[i]) {
count += hunter[i];
previousTown = 0;
} else {
count += town[i];
previousTown = hunter[i] - town[i];
}
}
if (town[n] > previousTown) {
count += previousTown;
} else {
count += town[n];
}
cout << count << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> town;
vector<int> hunter;
for (int i = 0; i < n + 1; i++) {
int num;
cin >> num;
town.push_back(num);
}
for (int i = 0; i < n; i++) {
int num;
cin >> num;
hunter.push_back(num);
}
int previousTown = 0;
long long count = 0;
for (int i = 0; i < n; i++) {
if (previousTown > town[i]) {
count += town[i];
town[i] = 0;
} else {
count += previousTown;
town[i] = town[i] - previousTown;
}
if (town[i] >= hunter[i]) {
count += hunter[i];
previousTown = 0;
} else {
count += town[i];
previousTown = hunter[i] - town[i];
}
}
if (town[n] > previousTown) {
count += previousTown;
} else {
count += town[n];
}
cout << count << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,981 | 768,982 | u509420256 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100000], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
cnt = cnt + b[i];
if (a[i] <= b[i]) {
b[i] = b[i] - a[i];
a[i + 1] = a[i + 1] + b[i];
}
}
}
printf("%lld\n", cnt);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100005], b[100005];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
cnt = cnt + b[i];
if (a[i] <= b[i]) {
b[i] = b[i] - a[i];
a[i + 1] = a[i + 1] - b[i];
}
}
}
printf("%lld\n", cnt);
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 768,985 | 768,984 | u744950774 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100000], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
cnt = cnt + b[i];
if (a[i] <= b[i]) {
b[i] = b[i] - a[i];
a[i + 1] = a[i + 1] + b[i];
}
}
}
printf("%d\n", cnt);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100005], b[100005];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
cnt = cnt + b[i];
if (a[i] <= b[i]) {
b[i] = b[i] - a[i];
a[i + 1] = a[i + 1] - b[i];
}
}
}
printf("%lld\n", cnt);
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,986 | 768,984 | u744950774 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100000], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
cnt = cnt + b[i];
if (a[i] <= b[i]) {
b[i] = b[i] - a[i];
a[i + 1] = a[i + 1] + b[i];
}
}
}
printf("%lld\n", cnt);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long a[100005], b[100005];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
cnt = cnt + b[i];
if (a[i] <= b[i]) {
b[i] = b[i] - a[i];
a[i + 1] = a[i + 1] - b[i];
}
}
}
printf("%lld\n", cnt);
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 768,985 | 768,987 | u744950774 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int ar[1000];
int br[1000];
int main() {
ll n, ans = 0, res = 0, i;
cin >> n;
for (i = 0; i <= n; i++)
cin >> ar[i];
for (i = 0; i < n; i++)
cin >> br[i];
for (i = 0; i < n; i++) {
if (ar[i] >= br[i])
ans = ans + br[i];
else {
ans = ans + ar[i];
res = br[i] - ar[i];
if (res <= ar[i + 1]) {
ar[i + 1] = ar[i + 1] - res;
ans = ans + res;
} else {
ans = ans + ar[i + 1];
ar[i + 1] = 0;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int ar[1000008];
int br[1000008];
int main() {
ll n, ans = 0, res = 0, i;
cin >> n;
for (i = 0; i <= n; i++)
cin >> ar[i];
for (i = 0; i < n; i++)
cin >> br[i];
for (i = 0; i < n; i++) {
if (ar[i] >= br[i])
ans = ans + br[i];
else {
ans = ans + ar[i];
res = br[i] - ar[i];
if (res <= ar[i + 1]) {
ar[i + 1] = ar[i + 1] - res;
ans = ans + res;
} else {
ans = ans + ar[i + 1];
ar[i + 1] = 0;
}
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,994 | 768,995 | u279604464 | 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.at(i);
}
for (int j = 0; j < N; j++) {
cin >> B.at(j);
}
int ans = 0;
for (int k = 0; k < N; k++) {
ans += min(A.at(k), B.at(k));
if (A.at(k) < B.at(k)) {
ans += min((B.at(k) - A.at(k)), A.at(k + 1));
if (A.at(k + 1) > (B.at(k) - A.at(k))) {
A.at(k + 1) -= B.at(k) - A.at(k);
} else {
A.at(k + 1) = 0;
}
}
}
cout << ans << endl;
} | #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.at(i);
}
for (int j = 0; j < N; j++) {
cin >> B.at(j);
}
long long int ans = 0;
for (int k = 0; k < N; k++) {
ans += min(A.at(k), B.at(k));
if (A.at(k) < B.at(k)) {
ans += min((B.at(k) - A.at(k)), A.at(k + 1));
if (A.at(k + 1) > (B.at(k) - A.at(k))) {
A.at(k + 1) -= B.at(k) - A.at(k);
} else {
A.at(k + 1) = 0;
}
}
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change"
] | 769,000 | 769,001 | u521975232 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
vector<long long> A(N + 1);
for (long i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (long k = 0; k < N; k++) {
cin >> B.at(k);
}
B.emplace_back(0);
long long next = 0;
long long count = 0;
for (long j = 0; j < N + 1; j++) {
if (B[j] + next > A[j]) {
count = count + A[j];
if (A[j] < next) {
next = B[j];
} else {
next = B[j] - A[j] + next;
}
} else {
count = count + B[j] + next;
}
}
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
vector<long long> A(N + 1);
for (long i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (long k = 0; k < N; k++) {
cin >> B.at(k);
}
B.emplace_back(0);
long long next = 0;
long long count = 0;
for (long j = 0; j < N + 1; j++) {
if (B[j] + next > A[j]) {
count = count + A[j];
if (A[j] < next) {
next = B[j];
} else {
next = B[j] - A[j] + next;
}
} else {
count = count + B[j] + next;
next = 0;
}
}
cout << count;
}
| [
"assignment.add"
] | 769,002 | 769,003 | u834239089 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, i;
long long m = 0;
cin >> N;
long long a[N + 1];
long long b[N];
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 (b[i] <= a[i])
m += b[i];
else if (b[i] >= a[i] + a[i + 1]) {
m += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] = a[i + 1] + b[i] - a[i];
m += b[i];
}
}
cout << m << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, i;
long long m = 0;
cin >> N;
long long a[N + 1];
long long b[N];
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 (b[i] <= a[i])
m += b[i];
else if (b[i] >= a[i] + a[i + 1]) {
m += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] = a[i + 1] - b[i] + a[i];
m += b[i];
}
}
cout << m << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 769,004 | 769,005 | u573540112 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 2, 0);
vector<int> b(N + 1, 0);
for (int i = 1; i < N + 2; i++) {
cin >> a.at(i);
}
for (int i = 1; i < N + 1; i++) {
cin >> b.at(i);
}
vector<int> c(N + 2, 0);
for (int i = 1; i < N + 1; i++) {
if (b.at(i) - a.at(i) >= 0) {
c.at(i) += a.at(i);
if (a.at(i + 1) - b.at(i) + a.at(i) >= 0) {
a.at(i + 1) -= (b.at(i) - a.at(i));
c.at(i + 1) += b.at(i) - a.at(i);
} else {
c.at(i + 1) += a.at(i + 1);
a.at(i + 1) = 0;
}
} else {
c.at(i) += b.at(i);
}
}
int sum = 0;
for (int i = 0; i < N + 2; i++) {
sum += c.at(i);
}
cout << sum;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 2, 0);
vector<int> b(N + 1, 0);
for (int i = 1; i < N + 2; i++) {
cin >> a.at(i);
}
for (int i = 1; i < N + 1; i++) {
cin >> b.at(i);
}
vector<long long int> c(N + 2, 0);
for (int i = 1; i < N + 1; i++) {
if (b.at(i) - a.at(i) >= 0) {
c.at(i) += a.at(i);
if (a.at(i + 1) - b.at(i) + a.at(i) >= 0) {
a.at(i + 1) -= (b.at(i) - a.at(i));
c.at(i + 1) += b.at(i) - a.at(i);
} else {
c.at(i + 1) += a.at(i + 1);
a.at(i + 1) = 0;
}
} else {
c.at(i) += b.at(i);
}
}
long long int sum = 0;
for (int i = 0; i < N + 2; i++) {
sum += c.at(i);
}
cout << sum;
}
| [
"variable_declaration.type.widen.change"
] | 769,008 | 769,009 | u628597699 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repfr(i, x, n) for (int i = (int)(x)-1; i >= (int)(n); i--)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> inline void in(T &a) { cin >> a; }
template <class T, class U> inline void in(T &a, U &b) { cin >> a >> b; }
template <class T, class U, class V> inline void in(T &a, U &b, V &c) {
cin >> a >> b >> c;
}
template <class T> inline void out(T a) { std::cout << a << endl; }
template <class T, class U> inline void out(T a, U b) {
cout << a << ' ' << b << endl;
}
template <class T, class U, class V> inline void out(T a, U b, V c) {
cout << a << ' ' << b << ' ' << c << endl;
}
#define inf 1e9
using ll = int64_t;
void Main() {
int n;
in(n);
std::vector<ll> a(n + 1), b(n);
for (auto &x : a) {
in(x);
}
for (auto &x : b) {
in(x);
}
int count = 0;
rep(i, n) {
if (a[i] - b[i] < 0) {
count += a[i] + (a[i + 1] - (b[i] - a[i]) > 0 ? (b[i] - a[i]) : a[i + 1]);
a[i + 1] = a[i + 1] - (b[i] - a[i]) > 0 ? a[i + 1] - (b[i] - a[i]) : 0;
} else {
count += b[i];
}
}
out(count);
return;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repfr(i, x, n) for (int i = (int)(x)-1; i >= (int)(n); i--)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> inline void in(T &a) { cin >> a; }
template <class T, class U> inline void in(T &a, U &b) { cin >> a >> b; }
template <class T, class U, class V> inline void in(T &a, U &b, V &c) {
cin >> a >> b >> c;
}
template <class T> inline void out(T a) { std::cout << a << endl; }
template <class T, class U> inline void out(T a, U b) {
cout << a << ' ' << b << endl;
}
template <class T, class U, class V> inline void out(T a, U b, V c) {
cout << a << ' ' << b << ' ' << c << endl;
}
#define inf 1e9
using ll = int64_t;
void Main() {
int n;
in(n);
std::vector<ll> a(n + 1), b(n);
for (auto &x : a) {
in(x);
}
for (auto &x : b) {
in(x);
}
ll count = 0;
rep(i, n) {
if (a[i] - b[i] < 0) {
count += a[i] + (a[i + 1] - (b[i] - a[i]) > 0 ? (b[i] - a[i]) : a[i + 1]);
a[i + 1] = a[i + 1] - (b[i] - a[i]) > 0 ? a[i + 1] - (b[i] - a[i]) : 0;
} else {
count += b[i];
}
}
// repr(i, n) {
// if (a[i + 1] > b[i]) {
// count += a[i + 1] - b[i];
// } else {
// count += a[i + 1] + (b[i] - a[i + 1] < a[i] ? b[i] - a[i + 1] : a[i]);
// a[i] -= b[i] - a[i + 1] < a[i] ? b[i] - a[i + 1] : a[i];
// }
// }
//
// rep(i, n) {
// int tmp = (a[i] + a[i + 1]) - b[i];
// if (tmp < 0) {
// tmp = a[i] + a[i + 1];
// a[i + 1] = 0;
// } else {
// tmp = b[i];
// }
// count += tmp;
// }
out(count);
return;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| [
"variable_declaration.type.change"
] | 769,012 | 769,013 | u395846213 | cpp |
p02959 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
long num = 0;
int rem_ai = 0;
int rem_b = 0;
for (int i = 0; i < n; ++i) {
if (rem_b <= a[i]) {
num += rem_b;
rem_ai = a[i] - rem_b;
rem_b = 0;
} else {
num += a[i];
rem_ai = 0;
rem_b = 0;
}
if (b[i] <= rem_ai) {
num += b[i];
rem_ai = 0;
rem_b = 0;
} else {
num += rem_ai;
rem_b = b[i] - rem_ai;
rem_ai = 0;
}
// printf("num %d\n", num);
// printf("rem_b %d\n", rem_b);
}
if (rem_b <= a[n]) {
num += rem_b;
} else {
num += a[n];
}
printf("%d\n", num);
return 0;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
long num = 0;
int rem_ai = 0;
int rem_b = 0;
for (int i = 0; i < n; ++i) {
if (rem_b <= a[i]) {
num += rem_b;
rem_ai = a[i] - rem_b;
rem_b = 0;
} else {
num += a[i];
rem_ai = 0;
rem_b = 0;
}
if (b[i] <= rem_ai) {
num += b[i];
rem_ai = 0;
rem_b = 0;
} else {
num += rem_ai;
rem_b = b[i] - rem_ai;
rem_ai = 0;
}
// printf("num %d\n", num);
// printf("rem_b %d\n", rem_b);
}
if (rem_b <= a[n]) {
num += rem_b;
} else {
num += a[n];
}
printf("%ld\n", num);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,016 | 769,017 | u524328258 | cpp |
p02959 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int num = 0;
int rem_ai = 0;
int rem_b = 0;
for (int i = 0; i < n; ++i) {
if (rem_b <= a[i]) {
num += rem_b;
rem_ai = a[i] - rem_b;
rem_b = 0;
} else {
num += a[i];
rem_ai = 0;
rem_b = 0;
}
if (b[i] <= rem_ai) {
num += b[i];
rem_ai = 0;
rem_b = 0;
} else {
num += rem_ai;
rem_b = b[i] - rem_ai;
rem_ai = 0;
}
// printf("num %d\n", num);
// printf("rem_b %d\n", rem_b);
}
if (rem_b <= a[n]) {
num += rem_b;
} else {
num += a[n];
}
printf("%d\n", num);
return 0;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
long num = 0;
int rem_ai = 0;
int rem_b = 0;
for (int i = 0; i < n; ++i) {
if (rem_b <= a[i]) {
num += rem_b;
rem_ai = a[i] - rem_b;
rem_b = 0;
} else {
num += a[i];
rem_ai = 0;
rem_b = 0;
}
if (b[i] <= rem_ai) {
num += b[i];
rem_ai = 0;
rem_b = 0;
} else {
num += rem_ai;
rem_b = b[i] - rem_ai;
rem_ai = 0;
}
// printf("num %d\n", num);
// printf("rem_b %d\n", rem_b);
}
if (rem_b <= a[n]) {
num += rem_b;
} else {
num += a[n];
}
printf("%ld\n", num);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,018 | 769,017 | u524328258 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int m, n, cnt = 0, rem;
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];
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
cnt += a[i];
rem = b[i] - a[i];
if (rem > a[i + 1]) {
cnt += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= rem;
cnt += rem;
}
} else {
cnt += b[i];
}
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int m, n, cnt = 0, rem;
cin >> n;
long long 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];
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
cnt += a[i];
rem = b[i] - a[i];
if (rem > a[i + 1]) {
cnt += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= rem;
cnt += rem;
}
} else {
cnt += b[i];
}
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 769,019 | 769,020 | u075389978 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(100005);
vector<int> B(100005);
for (int i = 1; i <= n + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= n; i++) {
cin >> B[i];
}
int cnt = 0;
for (int i = n; i >= 1; i--) {
// B[i]がA[i+1]以上
if (B[i] >= A[i + 1]) {
cnt += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] -= A[i + 1];
// B[i] - A[i+1]が A[i]以上
if (B[i] >= A[i]) {
cnt += A[i];
B[i] -= A[i];
A[i] -= A[i];
}
// B[i] - A[i+1]が A[i]より小さい
else {
cnt += B[i];
A[i] -= B[i];
B[i] -= B[i];
}
}
// B[i]がA[i+1]より小さい
else {
cnt += B[i];
A[i + 1] -= B[i];
B[i] -= B[i];
}
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(100005);
vector<long long> B(100005);
for (int i = 1; i <= n + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= n; i++) {
cin >> B[i];
}
long long cnt = 0;
for (int i = n; i >= 1; i--) {
// B[i]がA[i+1]以上
if (B[i] >= A[i + 1]) {
cnt += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] -= A[i + 1];
// B[i] - A[i+1]が A[i]以上
if (B[i] >= A[i]) {
cnt += A[i];
B[i] -= A[i];
A[i] -= A[i];
}
// B[i] - A[i+1]が A[i]より小さい
else {
cnt += B[i];
A[i] -= B[i];
B[i] -= B[i];
}
}
// B[i]がA[i+1]より小さい
else {
cnt += B[i];
A[i + 1] -= B[i];
B[i] -= B[i];
}
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,032 | 769,033 | u399232305 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int mini(int a, int b) {
if (a <= b)
return a;
else
return b;
}
int main() {
int i, j, n, x, total_hero = 0, total_mons = 0, final_hero = 0, choto = 0;
cin >> n;
vector<int> mons;
vector<int> hero;
for (i = 0; i < n + 1; i++) {
cin >> x;
mons.push_back(x);
total_mons = total_mons + x;
}
for (i = 0; i < n; i++) {
cin >> x;
hero.push_back(x);
total_hero += x;
}
for (i = 0; i < n; i++) {
choto = mini(hero[i], mons[i]);
hero[i] = hero[i] - choto;
mons[i] = mons[i] - choto;
choto = mini(hero[i], mons[i + 1]);
hero[i] = hero[i] - choto;
mons[i + 1] = mons[i + 1] - choto;
}
for (i = 0; i < n; i++) {
final_hero += hero[i];
}
cout << total_hero - final_hero;
}
| #include <bits/stdc++.h>
using namespace std;
long long mini(int a, int b) {
if (a <= b)
return a;
else
return b;
}
int main() {
long long i, j, n, x, total_hero = 0, total_mons = 0, final_hero = 0,
choto = 0;
cin >> n;
vector<int> mons;
vector<int> hero;
for (i = 0; i < n + 1; i++) {
cin >> x;
mons.push_back(x);
total_mons = total_mons + x;
}
for (i = 0; i < n; i++) {
cin >> x;
hero.push_back(x);
total_hero += x;
}
for (i = 0; i < n; i++) {
choto = mini(hero[i], mons[i]);
hero[i] = hero[i] - choto;
mons[i] = mons[i] - choto;
choto = mini(hero[i], mons[i + 1]);
hero[i] = hero[i] - choto;
mons[i + 1] = mons[i + 1] - choto;
}
for (i = 0; i < n; i++) {
final_hero += hero[i];
}
cout << total_hero - final_hero;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,034 | 769,035 | u615084357 | cpp |
p02959 | #include <stdio.h>
int n;
int a[100010];
int b[100010];
int l;
int r;
int count;
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
count += a[i];
b[i] -= a[i];
a[i] = 0;
}
else {
count += b[i];
b[i] = 0;
}
if (b[i] != 0) {
if (b[i] <= a[i + 1]) {
a[i + 1] -= b[i];
count += b[i];
}
else {
count += a[i + 1];
a[i + 1] = 0;
}
}
}
printf("%d", count);
return 0;
} | #include <stdio.h>
int n;
int a[100010];
int b[100010];
int l;
int r;
long long count;
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
count += a[i];
b[i] -= a[i];
a[i] = 0;
}
else {
count += b[i];
b[i] = 0;
}
if (b[i] != 0) {
if (b[i] <= a[i + 1]) {
a[i + 1] -= b[i];
count += b[i];
}
else {
count += a[i + 1];
a[i + 1] = 0;
}
}
}
printf("%lld", count);
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,036 | 769,037 | u422066699 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
long long N;
long long A[100001];
long long B[100000];
cin >> N;
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long long x = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
x += A[i];
B[i] -= A[i];
} else {
x += B[i];
B[0] = 0;
}
if (A[i + 1] < B[i]) {
x += A[i + 1];
A[i + 1] = 0;
} else {
x += B[i];
A[i + 1] -= B[i];
}
}
cout << x << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long N;
long long A[100001];
long long B[100000];
cin >> N;
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long long x = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
x += A[i];
B[i] -= A[i];
} else {
x += B[i];
B[i] = 0;
}
if (A[i + 1] < B[i]) {
x += A[i + 1];
A[i + 1] = 0;
} else {
x += B[i];
A[i + 1] -= B[i];
}
}
cout << x << endl;
return 0;
}
| [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 769,040 | 769,041 | u721980697 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, count;
cin >> n;
count = 0;
int a[100100];
int b[100100];
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]) {
count += b[i];
} else {
if (b[i] - a[i] >= a[i + 1]) {
count = count + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] = a[i + 1] - b[i] + a[i];
}
}
}
cout << count << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
long long int count;
cin >> n;
count = 0;
int a[100100];
int b[100100];
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]) {
count += b[i];
} else {
if (b[i] - a[i] >= a[i + 1]) {
count = count + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] = a[i + 1] - b[i] + a[i];
}
}
}
cout << count << endl;
}
| [
"variable_declaration.type.widen.change"
] | 769,046 | 769,045 | u817464145 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long a[200000 + 5];
long long b[200000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
cin >> a[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
if (b[i] < a[i]) {
if ((b[i] + b[i + 1]) >= a[i]) {
sum = sum + a[i];
b[i + 1] = b[i + 1] - a[i] - b[i];
} else {
sum = sum + b[i] + b[i + 1];
b[i + 1] = 0;
}
} else {
sum = sum + a[i];
}
}
cout << sum;
}
| #include <bits/stdc++.h>
using namespace std;
long long a[200000 + 5];
long long b[200000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
cin >> a[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
if (b[i] < a[i]) {
if ((b[i] + b[i + 1]) > a[i]) {
sum = sum + a[i];
b[i + 1] = b[i + 1] - (a[i] - b[i]);
} else {
sum = sum + b[i] + b[i + 1];
b[i + 1] = 0;
}
} else {
sum = sum + a[i];
}
}
cout << sum;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 769,047 | 769,048 | u191117799 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long a[20000 + 5];
long long b[20000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
cin >> a[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
if (b[i] < a[i]) {
if ((b[i] + b[i + 1]) >= a[i]) {
sum = sum + a[i];
b[i + 1] = b[i + 1] - a[i] - b[i];
} else {
sum = sum + b[i] + b[i + 1];
b[i + 1] = 0;
}
} else {
sum = sum + a[i];
}
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
long long a[200000 + 5];
long long b[200000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
cin >> a[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
if (b[i] < a[i]) {
if ((b[i] + b[i + 1]) > a[i]) {
sum = sum + a[i];
b[i + 1] = b[i + 1] - (a[i] - b[i]);
} else {
sum = sum + b[i] + b[i + 1];
b[i + 1] = 0;
}
} else {
sum = sum + a[i];
}
}
cout << sum;
}
| [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 769,050 | 769,048 | u191117799 | cpp |
p02959 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[10005], b[10005], sum;
signed main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 1; i <= n; i++) {
if (b[i] < a[i]) {
a[i] -= b[i], sum += b[i];
continue;
}
if (b[i] >= a[i])
b[i] -= a[i], sum += a[i], a[i] = 0;
if (b[i] >= a[i + 1])
sum += a[i + 1], a[i + 1] = 0;
else
sum += b[i], a[i + 1] -= b[i];
}
cout << sum;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[100005], b[100005], sum;
signed main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 1; i <= n; i++) {
if (b[i] < a[i]) {
a[i] -= b[i], sum += b[i];
continue;
}
if (b[i] >= a[i])
b[i] -= a[i], sum += a[i], a[i] = 0;
if (b[i] >= a[i + 1])
sum += a[i + 1], a[i + 1] = 0;
else
sum += b[i], a[i + 1] -= b[i];
}
cout << sum;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 769,057 | 769,058 | u924638591 | cpp |
p02959 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author edamat
*/
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _repr(i, n) repri(i, n, 0)
/* loop in [n,m] step -1 */
#define repri(i, a, b) for (int i = int(a), i##_len = (b); i >= i##_len; --i)
/* loop in [n,0] step -1 or [n,m] step -1 */
#define repr(...) _overload3(__VA_ARGS__, repri, _repr, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define pb push_back
#define eb emplace_back
#define endl '\n'
typedef long long lint;
// #define int lint
const int INF = (int)(1 << 30) - 1;
int MOD = (int)1e9 + 7;
// const double EPS = 1e-9;
const lint LINF = (lint)(1LL << 62) - 1;
typedef vector<int> vint;
typedef pair<int, int> pint;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);
// cerr << fixed << setprecision(20);
}
} iosetup;
using std::to_string;
auto to_string(std::string s) -> std::string { return '"' + s + '"'; }
auto to_string(char c) -> std::string { return "'" + std::string{c} + "'"; }
auto to_string(const char *s) -> std::string {
return to_string((std::string)s);
}
auto to_string(bool b) -> std::string { return (b ? "true" : "false"); }
template <typename T, typename U>
auto to_string(std::pair<T, U> p) -> std::string {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <size_t N> auto to_string(std::bitset<N> bs) -> std::string {
std::string res{};
for (size_t i = 0; i < N; i++)
res.insert(res.begin(), bs.test(i) ? '1' : '0');
return res;
}
template <typename T> auto to_string(T v) -> std::string {
bool flg = false;
std::string res = "[";
for (auto const &x : v) {
if (flg)
res += ", ";
else
flg = true;
res += to_string(x);
}
res += "]";
return res;
}
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define SZ(x) ((int)(x).size())
/* range macro. usage: for(int i:range(n)) */
class range {
private:
struct I {
int x;
int operator*() { return x; }
bool operator!=(I &lhs) { return x < lhs.x; }
void operator++() { ++x; }
};
I i, n;
public:
range(int n) : i({0}), n({n}) {}
range(int i, int n) : i({i}), n({n}) {}
I &begin() { return i; }
I &end() { return n; }
};
/* keep a max,min */
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* input,output operator for pair and vector */
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? ", " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
for (auto x = mp.begin(); x != mp.end(); ++x) {
os << x->first << ": " << x->second << (x != prev(mp.end()) ? "\n" : "");
}
return os;
}
/* initialize vector. usage: auto v = male_v<int>(N,0); */
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
/* fill vector. usage: fill_v(v,0); */
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
/* sum */
template <typename T> T sum(vector<T> &v) {
T ret = 0;
for (T x : v) {
ret += x;
}
return ret;
}
template <typename T> auto sum(const T &a) { return a; }
template <typename T, typename... A>
auto sum(const T &first, const A &...rest) {
return sum(first) + sum(rest...);
}
/* mod */
lint intpow(lint a, lint n, lint mod) {
lint res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
template <typename T> T intpow(T a, lint n) {
T res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
/* print */
template <typename T> void print(const T &first) { cout << first << endl; }
template <typename T, typename... A>
void print(const T &first, const A &...rest) {
cout << first << " ";
print(rest...);
}
template <typename... A> void print(const A &...rest) { print(rest...); }
struct RandomNumberGenerator {
mt19937 mt;
RandomNumberGenerator()
: mt(chrono::steady_clock::now().time_since_epoch().count()) {}
int operator()(int a, int b) { // [a, b)
uniform_int_distribution<int> dist(a, b - 1);
return dist(mt);
}
int operator()(int b) { // [0, b)
return (*this)(0, b);
}
};
class CCitySavers {
public:
static constexpr int kStressIterations = 0;
static void generateTest(int cnt, std::ostream &test) {
RandomNumberGenerator rng;
}
void solve(std::istream &cin, std::ostream &cout) {
int N;
cin >> N;
vint A(N + 1), B(N);
cin >> A;
cin >> B;
lint ans = sum(A);
rep(i, N) {
if (A[i] < B[i]) {
B[i] -= A[i];
A[i] = 0;
A[i + 1] -= min(A[i + 1], B[i]);
} else {
A[i] -= B[i];
}
}
cout << ans - sum(A) << endl;
}
};
signed main() {
CCitySavers solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author edamat
*/
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _repr(i, n) repri(i, n, 0)
/* loop in [n,m] step -1 */
#define repri(i, a, b) for (int i = int(a), i##_len = (b); i >= i##_len; --i)
/* loop in [n,0] step -1 or [n,m] step -1 */
#define repr(...) _overload3(__VA_ARGS__, repri, _repr, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define pb push_back
#define eb emplace_back
#define endl '\n'
typedef long long lint;
#define int lint
const int INF = (int)(1 << 30) - 1;
int MOD = (int)1e9 + 7;
// const double EPS = 1e-9;
const lint LINF = (lint)(1LL << 62) - 1;
typedef vector<int> vint;
typedef pair<int, int> pint;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);
// cerr << fixed << setprecision(20);
}
} iosetup;
using std::to_string;
auto to_string(std::string s) -> std::string { return '"' + s + '"'; }
auto to_string(char c) -> std::string { return "'" + std::string{c} + "'"; }
auto to_string(const char *s) -> std::string {
return to_string((std::string)s);
}
auto to_string(bool b) -> std::string { return (b ? "true" : "false"); }
template <typename T, typename U>
auto to_string(std::pair<T, U> p) -> std::string {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <size_t N> auto to_string(std::bitset<N> bs) -> std::string {
std::string res{};
for (size_t i = 0; i < N; i++)
res.insert(res.begin(), bs.test(i) ? '1' : '0');
return res;
}
template <typename T> auto to_string(T v) -> std::string {
bool flg = false;
std::string res = "[";
for (auto const &x : v) {
if (flg)
res += ", ";
else
flg = true;
res += to_string(x);
}
res += "]";
return res;
}
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define SZ(x) ((int)(x).size())
/* range macro. usage: for(int i:range(n)) */
class range {
private:
struct I {
int x;
int operator*() { return x; }
bool operator!=(I &lhs) { return x < lhs.x; }
void operator++() { ++x; }
};
I i, n;
public:
range(int n) : i({0}), n({n}) {}
range(int i, int n) : i({i}), n({n}) {}
I &begin() { return i; }
I &end() { return n; }
};
/* keep a max,min */
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* input,output operator for pair and vector */
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? ", " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
for (auto x = mp.begin(); x != mp.end(); ++x) {
os << x->first << ": " << x->second << (x != prev(mp.end()) ? "\n" : "");
}
return os;
}
/* initialize vector. usage: auto v = male_v<int>(N,0); */
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
/* fill vector. usage: fill_v(v,0); */
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
/* sum */
template <typename T> T sum(vector<T> &v) {
T ret = 0;
for (T x : v) {
ret += x;
}
return ret;
}
template <typename T> auto sum(const T &a) { return a; }
template <typename T, typename... A>
auto sum(const T &first, const A &...rest) {
return sum(first) + sum(rest...);
}
/* mod */
lint intpow(lint a, lint n, lint mod) {
lint res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
template <typename T> T intpow(T a, lint n) {
T res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
/* print */
template <typename T> void print(const T &first) { cout << first << endl; }
template <typename T, typename... A>
void print(const T &first, const A &...rest) {
cout << first << " ";
print(rest...);
}
template <typename... A> void print(const A &...rest) { print(rest...); }
struct RandomNumberGenerator {
mt19937 mt;
RandomNumberGenerator()
: mt(chrono::steady_clock::now().time_since_epoch().count()) {}
int operator()(int a, int b) { // [a, b)
uniform_int_distribution<int> dist(a, b - 1);
return dist(mt);
}
int operator()(int b) { // [0, b)
return (*this)(0, b);
}
};
class CCitySavers {
public:
static constexpr int kStressIterations = 0;
static void generateTest(int cnt, std::ostream &test) {
RandomNumberGenerator rng;
}
void solve(std::istream &cin, std::ostream &cout) {
int N;
cin >> N;
vint A(N + 1), B(N);
cin >> A;
cin >> B;
lint ans = sum(A);
rep(i, N) {
if (A[i] < B[i]) {
B[i] -= A[i];
A[i] = 0;
A[i + 1] -= min(A[i + 1], B[i]);
} else {
A[i] -= B[i];
}
}
cout << ans - sum(A) << endl;
}
};
signed main() {
CCitySavers solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| [] | 769,065 | 769,066 | u379629675 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<double> monster;
vector<double> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
double mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
double kill;
cin >> kill;
hero_ab.push_back(kill);
}
hero_ab.push_back(0);
double count = 0;
double prev = 0;
for (int i = 0; i < n + 1; i++) {
if (monster.at(i) <= hero_ab.at(i) + prev) {
count += monster.at(i);
if (monster.at(i) <= prev) {
prev = hero_ab.at(i);
} else {
if ((monster.at(i) - prev) < hero_ab.at(i)) {
prev = hero_ab.at(i) - (monster.at(i) - prev);
} else {
prev = 0;
}
}
} else {
count += hero_ab.at(i) + prev;
prev = 0;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<long> monster;
vector<long> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
long mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
long kill;
cin >> kill;
hero_ab.push_back(kill);
}
hero_ab.push_back(0);
long count = 0;
long prev = 0;
for (int i = 0; i < n + 1; i++) {
if (monster.at(i) <= hero_ab.at(i) + prev) {
count += monster.at(i);
if (monster.at(i) <= prev) {
prev = hero_ab.at(i);
} else {
if ((monster.at(i) - prev) < hero_ab.at(i)) {
prev = hero_ab.at(i) - (monster.at(i) - prev);
} else {
prev = 0;
}
}
} else {
count += hero_ab.at(i) + prev;
prev = 0;
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 769,069 | 769,070 | u818286983 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> monster;
vector<int> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
int mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
int kill;
cin >> kill;
hero_ab.push_back(kill);
}
hero_ab.push_back(0);
double count = 0;
int prev = 0;
for (int i = 0; i < n + 1; i++) {
if (monster.at(i) <= hero_ab.at(i) + prev) {
count += monster.at(i);
if (monster.at(i) <= prev) {
prev = hero_ab.at(i);
} else {
if ((monster.at(i) - prev) < hero_ab.at(i)) {
prev = hero_ab.at(i) - (monster.at(i) - prev);
} else {
prev = 0;
}
}
} else {
count += hero_ab.at(i) + prev;
prev = 0;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<long> monster;
vector<long> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
long mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
long kill;
cin >> kill;
hero_ab.push_back(kill);
}
hero_ab.push_back(0);
long count = 0;
long prev = 0;
for (int i = 0; i < n + 1; i++) {
if (monster.at(i) <= hero_ab.at(i) + prev) {
count += monster.at(i);
if (monster.at(i) <= prev) {
prev = hero_ab.at(i);
} else {
if ((monster.at(i) - prev) < hero_ab.at(i)) {
prev = hero_ab.at(i) - (monster.at(i) - prev);
} else {
prev = 0;
}
}
} else {
count += hero_ab.at(i) + prev;
prev = 0;
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 769,071 | 769,070 | u818286983 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> monster;
vector<int> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
int mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
int kill;
cin >> kill;
hero_ab.push_back(kill);
}
hero_ab.push_back(0);
int count = 0;
int prev = 0;
for (int i = 0; i < n + 1; i++) {
if (monster.at(i) <= hero_ab.at(i) + prev) {
count += monster.at(i);
if (monster.at(i) <= prev) {
prev = hero_ab.at(i);
} else {
if ((monster.at(i) - prev) < hero_ab.at(i)) {
prev = hero_ab.at(i) - (monster.at(i) - prev);
} else {
prev = 0;
}
}
} else {
count += hero_ab.at(i) + prev;
prev = 0;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<long> monster;
vector<long> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
long mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
long kill;
cin >> kill;
hero_ab.push_back(kill);
}
hero_ab.push_back(0);
long count = 0;
long prev = 0;
for (int i = 0; i < n + 1; i++) {
if (monster.at(i) <= hero_ab.at(i) + prev) {
count += monster.at(i);
if (monster.at(i) <= prev) {
prev = hero_ab.at(i);
} else {
if ((monster.at(i) - prev) < hero_ab.at(i)) {
prev = hero_ab.at(i) - (monster.at(i) - prev);
} else {
prev = 0;
}
}
} else {
count += hero_ab.at(i) + prev;
prev = 0;
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 769,072 | 769,070 | u818286983 | cpp |
p02959 | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100005], b[100004];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] < b[i]) {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] < b[i]) {
a[i + 1] -= b[i] - a[i];
cnt += b[i];
} else {
cnt += b[i];
}
}
cout << cnt << endl;
} | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100005], b[100004];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] < b[i]) {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] < b[i]) {
a[i + 1] -= b[i] - a[i];
cnt += b[i];
} else {
cnt += b[i];
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,073 | 769,074 | u828994140 | cpp |
p02959 | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100001], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] < b[i]) {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] < b[i]) {
a[i + 1] -= b[i] - a[i];
cnt += b[i];
} else {
cnt += b[i];
}
}
cout << cnt << endl;
} | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100005], b[100004];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] < b[i]) {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] < b[i]) {
a[i + 1] -= b[i] - a[i];
cnt += b[i];
} else {
cnt += b[i];
}
}
cout << cnt << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,075 | 769,074 | u828994140 | cpp |
p02959 | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n, a[100001], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] < b[i]) {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] < b[i]) {
a[i + 1] -= b[i] - a[i];
cnt += b[i];
} else {
cnt += b[i];
}
}
cout << cnt << endl;
} | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100005], b[100004];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] < b[i]) {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] < b[i]) {
a[i + 1] -= b[i] - a[i];
cnt += b[i];
} else {
cnt += b[i];
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change"
] | 769,076 | 769,074 | u828994140 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long int ll;
const int MAX_N = 100000;
ll foo(ll *a, ll *b) {
ll ret;
if (*a < *b) {
ret += *a;
*b -= *a;
*a = 0;
} else {
ret += *b;
*a -= *b;
*b = 0;
}
return ret;
}
int main() {
int n;
ll a[MAX_N + 1], b[MAX_N];
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
ans += foo(&a[i + 1], &b[i]);
ans += foo(&a[i], &b[i]);
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
typedef long long int ll;
const int MAX_N = 100000;
ll foo(ll *a, ll *b) {
ll ret;
if (*a < *b) {
ret = *a;
*b -= *a;
*a = 0;
} else {
ret = *b;
*a -= *b;
*b = 0;
}
return ret;
}
int main() {
int n;
ll a[MAX_N + 1], b[MAX_N];
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
ans += foo(&a[i + 1], &b[i]);
ans += foo(&a[i], &b[i]);
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change"
] | 769,077 | 769,078 | u280590671 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
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 count = 0;
int rest = 0;
REP(i, n) {
rest = 0;
if (a[i] - b[i] < 0) {
rest = b[i] - a[i];
if (a[i + 1] - rest < 0) {
count += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] -= rest;
}
} else {
count += b[i];
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
REP(i, n + 1) { cin >> a[i]; }
REP(i, n) { cin >> b[i]; }
ll count = 0;
ll rest = 0;
REP(i, n) {
rest = 0;
if (a[i] - b[i] < 0) {
rest = b[i] - a[i];
if (a[i + 1] - rest < 0) {
count += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] -= rest;
}
} else {
count += b[i];
}
}
cout << count << endl;
}
| [
"variable_declaration.type.change"
] | 769,079 | 769,080 | u110681742 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
int main() {
rkc;
ll n, ans = 0, p = 0, q = 0;
cin >> n;
ll a[n + 1], b[n];
fl(i, 0, n + 1) cin >> a[i];
fl(i, 0, n) cin >> b[i];
/*for(ll i=0,j=0;i<n+1,j<n+1;)
{
if(a[i]==b[j])
{
a[i]=0;
b[j]=0;
ans+=a[i];
i++;j++;
}
else if(a[i]>b[j])
{
a[i]=a[i]-b[j];
//b[i]=0;
ans+=b[j];if(a[i]!=0&&i!=n){i++;j++;}else if(j!=n-1) j++;else break;
//if(i>j&&j!=n-1)j++;
//else{
//i++;j++;}
}
else
{
ans+=a[i];
a[i]=0;
b[j]=b[j]-a[i];
i++;
}
}
cout<<ans;*/
/*for(ll i=0,j=0;i<n+1,j<n;)
{
if(a[i]>b[j]){if(i>n||j>n-1)break;else {ans+=b[j];i++;j++;}}
else if(a[i]<b[j])
{
if(i>n||j>n-1)break; else {
ans+=a[i];
b[j]-=a[i];
if(abs(i-j)<2)i++;
else {i++;j++;}
}
}
else
{
if(i>n||j>n-1)break;
else{
ans+=a[i];i++;j++;
}}
//cout<<ans<<endl;
}
cout<<ans;*/
for (ll i = 0, j = 0; i < n + 1, j < n;) {
if (a[i] > b[j]) {
ans += b[i];
i++;
j++;
} else if (a[i] < b[j]) {
ans += a[i];
b[j] -= a[i];
p = a[i + 1];
q = a[i + 1] - b[j];
/// a[i+1]-=b[j];
if (q >= 0) {
a[i + 1] -= b[j];
ans += b[j];
} else {
a[i + 1] = 0;
ans += p;
}
i += 2;
j++;
} else {
ans += a[i];
i++;
j++;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
int main() {
rkc;
ll n, ans = 0, p = 0, q = 0;
cin >> n;
ll a[n + 1], b[n];
fl(i, 0, n + 1) cin >> a[i];
fl(i, 0, n) cin >> b[i];
/*for(ll i=0,j=0;i<n+1,j<n+1;)
{
if(a[i]==b[j])
{
a[i]=0;
b[j]=0;
ans+=a[i];
i++;j++;
}
else if(a[i]>b[j])
{
a[i]=a[i]-b[j];
//b[i]=0;
ans+=b[j];if(a[i]!=0&&i!=n){i++;j++;}else if(j!=n-1) j++;else break;
//if(i>j&&j!=n-1)j++;
//else{
//i++;j++;}
}
else
{
ans+=a[i];
a[i]=0;
b[j]=b[j]-a[i];
i++;
}
}
cout<<ans;*/
/*for(ll i=0,j=0;i<n+1,j<n;)
{
if(a[i]>b[j]){if(i>n||j>n-1)break;else {ans+=b[j];i++;j++;}}
else if(a[i]<b[j])
{
if(i>n||j>n-1)break; else {
ans+=a[i];
b[j]-=a[i];
if(abs(i-j)<2)i++;
else {i++;j++;}
}
}
else
{
if(i>n||j>n-1)break;
else{
ans+=a[i];i++;j++;
}}
//cout<<ans<<endl;
}
cout<<ans;*/
for (ll i = 0, j = 0; i < n + 1, j < n;) {
if (a[i] > b[j]) {
ans += b[i];
i++;
j++;
} else if (a[i] < b[j]) {
ans += a[i];
b[j] -= a[i];
p = a[i + 1];
q = a[i + 1] - b[j];
/// a[i+1]-=b[j];
if (q >= 0) {
a[i + 1] -= b[j];
ans += b[j];
} else {
a[i + 1] = 0;
ans += p;
}
i++;
j++;
} else {
ans += a[i];
i++;
j++;
}
}
cout << ans;
} | [
"expression.operation.binary.change"
] | 769,081 | 769,082 | u364018936 | cpp |
p02959 | #include <iostream>
using namespace std;
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++) {
int add = min(a[i], b[i]);
a[i] -= add;
b[i] -= add;
ans += add;
if (b[i] > 0) {
add = min(a[i + 1], b[i]);
a[i + 1] -= add;
b[i] -= add;
ans += add;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
signed 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];
}
signed long ans = 0;
for (int i = 0; i < n; i++) {
int add = min(a[i], b[i]);
a[i] -= add;
b[i] -= add;
ans += add;
if (b[i] > 0) {
add = min(a[i + 1], b[i]);
a[i + 1] -= add;
b[i] -= add;
ans += add;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 769,089 | 769,090 | u190679129 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define all(a) (a).begin(), (a).end()
int main() {
int n, count = 0;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
if (tmp < a.at(i)) {
count += tmp;
} else {
count += a.at(i);
tmp -= a.at(i);
if (tmp <= a.at(i + 1)) {
a.at(i + 1) -= tmp;
count += tmp;
} else {
count += a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define all(a) (a).begin(), (a).end()
int main() {
long n, count = 0;
cin >> n;
vector<long> a(n + 1);
for (long i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (long i = 0; i < n; i++) {
long tmp;
cin >> tmp;
if (tmp < a.at(i)) {
count += tmp;
} else {
count += a.at(i);
tmp -= a.at(i);
if (tmp <= a.at(i + 1)) {
a.at(i + 1) -= tmp;
count += tmp;
} else {
count += a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << count << endl;
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 769,091 | 769,092 | u864026794 | cpp |
p02959 | #include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
int mLeft = 0;
int ans = 0;
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];
}
mLeft = A[0];
for (int i = 0; i < N; i++) {
if (mLeft + A[i + 1] <= B[i]) {
ans += mLeft + A[i + 1];
mLeft = 0;
} else if (mLeft <= B[i] && mLeft + A[i + 1] > B[i]) {
ans += B[i];
mLeft = mLeft + A[i + 1] - B[i];
} else {
ans += B[i];
mLeft = A[i + 1];
}
}
cout << ans << endl;
return 0;
}
| #include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N;
ll mLeft = 0;
ll ans = 0;
cin >> N;
ll A[N + 1];
ll B[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
mLeft = A[0];
for (int i = 0; i < N; i++) {
if (mLeft + A[i + 1] <= B[i]) {
ans += mLeft + A[i + 1];
mLeft = 0;
} else if (mLeft <= B[i] && mLeft + A[i + 1] > B[i]) {
ans += B[i];
mLeft = mLeft + A[i + 1] - B[i];
} else {
ans += B[i];
mLeft = A[i + 1];
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 769,093 | 769,094 | u332258971 | cpp |
p02959 | #include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
int main() {
int64_t N;
std::cin >> N;
std::cin.ignore();
int nA = N + 1;
std::vector<int64_t> A;
A.reserve(N + 1);
while (nA-- > 0) {
int64_t a;
std::cin >> a;
A.push_back(a);
}
int nB = N;
std::vector<int64_t> B;
B.reserve(N);
while (nB-- > 0) {
int64_t b;
std::cin >> b;
B.push_back(b);
}
int64_t ans = 0;
for (int i = 0; i < N; ++i) {
if (A[i] >= B[i]) {
ans += B[i];
continue;
}
ans += A[i];
B[i] -= A[i];
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] += B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
std::cout << ans << std::flush;
}
| #include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
int main() {
int64_t N;
std::cin >> N;
std::cin.ignore();
int nA = N + 1;
std::vector<int64_t> A;
A.reserve(N + 1);
while (nA-- > 0) {
int64_t a;
std::cin >> a;
A.push_back(a);
}
int nB = N;
std::vector<int64_t> B;
B.reserve(N);
while (nB-- > 0) {
int64_t b;
std::cin >> b;
B.push_back(b);
}
int64_t ans = 0;
for (int i = 0; i < N; ++i) {
if (A[i] >= B[i]) {
ans += B[i];
continue;
}
ans += A[i];
B[i] -= A[i];
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] -= B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
std::cout << ans << std::flush;
} | [
"expression.operator.change"
] | 769,097 | 769,098 | u317230226 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, b, sum = 0, vec;
vector<long long> a;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> vec;
a.push_back(vec);
}
for (int i = 0; i < n; i++) {
cin >> b;
if (b - a[i] < 0) {
sum += b;
b = 0;
} else {
sum += b - (b - a[i]);
b -= a[i];
}
if (b - a[i + 1] < 0) {
sum += b;
a[i + 1] -= b;
} else {
sum += b - (b - a[i + 1]);
a[i + 1] = 0;
}
}
cout << sum << '\n';
return (0);
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, vec;
long long b, sum = 0;
vector<long long> a;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> vec;
a.push_back(vec);
}
for (int i = 0; i < n; i++) {
cin >> b;
if (b - a[i] < 0) {
sum += b;
b = 0;
} else {
sum += b - (b - a[i]);
b -= a[i];
}
if (b - a[i + 1] < 0) {
sum += b;
a[i + 1] -= b;
} else {
sum += b - (b - a[i + 1]);
a[i + 1] = 0;
}
}
cout << sum << '\n';
return (0);
} | [
"variable_declaration.add",
"variable_declaration.remove"
] | 769,103 | 769,104 | u132033278 | cpp |
p02959 | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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 beat = 0;
int x;
for (int i = N - 1; i >= 0; i--) {
x = min(A[i + 1], B[i]);
A[i + 1] -= x;
B[i] -= x;
beat += x;
x = min(A[i], B[i]);
A[i] -= x;
B[i] -= x;
beat += x;
}
cout << beat << endl;
return 0;
}
| //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<ll> 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 beat = 0;
ll x;
for (int i = N - 1; i >= 0; i--) {
x = min(A[i + 1], B[i]);
A[i + 1] -= x;
B[i] -= x;
beat += x;
x = min(A[i], B[i]);
A[i] -= x;
B[i] -= x;
beat += x;
}
cout << beat << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 769,105 | 769,106 | u422769833 | cpp |
p02959 | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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 beat = 0;
for (int i = N - 1; i >= 0; i--) {
int x = min(A[i + 1], B[i]);
A[i + 1] -= x;
B[i] -= x;
beat += x;
x = min(A[i], B[i]);
A[i] -= x;
B[i] -= x;
beat += x;
}
cout << beat << endl;
return 0;
}
| //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<ll> 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 beat = 0;
ll x;
for (int i = N - 1; i >= 0; i--) {
x = min(A[i + 1], B[i]);
A[i + 1] -= x;
B[i] -= x;
beat += x;
x = min(A[i], B[i]);
A[i] -= x;
B[i] -= x;
beat += x;
}
cout << beat << endl;
return 0;
}
| [
"variable_declaration.type.change",
"variable_declaration.add"
] | 769,107 | 769,106 | u422769833 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double D;
typedef complex<D> P;
const ll E = 1e18 + 7;
const ll MOD = 1000000007;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define fill(x, y) memset(x, y, sizeof(x))
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define F first
#define S second
template <class... A> void prints() { cout << endl; }
template <class... A> void prints_rest() { cout << endl; }
template <class T, class... A>
void prints_rest(const T &first, const A &...rest) {
cout << " " << first;
prints_rest(rest...);
}
template <class T, class... A> void prints(const T &first, const A &...rest) {
cout << first;
prints_rest(rest...);
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int in;
vector<int> A, B;
rep(_, N + 1) {
cin >> in;
A.push_back(in);
}
rep(_, N) {
cin >> in;
B.push_back(in);
}
int ans = 0;
rep(i, N) {
ans += min(A[i], B[i]);
if (B[i] > A[i]) {
ans += min(A[i + 1], B[i] - A[i]);
A[i + 1] -= min(A[i + 1], B[i] - A[i]);
}
}
prints(ans);
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double D;
typedef complex<D> P;
const ll E = 1e18 + 7;
const ll MOD = 1000000007;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define fill(x, y) memset(x, y, sizeof(x))
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define F first
#define S second
template <class... A> void prints() { cout << endl; }
template <class... A> void prints_rest() { cout << endl; }
template <class T, class... A>
void prints_rest(const T &first, const A &...rest) {
cout << " " << first;
prints_rest(rest...);
}
template <class T, class... A> void prints(const T &first, const A &...rest) {
cout << first;
prints_rest(rest...);
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int in;
vector<int> A, B;
rep(_, N + 1) {
cin >> in;
A.push_back(in);
}
rep(_, N) {
cin >> in;
B.push_back(in);
}
ll ans = 0;
rep(i, N) {
ans += min(A[i], B[i]);
if (B[i] > A[i]) {
ans += min(A[i + 1], B[i] - A[i]);
A[i + 1] -= min(A[i + 1], B[i] - A[i]);
}
}
prints(ans);
return 0;
}
| [
"variable_declaration.type.change"
] | 769,111 | 769,112 | u598755311 | cpp |
p02959 | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int fpow(int b, int p) {
if (p == 0)
return 1;
int h = fpow(b, p / 2);
if (p % 2)
return h * b % MOD * h % MOD;
return h * h % MOD;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v(n + 1);
for (auto &i : v)
cin >> i;
int t;
int ans = 0;
For(i, 0, n - 1) {
cin >> t;
int a = min(t, v[i]);
v[i] -= a;
t -= a;
ans += a;
a = min(t, v[i + 1]);
v[i] -= a;
t -= a;
ans += a;
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int fpow(int b, int p) {
if (p == 0)
return 1;
int h = fpow(b, p / 2);
if (p % 2)
return h * b % MOD * h % MOD;
return h * h % MOD;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v(n + 1);
for (auto &i : v)
cin >> i;
int t;
int ans = 0;
For(i, 0, n - 1) {
cin >> t;
int a = min(t, v[i]);
v[i] -= a;
t -= a;
ans += a;
a = min(t, v[i + 1]);
v[i + 1] -= a;
t -= a;
ans += a;
}
cout << ans << "\n";
return 0;
}
| [
"assignment.change"
] | 769,115 | 769,116 | u055148700 | cpp |
p02960 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
string Toupper(string s) {
string ans = "";
rep(i, s.size()) {
if ('a' <= s[i] && s[i] <= 'z')
ans += (char)s[i] - 32;
else
ans += s[i];
}
return ans;
}
string Tolower(string s) {
string ans = "";
rep(i, s.size()) {
if ('A' <= s[i] && s[i] <= 'Z')
ans += (char)s[i] + 32;
else
ans += s[i];
}
return ans;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
string s;
cin >> s;
ll dp[s.size()][13];
rep(i, s.size()) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?')
rep(i, 10) dp[0][i] = 1;
else
dp[0][s[0] - '0'] = 1;
rep(i, s.size() - 1) {
if (s[i + 1] != '?') {
rep(j, 13) {
dp[i + 1][(j * 10 + (s[i] - '0')) % 13] += dp[i][j];
dp[i + 1][(j * 10 + (s[i] - '0')) % 13] %= MOD;
}
} else {
rep(j, 13) rep(k, 10) {
dp[i + 1][(j * 10 + k) % 13] += dp[i][j];
dp[i + 1][(j * 10 + k) % 13] %= MOD;
}
}
}
cout << dp[s.size() - 1][5] << endl;
} | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
string Toupper(string s) {
string ans = "";
rep(i, s.size()) {
if ('a' <= s[i] && s[i] <= 'z')
ans += (char)s[i] - 32;
else
ans += s[i];
}
return ans;
}
string Tolower(string s) {
string ans = "";
rep(i, s.size()) {
if ('A' <= s[i] && s[i] <= 'Z')
ans += (char)s[i] + 32;
else
ans += s[i];
}
return ans;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
string s;
cin >> s;
ll dp[s.size()][13];
rep(i, s.size()) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?')
rep(i, 10) dp[0][i] = 1;
else
dp[0][s[0] - '0'] = 1;
rep(i, s.size() - 1) {
if (s[i + 1] != '?') {
rep(j, 13) {
dp[i + 1][(j * 10 + (s[i + 1] - '0')) % 13] += dp[i][j];
dp[i + 1][(j * 10 + (s[i + 1] - '0')) % 13] %= MOD;
}
} else {
rep(j, 13) rep(k, 10) {
dp[i + 1][(j * 10 + k) % 13] += dp[i][j];
dp[i + 1][(j * 10 + k) % 13] %= MOD;
}
}
}
cout << dp[s.size() - 1][5] << endl;
} | [] | 769,141 | 769,142 | u264265458 | cpp |
p02960 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
string s;
cin >> s;
ll dp[s.size()][13];
rep(i, s.size()) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?')
rep(i, 10) dp[0][i] = 1;
else
dp[0][s[0] - '0'] = 1;
rep(i, s.size() - 1) {
if (s[i + 1] == '?') {
rep(j, 13) {
rep(k, 10) {
dp[i + 1][((10 * j) % 13 + k) % 13] += dp[i][j];
dp[i + 1][((10 * j) % 13 + k) % 13] %= MOD;
}
}
} else {
rep(j, 13) {
dp[i + 1][((10 * j) + (s[i] - '0')) % 13] += dp[i][j];
dp[i + 1][((10 * j) + (s[i] - '0')) % 13] %= MOD;
}
}
}
cout << dp[s.size() - 1][5] << endl;
} | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
string s;
cin >> s;
ll dp[s.size()][13];
rep(i, s.size()) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?')
rep(i, 10) dp[0][i] = 1;
else
dp[0][s[0] - '0'] = 1;
rep(i, s.size() - 1) {
if (s[i + 1] == '?') {
rep(j, 13) {
rep(k, 10) {
dp[i + 1][((10 * j) % 13 + k) % 13] += dp[i][j];
dp[i + 1][((10 * j) % 13 + k) % 13] %= MOD;
}
}
} else {
rep(j, 13) {
dp[i + 1][((10 * j) + (s[i + 1] - '0')) % 13] += dp[i][j];
dp[i + 1][((10 * j) + (s[i + 1] - '0')) % 13] %= MOD;
}
}
}
cout << dp[s.size() - 1][5] << endl;
} | [] | 769,143 | 769,144 | u264265458 | cpp |
p02960 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
string s;
cin >> s;
ll dp[s.size()][13];
rep(i, s.size()) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?')
rep(i, 13) dp[0][i] = 1;
else
dp[0][s[0] - '0'] = 1;
rep(i, s.size() - 1) {
if (s[i + 1] == '?') {
rep(j, 13) {
rep(k, 10) {
dp[i + 1][((10 * j) % 13 + k) % 13] += dp[i][j];
dp[i + 1][((10 * j) % 13 + k) % 13] %= MOD;
}
}
} else {
rep(j, 13) {
dp[i + 1][((10 * j) + (s[i] - '0')) % 13] += dp[i][j];
dp[i + 1][((10 * j) + (s[i] - '0')) % 13] %= MOD;
}
}
}
cout << dp[s.size() - 1][5] << endl;
} | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
string s;
cin >> s;
ll dp[s.size()][13];
rep(i, s.size()) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?')
rep(i, 10) dp[0][i] = 1;
else
dp[0][s[0] - '0'] = 1;
rep(i, s.size() - 1) {
if (s[i + 1] == '?') {
rep(j, 13) {
rep(k, 10) {
dp[i + 1][((10 * j) % 13 + k) % 13] += dp[i][j];
dp[i + 1][((10 * j) % 13 + k) % 13] %= MOD;
}
}
} else {
rep(j, 13) {
dp[i + 1][((10 * j) + (s[i + 1] - '0')) % 13] += dp[i][j];
dp[i + 1][((10 * j) + (s[i + 1] - '0')) % 13] %= MOD;
}
}
}
cout << dp[s.size() - 1][5] << endl;
} | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 769,145 | 769,144 | u264265458 | cpp |
p02960 | #include <bits/stdc++.h>
#include <cmath>
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;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 28;
const long long MOD = 1000000000 + 7;
int main() {
string s;
cin >> s;
int legth = s.size();
vector<vector<long long>> dp(legth + 2, vector<long long>(14, 0));
int terget;
terget = s[legth - 1] - '0';
if (s[legth - 1] == '?') {
terget = -1;
}
// cout<<terget;
for (int n = 0; n < 10; n++) {
if (terget == -1 or terget == n) {
dp[legth - 1][n] = 1;
}
// cout<<dp[legth-1][n]<<" ";
}
int C[7] = {1, 10, 9, 12, 3, 4};
/*
dp::(at)(mod13)->mod13 == 5
dp(legth-1)(s[tegth-1])=1, otherwise:0;
{
if(s[i]==?){
dp(i)(t+nC(i%7))+=dp(i-1)(t) (for t in 0 to 12), (for n in 0 to 9)
}else{
dp(i)(t+s[i]*C(i%7))=dp(i-1)(t) (for t in 0 to 12)
}
}
find::dp[0][5]
*/
int to;
int count = 1;
for (int at = legth - 2; at >= 0; at--) {
terget = s[at] - '0';
if (s[at] == '?') {
terget = -1;
}
for (int t = 0; t < 13; t++) {
for (int n = 0; n < 10; n++) {
if (terget == -1 or terget == n) {
to = (t + n * C[count]) % 13;
dp[at][to] += dp[at + 1][t];
}
dp[at][to] %= MOD;
}
}
// cout<< dp[at][5]<<endl;
count = (count + 1) % 13;
}
cout << dp[0][5] % MOD;
} | #include <bits/stdc++.h>
#include <cmath>
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;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 28;
const long long MOD = 1000000000 + 7;
int main() {
string s;
cin >> s;
int legth = s.size();
vector<vector<long long>> dp(legth + 2, vector<long long>(14, 0));
int terget;
terget = s[legth - 1] - '0';
if (s[legth - 1] == '?') {
terget = -1;
}
// cout<<terget<<" ";
for (int n = 0; n < 10; n++) {
if (terget == -1 or terget == n) {
dp[legth - 1][n] = 1;
}
// cout<<dp[legth-1][n]<<" ";
}
int C[7] = {1, 10, 9, 12, 3, 4};
/*
dp::(at)(mod13)->mod13 == 5
dp(legth-1)(s[tegth-1])=1, otherwise:0;
{
if(s[i]==?){
dp(i)(t+nC(i%7))+=dp(i-1)(t) (for t in 0 to 12), (for n in 0 to 9)
}else{
dp(i)(t+s[i]*C(i%7))=dp(i-1)(t) (for t in 0 to 12)
}
}
find::dp[0][5]
*/
// cout<<endl;
int to;
int count = 1;
for (int at = legth - 2; at >= 0; at--) {
// cout<<C[count]<<"- ";
terget = s[at] - '0';
if (s[at] == '?') {
terget = -1;
}
for (int t = 0; t < 13; t++) {
for (int n = 0; n < 10; n++) {
if (terget == -1 or terget == n) {
to = (t + n * C[count]) % 13;
// cout<< to <<" ";
dp[at][to] += dp[at + 1][t];
}
dp[at][to] %= MOD;
}
}
// cout<< dp[at][5]<<endl;
count = (count + 1) % 6;
}
cout << dp[0][5] % MOD;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 769,150 | 769,151 | u179778090 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 1e9 + 7;
const double EPS = 1e-9;
const int n = 13;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int bitCount(long bits) {
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int len = s.size();
int dp[len][n];
rep(i, len) { rep(j, n) dp[i][j] = 0; }
dp[0][0] = 1;
int mal = 1;
for (int i = len - 1; i >= 0; --i) {
int index = len - i;
if (s[i] == '?') {
rep(j, n) {
rep(k, 10) {
dp[index][(j + k * mal) % n] += dp[index - 1][j];
dp[index][(j + k * mal) % n] %= Inf;
}
}
} else {
int num = s[i] - '0';
rep(j, n) {
dp[index][(j + num * mal) % n] += dp[index - 1][j];
dp[index][(j + num * mal) % n] %= Inf;
}
}
mal *= 10;
mal %= n;
}
cout << dp[len][5] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 1e9 + 7;
const double EPS = 1e-9;
const int n = 13;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int bitCount(long bits) {
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int len = s.size();
int dp[len + 1][n];
rep(i, len + 1) { rep(j, n) dp[i][j] = 0; }
dp[0][0] = 1;
int mal = 1;
for (int i = len - 1; i >= 0; --i) {
int index = len - i;
if (s[i] == '?') {
rep(j, n) {
rep(k, 10) {
dp[index][(j + k * mal) % n] += dp[index - 1][j];
dp[index][(j + k * mal) % n] %= Inf;
}
}
} else {
int num = s[i] - '0';
rep(j, n) {
dp[index][(j + num * mal) % n] += dp[index - 1][j];
dp[index][(j + num * mal) % n] %= Inf;
}
}
mal *= 10;
mal %= n;
}
cout << dp[len][5] << endl;
return 0;
}
| [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 769,156 | 769,157 | u940569542 | cpp |
p02960 | // Gracias, Rodolfo
// Gracias, MarcosK
// Gracias, Graphter
// Obrigado, Dilson
//#pragma GCC optimize ("Ofast,unroll-loops")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0)
#define For(i, a, b) for (Long i = a; i < b; i++)
#define roF(i, a, b) for (Long i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) (v).begin(), (v).end()
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
typedef long long Long;
typedef long double Double;
typedef unsigned long long ULong;
typedef pair<Long, Long> Pair;
typedef vector<Long> Vector;
typedef vector<Pair> PairVector;
const int N = 1e5 + 10;
const Long INF = 1e18;
const Double EPS = 10e-9;
const Long MOD = 1e9 + 7LL;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
Long random(Long a, Long b) {
return uniform_int_distribution<Long>(a, b)(rng);
}
void solve() {
string s;
cin >> s;
Long sz = s.size();
Long dp[sz][13];
For(i, 0, sz) For(j, 0, 13) dp[i][j] = 0LL;
if (s[sz - 1] == '?') {
For(i, 0, 10) dp[sz - 1][i] = 1LL;
} else {
Long c = s[sz - 1] - '0';
dp[sz - 1][c] = 1LL;
}
Long pot = 1LL;
roF(pos, sz - 2, 0) {
if (s[pos] == '?') {
For(i, 0, 10) {
Long cur = (i * pot) % 13LL;
For(j, 0, 13) {
Long to = (cur + j) % 13;
dp[pos][to] = (dp[pos][to] + dp[pos + 1][j]) % MOD;
// debug(dp[pos][to]);
}
}
} else {
Long c = s[pos] - '0';
Long cur = (c * pot) % 13LL;
For(j, 0, 13) {
Long to = (cur + j) % 13;
dp[pos][to] = (dp[pos][to] + dp[pos + 1][j]) % MOD;
// debug(dp[pos][to]);
}
}
pot = (pot * 10LL) % 13LL;
}
cout << dp[0][5] << endl;
}
int main() {
fastio;
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | // Gracias, Rodolfo
// Gracias, MarcosK
// Gracias, Graphter
// Obrigado, Dilson
//#pragma GCC optimize ("Ofast,unroll-loops")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0)
#define For(i, a, b) for (Long i = a; i < b; i++)
#define roF(i, a, b) for (Long i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) (v).begin(), (v).end()
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
typedef long long Long;
typedef long double Double;
typedef unsigned long long ULong;
typedef pair<Long, Long> Pair;
typedef vector<Long> Vector;
typedef vector<Pair> PairVector;
const int N = 1e5 + 10;
const Long INF = 1e18;
const Double EPS = 10e-9;
const Long MOD = 1e9 + 7LL;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
Long random(Long a, Long b) {
return uniform_int_distribution<Long>(a, b)(rng);
}
void solve() {
string s;
cin >> s;
Long sz = s.size();
Long dp[sz][13];
For(i, 0, sz) For(j, 0, 13) dp[i][j] = 0LL;
if (s[sz - 1] == '?') {
For(i, 0, 10) dp[sz - 1][i] = 1LL;
} else {
Long c = s[sz - 1] - '0';
dp[sz - 1][c] = 1LL;
}
Long pot = 10LL;
roF(pos, sz - 2, 0) {
if (s[pos] == '?') {
For(i, 0, 10) {
Long cur = (i * pot) % 13LL;
For(j, 0, 13) {
Long to = (cur + j) % 13LL;
dp[pos][to] = (dp[pos][to] + dp[pos + 1][j]) % MOD;
// debug(dp[pos][to]);
}
}
} else {
Long c = s[pos] - '0';
Long cur = (c * pot) % 13LL;
For(j, 0, 13) {
Long to = (cur + j) % 13LL;
dp[pos][to] = (dp[pos][to] + dp[pos + 1][j]) % MOD;
// debug(dp[pos][to]);
}
}
pot = (pot * 10LL) % 13LL;
}
cout << dp[0][5] << endl;
}
int main() {
fastio;
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"literal.number.type.widen.change"
] | 769,158 | 769,159 | u371012206 | cpp |
p02960 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll nCr(ll n, ll r) {
if (r == 0 || r == n) {
return 1;
} else if (r == 1) {
return n;
}
return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r) {
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--)
ret *= i;
return ret;
}
//-----------------------ここから-----------
string s;
ll memo[100100][14];
ll dp(int i, int j) {
if (i == s.size())
return j == 0 ? 1 : 0;
if (memo[i][j] != -1)
return memo[i][j];
ll res = 0;
if (s[i] != '?') {
int now = s[i] - '0';
res += dp(i + 1, (j * 10 + now) % 13);
res %= MOD;
} else {
for (int d = 0; d < 10; d++) {
res += dp(i + 1, (j * 10 + d) % 13);
res %= MOD;
}
}
return memo[i][j] = res;
}
int main(void) {
cin >> s;
for (int i = 0; i <= s.size(); i++) {
for (int j = 0; j < 14; j++) {
memo[i][j] = -1;
}
}
cout << dp(0, 5) % MOD << endl;
} | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll nCr(ll n, ll r) {
if (r == 0 || r == n) {
return 1;
} else if (r == 1) {
return n;
}
return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r) {
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--)
ret *= i;
return ret;
}
//-----------------------ここから-----------
string s;
ll memo[100100][14];
ll dp(int i, int j) {
if (i == s.size())
return j == 5 ? 1 : 0;
if (memo[i][j] != -1)
return memo[i][j];
ll res = 0;
if (s[i] != '?') {
int now = s[i] - '0';
res += dp(i + 1, (j * 10 + now) % 13);
res %= MOD;
} else {
for (int d = 0; d < 10; d++) {
res += dp(i + 1, (j * 10 + d) % 13);
res %= MOD;
}
}
return memo[i][j] = res;
}
int main(void) {
cin >> s;
for (int i = 0; i <= s.size(); i++) {
for (int j = 0; j < 14; j++) {
memo[i][j] = -1;
}
}
cout << dp(0, 0) % MOD << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 769,170 | 769,171 | u845000384 | cpp |
p02960 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
const int MOD = 1e9 + 7;
ll dp[100100][13];
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
rep(i, 100100) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?') {
rep(i, 13) dp[0][i] = 1;
} else {
dp[0][s[0] - '0'] = 1;
}
ll mul = 10;
rep(i, sz(s) - 1) {
rep(j, 13) {
if (dp[i][j]) {
if (s[i + 1] == '?') {
rep(k, 10) {
int index = (j + (mul * k % MOD)) % 13;
dp[i + 1][index] += dp[i][j] % MOD;
}
} else {
int dig = s[i + 1] - '0';
int index = (j + dig * mul) % 13;
dp[i + 1][index] += dp[i][j] % MOD;
}
}
}
mul *= 10;
mul %= 13;
}
cout << dp[sz(s) - 1][5] % MOD << endl;
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
const int MOD = 1e9 + 7;
ll dp[100100][13];
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
rep(i, 100100) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?') {
rep(i, 10) dp[0][i] = 1;
} else {
dp[0][s[0] - '0'] = 1;
}
ll mul = 10;
rep(i, sz(s) - 1) {
rep(j, 13) {
if (dp[i][j]) {
if (s[i + 1] == '?') {
rep(k, 10) {
int index = (j + (mul * k % MOD)) % 13;
dp[i + 1][index] += dp[i][j] % MOD;
}
} else {
int dig = s[i + 1] - '0';
int index = (j + dig * mul) % 13;
dp[i + 1][index] += dp[i][j] % MOD;
}
}
}
mul *= 10;
mul %= 13;
}
cout << dp[sz(s) - 1][5] % MOD << endl;
}
| [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 769,176 | 769,177 | u840810569 | cpp |
p02960 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int n_digits = s.size();
vector<vector<long long>> dp(n_digits + 1, vector<long long>(13, 0));
dp[0][0] = 1; // 0 (mod 13) \equiv 0
long long digit = 1;
for (int i = 0; i < n_digits; i++) {
// update dp[i+1][k]
if (s[n_digits - i - 1] != '?') {
int k = s[n_digits - i - 1] - '0';
for (int j = 0; j < 13; j++) {
dp[i + 1][(digit * k + j) % 13] += dp[i][j];
}
}
else {
for (int k = 0; k < 10; k++) {
for (int j = 0; j < 13; j++) {
dp[i + 1][(digit * k + j) % 13] += dp[i][j];
}
}
}
for (int k = 0; k < 13; k++)
dp[i + 1][k] %= MOD;
digit *= 10;
digit %= MOD;
}
cout << dp[n_digits][5] << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int n_digits = s.size();
vector<vector<long long>> dp(n_digits + 1, vector<long long>(13, 0));
dp[0][0] = 1; // 0 (mod 13) \equiv 0
long long digit = 1;
for (int i = 0; i < n_digits; i++) {
// update dp[i+1][k]
if (s[n_digits - i - 1] != '?') {
int k = s[n_digits - i - 1] - '0';
for (int j = 0; j < 13; j++) {
dp[i + 1][(digit * k + j) % 13] += dp[i][j];
}
}
else {
for (int k = 0; k < 10; k++) {
for (int j = 0; j < 13; j++) {
dp[i + 1][(digit * k + j) % 13] += dp[i][j];
}
}
}
for (int k = 0; k < 13; k++)
dp[i + 1][k] %= MOD;
digit *= 10;
digit %= 13;
}
cout << dp[n_digits][5] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,180 | 769,181 | u886790158 | cpp |
p02960 | #include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int N = 13;
const int MOD = 1e9 + 7;
const int REM = 5;
int main() {
string s;
cin >> s;
int n_digits = s.size();
vector<vector<long>> dp(n_digits + 1, vector<long>(13, 0));
dp[0][0] = 1;
int c;
for (int i = 0; i < n_digits; i++) {
c = (s[n_digits - i - 1] == '?') ? -1 : s[i] - '0';
if (c == -1) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 13; k++) {
dp[i + 1][(k * 10 + j) % N] += dp[i][k];
}
}
}
else {
for (int k = 0; k < 13; k++) {
dp[i + 1][(k * 10 + c) % N] += dp[i][k];
}
}
for (int k = 0; k < 13; k++) {
dp[i + 1][k] %= MOD;
}
}
cout << dp[n_digits][REM] << endl;
}
| #include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int N = 13;
const int MOD = 1e9 + 7;
const int REM = 5;
int main() {
string s;
cin >> s;
int n_digits = s.size();
vector<vector<long>> dp(n_digits + 1, vector<long>(13, 0));
dp[0][0] = 1;
int c;
for (int i = 0; i < n_digits; i++) {
c = (s[i] == '?') ? -1 : s[i] - '0';
if (c == -1) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 13; k++) {
dp[i + 1][(k * 10 + j) % N] += dp[i][k];
}
}
}
else {
for (int k = 0; k < 13; k++) {
dp[i + 1][(k * 10 + c) % N] += dp[i][k];
}
}
for (int k = 0; k < 13; k++) {
dp[i + 1][k] %= MOD;
}
}
cout << dp[n_digits][REM] << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 769,182 | 769,183 | u886790158 | cpp |
p02960 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
// inline int in() { int x; scanf("%d",&x); return x;}
inline ll in() {
ll x;
cin >> x;
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const ll mod = 1000000007ll;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
int main() {
string s;
cin >> s;
ll n = s.length();
vector<vector<int>> dp(n + 1, vector<int>(13));
dp[0][0] = 1;
rep(i, n) {
rep(j, 13) {
if (s[i] == '?') {
rep(d, 9) {
int jd = (j * 10 + d) % 13;
dp[i + 1][jd] += dp[i][j];
dp[i + 1][jd] %= mod;
//(dp[i+1][(j*10+d)%13] += dp[i][j]) %= mod;
}
} else {
int js = (j * 10 + s[i] - '0') % 13;
dp[i + 1][js] += dp[i][j];
dp[i + 1][js] %= mod;
//(dp[i+1][(j*10+s[i]-'0') % 13] += dp[i][j]) %= mod;
}
}
}
cout << dp[n][5] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
// inline int in() { int x; scanf("%d",&x); return x;}
inline ll in() {
ll x;
cin >> x;
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const ll mod = 1000000007ll;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
int main() {
string s;
cin >> s;
ll n = s.length();
vector<vector<int>> dp(n + 1, vector<int>(13));
dp[0][0] = 1;
rep(i, n) {
rep(j, 13) {
if (s[i] == '?') {
rep(d, 10) {
int jd = (j * 10 + d) % 13;
dp[i + 1][jd] += dp[i][j];
dp[i + 1][jd] %= mod;
//(dp[i+1][(j*10+d)%13] += dp[i][j]) %= mod;
}
} else {
int js = (j * 10 + s[i] - '0') % 13;
dp[i + 1][js] += dp[i][j];
dp[i + 1][js] %= mod;
//(dp[i+1][(j*10+s[i]-'0') % 13] += dp[i][j]) %= mod;
}
}
}
cout << dp[n][5] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 769,194 | 769,195 | u526630579 | cpp |
p02960 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
const long long MOD_CONST = 1000000007;
using namespace std;
int main() {
string s;
cin >> s;
int len = s.length();
vector<vector<long long>> dp(len + 1, vector<long long>(13));
dp[0][0] = 1;
for (int i = 0; i < len; i++) {
int num;
if (s[i] == '?') {
num = -1;
} else {
num = s[i] - '0';
}
for (int j = 0; j < 10; j++) {
if (num != -1 && num != j) {
continue;
}
for (int k = 0; k < 13; k++) {
dp[i + 1][(k * 10 + j) / 13] += dp[i][k];
dp[i + 1][(k * 10 + j) / 13] %= MOD_CONST;
}
}
}
long long ans = dp[len][5];
printf("%lld", ans);
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
const long long MOD_CONST = 1000000007;
using namespace std;
int main() {
string s;
cin >> s;
int len = s.length();
vector<vector<long long>> dp(len + 1, vector<long long>(13));
dp[0][0] = 1;
for (int i = 0; i < len; i++) {
int num;
if (s[i] == '?') {
num = -1;
} else {
num = s[i] - '0';
}
for (int j = 0; j < 10; j++) {
if (num != -1 && num != j) {
continue;
}
for (int k = 0; k < 13; k++) {
dp[i + 1][(k * 10 + j) % 13] += dp[i][k];
dp[i + 1][(k * 10 + j) % 13] %= MOD_CONST;
}
}
}
long long ans = dp[len][5];
printf("%lld", ans);
} | [
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 769,196 | 769,197 | u156778176 | cpp |
p02960 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数 ============================================================
typedef unsigned int uint;
typedef long long ll;
// typedef pair<int, int> P;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<bool> vbool;
typedef vector<string> vstring;
typedef vector<vector<int>> vvint;
typedef vector<vector<ll>> vvll;
typedef vector<vector<double>> vvdouble;
typedef vector<vector<bool>> vvbool;
const int INF = 1e9 + 1;
const ll LLINF = 1e17 + 1;
const int DX[9] = {0, 0, 1, -1, 1, 1, -1, -1, 0}; // 4;４近傍
const int DY[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0}; // 8:８近傍 9:(0,0)を含む
const ll MOD = 1e9 + 7; // 10^9 + 7
const double PI = 3.14159265358979323846264338327950288;
//========================================================================
int main() {
//==================================
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
//==================================
string S;
cin >> S;
// 下位i桁でmod13 == jになる数列の数
vvll dp(S.length());
for (ll i = 0; i < S.length(); i++) {
for (ll j = 0; j < 13; j++) {
dp[i].emplace_back(0);
}
}
if (S[S.length() - 1] == '?') {
for (ll i = 0; i <= 9; i++) {
dp[0][i] = 1;
}
} else {
dp[0][ll(S[S.length() - 1]) - 48] = 1;
}
vll power(S.length());
power[0] = 1;
for (ll i = 1; i < S.length(); i++) {
power[i] = (power[i - 1] * 10) % MOD;
if (S[S.length() - 1 - i] != '?') {
for (ll j = 0; j < 13; j++) {
dp[i][(j + (ll(S[S.length() - 1 - i]) - 48) * power[i]) % 13] =
dp[i - 1][j];
dp[i][(j + (ll(S[S.length() - 1 - i]) - 48) * power[i]) % 13] %= MOD;
}
} else {
for (ll j = 0; j < 13; j++) {
for (ll k = 0; k <= 9; k++) {
dp[i][(j + k * power[i]) % 13] += dp[i - 1][j];
dp[i][(j + k * power[i]) % 13] %= MOD;
}
}
}
}
cout << dp[S.length() - 1][5] % MOD;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数 ============================================================
typedef unsigned int uint;
typedef long long ll;
// typedef pair<int, int> P;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<bool> vbool;
typedef vector<string> vstring;
typedef vector<vector<int>> vvint;
typedef vector<vector<ll>> vvll;
typedef vector<vector<double>> vvdouble;
typedef vector<vector<bool>> vvbool;
const int INF = 1e9 + 1;
const ll LLINF = 1e17 + 1;
const int DX[9] = {0, 0, 1, -1, 1, 1, -1, -1, 0}; // 4;４近傍
const int DY[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0}; // 8:８近傍 9:(0,0)を含む
const ll MOD = 1e9 + 7; // 10^9 + 7
const double PI = 3.14159265358979323846264338327950288;
//========================================================================
int main() {
//==================================
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
//==================================
string S;
cin >> S;
// 下位i桁でmod13 == jになる数列の数
vvll dp(S.length());
for (ll i = 0; i < S.length(); i++) {
for (ll j = 0; j < 13; j++) {
dp[i].emplace_back(0);
}
}
if (S[S.length() - 1] == '?') {
for (ll i = 0; i <= 9; i++) {
dp[0][i] = 1;
}
} else {
dp[0][ll(S[S.length() - 1]) - 48] = 1;
}
vll power(S.length());
power[0] = 1;
for (ll i = 1; i < S.length(); i++) {
power[i] = (power[i - 1] * 10) % 13;
if (S[S.length() - 1 - i] != '?') {
for (ll j = 0; j < 13; j++) {
dp[i][(j + (ll(S[S.length() - 1 - i]) - 48) * power[i]) % 13] =
dp[i - 1][j];
dp[i][(j + (ll(S[S.length() - 1 - i]) - 48) * power[i]) % 13] %= MOD;
}
} else {
for (ll j = 0; j < 13; j++) {
for (ll k = 0; k <= 9; k++) {
dp[i][(j + k * power[i]) % 13] += dp[i - 1][j];
dp[i][(j + k * power[i]) % 13] %= MOD;
}
}
}
}
cout << dp[S.length() - 1][5] % MOD;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 769,200 | 769,201 | u433195318 | cpp |
p02960 | #include "bits/stdc++.h"
using namespace std;
using lint = long long;
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (lint i = 0; i < lint(n); ++i)
#define Rep(i, n) for (lint i = lint(n); i >= 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define cend printf("\n");
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define prique2(T) priority_queue<T>
struct edge {
int to;
double cost;
};
using P = pair<lint, lint>;
using D = pair<double, double>;
using DI = pair<double, int>;
// const lint mod = 998244353LL;
const lint mod = 1000000007LL;
const lint inf = 3LL * mod * mod;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
lint modpow(lint x, lint n, lint m) {
lint ans = 1;
while (n > 0) {
if (n & 1) {
ans *= x;
if (m <= ans)
ans %= m;
}
x *= x;
if (m <= x)
x %= m;
n >>= 1;
}
return ans;
}
lint fact[1000000];
void f_init(lint n) {
if (1000000 <= n)
return;
fact[0] = fact[1] = 1;
for (lint i = 2; i <= n; ++i) {
fact[i] = i * fact[i - 1];
if (mod <= fact[i])
fact[i] %= mod;
}
return;
}
lint inver[1000000];
bool inve[100000];
lint inv(lint x) {
if (x == 0)
return 0;
else if (inve[x])
return inver[x];
else {
inve[x] = true;
return inver[x] = modpow(x, mod - 2, mod);
}
}
lint comb(lint n, lint r) {
if (n < r)
return 0;
if (n == r)
return 1;
lint ans = fact[n] * inv(fact[n - r]) % mod * inv(fact[r]) % mod;
if (ans < 0)
return ans + mod;
return ans;
}
lint nck[1010][1010];
void comb(lint n) {
rep(i, n + 1) {
rep(j, i + 1) {
if (j == 0 || i == j)
nck[i][j] = 1;
else
nck[i][j] = nck[i - 1][j - 1] + nck[i - 1][j];
}
}
}
lint gcd(lint a, lint b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool pri(lint p) {
for (lint i = 2; i * i <= p; i == 2 ? ++i : i += 2)
if (p % i == 0)
return false;
return p > 1;
}
map<lint, lint> factring(lint n) {
map<lint, lint> ans;
for (lint i = 2; i * i <= n; ++i) {
while (n % i == 0) {
n /= i;
++ans[i];
}
}
if (n != 1)
++ans[n];
return ans;
}
double dis(D a, D b) {
return sqrt((a.first - b.first) * (a.first - b.first) +
(a.second - b.second) * (a.second - b.second));
}
string s;
lint n, dp[100010][13]; // i桁目までで余りがjとなる整数の個数
int main() {
cin >> s;
n = s.size();
reverse(all(s));
rep(i, n) {
if (i == 0) {
rep(j, 13) {
if (j == s[0] - '0' || s[0] == '?')
dp[0][j] = 1;
else
dp[0][j] = 0;
}
} else if (s[i] == '?') {
lint m = modpow(10, i, 13);
rep(j, 10) {
rep(k, 13) {
dp[i][(k + j * m) % 13] += dp[i - 1][k];
dp[i][(k + j * m) % 13] %= mod;
}
}
} else {
lint m = (s[i] - '0') * modpow(10, i, 13);
rep(j, 13) {
dp[i][(j + m) % 13] += dp[i - 1][j];
dp[i][(j + m) % 13] %= mod;
}
}
}
cout << dp[n - 1][5] << endl;
}
| #include "bits/stdc++.h"
using namespace std;
using lint = long long;
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (lint i = 0; i < lint(n); ++i)
#define Rep(i, n) for (lint i = lint(n); i >= 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define cend printf("\n");
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define prique2(T) priority_queue<T>
struct edge {
int to;
double cost;
};
using P = pair<lint, lint>;
using D = pair<double, double>;
using DI = pair<double, int>;
// const lint mod = 998244353LL;
const lint mod = 1000000007LL;
const lint inf = 3LL * mod * mod;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
lint modpow(lint x, lint n, lint m) {
lint ans = 1;
while (n > 0) {
if (n & 1) {
ans *= x;
if (m <= ans)
ans %= m;
}
x *= x;
if (m <= x)
x %= m;
n >>= 1;
}
return ans;
}
lint fact[1000000];
void f_init(lint n) {
if (1000000 <= n)
return;
fact[0] = fact[1] = 1;
for (lint i = 2; i <= n; ++i) {
fact[i] = i * fact[i - 1];
if (mod <= fact[i])
fact[i] %= mod;
}
return;
}
lint inver[1000000];
bool inve[100000];
lint inv(lint x) {
if (x == 0)
return 0;
else if (inve[x])
return inver[x];
else {
inve[x] = true;
return inver[x] = modpow(x, mod - 2, mod);
}
}
lint comb(lint n, lint r) {
if (n < r)
return 0;
if (n == r)
return 1;
lint ans = fact[n] * inv(fact[n - r]) % mod * inv(fact[r]) % mod;
if (ans < 0)
return ans + mod;
return ans;
}
lint nck[1010][1010];
void comb(lint n) {
rep(i, n + 1) {
rep(j, i + 1) {
if (j == 0 || i == j)
nck[i][j] = 1;
else
nck[i][j] = nck[i - 1][j - 1] + nck[i - 1][j];
}
}
}
lint gcd(lint a, lint b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool pri(lint p) {
for (lint i = 2; i * i <= p; i == 2 ? ++i : i += 2)
if (p % i == 0)
return false;
return p > 1;
}
map<lint, lint> factring(lint n) {
map<lint, lint> ans;
for (lint i = 2; i * i <= n; ++i) {
while (n % i == 0) {
n /= i;
++ans[i];
}
}
if (n != 1)
++ans[n];
return ans;
}
double dis(D a, D b) {
return sqrt((a.first - b.first) * (a.first - b.first) +
(a.second - b.second) * (a.second - b.second));
}
string s;
lint n, dp[100010][13]; // i桁目までで余りがjとなる整数の個数
int main() {
cin >> s;
n = s.size();
reverse(all(s));
rep(i, n) {
if (i == 0) {
rep(j, 10) {
if (j == s[0] - '0' || s[0] == '?')
dp[0][j] = 1;
else
dp[0][j] = 0;
}
} else if (s[i] == '?') {
lint m = modpow(10, i, 13);
rep(j, 10) {
rep(k, 13) {
dp[i][(k + j * m) % 13] += dp[i - 1][k];
dp[i][(k + j * m) % 13] %= mod;
}
}
} else {
lint m = (s[i] - '0') * modpow(10, i, 13);
rep(j, 13) {
dp[i][(j + m) % 13] += dp[i - 1][j];
dp[i][(j + m) % 13] %= mod;
}
}
}
cout << dp[n - 1][5] << endl;
}
| [
"literal.number.change",
"call.arguments.change"
] | 769,206 | 769,207 | u054475353 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9 + 7;
const int INF = 1e9;
ll dp[100005][15];
int main() {
string S;
cin >> S;
dp[0][0] = 1;
ll N = S.size();
ll keta = 1;
for (int i = 0; i < N; ++i) {
int d = N - 1 - i;
if (S[d] == '?') {
rep(j, 13) rep(k, 10) {
dp[i + 1][((k * keta) % 13 + j) % 13] += dp[i][j];
dp[i + 1][((k * keta) % 13 + j) % 13] %= MOD;
}
} else {
int x = int(S[i] - '0');
rep(j, 13) {
dp[i + 1][((x * keta) % 13 + j) % 13] += dp[i][j];
dp[i + 1][((x * keta) % 13 + j) % 13] %= MOD;
}
}
keta *= 10;
keta %= 13;
}
ll ans = dp[N][5];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9 + 7;
const int INF = 1e9;
ll dp[100005][15];
int main() {
string S;
cin >> S;
dp[0][0] = 1;
ll N = S.size();
ll keta = 1;
for (int i = 0; i < N; ++i) {
int d = N - 1 - i;
if (S[d] == '?') {
rep(j, 13) rep(k, 10) {
dp[i + 1][((k * keta) % 13 + j) % 13] += dp[i][j];
dp[i + 1][((k * keta) % 13 + j) % 13] %= MOD;
}
} else {
int x = int(S[d] - '0');
rep(j, 13) {
dp[i + 1][((x * keta) % 13 + j) % 13] += dp[i][j];
dp[i + 1][((x * keta) % 13 + j) % 13] %= MOD;
}
}
keta *= 10;
keta %= 13;
}
ll ans = dp[N][5];
cout << ans << endl;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 769,214 | 769,215 | u106297876 | cpp |
p02960 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
string s;
int dp[100100][13];
int main() {
cin >> s;
int n = s.size();
dp[0][0] = 1;
// 桁についてループ
for (int i = 0; i < n; i++) {
int c;
if (s[i] == '?')
c = -1;
else
c = s[i] - '0';
// ? だった場合の全処理
for (int j = 0; j < 10; j++) {
if (c != -1 && c != j)
continue;
// i-1文字目までの数が[ki]の時に，それを１０倍してjを加えた部分に
// あまりはうつるよね？
for (int ki = 0; ki < 13; ki++) {
dp[i + 1][(ki * 10 + j) % 13] += dp[i][ki];
}
}
for (int j = 0; j < 13; j++)
dp[i + 1][j] %= mod;
}
cout << dp[n][5] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
string s;
ll dp[100100][13];
int main() {
cin >> s;
int n = s.size();
dp[0][0] = 1;
// 桁についてループ
for (int i = 0; i < n; i++) {
int c;
if (s[i] == '?')
c = -1;
else
c = s[i] - '0';
// ? だった場合の全処理
for (int j = 0; j < 10; j++) {
if (c != -1 && c != j)
continue;
// i-1文字目までの数が[ki]の時に，それを１０倍してjを加えた部分に
// あまりはうつるよね？
for (int ki = 0; ki < 13; ki++) {
dp[i + 1][(ki * 10 + j) % 13] += dp[i][ki];
}
}
for (int j = 0; j < 13; j++)
dp[i + 1][j] %= mod;
}
cout << dp[n][5] << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 769,229 | 769,230 | u255001744 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.