problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
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,424 | 767,425 | u955282280 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mati(n + 1);
vector<int> yusya(n);
for (int i = 0; i < n + 1; i++) {
cin >> mati.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yusya.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (mati.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mati(n + 1);
vector<int> yusya(n);
for (int i = 0; i < n + 1; i++) {
cin >> mati.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yusya.at(i);
}
long int count = 0;
for (int i = 0; i < n; i++) {
if (m... | [
"variable_declaration.type.widen.change"
] | 767,426 | 767,427 | u442754977 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mati(n + 1);
vector<int> yusya(n);
for (int i = 0; i < n + 1; i++) {
cin >> mati.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yusya.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (mati.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mati(n + 1);
vector<int> yusya(n);
for (int i = 0; i < n + 1; i++) {
cin >> mati.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yusya.at(i);
}
long int count = 0;
for (int i = 0; i < n; i++) {
if (m... | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,428 | 767,427 | u442754977 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | [
"variable_declaration.type.change"
] | 767,429 | 767,430 | u637983859 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 767,431 | 767,430 | u637983859 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, yuusya;
cin >> n;
k = 0;
vector<int> vec(n + 1);
vector<int> yuu(n);
for (int i = 0; i < n + 1; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yuu.at(i);
}
for (int i = 0; i < n; i++) {
if (yuu.at(i) <... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k, yuusya;
cin >> n;
k = 0;
vector<long> vec(n + 1);
vector<long> yuu(n);
for (long i = 0; i < n + 1; i++) {
cin >> vec.at(i);
}
for (long i = 0; i < n; i++) {
cin >> yuu.at(i);
}
for (long i = 0; i < n; i++) {
if (yuu.a... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 767,432 | 767,433 | u325573017 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n;
cin >> n;
vi a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
ci... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n;
cin >> n;
vi a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
ci... | [
"variable_declaration.type.change"
] | 767,434 | 767,435 | u876386943 | cpp |
p02959 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int uint;
typedef long long... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int uint;
typedef long long... | [
"variable_declaration.type.change"
] | 767,436 | 767,437 | u433195318 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
long long a[100001], b[100010], c, d = 0, e = 0;
int main() {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i <= n; i++) {
if (a[i] < b[i]) {
... | #include <algorithm>
#include <iostream>
using namespace std;
long long a[100001], b[100010], c, d = 0, e = 0;
int main() {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i <= n; i++) {
if (a[i] < b[i]) {
... | [
"assignment.change"
] | 767,438 | 767,439 | u225094817 | cpp |
p02959 | #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[100000], c[10000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (f = 0; f < a; f++) {
scanf("%lld"... | #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[100001], c[100000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (i = 0; i < a; i++) {
scanf("%lld... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 767,445 | 767,444 | u373916583 | cpp |
p02959 | #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[2000], c[2000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (i = 0; i < a; i++) {
scanf("%lld", &... | #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[100001], c[100000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (i = 0; i < a; i++) {
scanf("%lld... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 767,447 | 767,444 | u373916583 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define e... | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define e... | [
"variable_declaration.type.change"
] | 767,450 | 767,451 | u411771230 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int n, a[100001], b;
int i, c, f, sum = 0;
cin >> n;
for (i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b;
c = a[i] + a[i + 1];
f = c - b;
if (f <= 0) {
su... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
long long int n, a[200000], b;
long long int i, c, f, sum = 0;
cin >> n;
for (i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b;
c = a[i] + a[i + 1];
f = c - b;
if... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 767,459 | 767,458 | u660656075 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define For(i, start, end) for (i64 i = start; i < end; i++)
#define newline std::cout << '\n';
#define newlinedx(num) \
for (int i = 0; i < num; i++) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define For(i, start, end) for (i64 i = start; i < end; i++)
#define newline std::cout << '\n';
#define newlinedx(num) \
for (int i = 0; i < num; i++) ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 767,462 | 767,463 | u127063317 | cpp |
p02959 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"variable_declaration.type.change"
] | 767,464 | 767,465 | u419390395 | cpp |
p02959 | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++... | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++... | [
"variable_declaration.type.change"
] | 767,468 | 767,469 | u450007962 | cpp |
p02959 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n + 1) cin >> a[i];
int b[n];
rep(i, n) cin >> b[i];
int ans = 0;
int kill;
for (int i = 0; i < n; i++) {
kill = min(a[i], b[i]);
b[i] -= kill;
ans ... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n + 1) cin >> a[i];
int b[n];
rep(i, n) cin >> b[i];
long long ans = 0;
int kill;
for (int i = 0; i < n; i++) {
kill = min(a[i], b[i]);
b[i] -= kill;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,470 | 767,471 | u288147331 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
A[i] -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
A... | [
"variable_declaration.type.primitive.change"
] | 767,472 | 767,473 | u267265758 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, N +... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
int N;
cin >> N;
ll A[N + 1], B[N];
rep(i, N + ... | [
"variable_declaration.type.change"
] | 767,474 | 767,475 | u841131859 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
//#include <bits/stdc++.h>
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
//#include <bits/stdc++.h>
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(... | [
"variable_declaration.type.change"
] | 767,476 | 767,477 | u358748139 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a.at(i);
}
for (int i = 0; i < n; ++i) {
cin >> b.at(i);
}
int ans = 0;
for (int i = n - 1; i >= 0; --i) {
if (b.at(i) >= a.at(i + 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a.at(i);
}
for (int i = 0; i < n; ++i) {
cin >> b.at(i);
}
long ans = 0;
for (int i = n - 1; i >= 0; --i) {
if (b.at(i) >= a.at(i + ... | [
"variable_declaration.type.primitive.change"
] | 767,478 | 767,479 | u473403559 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
//#define int long long
using namespace std;
void Main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
vector<int> B(N, 0);
for (int i = 0; i < N + 1; i++) {
cin >> A[i]... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
void Main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
vector<int> B(N, 0);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
... | [] | 767,480 | 767,481 | u790502959 | cpp |
p02959 | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
long counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i]... | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
long counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i]... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,488 | 767,489 | u339419997 | cpp |
p02959 | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
int counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i] ... | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
long counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i]... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,490 | 767,489 | u339419997 | cpp |
p02959 | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
int counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i] ... | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
long counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i]... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,491 | 767,489 | u339419997 | cpp |
p02959 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
forn(i, N + 1) cin >> A[i];
forn(i, N) cin >> B[i];
int cnt = 0;
forn(i, N - 1) {
if (B[i] <= A[i]) {
cnt += B[i];... | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
forn(i, N + 1) cin >> A[i];
forn(i, N) cin >> B[i];
ll cnt = 0;
forn(i, N) {
if (B[i] <= A[i]) {
cnt += B[i];
... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 767,496 | 767,497 | u934402094 | cpp |
p02959 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
forn(i, N + 1) cin >> A[i];
forn(i, N) cin >> B[i];
int cnt = 0;
forn(i, N) {
if (B[i] <= A[i]) {
cnt += B[i];
... | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
forn(i, N + 1) cin >> A[i];
forn(i, N) cin >> B[i];
ll cnt = 0;
forn(i, N) {
if (B[i] <= A[i]) {
cnt += B[i];
... | [
"variable_declaration.type.change"
] | 767,498 | 767,497 | u934402094 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N], i, f, s;
for (i = 0; i < N + 1; i++)
cin >> A[i];
for (i = 0; i < N; i++)
cin >> B[i];
s = 0;
for (i = 0; i < N; i++) {
if (B[i] > A[i]) {
s = s + A[i];
f = B[i] - A[i];
if (f >= A[i + ... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N + 1], B[N], i, f, s;
for (i = 0; i < N + 1; i++)
cin >> A[i];
for (i = 0; i < N; i++)
cin >> B[i];
s = 0;
for (i = 0; i < N; i++) {
if (B[i] > A[i]) {
s = s + A[i];
f = B[i] - A[i];
if (f >= ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,501 | 767,502 | u834488582 | cpp |
p02959 | #include <iostream>
using namespace std;
long long a[100005];
long long b[100005];
int main() {
int sum = 0;
int remain;
int N;
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
if (b[i] <= a[i]) {
s... | #include <iostream>
using namespace std;
long long a[100005];
long long b[100005];
int main() {
long long sum = 0;
long long remain;
int N;
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
if (b[i] <= a[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,505 | 767,506 | u834488582 | cpp |
p02959 | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <s... | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <s... | [
"variable_declaration.type.change"
] | 767,511 | 767,512 | u982721693 | cpp |
p02959 | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <s... | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <s... | [
"variable_declaration.type.change"
] | 767,513 | 767,512 | u982721693 | cpp |
p02959 | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <s... | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <s... | [
"variable_declaration.type.change",
"io.output.newline.add"
] | 767,514 | 767,512 | u982721693 | 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 Sum = 0;
if (A.at(0) > B.at(0)) {
Sum += B.at(0);
B.at(0) = 0;
} else {
... | #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 Sum = 0;
if (A.at(0) > B.at(0)) {
Sum += B.at(0);
B.at(0) = 0;
} else... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,515 | 767,516 | u196629968 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), en... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), en... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,517 | 767,518 | u729217226 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, res;
cin >> n;
int a[n + 2], b[n + 1];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
res = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
b[i] = b[i] - a[i];
res += a[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 2], b[n + 1];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long int res = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
b[i] = b[i] - a[i];
re... | [
"variable_declaration.remove"
] | 767,519 | 767,520 | u391465737 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
int ans = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
ans += A.at(i);
}
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
long long ans = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
ans += A.at(i);
}
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,521 | 767,522 | u127314985 | cpp |
p02959 | #include <bits/stdc++.h>
#define FOR(i, n) for (i = 0; i < n; i++)
#define FORE(i, a, b) for (i = a; i <= b; i++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, sum = 0;
cin >> n;
long long int T[n + 2], B[n + 1];
FORE(i, 1, n + 1) { cin >> T[i]; }
FORE(i, 1, ... | #include <bits/stdc++.h>
#define FOR(i, n) for (i = 0; i < n; i++)
#define FORE(i, a, b) for (i = a; i <= b; i++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i;
long long int sum = 0;
cin >> n;
long long int T[n + 2], B[n + 1];
FORE(i, 1, n + 1) { cin >> T[i];... | [
"variable_declaration.type.widen.change"
] | 767,525 | 767,526 | u759696332 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
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 sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[... | [
"variable_declaration.type.change"
] | 767,527 | 767,528 | u550014122 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 767,531 | 767,532 | u902149880 | cpp |
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() {
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) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
... | #include <bits/stdc++.h>
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), 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 {
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 767,533 | 767,534 | u244832678 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i(0); i < N; ++i)
cin >> A[i];
ll B, prev_B, ans(0);
for (int i(0); i < N; ++i) {
cin >> B;
if (A[i] >= B) {
ans += B;
} else {
ans += A[i];
B -=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i(0); i < N + 1; ++i)
cin >> A[i];
ll B, prev_B, ans(0);
for (int i(0); i < N; ++i) {
cin >> B;
if (A[i] >= B) {
ans += B;
} else {
ans += A[i];
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 767,535 | 767,536 | u244832678 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i(0); i < N; ++i)
cin >> A[i];
ll B, prev_B, ans(0);
for (int i(0); i < N + 1; ++i) {
cin >> B;
if (A[i] >= B) {
ans += B;
} else {
ans += A[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i(0); i < N + 1; ++i)
cin >> A[i];
ll B, prev_B, ans(0);
for (int i(0); i < N; ++i) {
cin >> B;
if (A[i] >= B) {
ans += B;
} else {
ans += A[i];
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 767,537 | 767,536 | u244832678 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> T In() {
T t;
cin >> t;
return t;
}
template <typename T> vector<vector<T>> Vec2(int i, int j, T ini = 0) {
vector<vector<T>> vec(i, ve... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> T In() {
T t;
cin >> t;
return t;
}
template <typename T> vector<vector<T>> Vec2(int i, int j, T ini = 0) {
vector<vector<T>> vec(i, ve... | [
"assignment.change"
] | 767,538 | 767,539 | u991692050 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int in() {
int x;
scanf("%d", &x);
return x;
}
static const int MAX = 100001;
int main() {
int N = in(), A[MAX], b, ans = 0;
rep(i, N + 1) A[i] = in();... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int in() {
int x;
scanf("%d", &x);
return x;
}
static const int MAX = 100001;
int main() {
int N = in(), A[MAX], b;
long ans = 0;
rep(i, N + 1) A[i] ... | [
"variable_declaration.type.widen.change"
] | 767,540 | 767,541 | u378125390 | cpp |
p02959 | // ROAD TO GREEN
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define ll long long
#define uint unsigned int
#define ull unsigned ll
#define mp make_pair
#define... | // ROAD TO GREEN
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define ll long long
#define uint unsigned int
#define ull unsigned ll
#define mp make_pair
#define... | [
"variable_declaration.type.change"
] | 767,547 | 767,548 | u519336948 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = 1'000'000'007;
string yn(bool f) { return f ? "Yes" : "No"; }
string YN(bool f) {... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = 1'000'000'007;
string yn(bool f) { return f ? "Yes" : "No"; }
string YN(bool f) {... | [
"assignment.change"
] | 767,549 | 767,550 | u233393801 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, i, a[100010], b[100010], ans = 0;
cin >> n;
for (i = 0; i <= n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
ans += min(a[i] + a[i + 1], b[i]);
if (b[i] > a[i] + a[i + 1])
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, i, a[100010], b[100010];
long ans = 0;
cin >> n;
for (i = 0; i <= n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
ans += min(a[i] + a[i + 1], b[i]);
if (b[i] > a[i] + a[i... | [
"variable_declaration.type.widen.change"
] | 767,551 | 767,552 | u088895504 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
REP(i, n + 1) cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
REP(i, n + 1) cin >> a[i];
R... | [
"variable_declaration.type.change"
] | 767,555 | 767,556 | u291873788 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, ans = 0, r = 0;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0);
REP(i, n) cin >> a.at(i);
cin >> a.at(n);
REP(i, n) cin >> b.at(i);
b.at(n) = 0;
REP(i, n + 1) {
if (b.at(i) + r > a.at... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
long long n, ans = 0, r = 0;
cin >> n;
vector<long long> a(n + 1, 0), b(n + 1, 0);
REP(i, n) cin >> a.at(i);
cin >> a.at(n);
REP(i, n) cin >> b.at(i);
b.at(n) = 0;
REP(i, n + 1) {
if (b.at(i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,557 | 767,558 | u082801599 | cpp |
p02959 | #include <bits/stdc++.h>
// #include <iomanip>
#include <iostream>
using namespace std;
int main() {
// 2
// 6 5 2
// 7 6
int n;
// scanf("%d", &n);
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
// scanf("%d", &a[i]);
cin >> a[i];
}
vector<int> b(n + 1);
for (int i ... | #include <bits/stdc++.h>
// #include <iomanip>
#include <iostream>
using namespace std;
int main() {
// 2
// 6 5 2
// 7 6
int n;
// scanf("%d", &n);
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
// scanf("%d", &a[i]);
cin >> a[i];
}
vector<int> b(n + 1);
for (int i ... | [
"variable_declaration.type.primitive.change"
] | 767,559 | 767,560 | u006576567 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n, a[123456], b[123456], c;
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];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
c += b[i];
else if ((a[i] + a[(i + 1)]) <= b[i]) {
... | #include <bits/stdc++.h>
using namespace std;
long long n, a[123456], b[123456], c;
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];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
c += b[i];
else if ((a[i] + a[(i + 1)]) <= b[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,563 | 767,564 | u477516105 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
int m, n, o = 0, i, j, k, sum = 0;
// long long int m,n,o,i,j,k,len=0;
// vector <int> v;
// float f,g,h;
// char c,d;
// string a;
cin >> n;
int *na ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
// int m,n,o=0,i,j,k,sum=0;
long long int m, n, o, i, j, k, sum = 0;
// vector <int> v;
// float f,g,h;
// char c,d;
// string a;
cin >> n;
int *na = ... | [
"variable_declaration.type.widen.change"
] | 767,565 | 767,566 | u763410402 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
... | [
"variable_declaration.type.widen.change"
] | 767,567 | 767,568 | u786283792 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
... | [
"variable_declaration.type.widen.change"
] | 767,569 | 767,568 | u786283792 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
type... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
type... | [
"variable_declaration.type.change"
] | 767,582 | 767,583 | u977925575 | cpp |
p02959 | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), 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];
}
int k = 0;
for (int i = 0; i < n; i++) {
int d = b[i] - a[i];
if (d <= 0) {
k +=... | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), 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];
}
long long k = 0;
for (int i = 0; i < n; i++) {
int d = b[i] - a[i];
if (d <= 0) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,593 | 767,594 | u274139177 | cpp |
p02959 | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main() {
// input
int n;
std::cin >> n;
string str;
int a[n], 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[... | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main() {
// input
int n;
std::cin >> n;
string str;
int a[n], 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++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,595 | 767,596 | u625741705 | cpp |
p02959 | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main() {
// input
int n;
std::cin >> n;
string str;
int a[n], 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[... | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main() {
// input
int n;
std::cin >> n;
string str;
int a[n], 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++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,597 | 767,598 | u625741705 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
ll A[N + 1], B[N];
ll count;
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++) {
ll left = min(A[... | #include <algorithm>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
ll A[N + 1], B[N];
ll count = 0;
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
ll left = mi... | [
"variable_declaration.value.change"
] | 767,599 | 767,600 | u355371431 | cpp |
p02959 | #include <cstdio>
int main() {
int N;
scanf("%d", &N);
long long int a[N + 1];
for (int i = 0; i < N + 1; i++) {
scanf("%lld", &a[i]);
}
long long int b[N];
for (int i = 0; i < N; i++) {
scanf("%lld", &b[i]);
}
long long int bonus = 0;
long long int count = 0;
for (int i = 0; i < N; i++) ... | #include <cstdio>
int main() {
int N;
scanf("%d", &N);
long long int a[N + 1];
for (int i = 0; i < N + 1; i++) {
scanf("%lld", &a[i]);
}
long long int b[N];
for (int i = 0; i < N; i++) {
scanf("%lld", &b[i]);
}
long long int bonus = 0;
long long int count = 0;
for (int i = 0; i < N; i++) ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,601 | 767,602 | u568501780 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin... | [
"variable_declaration.type.change"
] | 767,605 | 767,606 | u987591601 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int N;
int ans = 0;
cin >> N;
vector<int> a(N + 1);
vector<int> b... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int N;
long long ans = 0;
cin >> N;
vector<long long> a(N + 1);
v... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,611 | 767,612 | u882037708 | cpp |
p02959 | #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
... | #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,613 | 767,614 | u129611452 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int tmp;
vector<int> a, b;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
int yoryoku = 0; //勇者が次の街で倒せる数
do... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long tmp;
vector<long> a, b;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
long yoryoku = 0; //勇者が次の街で倒せる数
lo... | [
"variable_declaration.type.primitive.change"
] | 767,615 | 767,616 | u145078207 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int tmp;
vector<int> a, b;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
int yoryoku = 0; //勇者が次の街で倒せる数
int t... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long tmp;
vector<long> a, b;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
long yoryoku = 0; //勇者が次の街で倒せる数
lo... | [
"variable_declaration.type.primitive.change"
] | 767,617 | 767,616 | u145078207 | cpp |
p02959 | #include <cmath>
#include <iostream>
using namespace std;
static const int MAX_N = 1000100;
int main(void) {
// 入力
int n;
cin >> n;
int A[MAX_N + 1];
int B[MAX_N];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
// i番目を倒せるだけ倒してi+1へ(左から右へ)
int... | #include <cmath>
#include <iostream>
using namespace std;
static const int MAX_N = 1000100;
int main(void) {
// 入力
int n;
cin >> n;
int A[MAX_N + 1];
int B[MAX_N];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
// i番目を倒せるだけ倒してi+1へ(左から右へ)
lon... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,618 | 767,619 | u900688325 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (ll i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
ll memory = 0;
memory = accumulate(A.begin(), A.end(), 0);
for (ll i = 0; i < N; i++) {
cin >> B.at(i)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (ll i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
ll memory = 0;
memory = accumulate(A.begin(), A.end(), 0LL);
for (ll i = 0; i < N; i++) {
cin >> B.at(... | [
"literal.number.type.widen.change"
] | 767,620 | 767,621 | u508077444 | cpp |
p02959 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
template <typename T> void readElems(vector<T> &vec, int n) {
int tmp;
vec.reserve(n);
for (int i = 0; i < n; ++i) {
cin >> tmp;
vec.push_back(tmp);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
v... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
template <typename T> void readElems(vector<T> &vec, int n) {
int tmp;
vec.reserve(n);
for (int i = 0; i < n; ++i) {
cin >> tmp;
vec.push_back(tmp);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
v... | [
"variable_declaration.type.primitive.change"
] | 767,622 | 767,623 | u325943907 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i)) {
ans... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i)) {
ans... | [
"assignment.change"
] | 767,624 | 767,625 | u152315108 | cpp |
p02959 | #include <cstdio>
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
int main() {
int n;
int a[100001];
int b[100000];
scanf("%d", &n);
for (int i = 0; i <= n; ++i) {
scanf("%d", a + i);
}
for (int i = 0; i < n; ++i) {
scanf("%d", b + i);
}
int ans = 0;
for... | #include <cstdio>
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
int main() {
int n;
int a[100001];
int b[100000];
scanf("%d", &n);
for (int i = 0; i <= n; ++i) {
scanf("%d", a + i);
}
for (int i = 0; i < n; ++i) {
scanf("%d", b + i);
}
long long ans = 0;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,626 | 767,627 | u931819817 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
long long ans = 0;
rep(i, n) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
long long ans = 0;
rep(i, n) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a... | [
"assignment.change"
] | 767,638 | 767,639 | u440217234 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(o... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(o... | [
"expression.operation.binary.remove"
] | 767,643 | 767,644 | u145179061 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
long long b[2000006];
int count1 = 0;
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
... | #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
long long b[2000006];
long long count1 = 0;
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,645 | 767,646 | u266105150 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
long long b[2000006];
int count1 = 0;
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
... | #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
long long b[2000006];
long long count1 = 0;
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,647 | 767,646 | u266105150 | 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;
int sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(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;
ll sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(i, ... | [
"variable_declaration.type.change"
] | 767,650 | 767,651 | u905170328 | 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;
int sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(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;
ll sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(i, ... | [
"variable_declaration.type.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 767,653 | 767,651 | u905170328 | 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;
int sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(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;
ll sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(i, ... | [
"variable_declaration.type.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"assignment.change"
] | 767,654 | 767,651 | u905170328 | cpp |
p02959 | #include <bits/stdc++.h>
#define INF 1e9
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++) {
int v;
v = min(A[i], B[i]);
an... | #include <bits/stdc++.h>
#define INF 1e9
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++) {
long v;
v = min(A[i], B[i]);... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,664 | 767,665 | u116002573 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
vector<int> v(N + 1);
rep(i, N + 1) cin >> v[i];
vector<int> v2(N);
rep(i, N) cin >> v2[i];
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
vector<ll> v(N + 1);
rep(i, N + 1) cin >> v[i];
vector<ll> v2(N);
rep(i, N) cin >> v2[i];
ll an... | [
"variable_declaration.type.change"
] | 767,666 | 767,667 | u154650168 | cpp |
p02959 | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
int A[N + 2] = {0};
for (int i = 1; i <= N + 1; ++i) {
std::cin >> A[i];
}
int B, sum = 0;
for (int i = 1; i <= N; ++i) {
std::cin >> B;
if (B <= A[i]) {
A[i] -= B;
sum += B;
} else {
sum += A[i];
B -=... | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
int A[N + 2] = {0};
for (int i = 1; i <= N + 1; ++i) {
std::cin >> A[i];
}
int64_t B, sum = 0;
for (int i = 1; i <= N; ++i) {
std::cin >> B;
if (B <= A[i]) {
A[i] -= B;
sum += B;
} else {
sum += A[i];
... | [
"variable_declaration.type.primitive.change"
] | 767,670 | 767,671 | u042751985 | cpp |
p02959 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
vector<int> B(N);
for (auto &a : A) {
cin >> a;
}
for (auto &b : B) {
cin >> b;
}
int ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
signed main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
vector<int> B(N);
for (auto &a : A) {
cin >> a;
}
for (auto &b : B) {
... | [
"variable_declaration.type.primitive.change"
] | 767,672 | 767,673 | u707760575 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
template <class T> inline boo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
template <class T> inline boo... | [
"variable_declaration.type.change"
] | 767,674 | 767,675 | u272997285 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
c... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,676 | 767,677 | u261886891 | cpp |
p02959 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | [
"identifier.change"
] | 767,681 | 767,682 | u020746846 | 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.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 767,683 | 767,684 | u720447689 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long int> a(n + 1);
vector<long int> 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);
long int max = 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);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max ... | [
"variable_declaration.type.narrow.change",
"expression.operation.binary.remove",
"assignment.change"
] | 767,685 | 767,684 | u720447689 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> 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);
long int max = 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);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 767,687 | 767,684 | u720447689 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> 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);
int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max ... | [
"expression.operation.binary.remove",
"variable_declaration.type.widen.change",
"assignment.change"
] | 767,688 | 767,684 | u720447689 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int ans = 0;
for (int i = 0; i < N; i++) {
ans += min(A.at(i), B.at(i));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += min(A.at(i), B.at... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,690 | 767,691 | u425019904 | 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;
int ability, kill1, kill2;
for (int i = 0; i < n; i++) {
ability = b.at(i);
k... | #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 ans = 0; // int型だと桁が足りない？
int ability, kill1, kill2;
for (int i = 0; i < n; i++) {
abi... | [
"variable_declaration.type.primitive.change"
] | 767,692 | 767,693 | u661308718 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
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, f1, f2 = 0;
for (int i = 0; i < n; i++) {
f1 = min(a[i] - f2, b[i]);
f2 = min(a[i + 1], b[i] - f1... | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
long long a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0, f1, f2 = 0;
for (int i = 0; i < n; i++) {
f1 = min(a[i] - f2, b[i]);
f2 = min(a[i + 1... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,694 | 767,695 | u760628894 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
vector<int> B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A.at(i);
}
for (int j = 0; j < n; j++) {
cin >> B.at(j);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (A.at(i) > B.at(i)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
vector<int> B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A.at(i);
}
for (int j = 0; j < n; j++) {
cin >> B.at(j);
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if (A.at(i) > B.at(i)) {
... | [
"variable_declaration.type.primitive.change"
] | 767,696 | 767,697 | u690326065 | cpp |
p02959 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using namespace std;
static const in... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using namespace std;
static const in... | [
"variable_declaration.type.change"
] | 767,698 | 767,699 | u895382169 | cpp |
p02959 | #include <iostream>
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 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]) { // a[i]を倒した時
ans += a[i];
... | #include <iostream>
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 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]) { // a[i]を倒した時
ans += a[i];... | [
"variable_declaration.type.primitive.change"
] | 767,700 | 767,701 | u135358384 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
vector<int64_t> b(n);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int ans = 0;
for (int i = 0; i < n; i++) {
int p = min(a.at(i), b.at(i));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
vector<int64_t> b(n);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int64_t ans = 0;
for (int i = 0; i < n; i++) {
int p = min(a.at(i), b.at(i)... | [
"variable_declaration.type.primitive.change"
] | 767,710 | 767,711 | u009870106 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int c = 0;
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &vec : a)
cin >> vec;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (a[i] - b < 0) {
c += a[i];
b -= a[i];
if (a[i + 1] - b < 0) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int c = 0;
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &vec : a)
cin >> vec;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (a[i] - b < 0) {
c += a[i];
b -= a[i];
if (a[i + 1] - b < 0... | [
"variable_declaration.type.widen.change"
] | 767,714 | 767,715 | u967915578 | cpp |
p02959 | //============================================================================
// Name : abc135c.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <a... | //============================================================================
// Name : abc135c.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <a... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,721 | 767,722 | u055685044 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<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];
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i])... | [
"variable_declaration.type.primitive.change"
] | 767,725 | 767,726 | u103850114 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
int m = 0;
for (int i = 0; i < n; i++) {
m = min(a[i], b[i]);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int64_t ans = 0;
int64_t m = 0;
for (int i = 0; i < n; i++) {
m = min(a[i]... | [
"variable_declaration.type.primitive.change"
] | 767,727 | 767,728 | u103850114 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
int m = 0;
for (int i = 0; i < n; i++) {
m = min(a[i], b[i]);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long ans = 0;
long long m = 0;
for (int i = 0; i < n; i++) {
m = min(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,727 | 767,729 | u103850114 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.