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 <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
int retval = 0;
for (int i =... | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
long long int retval ... | [
"variable_declaration.type.widen.change"
] | 769,844 | 769,845 | u781317830 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
int tmp, kill = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (tmp >= A[i]) {
tmp -= A[i];
if (tmp >= A[i + 1]) {
kill += (A[i] + A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
long long tmp, kill = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (tmp >= A[i]) {
tmp -= A[i];
if (tmp >= A[i + 1]) {
kill += (A[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,846 | 769,847 | u069389947 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
//正なら元の値、負なら０を返す関数
long long ramp(long long x) {
if (x >= 0)
return x;
else
return 0;
}
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
//元のモンスターの数
long long s = accumulate(a.begin(),... | #include <bits/stdc++.h>
using namespace std;
//正なら元の値、負なら０を返す関数
long long ramp(long long x) {
if (x >= 0)
return x;
else
return 0;
}
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
//元のモンスターの数
long long s = accumulate(a.begin(),... | [
"call.arguments.change"
] | 769,850 | 769,851 | u320241053 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[100001], b[100000];
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[... | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[100001], b[100000];
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[... | [
"assignment.value.change",
"identifier.change"
] | 769,852 | 769,853 | u265392294 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
R... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
R... | [
"variable_declaration.type.change"
] | 769,854 | 769,855 | u594140666 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
R... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
R... | [
"variable_declaration.type.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 769,856 | 769,855 | u594140666 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long ma[100010];
long mb[100010];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long ma[100010];
long mb[100010];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 769,857 | 769,858 | u604231488 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#defi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#defi... | [
"variable_declaration.type.change"
] | 769,860 | 769,861 | u117734686 | cpp |
p02959 | #include <iostream>
using namespace std;
const int N = 1e5 + 5;
int a[N], b[N];
// long long a[1e9],b[1e9];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
long long s = 0;
for (int i = 0; i < n;... | #include <iostream>
using namespace std;
const int N = 1e5 + 5;
int a[N], b[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
long long s = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,863 | 769,864 | u300768980 | cpp |
p02959 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include"fun... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include"fun... | [
"variable_declaration.type.change"
] | 769,873 | 769,874 | u963646695 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
template <class T> bool CHMAX(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool CHMIN(T &a, const T &b) {
if (b < a) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
template <class T> bool CHMAX(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool CHMIN(T &a, const T &b) {
if (b < a) {
... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,877 | 769,878 | u410392135 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void Solve() {
int n;
cin >> n;
vector<int> a, b;
int buf;
for (auto i = 1; i <= n + 1; ++i) {
cin >> buf;
a.push_back(buf);
}
for (auto i = 1; i <= n; ++i) {
cin >> buf;
b.push_back(buf);
}
auto count = 0... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void Solve() {
int n;
cin >> n;
vector<int> a, b;
int buf;
for (auto i = 1; i <= n + 1; ++i) {
cin >> buf;
a.push_back(buf);
}
for (auto i = 1; i <= n; ++i) {
cin >> buf;
b.push_back(buf);
}
auto count = 0... | [
"literal.number.type.widen.change"
] | 769,879 | 769,880 | u276317406 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pd... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pd... | [
"identifier.change",
"call.arguments.change",
"assignment.value.change"
] | 769,881 | 769,882 | u109256064 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int c = 0;
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
c += a[i];
b[i] -= a[i];
if (b[i] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long c = 0;
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
c += a[i];
b[i] -= a[i];
if ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,903 | 769,904 | u888514242 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
inline ll min(ll a, ll b) { return a < b ? a : b; }
const int Max = 1e5 + 12;
int main() {
ios_b... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
inline ll min(ll a, ll b) { return a < b ? a : b; }
const int Max = 1e5 + 12;
int main() {
ios_b... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 769,907 | 769,908 | u992218377 | cpp |
p02959 | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
namespace io ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
namespace io ... | [
"literal.number.type.widen.change"
] | 769,911 | 769,912 | u465699806 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> 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--) {
int c = std::min(b[i], a[i + 1]);
ans += c;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
long ans = 0;
for (int i = n - 1; i >= 0; i--) {
int c = std::min(b[i], a[i + 1]);
ans += c;
... | [
"variable_declaration.type.primitive.change"
] | 769,913 | 769,914 | u793801197 | cpp |
p02959 | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 769,915 | 769,916 | u403800404 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
b.at(n) = 0;
int x = 0, tmp = 0;
x += min(a.at(0), b.at(0));
tmp = max(0, b.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
b.at(n) = 0;
int64_t x = 0;
int tmp = 0;
x += min(a.at(0), b.at(0));
tmp = ... | [
"variable_declaration.type.primitive.change"
] | 769,919 | 769,920 | u059207724 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 2);
vector<int> b(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
a.at(n + 1) = 0;
b.at(n) = 0;
int x = 0, tmp1 = 0, tmp2 = 0;
tmp1 = min(a.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 2);
vector<int> b(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
a.at(n + 1) = 0;
b.at(n) = 0;
int64_t x = 0;
int tmp1 = 0, tmp2 = 0;
tmp1 =... | [
"variable_declaration.type.primitive.change"
] | 769,921 | 769,922 | u059207724 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
double max = 0;
if (b[0] <= a[0]) {
max += b[0];
b[0] = 0;
} else {
max += a[0];
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long int max = 0;
if (b[0] <= a[0]) {
max += b[0];
b[0] = 0;
} else {
max += a[0];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,928 | 769,929 | u779636842 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vCityMonster(N + 1, 0);
for (int i = 0; i < N + 1; i++) {
cin >> vCityMonster[... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vCityMonster(N + 1, 0);
for (int i = 0; i < N + 1; i++) {
cin >> vCityMonster[... | [
"variable_declaration.type.primitive.change"
] | 769,930 | 769,931 | u376998218 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <queue>
#include <set>
using namespace std;
int N;
int A[100001];
int _A[100001];
int B[100000];
int _B[100000];
int rsol(int *a, int *b) {
long long int res = 0;
for (int i = N - 1; i >= 0; --i) {
int k2 = min(b[i], a[i + 1]);
res += ... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <queue>
#include <set>
using namespace std;
int N;
int A[100001];
int _A[100001];
int B[100000];
int _B[100000];
long long int rsol(int *a, int *b) {
long long int res = 0;
for (int i = N - 1; i >= 0; --i) {
int k2 = min(b[i], a[i + 1]);
... | [
"variable_declaration.type.widen.change"
] | 769,936 | 769,937 | u585670083 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; 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 (B[i] <= A[i] + A[i + 1]) {
ans += B[i];
if (B[i] <= A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i] + A[i + 1]) {
ans += B[i];
if (B[i] <= ... | [
"variable_declaration.type.primitive.change"
] | 769,940 | 769,941 | u616053863 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; 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 (B[i] <= A[i] + A[i + 1]) {
ans += B[i];
if (B[i] < A[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i] + A[i + 1]) {
ans += B[i];
if (B[i] <= ... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 769,942 | 769,941 | u616053863 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; 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 (B[i] <= A[i] + A[i + 1]) {
ans += B[i];
if (B[i] <= A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i] + A[i + 1]) {
ans += B[i];
if (B[i] <= ... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 769,943 | 769,941 | u616053863 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; 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 (B[i] <= A[i]) {
ans += B[i];
} else {
if (B[i] <=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
ans += B[i];
} else {
if (B[i] ... | [
"variable_declaration.type.primitive.change"
] | 769,944 | 769,945 | u616053863 | 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; 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 result = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) < B.a... | [
"variable_declaration.type.primitive.change"
] | 769,949 | 769,950 | u842596864 | cpp |
p02959 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int inputValue() {
int a;
cin >> a;
return a;
};
vo... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int inputValue() {
int a;
cin >> a;
return a;
};
vo... | [
"variable_declaration.type.change"
] | 769,956 | 769,957 | u413763374 | cpp |
p02959 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
int counter = 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++) {
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
long counter = 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++) {
... | [
"variable_declaration.type.primitive.change"
] | 769,962 | 769,963 | u359453826 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long A[N + 1];
long B[N];
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++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= A... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long A[N + 1];
long B[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long counter = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= ... | [
"variable_declaration.type.primitive.change"
] | 769,964 | 769,965 | u359453826 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 769,966 | 769,967 | u494070244 | 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, kekka;
kekka = 0;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
rep(i, N) {
if (A[i] >= B[i])
kekka += B[i];
else {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long int N, kekka;
kekka = 0;
cin >> N;
vector<long long int> A(N + 1);
vector<long long int> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
rep(i, N) {
if (A[i] >= B[i])
... | [
"variable_declaration.type.widen.change"
] | 769,968 | 769,969 | u170513117 | 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[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] >= b[i]) {
ans += b[i];
if (b[i] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, ans = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] >= b[i]) {
ans += b[i];
... | [
"variable_declaration.type.widen.change"
] | 769,974 | 769,975 | u125051909 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
using ll = long long;
const ll mod = 1000000007;
const ll INF = 100000000000000000LL;
signed main() {
int n;
cin >> n;
vector<int> A(n + 1), B(n);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
using ll = long long;
const ll mod = 1000000007;
const ll INF = 100000000000000000LL;
signed main() {
int n;
cin >> n;
vector<int> A(n + 1), B(n);... | [
"variable_declaration.type.change"
] | 769,978 | 769,979 | u282228874 | cpp |
p02959 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
using lint = long long int;
int main() {
/* 入力処理ここから*/
int N;
int *A, *B;
cin >> N;
A = new int[N + 1];
B = new int[N];
for (int i = 0; i < N + 1; i++) {
int n;
c... |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
using lint = long long int;
int main() {
/* 入力処理ここから*/
int N;
int *A, *B;
cin >> N;
A = new int[N + 1];
B = new int[N];
for (int i = 0; i < N + 1; i++) {
int n;
c... | [
"variable_declaration.type.change"
] | 769,980 | 769,981 | u500855421 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < n; i++)
typedef long long ll;
const int INF = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n + 1);
rep(i, 0, n + 1) cin >> A[i];
vector<int> B(n);
rep(i, 0, n) c... | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < n; i++)
typedef long long ll;
const int INF = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n + 1);
rep(i, 0, n + 1) cin >> A[i];
vector<int> B(n);
rep(i, 0, n) c... | [
"variable_declaration.type.change"
] | 769,982 | 769,983 | u441723963 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
long long input;
vector<long long> A;
vector<long long> B;
long long i;
int total = 0;
cin >> N;
for (i = 0; i < N + 1; i++) {
cin >> input;
A.push_back(input);
}
for (i = 0; i < N; i+... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
long long input;
vector<long long> A;
vector<long long> B;
long long i;
long long total = 0;
cin >> N;
for (i = 0; i < N + 1; i++) {
cin >> input;
A.push_back(input);
}
for (i = 0; i <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,986 | 769,987 | u641446860 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 769,992 | 769,993 | u320491590 | cpp |
p02959 | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
for (int i = 0; i < N + 1; ++i) {
std::cin >> A[i];
}
std::vector<int> B(N);
for (int i = 0; i < N; ++i) {
std::cin >> B[i];
}
int total = 0;
for (int i = 0; i < N; ++i) {
int buf = st... | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
for (int i = 0; i < N + 1; ++i) {
std::cin >> A[i];
}
std::vector<int> B(N);
for (int i = 0; i < N; ++i) {
std::cin >> B[i];
}
long long total = 0;
for (int i = 0; i < N; ++i) {
int bu... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,998 | 769,999 | u526971181 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int b[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
sum = su... | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int b[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
long long sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
su... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 770,015 | 770,016 | u382002817 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, m, t;
m = 0;
cin >> N;
vector<int> c(N + 2);
vector<int> y(N + 2);
for (int i = 0; i < N + 1; i++) {
cin >> c.at(i);
}
for (int i = 0; i < N; i++) {
cin >> y.at(i);
}
for (int i = 0; i < N + 1; i++) {
if (c.at(i) > y.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t;
long m;
m = 0;
cin >> N;
vector<int> c(N + 2);
vector<int> y(N + 2);
for (int i = 0; i < N + 1; i++) {
cin >> c.at(i);
}
for (int i = 0; i < N; i++) {
cin >> y.at(i);
}
for (int i = 0; i < N + 1; i++) {
if (c.at(i) >... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 770,022 | 770,023 | u413886479 | cpp |
p02959 | #include <iostream>
using namespace std;
int N;
int A[10 * 10 * 10 * 10 * 10 + 1];
int B[10 * 10 * 10 * 10 * 10];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int j = 0; j < N; ++j)
cin >> B[j];
int res = 0;
int counter = 0;
... | #include <iostream>
using namespace std;
int N;
int A[10 * 10 * 10 * 10 * 10 + 1];
int B[10 * 10 * 10 * 10 * 10];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int j = 0; j < N; ++j)
cin >> B[j];
int res = 0;
int counter = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 770,028 | 770,029 | u696988954 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
/*input*/
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];
}
/*calculaiton*/
vector<int> tmp(n + 1);
for (int i = 0... | #include <iostream>
#include <vector>
using namespace std;
int main() {
/*input*/
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];
}
/*calculaiton*/
vector<long int> tmp(n + 1);
for (int ... | [
"variable_declaration.type.widen.change"
] | 770,035 | 770,036 | u637220270 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
int ans = 0;
rep(i, n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
long long ans = 0;
re... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 770,037 | 770,038 | u413207096 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
int ans;
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a.at(i); }
rep(i, n) { cin >> b.at(i); }
long long ans = 0;
re... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.value.change"
] | 770,039 | 770,038 | u413207096 | 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);
}
int c = 0;
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int j = 0; j < N; j++) {
if (A.at(j) >= B.at(j)) {
... | #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);
}
long long int c = 0;
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int j = 0; j < N; j++) {
if (A.at(j) >= B.at(j... | [
"variable_declaration.type.widen.change"
] | 770,052 | 770,053 | u602544363 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> A(N + 10);
std::vector<int> B(N + 10);
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
int attackedMonster = 0;
for (int i = 0; ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> A(N + 10);
std::vector<int> B(N + 10);
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
long attackedMonster = 0;
for (int i = 0;... | [
"variable_declaration.type.primitive.change"
] | 770,054 | 770,055 | u568877271 | cpp |
p02959 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
vector<int> B(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
int ans = 0;
for (int i = N; i > 0; --i) {
if (A[i] + A[i ... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
vector<int> B(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
long long ans = 0;
for (int i = N; i > 0; --i) {
if (A[i] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 770,060 | 770,061 | u701556979 | cpp |
p02959 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
vector<long long> B(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; ++i) {
lon... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
vector<long long> B(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; ++i) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 770,062 | 770,063 | u701556979 | cpp |
p02959 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// container util
//------------------------------------------
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define EACH(i, c) ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// container util
//------------------------------------------
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define EACH(i, c) ... | [
"variable_declaration.type.change"
] | 770,064 | 770,065 | u513290715 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n], t = 0, i;
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 (b[i] <= a[i]) {
t += b[i];
} else if (a[i +... | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n + 1], b[n], t = 0;
int i;
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 (b[i] <= a[i]) {
t += b[i];
... | [
"variable_declaration.type.change"
] | 770,066 | 770,067 | u739265934 | cpp |
p02959 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | [
"variable_declaration.type.change"
] | 770,075 | 770,076 | u190907730 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int beaten = 0;
for (int i = n; i >= 1; i--) {
int diff = min(a[i], b[i - 1]);
int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long beaten1 = 0;
for (int i = n; i >= 1; i--) {
int diff = min(a[i], b[i - 1]);
... | [
"assignment.variable.change",
"identifier.change",
"io.output.change"
] | 770,081 | 770,082 | u436741428 | cpp |
p02959 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using f32 = float;
using f64 = double;
using f80 = __float80;
using namespace std;
using LL = long long;
using ULL = unsign... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using f32 = float;
using f64 = double;
using f80 = __float80;
using namespace std;
using LL = long long;
using ULL = unsign... | [
"variable_declaration.type.change"
] | 770,083 | 770,084 | u379928983 | 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[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N + 1; i++) {
if (A[i] < B[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[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 770,087 | 770,086 | u037276799 | 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[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N + 1; i++) {
if (A[i] < B[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[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 770,088 | 770,086 | u037276799 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long A[100000];
long long B[100000];
int main() {
int N;
cin >> N;
for... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long A[100000];
long long B[100000];
int main() {
int N;
cin >> N;
for... | [
"assignment.change"
] | 770,089 | 770,090 | u623349537 | 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 c = 0;
for (int i = 0; i < n; i++) {
c += min(a[i], b[i]);
c += min(a[i + 1], max(... | #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];
}
long long int c = 0;
for (int i = 0; i < n; i++) {
c += min(a[i], b[i]);
c += min(a[i ... | [
"variable_declaration.type.widen.change"
] | 770,096 | 770,097 | u704064492 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, ans;
cin >> n;
ans = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(j, n) cin >> b[j];
for (int k = 0; k < n; k++) {
if (b[k] == a[k])
ans = ans + a[k];
else if (b[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
long ans;
cin >> n;
ans = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(j, n) cin >> b[j];
for (int k = 0; k < n; k++) {
if (b[k] == a[k])
ans = ans + a[k];
else... | [
"variable_declaration.type.widen.change"
] | 770,100 | 770,101 | u551813187 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
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 cnt = 0;
for (int ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
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 int cnt = 0;
... | [
"variable_declaration.type.widen.change"
] | 770,102 | 770,103 | u628134373 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long A[n + 1];
long B[n];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= A... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long A[n + 1];
long B[n];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
long sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= A... | [
"variable_declaration.type.primitive.change"
] | 770,104 | 770,105 | u432088501 | cpp |
p02959 | #include <iostream>
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 sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= A[j... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long A[n + 1];
long B[n];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
long sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= A... | [
"variable_declaration.type.primitive.change"
] | 770,106 | 770,105 | u432088501 | cpp |
p02959 | #include <iostream>
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 sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= A[j... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long A[n + 1];
long B[n];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
long sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= A... | [
"variable_declaration.type.primitive.change"
] | 770,107 | 770,105 | u432088501 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long A[n + 1];
long B[n];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= A... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long A[n + 1];
long B[n];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
long sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= ... | [
"variable_declaration.type.primitive.change"
] | 770,104 | 770,108 | u432088501 | cpp |
p02959 | #include <iostream>
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 sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= A[j... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long A[n + 1];
long B[n];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
long sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
if (B[i] >= ... | [
"variable_declaration.type.primitive.change"
] | 770,106 | 770,108 | u432088501 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
int ki = min(a[i + 1], b[i]);
a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = n - 1; i >= 0; i--) {
int ki = min(a[i ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 770,109 | 770,110 | u117348081 | cpp |
p02959 | #include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (size_t i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (size_t i = 0; i < N; i++) {
cin >> B[i];
}
int cnt = 0, p = 0;
for (size_t i ... | #include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1), B(N);
for (size_t i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (size_t i = 0; i < N; i++) {
cin >> B[i];
}
long cnt = 0, p = 0;
for (size_t ... | [
"variable_declaration.type.primitive.change"
] | 770,111 | 770,112 | u022433269 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
ll sum = 0;
rep(i, N) {
ll diff = A[i] - B[i];
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
ll sum = 0;
rep(i, N) {
ll diff = A[i] - B[i];
... | [
"assignment.change"
] | 770,116 | 770,117 | u317806971 | cpp |
p02959 | #include <iostream>
typedef long long LL;
using namespace std;
LL a[100001];
LL b[100000];
int n;
int main() {
LL sum = 0;
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 + 1; i++) {
if (a[i] + a[i + 1] <= b[i]) {
... | #include <iostream>
typedef long long LL;
using namespace std;
LL a[100001];
LL b[100000];
int n;
int main() {
LL sum = 0;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] <= b[i]) {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 770,127 | 770,128 | u838609976 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double PI = acos(-1.0);
const ll MOD = 1000000007;
string S;
ll dp[100010][13];
int input() { cin >> S; }
int solve() {
int N = S.length();
for (int i = 0; i < 13; ++i)
dp[1][i] = 0ll;
if (S[0] == '?') {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double PI = acos(-1.0);
const ll MOD = 1000000007;
string S;
ll dp[100010][13];
int input() { cin >> S; }
int solve() {
int N = S.length();
for (int i = 0; i < 13; ++i)
dp[1][i] = 0ll;
if (S[0] == '?') {
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 770,144 | 770,145 | u675343092 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n); (i) > 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
const lint MAX = 10000000;
lin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n); (i) > 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
const lint MAX = 10000000;
lin... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 770,151 | 770,152 | u768204022 | cpp |
p02960 | /*
* Name : chaitanya
*
* Institute : ANITS,Visakhapatnam
*
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#incl... |
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <m... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 770,163 | 770,164 | u866529295 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
int main() {
int MOD = pow(10, 9) + 7;
string s;
cin >> s;
int l = s.size();
long dp[l + 1][13];
int table10[7];
table10[1] = 1;
rep(i, 5) { table... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
int main() {
int MOD = pow(10, 9) + 7;
string s;
cin >> s;
int l = s.size();
long dp[l + 1][13];
int table10[7];
table10[1] = 1;
rep(i, 5) { table... | [
"assignment.change"
] | 770,187 | 770,188 | u518042385 | cpp |
p02960 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"variable_declaration.type.change"
] | 770,197 | 770,198 | u498141549 | cpp |
p02960 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
ll dp[100000][13];
int modpow(int x, int y) {
int res = 1;
while (y > 0) {
if (y & 1)
res ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
ll dp[100000][13];
int modpow(int x, int y) {
int res = 1;
while (y > 0) {
if (y & 1)
res ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 770,203 | 770,204 | u075296067 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(), (A).end()
#define ll long long
const int mod = 1e9 + 7;
int dp[100005][13];
int main(void) {
string s;
cin >> s;
int n = s.size();
dp[0][0] = 1;
int mul = 1; //桁数
// 1?2?3 の場合は 0 -> 3 -> ?3 -> 2?3 -> ...の順に処理していく
for (int i = n ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(), (A).end()
#define ll long long
const int mod = 1e9 + 7;
int dp[100005][13];
int main(void) {
string s;
cin >> s;
int n = s.size();
dp[0][0] = 1;
int mul = 1; //桁数
// 1?2?3 の場合は 0 -> 3 -> ?3 -> 2?3 -> ...の順に処理していく
for (int i = n ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 770,221 | 770,222 | u168774513 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
// kmp をやるための前計算
vector<int> makeTable(const string &s) {
int n = s.size();
vector<int> ret(n + 1);
ret[0] = -1;
int j = -1;
for (int i = 0; i < n; i++) {
while (j >= 0 && s[i] != s[j])
j = ret[j];
ret[i + 1] = ++j;
}
return ret;
}
// str の中に w... | #include <bits/stdc++.h>
using namespace std;
// kmp をやるための前計算
vector<int> makeTable(const string &s) {
int n = s.size();
vector<int> ret(n + 1);
ret[0] = -1;
int j = -1;
for (int i = 0; i < n; i++) {
while (j >= 0 && s[i] != s[j])
j = ret[j];
ret[i + 1] = ++j;
}
return ret;
}
// str の中に w... | [
"assignment.change"
] | 770,229 | 770,230 | u208608367 | cpp |
p02962 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int maxn = 2e6 + 5;
typedef long long ll;
const ll mod = 191981019260817247;
ll base = 233;
ll pw[maxn], ha[maxn];
inline ll mul(ll a, ll b) {
ll k = (ll)((long double)a * b / mo... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int maxn = 2e6 + 5;
typedef long long ll;
const ll mod = 191981019260817247;
ll base = 233;
ll pw[maxn], ha[maxn];
inline ll mul(ll a, ll b) {
ll k = (ll)((long double)a * b / mo... | [] | 770,561 | 770,563 | u894379040 | cpp |
p02962 | /*input
*/
#include <bits/stdc++.h>
#define up(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define down(i, b, a) for (int(i) = (b); i >= (a); --i)
#define debug(x) cerr << (x) << '\n';
#define bits(x, i) ((x >> i) & 1)
#define mid ((l + r) / 2)
#define pr pair<int, int>
using namespace std;
const int N = 1500005;
i... | /*input
*/
#include <bits/stdc++.h>
#define up(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define down(i, b, a) for (int(i) = (b); i >= (a); --i)
#define debug(x) cerr << (x) << '\n';
#define bits(x, i) ((x >> i) & 1)
#define mid ((l + r) / 2)
#define pr pair<int, int>
using namespace std;
const int N = 2000005;
i... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 770,578 | 770,577 | u767911011 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define p... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 770,605 | 770,604 | u342075214 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define int long long
#include "string"
vector<int> preffix(string s) {
int n = s.size();
... | #include <bits/stdc++.h>
using namespace std;
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define int long long
#include "string"
vector<int> preffix(string &s) {
int n = s.size();... | [
"literal.number.change",
"variable_declaration.value.change"
] | 770,613 | 770,615 | u371555975 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
constexpr char ln = ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
constexpr char ln = ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 770,633 | 770,637 | u980909653 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void Z_algo(string &S, vector<int> &v) {
int N = S.size();
v = vector<int>(N, 0);
v[0] = N;
int i = 1, j = 0;
while (i < N) {
while (i + j < N && S[j] == S[i + j]) {
j++;
}
v[i] = j;
// cout << i << " " << j << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void Z_algo(string &S, vector<int> &v) {
int N = S.size();
v = vector<int>(N, 0);
v[0] = N;
int i = 1, j = 0;
while (i < N) {
while (i + j < N && S[j] == S[i + j]) {
j++;
}
v[i] = j;
// cout << i << " " << j << endl;
... | [
"control_flow.loop.for.condition.change"
] | 770,656 | 770,658 | u548834738 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
tem... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
tem... | [
"control_flow.loop.condition.change",
"call.arguments.add"
] | 770,718 | 770,719 | u318785595 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using piii = pair<pair<int, int>, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using piii = pair<pair<int, int>, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>... | [
"control_flow.loop.condition.change"
] | 770,720 | 770,721 | u463243362 | cpp |
p02962 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | [
"literal.number.change",
"control_flow.loop.condition.change",
"assignment.add"
] | 770,730 | 770,731 | u242679311 | cpp |
p02962 | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll MOD = 1e9 + 7;
constexpr int dx[4] = {0, 1, 0, -1}, ... | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll MOD = 1e9 + 7;
constexpr int dx[4] = {0, 1, 0, -1}, ... | [
"expression.operation.binary.remove"
] | 770,732 | 770,733 | u924339359 | cpp |
p02962 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 770,734 | 770,735 | u459402168 | cpp |
p02962 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int slen = s.length(), tlen = t.length();
s = t + '#' + s;
for (int i = 0; i < t.length(); i++) {
s += s[tlen + 1 + i % s.le... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int slen = s.length(), tlen = t.length();
s = t + '#' + s;
for (int i = 0; i < t.length(); i++) {
s += s[tlen + 1 + i % s.le... | [
"control_flow.loop.for.condition.change"
] | 770,781 | 770,782 | u587665681 | cpp |
p02962 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int slen = s.length(), tlen = t.length();
s = t + '#' + s;
for (int i = 0; i < t.length(); i++) {
s += s[tlen + 1 + i % s.le... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int slen = s.length(), tlen = t.length();
s = t + '#' + s;
for (int i = 0; i < t.length(); i++) {
s += s[tlen + 1 + i % s.le... | [
"control_flow.loop.for.condition.change"
] | 770,783 | 770,782 | u587665681 | cpp |
p02962 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int slen = s.length(), tlen = t.length();
s = t + '#' + s;
for (int i = 0; i < t.length(); i++) {
s += s[i % s.length()];
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int slen = s.length(), tlen = t.length();
s = t + '#' + s;
for (int i = 0; i < t.length(); i++) {
s += s[tlen + 1 + i % s.le... | [
"assignment.change",
"control_flow.loop.for.condition.change"
] | 770,785 | 770,782 | u587665681 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | [
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 770,827 | 770,826 | u708550576 | cpp |
p02962 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include ... | [
"assignment.add"
] | 770,852 | 770,853 | u077025302 | cpp |
p02962 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.add"
] | 770,854 | 770,853 | u077025302 | cpp |
p02962 | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | [
"identifier.replace.add",
"literal.replace.remove"
] | 770,863 | 770,864 | u283869437 | cpp |
p02962 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | [
"assignment.add"
] | 770,876 | 770,875 | u750436322 | cpp |
p02962 | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 770,886 | 770,887 | u487476769 | cpp |
p02962 | #pragma GCC optimize("-O3", "unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include ... | #pragma GCC optimize("-O3", "unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.condition.change"
] | 770,900 | 770,901 | u859396346 | cpp |
p02962 | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdi... | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdi... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 770,904 | 770,905 | u708618797 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.