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 <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int n, i;
cin >> n;
vector<int> a(n + 1), b(n);
int answer = 0;
int margin;
for (i = 0; i < n +... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ll n, i;
cin >> n;
vector<ll> a(n + 1), b(n);
ll answer = 0;
ll margin;
for (i = 0; i < n + 1; ... | [
"variable_declaration.type.change"
] | 766,431 | 766,432 | u202813867 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, answer = 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 < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t answer = 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 < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(... | [
"variable_declaration.type.change"
] | 766,438 | 766,439 | u000993607 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, answer = 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 < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t answer = 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 < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(... | [
"variable_declaration.type.change"
] | 766,440 | 766,439 | u000993607 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1)... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { ... | [
"variable_declaration.type.change"
] | 766,441 | 766,442 | u872982453 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long l... | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long l... | [
"variable_declaration.type.change"
] | 766,443 | 766,444 | u931071094 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long l... | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long l... | [
"variable_declaration.type.change"
] | 766,445 | 766,444 | u931071094 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n + 1) cin >> a[i];
int ans = 0;
rep(i, n) {
int b;
cin >> b;
int t = min(b, a[i] + a[i + 1]);
ans += t;
a[i + 1] -= t - ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
rep(i, n + 1) cin >> a[i];
ll ans = 0;
rep(i, n) {
ll b;
cin >> b;
ll t = min(b, a[i] + a[i + 1]);
ans += t;
a[i + 1] -= t - min(b... | [
"variable_declaration.type.change"
] | 766,448 | 766,449 | u907525511 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
ll a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
ll a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, ... | [
"identifier.change"
] | 766,452 | 766,453 | u501163846 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 show(x) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 show(x) \
{ ... | [
"variable_declaration.type.change"
] | 766,454 | 766,455 | u317715099 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 show(x) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 show(x) \
{ ... | [
"variable_declaration.type.change"
] | 766,456 | 766,457 | u317715099 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
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);
}
for (int i = 0; i < N; i++) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long ans = 0;
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);
}
for (int i = 0; i < N; i++) {
if (a.at(i) >= b.at(i)) {
ans ... | [
"variable_declaration.type.widen.change"
] | 766,458 | 766,459 | u160429264 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define printd(x) printf("%.12f\n", ans);
#define print(x) cout << (x) << endl;
#define Yes() cout << "Yes" << endl;
#define No() cout << "No" << endl;
#define YES() cout << "YES" << endl;
#define NO() cout << "NO" << endl;
#define all(x) (x)... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define printd(x) printf("%.12f\n", ans);
#define print(x) cout << (x) << endl;
#define Yes() cout << "Yes" << endl;
#define No() cout << "No" << endl;
#define YES() cout << "YES" << endl;
#define NO() cout << "NO" << endl;
#define all(x) (x)... | [
"assignment.change"
] | 766,464 | 766,465 | u174509352 | cpp |
p02959 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース... | [
"expression.operation.binary.remove"
] | 766,468 | 766,469 | u154645927 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 766,485 | 766,486 | u284045566 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | [
"expression.operation.binary.remove"
] | 766,487 | 766,488 | u284045566 | cpp |
p02955 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | [
"literal.number.change",
"assignment.value.change"
] | 766,489 | 766,490 | u264405855 | cpp |
p02955 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | [
"variable_declaration.value.change",
"identifier.change",
"literal.number.change",
"assignment.value.change"
] | 766,491 | 766,490 | u264405855 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"control_flow.branch.if.condition.change"
] | 766,494 | 766,495 | u347057617 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, k, a[1000];
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
int sum = 0;
rep(i, n) sum += a[i];
vector<int> g(0);
for (int i = 1; i * i <= sum; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, k, a[1000];
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
int sum = 0;
rep(i, n) sum += a[i];
vector<int> g(0);
for (int i = 1; i * i <= sum; ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 766,499 | 766,500 | u389007679 | cpp |
p02955 | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 766,501 | 766,502 | u426683236 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io() {
std:... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io() {
std:... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 766,503 | 766,504 | u233393801 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
sca... | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
sca... | [
"control_flow.branch.if.condition.change"
] | 766,516 | 766,517 | u268793453 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
sca... | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
sca... | [
"control_flow.branch.if.condition.change"
] | 766,516 | 766,518 | u268793453 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
cin... | #include <bits/stdc++.h>
using namespace std;
template <class INT> std::vector<INT> factorize(INT n) {
std::vector<INT> res;
for (INT i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, k;
cin... | [
"call.arguments.change"
] | 766,519 | 766,520 | u268793453 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 766,521 | 766,522 | u366381207 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CONST = 1000000007;
const int BIG_INT = 1000000000;
const ll BIG_NUM = 1000000000000000000;
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CONST = 1000000007;
const int BIG_INT = 1000000000;
const ll BIG_NUM = 1000000000000000000;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,523 | 766,524 | u156778176 | cpp |
p02955 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;
}
#define rep(i, n) for (int i = 0; i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 766,525 | 766,526 | u136342563 | cpp |
p02955 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> div(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.emplace_back(i);
if (i != n / i)
res.emplace_back(n / i);
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> div(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.emplace_back(i);
if (i != n / i)
res.emplace_back(n / i);
... | [] | 766,534 | 766,535 | u530329977 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
vector<long long> yaku(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
vector<long long> yaku(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 766,539 | 766,540 | u183971632 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int n, a[N];
ll check(int x) {
vector<int> v;
ll s = 0;
for (int i = 0; i < n; i++) {
v.push_back(a[i] % x);
s += v.back();
}
sort(v.begin(), v.end());
int c = s / x;
ll ret = 0;
for (int i = int(v.size()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int n, a[N];
ll check(int x) {
vector<int> v;
ll s = 0;
for (int i = 0; i < n; i++) {
v.push_back(a[i] % x);
s += v.back();
}
sort(v.begin(), v.end());
int c = s / x;
ll ret = 0;
for (int i = int(v.size()... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 766,543 | 766,544 | u513000862 | cpp |
p02955 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
u... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
u... | [
"literal.number.type.widen.change"
] | 766,560 | 766,561 | u270681687 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
usi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
usi... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 766,562 | 766,563 | u685892567 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
vector<int> vec;
... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
vector<int> vec;
... | [
"assignment.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 766,574 | 766,575 | u344122377 | cpp |
p02955 | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using namespace std;
const int N = 4e3 + 219;
const ll M = 3e5 + 19;
const ll inf = 1e15 + 10;
const ll mod = 1e9 + 7;
ll n, k, a[N], r[N], p[N], s[N], ans = 0;
vec... | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using namespace std;
const int N = 4e3 + 219;
const ll M = 3e5 + 19;
const ll inf = 1e15 + 10;
const ll mod = 1e9 + 7;
ll n, k, a[N], r[N], p[N], s[N], ans = 0;
vec... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,587 | 766,588 | u892889246 | cpp |
p02955 | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using namespace std;
const int N = 4e3 + 219;
const ll M = 3e5 + 19;
const ll inf = 1e15 + 10;
const ll mod = 1e9 + 7;
ll n, k, a[N], r[N], p[N], s[N], ans = 0;
vec... | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using namespace std;
const int N = 4e3 + 219;
const ll M = 3e5 + 19;
const ll inf = 1e15 + 10;
const ll mod = 1e9 + 7;
ll n, k, a[N], r[N], p[N], s[N], ans = 0;
vec... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 766,589 | 766,588 | u892889246 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef int64_t ll;
const ll MOD = 1000000007;
ll K, N;
vector<ll> A(500, 0);
int main() {
ll at = 0;
cin >> N >> K;
REP(i, N) {
cin >> A[i];
at += A[i];
}
vector<ll> d;
vector<ll> am(N, 0);
vector<ll... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef int64_t ll;
const ll MOD = 1000000007;
ll K, N;
vector<ll> A(500, 0);
int main() {
ll at = 0;
cin >> N >> K;
REP(i, N) {
cin >> A[i];
at += A[i];
}
vector<ll> d;
vector<ll> am(N, 0);
vector<ll... | [
"literal.number.change",
"variable_declaration.value.change"
] | 766,595 | 766,596 | u107091170 | cpp |
p02955 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define cst first
#define dur second
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
const int N = 5e2 + 5, M = 2 * N + 5;
int n, x[N], k, sum;
int a[N], b[N];
int main() {
scanf("%d%d", &n, &k);
for (i... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define cst first
#define dur second
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
const int N = 5e2 + 5, M = 2 * N + 5;
int n, x[N], k, sum;
int a[N], b[N];
int main() {
scanf("%d%d", &n, &k);
for (i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 766,599 | 766,600 | u775315680 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
vector<int> divisors(int n) {
vector<int> ds;
for (int i = 1; i * i <= n; i++)
if (n % i == 0) {
ds.push_back(i);
if (i * i != n)
ds.push_back(n / i);
}
sort(ds.begin(), ds.end());
return ds;
}
int main() {
int N, K;
cin >> N >> K;
... | #include <bits/stdc++.h>
using namespace std;
vector<int> divisors(int n) {
vector<int> ds;
for (int i = 1; i * i <= n; i++)
if (n % i == 0) {
ds.push_back(i);
if (i * i != n)
ds.push_back(n / i);
}
sort(ds.begin(), ds.end());
return ds;
}
int main() {
int N, K;
cin >> N >> K;
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 766,601 | 766,602 | u752161277 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int N, K;
vector<int> A;
int main() {
cin >> N;
cin >> K;
A = vector<int>(N + 1);
int sum = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
sum += A[i];
}
set<int> sumcd;
int s = 2;
while (s * s... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int N, K;
vector<int> A;
int main() {
cin >> N;
cin >> K;
A = vector<int>(N + 1);
int sum = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
sum += A[i];
}
set<int> sumcd;
int s = 2;
while (s * s... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 766,603 | 766,604 | u647974562 | cpp |
p02959 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
int n;
c... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
int n;
c... | [
"variable_declaration.type.change"
] | 766,607 | 766,608 | u870074807 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep(i, N + 1) cin >> A.at(i);
vector<int> B(N);
rep(i, N) cin >> B.at(i);
int cnt = 0;
for (in... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
rep(i, N + 1) cin >> A.at(i);
vector<ll> B(N);
rep(i, N) cin >> B.at(i);
ll cnt = 0;
for (int i... | [
"variable_declaration.type.change"
] | 766,609 | 766,610 | u823855263 | 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() {
ll 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];
int cnt = 0;
for (int i = n - 1; i >= 0; i--) {
// cout << b[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll 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];
ll cnt = 0;
for (int i = n - 1; i >= 0; i--) {
// cout << b[i] ... | [
"variable_declaration.type.change"
] | 766,611 | 766,612 | u965095643 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
long long a[N + 1];
for (int i = 0; i < N + 1; ++i)
cin >> a[i];
long long b[N];
for (int i = 0; i < N; ++i)
cin >> b[i];
int ret = 0;
for (int i = 0; i < N; ++i) {
// defeat his town
if (a[... | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
long long a[N + 1];
for (int i = 0; i < N + 1; ++i)
cin >> a[i];
long long b[N];
for (int i = 0; i < N; ++i)
cin >> b[i];
long long ret = 0;
for (int i = 0; i < N; ++i) {
// defeat his town
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,613 | 766,614 | u894471318 | 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(void) {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int sum = 0;
int rest;
if (a[0] <= b[0]) {
sum += a[0];... | #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(void) {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll sum = 0;
int rest;
if (a[0] <= b[0]) {
sum += a[0];
... | [
"variable_declaration.type.change"
] | 766,615 | 766,616 | u917518913 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll ans;
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);
ans = accumulate(a.begin(), a.end(), 0);
for (int i = 0; i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll ans;
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
ans = accumulate(a.begin(), a.end(), 0LL);
for (int i = 0; ... | [
"literal.number.type.widen.change"
] | 766,619 | 766,620 | u185935459 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int ans;
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);
ans = accumulate(a.begin(), a.end(), 0);
for (int i = 0; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll ans;
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
ans = accumulate(a.begin(), a.end(), 0LL);
for (int i = 0; ... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 766,621 | 766,620 | u185935459 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long sum = 0;
for (int i = 0; i < N; i++) {
if (B.at(i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long sum = 0;
for (int i = 0; i < N; i++) {
if (B.at(i)... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 766,622 | 766,623 | u028061225 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monster(n + 1), player(n);
for (int i = 0; i < n + 1; ++i)
cin >> monster[i];
for (int i = 0; i < n; ++i)
cin >> player[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
if (player[i] > monster[i]) {
ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monster(n + 1), player(n);
for (int i = 0; i < n + 1; ++i)
cin >> monster[i];
for (int i = 0; i < n; ++i)
cin >> player[i];
long long ans = 0;
for (int i = 0; i < n; ++i) {
if (player[i] > monster[i]) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,628 | 766,629 | u706341784 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monster(n + 1), player(n);
for (int i = 0; i < n + 1; ++i)
cin >> monster[i];
for (int i = 0; i < n; ++i)
cin >> player[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
if (player[i] > monster[i]) {
ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> monster(n + 1), player(n);
for (int i = 0; i < n + 1; ++i)
cin >> monster[i];
for (int i = 0; i < n; ++i)
cin >> player[i];
long long ans = 0;
for (int i = 0; i < n; ++i) {
if (player[i] > monster[i])... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,628 | 766,630 | u706341784 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> a(N + 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]) {
ans += b[i];
continue;
} else if... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> a(N + 1), b(N);
rep(i, N + 1) cin >> a[i];
rep(i, N) cin >> b[i];
long long ans = 0;
rep(i, N) {
if (b[i] <= a[i]) {
ans += b[i];
continue;
} e... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,631 | 766,632 | u914707890 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n, s) for (int i = s; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, N + 1, 0) cin >> A[i];
rep(i, N, 0) cin >> B[i];
int sum = 0;
rep(i, N, 0) {
if (A[i] < B[i]) {
sum += A[i];
if (A[i + 1] < abs(B[i]... | #include <bits/stdc++.h>
#define rep(i, n, s) for (int i = s; i < n; i++)
using namespace std;
int main() {
long int N;
cin >> N;
long int A[N + 1], B[N];
rep(i, N + 1, 0) cin >> A[i];
rep(i, N, 0) cin >> B[i];
long int sum = 0;
rep(i, N, 0) {
if (A[i] < B[i]) {
sum += A[i];
if (A[i ... | [
"variable_declaration.type.widen.change"
] | 766,633 | 766,634 | u786667376 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n, s) for (int i = s; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, N + 1, 0) cin >> A[i];
rep(i, N, 0) cin >> B[i];
int sum = 0;
rep(i, N, 0) {
if (A[i] <= B[i]) {
sum += A[i];
if (A[i + 1] <= abs(B[... | #include <bits/stdc++.h>
#define rep(i, n, s) for (int i = s; i < n; i++)
using namespace std;
int main() {
long int N;
cin >> N;
long int A[N + 1], B[N];
rep(i, N + 1, 0) cin >> A[i];
rep(i, N, 0) cin >> B[i];
long int sum = 0;
rep(i, N, 0) {
if (A[i] < B[i]) {
sum += A[i];
if (A[i ... | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,635 | 766,634 | u786667376 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> monsters(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> monsters[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int panch;
panch = min(... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> monsters(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> monsters[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
int panch;
panch ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,640 | 766,641 | u957377447 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#define rep(k, i, n) for (int i = k; i < n; ++i)
using namespace std;
typedef long long ll;
int N;
long a[10001], b[10000];
ll sum = 0;
int main(void) {
// Your code here!
cin >> N;
rep(0, i, N + 1) cin >> a[i];
rep(0, i, N) {
cin >> b[i];
if (b[i] < a[i]) {
... | #include <bits/stdc++.h>
#include <iostream>
#define rep(k, i, n) for (int i = k; i < n; ++i)
using namespace std;
typedef long long ll;
int N;
long a[100001], b[100000];
ll sum = 0;
int main(void) {
// Your code here!
cin >> N;
rep(0, i, N + 1) cin >> a[i];
rep(0, i, N) {
cin >> b[i];
if (b[i] < a[i]) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 766,644 | 766,645 | u246366098 | 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;
ll ans = 0;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
for (int i = 0; i < n; i++) {
int dif = a[i] - b[i];
if (dif <... | #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;
ll ans = 0;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
for (int i = 0; i < n; i++) {
int dif = a[i] - b[i];
if (dif <... | [
"expression.operator.change"
] | 766,648 | 766,649 | u726957641 | 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 + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int sum = 0;
for (int i = 0; i < n; i++) {
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 + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long long sum = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) > b.at(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,650 | 766,651 | u195563735 | 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 + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int sum = 0;
for (int i = 0; i < n; i++) {
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 + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long long sum = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) > b.at(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,652 | 766,651 | u195563735 | cpp |
p02959 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v) {
s >> x;
}
return s;
}
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" <<... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v) {
s >> x;
}
return s;
}
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" <<... | [
"variable_declaration.type.change"
] | 766,653 | 766,654 | u891346638 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
int A[100010];
int B[100000];
cin >> N;
for (int a = 0; a < N + 1; a++) {
cin >> A[a];
}
for (int b = 0; b < N; b++) {
cin >> B[b];
}
int answer = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) { //全力
// A[i] -= B[... | #include <iostream>
using namespace std;
int main() {
int N;
int A[100010];
int B[100000];
cin >> N;
for (int a = 0; a < N + 1; a++) {
cin >> A[a];
}
for (int b = 0; b < N; b++) {
cin >> B[b];
}
long long answer = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) { //全力
// A[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,655 | 766,656 | u235745986 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int i;
for (i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (i = 0; i < n; i++) {
cin >> b.at(i);
}
int ans = 0;
for (int x : a) {
ans += x;
}
for (i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int i;
for (i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (i = 0; i < n; i++) {
cin >> b.at(i);
}
int64_t ans = 0;
for (int x : a) {
ans += x;
}
for (i = 0; i < n; ... | [
"variable_declaration.type.primitive.change"
] | 766,657 | 766,658 | u748616342 | cpp |
p02959 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | [
"variable_declaration.type.change"
] | 766,663 | 766,664 | u764228018 | cpp |
p02959 | #include <iostream>
#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[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
// ith town
if (a[i] >= b[i]) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long 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[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
// ith town
if (a[i] >= b[... | [
"variable_declaration.type.widen.change"
] | 766,665 | 766,666 | u918865212 | 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 = (int)N - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug... | #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 = (int)N - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug... | [
"variable_declaration.type.change"
] | 766,667 | 766,668 | u458311335 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
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); }
long long count = 0;
rep(i, n) {
if (b.at(i) > a.at(i)) {
count += a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
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); }
long long count = 0;
rep(i, n) {
if (b.at(i) > a.at(i)) {
count += a... | [
"assignment.change"
] | 766,669 | 766,670 | u690475097 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
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 cnt = 0;
for (int i = n; i > 0; i--) {
cnt += min(b[i - 1], a[i]);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
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 cnt = 0;
for (int i = n; i > 0; i--) {
cnt += min(b[i - 1], a[i]);
... | [
"variable_declaration.type.change"
] | 766,677 | 766,678 | u191484928 | 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;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int tot = 0;
rep(i, n) {
int dmg1 = min(a[i], b[i]);
a[i] -= dmg1;
b[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll tot = 0;
rep(i, n) {
int dmg1 = min(a[i], b[i]);
a[i] -= dmg1;
b[i]... | [
"variable_declaration.type.change"
] | 766,683 | 766,684 | u194930818 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> city(n + 1), brave(n);
for (int i = 0; i < n + 1; i++)
cin >> city.at(i);
for (int i = 0; i < n; i++)
cin >> brave.at(i);
ll cnt = 0;
for (int i = 0; i < n; i++) {
ll f1 = min(brave.a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> city(n + 1), brave(n);
for (int i = 0; i < n + 1; i++)
cin >> city.at(i);
for (int i = 0; i < n; i++)
cin >> brave.at(i);
ll cnt = 0;
for (int i = 0; i < n; i++) {
ll f1 = min(brave.a... | [
"assignment.change"
] | 766,685 | 766,686 | u050087249 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<long long> h(a + 1);
long long v = 0;
for (int i = 0; i < a + 1; i++) {
cin >> h.at(i);
v += h.at(i);
}
for (int i = 0; i < a; i++) {
long long t;
cin >> t;
if (h.at(i) < t) {
long long x = h.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<long long> h(a + 1);
long long v = 0;
for (int i = 0; i < a + 1; i++) {
cin >> h.at(i);
v += h.at(i);
}
for (int i = 0; i < a; i++) {
long long t;
cin >> t;
if (h.at(i) < t) {
long long x = h.at(i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,689 | 766,690 | u577774192 | 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() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> A(N + 1);
rep(i, N + 1) cin >> A[i];
vector<int> B(N);
rep(i, N) cin >> B[i];
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll N;
cin >> N;
vector<int> A(N + 1);
rep(i, N + 1) cin >> A[i];
vector<int> B(N);
rep(i, N) cin >> B[i];
ll... | [
"variable_declaration.type.change"
] | 766,691 | 766,692 | u389577910 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
long long int a, b;
std::deque<long long int> A;
std::deque<long long int> B;
for (int i = 0; i < n + 1; i++) {
cin >> a;
A.emplace_back(a);
}
for (int j = 0; j < n; j++) {
cin >> b;
B.emplace_back(b);
}
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
long long int a, b;
std::deque<long long int> A;
std::deque<long long int> B;
for (int i = 0; i < n + 1; i++) {
cin >> a;
A.emplace_back(a);
}
for (int j = 0; j < n; j++) {
cin >> b;
B.emplace_back(b);
}
... | [
"assignment.add"
] | 766,693 | 766,694 | u485821416 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int min(int x, int y) {
if (x <= y)
return x;
return y;
}
int max(int x, int y) {
if (x <= y)
return y;
return x;
}
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... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int min(int x, int y) {
if (x <= y)
return x;
return y;
}
int max(int x, int y) {
if (x <= y)
return y;
return x;
}
int main() {
int n;
cin >> n;
long long a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,695 | 766,696 | u904995051 | cpp |
p02959 | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | [] | 766,701 | 766,702 | u449573758 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | [
"assignment.change"
] | 766,703 | 766,704 | u474760662 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <vector>
using namespace std;
int a[100020];
int b[100030];
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 0; i <= N; i++) {
cin >> a[i];
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <vector>
using namespace std;
int a[1000000];
int b[1000000];
int main() {
int N;
cin >> N;
long long int sum = 0;
for (int i = 0; i <= N; i++) {
cin... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 766,707 | 766,708 | u473116917 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <vector>
using namespace std;
int a[1000000];
int b[1000000];
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 0; i <= N; i++) {
cin >> a[i];
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <vector>
using namespace std;
int a[1000000];
int b[1000000];
int main() {
int N;
cin >> N;
long long int sum = 0;
for (int i = 0; i <= N; i++) {
cin... | [
"variable_declaration.type.widen.change"
] | 766,709 | 766,708 | u473116917 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A1(N + 1);
vector<int> B1(N);
vector<int> A2(N + 1);
vector<int> B2(N);
for (int i = 0; i < N + 1; i++) {
cin >> A1.at(i);
A2.at(i) = A... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A1(N + 1);
vector<int> B1(N);
vector<int> A2(N + 1);
vector<int> B2(N);
for (int i = 0; i < N + 1; i++) {
cin >> A1.at(i);
A2.at(i) = A... | [
"variable_declaration.type.change"
] | 766,710 | 766,711 | u574687269 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int n, count = 0;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
rep(i, n) {
if (a.at(i) + a.at(i + ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int n;
ll count = 0;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
rep(i, n) {
if (a.at(i) + a.at... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 766,714 | 766,715 | u147331814 | cpp |
p02959 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
long long a[100002] = {}, b[100002] = {}, m = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i]... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
long long a[100002] = {}, b[100002] = {}, m = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i]... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 766,716 | 766,717 | u120050685 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int ans = 0;
for (int i = 0; i < N; i++) {
ans += min(A.at(i), B... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += min(A.at... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,718 | 766,719 | u045289115 | 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++) {
int X = min(A.at(i), B.at(i));
A.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long ans = 0;
for (int i = 0; i < N; i++) {
int X = min(A.at(i), B.at(i));
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,720 | 766,721 | u045289115 | cpp |
p02959 | #include <algorithm>
#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 + 1; 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--) {
int fir... | #include <algorithm>
#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 + 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--) {
i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,726 | 766,727 | u868132236 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 766,728 | 766,729 | u688825490 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100005], b[100005], ans = 0, k, l, m;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
k = a[i];
l = b[i];
m = a[i + 1];
ans += min(a[i], b[i])... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100005], b[100005], ans = 0, k, l, m;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
k = a[i];
l = b[i];
m = a[i + 1];
ans += min(a[i],... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 766,732 | 766,733 | u732421371 | 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>;
void Main() {
int N;
cin >> N;
N++;
int saved = 0;
vector<int> A(N), B(N);
rep(i, N) {
cin >> A[i];
// cout << A[i] << endl;
}
rep(i, N - 1) {
cin >>... | #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>;
void Main() {
int N;
cin >> N;
N++;
ll saved = 0;
vector<int> A(N), B(N);
rep(i, N) {
cin >> A[i];
// cout << A[i] << endl;
}
rep(i, N - 1) {
cin >> ... | [
"variable_declaration.type.change"
] | 766,738 | 766,739 | u900523387 | 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<ll> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++)
cin >> A.at(i);
for (int i = 0; i < n; i++)
cin >> B.at(i);
ll ans ... | #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<ll> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++)
cin >> A.at(i);
for (int i = 0; i < n; i++)
cin >> B.at(i);
ll ans ... | [
"assignment.change"
] | 766,744 | 766,745 | u180029567 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
long long ans = 0;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
long long ans = 0;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 766,746 | 766,747 | u297195722 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n, A[10000], B[10000], c = 0;
cin >> n;
for (int i = 0; i < n + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < n; ++i) {
cin >> B[i];
}
for (int i = 0; i < n; ++i) {
long long int h = min(A[i],... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n, A[100007], B[100007], c = 0;
cin >> n;
for (int i = 0; i < n + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < n; ++i) {
cin >> B[i];
}
for (int i = 0; i < n; ++i) {
long long int h = min(A[i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 766,748 | 766,749 | u022688266 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, sum = 0... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, sum = 0,... | [
"variable_declaration.type.change"
] | 766,750 | 766,751 | u670898337 | 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[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 += a[i];
... | ///答え見ました
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> 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];
int64_t count = 0;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
count += a[i... | [
"variable_declaration.type.primitive.change"
] | 766,752 | 766,753 | u028906014 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
rep(i, n + 1) { cin >> A[i]; }
vector<int> B(n);
... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
rep(i, n + 1) { cin >> A[i]; }
vector<int> B(n);
... | [
"variable_declaration.type.change"
] | 766,754 | 766,755 | u745267317 | cpp |
p02959 | #include <iostream>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 0; i < n + 1; i++)
cin >> arr[i];
int brr[n];
for (int i = 0; i < n; i++)
cin >> brr[i];
int ans = 0;
for (int i = 0; i < n - 1; i++) {
int tm = min(brr[i], arr[i]);... | #include <iostream>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 0; i < n + 1; i++)
cin >> arr[i];
int brr[n];
for (int i = 0; i < n; i++)
cin >> brr[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int tm = min(brr[i], arr[i]);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 766,756 | 766,757 | u915287802 | 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 ld = long double;
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 ans = 0;
rep(i, n) {
if... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
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 ans = 0;
rep(i, n) {
if... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 766,764 | 766,765 | u068713120 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<int> l(N + 1), b(N);
for (int i = 0; i <= N; i++) {
cin >> l[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<int> l(N + 1), b(N);
for (int i = 0; i <= N; i++) {
cin >> l[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; ... | [
"variable_declaration.type.change"
] | 766,766 | 766,767 | u146594935 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<int> l(N + 1), b(N);
for (int i = 0; i <= N; i++) {
cin >> l[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<int> l(N + 1), b(N);
for (int i = 0; i <= N; i++) {
cin >> l[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; ... | [
"variable_declaration.type.change"
] | 766,768 | 766,769 | u146594935 | 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 result = 0;
for (int i = 0, d; i < n; i++) {
d = min(a[i], b[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long result = 0;
for (int i = 0, d; i < n; i++) {
d = min(a[i], b... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,770 | 766,771 | u154898295 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
ans += b[i];
else {
ans += ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
ans += b[i];
else {
ans... | [
"variable_declaration.type.primitive.change"
] | 766,778 | 766,779 | u107406081 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iomanip>
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 cnt = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long cnt = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) ... | [
"variable_declaration.type.primitive.change"
] | 766,782 | 766,783 | u623391301 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long cnt = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B... | [
"variable_declaration.type.primitive.change"
] | 766,784 | 766,785 | u623391301 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iomanip>
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 cnt = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long cnt = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B... | [
"variable_declaration.type.primitive.change"
] | 766,786 | 766,785 | u623391301 | 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;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n + 1) {
ll min1 = min(a[i], b[i]);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n) {
ll min1 = min(a[i], b[i]);
a[... | [
"expression.operation.binary.remove"
] | 766,792 | 766,793 | u233586402 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.