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>
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 j = 0; j < n; j++)
cin >> B[j];
int count = 0;
for (int i = 0; i < n; i++) {
if (A[i] >= B[i])
count += B[i];
else {
int rem = 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 j = 0; j < n; j++)
cin >> B[j];
long long count = 0;
for (int i = 0; i < n; i++) {
if (A[i] >= B[i])
count += B[i];
else {
int rem... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,101 | 768,102 | u122897704 | 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 j = 0; j < n; j++)
cin >> B[j];
int count = 0;
for (int i = 0; i < n; i++) {
int m1 = min(A[i], B[i]);
A[i] -= m1, B[i] -= m1, count += m1;
... | #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 j = 0; j < n; j++)
cin >> B[j];
long long count = 0;
for (int i = 0; i < n; i++) {
int m1 = min(A[i], B[i]);
A[i] -= m1, B[i] -= m1, count += ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,103 | 768,104 | u122897704 | cpp |
p02959 | // atcode abc135_c
#include <iostream>
using namespace std;
int main() {
int n, b[100002], a[100002];
cin >> n;
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int kills, nokills = a[0], sKills = 0;
//杀怪数，前英雄留下的怪物数，总杀怪数
for (int i = 0; i < n; ++i) {
if (noki... | // atcode abc135_c
#include <iostream>
using namespace std;
int main() {
int n, b[100002], a[100002];
cin >> n;
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int kills, nokills = a[0];
long long sKills = 0;
//杀怪数，前英雄留下的怪物数，总杀怪数
for (int i = 0; i < n; ++i) {
... | [
"variable_declaration.type.widen.change"
] | 768,105 | 768,106 | u956214843 | cpp |
p02959 | // atcode abc135_c
#include <iostream>
using namespace std;
int main() {
int n, b[100002], a[100002];
cin >> n;
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int kills, nokills = a[0], sKills = 0;
for (int i = 0; i < n; ++i) {
if (nokills + a[i + 1] <= b[i])... | // atcode abc135_c
#include <iostream>
using namespace std;
int main() {
int n, b[100002], a[100002];
cin >> n;
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int kills, nokills = a[0];
long long sKills = 0;
//杀怪数，前英雄留下的怪物数，总杀怪数
for (int i = 0; i < n; ++i) {
... | [
"variable_declaration.type.widen.change"
] | 768,107 | 768,106 | u956214843 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int a[10010], b[10010];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int a[100010], b[100010];
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,108 | 768,109 | u218759384 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 768,110 | 768,111 | u193035537 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int sum = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll sum = 0... | [
"variable_declaration.type.change"
] | 768,112 | 768,113 | u358859892 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int sum = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll sum = 0... | [
"variable_declaration.type.change"
] | 768,114 | 768,115 | u358859892 | cpp |
p02959 | #include <iostream>
using namespace std;
int N, A[100010], B[100010];
int main() {
cin >> N;
for (int i = 1; i <= N + 1; i++)
cin >> A[i];
for (int i = 1; i <= N; i++)
cin >> B[i];
int result = 0;
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i])
result += B[i];
else {
int t = A[i +... | #include <iostream>
using namespace std;
int N, A[100010], B[100010];
int main() {
cin >> N;
for (int i = 1; i <= N + 1; i++)
cin >> A[i];
for (int i = 1; i <= N; i++)
cin >> B[i];
long long result = 0; //这里要设置成long long 因为可能会很大
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i])
result += B[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,116 | 768,117 | u346312771 | cpp |
p02959 | #include <iostream>
using namespace std;
int N, A[100010], B[100010];
int main() {
cin >> N;
for (int i = 1; i <= N + 1; i++)
cin >> A[i];
for (int i = 1; i <= N; i++)
cin >> B[i];
int result = 0;
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i])
result += B[i];
else {
int t = A[... | #include <iostream>
using namespace std;
int N, A[100010], B[100010];
int main() {
cin >> N;
for (int i = 1; i <= N + 1; i++)
cin >> A[i];
for (int i = 1; i <= N; i++)
cin >> B[i];
long long result = 0;
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i])
result += B[i];
else {
int ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,118 | 768,119 | u427202024 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int count = 0;
int tmp;
for (int i = 0; i < N; i++) {
if (B.at(i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long count = 0;
long long tmp;
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,120 | 768,121 | u109139674 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define ... | [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 768,122 | 768,123 | u206925914 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
int cnt = 0;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
cnt = cnt + min(A.at(i), B.at(i));
cnt = cnt... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, cnt = 0;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
cnt = cnt + min(A.at(i), B.at(i));
cnt = cnt + min... | [] | 768,129 | 768,130 | u984247484 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
vector<int64_t> 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++) {
cnt = cnt + min(A.at(i), B.at(i));
cnt = cnt + min... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, cnt = 0;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
cnt = cnt + min(A.at(i), B.at(i));
cnt = cnt + min... | [
"variable_declaration.type.primitive.change"
] | 768,131 | 768,130 | u984247484 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int f1, f2;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int f1, f2;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,135 | 768,136 | u115106582 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++)
scanf("%d", &b[i]);
int ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a... | #include <bits/stdc++.h>
using namespace std;
long long a[100010], b[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
long long ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
ans += a[i];... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 768,137 | 768,138 | u465698810 | cpp |
p02959 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 768,139 | 768,140 | u236433947 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1), vv(n);
for (int i = 0; i < n + 1; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> vv[i];
}
int res = 0;
for (int i = 0; i < n; i++) {
if (v[i] < vv[i]) {
res += v[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n + 1), vv(n);
for (int i = 0; i < n + 1; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> vv[i];
}
long long res = 0;
for (int i = 0; i < n; i++) {
if (v[i] < vv[i]) {
res +=... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,141 | 768,142 | u615763347 | 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);
ll ans = 0;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll zero = 0;
for (int i = 0; i < n; i++) {
ans += min(a[... | #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);
ll ans = 0;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll zero = 0;
for (int i = 0; i < n; i++) {
ans += min(a[... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 768,143 | 768,144 | u280114218 | cpp |
p02959 | #/*
AUTHOR:shivam51
IIESTS
*/
#include <bits/stdc++.h>
using namespace std;
//
#define add accumulate
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll, ll>
#define vpll v... | #/*
AUTHOR:shivam51
IIESTS
*/
#include <bits/stdc++.h>
using namespace std;
//
#define add accumulate
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll, ll>
#define vpll v... | [
"expression.operation.binary.remove"
] | 768,155 | 768,156 | u216557283 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int count = 0;
vector<int> cities;
vector<int> heroes;
int city;
int hero;
for (int i = 0; i <= N; i++) {
cin >> city;
cities.push_back(city);
}
for (int i = 0; i < N; i++) {
cin >> hero;
heroe... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int count = 0;
vector<int> cities;
vector<int> heroes;
int city;
int hero;
for (int i = 0; i <= N; i++) {
cin >> city;
cities.push_back(city);
}
for (int i = 0; i < N; i++) {
cin >> hero;
heroe... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,157 | 768,158 | u991462056 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b;
int p;
for (int i = 0; i < n + 1; i++) {
cin >> p;
a.push_back(p);
}
for (int i = 0; i < n; i++) {
cin >> p;
b.push_back(p);
}
long long cnt = 0;
int m;
f... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b;
int p;
for (int i = 0; i < n + 1; i++) {
cin >> p;
a.push_back(p);
}
for (int i = 0; i < n; i++) {
cin >> p;
b.push_back(p);
}
long long cnt = 0;
int m;
f... | [
"expression.operation.binary.remove"
] | 768,167 | 768,168 | u054798759 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
int ii = 0;
int ip = 0;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long ans = 0;
int ii = 0;
int ip = 0;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 768,179 | 768,180 | u680087927 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a[100005] = {}, b[100005] = {}, sum = 0;
cin >> n;
rep(i, n + 1) cin >> a[i];
r... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a[100005] = {}, b[100005] = {};
ll sum = 0;
cin >> n;
rep(i, n + 1) cin >> a[i]... | [] | 768,181 | 768,182 | u098652914 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a[100005] = {}, b[100005] = {}, sum = 0;
cin >> n;
rep(i, n + 1) cin >> a[i];
r... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a[100005] = {}, b[100005] = {};
ll sum = 0;
cin >> n;
rep(i, n + 1) cin >> a[i]... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 768,183 | 768,182 | u098652914 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, d = 0;
scanf("%lld", &n);
long long int a[n + 3], b[n + 3];
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] >= b[i]) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, d = 0;
scanf("%lld", &n);
long long int a[n + 3], b[n + 3];
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] >= b[i]) ... | [
"assignment.change"
] | 768,186 | 768,187 | u422818846 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, d = 0;
scanf("%d", &n);
long long int a[n + 3], b[n + 3];
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 (a[i] + a[i + 1] >= b[i]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, d = 0;
scanf("%lld", &n);
long long int a[n + 3], b[n + 3];
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] >= b[i]) ... | [
"literal.string.change",
"call.arguments.change",
"assignment.change"
] | 768,188 | 768,187 | u422818846 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; i++) {
... | [
"variable_declaration.type.change"
] | 768,191 | 768,192 | u291178324 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
int brr[n];
for (int i = 0; i < n + 1; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
cin >> brr[i];
int take = 0;
for (int i = 0; i < n; i++) {
int can = min(arr[i], brr[i]);
take += can;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
int brr[n];
for (int i = 0; i < n + 1; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
cin >> brr[i];
long long take = 0;
for (int i = 0; i < n; i++) {
int can = min(arr[i], brr[i]);
take +=... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,200 | 768,201 | u839270538 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int X[N + 1];
int Y[N];
int cnt = 0;
for (int i = 0; i < N + 1; ++i)
cin >> X[i];
for (int i = 0; i < N; ++i)
cin >> Y[i];
for (int i = 0; i < N; ++i) {
cnt += fmi... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
long X[N + 1];
long Y[N];
long cnt = 0;
for (int i = 0; i < N + 1; ++i)
cin >> X[i];
for (int i = 0; i < N; ++i)
cin >> Y[i];
for (int i = 0; i < N; ++i) {
cnt += ... | [
"variable_declaration.type.primitive.change"
] | 768,202 | 768,203 | u431929942 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<int> B(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = N - 1; i >= 0; i--) {
if (B[i] >= A[i + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<int> B(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = N - 1; i >= 0; i--) {
if (B[i] >= ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,204 | 768,205 | u109497000 | 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 ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b... | #include <iostream>
#include <vector>
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 ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,206 | 768,207 | u057810841 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
int ans = 0, lest = A[0];
for (int i = 0; i < N; i++) {
if (lest >= B[i]) {
ans +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
long long ans = 0, lest = A[0];
for (int i = 0; i < N; i++) {
if (lest >= B[i]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,209 | 768,210 | u544437817 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
int n;
cin >> n;
A[i] = n;
}
for (int i = 0; i < N; i++) {
int n;
cin >> n;
B[i] = n;
}
int total_kill = 0;
for ... | #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++) {
int n;
cin >> n;
A[i] = n;
}
for (int i = 0; i < N; i++) {
int n;
cin >> n;
B[i] = n;
}
long total_kill = 0;
for... | [
"variable_declaration.type.primitive.change"
] | 768,213 | 768,214 | u513365687 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, kotae = 0;
cin >> n;
int a[n + 1], b[n];
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
if (a[i] <= b[i]) {
b[i] -= a[i];
kotae += a[i];
a[i] = 0;
if (a[i + 1] <= b[i])... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, i, kotae = 0;
cin >> n;
long int a[n + 1], b[n];
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
if (a[i] <= b[i]) {
b[i] -= a[i];
kotae += a[i];
a[i] = 0;
if (a[i + 1... | [
"variable_declaration.type.widen.change"
] | 768,215 | 768,216 | u016726316 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, c;
cin >> N;
A = 0;
B = 0;
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);
A = min(a.at(i) - B, b.at(i));
B = min(a.at(i + 1), b... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, A, B, c;
cin >> N;
A = 0;
B = 0;
c = 0;
vector<long 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);
A = min(a.at(i) - B, b.at(i));
B = min(a.at... | [
"variable_declaration.type.widen.change"
] | 768,219 | 768,220 | u072774815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, c;
cin >> N;
A = 0;
B = 0;
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);
A = min(a.at(i), b.at(i));
B = min(a.at(i + 1), b.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, A, B, c;
cin >> N;
A = 0;
B = 0;
c = 0;
vector<long 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);
A = min(a.at(i) - B, b.at(i));
B = min(a.at... | [
"variable_declaration.type.widen.change",
"assignment.change"
] | 768,221 | 768,220 | u072774815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const ll INF = LLONG_MAX;
using Tree = vector<pair<int, int>>;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const ll INF = LLONG_MAX;
using Tree = vector<pair<int, int>>;
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 ... | [
"variable_declaration.type.change"
] | 768,222 | 768,223 | u850894780 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int N;
cin >> N;
vector<long> enemies;
vector<long> heroes;
for (int i = 0; i < N + 1; i++) {
long A;
cin >> A;
enemies.push_back(A);
}
for (int i = 0; i < N; i++) {
long B;
cin >> B;
heroes.push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int N;
cin >> N;
vector<long> enemies;
vector<long> heroes;
for (int i = 0; i < N + 1; i++) {
long A;
cin >> A;
enemies.push_back(A);
}
for (int i = 0; i < N; i++) {
long B;
cin >> B;
heroes.push_... | [
"variable_declaration.type.primitive.change"
] | 768,230 | 768,231 | u598710706 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#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; i++) {
cin >... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#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; i++) {
cin >... | [
"variable_declaration.type.widen.change"
] | 768,233 | 768,234 | u134857688 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#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; i++) {
cin >... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#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; i++) {
cin >... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,235 | 768,236 | u134857688 | 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; 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 cur = min(a[i], b[i]);
ans +=... | #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; 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 cur = min(a[i], b[i]);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,237 | 768,238 | u272481916 | cpp |
p02959 | #include <iostream>
int main() {
int n;
std ::cin >> n;
long long monsters[n + 1];
for (int i = 0; i <= n; i++)
std ::cin >> monsters[i];
long long heroes[n];
for (int i = 0; i < n; i++)
std ::cin >> heroes[i];
int d = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] >= heroes[i]) {
... | #include <iostream>
int main() {
int n;
std ::cin >> n;
long long monsters[n + 1];
for (int i = 0; i <= n; i++)
std ::cin >> monsters[i];
long long heroes[n];
for (int i = 0; i < n; i++)
std ::cin >> heroes[i];
long long d = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] >= heroes[i])... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,239 | 768,240 | u683788379 | cpp |
p02959 | #include <iostream>
int main() {
int n;
std ::cin >> n;
int monsters[n + 1];
for (int i = 0; i <= n; i++)
std ::cin >> monsters[i];
int heroes[n];
for (int i = 0; i < n; i++)
std ::cin >> heroes[i];
int d = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] >= heroes[i]) {
d += hero... | #include <iostream>
int main() {
int n;
std ::cin >> n;
long long monsters[n + 1];
for (int i = 0; i <= n; i++)
std ::cin >> monsters[i];
long long heroes[n];
for (int i = 0; i < n; i++)
std ::cin >> heroes[i];
long long d = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] >= heroes[i])... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,241 | 768,240 | u683788379 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[1000], b[1000], an = 0;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
an += b[i];
else {
an += a[i];
b[i] -= a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100001], b[100001], an = 0;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
an += b[i];
else {
an += a[i];
b... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,242 | 768,243 | u314209309 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int A;
cin >> A;
vector<int> data(A + 1);
vector<int> gekitui(A);
for (int i = 0; i < A + 1; i++) {
cin >> data[i];
}
for (int i = 0; i < A; i++) {
cin >> gekitui[i];
}
int sougekituisuu = 0;
fo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long A;
cin >> A;
vector<long> data(A + 1);
vector<long> gekitui(A);
for (int i = 0; i < A + 1; i++) {
cin >> data[i];
}
for (int i = 0; i < A; i++) {
cin >> gekitui[i];
}
long sougekituisuu = 0;
... | [
"variable_declaration.type.primitive.change"
] | 768,246 | 768,247 | u983547593 | cpp |
p02959 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | [
"variable_declaration.type.change"
] | 768,250 | 768,251 | u142878260 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long sum = 0;
cin >> n;
int mon[n + 10], he[n + 9];
for (int i = 0; i < n + 1; i++) {
cin >> mon[i];
}
for (int i = 0; i < n; i++) {
cin >> he[i];
}
for (int i = 0; i < n; i++) {
if (mon[i] >= he[i]) {
sum += he[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long sum = 0;
cin >> n;
int mon[n + 10], he[n + 9];
for (int i = 0; i < n + 1; i++) {
cin >> mon[i];
}
for (int i = 0; i < n; i++) {
cin >> he[i];
}
for (int i = 0; i < n; i++) {
if (mon[i] >= he[i]) {
sum += he[... | [
"control_flow.branch.else.add"
] | 768,252 | 768,253 | u957558006 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | [
"assignment.change"
] | 768,256 | 768,257 | u658899890 | cpp |
p02959 | ///***Bismillahir Rahmanir Rahim***///
///*********************************///
///******Ashraful Haque Toni********///
///********Dept. of CSE,JnU*********///
/// email:ashrafulhaquetoni@gmail.com///
///*******contact:01640690531*******///
///*********************************///
#include <bits/stdc++.h>
using namespa... | ///***Bismillahir Rahmanir Rahim***///
///*********************************///
///******Ashraful Haque Toni********///
///********Dept. of CSE,JnU*********///
/// email:ashrafulhaquetoni@gmail.com///
///*******contact:01640690531*******///
///*********************************///
#include <bits/stdc++.h>
using namespa... | [
"variable_declaration.type.change"
] | 768,270 | 768,271 | u802094864 | cpp |
p02959 | #include <stdio.h>
int main(void) {
int n;
int a[100002];
int b[100000];
int i;
int c;
c = 0;
scanf("%d", &n);
for (i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
a[n + 2] = 0;
for (i = 0; i < n; i++) {
if (b[i] <= a[i]) {
... | #include <stdio.h>
int main(void) {
int n;
int a[100002];
int b[100000];
int i;
double c;
c = 0;
scanf("%d", &n);
for (i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
a[n + 2] = 0;
for (i = 0; i < n; i++) {
if (b[i] <= a[i]) {
... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,272 | 768,273 | u966052848 | cpp |
p02959 | /*Stay true to yourself, yet always be open to learn. Work hard, and never give
up on your dreams, even when nobody else believes they can come true but you.
These are not cliches but real tools you need no matter what you do in life to
stay focused on your path.
*/
/*Pppppppp UU UU CCCCCCCC CCCCCCCC ... | /*Stay true to yourself, yet always be open to learn. Work hard, and never give
up on your dreams, even when nobody else believes they can come true but you.
These are not cliches but real tools you need no matter what you do in life to
stay focused on your path.
*/
/*Pppppppp UU UU CCCCCCCC CCCCCCCC ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,280 | 768,281 | u985702351 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
int main() {
ios_base::sync_with_stdio(false);... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int ll
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
signed main() {
ios_base::sync_... | [
"variable_declaration.type.primitive.change"
] | 768,288 | 768,289 | u839511400 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
int main() {
int N, i, sum;
sum = 0;
cin >> N;
int A[N + 1];
int B[N];
for (i = 0; i < (N + 1); i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
cin >> B[i]... | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
int main() {
int N, i;
long sum;
sum = 0;
cin >> N;
int A[N + 1];
int B[N];
for (i = 0; i < (N + 1); i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
cin ... | [
"variable_declaration.type.widen.change"
] | 768,292 | 768,293 | u499729664 | cpp |
p02959 | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
using ll = long long;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;... | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
using ll = long long;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;... | [
"variable_declaration.type.change"
] | 768,298 | 768,299 | u850266651 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
#define ll long long
const int maxn = 200000 + 5;
int a[maxn];
int b[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >>... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
#define ll long long
const int maxn = 100000 + 5;
ll a[maxn];
ll b[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a... | [
"literal.number.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 768,300 | 768,301 | u205361627 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#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.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int cnt = 0;
for (int i = 0; i < n; ... | #include <algorithm>
#include <iostream>
#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.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int64_t cnt = 0;
for (int i = 0; i <... | [
"variable_declaration.type.primitive.change"
] | 768,302 | 768,303 | u581832318 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(void) {
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 p = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
p += b[i];
continue;
} else {
... | #include <iostream>
using namespace std;
int main(void) {
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 long p = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
p += b[i];
continue;
} else {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,304 | 768,305 | u675509234 | cpp |
p02959 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | [
"assignment.change"
] | 768,306 | 768,307 | u752498851 | cpp |
p02959 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | [
"assignment.change"
] | 768,308 | 768,307 | u752498851 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, i, j;
cin >> n;
int a[n + 1];
int b[n];
int c[n + 1];
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, i, j;
cin >> n;
int a[n + 1];
int b[n];
int c[n + 1];
... | [
"variable_declaration.type.change"
] | 768,309 | 768,310 | u127768253 | cpp |
p02959 | #include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + ... | #include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,311 | 768,312 | u759162415 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 768,313 | 768,314 | u823451365 | 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; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if ((A[i] + A[i + 1]) <= B[i]) {
ans += A[i] + A[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long int ans = 0;
cin >> N;
vector<long long 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 ((A[i] + A[i + 1]) <= B[i]... | [
"variable_declaration.type.widen.change"
] | 768,315 | 768,316 | u926416331 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i... | [
"assignment.variable.change",
"identifier.change"
] | 768,325 | 768,326 | u656679572 | cpp |
p02959 | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false... | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false... | [
"assignment.change"
] | 768,329 | 768,330 | u032226420 | cpp |
p02959 | #include <algorithm>/*toupperとかが入っている*/
#include <cmath>
#include <iostream>
#include <string>
#include <vector>/*可変長配列vectorのインクルード*/
const int MOD =
1000000007; /* 1,000,000,007 で割った余りを出力する のとき使う*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int N;
long long int A[100005];
long long int B[100005... | #include <algorithm>/*toupperとかが入っている*/
#include <cmath>
#include <iostream>
#include <string>
#include <vector>/*可変長配列vectorのインクルード*/
const int MOD =
1000000007; /* 1,000,000,007 で割った余りを出力する のとき使う*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int N;
long long int A[100005];
long long int B[100005... | [
"variable_declaration.type.widen.change"
] | 768,331 | 768,332 | u607444339 | cpp |
p02959 | #include <algorithm>
#include <ctype.h>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int n;
vector<ll> a, b;
ll ret = 0;
ll min(ll a, ll b) {
if (a >= b)
return b;
else
return a;
}
... | #include <algorithm>
#include <ctype.h>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int n;
vector<ll> a, b;
ll ret = 0;
ll min(ll a, ll b) {
if (a >= b)
return b;
else
return a;
}
... | [
"assignment.change"
] | 768,333 | 768,334 | u728082661 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cinttypes>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#if... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cinttypes>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#de... | [
"call.arguments.change"
] | 768,335 | 768,336 | u345432788 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#inc... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#inc... | [] | 768,337 | 768,338 | u848736574 | cpp |
p02959 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,339 | 768,340 | u922018373 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, a[10005], b[10005], ans = 0;
signed main() {
cin >> n;
for (int i = 1; i <= n + 1; cin >> a[i++])
;
for (int i = 1; i <= n; cin >> b[i++])
;
for (int i = 1; i <= n; i++) {
if (b[i] >= a[i]) {
ans += min(b[i], a[i] + ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, a[100005], b[100005], ans = 0;
signed main() {
cin >> n;
for (int i = 1; i <= n + 1; cin >> a[i++])
;
for (int i = 1; i <= n; cin >> b[i++])
;
for (int i = 1; i <= n; i++) {
if (b[i] >= a[i]) {
ans += min(b[i], a[i] ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,351 | 768,352 | u723494462 | cpp |
p02959 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int... | [
"variable_declaration.type.change"
] | 768,356 | 768,357 | u209767598 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define ll long long
#define re register
using namespace std;
struct ios {
inline char fchar() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 &&
(p2 = (p1 = buf) +... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define ll long long
#define re register
using namespace std;
struct ios {
inline char fchar() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 &&
(p2 = (p1 = buf) +... | [
"variable_declaration.type.change"
] | 768,360 | 768,361 | u100442348 | cpp |
p02959 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
LL read() {
LL k = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
k = k * 10 + c - 48, c = g... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
LL read() {
LL k = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
k = k * 10 + c - 48, c = g... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 768,362 | 768,363 | u753702868 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
long long town[maxn], hero[maxn];
int main() {
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n + 1; i++) {
scanf("%lld", &town[i]);
}
for (int i = 0; i < n; i++) {
scanf("%lld", &hero[i]);
}
for (int i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
long long town[maxn], hero[maxn];
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 0; i < n + 1; i++) {
scanf("%lld", &town[i]);
}
for (int i = 0; i < n; i++) {
scanf("%lld", &hero[i]);
}
for (int i = 0; i < n;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 768,376 | 768,377 | u333991119 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int counti = 0;
int main() {
long long int n, s1 = 0;
cin >> n;
long long int a[n + 5], b[n + 5];
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
s1 += a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--)
if (b[i] >= a... | #include <bits/stdc++.h>
using namespace std;
int counti = 0;
int main() {
long long int n, s1 = 0;
cin >> n;
long long int a[n + 5], b[n + 5];
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
s1 += a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--)
if (b[i] >= a... | [
"variable_declaration.type.widen.change"
] | 768,381 | 768,382 | u249899624 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int counti = 0;
int main() {
int n, s1 = 0;
cin >> n;
int a[n + 5], b[n + 5];
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
s1 += a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--)
if (b[i] >= a[i + 1]) {
b[i... | #include <bits/stdc++.h>
using namespace std;
int counti = 0;
int main() {
long long int n, s1 = 0;
cin >> n;
long long int a[n + 5], b[n + 5];
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
s1 += a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--)
if (b[i] >= a... | [
"variable_declaration.type.widen.change"
] | 768,383 | 768,382 | u249899624 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using pint = pair<int, int>;
#define repi(n) for (int i = 0; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define repv(itr) for... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using pint = pair<int, int>;
#define repi(n) for (int i = 0; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define repv(itr) for... | [
"variable_declaration.type.change"
] | 768,387 | 768,388 | u600091079 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N = 100005;
int main() {
int n, a[N], b[N], ans;
scanf("%d", &n);
for (int i = 0; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = 0; i < n; ++i)
scanf("%d", &b[i]);
ans = 0;
for (int i = 0; i... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N = 100005;
int main() {
int n, a[N], b[N];
long long ans;
scanf("%d", &n);
for (int i = 0; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = 0; i < n; ++i)
scanf("%d", &b[i]);
ans = 0;
for (... | [
"variable_declaration.type.widen.change"
] | 768,395 | 768,396 | u812942729 | cpp |
p02959 | #include <iostream>
using namespace std;
int a[100009], b[100009];
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 k, cnt = 0;
int i = 0, j = n - 1;
while (i < j) {
k = min(b[i], a[i]);
a[i] -= k;
b[i] -= k;
... | #include <iostream>
using namespace std;
int a[100009], b[100009];
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 k, cnt = 0;
int i = 0, j = n - 1;
while (i < j) {
k = min(b[i], a[i]);
a[i] -= k;
b[i] -= k... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,399 | 768,400 | u290423616 | cpp |
p02959 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
const int maxn = 100005;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 100005;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = ... | [
"variable_declaration.type.change"
] | 768,406 | 768,407 | u451010951 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"variable_declaration.type.change"
] | 768,410 | 768,411 | u629341543 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
vector<int> arr(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> arr[i];
}
vector<int> barr(N);
for (int j = 0; j < N; j++) {
cin >> barr[j];
}
int ans = 0;
for (int k = 0; k < N; k++) {
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
vector<int> arr(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> arr[i];
}
vector<int> barr(N);
for (int j = 0; j < N; j++) {
cin >> barr[j];
}
int64_t ans = 0;
for (int k = 0; k < N; k++) ... | [
"variable_declaration.type.primitive.change"
] | 768,412 | 768,413 | u725109307 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, sum = 0;
vector<int> a, b;
cin >> n;
a.resize(n + 1);
b.resize(n);
for (auto &x : a) {
cin >> x;
}
for (auto &x : b) {
cin >> x;
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
sum += b[i];
a[i] -= b[i]... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, sum = 0;
vector<int> a, b;
cin >> n;
a.resize(n + 1);
b.resize(n);
for (auto &x : a) {
cin >> x;
}
for (auto &x : b) {
cin >> x;
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
sum += b[i];
a[i] -= b[i... | [
"variable_declaration.type.primitive.change"
] | 768,417 | 768,418 | u688509741 | cpp |
p02959 | /*#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")*/
//#pragma GCC optimize("fast-math")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("unroll-loops") #define _CRT_SECURE_NO_WARNINGS #pragma GCC
//optimize("unroll-loops") #pragma GCC
//ta... | /*#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")*/
//#pragma GCC optimize("fast-math")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("unroll-loops") #define _CRT_SECURE_NO_WARNINGS #pragma GCC
//optimize("unroll-loops") #pragma GCC
//ta... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,419 | 768,420 | u841694668 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#ifdef _IS_LOCAL //
#define dout cout
#define debug() if (true)
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#endif /... | #include <bits/stdc++.h>
using namespace std;
#ifdef _IS_LOCAL //
#define dout cout
#define debug() if (true)
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#endif /... | [
"variable_declaration.type.change"
] | 768,425 | 768,426 | u111937495 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
vector<int> a, b;
cin >> n;
for (int i = 0; i < n + 1; i++) {
int temp;
cin >> temp;
a.push_back(temp);
}
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
b.push_back(temp);
}
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, count = 0;
vector<long long> a, b;
cin >> n;
for (int i = 0; i < n + 1; i++) {
int temp;
cin >> temp;
a.push_back(temp);
}
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
b.push_back(temp);
}
for (int ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 768,431 | 768,432 | u754489932 | 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))... | #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);
}
long long count = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,433 | 768,434 | u785773061 | 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))... | #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);
}
long long count = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 768,435 | 768,434 | u785773061 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 50;
ll monster[MAX], hero[MAX] = {0};
int main() {
memset(hero, 0, sizeof(hero));
int n;
cin >> n;
ll ans = 0;
for (int i = 0; i <= n; i++) {
cin >> monster[i];
}
ll pre = 0;
for (int i = 0; i < n; i++) {
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 50;
ll monster[MAX], hero[MAX] = {0};
int main() {
memset(hero, 0, sizeof(hero));
int n;
cin >> n;
ll ans = 0;
for (int i = 0; i <= n; i++) {
cin >> monster[i];
}
ll pre = 0;
for (int i = 0; i < n; i++) {
c... | [
"assignment.change"
] | 768,436 | 768,437 | u045531009 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n, x, tot, ans, a[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
cin >> x;
if (a[i] >= x)
ans += x;
else {
x -= a[i];
ans += a[i];
tot = min(x, a[i + 1]);
a... | #include <bits/stdc++.h>
using namespace std;
long long n, x, tot, ans, a[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
cin >> x;
if (a[i] >= x)
ans += x;
else {
x -= a[i];
ans += a[i];
tot = min(x, a[i + 1]);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,438 | 768,439 | u960852022 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#define maxn 200100
using namespace std;
long long a[maxn], b[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#define maxn 200100
using namespace std;
long long a[maxn], b[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 768,440 | 768,441 | u335768052 | cpp |
p02959 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [] | 768,443 | 768,444 | u127344197 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int cnt = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
long cnt = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
... | [
"variable_declaration.type.primitive.change"
] | 768,447 | 768,448 | u535297532 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.... | [
"variable_declaration.type.change"
] | 768,451 | 768,452 | u785975381 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int A[100010];
int B[100010];
int main() {
int N;
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
int cnt =... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long A[100010];
long long B[100010];
int main() {
int N;
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,453 | 768,454 | u601256797 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, a, b;
vector<int> A, B;
cin >> N;
for (int i = 1; i <= N + 1; i++) {
cin >> a;
A.push_back(a);
}
int cnt = 0;
int b2 = 0;
for (int i = 0; i < N + 1; i++) {
if (i < N) {
cin ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, a, b;
vector<int> A, B;
cin >> N;
for (int i = 1; i <= N + 1; i++) {
cin >> a;
A.push_back(a);
}
long long cnt = 0;
int b2 = 0;
for (int i = 0; i < N + 1; i++) {
if (i < N) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,457 | 768,458 | u237044327 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, M;
long long ans = 0;
string s;
cin >> N;
vector<long long> A(N + 1);
v... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, M;
long long ans = 0;
string s;
cin >> N;
vector<long long> A(N + 1);
v... | [
"expression.operation.unary.arithmetic.remove"
] | 768,461 | 768,462 | u699835930 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
signed main() {
Int n;
vector<Int> a, b;
cin >> n;
for (Int i = 0; i < n + 1; i++) {
Int tmp;
cin >> tmp;
a.push_back(tmp);
}
for (Int i = 0; i < n; i++) {
Int tmp;
cin >> tmp;
b.push_back(tmp);
}
Int l = 0... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
signed main() {
Int n;
vector<Int> a, b;
cin >> n;
for (Int i = 0; i < n + 1; i++) {
Int tmp;
cin >> tmp;
a.push_back(tmp);
}
for (Int i = 0; i < n; i++) {
Int tmp;
cin >> tmp;
b.push_back(tmp);
}
Int l = 0... | [
"assignment.change"
] | 768,465 | 768,466 | u148215098 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.