problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k โ | fixed_code stringlengths 12 526k โ | labels listlengths 0 15 โ | buggy_submission_id int64 1 1.54M โ | fixed_submission_id int64 2 1.54M โ | user_id stringlengths 10 10 โ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02959 | #include <bits/stdc++.h>
// #define int long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
int cnt = 0;
int n;
cin >> n;
vi a(n + 1), b(n);
rep(i, n + 1) cin >> ... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
int cnt = 0;
int n;
cin >> n;
vi a(n + 1), b(n);
rep(i, n + 1) cin >> a[i... | [] | 766,091 | 766,092 | u510749912 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 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++) {
int c = min(a[i], b[i]);
cnt += c;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long cnt = 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) {
int c = min(a[i], b[i]);
... | [
"variable_declaration.type.widen.change"
] | 766,095 | 766,096 | u110859855 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
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++) {
int t = min(a[i]... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
long 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++) {
int t = min(... | [
"variable_declaration.type.primitive.change"
] | 766,104 | 766,105 | u359856428 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <new>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
long int A[100010];
int B[100010];
cin >> N;
for (int i = 0; i < N + 1; ++i) {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <new>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
long int A[100010];
long int B[100010];
cin >> N;
for (int i = 0; i < N + 1; ++i) ... | [
"variable_declaration.type.widen.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 766,106 | 766,107 | u638221831 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] >= b[i])
ans += ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
ll ans = 0;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] >= b[i])
an... | [] | 766,110 | 766,111 | u681323954 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int N;
cin >> N;
vector<int> mon(N + 1);
rep(i, N + 1) { cin >> mon[i]; }
vect... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int N;
cin >> N;
vector<int> mon(N + 1);
rep(i, N + 1) { cin >> mon[i]; }
vect... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,120 | 766,121 | u320027541 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
// ๅฐๆฐ็นไปฅไธๆกๆฐ
// fixed << setprecision(i)
int gcd(int a, int b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, ans = 0, tmp;
vector<int> a(100001), b(100000);
cin >> n;
for (int i = 0; i < n + 1;... | #include <bits/stdc++.h>
using namespace std;
// ๅฐๆฐ็นไปฅไธๆกๆฐ
// fixed << setprecision(i)
int gcd(int a, int b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int64_t n, ans = 0, tmp;
vector<int> a(100001), b(100000);
cin >> n;
for (int i = 0; i < n ... | [
"variable_declaration.type.primitive.change"
] | 766,122 | 766,123 | u652660628 | cpp |
p02959 | #include <bits/stdc++.h>
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;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
int k = min(a[i], b[i]);
a[i] -= k;
ans += k... | #include <bits/stdc++.h>
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;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
int k = min(a[i], b[i]);
a[i] -= k;
ans += k;... | [
"variable_declaration.type.change"
] | 766,126 | 766,127 | u075775814 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
sum += b[i];
else if ((a[i] + a[i + 1]) >=... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, sum = 0;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
sum += b[i];
else if ((a[i] + ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,128 | 766,129 | u210555114 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, monster = 0, sum = 0;
cin >> n;
vector<int> city(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> city.at(i);
monster += city.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, monster = 0, sum = 0;
cin >> n;
vector<int> city(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> city.at(i);
monster += city.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
for (int i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,132 | 766,133 | u451954557 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mon(n + 1, 0), hero(n, 0);
for (int i = 0; i < n + 1; i++) {
cin >> mon[i];
}
for (int i = 0; i < n; i++)
cin >> hero[i];
int num = 0;
for (int i = 0, change; i < n; i++) {
change = min(mon[i], hero[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mon(n + 1, 0), hero(n, 0);
for (int i = 0; i < n + 1; i++) {
cin >> mon[i];
}
for (int i = 0; i < n; i++)
cin >> hero[i];
long long num = 0;
for (int i = 0, change; i < n; i++) {
change = min(mon[i], hero... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,134 | 766,135 | u004676431 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &&i : a)
cin >> i;
vector<int> b(n);
for (auto &&i : b)
cin >> i;
int sum = 0;
for (int i = 0; i < n; ++i) {
int mn = min(a.at(i), b.at(i));... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &&i : a)
cin >> i;
vector<int> b(n);
for (auto &&i : b)
cin >> i;
int64_t sum = 0;
for (int i = 0; i < n; ++i) {
int mn = min(a.at(i), b.at(... | [
"variable_declaration.type.primitive.change"
] | 766,140 | 766,141 | u104613587 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for (ll i = 0; i <... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for (ll i = 0; i <... | [
"variable_declaration.type.change"
] | 766,142 | 766,143 | u789673498 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for (ll i = 0; i <... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for (ll i = 0; i <... | [
"variable_declaration.type.change"
] | 766,144 | 766,145 | u789673498 | cpp |
p02959 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<... | [
"assignment.change"
] | 766,146 | 766,147 | u854685063 | cpp |
p02959 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<... | [
"variable_declaration.type.change",
"assignment.change"
] | 766,148 | 766,147 | u854685063 | cpp |
p02959 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<... | [
"variable_declaration.type.change",
"expression.operation.binary.remove",
"assignment.change"
] | 766,149 | 766,147 | u854685063 | cpp |
p02959 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, ans = 0;
cin >> N;
vector<int> avec(N + 1), bvec(N);
for (ll i = 0; i < N + 1; i++)
cin >> avec[i];
for (ll i = 0; i < N; i++)
cin >> bvec[i];
for (ll i = 0; i < N; i++) {
if (a... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, ans = 0;
cin >> N;
vector<int> avec(N + 1), bvec(N);
for (ll i = 0; i < N + 1; i++)
cin >> avec[i];
for (ll i = 0; i < N; i++)
cin >> bvec[i];
for (ll i = 0; i < N; i++) {
if (av... | [
"variable_declaration.type.change"
] | 766,152 | 766,153 | u894339989 | cpp |
p02959 | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
rep(i, A.size()... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
rep(i, A.size()... | [
"variable_declaration.type.change"
] | 766,155 | 766,156 | u552058878 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long dp[100005];
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 c = 0;
for (int i = 0; i < n; i++... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long dp[100005];
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 c = 0;
for (int i = 0; i < ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,157 | 766,158 | u891945807 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long dp[100005];
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 c = 0;
for (int i = 0; i < n + 1;... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long dp[100005];
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 c = 0;
for (int i = 0; i < ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 766,159 | 766,158 | u891945807 | cpp |
p02959 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n;
cin >> n;
vector<int> city(n + 1);
rep(i, n + 1) {
cin >> city[i];
// cerr<<c... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
long long int n;
cin >> n;
vector<long long int> city(n + 1);
rep(i, n + 1) {
cin >> cit... | [
"variable_declaration.type.widen.change"
] | 766,160 | 766,161 | u225660136 | cpp |
p02959 | #include <bits/stdc++.h>
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), b(n);
ll sum1 = 0;
rep(i, n + 1) {
cin >> a[i];
sum1 += a[i];
}
rep(i, n) cin >> b[i];
rep(i, n) {
if (b[i] <= a[i])
... | #include <bits/stdc++.h>
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), b(n);
ll sum1 = 0;
rep(i, n + 1) {
cin >> a[i];
sum1 += a[i];
}
rep(i, n) cin >> b[i];
rep(i, n) {
if (b[i] <= a[i])
... | [
"assignment.change"
] | 766,162 | 766,163 | u826608257 | cpp |
p02959 | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vec... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vec... | [
"assignment.add"
] | 766,165 | 766,166 | u027946359 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool is_square(int n) {
for (int i = 0; i <= n; i++) {
if (i * i == n) {
return true;
}
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (size_t i = 0; i < n + 1; i++) {
cin >... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool is_square(int n) {
for (int i = 0; i <= n; i++) {
if (i * i == n) {
return true;
}
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (size_t i = 0; i < n + 1; i++) {
cin >... | [
"variable_declaration.type.change"
] | 766,167 | 766,168 | u319279308 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
int num = 0;
for (int k = 0; k < n; k++) {
if (a[k] >= b[k]) {
num = nu... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
long long num = 0;
for (int k = 0; k < n; k++) {
if (a[k] >= b[k]) {
nu... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,169 | 766,170 | u298272335 | 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<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 (b[i] >= a[i]) {
ans += a[i];... | #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);
vector<ll> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (b[i] >= a[i]) {
ans += a[i];
... | [
"variable_declaration.type.change"
] | 766,173 | 766,174 | u711193305 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, *A, *B, ans = 0, M;
cin >> N;
A = new int[N + 1];
B = new int[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, *A, *B, ans = 0, M;
cin >> N;
A = new long long int[N + 1];
B = new long long int[N];
for (int i = 0; i < N +... | [
"variable_declaration.type.widen.change"
] | 766,175 | 766,176 | u401139594 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; i < (ll)(n); ++i)
#define MD 998244353
using namespace std;
struct str {
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; i < (ll)(n); ++i)
#define MD 998244353
using namespace std;
struct str {
... | [
"expression.operation.binary.remove"
] | 766,177 | 766,178 | u110044127 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; i < (ll)(n); ++i)
#define MD 998244353
using namespace std;
struct str {
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; i < (ll)(n); ++i)
#define MD 998244353
using namespace std;
struct str {
... | [
"expression.operation.binary.remove"
] | 766,179 | 766,178 | u110044127 | cpp |
p02959 | #include <iostream>
#include <stdio.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N], b[N], ans = 0;
int main() {
scanf("%d", &n);
n++;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n - 1; i++)
scanf("%d", &b[i]);
for (int i = 0; i < n - 1; i++) {
ans += min(a[... | #include <iostream>
#include <stdio.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N], b[N];
long long ans = 0;
int main() {
scanf("%d", &n);
n++;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n - 1; i++)
scanf("%d", &b[i]);
for (int i = 0; i < n - 1; i++) {
ans... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,180 | 766,181 | u158034688 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N;
c... | [
"call.add",
"call.arguments.change"
] | 766,182 | 766,183 | u225642513 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100001];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 1; i <= n; i++) {
int now = min(b[i], a[i]);
a[i] -= now;
b[i] -... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100001];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 1; i <= n; i++) {
int now = min(b[i], a[i]);
a[i] -= now;
b[i] -... | [
"assignment.change"
] | 766,184 | 766,185 | u216283258 | cpp |
p02959 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
} else {
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
} else {
... | [
"variable_declaration.type.primitive.change"
] | 766,189 | 766,190 | u572622695 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> enemy(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> enemy.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (hero.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> enemy(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> enemy.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
long count = 0;
for (int i = 0; i < n; i++) {
if (hero... | [
"variable_declaration.type.primitive.change"
] | 766,193 | 766,194 | u650603304 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int ans = 0;
for (int i = n - 1; i >= 0; --i) {
const int c = max(0, 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; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
long long int ans = 0;
/*
for (int i = 0; i < n; ++i) {
const int c = min(a... | [
"variable_declaration.type.widen.change"
] | 766,200 | 766,201 | u928627615 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; ++i) {
const int c = min(a[i], b[i]);
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
long long int ans = 0;
for (int i = 0; i < n; ++i) {
const int c = min(a[i], b[... | [
"variable_declaration.type.widen.change"
] | 766,202 | 766,203 | u928627615 | cpp |
p02959 | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i ... | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,204 | 766,205 | u332253305 | cpp |
p02959 | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i ... | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 766,206 | 766,205 | u332253305 | cpp |
p02959 | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 0; i ... | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 766,207 | 766,205 | u332253305 | cpp |
p02959 | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double ... | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double ... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 766,208 | 766,209 | u339430228 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, y, counter = 0;
cin >> n;
long long int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
m = a[i] - b[i];
if (m > ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, y, counter = 0;
cin >> n;
long long int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
m = a[i] - b[i];
if (m > ... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 766,214 | 766,215 | u094861294 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
vector<int> yushas(N);
for (int i = 0; i < N + 1; i++) {
cin >> cities.at(i);
}
for (int i = 0; i < N; i++) {
cin >> yushas.at(i);
}
int64_t sum = 0;
... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
vector<int> yushas(N);
for (int i = 0; i < N + 1; i++) {
cin >> cities.at(i);
}
for (int i = 0; i < N; i++) {
cin >> yushas.at(i);
}
int64_t sum = 0;
... | [
"call.add",
"call.arguments.add"
] | 766,216 | 766,217 | u651314218 | cpp |
p02959 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).end())
using namespace std;
int main() {
int n = 2;
cin >> n;
int a[n + 1], b[n];
REP(i, n + 1) cin >> a... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).end())
using namespace std;
int main() {
int n = 2;
cin >> n;
int a[n + 1], b[n];
REP(i, n + 1) cin >> a... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,218 | 766,219 | u748795013 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1), B(N);
for (int i = 0; i < N + 1; ++i)
cin >> A.at(i);
for (int i = 0; i < N; ++i)
cin >> B.at(i);
int cnt = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.at(i))
cnt += B.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1), B(N);
for (int i = 0; i < N + 1; ++i)
cin >> A.at(i);
for (int i = 0; i < N; ++i)
cin >> B.at(i);
long long int cnt = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.at(i))
cnt... | [
"variable_declaration.type.widen.change"
] | 766,220 | 766,221 | u107338145 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | [
"control_flow.branch.if.condition.change"
] | 766,224 | 766,225 | u077104253 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, count = 0;
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];
}
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
count += a[i];
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int n, count = 0;
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];
}
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
count +... | [
"variable_declaration.type.widen.change"
] | 766,226 | 766,227 | u021083776 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 766,228 | 766,229 | u340010271 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
int main() {
cin >... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
int main() {
cin >... | [
"variable_declaration.type.change"
] | 766,239 | 766,240 | u418810472 | cpp |
p02959 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 766,241 | 766,242 | u700484101 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
for (int i = 0; i ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
for (int i = 0; i ... | [
"variable_declaration.type.change"
] | 766,245 | 766,246 | u139300044 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] <= B[i]) {
ans += A[i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] <= B[i]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,247 | 766,248 | u813559924 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl "\n"
using ll = long ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl "\n"
using ll = long ... | [
"assignment.change"
] | 766,249 | 766,250 | u363936720 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
// i ไบบ็ฎใฎๅ่
ใ i ็ช็ฎใฎ่กใง่จไผ
in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
// i ไบบ็ฎใฎๅ่
ใ i ็ช็ฎใฎ่กใง่จไผ
in... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 766,254 | 766,255 | u902387200 | 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;
vector<int> y(n + 1);
vector<int> u(n);
int ans = 0;
rep(i, n + 1) cin >> y.at(i);
rep(i, n) cin >> u.at(i);
rep(i, n) {
if (y.at(i) + y.at(i + 1) < u.at(i)) {
ans += y.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> y(n + 1);
vector<int> u(n);
int64_t ans = 0;
rep(i, n + 1) cin >> y.at(i);
rep(i, n) cin >> u.at(i);
rep(i, n) {
if (y.at(i) + y.at(i + 1) < u.at(i)) {
ans +... | [
"variable_declaration.type.primitive.change"
] | 766,260 | 766,261 | u999477518 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int cnt = 0, k;
rep(i, n) {
int k1 = min(b[i], a[i])... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll cnt = 0;
rep(i, n) {
int k1 = min(b[i], a[i]);
... | [
"variable_declaration.type.change",
"variable_declaration.remove"
] | 766,262 | 766,263 | u237022500 | cpp |
p02959 | //ใใใใผ
#include <bits/stdc++.h>
using namespace std;
//ๅๅฎ็พฉ
typedef long long ll;
//ๅฎๆฐ
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i,... | //ใใใใผ
#include <bits/stdc++.h>
using namespace std;
//ๅๅฎ็พฉ
typedef long long ll;
//ๅฎๆฐ
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i,... | [
"variable_declaration.type.change"
] | 766,266 | 766,267 | u115927976 | 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 ans = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) <= a.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);
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) <= a.at(i)) {
a.at... | [
"variable_declaration.type.primitive.change"
] | 766,268 | 766,269 | u582684800 | cpp |
p02959 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int n;
vector<int> a, b;
int main() {
cin >> n;
a = vector<int>(n + 1);
b = vector<int>(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int sum = 0;
rep(i, n) {
if (a[i] <= b[i]) {
... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int n;
vector<long> a, b;
int main() {
cin >> n;
a = vector<long>(n + 1);
b = vector<long>(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
long sum = 0;
rep(i, n) {
if (a[i] <= b[i]) {
... | [
"variable_declaration.type.primitive.change",
"assignment.value.change"
] | 766,276 | 766,277 | u649421008 | 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.primitive.change"
] | 766,278 | 766,279 | u527652459 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = acos(-1);
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll ans = 0;
re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = acos(-1);
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll ans = 0;
re... | [
"assignment.value.change"
] | 766,281 | 766,282 | u711381986 | cpp |
p02959 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);... | [
"variable_declaration.type.change"
] | 766,285 | 766,286 | u135626132 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, s, e) for (int i = (s); i < (e); i++)
#define all(obj) (obj).begin(), (obj).end()
/*ๅๅๅ #define int long long ๅๅๅ*/
signed main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, n + 1) cin >> a[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, s, e) for (int i = (s); i < (e); i++)
#define all(obj) (obj).begin(), (obj).end()
#define int long long
signed main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, n + 1) cin >> a[i];
vector<i... | [] | 766,287 | 766,288 | u443151804 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N;
cin >> N;
vector<int> monster(N + 1);
vector<int> list(N);
for (int i = 0; i < N + 1; i++)
cin >> monster[i];
for (int i = 0; i < N; i++)
cin >> list[i];
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N;
cin >> N;
vector<int> monster(N + 1);
vector<int> list(N);
for (int i = 0; i < N + 1; i++)
cin >> monster[i];
for (int i = 0; i < N; i++)
cin >> list[i];
int64_t ans = 0... | [
"variable_declaration.type.primitive.change"
] | 766,289 | 766,290 | u058742919 | cpp |
p02959 | //#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#... | //#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#... | [
"assignment.change"
] | 766,294 | 766,295 | u662613350 | cpp |
p02959 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin >> N;
vector<int> teki(N + 1);
vector<int> taoseru(N);
for (int i = 0; i < N + 1; i++) {
cin >> teki[i];
}
for (int i = 0; i < N; i++) {
cin >> taoseru[i];
}
int ans = 0;
for (int i = 0; i < N; i... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin >> N;
vector<int> teki(N + 1);
vector<int> taoseru(N);
for (int i = 0; i < N + 1; i++) {
cin >> teki[i];
}
for (int i = 0; i < N; i++) {
cin >> taoseru[i];
}
long long int ans = 0;
for (int i = 0... | [
"variable_declaration.type.widen.change"
] | 766,296 | 766,297 | u262451272 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//ใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//ใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#defi... | [
"variable_declaration.type.change"
] | 766,300 | 766,301 | u053035261 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> A(n + 1), B(n);
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
int ans = 0;
rep(i, n) {
if (A[i] >= B[i])
ans += B[i];
else {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<ll> A(n + 1), B(n);
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
ll ans = 0;
rep(i, n) {
if (A[i] >= B[i])
ans += B[i];
else {
... | [
"variable_declaration.type.change"
] | 766,307 | 766,308 | u650236619 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n + 1) cin >> a[i];
vector<ll> b(n);
rep(i, n) cin >> b[i];
vector<ll> f_1(n), f_2(n);
ll ans = 0;
rep(i, n) {
if (i == 0) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<ll> b(n);
rep(i, n) cin >> b[i];
vector<ll> f_1(n), f_2(n);
ll ans = 0;
rep(i, n) {
if (i == 0) {
... | [
"assignment.change"
] | 766,318 | 766,319 | u975472502 | 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]; }
int c, count = 0;
rep(i, N) {
c = min(A[i], B[i]);
count += c;
A[i] -= c;
B[i] -= c;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long N;
cin >> N;
long long A[N + 1], B[N];
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long c, count = 0;
rep(i, N) {
c = min(A[i], B[i]);
count += c;
A[i] -=... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,321 | 766,322 | u975472502 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long int llint;
int main() {
int N;
cin >> N;
int A[N + 1 + 1];
int B[N + 1];
for (int i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long int llint;
int main() {
int N;
cin >> N;
llint A[N + 1 + 1];
llint B[N + 1];
for (int i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i... | [
"variable_declaration.type.change"
] | 766,330 | 766,331 | u309780279 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
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 sum = 0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
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];
}
ll sum = 0;... | [
"variable_declaration.type.change"
] | 766,334 | 766,335 | u476027087 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
#define _GLIBCXX_DEBUG
int main() {
int n, ans = 0;
cin >> n;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] + a[i + 1] >= b[i]) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
#define _GLIBCXX_DEBUG
int main() {
ll n, ans = 0;
cin >> n;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] + a[i + 1] >= b[i]) {
... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 766,337 | 766,338 | u652294457 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
retur... | [
"variable_declaration.type.change"
] | 766,339 | 766,340 | u229427161 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int A[n + 1];
int B[n];
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
int ans = 0;
rep(i, n) {
if (B[i] >= A[i]) {
B[i] -= A[i];
an... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
long n;
cin >> n;
long A[n + 1];
long B[n];
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
long ans = 0;
rep(i, n) {
if (B[i] >= A[i]) {
B[i] -= A[i];
... | [
"variable_declaration.type.primitive.change"
] | 766,341 | 766,342 | u025047544 | cpp |
p02959 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
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];
ll ans = 0;
for (int ... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
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];
ll ans = 0;
for (int ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 766,347 | 766,348 | u201553784 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
int main() {
int n;
cin >> n;
int m[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
int main() {
int n;
cin >> n;
int m[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];... | [
"variable_declaration.type.change"
] | 766,349 | 766,350 | u010415482 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 2, 0), B(N + 1, 0);
for (int i = 1; i <= N + 1; i++) {
cin >> A.at(i);
}
for (int i = 1; i <= N; i++) {
cin >> B.at(i);
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
long N;
cin >> N;
vector<long> A(N + 2, 0), B(N + 1, 0);
for (long i = 1; i <= N + 1; i++) {
cin >> A.at(i);
}
for (long i = 1; i <= N; i++) {
cin >> B.at(... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 766,351 | 766,352 | u964376215 | cpp |
p02959 | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const double PI = acos(-1);
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n + 1), b(... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const double PI = acos(-1);
int main() {
long n, sum = 0;
cin >> n;
vector<long> a(n + 1), ... | [
"variable_declaration.type.primitive.change"
] | 766,356 | 766,357 | u470123394 | cpp |
p02959 | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<long> a(n + 1);
for (long i = 0; i < n + 1; i++) {
std::cin >> a[i];
}
std::vector<long> b(n);
for (long i = 0; i < n; i++) {
std::cin >> b[i];
}
long count = 0;
for (long i = 0; i < n; i++) {
long tmp ... | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<long> a(n + 1);
for (long i = 0; i < n + 1; i++) {
std::cin >> a[i];
}
std::vector<long> b(n);
for (long i = 0; i < n; i++) {
std::cin >> b[i];
}
long count = 0;
for (long i = 0; i < n; i++) {
long tmp =... | [
"assignment.change"
] | 766,358 | 766,359 | u083254278 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
const int mod = 1000000007;
ll pow(ll base, ll order) {
ll ans = 1;
rep(i, order - 1) ans *= base;
return ans;
}
int gcd(int a, int b) {
if (a < b) {
int c = a;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
const int mod = 1000000007;
ll pow(ll base, ll order) {
ll ans = 1;
rep(i, order - 1) ans *= base;
return ans;
}
int gcd(int a, int b) {
if (a < b) {
int c = a;
... | [
"assignment.change"
] | 766,360 | 766,361 | u596952207 | cpp |
p02959 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, sum = 0;
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 ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long int n, sum = 0;
cin >> n;
vector<long> a(n + 1);
vector<long> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i ... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 766,362 | 766,363 | u553461888 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define f(i, x, n) for (int i = x; i < n; i++)
#define FASTIO \
cin.tie(0); ... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define f(i, x, n) for (int i = x; i < n; i++)
#define FASTIO \
cin.tie(0); ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change"
] | 766,364 | 766,365 | u824880220 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int monstar[n + 2];
int yusya[n + 1];
int sum = 0;
monstar[0] = -1;
yusya[0] = -1;
rep(i, n + 1) cin >> monstar[i + 1];
rep(i, n) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll monstar[n + 2];
ll yusya[n + 1];
ll sum = 0;
monstar[0] = -1;
yusya[0] = -1;
rep(i, n + 1) cin >> monstar[i + 1];
rep(i, n) cin... | [
"variable_declaration.type.change"
] | 766,368 | 766,369 | u070779615 | cpp |
p02959 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | [
"variable_declaration.type.change"
] | 766,373 | 766,374 | u705990127 | cpp |
p02959 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | [
"variable_declaration.type.change"
] | 766,375 | 766,374 | u705990127 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
// b[i]ใa[i]ใฎใขใณในใฟใผใๅ
จๅใงๅใ
cnt +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll cnt = 0;
for (int i = 0; i < n; i++) {
// b[i]ใa[i]ใฎใขใณในใฟใผใๅ
จๅใงๅใ
cnt +=... | [
"variable_declaration.type.change",
"assignment.change"
] | 766,377 | 766,378 | u641900703 | 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 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 = n - 1; i >= 0; i--) {
if (a[i + 1] + a[i] <= b[i]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (a[i + 1] + a[i] <= b[i]) {
... | [
"assignment.value.change"
] | 766,383 | 766,384 | u244626757 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100010];
int b[100010];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int tmp = min(a[i], b[i]);
ans += tmp;
b[i] -= ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
int a[100010];
int b[100010];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int tmp = min(a[i], b[i]);
... | [
"variable_declaration.type.widen.change"
] | 766,387 | 766,388 | u221119670 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, ... | [
"variable_declaration.type.change"
] | 766,391 | 766,392 | u430494842 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,395 | 766,396 | u987913144 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,397 | 766,396 | u987913144 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define int ll
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
... | [
"variable_declaration.type.widen.change",
"call.arguments.change"
] | 766,398 | 766,399 | u864171425 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int A[100010], B[100010];
int m... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int A[100010], B[100010];
int m... | [
"variable_declaration.type.change"
] | 766,405 | 766,406 | u475843109 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"control_flow.branch.if.condition.change"
] | 766,407 | 766,408 | u809967037 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
void zero(long long &a) {
if (a < 0)
a = 0;
}
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[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int ans = 0;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
void zero(long long &a) {
if (a < 0)
a = 0;
}
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[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long long ans = 0;
for (int i ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,409 | 766,410 | u615258936 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int cnt = 0;
for (int i = 0; i < N; i++) {
long long ii = A.at(i) + A.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long cnt = 0;
for (int i = 0; i < N; i++) {
long long ii = A.at(i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,411 | 766,412 | u615258936 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
lint n;
cin >> n;
vector<lint> a(n + 1), b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
lint n;
cin >> n;
vector<lint> a(n + 1), b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i <... | [
"assignment.change"
] | 766,415 | 766,416 | u756088996 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
count... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll count = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
count ... | [
"variable_declaration.type.change"
] | 766,421 | 766,422 | u180257813 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
using namespace std;
#define N 10000000000000
int main() {
int n;
cin >> n;
int monster[n + 1];
int people[n];
for (int i = 0; i <= n; i++) {
cin >> monster[i];
}
for (int i = 0; i < n; i++) {
cin >... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
using namespace std;
#define N 10000000000000
int main() {
long n;
cin >> n;
long monster[n + 1];
long people[n];
for (int i = 0; i <= n; i++) {
cin >> monster[i];
}
for (int i = 0; i < n; i++) {
ci... | [
"variable_declaration.type.primitive.change"
] | 766,423 | 766,424 | u616017354 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.