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;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1, 0);
vector<ll> B(N, 0);
for (ll i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (ll i = 0; i < N; i++) {
cin >> B.at(i);
}
ll ans ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1, 0);
vector<ll> B(N, 0);
for (ll i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (ll i = 0; i < N; i++) {
cin >> B.at(i);
}
ll ans ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 767,107 | 767,108 | u343935874 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int32_t N;
cin >> N;
vector<int32_t> A(N + 1), B(N);
for (int32_t i = 0; i < N + 1; i++) {
cin... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int32_t N;
cin >> N;
vector<int64_t> A(N + 1), B(N);
for (int32_t i = 0; i < N + 1; i++) {
cin... | [
"variable_declaration.type.primitive.change"
] | 767,113 | 767,114 | u519382463 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// data loader
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];
}
// main
int rem = 0;
if (a[0] < b[0]) {
rem += a[0];
b[0] -= a[0];
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
// data loader
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];
}
// main
long long rem = 0;
if (a[0] < b[0]) {
rem += a[0];
b[0] -= a[0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,119 | 767,120 | u498066729 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// data loader
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];
}
// main
int rem = 0;
if (a[0] < b[0]) {
rem += a[0];
b[0] -= a[0];
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
// data loader
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];
}
// main
long long rem = 0;
if (a[0] < b[0]) {
rem += a[0];
b[0] -= a[0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 767,121 | 767,120 | u498066729 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int sum = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
sum += B[i];
A[i] = A[i] - B[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long sum = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
sum += B[i];
A[i] = A[i] - B[i];
... | [
"variable_declaration.type.primitive.change"
] | 767,122 | 767,123 | u423656246 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
ll n;
ll a[100010];
ll b[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
ll n;
ll a[100010];
ll b[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n... | [
"expression.operation.binary.remove"
] | 767,128 | 767,129 | u522566752 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
int n;
ll a[100010];
ll b[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= ... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
ll n;
ll a[100010];
ll b[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 767,130 | 767,129 | u522566752 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt;
int n;
cin >> n;
ll a[n + 1], b[n];
for (i = 0; i < n + 1; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
ll sum = 0;
for (i = 0; i < n; i++) {
if (a[i] >= b[i])
sum += b[i];
el... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt;
int n;
cin >> n;
ll a[n + 1], b[n];
for (i = 0; i < n + 1; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
ll sum = 0;
for (i = 0; i < n; i++) {
if (a[i] >= b[i])
sum += b[i];
el... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 767,131 | 767,132 | u952130512 | 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 p = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) + a.at(i + 1) < b.at(i)) {
... | #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);
}
int64_t p = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) + a.at(i + 1) < b.at(i)) {
... | [
"variable_declaration.type.primitive.change"
] | 767,133 | 767,134 | u356701928 | cpp |
p02959 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
static const int MAX = 100001;
int main() {
int N, A[MAX], B[MAX];
cin >> N;
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
int monster = 0;
for (int i = 0; i < N; ++i) {
int now = min(A... | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
static const int MAX = 100001;
int main() {
ll N, A[MAX], B[MAX];
cin >> N;
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
ll monster = 0;
for (int i = 0; i < N; ++i) {
ll now = min(A[i]... | [
"variable_declaration.type.change"
] | 767,135 | 767,136 | u616461826 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<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;
int ans = 0;
int nokori = 0;
for (int i = 0; i < n + 1; i++) {
if (a[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long 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;
long int ans = 0;
long int nokori = 0;
for (int i = 0; i < n + 1; i++)... | [
"variable_declaration.type.widen.change"
] | 767,137 | 767,138 | u332946309 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int sum = 0;
for (int i = 0; i < n; i++) {
// c... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long int sum = 0;
for (int i = 0; i < n; i++) ... | [
"variable_declaration.type.widen.change"
] | 767,140 | 767,141 | u053227023 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int sum = 0;
for (int i = 0; i < n; i++) {
// c... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long int sum = 0;
for (int i = 0; i < n; i++) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 767,142 | 767,141 | u053227023 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll a[n + 1], b[n];
for (int i = 0; i < (n + 1); ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
ll res = 0;
for (int i = 0; i < n; ++i) {
if ((a[i] + a[i + 1]) < b[i]) {
res += ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll a[n + 1], b[n];
for (int i = 0; i < (n + 1); ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
ll res = 0;
for (int i = 0; i < n; ++i) {
if ((a[i] + a[i + 1]) > b[i]) {
res += ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,143 | 767,144 | u294683729 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
ans += ... | #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 ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
ans +=... | [
"variable_declaration.type.primitive.change"
] | 767,145 | 767,146 | u006721330 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
ans += ... | #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;
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
a... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,145 | 767,147 | u006721330 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<long long> A(N + 1, 0);
vector<long long> B(N + 1, 0);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
int ans = 0;
rep... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
cin >> N;
vector<long long> A(N + 1, 0);
vector<long long> B(N + 1, 0);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
long long an... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,150 | 767,151 | u789101777 | cpp |
p02959 | #ifdef LOCAL111
#else
#pragma GCC optimize("O3")
#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ' ' << p.second << ')';
return os;
... | #ifdef LOCAL111
#else
#pragma GCC optimize("O3")
#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ' ' << p.second << ')';
return os;
... | [
"expression.operation.binary.remove"
] | 767,152 | 767,153 | u412820911 | cpp |
p02959 |
#include <bits/stdc++.h>
using namespace std;
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const ch... |
#include <bits/stdc++.h>
using namespace std;
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const ch... | [] | 767,154 | 767,155 | u155985376 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i... | [
"variable_declaration.type.widen.change"
] | 767,158 | 767,159 | u732502311 | cpp |
p02959 | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n... | [
"assignment.change"
] | 767,166 | 767,167 | u468262978 | cpp |
p02959 | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n... | [
"variable_declaration.type.change"
] | 767,168 | 767,169 | u468262978 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
template <class T> bool chmax(T ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
template <class T> bool chmax(T ... | [
"variable_declaration.type.change"
] | 767,174 | 767,175 | u502389123 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++)... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
long long ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,180 | 767,181 | u582357587 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++)... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
long long ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 767,182 | 767,181 | u582357587 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++)... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
long long ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 767,183 | 767,181 | u582357587 | cpp |
p02959 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"variable_declaration.type.change"
] | 767,187 | 767,188 | u962241803 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vii = vector<vi>;
int main() {
int n;
cin >> n;
vi a(n + 2), b(n + 1);
rep(i, n + 1) cin >> a[i + 1];
rep(i, n) cin >> b[i + 1];
// rep(i, n + 2) cout << a[i];
//... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vii = vector<vi>;
int main() {
int n;
cin >> n;
vi a(n + 2), b(n + 1);
rep(i, n + 1) cin >> a[i + 1];
rep(i, n) cin >> b[i + 1];
// rep(i, n + 2) cout << a[i];
//... | [
"variable_declaration.type.widen.change"
] | 767,189 | 767,190 | u654115433 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iomanip>
#include <unordered_map>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n + 1) { cin >> a.at(i); }
vector<ll> b(n);
rep(i, n) { cin >> b.at(i); }
int coun... | #include <bits/stdc++.h>
#include <iomanip>
#include <unordered_map>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n + 1) { cin >> a.at(i); }
vector<ll> b(n);
rep(i, n) { cin >> b.at(i); }
ll count... | [
"variable_declaration.type.change"
] | 767,194 | 767,195 | u295618957 | 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<int> A(n), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
rep(i, n) cin >> B[i];
int ans = 0;
rep(i, n) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[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<int> A(n), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
rep(i, n) cin >> B[i];
long long ans = 0;
rep(i, n) {
if (B[i] >= A[i] + A[i + 1]) {
ans ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,196 | 767,197 | u510383220 | 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<int> A(n), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
rep(i, n) cin >> B[i];
int ans = 0;
rep(i, n) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[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<int> A(n), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
rep(i, n) cin >> B[i];
long long ans = 0;
rep(i, n) {
if (B[i] >= A[i] + A[i + 1]) {
ans ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,198 | 767,197 | u510383220 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | [
"variable_declaration.type.change"
] | 767,201 | 767,202 | u170650966 | 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 answer = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
b.at(i... | #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 long answer = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,203 | 767,204 | u752904037 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long sum;
cin >> n;
vector<int> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
sum += B[... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long sum = 0;
cin >> n;
vector<int> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
sum +... | [
"variable_declaration.value.change"
] | 767,205 | 767,206 | u247407965 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
sum += B[i];... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long sum = 0;
cin >> n;
vector<int> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
sum +... | [
"variable_declaration.type.widen.change"
] | 767,207 | 767,206 | u247407965 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int hoge;
vector<int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
if... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
int hoge;
vector<int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,208 | 767,209 | u728894486 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int hoge;
vector<int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
/*... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
int hoge;
vector<int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,210 | 767,211 | u728894486 | 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 ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a.at(i), b.at(i));
b.at(i)... | #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 long ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a.at(i), b.at(i));
b... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,212 | 767,213 | u522993719 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> monsters, savers;
for (int i = 0; i < N + 1; i++) {
int monsterNum;
cin >> monsterNum;
monsters.push_back(monsterNum);
}
for (int i = 0; i < N; i++) {
int saverNum;
cin >> saverNum;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> monsters, savers;
for (int i = 0; i < N + 1; i++) {
int monsterNum;
cin >> monsterNum;
monsters.push_back(monsterNum);
}
for (int i = 0; i < N; i++) {
int saverNum;
cin >> saverNum;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,216 | 767,217 | u694725414 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define FORall(it, a) \
for (__typeof((a).begin()) it = (a).begi... | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define FORall(it, a) \
for (__typeof((a).begin()) it = (a).begi... | [
"variable_declaration.type.change"
] | 767,222 | 767,223 | u871436624 | cpp |
p02959 | #include <bits/stdc++.h>
#include <vector>
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main(void) {
int N, cnt = 0;
cin >> N;
V<long long> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
r... | #include <bits/stdc++.h>
#include <vector>
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main(void) {
int N;
long long cnt = 0;
cin >> N;
V<long long> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >... | [
"variable_declaration.type.widen.change"
] | 767,224 | 767,225 | u144980750 | cpp |
p02959 | #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int city[n + 1];
int yusya[n];
rep(i, n + 1) { cin >> city[i]; }
rep(i, n) { cin >> yusya[i]; ... | #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
long n;
cin >> n;
int city[n + 1];
int yusya[n];
rep(i, n + 1) { cin >> city[i]; }
rep(i, n) { cin >> yusya[i];... | [
"variable_declaration.type.primitive.change"
] | 767,226 | 767,227 | u259590403 | cpp |
p02959 | #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int city[n + 1];
int yusya[n];
rep(i, n + 1) { cin >> city[i]; }
rep(i, n) { cin >> yusya[i]; ... | #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
long n;
cin >> n;
int city[n + 1];
int yusya[n];
rep(i, n + 1) { cin >> city[i]; }
rep(i, n) { cin >> yusya[i];... | [
"variable_declaration.type.primitive.change"
] | 767,230 | 767,227 | u259590403 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i) {
if (i == ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size(... | [] | 767,232 | 767,233 | u904833081 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> A(N + 1), B(N);
// A monster
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)) {
s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long sum = 0;
cin >> N;
vector<int> A(N + 1), B(N);
// A monster
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... | [
"variable_declaration.type.widen.change"
] | 767,234 | 767,235 | u028572059 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// cout << N << endl;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// cout << N << endl;
vector<long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long ans = 0;
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 767,241 | 767,242 | u942160358 | cpp |
p02959 | #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
repeat(i, N + 1) cin >> A[i];
vector<int> B(N);
repeat(i, N) cin >> B[i];
int ans = 0;
repeat(i, N) {
int e1 = min(A[i], B[i]);
ans += e1;
B[... | #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
repeat(i, N + 1) cin >> A[i];
vector<int> B(N);
repeat(i, N) cin >> B[i];
long long ans = 0;
repeat(i, N) {
int e1 = min(A[i], B[i]);
ans += e1;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,249 | 767,250 | u726060136 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | [
"variable_declaration.type.change"
] | 767,251 | 767,252 | u938389536 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; ++i)
cin >> a[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
int x = min(a[i], b);
ans += x;
b -= x;
x = min(a[i + 1], b);
ans += x;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; ++i)
cin >> a[i];
long long ans = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
int x = min(a[i], b);
ans += x;
b -= x;
x = min(a[i + 1], b);
ans += ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,253 | 767,254 | u301109982 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int ans = 0;
for (int i = 0; i < n + 1; i++) {
for (int j = -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> 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);
}
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
for (int j = -1... | [
"variable_declaration.type.change"
] | 767,257 | 767,258 | u194421002 | cpp |
p02959 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... | [
"variable_declaration.type.change"
] | 767,263 | 767,264 | u117615163 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
ans += min(b[i], a[i]);
b[i] -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long int ans = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
ans += min(b[i], a[i]);
... | [
"variable_declaration.type.widen.change"
] | 767,267 | 767,268 | u045575753 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int ans[100001];
int main() {
int n;
cin >> n;
int a[100001], b[100001];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int f = min(a[i], b[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int ans[100001];
int main() {
int n;
cin >> n;
int a[100001], b[100001];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
int f = min(a[i], b[i]... | [
"variable_declaration.type.change"
] | 767,271 | 767,272 | u812475404 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
ll a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i... | [
"variable_declaration.type.change"
] | 767,273 | 767,274 | u708258059 | 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, dis = 0;
for (int i = 0; i < N; i++) {
dis = A.at(i) - B.at(i);
i... | #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);
}
int64_t cnt = 0, dis = 0;
for (int i = 0; i < N; i++) {
dis = A.at(i) - B.at(i);
... | [
"variable_declaration.type.primitive.change"
] | 767,282 | 767,283 | u564185267 | cpp |
p02959 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | [
"variable_declaration.type.change"
] | 767,286 | 767,287 | u216772548 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> m(N + 1);
vector<int> h(N);
int r = 0;
for (int i = 0; i < N + 1; i++) {
cin >> m.at(i);
}
for (int n = 0; n < N; n++) {
cin >> h.at(n);
}
for (int i = 0; i < N; i++) {
if (m.at(i) - h.at(i) >= 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> m(N + 1);
vector<int> h(N);
long long r = 0;
for (int i = 0; i < N + 1; i++) {
cin >> m.at(i);
}
for (int n = 0; n < N; n++) {
cin >> h.at(n);
}
for (int i = 0; i < N; i++) {
if (m.at(i) - h.at(i) >= ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,292 | 767,293 | u066647962 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
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);
}
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;
long count = 0;
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);
}
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {... | [
"variable_declaration.type.primitive.change"
] | 767,303 | 767,304 | u438592861 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
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);
}
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;
long count = 0;
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);
}
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {... | [
"variable_declaration.type.primitive.change"
] | 767,305 | 767,304 | u438592861 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
vector<int> A;
int main() {
int N, mon, yu, count = 0;
cin >> N;
for (int i = 0; i <= N; i++) {
cin >> mon;
A.push_back(mon);
}
for (int i = 0; i < N; i++) {
cin >> yu;
if (A[i] >= yu) {
count += yu;
} else {
count += A[i];
... | #include <bits/stdc++.h>
using namespace std;
vector<int> A;
int main() {
int N, mon, yu;
long count = 0;
cin >> N;
for (int i = 0; i <= N; i++) {
cin >> mon;
A.push_back(mon);
}
for (int i = 0; i < N; i++) {
cin >> yu;
if (A[i] >= yu) {
count += yu;
} else {
count += A[i];... | [
"variable_declaration.type.widen.change"
] | 767,306 | 767,307 | u522200796 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll ans = 0;
int n;
scanf("%d", &n);
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < n; i++) {
scanf("%d", b + i);
}
for (int i = 0, j = 0; i < n + 1 && j < n;) {
i... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll ans = 0;
int n;
scanf("%d", &n);
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < n; i++) {
scanf("%d", b + i);
}
for (int i = 0, j = 0; i < n + 1 && j < n;) {
i... | [
"expression.operation.binary.remove",
"assignment.change"
] | 767,308 | 767,309 | u625436307 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
int kill = 0;
// i番目の街について考える
for (int kaor... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
long kill = 0;
// i番目の街について考える
for (i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,310 | 767,311 | u229213815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
int ans = 0;
// i番目の街について考える
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
long long ans = 0;
// i番目の街について考える
fo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,312 | 767,313 | u229213815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
int ans = 0;
// i番目の街について考える
for (int kaori... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
long long ans = 0;
// i番目の街について考える
fo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,314 | 767,313 | u229213815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n, ans, a[100000], b[100000], x;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cin >> b[i];
ans += min(b[i], a[i]);
if (b[i] - a[i] > 0) {
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
... | #include <bits/stdc++.h>
using namespace std;
long long n, ans, a[1000000], b[1000000], x;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cin >> b[i];
ans += min(b[i], a[i]);
if (b[i] - a[i] > 0) {
b[i] -= a[i];
ans += min(b[i], a[i + ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 767,317 | 767,316 | u087818812 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int a[110000], b[110000];
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 (b[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
long a[110000], b[110000];
for (int i = 0; i <= N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
long sum = 0;
for (int i = 0; i < N; i++) {
if (b... | [
"variable_declaration.type.primitive.change"
] | 767,320 | 767,321 | u126833093 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
int main() {
int n;
cin >>... | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
int main() {
ll n;
cin >> ... | [
"variable_declaration.type.change",
"variable_declaration.type.narrow.change"
] | 767,322 | 767,323 | u453071216 | cpp |
p02959 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 767,324 | 767,325 | u874996917 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
int ans = 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] > 0) {
ans += B[i];
A[i] = A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long int A[N + 1], B[N];
long int ans = 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] > 0) {
ans += B[i];
... | [
"variable_declaration.type.widen.change"
] | 767,330 | 767,331 | u447604786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
int ans = 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] >= 0) {
ans += B[i];
A[i] = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long int A[N + 1], B[N];
long int ans = 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] > 0) {
ans += B[i];
... | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,332 | 767,331 | u447604786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monsters(n + 1);
vector<int> heroes(n);
for (int i = 0; i <= n; i++) {
cin >> monsters[i];
}
for (int i = 0; i < n; i++) {
cin >> heroes[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (monsters[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monsters(n + 1);
vector<int> heroes(n);
for (int i = 0; i <= n; i++) {
cin >> monsters[i];
}
for (int i = 0; i < n; i++) {
cin >> heroes[i];
}
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (... | [
"variable_declaration.type.widen.change"
] | 767,333 | 767,334 | u658234551 | 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 + 1);
vector<int> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
int ans = 0;
rep(i, n + 1) {
if ((a[i] - b[i]) ... | #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 + 1);
vector<int> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
ll ans = 0;
rep(i, n + 1) {
if ((a[i] - b[i]) <... | [
"variable_declaration.type.change"
] | 767,335 | 767,336 | u341388158 | 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 + 1);
vector<int> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
int ans = 0;
rep(i, n + 1) {
if (a[i] - b[i] < ... | #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 + 1);
vector<int> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
ll ans = 0;
rep(i, n + 1) {
if ((a[i] - b[i]) <... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 767,337 | 767,336 | u341388158 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef long double ld;
int main() {
int N;
cin >> N;
ll A[N], B[N];
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int count = 0;
for (int i = 0; i < N; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef long double ld;
int main() {
int N;
cin >> N;
ll A[N], B[N];
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
ll count = 0;
for (int i = 0; i < N; i... | [
"variable_declaration.type.change"
] | 767,338 | 767,339 | u520791604 | cpp |
p02959 | #include "iostream"
#include "vector"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
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 cnt = 0;
rep(i, N) {
if (B[i] >= A[i]) {
B[i] -= A[i];
cnt += A[i];... | #include "iostream"
#include "vector"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
long long N;
cin >> N;
vector<long long> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
long long cnt = 0;
rep(i, N) {
if (B[i] >= A[i]) {
B[i] -= A[i];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,340 | 767,341 | u887207211 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n, m) for (int i = n; i < m; i++)
#define REPR(i, n, m) for (int i = n; i >= m; i--)
#define LREP(i, n, m) for (ll i = n; i < m; i++)
#define LREPR(i, n, m) for (ll i = n; i >= m; i--)
#define P pair<int, int>
const int INF = 1e9 + 1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n, m) for (int i = n; i < m; i++)
#define REPR(i, n, m) for (int i = n; i >= m; i--)
#define LREP(i, n, m) for (ll i = n; i < m; i++)
#define LREPR(i, n, m) for (ll i = n; i >= m; i--)
#define P pair<int, int>
const int INF = 1e9 + 1;... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 767,342 | 767,343 | u052746401 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 1.0e5 + 100;
int A[MAX_N + 1], B[MAX_N];
int main() {
cin >> N;
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 1.0e5 + 100;
int A[MAX_N + 1], B[MAX_N];
int main() {
cin >> N;
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] >... | [
"variable_declaration.type.change"
] | 767,344 | 767,345 | u488352661 | cpp |
p02959 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
... | [
"variable_declaration.type.change"
] | 767,346 | 767,347 | u687470137 | cpp |
p02959 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else if (a[i]... |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else if... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,350 | 767,351 | u289709148 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a)... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a)... | [
"assignment.change"
] | 767,362 | 767,363 | u876335718 | 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];
}
long ans = 0;
for (int i = 0; i < n; i++) {
long n = min(a[i], b[i]);
a... | #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 ans = 0;
for (int i = 0; i < n; i++) {
long n = min(a[i], b[i]);
a... | [
"assignment.change"
] | 767,364 | 767,365 | u033627628 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mnst(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> mnst.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (mnst.at(i) >... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mnst(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> mnst.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if (mnst.at(... | [
"variable_declaration.type.primitive.change"
] | 767,366 | 767,367 | u091552241 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define INF 1e9
typedef long long ll;
using n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define INF 1e9
typedef long long ll;
using n... | [
"variable_declaration.type.change"
] | 767,368 | 767,369 | u008582165 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n, a[100001], b[100000], sum = 0;
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
sum += b[i];
} else {
sum += a[i];
b[i... | #include <iostream>
using namespace std;
int main() {
int n;
long long int a[100001], b[100000], sum = 0;
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
sum += b[i];
} else {
sum +=... | [
"variable_declaration.type.widen.change"
] | 767,370 | 767,371 | u522506260 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (... | [
"variable_declaration.type.change",
"assignment.change"
] | 767,372 | 767,373 | u917282863 | 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 + 1);
vector<int> b(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if ((a[i] + a[i + 1]) < b[i]) {
... | #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 + 1);
vector<int> b(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if ((a[i] + a[i + 1]) < b[i]) {
... | [
"variable_declaration.type.change"
] | 767,374 | 767,375 | u734857533 | 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 + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if ((a[i] + a[i + 1]) < b[i]) {
... | #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 + 1);
vector<int> b(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if ((a[i] + a[i + 1]) < b[i]) {
... | [
"call.arguments.change",
"variable_declaration.type.change"
] | 767,376 | 767,375 | u734857533 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 400000;
int main(... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 400000;
int main(... | [
"variable_declaration.type.change"
] | 767,377 | 767,378 | u004411048 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 400000;
int main(... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 400000;
int main(... | [
"variable_declaration.type.change"
] | 767,379 | 767,378 | u004411048 | cpp |
p02959 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"variable_declaration.type.widen.change"
] | 767,384 | 767,385 | u491330513 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, num, cnt = 0;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
num = min(a[i], b[i]);
a[i] -= num;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, num, cnt = 0;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
num = min(a[i], b[i]);
a[i] -= num;... | [
"assignment.change"
] | 767,391 | 767,392 | u086249395 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
main() {
int i, n, m, count = 0;
cin >> n;
vector<int> mon(n + 1), yu(n);
for (i = 0; i < n + 1; i++)
cin >> mon[i];
for (i = 0; i < n; i++)
cin >> yu[i];
for (i = 0; i < n; i++) {
m = min(mon[i], yu[i]);
mon[i] -= m;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
main() {
ll i, n, m, count = 0;
cin >> n;
vector<ll> mon(n + 1), yu(n);
for (i = 0; i < n + 1; i++)
cin >> mon[i];
for (i = 0; i < n; i++)
cin >> yu[i];
for (i = 0; i < n; i++) {
m = min(mon[i], yu[i]);
mon[i] -= m;
yu... | [
"variable_declaration.type.change"
] | 767,395 | 767,396 | u703537155 | cpp |
p02959 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using names... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using names... | [
"assignment.change"
] | 767,399 | 767,400 | u387013436 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(void) {
int N, A[100001], B[100001], i, count = 0;
cin >> N;
for (i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (i = 1; i <= N; i++) {
cin >> B[i];
}
for (i = 1; i <= N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
count += A[i];
... | #include <iostream>
using namespace std;
int main(void) {
long long N, A[100001], B[100001], i, count = 0;
cin >> N;
for (i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (i = 1; i <= N; i++) {
cin >> B[i];
}
for (i = 1; i <= N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
count += A[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,405 | 767,406 | u246639932 | cpp |
p02959 | #include <iostream>
int main() {
int N, A[100001], B[100000], i;
int sum1 = 0;
int sum2 = 0;
scanf("%d", &N);
for (i = 0; i <= N; i++) {
scanf("%d", &A[i]);
sum1 = sum1 + A[i];
}
for (i = 0; i <= N - 1; i++) {
scanf("%d", &B[i]);
if (A[i] < B[i]) {
if (A[i] + A[i + 1] <= B[i]) {
... | #include <iostream>
int main() {
int N, A[100001], B[100000], i;
long sum1 = 0;
long sum2 = 0;
scanf("%d", &N);
for (i = 0; i <= N; i++) {
scanf("%d", &A[i]);
sum1 = sum1 + A[i];
}
for (i = 0; i <= N - 1; i++) {
scanf("%d", &B[i]);
if (A[i] < B[i]) {
if (A[i] + A[i + 1] <= B[i]) {
... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,407 | 767,408 | u392164874 | cpp |
p02959 | #include <stdio.h>
int main() {
int n, b, ans = 0;
scanf("%d", &n);
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b);
if (a[i] > b) {
ans = ans + b;
} else {
if (a[i + 1] > b - a[i]) {
ans = ans + b;
... | #include <stdio.h>
int main() {
int n, b;
long ans = 0;
scanf("%d", &n);
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b);
if (a[i] > b) {
ans = ans + b;
} else {
if (a[i + 1] > b - a[i]) {
ans = ans + b... | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,409 | 767,410 | u451804224 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N = 0, ans = 0;
std::cin >> N;
std::vector<int> A(N + 1);
std::vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
long long N = 0, ans = 0;
std::cin >> N;
std::vector<long long> A(N + 1);
std::vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
for (int i =... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,411 | 767,412 | u659222664 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, res = 0;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (int i = 0; i < N + 1; i++)
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, res = 0;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (int i = 0; i < N + 1; i++)
... | [
"variable_declaration.type.change",
"io.output.change"
] | 767,419 | 767,420 | u337850788 | 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;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.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 count = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) >= a.at(i)) ... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,421 | 767,422 | u955282280 | 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;
for (int i = 0; i < n; i++) {
if (b.at(i) >= a.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 count = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) >= a.at(i)) ... | [
"variable_declaration.type.primitive.change"
] | 767,424 | 767,422 | u955282280 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.