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 rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n + 1) {
int min1 = min(a[i], b[i]);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n) {
ll min1 = min(a[i], b[i]);
a[... | [
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 766,794 | 766,793 | u233586402 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
rep(i, N + 1) cin >> A.at(i);
rep(i, N) cin >> B.at(i);
int max_mon = 0;
rep(i, N) {
if (B.at(i) <= A.at(i))
max_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
rep(i, N + 1) cin >> A.at(i);
rep(i, N) cin >> B.at(i);
ll max_mon = 0;
rep(i, N) {
if (B.at(i) <= A.at(i))
max_mo... | [
"variable_declaration.type.change"
] | 766,798 | 766,799 | u433189059 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, m = 0;
cin >> N;
vector<int> tHero(N);
vector<int> tEnemy(N + 1);
for (i = 0; i < N + 1; ++i)
cin >> tEnemy.at(i);
for (i = 0; i < N; ++i)
cin >> tHero.at(i);
for (i = 0; i < N; ++i) {
if (tEnemy.at(i) >= tHero.at(i))
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, i, m = 0;
cin >> N;
vector<long> tHero(N);
vector<long> tEnemy(N + 1);
for (i = 0; i < N + 1; ++i)
cin >> tEnemy.at(i);
for (i = 0; i < N; ++i)
cin >> tHero.at(i);
for (i = 0; i < N; ++i) {
if (tEnemy.at(i) >= tHero.at(i))
... | [
"variable_declaration.type.primitive.change"
] | 766,800 | 766,801 | u089241640 | cpp |
p02959 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back(k, v)
#define ct(res)... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back(k, v)
#define ct(res)... | [
"variable_declaration.type.change"
] | 766,802 | 766,803 | u673981655 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> A(n + 1), B(n);
rep(i, n + 1) cin >> A.at(i);
rep(i, n) ci... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<intll> A(n + 1), B(n);
rep(i, n + 1) cin >> A.at(i);
rep(i, n) ... | [
"variable_declaration.type.change"
] | 766,804 | 766,805 | u260907804 | cpp |
p02959 | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dlog(x) cerr << #x << '=' << x << endl
#define f first
#define s second
#define endl '\n'
#define sq(x) (x) * (x)*1ll
// typedef tree<int,null_type,less_e... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dlog(x) cerr << #x << '=' << x << endl
#define f first
#define s second
#define endl '\n'
#define sq(x) (x) * (x)*1ll
// typedef tree<int,null_type,less_e... | [
"variable_declaration.remove",
"variable_declaration.type.change"
] | 766,806 | 766,807 | u093681822 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<long long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (B.at(i) <= A.at(i)) {
ans += B... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long ans = 0;
cin >> N;
vector<long long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (B.at(i) <= A.at(i)) {
... | [
"variable_declaration.type.widen.change"
] | 766,809 | 766,810 | u407814609 | cpp |
p02959 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
int m = ... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
ll m = 0;
... | [
"variable_declaration.type.change"
] | 766,816 | 766,817 | u455266724 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, n) \
; ... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, n) \
; ... | [
"assignment.change"
] | 766,818 | 766,819 | u776056110 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1] = {};
int B[N] = {};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int 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() {
int N;
cin >> N;
int A[N + 1] = {};
int B[N] = {};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
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"
] | 766,820 | 766,821 | u584520839 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1] = {};
int B[N] = {};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int 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() {
int N;
cin >> N;
int A[N + 1] = {};
int B[N] = {};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
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",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 766,822 | 766,821 | u584520839 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (B.at(i) >= A.at(i)) {
cnt += A.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long cnt = 0;
for (int i = 0; i < N; i++) {
if (B.at(i) >= A.at(i)) {
cnt += A.... | [
"variable_declaration.type.primitive.change"
] | 766,825 | 766,826 | u454330046 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, ans = 0;
cin >> n;
vector<long> a(n + 1);
vector<long> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
if (a.at(i) <= b.at(i)) {
b.at(i) -= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, ans = 0;
cin >> n;
vector<long> a(n + 1);
vector<long> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
if (a.at(i) <= b.at(i)) {
b.at(i) -= ... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,831 | 766,832 | u966257731 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 sum = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
sum += ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll A[N + 1], B[N];
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
ll sum = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
sum += B[i... | [
"variable_declaration.type.change"
] | 766,833 | 766,834 | u241312295 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int result = 0;
for (int i = (n - 1); ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll result = 0;
for (int i = (n - 1); i... | [
"variable_declaration.type.change"
] | 766,836 | 766,837 | u011438316 | cpp |
p02959 | #include <cmath>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; ++i)
std::cin >> A.at(i);
std::vector<int> B(N + 1, 0);
for (int i = 0; i < N; ++i)
std::cin >> B.at(i);
int answer = 0, carry = 0;
for (int i = 0;... | #include <cmath>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<long long> A(N + 1, 0);
for (int i = 0; i < N + 1; ++i)
std::cin >> A.at(i);
std::vector<long long> B(N + 1, 0);
for (int i = 0; i < N; ++i)
std::cin >> B.at(i);
long long answer = 0, carry = 0;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,838 | 766,839 | u930737792 | cpp |
p02959 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int ans = 0;
rep(i, n) {
ans += ... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll ans = 0;
rep(i, n) {
ans += mi... | [
"variable_declaration.type.change"
] | 766,844 | 766,845 | u602267597 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
int wa = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
wa = wa + A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
long long int wa = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
wa = wa + A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int ans = ... | [
"variable_declaration.type.widen.change"
] | 766,846 | 766,847 | u231455327 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
int wa = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
wa = wa + A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
long long int wa = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
wa = wa + A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int ans = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 766,848 | 766,847 | u231455327 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= A[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (B... | [
"variable_declaration.type.widen.change"
] | 766,849 | 766,850 | u231455327 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B = 0;
cin >> A;
vector<long long int> T(A + 1);
vector<int> K(A);
for (int i = 0; i < A + 1; i++) {
cin >> T.at(i);
}
for (int i = 0; i < A; i++) {
cin >> K.at(i);
}
for (int i = 0; i < A; i++) {
if (T.at(i) - K.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
long long int B = 0;
cin >> A;
vector<long long int> T(A + 1);
vector<int> K(A);
for (int i = 0; i < A + 1; i++) {
cin >> T.at(i);
}
for (int i = 0; i < A; i++) {
cin >> K.at(i);
}
for (int i = 0; i < A; i++) {
if (T.at(i... | [
"variable_declaration.type.widen.change"
] | 766,851 | 766,852 | u697858600 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B = 0;
cin >> A;
vector<long long int> T(A + 1);
vector<int> K(A);
for (int i = 0; i < A + 1; i++) {
cin >> T.at(i);
}
for (int i = 0; i < A; i++) {
cin >> K.at(i);
}
for (int i = 0; i < A; i++) {
if (T.at(i) - K.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
long long int B = 0;
cin >> A;
vector<long long int> T(A + 1);
vector<int> K(A);
for (int i = 0; i < A + 1; i++) {
cin >> T.at(i);
}
for (int i = 0; i < A; i++) {
cin >> K.at(i);
}
for (int i = 0; i < A; i++) {
if (T.at(i... | [
"assignment.value.change",
"expression.operation.binary.remove"
] | 766,853 | 766,852 | u697858600 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long int count = 0;
for (int i = 0; i < N; i++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long int count = 0;
for (int i = 0; i < N; i++) {
if... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 766,854 | 766,855 | u288432959 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long int count = 0;
for (int i = 0; i < N; i++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long int count = 0;
for (int i = 0; i < N; i++) {
if... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"expression.operator.change"
] | 766,856 | 766,855 | u288432959 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | [
"call.add",
"call.arguments.change"
] | 766,859 | 766,860 | u330661451 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
... | [
"variable_declaration.type.change"
] | 766,863 | 766,864 | u374051158 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<i... | [
"variable_declaration.type.change"
] | 766,865 | 766,866 | u720321944 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<i... | [
"variable_declaration.type.change"
] | 766,867 | 766,866 | u720321944 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
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, 0);
for (int i = 0; i < N; i++)
cin >> B[i];
int ans = 0;
for (int i = 0; i < N; i++) {
int beat1 = min(A[... | #include <bits/stdc++.h>
#define ll long long
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, 0);
for (int i = 0; i < N; i++)
cin >> B[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
ll beat1 = min(A[i]... | [
"variable_declaration.type.change"
] | 766,868 | 766,869 | u119098168 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | [
"variable_declaration.type.change"
] | 766,872 | 766,873 | u789323170 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;... | [
"variable_declaration.type.change"
] | 766,878 | 766,879 | u005906204 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;... | [
"variable_declaration.type.change"
] | 766,880 | 766,879 | u005906204 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 766,883 | 766,884 | u682395093 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)... | [
"variable_declaration.type.change"
] | 766,887 | 766,888 | u338193317 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)... | [
"variable_declaration.type.change"
] | 766,889 | 766,888 | u338193317 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long A[n + 1];
long long B[n];
for (int i = 0; i <= n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
int co = 0;
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
co += B[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long A[n + 1];
long long B[n];
for (int i = 0; i <= n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
long long co = 0;
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
co += B[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,892 | 766,893 | u338193317 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long A[n + 1];
long long B[n];
for (int i = 0; i <= n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
int co = 0;
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
co += B[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long A[n + 1];
long long B[n];
for (int i = 0; i <= n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
long long co = 0;
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
co += B[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 766,894 | 766,893 | u338193317 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int n, res = 0;
cin >> n;
int a[n + 1], b;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b;
if (a[i] < b) {
res += a[i];
b -= a[i];
if (a[i + 1] < b) {
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long n, res = 0;
cin >> n;
long long a[n + 1], b;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b;
if (a[i] < b) {
res += a[i];
b -= a[i];
if (a[i + 1] <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,895 | 766,896 | u058348416 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
typedef long long ll;
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];
int res = 0;
rep(i, N) {
if (A[i] >= B[i]) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
typedef long long ll;
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 res = 0;
rep(i, N) {
if (A[i] >= B[i]) {... | [
"variable_declaration.type.change"
] | 766,897 | 766,898 | u468440139 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<long> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<long> b(n);
rep(i, n + 1) cin >> b[i];
b[n] = 0;
long c;
c = 0;
rep(i, n + 1) {
long l = min(a[i], b[i]);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<long> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<long> b(n + 1);
rep(i, n) cin >> b[i];
b[n] = 0;
long c;
c = 0;
rep(i, n + 1) {
long l = min(a[i], b[i]);
... | [
"expression.operation.binary.remove"
] | 766,899 | 766,900 | u468440139 | cpp |
p02959 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a = 0, b = 0, c, d, n, k;
string s, t;
int main() {
c... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a = 0, b = 0, c, d, n, k;
string s, t;
int main() {
c... | [
"variable_declaration.type.primitive.change"
] | 766,901 | 766,902 | u465760322 | cpp |
p02959 | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define LL long long
#define DS pair<int, int>
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
const int N = 1e6 + 5;
const in... | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define LL long long
#define DS pair<int, int>
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
const int N = 1e6 + 5;
const in... | [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 766,903 | 766,904 | u382773334 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
b.at(n) = 0;
int ans = 0;
for (int i = 0; i < n + 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
b.at(n) = 0;
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
... | [
"variable_declaration.type.change"
] | 766,905 | 766,906 | u548778623 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
b.at(n) = 0;
int ans = 0;
for (int i = 0; i < n + 1; i++) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
b.at(n) = 0;
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
... | [
"variable_declaration.type.change"
] | 766,907 | 766,906 | u548778623 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
int dec = min(b[i], a[i]);
b[i] -= dec;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
int dec = min(b[i], a[i]);
b[i] -= dec;
... | [
"assignment.change"
] | 766,912 | 766,913 | u804999113 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | [
"assignment.change"
] | 766,914 | 766,915 | u624678037 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
//#include <tuple>
//#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define pb push_back
int main() {
int N;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
//#include <tuple>
//#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define pb push_back
int main() {
int N;
... | [
"variable_declaration.type.change"
] | 766,916 | 766,917 | u662852612 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep... | [
"call.add",
"call.arguments.change"
] | 766,918 | 766,919 | u213006031 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int a[100050], b;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
int tmp = 0, flg = 0;
tmp = a[0];
for (int i = 0; i < n; i++) {
cin >> b;
if (a[i] - b < 0) {
if (a[i + 1] - (b - a[i]) < 0) {
... | #include <bits/stdc++.h>
using namespace std;
int a[100050], b;
int main() {
int n;
cin >> n;
long long cnt = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
int tmp = 0, flg = 0;
tmp = a[0];
for (int i = 0; i < n; i++) {
cin >> b;
if (a[i] - b < 0) {
if (a[i + 1] - (b - a[i]) < 0) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,920 | 766,921 | u803754262 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<long long> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
auto ans = 0L;
for (int i = 0; i < n; ++i) {
if (a[i] >= b[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<long long> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
auto ans = 0L;
for (int i = 0; i < n; ++i) {
if (a[i] >= b[i]... | [
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 766,924 | 766,925 | u519194615 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
map<string, int> mp;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
int left = min(a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
map<string, int> mp;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
int left = min(a[... | [
"variable_declaration.type.change"
] | 766,928 | 766,929 | u139255323 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (long long i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (long long i = 0; i < N; i++) {
cin >> B[i];
}
long long count = 0;
for (long long i = N; i >... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (long long i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (long long i = 0; i < N; i++) {
cin >> B[i];
}
long long count = 0;
for (long long i = N; i >... | [
"expression.operation.binary.remove"
] | 766,932 | 766,933 | u316491370 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> s(n);
int ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i+... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> s(n);
long long ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,934 | 766,935 | u762182313 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> s(n);
int ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> s(n);
long long ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,936 | 766,935 | u762182313 | cpp |
p02959 | /*|In The Name of Allah|*/
/* Dear GCC compiler:
*
* If my code doesn't compile, this doesn't mean it's wrong.
* It just mean that you don't understand what I want.
* Here's my safety pig, I hope my code compile and get accepted.
* _._ _..._ .-', _.._(`))
*'-. ` ' /-._.-' ',/
* ) \ ... | /*|In The Name of Allah|*/
/* Dear GCC compiler:
*
* If my code doesn't compile, this doesn't mean it's wrong.
* It just mean that you don't understand what I want.
* Here's my safety pig, I hope my code compile and get accepted.
* _._ _..._ .-', _.._(`))
*'-. ` ' /-._.-' ',/
* ) \ ... | [
"assignment.change"
] | 766,937 | 766,938 | u960507774 | cpp |
p02959 | /*|In The Name of Allah|*/
/* Dear GCC compiler:
*
* If my code doesn't compile, this doesn't mean it's wrong.
* It just mean that you don't understand what I want.
* Here's my safety pig, I hope my code compile and get accepted.
* _._ _..._ .-', _.._(`))
*'-. ` ' /-._.-' ',/
* ) \ ... | /*|In The Name of Allah|*/
/* Dear GCC compiler:
*
* If my code doesn't compile, this doesn't mean it's wrong.
* It just mean that you don't understand what I want.
* Here's my safety pig, I hope my code compile and get accepted.
* _._ _..._ .-', _.._(`))
*'-. ` ' /-._.-' ',/
* ) \ ... | [
"variable_declaration.type.change",
"assignment.change"
] | 766,939 | 766,938 | u960507774 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
using namespace std;
int main(void) {
int N;
cin >> N;
int A[N + 1], B[N], A_copy[N + 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
copy(A, A + N + 1, A_copy);
for... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
using namespace std;
int main(void) {
int N;
cin >> N;
int A[N + 1], B[N], A_copy[N + 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
copy(A, A + N + 1, A_copy);
for... | [
"variable_declaration.type.primitive.change"
] | 766,940 | 766,941 | u710789518 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
if... | [
"variable_declaration.type.change"
] | 766,944 | 766,945 | u430209651 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
if... | [
"variable_declaration.type.change",
"assignment.value.change"
] | 766,946 | 766,945 | u430209651 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
if... | [
"variable_declaration.type.change",
"assignment.value.change"
] | 766,948 | 766,945 | u430209651 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n; // no of heroes
cin >> n;
int a[n + 1]; // no of towns n+1 a[i] is no of monsters attacking
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
int b[n]; // heroes fighting number
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
... | #include <iostream>
using namespace std;
int main() {
int n; // no of heroes
cin >> n;
int a[n + 1]; // no of towns n+1 a[i] is no of monsters attacking
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
int b[n]; // heroes fighting number
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long int ... | [
"variable_declaration.type.widen.change"
] | 766,949 | 766,950 | u478964347 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, ans = 0;
cin >> n;
vector<int> a, b;
for (int i = 0; i < n + 1; i++) {
int x;
cin >> x;
ans += x;
a.push_back(x);
}
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (a[i] > x) {
a[i] = a[i] - x;
} e... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
long long ans = 0;
cin >> n;
vector<int> a, b;
for (int i = 0; i < n + 1; i++) {
int x;
cin >> x;
ans += x;
a.push_back(x);
}
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (a[i] > x) {
a[i] = a[i] ... | [
"variable_declaration.type.widen.change"
] | 766,951 | 766,952 | u750028862 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
;
int n, a[N], b[N];
int main() {
cin >> 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++) {
ans += min(a[i], b[i]);
b[i] = max(0, b[i] - a[i]);
... | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
;
int n, a[N], b[N];
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int64_t ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i], b[i]);
b[i] = max(0, b[i] - a[i])... | [
"variable_declaration.type.primitive.change"
] | 766,961 | 766,962 | u385825353 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
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() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
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() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | [
"variable_declaration.type.change"
] | 766,963 | 766,964 | u115838990 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int a[110000], b[110000];
cin >> n;
int i;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (i = 0; i < n; i++) {
if (b[i] - a[i] < 0) {
ans += b[i];... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int a[110000], b[110000];
cin >> n;
int i;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
long long ans = 0;
for (i = 0; i < n; i++) {
if (b[i] - a[i] < 0) {
ans +=... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,965 | 766,966 | u836743234 | cpp |
p02959 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include <... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include <... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,967 | 766,968 | u917972976 | cpp |
p02959 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" :... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" :... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,969 | 766,970 | u917972976 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | [
"variable_declaration.type.change"
] | 766,975 | 766,976 | u310790595 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------... | [
"variable_declaration.type.change"
] | 766,977 | 766,978 | u118340517 | 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++) {
int a;
cin >> a;
A.at(i) = a;
}
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
int ans = 0;
int next = 0;
fo... | #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++) {
int a;
cin >> a;
A.at(i) = a;
}
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
int64_t ans = 0;
int next = 0;... | [
"variable_declaration.type.primitive.change"
] | 766,979 | 766,980 | u536916602 | 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++) {
int a;
cin >> a;
A.at(i) = a;
}
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
int ans = 0;
/* int next = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
int a;
cin >> a;
A.at(i) = a;
}
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
int64_t ans = 0;
/* int next =... | [
"variable_declaration.type.primitive.change"
] | 766,982 | 766,983 | u536916602 | cpp |
p02959 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// read input
int n;
vector<int> a;
vector<int> b;
cin >> n;
int tmp;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// read input
int n;
vector<int> a;
vector<int> b;
cin >> n;
int tmp;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int... | [
"variable_declaration.type.primitive.change"
] | 766,986 | 766,987 | u670575468 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
typedef long long ll;
int main() {
int n;
cin >> n;
vecto... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
typedef long long ll;
int main() {
int n;
cin >> n;
vecto... | [
"variable_declaration.type.change"
] | 766,988 | 766,989 | u702051956 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n + 1] = {0};
int b[n] = {0};
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]) { // monsters > capacit... | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n + 1] = {0};
int b[n] = {0};
long long 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]) { // monsters... | [
"variable_declaration.type.widen.change"
] | 766,996 | 766,997 | u500544894 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
// Input
int N = 0;
cin >> N;
int A[N + 1] = {0};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
int B[N] = {0};
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
int a = A[i];
int b = B... | #include <iostream>
using namespace std;
int main() {
// Input
int N = 0;
cin >> N;
int A[N + 1] = {0};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
int B[N] = {0};
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
int a = A[i];
int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,998 | 766,999 | u395536066 | cpp |
p02959 | #define _GLIBCXX_DEBUG
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
... | #define _GLIBCXX_DEBUG
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
... | [
"variable_declaration.type.change",
"assignment.change"
] | 767,007 | 767,006 | u999989620 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<long> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a.at(i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<long> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a.at(i... | [
"variable_declaration.type.primitive.change"
] | 767,008 | 767,009 | u999989620 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n, sum = 0;
cin >> n;
ll a[n + 1], b;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b;
if (b <= a[i]) {
a[i] -= b;
} else {
b -= a[i];
a[... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
ll sum = 0;
cin >> n;
ll a[n + 1], b;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b;
if (b <= a[i]) {
a[i] -= b;
} else {
b -= a[i];
... | [] | 767,024 | 767,025 | u991136459 | cpp |
p02959 | // Author: getharshkumar
#include <bits/stdc++.h>
using namespace std;
#define ll int
const ll N = 1e6 + 6, M = 1e9 + 7;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
ll n;
cin >> n;
ll s = 0;
vector<ll> a(n + 1), b(n);
for (ll &e : a)
cin >> e, s += e;
for (ll &e : b)
cin >> e;
f... | // Author: getharshkumar
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const ll N = 1e6 + 6, M = 1e9 + 7;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
ll n;
cin >> n;
ll s = 0;
vector<ll> a(n + 1), b(n);
for (ll &e : a)
cin >> e, s += e;
for (ll &e : b)
cin >> e;... | [
"preprocessor.define.value.change"
] | 767,026 | 767,027 | u319625425 | 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(N + 2);
vector<int> b(N + 1);
rep(i, N + 1) cin >> a[i];
rep(i, N) cin >> b[i];
int ans = 0;
rep(i, N + 1) {
if (b[i] > a[i]) {
int d... | #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(N + 2);
vector<ll> b(N + 1);
rep(i, N + 1) cin >> a[i];
rep(i, N) cin >> b[i];
ll ans = 0;
rep(i, N + 1) {
if (b[i] > a[i]) {
ll diff ... | [
"variable_declaration.type.change"
] | 767,028 | 767,029 | u021755470 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
long long A[1000001];
long long B[1000000];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long ans = 0;
for (int i = 0; i <= N - 1; i++) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
long long A[1000001];
long long B[1000000];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long ans = 0;
for (int i = 0; i <= N - 1; i++) ... | [
"assignment.change"
] | 767,030 | 767,031 | u455366471 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
long long A[100001];
long long B[100000];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long ans = 0;
for (int i = 0; i <= N - 1; i++) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
long long A[1000001];
long long B[1000000];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long ans = 0;
for (int i = 0; i <= N - 1; i++) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 767,032 | 767,031 | u455366471 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n + 1);
vector<int> vb(n);
for (int i = 0; i < n + 1; i++)
cin >> va[i];
for (int j = 0; j < n; j++)
cin >> vb[j];
int sum = 0;
for (int i = 0; i < n; i++) {
int x = min(va[i], vb[i]);
sum += x;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n + 1);
vector<int> vb(n);
for (int i = 0; i < n + 1; i++)
cin >> va[i];
for (int j = 0; j < n; j++)
cin >> vb[j];
long long sum = 0;
for (int i = 0; i < n; i++) {
int x = min(va[i], vb[i]);
sum +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,033 | 767,034 | u494904817 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a[100000] = {}, b[100000] = {}, ans = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i])... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a[100005] = {}, b[100005] = {}, ans = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i])... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 767,037 | 767,036 | u401900157 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a[100000] = {}, b[100000] = {}, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a[100005] = {}, b[100005] = {}, ans = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i])... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 767,038 | 767,036 | u401900157 | cpp |
p02959 | #include <iostream>
#include <string>
using namespace std;
#define MAX 100005
#define min(x, y) ((x) < (y)) ? x : y
int main() {
unsigned int N, A[MAX], B[MAX];
string judge = "Yes";
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int tmpii = min(A[0], B... | #include <iostream>
#include <string>
using namespace std;
#define MAX 100005
#define min(x, y) ((x) < (y)) ? x : y
int main() {
long N, A[MAX], B[MAX];
string judge = "Yes";
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long tmpii = min(A[0], B[0]);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 767,044 | 767,045 | u652760628 | cpp |
p02959 | #include <iostream>
#include <string>
using namespace std;
#define MAX 100000
#define min(x, y) ((x) < (y)) ? x : y
int main() {
int N, A[MAX], B[MAX];
string judge = "Yes";
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int tmpii = min(A[0], B[0]);
i... | #include <iostream>
#include <string>
using namespace std;
#define MAX 100005
#define min(x, y) ((x) < (y)) ? x : y
int main() {
long N, A[MAX], B[MAX];
string judge = "Yes";
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long tmpii = min(A[0], B[0]);
... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.primitive.change"
] | 767,046 | 767,045 | u652760628 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int right, left;
int ans = 0;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int right, left;
long long ans = 0;
for (int i = 0; i < n; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,050 | 767,051 | u420421811 | 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<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
ll left = min(a[i], b[i]);
a[i] -= le... | #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(n + 1);
vector<ll> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
ll left = min(a[i], b[i]);
a[i] -= le... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 767,061 | 767,062 | u681559222 | cpp |
p02959 | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <... | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <... | [
"variable_declaration.type.change"
] | 767,063 | 767,064 | u166277273 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int N;
cin >> N;
vi A(N), B(N - 1);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
int count = 0;
rep(i, N) {
// 正面撃破
// モンスターの方が多い場合
... | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int N;
cin >> N;
vi A(N + 1), B(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long count = 0;
rep(i, N) {
// 正面撃破
// モンスターの方が多い場合
... | [
"expression.operation.binary.remove",
"variable_declaration.type.primitive.change"
] | 767,070 | 767,069 | u664652017 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define fi(p) for (int i = 0; i < (p); i++)
#define ce(d) cout <... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define fi(p) for (int i = 0; i < (p); i++)
#define ce(d) cout <... | [
"assignment.change"
] | 767,080 | 767,081 | u411637381 | cpp |
p02959 | #include <iostream>
#include <vector>
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 answer = 0;
for (int i = 0; i < N; i++) {
int left... | #include <iostream>
#include <vector>
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 answer = 0;
for (int i = 0; i < N; i++) {
long le... | [
"variable_declaration.type.primitive.change"
] | 767,086 | 767,087 | u865500049 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
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);
}
long int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) > b.at(i))
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
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);
}
long int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >= b.at(i))
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,088 | 767,089 | u431602218 | 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 answer = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= 1; j++) {
int... | #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];
int64_t answer = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= 1; j++) {
... | [
"variable_declaration.type.primitive.change"
] | 767,090 | 767,091 | u599568485 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N, monster = 0, help = 0;
cin >> N;
int A[N + 1], B[N + 1];
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
B[N] = 0;
for (int i = 0; i < N + 1; i++) {
if (A[i] <= help + B[i]) {
monster += A... | #include <iostream>
using namespace std;
int main() {
int N, help = 0;
long long monster = 0;
cin >> N;
int A[N + 1], B[N + 1];
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
B[N] = 0;
for (int i = 0; i < N + 1; i++) {
if (A[i] <= help + B[i]) {
... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 767,094 | 767,095 | u979181068 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define forn(i, n) for ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define forn(i, n) for ... | [
"assignment.change"
] | 767,096 | 767,097 | u629521741 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <s... | [
"assignment.change"
] | 767,098 | 767,099 | u187453157 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <s... | [
"variable_declaration.type.change",
"assignment.change"
] | 767,100 | 767,099 | u187453157 | cpp |
p02959 | #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];
int M = 0;
for (int i = 0; i < N + 1; i++)
M += A[i];
int L = 0;
for (int i = N - 1;... | #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 M = 0;
for (int i = 0; i < N + 1; i++)
M += A[i];
long L = 0;
for (int i = N - ... | [
"variable_declaration.type.primitive.change"
] | 767,101 | 767,102 | u089578476 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.