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 |
|---|---|---|---|---|---|---|---|
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
int p[n], ps[n];
for (int i = 0; i < n; ++i) {
cin >> p[i];
ps[i] = p[i];
}
sort(ps, ps + n);
for (int i = 0; i < n; ++i) {
if (p[i] != ps[i])
count++;
}
if (count == 2 || count ==... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
int p[n], ps[n];
for (int i = 0; i < n; ++i) {
cin >> p[i];
ps[i] = p[i];
}
sort(ps, ps + n);
for (int i = 0; i < n; ++i) {
if (p[i] != ps[i])
count++;
}
if (count == 2 || count ==... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,731 | 765,732 | u021083776 | cpp |
p02958 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
bool isprime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
l... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
bool isprime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
l... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 765,733 | 765,734 | u688707061 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,735 | 765,736 | u790171360 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define MAX 50
int main() {
int N, a, count = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a;
if (i != a)
count++;
}
if (count == 2 || count == 0)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
#define MAX 50
int main() {
int N, a, count = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a;
if (i != a)
count++;
}
if (count == 2 || count == 0)
cout << "YES";
else
cout << "NO";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,737 | 765,738 | u776086908 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,743 | 765,744 | u043443359 | cpp |
p02958 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifdef LOCAL
freopen("input.txt", "r"... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifdef LOCAL
freopen("input.txt", "r"... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 765,749 | 765,750 | u345794450 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MAX = 55;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int N, p[MAX];
int main() {
cin >> N;
rep(i, N) cin >> p[i];
bool flg = true;
rep(i, N - 1) {
if (p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MAX = 55;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int N, p[MAX];
int main() {
cin >> N;
rep(i, N) cin >> p[i];
bool flg = true;
rep(i, N - 1) {
if (p... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,759 | 765,760 | u992875223 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MAX = 55;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int N, p[MAX];
int main() {
cin >> N;
rep(i, N) cin >> p[i];
bool flg = true;
rep(i, N - 1) {
if (p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MAX = 55;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int N, p[MAX];
int main() {
cin >> N;
rep(i, N) cin >> p[i];
bool flg = true;
rep(i, N - 1) {
if (p... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,761 | 765,760 | u992875223 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int c = 0;
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1)
c++;
}
if (c == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int c = 0;
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1)
c++;
}
if (c == 2 || c == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
... | [
"control_flow.branch.if.condition.change"
] | 765,766 | 765,767 | u082318524 | cpp |
p02958 | #include <stdio.h>
int main() {
int i, n, d = 0;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] != i + i) {
d++;
}
}
if (d == 0 || d == 2) {
printf("YES");
} else {
printf("NO");
}
} | #include <stdio.h>
int main() {
int i, n, d = 0;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] != i + 1) {
d++;
}
}
if (d == 0 || d == 2) {
printf("YES");
} else {
printf("NO");
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 765,777 | 765,778 | u222643545 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, num;
cin >> n;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, num;
cin >> n;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,779 | 765,780 | u146847434 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, num;
cin >> n;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, num;
cin >> n;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,781 | 765,780 | u146847434 | cpp |
p02958 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,790 | 765,791 | u934954661 | cpp |
p02958 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> p(n), q(n);
rep(i, n) {
cin >> p[i];
q[i] = p[i];
}
sort(p.begin(), p.end());
ll cnt = 0;
rep(i, n) {
if (p[i] != q[i])
cnt++;... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> p(n), q(n);
rep(i, n) {
cin >> p[i];
q[i] = p[i];
}
sort(p.begin(), p.end());
ll cnt = 0;
rep(i, n) {
if (p[i] != q[i])
cnt++;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,795 | 765,796 | u201316840 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int gcdEx(int a, int b, int *x, int *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
int x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modI(int b, int m) {
int x, y;
gcdEx(b, m, &x, &y);
return (x % m + ... | #include <bits/stdc++.h>
using namespace std;
int gcdEx(int a, int b, int *x, int *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
int x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modI(int b, int m) {
int x, y;
gcdEx(b, m, &x, &y);
return (x % m + ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 765,799 | 765,800 | u755134895 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
ans++;
}
}
if (ans == 0 || ans == 2) {
cout << "Yes" << endl;
} else {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
ans++;
}
}
if (ans == 0 || ans == 2) {
cout << "YES" << endl;
} else {
cout ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,801 | 765,802 | u745852541 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
rep(i, N) {
int a;
cin >> a;
ans += (a != (N - i));
}
if (ans <= 2)
cout << "YES";
else
cout <<... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
rep(i, N) {
int a;
cin >> a;
ans += (a != (i + 1));
}
if (ans <= 2)
cout << "YES";
else
cout <<... | [
"expression.operation.binary.remove",
"assignment.change"
] | 765,805 | 765,806 | u923676814 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<... | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 765,807 | 765,808 | u458798873 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define p... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 765,811 | 765,812 | u779159351 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
us... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
us... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,817 | 765,818 | u608258653 | cpp |
p02958 | // Shift-JIS（シフトジス）
#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
int N;
cin >> N;
int num, e = 0;
for (i... | // Shift-JIS（シフトジス）
#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
int N;
cin >> N;
int num, e = 0;
for (i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,821 | 765,822 | u380317210 | cpp |
p02958 | // Shift-JIS（シフトジス）
#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
int N;
cin >> N;
int num, e = 0;
for (i... | // Shift-JIS（シフトジス）
#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
int N;
cin >> N;
int num, e = 0;
for (i... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,823 | 765,822 | u380317210 | cpp |
p02958 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int c = 0;
for (int i = 1; i <= n; i++) {
int t;
cin >> t;
if (t != i)
c++;
}
cout << (c <= 2) ? "YES" : "NO";
return 0;
}
| #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int c = 0;
for (int i = 1; i <= n; i++) {
int t;
cin >> t;
if (t != i)
c++;
}
cout << ((c <= 2) ? "YES" : "NO");
return 0;
}
| [] | 765,829 | 765,830 | u770567389 | cpp |
p02958 | #include <stdio.h>
int main(void) {
int a[50];
int i;
int count;
int n;
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i + 1 != a[i]) {
count++;
}
}
if (count == 2) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a[50];
int i;
int count;
int n;
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i + 1 != a[i]) {
count++;
}
}
if (count == 2 || count == 0) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0... | [
"control_flow.branch.if.condition.change"
] | 765,831 | 765,832 | u966052848 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) {
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) {
r... | [
"expression.operation.binary.add"
] | 765,837 | 765,838 | u006493569 | cpp |
p02959 | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define pqueue priority_queue
#define Speed() \
ios_base::sync_w... | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define pqueue priority_queue
#define Speed() \
ios_base::sync_w... | [
"variable_declaration.type.change"
] | 765,848 | 765,849 | u002627851 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int res = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
res += B[i];
continue;
} else {
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
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 res = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
res += B[i];
continue;
} else {
... | [
"variable_declaration.type.primitive.change"
] | 765,850 | 765,851 | u580363327 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<int> &rvnMonstr, vector<int> &rvnBrave) {
int nMonstrSiz;
cin >> nMonstrSiz;
rvnMonstr.resize(nMonstrSiz + 1);
rvnBrave.resize(nMonstrSiz);
for (int &rnMonstr : rvnMonstr)
cin >> rnMonstr;
for (int &rnBrave : rvnBrave)
cin >> rnBra... | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<int> &rvnMonstr, vector<int> &rvnBrave) {
int nMonstrSiz;
cin >> nMonstrSiz;
rvnMonstr.resize(nMonstrSiz + 1);
rvnBrave.resize(nMonstrSiz);
for (int &rnMonstr : rvnMonstr)
cin >> rnMonstr;
for (int &rnBrave : rvnBrave)
cin >> rnBra... | [
"function.return_type.change",
"variable_declaration.type.primitive.change"
] | 765,852 | 765,853 | u439912527 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, b, c;
cin >> n;
vector<int> a(n + 1);
long long ans = 0;
rep(i, n + 1) cin >> a[i];
rep(i, n) {
cin >> b;
c = a[i + 1] + a[i];
ans += min(c, b);
a[i + 1] = clamp(c, 0, a[i + 1]);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, b, c;
cin >> n;
vector<int> a(n + 1);
long long ans = 0;
rep(i, n + 1) cin >> a[i];
rep(i, n) {
cin >> b;
c = a[i + 1] + a[i];
ans += min(c, b);
a[i + 1] = clamp(c - b, 0, a[i + 1]... | [
"assignment.change"
] | 765,856 | 765,857 | u132364782 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N - 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int counter = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
counter += B[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], 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 counter = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
counter += B[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,859 | 765,860 | u132364782 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N - 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int counter = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
counter += B[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], 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 counter = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
counter += B[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 765,861 | 765,860 | u132364782 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>... | [
"variable_declaration.type.change"
] | 765,862 | 765,863 | u743124029 | cpp |
p02959 | #include <iostream>
#include <vector>
int main(void) {
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 ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans +=... | #include <iostream>
#include <vector>
int main(void) {
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 ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,875 | 765,876 | u275256557 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <memory>
#include <stdio.h>
#include <string>
#include <vector>
double min_double(double a, double b) {
if (a < b)
return a;
else
return b;
}
void swap(int *x, int *y) {
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
}
int gcd(int a, int b) {... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <memory>
#include <stdio.h>
#include <string>
#include <vector>
double min_double(double a, double b) {
if (a < b)
return a;
else
return b;
}
void swap(int *x, int *y) {
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
}
int gcd(int a, int b) {... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,877 | 765,878 | u389834932 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | [
"assignment.change"
] | 765,881 | 765,882 | u209457657 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | [
"variable_declaration.type.primitive.change"
] | 765,883 | 765,884 | u209457657 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n + 1), ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main() {
ll n, sum = 0;
cin >> n;
vector<ll> a(n + 1), b(... | [
"variable_declaration.type.change"
] | 765,885 | 765,886 | u008905660 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM()
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N;
cin >> N;
vector<ll> A(N + 1), B(N);
for (ll i = 0; i <= N; i++)
cin... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM()
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N;
cin >> N;
vector<ll> A(N + 1), B(N);
for (ll i = 0; i <= N; i++)
cin... | [
"expression.operation.binary.remove"
] | 765,887 | 765,888 | u588093355 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, bef = 0;
cin >> N;
vector<int64_t> A(N + 1);
for (int i = 0; i <= N; i++) {
cin >> A.at(i);
}
bef = accumulate(A.begin(), A.end(), 0);
for (int i = 0; i < N; i++) {
int64_t b;
cin >> b;
A.at(i) -= b;
if (A.at(i) >= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, bef = 0;
cin >> N;
vector<int64_t> A(N + 1);
for (int i = 0; i <= N; i++) {
cin >> A.at(i);
}
bef = accumulate(A.begin(), A.end(), 0LL);
for (int i = 0; i < N; i++) {
int64_t b;
cin >> b;
A.at(i) -= b;
if (A.at(i) >... | [
"literal.number.type.widen.change"
] | 765,889 | 765,890 | u543466827 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] < b[i]) {
if (a[i] < b[i] - a[i]) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] < b[i]) {
if (a[i + 1] < b[i] - a[i]) ... | [
"control_flow.branch.if.condition.change"
] | 765,891 | 765,892 | u224469387 | cpp |
p02959 | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define lrep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lrep2(i, a, n) ... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define lrep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lrep2(i, a, n) ... | [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 765,893 | 765,894 | u829260400 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
ll t[n + 1], y[n];
rep(i, n + 1) cin >> t[i];
rep(i, n) cin >> y[i];
ll ans = 0;
rep(i, n) {
if (y[i] > t[i]) {
ans += ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
ll t[n + 1], y[n];
rep(i, n + 1) cin >> t[i];
rep(i, n) cin >> y[i];
ll ans = 0;
rep(i, n) {
if (y[i] > t[i]) {
ans += ... | [
"assignment.value.change"
] | 765,895 | 765,896 | u318661636 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
ll b = 0;
vector<ll> vec(a + 1);
for (ll i = 0; i < a + 1; i++) {
cin >> vec.at(i);
b += vec.at(i);
}
for (ll i = 0; i < a; i++) {
ll c;
cin >> c;
if (vec.at(i) > c) {
vec.at(i) -= c;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
ll b = 0;
vector<ll> vec(a + 1);
for (ll i = 0; i < a + 1; i++) {
cin >> vec.at(i);
b += vec.at(i);
}
for (ll i = 0; i < a; i++) {
ll c;
cin >> c;
if (vec.at(i) > c) {
vec.at(i) -= c;... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 765,897 | 765,898 | u883297128 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,899 | 765,900 | u770067864 | 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; 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];
b[i] -= a[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,901 | 765,902 | u528258842 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
using GraphC = vector<vector<char>>;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
using GraphC = vector<vector<char>>;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef ... | [
"variable_declaration.type.change"
] | 765,905 | 765,906 | u992723601 | cpp |
p02959 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i])
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> b[i];
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i])... | [
"variable_declaration.type.primitive.change"
] | 765,907 | 765,908 | u199441105 | 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 mod = 1000000007;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll ans = 0;
rep(i, n) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll ans = 0;
rep(i, n) {... | [
"assignment.change"
] | 765,909 | 765,910 | u806692883 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> monster(N + 1);
vector<int> hero(N);
for (int i = 0; i <= N; i++) {
cin >> monster[i];
}
for (int i = 0; i <= N - 1; i++) {
cin >> hero[i];
}
int ans = 0;
for (int i = 0; i <= N - 1; i++) ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> monster(N + 1);
vector<int> hero(N);
for (int i = 0; i <= N; i++) {
cin >> monster[i];
}
for (int i = 0; i <= N - 1; i++) {
cin >> hero[i];
}
long long ans = 0;
for (int i = 0; i <= N - 1;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,913 | 765,914 | u328530240 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, sum = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (i = 0; i < n; i++) {
cin >> b.at(i);
}
for (i = 0; i < n; i++) {
if (a.at(i) > b.at(i))
//街nの一部を退治
{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
long sum = 0;
cin >> n;
vector<long> a(n + 1), b(n);
for (i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (i = 0; i < n; i++) {
cin >> b.at(i);
}
for (i = 0; i < n; i++) {
if (a.at(i) > b.at(i))
//街nの一部を退治
... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 765,915 | 765,916 | u367958900 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.a... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.a... | [
"assignment.change"
] | 765,921 | 765,922 | u879226168 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; 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++) {
if (A.at(i) >= B.at(i)) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.a... | [
"assignment.change"
] | 765,923 | 765,922 | u879226168 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int i, j, k, n, a[100001], b[100000], ans;
cin >> n;
ans = 0;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
long long int i, j, k, n, a[100001], b[100000], ans;
cin >> n;
ans = 0;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans +... | [
"variable_declaration.type.widen.change"
] | 765,926 | 765,927 | u491376630 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename... | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,928 | 765,929 | u469813907 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename... | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,930 | 765,929 | u469813907 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
ll a[n + 1];
ll b[n];
ll sum = 0;
for (int i = 0; i <= n; i++) {
ll x;
cin >> x;
a[i] = x;
}
for (int i = 0; i < n; i++) {
ll y;
cin >> y;
b[i] = y;
}
for (int i = 0; i < n... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
ll a[n + 1];
ll b[n];
ll sum = 0;
for (int i = 0; i <= n; i++) {
ll x;
cin >> x;
a[i] = x;
}
for (int i = 0; i < n; i++) {
ll y;
cin >> y;
b[i] = y;
}
for (int i = 0; i < n... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 765,935 | 765,936 | u018679195 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
// deque/functional/iterator/list/map/memory/numeric/queue/set/stack/utility/vector
//#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a[100010];
int b[100010];
int main() {
ios::sync... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
// deque/functional/iterator/list/map/memory/numeric/queue/set/stack/utility/vector
//#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a[100010];
int b[100010];
int main() {
ios::sync... | [
"variable_declaration.type.change"
] | 765,937 | 765,938 | u018679195 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).... | [
"assignment.change"
] | 765,939 | 765,940 | u570601094 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void) {
ll n, ans = 0;
ci... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void) {
ll n, ans = 0;
ci... | [
"assignment.change"
] | 765,941 | 765,942 | u025469035 | 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 count = 0;
for (int i = 0; i < N; i++) {
int C = min(A.at(i), B.at(i));
A.at(... | #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 count = 0;
for (int i = 0; i < N; i++) {
int C = min(A.at(i), B.at(i));
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,943 | 765,944 | u280966279 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
ll n;
cin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
ll n;
cin... | [
"variable_declaration.type.change"
] | 765,948 | 765,949 | u818755983 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
int n;
ci... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
ll n;
cin... | [
"variable_declaration.type.change"
] | 765,950 | 765,949 | u818755983 | 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> mon(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> mon[i];
rep(i, n) cin >> b[i];
int cnt = 0;
rep(i, n) {
if (b[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> mon(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> mon[i];
rep(i, n) cin >> b[i];
ll cnt = 0;
rep(i, n) {
if (b[i] ... | [
"variable_declaration.type.change"
] | 765,951 | 765,952 | u600402037 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A[200000];
int B[200000];
int restA[200000];
int restB[200000];
for (int i = 0; i < N + 1; i++) {
cin >... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A[200000];
int B[200000];
int restA[200000];
int restB[200000];
for (int i = 0; i < N + 1; i++) {
cin >... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,955 | 765,956 | u865014539 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n + 1);
for (size_t i = 0; i < n + 1; i++)
cin >> a[i];
vector<int> b(n);
for (size_t i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int c;
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n + 1);
for (size_t i = 0; i < n + 1; i++)
cin >> a[i];
vector<int> b(n);
for (size_t i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
int c... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,963 | 765,964 | u008040394 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int a[N + 1], b[N + 1];
for (int i = 0; i <= N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
int monster = 0;
for (int i = 0; i < N; i++) {
int ans1 = min(a[i], b[i]);
int ans2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int a[N + 1], b[N];
for (int i = 0; i <= N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
ll monster = 0;
for (int i = 0; i < N; i++) {
int ans1 = min(a[i], b[i]);
int ans2 = mi... | [
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 765,965 | 765,966 | u401152875 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int a[N + 1], b[N + 1];
for (int i = 0; i <= N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
int monster = 0;
for (int i = 0; i < N; i++) {
int ans1 = min(a[i], b[i]);
int ans2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int a[N + 1], b[N];
for (int i = 0; i <= N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
ll monster = 0;
for (int i = 0; i < N; i++) {
int ans1 = min(a[i], b[i]);
int ans2 = mi... | [
"expression.operation.binary.remove",
"variable_declaration.type.change",
"assignment.value.change"
] | 765,967 | 765,966 | u401152875 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
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 count = 0;
for (int i = 0; i < N; i++) {
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
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];
ll count = 0;
for (int i = 0; i < N; i++) {
if... | [
"variable_declaration.type.change"
] | 765,968 | 765,969 | u418892821 | 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);
}
int64_t 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);
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 (A.at(i) < B.at(i) && ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,970 | 765,971 | u856957535 | 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);
}
int64_t 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);
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 (A.at(i) < B.at(i) && ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 765,972 | 765,971 | u856957535 | 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];
int count = 0;
for (int i = 0; i < n; ++i) {
count += min(A[i], B[i]);
B[i] -= min(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 int count = 0;
for (int i = 0; i < n; ++i) {
count += min(A[i], B[i]);
B[i] -= min(... | [
"variable_declaration.type.widen.change"
] | 765,975 | 765,976 | u058106405 | cpp |
p02959 |
/********************************************************
**░██████╗██╗░░░░░░█████╗░██╗░░░██╗██╗░█████╗░░██████╗░**
**██╔════╝██║░░░░░██╔══██╗██║░░░██║██║██╔══██╗██╔════╝░**
**╚█████╗░██║░░░░░███████║╚██╗░██╔╝██║██║░░╚═╝██║░░██╗░**
**░╚═══██╗██║░░░░░██╔══██║░╚████╔╝░██║██║░░██╗██║░░╚██╗**
**██████╔╝███████╗██║░░██║░░╚... |
/********************************************************
**░██████╗██╗░░░░░░█████╗░██╗░░░██╗██╗░█████╗░░██████╗░**
**██╔════╝██║░░░░░██╔══██╗██║░░░██║██║██╔══██╗██╔════╝░**
**╚█████╗░██║░░░░░███████║╚██╗░██╔╝██║██║░░╚═╝██║░░██╗░**
**░╚═══██╗██║░░░░░██╔══██║░╚████╔╝░██║██║░░██╗██║░░╚██╗**
**██████╔╝███████╗██║░░██║░░╚... | [] | 765,983 | 765,984 | u649811088 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (B.at(i) >= A.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 + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long count = 0;
for (int i = 0; i < N; i++) {
if (B.a... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,997 | 765,998 | u710877960 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | [
"assignment.change"
] | 766,002 | 766,003 | u984427208 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, tmp;
long long ans = 0;
scanf("%d", &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++) {
if ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, tmp;
long long ans = 0;
scanf("%d", &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++) {
if ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,006 | 766,007 | u994074033 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, tmp;
long long ans = 0;
scanf("%d", &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++) {
if ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, tmp;
long long ans = 0;
scanf("%d", &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++) {
if ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,006 | 766,008 | u994074033 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
vector<int> B(N, 0);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
if (A.at(i) + A.at(i + 1) <= B.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long sum = 0;
vector<long> A(N + 1, 0);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
vector<long> B(N, 0);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
if (A.at(i) + A.at(i + 1)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,011 | 766,012 | u512266180 | cpp |
p02959 | // C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]";
return os;
}
template <typename T> void print(T v, stri... | // C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]";
return os;
}
template <typename T> void print(T v, stri... | [
"variable_declaration.type.change"
] | 766,015 | 766,016 | u823862638 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
rep(i, N + 1) cin >> A.at(i);
rep(i, N) cin >> B.at(i);
int mon_count = 0;
rep(i, N) {
if (A.at(i) < B.at(i)) {
mon_count += A.at(i);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1), B(N);
rep(i, N + 1) cin >> A.at(i);
rep(i, N) cin >> B.at(i);
long long mon_count = 0;
rep(i, N) {
if (A.at(i) < B.at(i)) {
mon_count += A... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,023 | 766,024 | u109489258 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
if ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (... | [
"variable_declaration.type.change"
] | 766,027 | 766,028 | u529722835 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (b[i] >= a[i]) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (b[i] >= a[i]) {
a... | [
"variable_declaration.type.change"
] | 766,029 | 766,030 | u529722835 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (b[i] >= a[i]) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<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 (b[i] >= a[i]) {
an... | [
"variable_declaration.type.change"
] | 766,029 | 766,031 | u529722835 | cpp |
p02959 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all... | [
"variable_declaration.type.widen.change"
] | 766,034 | 766,035 | u608773191 | cpp |
p02959 | #include <bits/stdc++.h>
#define io() \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
#define io() \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); ... | [
"variable_declaration.type.change"
] | 766,040 | 766,041 | u393220099 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 i = 0; i < n + 1; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 i = 0; i < n; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 766,042 | 766,043 | u056912761 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,046 | 766,047 | u038537254 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | [
"assignment.change"
] | 766,048 | 766,049 | u280175105 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v(n + 1);
rep(i, n + 1) cin >> v[i];
vector<int> u(n);
rep(i, n) cin >> u[i];
int ans = 0;
rep(i, n) {
if (v[i] >= u[i])
ans += u[i];
else {
ans ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v(n + 1);
rep(i, n + 1) cin >> v[i];
vector<int> u(n);
rep(i, n) cin >> u[i];
long ans = 0;
rep(i, n) {
if (v[i] >= u[i])
ans += u[i];
else {
ans... | [
"variable_declaration.type.primitive.change"
] | 766,050 | 766,051 | u280175105 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
std::vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
int result = 0;
for (int i = N - 1; i ... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
std::cin >> N;
std::vector<long> A(N + 1);
std::vector<long> B(N);
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
long result = 0;
for (int i = N - 1;... | [
"variable_declaration.type.primitive.change"
] | 766,054 | 766,055 | u059976138 | 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;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
int count = 0;
rep(i, n + 1) {
cin >> a[i];
count += a[i];
}
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] >= 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;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
ll count = 0;
rep(i, n + 1) {
cin >> a[i];
count += a[i];
}
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] >= b[i]... | [
"variable_declaration.type.change"
] | 766,058 | 766,059 | u869009830 | cpp |
p02959 | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
int n, m;
cin >> n;
m = n + 1;
int a[m], b[n];
rep(i, m) cin >> a... | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
int n, m;
cin >> n;
m = n + 1;
int a[m], b[n];
rep(i, m) cin >> a... | [
"variable_declaration.type.change"
] | 766,060 | 766,061 | u534923072 | cpp |
p02959 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
ci... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
ci... | [
"variable_declaration.type.change"
] | 766,064 | 766,065 | u510989601 | cpp |
p02959 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
ci... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
ci... | [
"variable_declaration.type.change"
] | 766,066 | 766,065 | u510989601 | 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() {
ll N;
cin >> N;
vector<ll> B(N + 1);
vector<ll> A(N);
ll ans = 0;
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
for (int i = 0; i < N; 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() {
ll N;
cin >> N;
vector<ll> B(N + 2);
vector<ll> A(N + 1);
ll ans = 0;
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
for (int i = 0; i < N; i++... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,071 | 766,072 | u078435079 | cpp |
p02959 | #include <iostream>
#include <deque>
#include <stdio.h>
#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define sp << " "
#define nw << "\n"
#define ca "Case " << tc++ << ": "
#define IOS ... | #include <iostream>
#include <deque>
#include <stdio.h>
#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define sp << " "
#define nw << "\n"
#define ca "Case " << tc++ << ": "
#define IOS ... | [
"expression.operation.binary.remove"
] | 766,073 | 766,074 | u156677439 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
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 count = 0;
rep(i, n) rep(j, 2) {
if (a[i... | #include <algorithm>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll count = 0;
rep(i, n) rep(j, 2) {
if (a[i + ... | [
"variable_declaration.type.change"
] | 766,075 | 766,076 | u622070196 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
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 ans = 0;
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
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 ans = 0;
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[... | [
"variable_declaration.type.change"
] | 766,077 | 766,078 | u556120601 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> monsters(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> monsters[i];
}
int last =... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> monsters(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> monsters[i];
}
int last =... | [
"variable_declaration.type.change"
] | 766,083 | 766,084 | u323819429 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), 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]) {
a[i] -= b[i];
ans += ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), 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]) {
a[i] -= b[i];
ans += b... | [
"variable_declaration.type.change"
] | 766,085 | 766,086 | u447455959 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typed... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typed... | [
"variable_declaration.type.change"
] | 766,089 | 766,090 | u265187423 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.