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 <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | [
"variable_declaration.type.change"
] | 768,467 | 768,468 | u773115096 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n + 1) cin >> b[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
b[i] -= a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<long long> b(n);
rep(i, n + 1) cin >> b[i];
long long count = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i])... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,469 | 768,470 | u895393304 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
LL ahako[100010];
LL bhako[100010];
int main() {
LL n;
LL a = 0;
LL res = 0;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
LL ahako[100010];
LL bhako[100010];
int main() {
LL n;
LL a = 0;
LL res = 0;
cin >> n;
... | [
"expression.operation.binary.remove",
"assignment.change"
] | 768,471 | 768,472 | u400497478 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int savers_count;
vector<int> monsters_counts;
vector<int> capacities;
cin >> savers_count;
for (int i = 0; i < savers_count + 1; i++) {
int m;
cin >> m;
monsters_counts.push_back(m);
}
for (i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int savers_count;
vector<int> monsters_counts;
vector<int> capacities;
cin >> savers_count;
for (int i = 0; i < savers_count + 1; i++) {
int m;
cin >> m;
monsters_counts.push_back(m);
}
for (i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 768,473 | 768,474 | u674347990 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int ans = 0;
for (size_t i = 0; i < n; i+... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int64_t ans = 0;
for (size_t i = 0; i < n... | [
"variable_declaration.type.primitive.change"
] | 768,475 | 768,476 | u229148215 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
std::vector<int> a(n + 1);
std::vector<int> b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int beat = 0;
for (int i = 0; i < n; i++) {... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
std::vector<int> a(n + 1);
std::vector<int> b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll beat = 0;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.change"
] | 768,481 | 768,482 | u255172538 | 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; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
ans += B[i];
A[i] -= B[i];... | #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; i++) {
cin >> A[i];
}
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 += B[i];
A[i... | [
"variable_declaration.type.widen.change"
] | 768,483 | 768,484 | u366677622 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int b[100005];
int main() {
scanf("%d", &n);
int ans = 0;
for (int i = 0; i <= n; 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]) {
ans +=... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int b[100005];
int main() {
scanf("%d", &n);
long long ans = 0;
for (int i = 0; i <= n; 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]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,489 | 768,490 | u623136228 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long n, a[10001], b[10001], ans, zero = 0;
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];
if (b[i] > a[i]) {
ans += min(a[i] + a[i + 1], b[i]);
a[i + 1] = max(zero, a[i] + a... | #include <bits/stdc++.h>
using namespace std;
long long n, a[100005], b[100001], ans, zero = 0;
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];
if (b[i] > a[i]) {
ans += min(a[i] + a[i + 1], b[i]);
a[i + 1] = max(zero, a[i] +... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,495 | 768,494 | u768879181 | 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 ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] > B[i]) {
ans += B[i];
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t A[N + 1], B[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] > B[i]) {
ans += B[i];
} else... | [
"variable_declaration.type.primitive.change"
] | 768,498 | 768,499 | u415916075 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] >= b[i]) {
ans... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] >= b[i]) {
ans... | [
"assignment.value.change"
] | 768,504 | 768,505 | u559765551 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<... | [
"assignment.change"
] | 768,508 | 768,509 | u026389788 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<... | [
"variable_declaration.type.change",
"assignment.change"
] | 768,510 | 768,509 | u026389788 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<... | [
"variable_declaration.type.change",
"assignment.change"
] | 768,511 | 768,509 | u026389788 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
ll a[n + 1]... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
ll a[n + 1]... | [
"variable_declaration.type.change"
] | 768,518 | 768,519 | u947304300 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 2, 0), b(n + 1, 0);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long crr = 0;
long long sum = 0;
for (int i = 0; i < n + 1; i++) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 2, 0), b(n + 1, 0);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long crr = 0;
long long sum = 0;
for (int i = 0; i < n + 1; i++) {
... | [
"assignment.change"
] | 768,521 | 768,522 | u770509135 | cpp |
p02959 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,525 | 768,526 | u384161668 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long ll;
#define SZ(x) ((int)(x).size())
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 ... | #include <bits/stdc++.h>
typedef long long ll;
#define SZ(x) ((int)(x).size())
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];
}
ll ans = 0;
for (int i... | [
"variable_declaration.type.change"
] | 768,527 | 768,528 | u725069695 | cpp |
p02959 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int N;
bool check(int p[]) {
for (int i = 0; i < N - 1; i++) {
if (p[i] <= p[i + 1]) {
continue;
}... | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int N;
bool check(int p[]) {
for (int i = 0; i < N - 1; i++) {
if (p[i] <= p[i + 1]) {
continue;
}... | [
"variable_declaration.type.change"
] | 768,531 | 768,532 | u894950682 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, l, r) for (int i = (r - 1); i >= l; i--)
#define P pair<int, int>
#defin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, l, r) for (int i = (r - 1); i >= l; i--)
#define P pair<int, int>
#defin... | [
"variable_declaration.type.change"
] | 768,537 | 768,538 | u425780319 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n], c = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
c += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int d = a[n];
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
b[i] -= a[i];
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
int long long c = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
c += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int d = a[n];
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
... | [
"variable_declaration.add"
] | 768,553 | 768,554 | u568787962 | cpp |
p02959 | #include <bits/stdc++.h>
#include <ctime>
#include <fstream>
#include <stdlib.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int inf = 1e9;
vector<int> a;
vector<int> b;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(100);
// freopen("input.txt","r",std... | #include <bits/stdc++.h>
#include <ctime>
#include <fstream>
#include <stdlib.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int inf = 1e9;
vector<ll> a;
vector<ll> b;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(100);
// freopen("input.txt","r",stdin... | [
"variable_declaration.type.change"
] | 768,557 | 768,558 | u279130306 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
scanf("%d", &m);
int a[m + 1], b[m];
for (int i = 0; i < m + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
int s = 0;
for (int i = 0; i < m; i++) {
if (a[i] >= b[i]) {
s += b[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
scanf("%d", &m);
int a[m + 1], b[m];
for (int i = 0; i < m + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
long long s = 0;
for (int i = 0; i < m; i++) {
if (a[i] >= b[i]) {
s += b... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,559 | 768,560 | u064085255 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
scanf("%d", &m);
int a[m + 1], b[m];
for (int i = 0; i < m + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
int s = 0;
for (int i = 0; i < m; i++) {
if (a[i] > b[i]) {
s += b[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
scanf("%d", &m);
int a[m + 1], b[m];
for (int i = 0; i < m + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
long long s = 0;
for (int i = 0; i < m; i++) {
if (a[i] >= b[i]) {
s += b... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,561 | 768,560 | u064085255 | cpp |
p02959 | #include <iostream>
#include <math.h>
using namespace std;
int n, m, a[100100], ans, b[100100];
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; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
... | #include <iostream>
#include <math.h>
using namespace std;
long long n, m, a[100100], ans, b[100100];
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; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,562 | 768,563 | u019229278 | 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 (int i = 0; i < N + 1; i++) {
cin >> A[i];
// cout <<"A:" << A[i] << endl;
}
for (int i = 0; i < N; i++) {
cin >> B[i];
// cout << B[i] << endl;
}
int count = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long count = 0;
for (int i = 0; i < N; i++) {
int m = min(A[i], B[i]);
... | [
"variable_declaration.type.primitive.change"
] | 768,564 | 768,565 | u223172354 | 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 (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++) {
int m = min(A[i], B[i]);
A[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long count = 0;
for (int i = 0; i < N; i++) {
int m = min(A[i], B[i]);
... | [
"variable_declaration.type.primitive.change"
] | 768,566 | 768,565 | u223172354 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int n;
int mon[N + 1], he[N], sumn, r = 0;
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> mon[i];
for (int i = 1; i <= n; i++)
cin >> he[i];
for (int i = 1; i <= n; i++) {
if (he[i] + r >= mon[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int n;
ll mon[N + 1], he[N], sumn, r = 0;
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> mon[i];
for (int i = 1; i <= n; i++)
cin >> he[i];
for (int i = 1; i <= n; i++) {
if (he[i] + r >= mon[i]... | [
"variable_declaration.type.change"
] | 768,569 | 768,570 | u730153732 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 10010;
int n;
int mon[N + 1], he[N], sumn, r = 0;
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> mon[i];
for (int i = 1; i <= n; i++)
cin >> he[i];
for (int i = 1; i <= n; i++) {
if (he[i] + r >= mon[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int n;
ll mon[N + 1], he[N], sumn, r = 0;
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> mon[i];
for (int i = 1; i <= n; i++)
cin >> he[i];
for (int i = 1; i <= n; i++) {
if (he[i] + r >= mon[i]... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change"
] | 768,571 | 768,570 | u730153732 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
if (a.at(i) < b.at(i)) {
b.at(i) -= a.at(i);
m += a.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long int m = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
if (a.at(i) < b.at(i)) {
b.at(i) -= a.at(i);
... | [
"variable_declaration.type.widen.change"
] | 768,574 | 768,575 | u072080927 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
if (A[i] <= B[i]) {
B[i] -= A[i];
ans += A[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t 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++) {
if (A[i] <= B[i]) {
B[i] -= A[i];
ans += A[i];
... | [
"variable_declaration.type.primitive.change"
] | 768,589 | 768,590 | u122034453 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
int ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = n - 1; i >= 0; i--) {
if (a[i + 1] > b[i]) {
ans += b[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n + 1];
long long int b[n];
long long int ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = n - 1; i >= 0; i--) {
if (a[i + 1] > ... | [
"variable_declaration.type.widen.change"
] | 768,591 | 768,592 | u578806044 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> An(N + 2, 0);
for (int i = 1; i <= N + 1; i++) {
cin >> An[i];
}
vector<ll> Bn(N + 2, 0);
for (int i = 1; i <= N; i++) {
cin >> Bn[i];
}
int sum = 0;
for (int i = 1; i <= N + 1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> An(N + 2, 0);
for (int i = 1; i <= N + 1; i++) {
cin >> An[i];
}
vector<ll> Bn(N + 2, 0);
for (int i = 1; i <= N; i++) {
cin >> Bn[i];
}
ll sum = 0;
for (int i = 1; i <= N + 1; ... | [
"variable_declaration.type.change"
] | 768,597 | 768,598 | u146779775 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> a(n + 1);
vector<long long int> c(n + 1, 0);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
long long int x;
cin >> x;
long long int next = max(x - a[i], (l... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> a(n + 1);
vector<long long int> c(n + 1, 0);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
long long int x;
cin >> x;
long long int next = max(x - a[i], (l... | [
"type_conversion.add"
] | 768,599 | 768,600 | u323492289 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
long int monsters[n + 1];
long int heroes[n];
for (int i = 0; i <= n; i++)
cin >> monsters[i];
for (int i = 0; i < n; i++)
cin >> heroes[i];
int i = 0, k = 0;
while (k < n && i <= n) {
if (k == i || k + 1 == i) {... | #include <iostream>
using namespace std;
int main() {
long int n, cnt = 0;
cin >> n;
long int monsters[n + 1];
long int heroes[n];
for (long int i = 0; i <= n; i++)
cin >> monsters[i];
for (long int i = 0; i < n; i++)
cin >> heroes[i];
long int i = 0, k = 0;
while (k < n && i <= n) {
if (k =... | [
"variable_declaration.type.widen.change"
] | 768,601 | 768,602 | u010732047 | cpp |
p02959 | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
LL a[100000 + 5], b[100000 + 5];
LL sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%lld", &b[i]);
if (b[i] > a[i]) {
sum += min(b[i], a[i] + a[i +... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
LL a[100000 + 5], b[100000 + 5];
LL sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%lld", &b[i]);
if (b[i] > a[i]) {
sum += min(b[i], a[i] + a[i +... | [
"assignment.value.change"
] | 768,605 | 768,606 | u601344838 | cpp |
p02959 | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
int a[100000 + 5], b[100000 + 5];
LL sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
if (b[i] > a[i]) {
sum += min(b[i], a[i] + a[i + 1]... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
LL a[100000 + 5], b[100000 + 5];
LL sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%lld", &b[i]);
if (b[i] > a[i]) {
sum += min(b[i], a[i] + a[i +... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"assignment.value.change"
] | 768,607 | 768,606 | u601344838 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<long> monster(N + 1);
std::vector<long> hero(N);
for (int i = 0; i < N + 1; i++) {
cin >> monster.at(i);
}
for (int i = 0; i < N; i++) {
cin >> hero.at(i);
}
int cnt = 0;
long hit;
long long total = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<long> monster(N + 1);
std::vector<long> hero(N);
for (int i = 0; i < N + 1; i++) {
cin >> monster.at(i);
}
for (int i = 0; i < N; i++) {
cin >> hero.at(i);
}
int cnt = 0;
long hit;
long long total = 0;... | [
"assignment.change"
] | 768,608 | 768,609 | u578276786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<long> monster(N + 1);
std::vector<long> hero(N);
for (int i = 0; i < N + 1; i++) {
cin >> monster.at(i);
}
for (int i = 0; i < N; i++) {
cin >> hero.at(i);
}
int cnt = 0;
long hit;
long total = 0;
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<long> monster(N + 1);
std::vector<long> hero(N);
for (int i = 0; i < N + 1; i++) {
cin >> monster.at(i);
}
for (int i = 0; i < N; i++) {
cin >> hero.at(i);
}
int cnt = 0;
long hit;
long long total = 0;... | [
"variable_declaration.type.widen.change",
"assignment.change"
] | 768,610 | 768,609 | u578276786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int d, r, i, n, ar[100009], cnt = 0;
int main() {
cin >> n;
r = n + 1;
for (i = 1; i <= r; i++)
cin >> ar[i];
for (i = 1; i <= n; i++) {
cin >> d;
if (ar[i] >= d) {
cnt += d;
continue;
}
cnt += ar[i];
r = d ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int d, r, i, n, ar[100009];
ll cnt = 0;
int main() {
cin >> n;
r = n + 1;
for (i = 1; i <= r; i++)
cin >> ar[i];
for (i = 1; i <= n; i++) {
cin >> d;
if (ar[i] >= d) {
cnt += d;
continue;
}
cnt += ar[i];
r ... | [] | 768,611 | 768,612 | u269219846 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, d;
cin >> n;
int a[n + 2], b[n + 2];
d = 0;
a[0] = 0;
b[0] = 0;
b[n + 1] = 0;
for (int i = 1; i < n + 2; i++)
cin >> a[i];
for (int i = 1; i < n + 1; i++)
cin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, d;
cin >> n;
long long a[n + 2], b[n + 2];
d = 0;
a[0] = 0;
b[0] = 0;
b[n + 1] = 0;
for (int i = 1; i < n + 2; i++)
cin >> a[i];
for (int i = 1; i < n + 1; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,621 | 768,622 | u670773128 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100002];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n + 1; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &b[i]);
b[n + 1] = 0;
for (int i = 1; i <= n + 1; i++) {
if (b[i] > a[i])... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100002];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n + 1; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &b[i]);
b[n + 1] = 0;
for (int i = 1; i <= n + 1; i++) {
if (b[i] > a[i])... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,626 | 768,627 | u433665020 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100002];
int ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n + 1; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &b[i]);
b[n + 1] = 0;
for (int i = 1; i <= n + 1; i++) {
if (b[i] >= a[i]) {
... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100002];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n + 1; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &b[i]);
b[n + 1] = 0;
for (int i = 1; i <= n + 1; i++) {
if (b[i] > a[i])... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,628 | 768,627 | u433665020 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, tmp, i;
int knockNum;
vector<int> A, B;
// 入力 --------------------------
cin >> N;
for (i = 0; i < N + 1; i++) {
cin >> tmp;
A.push_back(tmp);
}
for (i = 0; i < N; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, tmp, i;
long int knockNum;
vector<int> A, B;
// 入力 --------------------------
cin >> N;
for (i = 0; i < N + 1; i++) {
cin >> tmp;
A.push_back(tmp);
}
for (i = 0; i < N; i++)... | [
"variable_declaration.type.widen.change"
] | 768,631 | 768,632 | u989110852 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100];
long long ans = 0;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1, b; i <= n; ++i) {
cin >> b;
int x = max(0, a[i] - b);
ans += a[i] - x;
b -= a[i] - x;
a[i] = x;
if (b > 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100005];
long long ans = 0;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1, b; i <= n; ++i) {
cin >> b;
int x = max(0, a[i] - b);
ans += a[i] - x;
b -= a[i] - x;
a[i] = x;
if (b > 0) {... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,640 | 768,638 | u779387275 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | [
"variable_declaration.type.change"
] | 768,641 | 768,642 | u522598953 | cpp |
p02959 | #include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long int res = 0;
int n, a[100002], b[100001], last;
int i;
scanf("%d", &n);
for (i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
a[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &b[i]);... | #include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long int res = 0;
int n, a[100002], b[100001], last;
int i;
scanf("%d", &n);
for (i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
a[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &b[i]);... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,643 | 768,644 | u917198146 | cpp |
p02959 | #include <bits/stdc++.h>
// LIFE IS NOT A PROBLEM TO BE SOLVED
#define rep(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define F first
#define S second
#define pb push_back
#define debug(a) cout << #a << " = " << a << endl;
#define debug2(a, b) \
cout << ... | #include <bits/stdc++.h>
// LIFE IS NOT A PROBLEM TO BE SOLVED
#define rep(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define F first
#define S second
#define pb push_back
#define debug(a) cout << #a << " = " << a << endl;
#define debug2(a, b) \
cout << ... | [
"variable_declaration.type.change"
] | 768,645 | 768,646 | u387251466 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> m(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> m(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,654 | 768,655 | u527806673 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
std::vector<int> a(n + 2);
std::vector<int> b(n + 1);
int sum = 0;
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) {
//モンスターの数が倒した数より大... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
std::vector<long> a(n + 2);
std::vector<long> b(n + 1);
long sum = 0;
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) {
//モンスターの数が倒した数... | [
"variable_declaration.type.primitive.change"
] | 768,656 | 768,657 | u197699574 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N), C(N + 1);
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++)
C[i] = A[i];
int d = 0;
for (int i = 0; i < N; i++) {
d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N), C(N + 1);
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++)
C[i] = A[i];
int d = 0;
for (int i = 0; i < N; i++) {
d... | [
"variable_declaration.type.primitive.change"
] | 768,658 | 768,659 | u330919736 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N), C(N + 1);
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++)
C[i] = A[i];
int d = 0;
for (int i = 0; i < N; i++) {
d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N), C(N + 1);
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++)
C[i] = A[i];
int d = 0;
for (int i = 0; i < N; i++) {
d... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 768,660 | 768,659 | u330919736 | cpp |
p02959 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, kill = 0;
cin >> n;
long a[n + 1], b[n];
int i = 0;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (b[i] >= a[i]) //勇者が強いとき
{
kill +=... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
long kill = 0;
cin >> n;
long a[n + 1], b[n];
int i = 0;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (b[i] >= a[i]) //勇者が強いとき
{
... | [
"variable_declaration.type.widen.change"
] | 768,663 | 768,664 | u503906942 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long ll;
ll A[100000];
ll B[100000];
int main(void) {
// Your code here!
int N;
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
ll total = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i] && (A... | #include <iostream>
using namespace std;
typedef long long ll;
ll A[100000];
ll B[100000];
int main(void) {
// Your code here!
int N;
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
ll total = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i] && (A... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 768,667 | 768,668 | u279137361 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 768,675 | 768,676 | u239409893 | 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++) {
if (a[i] <= b[i]) {
ans += a[i];
if (a[i + 1] >= b[i] - a[... | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
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];
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
... | [
"variable_declaration.type.widen.change"
] | 768,679 | 768,680 | u927804708 | 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 (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
int nokori = 0;
for (int i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n + 1); // モンスターの数
vector<long> b(n); // 倒せる数
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long sum = 0;
long nokori = 0;
for (int i = 0; i ... | [
"variable_declaration.type.primitive.change"
] | 768,681 | 768,682 | u272156237 | cpp |
p02959 | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int fight(int m[], int h[], int i, int j) {
int kill = 0;
if (m[i] >= h[j]) {
kill = h[j];
} else {
kill = m[i];
}
m[i] -= kill;
h[j] -= kill;
return kill;
}
int main() {
int num, ... | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int fight(int m[], int h[], int i, int j) {
int kill = 0;
if (m[i] >= h[j]) {
kill = h[j];
} else {
kill = m[i];
}
m[i] -= kill;
h[j] -= kill;
return kill;
}
int main() {
int num, ... | [
"variable_declaration.type.primitive.change",
"io.output.newline.add"
] | 768,683 | 768,684 | u145483532 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(void) {
int N, A[100004], B[100004], save, count = 0;
cin >> N;
for (int i = 0; i < (N + 1); i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
if (B[i] <= A[i])
count += B[i];
else if ((B[i] - A[i]) <= A[i + 1]) {
/... | #include <iostream>
using namespace std;
int main(void) {
long long N, A[100004], B[100004], count = 0;
cin >> N;
for (long long i = 0; i < (N + 1); i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
if (B[i] <= A[i])
count += B[i];
else if ((B[i] - A[i]) <= A[i + 1]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.remove",
"control_flow.loop.for.initializer.change"
] | 768,687 | 768,688 | u563743611 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, m;
long long mon[100000 + 5], hero[100000 + 5];
cin >> n;
m = n + 1;
for (int i = 0; i < m; i++) {
scanf("%lld", &mon[i]);
}
for (int i = 0; i < n; i++) {
scanf("%lld", &hero[i]);
}
int sum = 0;
for (int i = 0; i < n; i++) {
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, m;
long long mon[100000 + 5], hero[100000 + 5];
cin >> n;
m = n + 1;
for (int i = 0; i < m; i++) {
scanf("%lld", &mon[i]);
}
for (int i = 0; i < n; i++) {
scanf("%lld", &hero[i]);
}
long long sum = 0;
for (int i = 0; i < n; i+... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,689 | 768,690 | u333542501 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int N;
cin >> N;
int A[N + 1];
int B[N];
for (int i = 0; i < N + 1; i++)
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int N;
cin >> N;
int A[N + 1];
int B[N];
for (int i = 0; i < N + 1; i++)
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 768,691 | 768,692 | u911222357 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int N;
cin >> N;
int A[N + 1];
int B[N];
for (int i = 0; i < N + 1; i++)
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int N;
cin >> N;
int A[N + 1];
int B[N];
for (int i = 0; i < N + 1; i++)
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 768,693 | 768,692 | u911222357 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define NMAX 100000
#define MOD 1000000007
#define INF 2000000000
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
using namespace std;
int n;
int monsters[NMAX + 1];
int heroes[NMAX];
int main() {
cin >> n;
for (int... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define NMAX 100000
#define MOD 1000000007
#define INF 2000000000
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
using namespace std;
int n;
int monsters[NMAX + 1];
int heroes[NMAX];
int main() {
cin >> n;
for (int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,694 | 768,695 | u885932660 | cpp |
p02959 | #include <iostream>
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];
int total = 0;
for (int i = 0; i < N; ++i) {
cin >> B[i];
long m = min(A[i], B[i]);
total += m;
if (A[i] < B[i]) {
long nm = min(A[i + 1], B[i]... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N + 1], B[N];
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
long long total = 0;
for (int i = 0; i < N; ++i) {
cin >> B[i];
long long m = min(A[i], B[i]);
total += m;
if (A[i] < B[i]) {
long long nm... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 768,696 | 768,697 | u889423178 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1], b[N], ans = 0, k = 0;
for (int i = 0; i < N + 1; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
for (int i = 0; i < N; i++) {
k = min(a[i], b[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1], b[N], k = 0;
long long ans = 0;
for (int i = 0; i < N + 1; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
for (int i = 0; i < N; i++) {
k = ... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 768,698 | 768,699 | u548163222 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
count = 0;
cin >> N;
vector<long int> A(N + 1);
vector<long int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int yoryoku;
int total = 0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
count = 0;
cin >> N;
vector<long int> A(N + 1);
vector<long int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long int yoryoku;
long int total = 0;
for... | [
"variable_declaration.type.widen.change"
] | 768,702 | 768,703 | u906250335 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int n;
int *a, *b;
cin >> n;
a = new int[n + 1];
b = new int[n];
for (int i = 0; i < n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int n;
ll *a, *b;
cin >> n;
a = new ll[n + 1];
b = new ll[n];
for (int i = 0; i < n + ... | [
"variable_declaration.type.change",
"assignment.value.change"
] | 768,718 | 768,719 | u020230257 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
int killcnt = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
int kill = min... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
ll killcnt = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
ll kill = min(A... | [
"variable_declaration.type.change"
] | 768,720 | 768,721 | u779857052 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N + 1);
for (long long &a : A) {
cin >> a;
}
vector<long long> B(N);
for (long long &b : B) {
cin >> b;
}
long long ans = 0;
long long kill;
for (long long i = 0; i < N; i++) {
kil... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N + 1);
for (long long &a : A) {
cin >> a;
}
vector<long long> B(N);
for (long long &b : B) {
cin >> b;
}
long long ans = 0;
long long kill;
for (long long i = 0; i < N; i++) {
kil... | [
"assignment.change"
] | 768,726 | 768,727 | u618697411 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
vector<long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
if (a.at(i) + a.at(i + 1) <= b.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
vector<long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
if (a.at(i) + a.at(i + 1) <= b.at(... | [
"assignment.value.change"
] | 768,732 | 768,733 | u646051775 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev :oyhhhhhhyo:
#define next .sdNNNmNNNNNNNmds.
#define y0 -hNNNNy`yNNNNNN`/ Nh -
#define y1 mNNNNNd + dNNNNNN + sNNm
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev :oyhhhhhhyo:
#define next .sdNNNmNNNNNNNmds.
#define y0 -hNNNNy`yNNNNNN`/ Nh -
#define y1 mNNNNNd + dNNNNNN + sNNm
#de... | [] | 768,746 | 768,747 | u907194047 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long ll;
ll min(ll a, ll b) { return (a < b) ? a : b; }
int main(void) {
ll N;
cin >> N;
ll A[N + 1], B[N];
ll cnt = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N... | #include <iostream>
using namespace std;
typedef long long ll;
ll min(ll a, ll b) { return (a < b) ? a : b; }
int main(void) {
ll N;
cin >> N;
ll A[N + 1], B[N];
ll cnt = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 768,750 | 768,751 | u810075828 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll n, a[114514], b[114514];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i + 1 < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
ll x = min(a[i], b[i]);
ans += x;
b[... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll n, a[114514], b[114514];
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i <= n; i++) {
ll x = min(a[i], b[i]);
ans += x;
b[i]... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 768,770 | 768,771 | u628262476 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fi first
#define se second
#define de(x) cout << #x << "=" << x << endl;
#define dd(x) cout << #x << "=" << x << " ";
#define pb(x) push_b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fi first
#define se second
#define de(x) cout << #x << "=" << x << endl;
#define dd(x) cout << #x << "=" << x << " ";
#define pb(x) push_b... | [
"variable_declaration.type.change",
"assignment.change"
] | 768,774 | 768,775 | u518554680 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int monster[1000010];
int cnt;
int main() {
int n;
cin >> n;
int x;
for (x = 1; x <= n + 1; x++) {
cin >> monster[x];
}
int cnt = 0;
for (x = 1; x <= n; x++) {
int a;
cin >> a;
int kurang = min(a, monster[x]);
a -= kurang;
cnt += kurang... | #include <bits/stdc++.h>
using namespace std;
int monster[1000010];
int cnt;
int main() {
int n;
cin >> n;
int x;
for (x = 1; x <= n + 1; x++) {
cin >> monster[x];
}
long long cnt = 0;
for (x = 1; x <= n; x++) {
int a;
cin >> a;
int kurang = min(a, monster[x]);
a -= kurang;
cnt += ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,776 | 768,777 | u737838293 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> enemy(N + 1), hero(N);
for (int i = 0; i < N + 1; i++)
cin >> enemy.at(i);
for (int i = 0; i < N; i++)
cin >> hero.at(i);
int count = 0;
for (int i = 0; i < N; i++) {
if (hero.at(i) <= enemy.at(i))
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> enemy(N + 1), hero(N);
for (int i = 0; i < N + 1; i++)
cin >> enemy.at(i);
for (int i = 0; i < N; i++)
cin >> hero.at(i);
long count = 0;
for (int i = 0; i < N; i++) {
if (hero.at(i) <= enemy.at(i))
... | [
"variable_declaration.type.primitive.change"
] | 768,778 | 768,779 | u936602931 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 0, t;
vector<int> a;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> t;
a.push_back(t);
}
int b;
for (int i = 0; i < n; i++) {
cin >> b;
if (b <= a[i]) {
ans +... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, ans = 0, t;
vector<int> a;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> t;
a.push_back(t);
}
int b;
for (int i = 0; i < n; i++) {
cin >> b;
if (b <= a[i]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,780 | 768,781 | u819402602 | cpp |
p02959 | #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
... | #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,782 | 768,783 | u066917439 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n, a[100010], b[100010], last, ans;
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
last = b[0] - min(b[0], a[0]);
ans += min(a[0], b[0]);
for (int i = 1; i <= n; i++) {
ans += min(a[i], l... | #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], b[100010], last, ans;
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
last = b[0] - min(b[0], a[0]);
ans += min(a[0], b[0]);
for (int i = 1; i <= n; i++) {
ans += min(a... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,784 | 768,785 | u966582222 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n; i < (ll)(... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n; i < (ll)(... | [
"assignment.change"
] | 768,786 | 768,787 | u898167769 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n; i < (ll)(... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n; i < (ll)(... | [
"assignment.change"
] | 768,788 | 768,787 | u898167769 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
void Say(bool say, string a = "Yes", string b = "No") {
cout << (say ? a : b) << endl;
};
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1, 0), B(N, 0);
for (ll i = 0; i < N + 1; i++)
cin >> A[i];
for (ll i = 0; i < N; i++)
cin >> ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
void Say(bool say, string a = "Yes", string b = "No") {
cout << (say ? a : b) << endl;
};
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1, 0), B(N, 0);
for (ll i = 0; i < N + 1; i++)
cin >> A[i];
for (ll i = 0; i < N; i++)
cin >> ... | [
"assignment.change"
] | 768,789 | 768,790 | u480892088 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
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];
}
long long res = 0;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
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];
}
long long res = 0;
for (int i = 0; i ... | [
"assignment.change"
] | 768,791 | 768,792 | u959960486 | cpp |
p02959 | #include <bits/stdc++.h>
#define task "C"
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define pb push_back
#define F first
#define S second
using ll = long long;
using ld = long double;
using ull = unsigned long long... | #include <bits/stdc++.h>
#define task "C"
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define pb push_back
#define F first
#define S second
using ll = long long;
using ld = long double;
using ull = unsigned long long... | [
"assignment.add"
] | 768,797 | 768,798 | u792559418 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mod 1000000007
#define mod1 998244353
#define timepass 1073741824
#define MAXN 200000 + 5
#define LOGN 20
#define over ((1ll << 32))
using namespace std;
#define N 2005
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mod 1000000007
#define mod1 998244353
#define timepass 1073741824
#define MAXN 200000 + 5
#define LOGN 20
#define over ((1ll << 32))
using namespace std;
#define N 2005
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.... | [
"assignment.change"
] | 768,801 | 768,802 | u043151323 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
... | [
"assignment.change"
] | 768,803 | 768,804 | u179395482 | cpp |
p02959 | // atcoder/abc135/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | // atcoder/abc135/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | [
"assignment.change"
] | 768,805 | 768,806 | u768334187 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
//#define int ll
#define sz size()
#define x first
#define y second
#define pi pair<int, int>
#define pii pair<pi, int>
#define vi vector<int>
... | #include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define int ll
#define sz size()
#define x first
#define y second
#define pi pair<int, int>
#define pii pair<pi, int>
#define vi vector<int>
co... | [] | 768,807 | 768,808 | u392848063 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
#define l... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
#define l... | [
"assignment.change"
] | 768,809 | 768,810 | u920844524 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
const int ac = 1e6 + 6;
int A[ac];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> A[i];
long long s = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
s += min(x, A[i]);
x -... | #include <bits/stdc++.h>
using namespace std;
const int ac = 1e6 + 6;
int A[ac];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> A[i];
long long s = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
s += min(x, A[i]);
x -... | [
"assignment.variable.change"
] | 768,811 | 768,812 | u856010815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
an... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll 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 ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
ans +... | [
"variable_declaration.type.change"
] | 768,813 | 768,814 | u849073847 | 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 (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >= b.at(i))
count ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int long> a(n + 1);
vector<int long> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int long count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >= b.at(i... | [
"variable_declaration.type.widen.change"
] | 768,819 | 768,820 | u366974105 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef _MSC_VER
using ll = __int64;
using ull = unsigned ... | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef _MSC_VER
using ll = __int64;
using ull = unsigned ... | [
"variable_declaration.type.change"
] | 768,821 | 768,822 | u609688888 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define INF 1LL << 62
#define FLT_INF pow(10.0, 16)
using ll = long long;
using vll = vector<ll>;
using ull = unsigned long long;
using int2 = pair<int, int>;
using int3 = tuple<ll, ll, ll>;
template <typename A> string to_str... | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define INF 1LL << 62
#define FLT_INF pow(10.0, 16)
using ll = long long;
using vll = vector<ll>;
using ull = unsigned long long;
using int2 = pair<int, int>;
using int3 = tuple<ll, ll, ll>;
template <typename A> string to_str... | [
"assignment.change"
] | 768,823 | 768,824 | u037182465 | cpp |
p02959 | #include <iostream>
using namespace std;
int n, ans;
int main() {
cin >> n;
long 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 (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0;
... | #include <iostream>
using namespace std;
long n, ans;
int main() {
cin >> n;
long 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 (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0L... | [
"variable_declaration.type.primitive.change",
"literal.number.type.widen.change"
] | 768,827 | 768,828 | u612175324 | cpp |
p02959 | #include <iostream>
using namespace std;
int n, ans;
int main() {
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];
for (int i = 0; i < n; i++) {
if (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0;
... | #include <iostream>
using namespace std;
long n, ans;
int main() {
cin >> n;
long 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 (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0L... | [
"variable_declaration.type.primitive.change",
"literal.number.type.widen.change"
] | 768,830 | 768,828 | u612175324 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7, INF = 1e17;
const int iINF = 1e9;
bool comp(int a, int b) { return a < b; }
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7, INF = 1e17;
const int iINF = 1e9;
bool comp(int a, int b) { return a < b; }
int main() {
ll 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++)... | [
"variable_declaration.type.change"
] | 768,831 | 768,832 | u952437626 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_ba... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_ba... | [
"variable_declaration.type.change"
] | 768,835 | 768,836 | u403647978 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define pint pair<int, int>
#define mp make_pair
using namespace std;
typedef long lon... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define pint pair<int, int>
#define mp make_pair
using namespace std;
typedef long lon... | [
"variable_declaration.type.change"
] | 768,837 | 768,838 | u220922076 | cpp |
p02959 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#in... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#in... | [
"variable_declaration.type.primitive.change"
] | 768,839 | 768,840 | u637284188 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.