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 <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define rep(i, x, n) for (int(i) = (x); (i) < (n); (i)++)
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<long> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if (b[i] >... |
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define rep(i, x, n) for (int(i) = (x); (i) < (n); (i)++)
using namespace std;
int main() {
int n;
long ans = 0;
cin >> n;
vector<long> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if ... | [
"variable_declaration.type.widen.change"
] | 767,732 | 767,733 | u926025622 | cpp |
p02959 |
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define rep(i, x, n) for (int(i) = (x); (i) < (n); (i)++)
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vi a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if (b[i] >= a[i]) {
... |
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define rep(i, x, n) for (int(i) = (x); (i) < (n); (i)++)
using namespace std;
int main() {
int n;
long ans = 0;
cin >> n;
vector<long> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if ... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.change"
] | 767,734 | 767,733 | u926025622 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"assignment.change"
] | 767,735 | 767,736 | u266346465 | cpp |
p02959 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
scanf("%d", &n);
int a[n + 1], b[n];
REP(i, n +... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
scanf("%d", &n);
int a[n + 1], b[n];
REP(i, n +... | [
"variable_declaration.type.change"
] | 767,737 | 767,738 | u283907492 | cpp |
p02959 | #include <algorithm>
#include <assert.h>
#include <climits> // LLONG_MAX, LLONG_MIN, INT_MIN, INT_MAX
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <util... | #include <algorithm>
#include <assert.h>
#include <climits> // LLONG_MAX, LLONG_MIN, INT_MIN, INT_MAX
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <util... | [
"variable_declaration.type.primitive.change"
] | 767,743 | 767,744 | u703205079 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int subToZero(int a, int b) { return max(0, a - b); }
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int subToZero(int a, int b) { return max(0, a - b); }
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N... | [
"variable_declaration.type.change"
] | 767,747 | 767,748 | u848433916 | 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 kill = 0;
for (int i = 0; i < n - 1; i++) {
if (b[i] > a[i] + a[i + 1]) {
kill += a[i] + a[i... | #include <iostream>
using namespace std;
int main() {
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 int kill = 0;
for (int i = 0; i < n - 1; i++) {
if (b[i] > a[i] + a[i + 1]) {
kill += ... | [
"variable_declaration.type.widen.change"
] | 767,749 | 767,750 | u641659912 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int64_t sum_(vector<int> v) {
int64_t total = 0;
for (int v_ : v) {
total += v_;
}
return total;
}
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
for (int n = 0; n < N + 1; n++) {
cin >> cities.at(n);
}
int64_t enemies = sum_(cities);... | #include <bits/stdc++.h>
using namespace std;
int64_t sum_(vector<int> v) {
int64_t total = 0;
for (int v_ : v) {
total += v_;
}
return total;
}
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
for (int n = 0; n < N + 1; n++) {
cin >> cities.at(n);
}
int64_t enemies = sum_(cities);... | [
"expression.operation.binary.remove"
] | 767,752 | 767,753 | u259585438 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int sum_(vector<int> v) {
int total = 0;
for (int v_ : v) {
total += v_;
}
return total;
}
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
for (int n = 0; n < N + 1; n++) {
cin >> cities.at(n);
}
int64_t enemies = sum_(cities);
vecto... | #include <bits/stdc++.h>
using namespace std;
int64_t sum_(vector<int> v) {
int64_t total = 0;
for (int v_ : v) {
total += v_;
}
return total;
}
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
for (int n = 0; n < N + 1; n++) {
cin >> cities.at(n);
}
int64_t enemies = sum_(cities);... | [
"function.return_type.change",
"variable_declaration.type.primitive.change"
] | 767,754 | 767,753 | u259585438 | 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 tmp = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
if (tmp + B[i] > A[i]) {
cnt ... |
#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 tmp = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
if (tmp + B[i] > A[i]) {
c... | [
"variable_declaration.type.primitive.change"
] | 767,762 | 767,763 | u883725898 | 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 tmp = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
if (tmp + B[i] > A[i]) {
cnt ... |
#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 tmp = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
if (tmp + B[i] > A[i]) {
c... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 767,764 | 767,763 | u883725898 | cpp |
p02959 | #include <iostream>
using namespace std;
int n;
int a[100001], b[100000];
long long int ans;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++) {
scanf("%d", a[i]);
}
int temp = 0;
ans = 0;
for (int i = 0; i < n; i++) {
scanf("%d", b[i]);
ans += min(temp, a[i]);
a[i] -= temp;
a[i] ... | #include <iostream>
using namespace std;
int n;
int a[100001], b[100000];
long long int ans;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
int temp = 0;
ans = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
ans += min(temp, a[i]);
a[i] -= temp;
a[i... | [
"expression.operation.unary.reference.add"
] | 767,769 | 767,770 | u134181243 | cpp |
p02959 | #include <iostream>
using namespace std;
int n;
int a[100001], b[100000];
int ans;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int temp = 0;
ans = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
ans += min(temp, a[i]);
a[i] -= temp;
a[i] = max(a[i], 0);
an... | #include <iostream>
using namespace std;
int n;
int a[100001], b[100000];
long long int ans;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int temp = 0;
ans = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
ans += min(temp, a[i]);
a[i] -= temp;
a[i] = max(a[i], ... | [
"variable_declaration.type.widen.change"
] | 767,771 | 767,772 | u309508171 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int tmp;
int num;
vector<int> a;
vector<int> b;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int tmp;
long long int num = 0;
vector<int> a;
vector<int> b;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.pus... | [
"variable_declaration.value.change"
] | 767,775 | 767,776 | u755310927 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | [
"expression.operation.binary.remove"
] | 767,788 | 767,789 | u509680664 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> mons(N + 1);
vector<int> yusya(N);
for (int i = 0; i < N + 1; i++) {
cin >> mons.at(i);
}
int total = 0; //勇者が最大で倒せるモンスターの数
for (int i = 0; i < N; i++) {
cin >> yusya.at(i);
total += yusya.at(i);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> mons(N + 1);
vector<int> yusya(N);
for (int i = 0; i < N + 1; i++) {
cin >> mons.at(i);
}
int64_t total = 0; //勇者が最大で倒せるモンスターの数
for (int i = 0; i < N; i++) {
cin >> yusya.at(i);
total += yusya.at(i);
... | [
"variable_declaration.type.primitive.change"
] | 767,790 | 767,791 | u521652313 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n;... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n;... | [
"variable_declaration.type.change"
] | 767,792 | 767,793 | u655777757 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long ans = 0, k;
for (int i = 0; i < n; i++) {
k = min(a.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long ans = 0, k;
for (int i = 0; i < n; i++) {
k = min(a.... | [
"assignment.change"
] | 767,797 | 767,798 | u111600809 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long ans = 0, k;
for (int i = 0; i < n; i++) {
k = min(a.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long ans = 0, k;
for (int i = 0; i < n; i++) {
k = min(a.... | [
"assignment.change"
] | 767,799 | 767,798 | u111600809 | cpp |
p02959 | #include <iostream>
#include <vector>
int main(int argc, char **argv) {
int N;
std::cin >> N;
std::vector<long long> A(N + 1);
std::vector<long long> B(N);
for (int i = 0; i <= N; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
int ans = 0;
for (int i = 0; i <... | #include <iostream>
#include <vector>
int main(int argc, char **argv) {
int N;
std::cin >> N;
std::vector<long long> A(N + 1);
std::vector<long long> B(N);
for (int i = 0; i <= N; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
long long ans = 0;
for (int i = ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,800 | 767,801 | u922974720 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
#define in(x) cin >> x
#define out(x) cout << x
#define outn(x) cout << x << '\n'
#define outs(x) cout << x << ' '
#define rep(i, s, e) f... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
#define in(x) cin >> x
#define out(x) cout << x
#define outn(x) cout << x << '\n'
#define outs(x) cout << x << ' '
#define rep(i, s, e) f... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 767,805 | 767,806 | u757628628 | 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; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
int c = min(a[i], b[i]);
a[i] -= c;
b[i] ... | #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; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll sum = 0;
for (int i = 0; i < n; i++) {
int c = min(a[i], b[i]);
... | [
"variable_declaration.type.change"
] | 767,814 | 767,815 | u881599732 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long int lld;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(15);
cout << fixed;
int n = 0;
cin >> n;
int ans = 0;
vector<int> vec(n + 1);
for (in... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long int lld;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(15);
cout << fixed;
int n = 0;
cin >> n;
lld ans = 0;
vector<int> vec(n + 1);
for (in... | [
"variable_declaration.type.change"
] | 767,816 | 767,817 | u835820697 | 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 cnt = 0;
for (int i = 0; i < n; i++) {
if (A[i] <= B[i]) {
cnt += 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 long cnt = 0;
for (int i = 0; i < n; i++) {
if (A[i] <= B[i]) {
cnt += A[i];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,818 | 767,819 | u747390421 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int sum = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < b[i]) {
sum += a[i];
if... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<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 sum = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < b[i]) {
sum += a[i];
... | [
"variable_declaration.type.primitive.change"
] | 767,822 | 767,823 | u541963880 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> cities(n + 1);
vector<long long> heros(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> cities[i];
}
for (int i = 0; i < n; i++) {
cin >> heros[i];
}
heros[n + 1] =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> cities(n + 1);
vector<long long> heros(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> cities[i];
}
for (int i = 0; i < n; i++) {
cin >> heros[i];
}
heros[n] = 0;
... | [
"expression.operation.binary.remove"
] | 767,824 | 767,825 | u629133942 | 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 count = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
count += B[i];
} else {
... | #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];
}
long count = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
count += B[i];
} else {
... | [
"variable_declaration.type.primitive.change"
] | 767,826 | 767,827 | u895409580 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a, b;
rep(i, n + 1) {
int aa;
cin >> aa;
a.push_back(aa);
}
rep(i, n) {
int bb;
cin >> bb;
b.push_back(bb);
}
int ans ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a, b;
rep(i, n + 1) {
ll aa;
cin >> aa;
a.push_back(aa);
}
rep(i, n) {
ll bb;
cin >> bb;
b.push_back(bb);
}
ll ans = 0;... | [
"variable_declaration.type.change"
] | 767,828 | 767,829 | u762183504 | cpp |
p02959 | #include <iostream>
using namespace std;
int A[100005];
int B[100005];
int main() {
int N;
cin >> 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 temp = B[i];
if (temp <= A[i]) {
ans... | #include <iostream>
using namespace std;
int A[100005];
int B[100005];
int main() {
int N;
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 ans = 0;
for (int i = 0; i < N; ++i) {
int temp = B[i];
if (temp <= A[i]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,840 | 767,841 | u352969025 | cpp |
p02959 | #include <iostream>
using namespace std;
int A[100005];
int B[100005];
int main() {
int N;
cin >> 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 temp = B[i];
if (temp <= A[i]) {
ans +... | #include <iostream>
using namespace std;
int A[100005];
int B[100005];
int main() {
int N;
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 ans = 0;
for (int i = 0; i < N; ++i) {
int temp = B[i];
if (temp <= A[i]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.add"
] | 767,842 | 767,841 | u352969025 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<ll> vec;
int main() {
int N;
cin >> N;
vec A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll cnt = 0;
if (B[0] >= A[0]) {
cnt += A[0];
B[0]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<ll> vec;
int main() {
int N;
cin >> N;
vec A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll cnt = 0;
if (B[0] >= A[0]) {
cnt += A[0];
B[0]... | [
"assignment.change"
] | 767,853 | 767,854 | u782219335 | cpp |
p02959 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
long monsters[N];
rep(i, N + 1) cin >> monsters[i];
long heros[N];
rep(i, N) cin >> heros[i];
int ans = 0;
rep(i, N) {
int left = min(monsters[i], heros[i]);
ans += left;
mo... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int monsters[N];
rep(i, N + 1) cin >> monsters[i];
int heros[N];
rep(i, N) cin >> heros[i];
long ans = 0;
rep(i, N) {
int left = min(monsters[i], heros[i]);
ans += left;
mon... | [
"variable_declaration.type.primitive.change"
] | 767,855 | 767,856 | u323327162 | cpp |
p02959 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int monsters[N];
rep(i, N + 1) cin >> monsters[i];
int heros[N];
rep(i, N) cin >> heros[i];
int ans = 0;
rep(i, N) {
int left = min(monsters[i], heros[i]);
ans += left;
mons... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int monsters[N];
rep(i, N + 1) cin >> monsters[i];
int heros[N];
rep(i, N) cin >> heros[i];
long ans = 0;
rep(i, N) {
int left = min(monsters[i], heros[i]);
ans += left;
mon... | [
"variable_declaration.type.primitive.change"
] | 767,857 | 767,856 | u323327162 | cpp |
p02959 | #include <algorithm>
#include <cstdio>
using namespace std;
int N, monster[100001];
int main() {
scanf("%d", &N);
for (int i = 0; i < N + 1; i++)
scanf("%d", &monster[i]);
int ret = 0;
int tmp = 0;
int x;
for (int i = 0; i < N; i++) {
scanf("%d", &x);
tmp = min(monster[i], x);
ret += tmp;... | #include <algorithm>
#include <cstdio>
using namespace std;
int N, monster[100001];
int main() {
scanf("%d", &N);
for (int i = 0; i < N + 1; i++)
scanf("%d", &monster[i]);
long long ret = 0;
int tmp = 0;
int x;
for (int i = 0; i < N; i++) {
scanf("%d", &x);
tmp = min(monster[i], x);
ret +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,858 | 767,859 | u962441451 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> A, B;
cin >> N;
for (int i = 0; i <= N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < N; ++i) {
int b;
cin >> b;
B.push_back(b);
}
int ans = 0;
for (int i = N - 1; i >=... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> A, B;
cin >> N;
for (int i = 0; i <= N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < N; ++i) {
int b;
cin >> b;
B.push_back(b);
}
long long ans = 0;
for (int i = N - 1... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,862 | 767,863 | u128142352 | cpp |
p02959 | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, n, ans = 0;
scanf("%lld", &n);
ll a[n + 1], b[n];
for (i = 0; i <= n; ++i)
scanf("%lld", &a[i]);
for (i = 0; i < n; ++i)
scanf("%lld", &b[i]);
for (i = 0; i < n; ++i) {
if (a[i] <= b[i])
ans += a[i], b[i] -= a[i];
e... | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, n, ans = 0;
scanf("%lld", &n);
ll a[n + 1], b[n];
for (i = 0; i <= n; ++i)
scanf("%lld", &a[i]);
for (i = 0; i < n; ++i)
scanf("%lld", &b[i]);
for (i = 0; i < n; ++i) {
if (a[i] <= b[i])
ans += a[i], b[i] -= a[i];
e... | [
"assignment.value.change"
] | 767,864 | 767,865 | u440920318 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | [
"expression.operation.binary.remove"
] | 767,869 | 767,870 | u318785595 | cpp |
p02959 | #include <iostream>
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 = 0; i < n; i++) {
if (a[i] <= b[i]) {
b[i] -= a[i];
if (a[i + 1] > b[i]) ... | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
int a[n + 1];
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 = 0; i < n; i++) {
if (a[i] <= b[i]) {
b[i] -= a[i];
i... | [
"variable_declaration.type.widen.change"
] | 767,871 | 767,872 | u832158848 | cpp |
p02959 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 767,878 | 767,879 | u450096124 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (auto &v : A) {
cin >> v;
}
vector<int> B(N);
for (auto &v : B) {
cin >> v;
}
int ans = 0;
int sub = 0;
for (int i = 0; i < N; ++i) {
ans += min(sub + B[i], A[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (auto &v : A) {
cin >> v;
}
vector<ll> B(N);
for (auto &v : B) {
cin >> v;
}
ll ans = 0;
ll sub = 0;
for (int i = 0; i < N; ++i) {
ans += min(sub + B[i], A[i]);
... | [
"variable_declaration.type.change"
] | 767,880 | 767,881 | u489326854 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int ans = 0;
for (int i = 0; i < ... | [
"variable_declaration.type.widen.change"
] | 767,891 | 767,892 | u537874719 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int monster = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] <= b[i]) { //オーバーキル
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long monster = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] <= b[i]) { /... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,893 | 767,894 | u460608786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int ... | [
"variable_declaration.type.change"
] | 767,900 | 767,901 | u339937125 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define rep(i,... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define rep(i,... | [
"variable_declaration.type.change"
] | 767,904 | 767,905 | u110653681 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
float A[100010];
float B[100010];
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
float ans = 0;
for (int i = 0; i < N; i++) {
bool flg = true;
int f = 0;
int life = 0;
wh... | #include <iostream>
using namespace std;
int main() {
int N;
long A[100010];
long B[100010];
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long ans = 0;
for (int i = 0; i < N; i++) {
bool flg = true;
int f = 0;
int life = 0;
while... | [
"variable_declaration.type.primitive.change"
] | 767,909 | 767,910 | u907876524 | cpp |
p02959 | /*
* created : 2019-08-05 00:11:26
* accepted : 2019-08-05 00:17:42
* author : landcold7
*/
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#ifndef LOCAL
#define trace(...)
#endif
typedef long long ll;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0... | /*
* created : 2019-08-05 00:11:26
* accepted : 2019-08-05 00:17:42
* author : landcold7
*/
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#ifndef LOCAL
#define trace(...)
#endif
typedef long long ll;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0... | [
"variable_declaration.type.change"
] | 767,912 | 767,913 | u161007542 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
int monst[n + 1];
int defeat[n];
int def = 0;
for (int i = 0; i <= n; i++) {
cin >> monst[i];
}
for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
int monst[n + 1];
int defeat[n];
long long int def = 0;
for (int i = 0; i <= n; i++) {
cin >> monst[i];
}... | [
"variable_declaration.type.widen.change"
] | 767,914 | 767,915 | u219241981 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
int monst[n + 1];
int defeat[n];
int def = 0;
for (int i = 0; i <= n; i++) {
cin >> monst[i];
}
for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
long long int monst[n + 1];
long long int defeat[n];
long long int def = 0;
for (int i = 0; i <= n; i++) {
... | [
"variable_declaration.type.widen.change"
] | 767,914 | 767,917 | u219241981 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &i : a) {
cin >> i;
}
vector<int> b(n);
for (auto &i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &i : a) {
cin >> i;
}
vector<int> b(n);
for (auto &i... | [
"expression.operation.binary.remove"
] | 767,918 | 767,919 | u830782448 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[N + 1];
int B;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
int ckill = 0;
for (int i = 0; i < N; i++) {
cin >> B;
if (A[i] - B >= 0) {
c... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[N + 1];
int B;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
long long ckill = 0;
for (int i = 0; i < N; i++) {
cin >> B;
if (A[i] >= B) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 767,922 | 767,923 | u236809838 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, a, n) for (int i = (a); i < (n); i++)
int n;
int a[100010];
// int b[100010];
int main() {
cin >> n;
rep(i, n + 1) cin >> a[i];
int ans = 0;
rep(i, n) {
int b;
cin >> b;
int c1 = min(a[i], b);
int c2 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) REP(i, 0, n)
#define REP(i, a, n) for (int i = (a); i < (n); i++)
int n;
int a[100010];
// int b[100010];
int main() {
cin >> n;
rep(i, n + 1) cin >> a[i];
ll ans = 0;
rep(i, n) {
int b;
cin >> b;
int c1 = min... | [
"variable_declaration.type.change"
] | 767,924 | 767,925 | u227951688 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 767,932 | 767,933 | u726501606 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n, mon = 0;
cin >> n;
vector<int> a(n + 1), b(n), f(n), g(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (i == 0) {
f[0] = min(a[0], b[0]);
g[0] = min(a[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
long n, mon = 0;
cin >> n;
vector<long> a(n + 1), b(n), f(n), g(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (i == 0) {
f[0] = min(a[0], b[0]);
g[0] = min(... | [
"variable_declaration.type.primitive.change"
] | 767,934 | 767,935 | u530358777 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, res = 0;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (B[i] >= A[i]) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, res = 0;
cin >> N;
vector<long long> A(N + 1);
vector<long long> 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 (B[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,938 | 767,939 | u426506117 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, res = 0, minAB = 0;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, res = 0, minAB = 0;
cin >> N;
vector<long long> A(N + 1);
vector<long long> 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... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,940 | 767,941 | u426506117 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, d;
cin >> n;
c = 0;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
if (b.at(i) - a.at(i) > 0) {
c += a.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n;
long long c = 0;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
if (b.at(i) - a.at(i) > 0) {
c... | [
"variable_declaration.remove"
] | 767,942 | 767,943 | u222866518 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, count = 0, save;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, save;
ll count = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 767,946 | 767,947 | u861337693 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, t;
int k = 0;
vector<long long> a;
vector<long long> b;
cin >> n;
for (i = 0; i < n + 1; i = i + 1) {
cin >> t;
a.push_back(t);
}
for (i = 0; i < n; i = i + 1) {
cin >> t;
b.push_back(t);
}
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, t;
long long k = 0;
vector<long long> a;
vector<long long> b;
cin >> n;
for (i = 0; i < n + 1; i = i + 1) {
cin >> t;
a.push_back(t);
}
for (i = 0; i < n; i = i + 1) {
cin >> t;
b.push_back(t);
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,954 | 767,955 | u854243627 | cpp |
p02959 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>... | [
"literal.number.type.widen.change"
] | 767,956 | 767,957 | u725458677 | cpp |
p02959 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 767,958 | 767,957 | u725458677 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define INF 1e9
typedef long long LL;
int main() {
LL N;
cin >> N;
vector<LL> A(N + 1);
rep(i, N + 1) cin >> A[i];
vector<LL> B(N);
rep(i, N) cin >> B[i];
LL answer = 0;
rep(i, N + 1) {
LL rest = min(A[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define INF 1e9
typedef long long LL;
int main() {
LL N;
cin >> N;
vector<LL> A(N + 1);
rep(i, N + 1) cin >> A[i];
vector<LL> B(N);
rep(i, N) cin >> B[i];
LL answer = 0;
rep(i, N) {
LL rest = min(A[i], B[... | [
"expression.operation.binary.remove"
] | 767,963 | 767,964 | u293072892 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
cin >> n;
vector<long long> A(n + 1);
vector<long long> B(n);
for (i = 0; i < n + 1; i++)
cin >> A[i];
for (i = 0; i < n; i++)
cin >> B[i];
int num = 0; //"num" is the number of killed monsters
for (i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
cin >> n;
vector<long long> A(n + 1);
vector<long long> B(n);
for (i = 0; i < n + 1; i++)
cin >> A[i];
for (i = 0; i < n; i++)
cin >> B[i];
long long num = 0; //"num" is the number of killed monsters
for (i = 0; i < n; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,965 | 767,966 | u632637990 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n + 1];
int *b = new int[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int z = b[0];
int ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n + 1];
int *b = new int[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int z = b[0];
long long ans = 0;
for (int i = 0; i < n; i++) {
if (b[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,967 | 767,968 | u769569814 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
int n = 0, a[100000], b[100000], ans = 0;
int main() {
std::cin >> n;
for (int i = 0; i <= n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans... | #include <algorithm>
#include <iostream>
#include <string>
int n = 0, a[100001], b[100000];
long long ans = 0;
int main() {
std::cin >> n;
for (int i = 0; i <= n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 767,969 | 767,970 | u058498493 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
long long A[100010], B[100010];
cin >> N;
int count = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
if (B[i] > A[i] + A[i ... | #include <iostream>
using namespace std;
int main() {
int N;
long long A[100010], B[100010];
cin >> N;
long long count = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
if (B[i] > A[i] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,973 | 767,974 | u879436400 | cpp |
p02959 | #include <bits/stdc++.h>
#define mod 1000000007
#define mod998 998244353
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int, int>
typedef long long ll;
using namespace std;
int N, A[100001], B[100000];
ll res;
int main() {
cin... | #include <bits/stdc++.h>
#define mod 1000000007
#define mod998 998244353
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int, int>
typedef long long ll;
using namespace std;
int N, A[100001], B[100000];
ll res;
int main() {
cin... | [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 767,975 | 767,976 | u015514760 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1... | [
"assignment.change"
] | 767,977 | 767,978 | u677421794 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll x, ll y) { return x * y / GCD(x, y); }
int main() {
int n;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll x, ll y) { return x * y / GCD(x, y); }
int main() {
int n;
cin >> ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 767,979 | 767,980 | u560381579 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> arr[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
sum += min(arr[i], v);
v -= arr[i];
if (v > 0) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> arr[i];
}
long sum = 0;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
sum += min(arr[i], v);
v -= arr[i];
if (v > 0) {
... | [
"variable_declaration.type.primitive.change"
] | 767,981 | 767,982 | u965336480 | cpp |
p02959 | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) \
if (flagdebu... | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) \
if (flagdebu... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 767,985 | 767,986 | u561976793 | cpp |
p02959 | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
//#define debug(a) if(flagdebug){cout << "debug (" #a "):" << endl << (a) <<
//endl;}
typedef ... | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
//#define debug(a) if(flagdebug){cout << "debug (" #a "):" << endl << (a) <<
//endl;}
typedef ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 767,987 | 767,988 | u561976793 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 767,991 | 767,992 | u767543103 | cpp |
p02959 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define i64 long long
#define vi32 vector<int>
#define vi64 vector<long long>
#define ii pair<int... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define i64 long long
#define vi32 vector<int>
#define vi64 vector<long long>
#define ii pair<int... | [
"variable_declaration.type.change"
] | 768,005 | 768,006 | u215146318 | cpp |
p02959 | #include <bits/stdc++.h>
#define S second
#define F first
#define ld I64d
#include <cstdio>
#ifdef DEBUG
#define D(X) X
#else
#define D(X)
#endif
#define mehh \
ios::sync_with_stdio(0); \
cin.tie(0)... | #include <bits/stdc++.h>
#define S second
#define F first
#define ld I64d
#include <cstdio>
#ifdef DEBUG
#define D(X) X
#else
#define D(X)
#endif
#define mehh \
ios::sync_with_stdio(0); \
cin.tie(0)... | [
"identifier.change",
"variable_declaration.type.change"
] | 768,007 | 768,008 | u620252570 | cpp |
p02959 | #include <algorithm>
#include <iostream>
constexpr int MAX_N = 100000;
int main() {
int N;
int A[MAX_N + 1];
int B;
std::cin >> N;
for (int i = 0; i < N + 1; ++i) {
std::cin >> A[i];
}
long long max_attack = 0;
for (int i = 0; i < N; ++i) {
std::cin >> B;
int attack1 = std::max(A[i], B);
... | #include <algorithm>
#include <iostream>
constexpr int MAX_N = 100000;
int main() {
int N;
int A[MAX_N + 1];
int B;
std::cin >> N;
for (int i = 0; i < N + 1; ++i) {
std::cin >> A[i];
}
long long max_attack = 0;
for (int i = 0; i < N; ++i) {
std::cin >> B;
int attack1 = std::min(A[i], B);
... | [
"misc.opposites",
"identifier.change"
] | 768,009 | 768,010 | u123023461 | cpp |
p02959 | #include <iostream>
using namespace std;
int a[100000];
int b, c;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> b;
int s = 0;
if (a[i] >= b) {
s = b;
a[i] -= b;
} else if (a[i + 1] + a[i]... | #include <iostream>
using namespace std;
int a[100000];
int b, c;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
cin >> b;
int s = 0;
if (a[i] >= b) {
s = b;
a[i] -= b;
} else if (a[i + 1] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,014 | 768,015 | u422831867 | cpp |
p02959 | #include <iostream>
using namespace std;
int a[100000];
int b, c;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> b;
int s = 0;
if (a[i] >= b) {
s = b;
a[i] -= b;
} else {
if (a[i + 1... | #include <iostream>
using namespace std;
int a[100000];
int b, c;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
cin >> b;
int s = 0;
if (a[i] >= b) {
s = b;
a[i] -= b;
} else if (a[i + 1] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,016 | 768,015 | u422831867 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (auto i = 0; i < N + 1; i++)
cin >> A[i];
for (auto i = 0; i < N; i++)
cin >> B[i];
int m = 0;
for (auto i = 0; i < N; i++) {
if (A[i] <= B[i]) {
m +=... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (auto i = 0; i < N + 1; i++)
cin >> A[i];
for (auto i = 0; i < N; i++)
cin >> B[i];
long long m = 0;
for (auto i = 0; i < N; i++) {
if (A[i] <= ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,017 | 768,018 | u407539638 | cpp |
p02959 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for... | [
"variable_declaration.type.widen.change"
] | 768,021 | 768,022 | u107555502 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, i = 0;
std::cin >> n;
int a[n + 1] = {}, b[n] = {};
long ans = 0;
for (i; i <= n; i++)
cin >> a[i];
for (i; i < n; i++)
cin >> b[i];
for (i; i < n; i++) {
int left = min(a[i], b[i]);
ans += left;
a[i] -=... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, i = 0;
std::cin >> n;
int a[n + 1] = {}, b[n] = {};
long ans = 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++) {
int left = min(a[i], b[i]);
ans += left;... | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 768,025 | 768,026 | u332153950 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<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 beat1 = min(a[i], b[i]);
cnt += beat1;
b[i] -= beat1;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, cnt = 0;
cin >> n;
vector<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 beat1 = min(a[i], b[i]);
cnt += beat1;
b[i] -= ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,027 | 768,028 | u803893892 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long 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];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long 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];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,031 | 768,032 | u745852541 | 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 += a[i];
b[i] -= a[i];... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long 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];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,033 | 768,032 | u745852541 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long ans = 0;
cin >> n;
vector<long long> a(n + 1), b(n);
for (long long i = 0; i <= n; i++) {
cin >> a[i];
}
for (long long i = 0; i < n; i++) {
cin >> b[i];
}
for (long long i = 0; i < n; i++) {
long long tmp =... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long ans = 0;
cin >> n;
vector<long long> a(n + 1), b(n);
for (long long i = 0; i <= n; i++) {
cin >> a[i];
}
for (long long i = 0; i < n; i++) {
cin >> b[i];
}
for (long long i = 0; i < n; i++) {
long long tmp =... | [
"assignment.change"
] | 768,034 | 768,035 | u460426711 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::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];
}
int sum = 0;
for (int i = 0; i < n; ++i) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
long long sum = 0;
for (int i = 0; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,038 | 768,039 | u089207262 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (... | [] | 768,040 | 768,041 | u576106056 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int n;
int a[100001];
int b[100001];
int ans;
int main() {
cin >> n;
for (int i = 0; i < (n + 1); i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ans = 0;
int diff = 0;
for (int i = 0; i < n; i++) {
ans += min... | #include <algorithm>
#include <iostream>
using namespace std;
int n;
int a[1000000];
int b[1000000];
long long ans;
int main() {
cin >> n;
for (int i = 0; i < (n + 1); i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ans = 0;
int diff = 0;
for (int i = 0; i < n; i++) {
an... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,057 | 768,058 | u160754729 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
count += B[i];... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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 count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
count +=... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,059 | 768,060 | u833272463 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int &ai : a)
cin >> ai;
for (int &bi : b)
cin >> bi;
int ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a[i], b[i]);
a[i] -= left;
ans ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int &ai : a)
cin >> ai;
for (int &bi : b)
cin >> bi;
long long ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a[i], b[i]);
a[i] -= left;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,063 | 768,064 | u624475441 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
long long sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,065 | 768,066 | u593778400 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
long long sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,067 | 768,066 | u593778400 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
long long sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,068 | 768,069 | u593778400 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
long long sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 768,071 | 768,069 | u593778400 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
int B;
int res = 0;
for (int i = 0; i < N; ++i) {
cin >> B;
if (A[i] < B) {
if (A[i] + A[i + 1] < B) {
res += A[... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
int B;
long long res = 0;
for (int i = 0; i < N; ++i) {
cin >> B;
if (A[i] < B) {
if (A[i] + A[i + 1] < B) {
res... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,072 | 768,073 | u979452668 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mon[n + 5];
for (int i = 1; i <= n; i++) {
cin >> mon[i];
}
int hero[n + 1];
for (int i = 1; i < n; i++) {
cin >> hero[i];
}
long long ans = 0;
for (int i = 1; i < n; i++) {
int temp = min(mon[i], hero[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n++;
int mon[n + 5];
for (int i = 1; i <= n; i++) {
cin >> mon[i];
}
int hero[n + 1];
for (int i = 1; i < n; i++) {
cin >> hero[i];
}
long long ans = 0;
for (int i = 1; i < n; i++) {
int temp = min(mon[i], her... | [
"expression.unary.arithmetic.add"
] | 768,080 | 768,081 | u422827820 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | [
"assignment.change"
] | 768,082 | 768,083 | u678146855 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int A[10001], B[10000];
int sum = 0;
cin >> N;
for (int i = 0; i <= N; ++i) {
cin >> A[i];
sum += A[i];
}
for (int i = 0; i < N; ++i)
cin >> B[i];
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= 1; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
long long A[100001], B[100000];
long long sum = 0;
cin >> N;
for (int i = 0; i <= N; ++i) {
cin >> A[i];
sum += A[i];
}
for (int i = 0; i < N; ++i)
cin >> B[i];
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= 1;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,091 | 768,092 | u599857640 | cpp |
p02959 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[105];
int b[105];
int n;
main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
int sum = 0;
for (int i = 1; i <= n + 1; ++i) {
cin >> a[i];
sum += a[i];
}
for (int i = 1; i <= n; ++i)
cin >> b[i];
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[100005];
int b[100005];
int n;
main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
int sum = 0;
for (int i = 1; i <= n + 1; ++i) {
cin >> a[i];
sum += a[i];
}
for (int i = 1; i <= n; ++i)
cin >> b[... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,093 | 768,094 | u976418120 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const int MOD = (int)1e9 + 7;
const ll INF = (ll)1e18 + 7;
#define int long long
#define vint vector<int>
#def... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const int MOD = (int)1e9 + 7;
const ll INF = (ll)1e18 + 7;
#define int long long
#define vint vector<int>
#def... | [
"expression.operation.binary.remove"
] | 768,095 | 768,096 | u461044076 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
int main() {
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 ans = min(A[0], B[0])... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
int main() {
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 ans = min(A[0], B[0])... | [
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 768,099 | 768,100 | u482544950 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.