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 <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class Read> void in(Read &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9'... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class Read> void in(Read &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9'... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,841 | 768,842 | u591725500 | cpp |
p02959 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip> // std::std::setprecision(X)
#include <iostream>
#include <limits> //std::numeric_limits<int>::max(), min()
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unor... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip> // std::std::setprecision(X)
#include <iostream>
#include <limits> //std::numeric_limits<int>::max(), min()
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unor... | [
"variable_declaration.type.change"
] | 768,843 | 768,844 | u967843578 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR... | [
"assignment.value.change",
"identifier.change"
] | 768,847 | 768,848 | u041282550 | cpp |
p02959 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define LL long long
#define pb push_back
#define mp make_pair
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int, int> pii;
int n, ans;
int a[1000... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define int long long
#define pb push_back
#define mp make_pair
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int, int> pii;
int n, ans;
int a[100... | [
"identifier.change",
"variable_declaration.type.primitive.change"
] | 768,849 | 768,850 | u452379143 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[100009], b[100009], ans = 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 + 1; i++) {
if (i) {
int t = min(a[i], b[i - 1]);... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[100009], b[100009] = {};
long long ans = 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 + 1; i++) {
if (i) {
int t = min... | [
"variable_declaration.add"
] | 768,861 | 768,860 | u047554023 | cpp |
p02959 | #include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
templa... | #include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
templa... | [
"variable_declaration.type.change"
] | 768,862 | 768,863 | u026537738 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
std::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 ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
std::cin >> n;
vector<long int> a(n + 1);
vector<long int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
... | [
"variable_declaration.type.widen.change"
] | 768,864 | 768,865 | u452933618 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, m, n) for (int i = m; i < n; ++i)
ll solve(vector<int> A, vector<int> B, int N) {
ll res = 0;
rep(i, 0, N) {
int d = min(A[i], B[i]);
A[i] -= d;
B[i] -= d;
res += d;
d = min(A[i + 1], B[i]);
A[i] -= d;
B[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, m, n) for (int i = m; i < n; ++i)
ll solve(vector<int> A, vector<int> B, int N) {
ll res = 0;
rep(i, 0, N) {
int d = min(A[i], B[i]);
A[i] -= d;
B[i] -= d;
res += d;
d = min(A[i + 1], B[i]);
A[i + 1] -= d;
... | [
"assignment.change"
] | 768,866 | 768,867 | u756388720 | cpp |
p02959 | /*
C++
encoding: UTF-8
Modified: <27/Jul/2019 05:46:48 PM>
✪ H4WK3yE乡
Mohd. Farhan Tahir
Indian Institute Of Information Techno... | /*
C++
encoding: UTF-8
Modified: <27/Jul/2019 05:48:35 PM>
✪ H4WK3yE乡
Mohd. Farhan Tahir
Indian Institute Of Information Techno... | [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 768,868 | 768,869 | u907206514 | cpp |
p02959 | //
// Created by yuu on 2019-07-27.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[100010];
int B[100010];
int main(void) {
int N;
cin >> N;
for (... | //
// Created by yuu on 2019-07-27.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[100010];
int B[100010];
int main(void) {
int N;
cin >> N;
for (... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,872 | 768,873 | u149583407 | cpp |
p02959 | //
// Created by yuu on 2019-07-27.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[100010];
int B[100010];
int main(void) {
int N;
cin >> N;
for (... | //
// Created by yuu on 2019-07-27.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int A[100010];
int B[100010];
int main(void) {
int N;
cin >> N;
for (... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 768,874 | 768,873 | u149583407 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9, mod = 1e9 + 7;
typedef long long ll;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9')
f = (c == '-') ? -1 : 1, c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int inf = 1e9, mod = 1e9 + 7;
typedef long long ll;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9')
f = (c == '-') ? -1 : 1, c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getch... | [] | 768,875 | 768,876 | u699008937 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 1 << 29;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, Ans = 0;
cin >> N;
vector<int> A(N + 1), B(N)... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 1 << 29;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, Ans = 0;
cin >> N;
vector<ll> A(N + 1), B(N);
... | [
"variable_declaration.type.change"
] | 768,877 | 768,878 | u019356802 | cpp |
p02959 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
#define ff first
#define ss second
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
#define ff first
#define ss second
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double... | [
"variable_declaration.type.change"
] | 768,879 | 768,880 | u866482228 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i)
cin >> b[i];
ll ans = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i)
cin >> b[i];
ll ans = ... | [
"control_flow.branch.if.condition.change"
] | 768,881 | 768,882 | u113973663 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i)
cin >> b[i];
int ans =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i)
cin >> b[i];
ll ans = ... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 768,883 | 768,882 | u113973663 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
#define N 100005
using namespace std;
ll a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, s = 0, i, x;
cin >> n;
for (i = 1; i <= n + 1; ++i)
cin >> a[i];
for (i = 1; i <= n; ++i) {
cin >> x;
if (x >= a[i])
s += a[i], x... | #include <bits/stdc++.h>
#define ll long long
#define N 100005
using namespace std;
ll a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, s = 0, i, x;
cin >> n;
for (i = 1; i <= n + 1; ++i)
cin >> a[i];
for (i = 1; i <= n; ++i) {
cin >> x;
if (x >= a[i])
s += a[i], x... | [] | 768,884 | 768,885 | u130151909 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | [
"assignment.change"
] | 768,886 | 768,887 | u568652083 | cpp |
p02959 | // abc135_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | // abc135_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 768,888 | 768,889 | u614550445 | cpp |
p02959 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
t... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
t... | [
"variable_declaration.type.change"
] | 768,892 | 768,893 | u662614053 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i <= n; i++)
cin >> a[i];
vector<int> h(n);
for (int i = 0; i < n; i++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i <= n; i++)
cin >> a[i];
vector<long long> h(n);
for (int i = 0; i ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,898 | 768,899 | u933786880 | cpp |
p02959 | //
// main.cpp
// C - City Savers
//
// Created by Hashizo on 2019/07/27.
// Copyright © 2019 Hashizo. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <regex>
#include <string>
#include <vector>
using namespace std;
#undef INT_MAX
#undef INT_MIN
#define INT_MAX 2147483647
#define INT_M... | //
// main.cpp
// C - City Savers
//
// Created by Hashizo on 2019/07/27.
// Copyright © 2019 Hashizo. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <regex>
#include <string>
#include <vector>
using namespace std;
#undef INT_MAX
#undef INT_MIN
#define INT_MAX 2147483647
#define INT_M... | [
"variable_declaration.type.primitive.change"
] | 768,902 | 768,903 | u156723325 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
int main() {
cin.tie(0);
ios::sync_with... | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
int main() {
cin.tie(0);
ios::sync_with... | [] | 768,905 | 768,906 | u717501752 | 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 (auto &a : A) {
cin >> a;
}
for (auto &b : B) {
cin >> b;
}
int ans = 0;
for (int ii = 0; ii < N; ii++) {
int removed_mobs = min(A[ii], B[ii]);
ans += removed_mo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (auto &a : A) {
cin >> a;
}
for (auto &b : B) {
cin >> b;
}
long long int ans = 0;
for (int ii = 0; ii < N; ii++) {
int removed_mobs = min(A[ii], B[ii]);
ans += ... | [
"variable_declaration.type.widen.change"
] | 768,907 | 768,908 | u471342385 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
int monsterSum = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
// monsterSum += A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++)... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
long monsterSum = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
// monsterSum += A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++... | [
"variable_declaration.type.primitive.change"
] | 768,911 | 768,912 | u117345342 | 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[i];
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
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[i];
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> b[i];
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i... | [
"variable_declaration.type.widen.change"
] | 768,914 | 768,915 | u355520191 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rop(i, n) for (int i = 1; i < n + 1; i++)
using namespace std;
using std::swap;
vector<int> p;
vector<int> q;
int main() {
int N, ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rop(i, n) for (int i = 1; i < n + 1; i++)
using namespace std;
using std::swap;
vector<long long int> p;
vector<long long int> q;
in... | [
"variable_declaration.type.widen.change"
] | 768,918 | 768,919 | u196471026 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int mons_sum = A[i] + A[i + 1];
int min_val = min(mons_sum, B[i]... | #include <iostream>
using namespace std;
int main() {
long N, sum = 0;
cin >> N;
long A[N + 1], B[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
long mons_sum = A[i] + A[i + 1];
long min_val = min(mons_sum, ... | [
"variable_declaration.type.primitive.change"
] | 768,923 | 768,924 | u515328251 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A.... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 768,928 | 768,929 | u265341684 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A.... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,930 | 768,929 | u265341684 | cpp |
p02959 | #include <stdio.h>
#include <stdlib.h>
long A[100000 + 1];
long B[100000];
int main(int argc, char *argv[]) {
long N;
long i;
long sum;
scanf("%ld", &N);
for (i = 0; i < N + 1; i++) {
scanf("%ld", &A[i]);
}
for (i = 0; i < N; i++) {
scanf("%ld", &B[i]);
}
sum = 0;
for (i = 0; i < N; i++) {... | #include <stdio.h>
#include <stdlib.h>
long A[100000 + 1];
long B[100000];
int main(int argc, char *argv[]) {
long N;
long i;
long sum;
scanf("%ld", &N);
for (i = 0; i < N + 1; i++) {
scanf("%ld", &A[i]);
}
for (i = 0; i < N; i++) {
scanf("%ld", &B[i]);
}
sum = 0;
for (i = 0; i < N; i++) {... | [
"assignment.change"
] | 768,935 | 768,936 | u221652877 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll N = 1e3 + 200;
const ll INF = 0x3f3f3f;
const ll Mode = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll rst ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll N = 1e3 + 200;
const ll INF = 0x3f3f3f;
const ll Mode = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll rst ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 768,937 | 768,938 | u624688258 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
int ct = 0;
for (int k = 0; k <= n; k++) {
int dif = 0;
if (a[k] >= b[k])
ct += b[k]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
long long ct = 0;
for (int k = 0; k < n; k++) {
int dif = 0;
if (a[k] >= b[k])
ct +=... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 768,939 | 768,940 | u464527162 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
int ct = 0;
for (int k = 0; k < n; k++) {
int dif = 0;
if (a[k] >= b[k])
ct += b[k];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
long long ct = 0;
for (int k = 0; k < n; k++) {
int dif = 0;
if (a[k] >= b[k])
ct +=... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,941 | 768,940 | u464527162 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | [
"variable_declaration.type.change"
] | 768,946 | 768,947 | u687529684 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cstdlib>
#include <ctime>
#define rep(i, N) for (long i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
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 S, count =... | #include <bits/stdc++.h>
#include <cstdlib>
#include <ctime>
#define rep(i, N) for (long i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1), B(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long S, count... | [
"variable_declaration.type.primitive.change"
] | 768,948 | 768,949 | u466393447 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (auto &&s : a) {
cin >> s;
}
for (auto &&s : b) {
cin >> s;
}
ll sum = 0, diff = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) + diff < a.at(i)) {
sum += b... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (auto &&s : a) {
cin >> s;
}
for (auto &&s : b) {
cin >> s;
}
ll sum = 0, diff = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) + diff < a.at(i)) {
sum += b... | [
"assignment.change"
] | 768,950 | 768,951 | u040700157 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int a[n + 5], b[n + 5];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int a[n + 5], b[n + 5];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,952 | 768,953 | u697325966 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long result = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
result += b[i];
} els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long result = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
result += b[i];
} els... | [
"assignment.change"
] | 768,954 | 768,955 | u911147723 | 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 result = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
result += b[i];
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long result = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
result += b[i];
} els... | [
"variable_declaration.type.primitive.change",
"assignment.change"
] | 768,956 | 768,955 | u911147723 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int N;
vector<int> A, B;
int main() {
int ans = 0;
cin >> N;
A = vector<int>(N + 2);
B = vector<int>(N + 1);
for (int i = 1; i < N + 2; i++) {
cin >> A.at(i);
}
for (int i = 1; i < N + 1; i++) {
cin >> B.at(i);
}
for (int i = 1; i... | #include <iostream>
#include <vector>
using namespace std;
int N;
vector<int> A, B;
int main() {
long long ans = 0;
cin >> N;
A = vector<int>(N + 2);
B = vector<int>(N + 1);
for (int i = 1; i < N + 2; i++) {
cin >> A.at(i);
}
for (int i = 1; i < N + 1; i++) {
cin >> B.at(i);
}
for (int i ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,963 | 768,964 | u647974562 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A1(N + 1);
vector<int> B1(N);
vector<int> A2(N + 1);
vector<int> B2(N);
int sum = 0;
int max = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A1.at(i);
A2.at(i) = A1.at(i);
}
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A1(N + 1);
vector<int> B1(N);
vector<int> A2(N + 1);
vector<int> B2(N);
int64_t sum = 0;
int64_t max = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A1.at(i);
A2.at(i) = A1.at(i);
}
for (int i = 0; i < N... | [
"variable_declaration.type.primitive.change"
] | 768,968 | 768,969 | u596200441 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A;
vector<int> B;
int solve(int as, int ae) {
if (as >= ae)
return 0;
int sum = 0;
int ds = min(A[as], B[as]);
A[as] -= ds;
B[as] -= ds;
sum += ds;
int de = min(A[ae], B[ae - 1]);
A[ae] -= de;
B[ae - 1] -= de;
sum += de;
ds = mi... | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A;
vector<int> B;
long solve(int as, int ae) {
if (as >= ae)
return 0;
long sum = 0;
int ds = min(A[as], B[as]);
A[as] -= ds;
B[as] -= ds;
sum += ds;
int de = min(A[ae], B[ae - 1]);
A[ae] -= de;
B[ae - 1] -= de;
sum += de;
ds = ... | [
"variable_declaration.type.primitive.change"
] | 768,973 | 768,974 | u269291896 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A;
vector<int> B;
int solve(int as, int ae) {
if (as >= ae)
return 0;
int sum = 0;
int ds = min(A[as], B[as]);
A[as] -= ds;
B[as] -= ds;
sum += ds;
int de = min(A[ae], B[ae - 1]);
A[ae] -= de;
B[ae - 1] -= de;
sum += de;
ds = mi... | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A;
vector<int> B;
long solve(int as, int ae) {
if (as >= ae)
return 0;
long sum = 0;
int ds = min(A[as], B[as]);
A[as] -= ds;
B[as] -= ds;
sum += ds;
int de = min(A[ae], B[ae - 1]);
A[ae] -= de;
B[ae - 1] -= de;
sum += de;
ds = ... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change"
] | 768,975 | 768,974 | u269291896 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> town;
vector<int> hunter;
for (int i = 0; i < n + 1; i++) {
int num;
cin >> num;
town.push_back(num);
}
for (int i = 0; i < n; i++) {
int num;
cin >> num;
hunter.push_back(num);
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> town;
vector<int> hunter;
for (int i = 0; i < n + 1; i++) {
int num;
cin >> num;
town.push_back(num);
}
for (int i = 0; i < n; i++) {
int num;
cin >> num;
hunter.push_back(num);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,981 | 768,982 | u509420256 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100000], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100005], b[100005];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 768,985 | 768,984 | u744950774 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100000], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt + a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100005], b[100005];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string... | 768,986 | 768,984 | u744950774 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[100000], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt = cnt... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long a[100005], b[100005];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
cnt... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 768,985 | 768,987 | u744950774 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int ar[1000];
int br[1000];
int main() {
ll n, ans = 0, res = 0, i;
cin >> n;
for (i = 0; i <= n; i++)
cin >> ar[i];
for (i = 0; i < n; i++)
cin >> br[i];
for (i = 0; i < n; i++) {
if (ar[i] >= br[i])
ans = ans + br[i];
e... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int ar[1000008];
int br[1000008];
int main() {
ll n, ans = 0, res = 0, i;
cin >> n;
for (i = 0; i <= n; i++)
cin >> ar[i];
for (i = 0; i < n; i++)
cin >> br[i];
for (i = 0; i < n; i++) {
if (ar[i] >= br[i])
ans = ans + br[i];... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,994 | 768,995 | u279604464 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int j = 0; j < N; j++) {
cin >> B.at(j);
}
int ans = 0;
for (int k = 0; k < N; k++) {
ans += min(A.at(k), B.at(k));
if (A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int j = 0; j < N; j++) {
cin >> B.at(j);
}
long long int ans = 0;
for (int k = 0; k < N; k++) {
ans += min(A.at(k), B.at(k));... | [
"variable_declaration.type.widen.change"
] | 769,000 | 769,001 | u521975232 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
vector<long long> A(N + 1);
for (long i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (long k = 0; k < N; k++) {
cin >> B.at(k);
}
B.emplace_back(0);
long long next = 0;
long long count = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
vector<long long> A(N + 1);
for (long i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<long long> B(N);
for (long k = 0; k < N; k++) {
cin >> B.at(k);
}
B.emplace_back(0);
long long next = 0;
long long count = ... | [
"assignment.add"
] | 769,002 | 769,003 | u834239089 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, i;
long long m = 0;
cin >> N;
long long a[N + 1];
long long b[N];
for (i = 0; i < N + 1; i++)
cin >> a[i];
for (i = 0; i < N; i++)
cin >> b[i];
for (i = 0; i < N; i++) {
if (b[i] <= a[i])
m += b[i];
el... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, i;
long long m = 0;
cin >> N;
long long a[N + 1];
long long b[N];
for (i = 0; i < N + 1; i++)
cin >> a[i];
for (i = 0; i < N; i++)
cin >> b[i];
for (i = 0; i < N; i++) {
if (b[i] <= a[i])
m += b[i];
el... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 769,004 | 769,005 | u573540112 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 2, 0);
vector<int> b(N + 1, 0);
for (int i = 1; i < N + 2; i++) {
cin >> a.at(i);
}
for (int i = 1; i < N + 1; i++) {
cin >> b.at(i);
}
vector<int> c(N + 2, 0);
for (int i = 1; i < N + 1; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 2, 0);
vector<int> b(N + 1, 0);
for (int i = 1; i < N + 2; i++) {
cin >> a.at(i);
}
for (int i = 1; i < N + 1; i++) {
cin >> b.at(i);
}
vector<long long int> c(N + 2, 0);
for (int i = 1; i < N +... | [
"variable_declaration.type.widen.change"
] | 769,008 | 769,009 | u628597699 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | [
"variable_declaration.type.change"
] | 769,012 | 769,013 | u395846213 | cpp |
p02959 | #include <cstdio>
#include <iostream>
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 num = 0;
int rem_ai = 0;
int rem_b = 0;
for (int i = 0; i < n; ++i) {
if (rem_b <= a[i]) {
... | #include <cstdio>
#include <iostream>
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 num = 0;
int rem_ai = 0;
int rem_b = 0;
for (int i = 0; i < n; ++i) {
if (rem_b <= a[i]) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,016 | 769,017 | u524328258 | cpp |
p02959 | #include <cstdio>
#include <iostream>
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 num = 0;
int rem_ai = 0;
int rem_b = 0;
for (int i = 0; i < n; ++i) {
if (rem_b <= a[i]) {
... | #include <cstdio>
#include <iostream>
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 num = 0;
int rem_ai = 0;
int rem_b = 0;
for (int i = 0; i < n; ++i) {
if (rem_b <= a[i]) {
... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,018 | 769,017 | u524328258 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int m, n, cnt = 0, rem;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
cnt += a[i];
rem = ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int m, n, cnt = 0, rem;
cin >> n;
long long int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
cnt +... | [
"variable_declaration.type.widen.change"
] | 769,019 | 769,020 | u075389978 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(100005);
vector<int> B(100005);
for (int i = 1; i <= n + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= n; i++) {
cin >> B[i];
}
int cnt = 0;
for (int i = n; i >= 1; i--) {
// B[i]がA[i+1]以上
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(100005);
vector<long long> B(100005);
for (int i = 1; i <= n + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= n; i++) {
cin >> B[i];
}
long long cnt = 0;
for (int i = n; i >= 1; i--) {
// B[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,032 | 769,033 | u399232305 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int mini(int a, int b) {
if (a <= b)
return a;
else
return b;
}
int main() {
int i, j, n, x, total_hero = 0, total_mons = 0, final_hero = 0, choto = 0;
cin >> n;
vector<int> mons;
vector<int> hero;
for (i = 0; i < n + 1; i++) {
cin >> x;
mo... | #include <bits/stdc++.h>
using namespace std;
long long mini(int a, int b) {
if (a <= b)
return a;
else
return b;
}
int main() {
long long i, j, n, x, total_hero = 0, total_mons = 0, final_hero = 0,
choto = 0;
cin >> n;
vector<int> mons;
vector<int> hero;
for (i = 0; i ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,034 | 769,035 | u615084357 | cpp |
p02959 | #include <stdio.h>
int n;
int a[100010];
int b[100010];
int l;
int r;
int count;
int main(void) {
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]);
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
count += a[i... | #include <stdio.h>
int n;
int a[100010];
int b[100010];
int l;
int r;
long long count;
int main(void) {
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]);
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
count ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,036 | 769,037 | u422066699 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
long long N;
long long A[100001];
long long B[100000];
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 x = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
x += A[i];
... | #include <iostream>
using namespace std;
int main() {
long long N;
long long A[100001];
long long B[100000];
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 x = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
x += A[i];
... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 769,040 | 769,041 | u721980697 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, count;
cin >> n;
count = 0;
int a[100100];
int b[100100];
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 <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
long long int count;
cin >> n;
count = 0;
int a[100100];
int b[100100];
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... | [
"variable_declaration.type.widen.change"
] | 769,046 | 769,045 | u817464145 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long a[200000 + 5];
long long b[200000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
cin >> a[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
if (b[i] < a[i]) {
if ((b[i] + b... | #include <bits/stdc++.h>
using namespace std;
long long a[200000 + 5];
long long b[200000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
cin >> a[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
if (b[i] < a[i]) {
if ((b[i] + b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 769,047 | 769,048 | u191117799 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long a[20000 + 5];
long long b[20000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
cin >> a[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
if (b[i] < a[i]) {
if ((b[i] + b[i... | #include <bits/stdc++.h>
using namespace std;
long long a[200000 + 5];
long long b[200000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
cin >> a[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
if (b[i] < a[i]) {
if ((b[i] + b... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 769,050 | 769,048 | u191117799 | cpp |
p02959 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[10005], b[10005], sum;
signed main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 1; i <= n; i++) {
if (b[i] < a[i]) {
a[i] -= b[i], sum += b[i];
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[100005], b[100005], sum;
signed main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 1; i <= n; i++) {
if (b[i] < a[i]) {
a[i] -= b[i], sum += b[i];
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 769,057 | 769,058 | u924638591 | cpp |
p02959 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author edamat
*/
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#defi... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author edamat
*/
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#defi... | [] | 769,065 | 769,066 | u379629675 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<double> monster;
vector<double> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
double mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
double kill;
cin >> kill;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<long> monster;
vector<long> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
long mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
long kill;
cin >> kill;
hero_ab.... | [
"variable_declaration.type.primitive.change"
] | 769,069 | 769,070 | u818286983 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> monster;
vector<int> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
int mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
int kill;
cin >> kill;
hero_ab.push... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<long> monster;
vector<long> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
long mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
long kill;
cin >> kill;
hero_ab.... | [
"variable_declaration.type.primitive.change"
] | 769,071 | 769,070 | u818286983 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> monster;
vector<int> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
int mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
int kill;
cin >> kill;
hero_ab.push... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<long> monster;
vector<long> hero_ab;
cin >> n;
for (int i = 0; i < n + 1; i++) {
long mon;
cin >> mon;
monster.push_back(mon);
}
for (int i = 0; i < n; i++) {
long kill;
cin >> kill;
hero_ab.... | [
"variable_declaration.type.primitive.change"
] | 769,072 | 769,070 | u818286983 | cpp |
p02959 | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100005], b[100004];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1... | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100005], b[100004];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,073 | 769,074 | u828994140 | cpp |
p02959 | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100001], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1... | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100005], b[100004];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,075 | 769,074 | u828994140 | cpp |
p02959 | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n, a[100001], b[100000];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] < b[i... | #include "algorithm"
#include "iostream"
#include "string"
using namespace std;
int main() {
int n;
long a[100005], b[100004];
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change"
] | 769,076 | 769,074 | u828994140 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long int ll;
const int MAX_N = 100000;
ll foo(ll *a, ll *b) {
ll ret;
if (*a < *b) {
ret += *a;
*b -= *a;
*a = 0;
} else {
ret += *b;
*a -= *b;
*b = 0;
}
return ret;
}
int main() {
int n;
ll a[MAX_N + 1], b[MAX_N];
cin >>... | #include <iostream>
using namespace std;
typedef long long int ll;
const int MAX_N = 100000;
ll foo(ll *a, ll *b) {
ll ret;
if (*a < *b) {
ret = *a;
*b -= *a;
*a = 0;
} else {
ret = *b;
*a -= *b;
*b = 0;
}
return ret;
}
int main() {
int n;
ll a[MAX_N + 1], b[MAX_N];
cin >> n... | [
"assignment.value.change"
] | 769,077 | 769,078 | u280590671 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
ll n;
... | [
"variable_declaration.type.change"
] | 769,079 | 769,080 | u110681742 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"expression.operation.binary.change"
] | 769,081 | 769,082 | u364018936 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int add = min(a[i], b[i]);
a[i] -= add;
b[i] -= add... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
signed 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];
}
signed long ans = 0;
for (int i = 0; i < n; i++) {
int add = min(a[i], b[i]);
a[i] -= add;
... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 769,089 | 769,090 | u190679129 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define all(a) (a).begin(), (a).end()
int main() {
int n, count = 0;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
if (tmp < a.at(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define all(a) (a).begin(), (a).end()
int main() {
long n, count = 0;
cin >> n;
vector<long> a(n + 1);
for (long i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (long i = 0; i < n; i++) {
long tmp;
cin >> tmp;
if (tmp < ... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 769,091 | 769,092 | u864026794 | cpp |
p02959 | #include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
int mLeft = 0;
int ans = 0;
cin >> N;
int A[N + 1];
int B[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i ... | #include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N;
ll mLeft = 0;
ll ans = 0;
cin >> N;
ll A[N + 1];
ll B[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; ... | [
"variable_declaration.type.change"
] | 769,093 | 769,094 | u332258971 | cpp |
p02959 | #include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
int main() {
int64_t N;
std::cin >> N;
std::cin.ignore();
int nA = N + 1;
std::vector<int64_t> A;
A.reserve(N + 1);
while (nA-- > 0) {
int64_t a;
std::cin >> a;
A.push_back(a);
}
int nB = N;
std::vector<int64_t> B... | #include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
int main() {
int64_t N;
std::cin >> N;
std::cin.ignore();
int nA = N + 1;
std::vector<int64_t> A;
A.reserve(N + 1);
while (nA-- > 0) {
int64_t a;
std::cin >> a;
A.push_back(a);
}
int nB = N;
std::vector<int64_t> B... | [
"expression.operator.change"
] | 769,097 | 769,098 | u317230226 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, b, sum = 0, vec;
vector<long long> a;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> vec;
a.push_back(vec);
}
for (int i = 0; i < n; i++) {
cin >> b;
if (b - a[i] < 0) {
sum += b;
b = 0;
} else {
s... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, vec;
long long b, sum = 0;
vector<long long> a;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> vec;
a.push_back(vec);
}
for (int i = 0; i < n; i++) {
cin >> b;
if (b - a[i] < 0) {
sum += b;
b = 0;
} el... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 769,103 | 769,104 | u132033278 | cpp |
p02959 | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
... | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
... | [
"variable_declaration.type.change"
] | 769,105 | 769,106 | u422769833 | cpp |
p02959 | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
... | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
... | [
"variable_declaration.type.change",
"variable_declaration.add"
] | 769,107 | 769,106 | u422769833 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | [
"variable_declaration.type.change"
] | 769,111 | 769,112 | u598755311 | cpp |
p02959 | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) ... | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) ... | [
"assignment.change"
] | 769,115 | 769,116 | u055148700 | cpp |
p02960 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [] | 769,141 | 769,142 | u264265458 | cpp |
p02960 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [] | 769,143 | 769,144 | u264265458 | cpp |
p02960 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 769,145 | 769,144 | u264265458 | cpp |
p02960 | #include <bits/stdc++.h>
#include <cmath>
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;
}
const long long INFLL = 1LL << 60;
const ... | #include <bits/stdc++.h>
#include <cmath>
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;
}
const long long INFLL = 1LL << 60;
const ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 769,150 | 769,151 | u179778090 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 1e9 + 7;
const double EPS = 1e-9;
const int n = 13;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
retur... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 1e9 + 7;
const double EPS = 1e-9;
const int n = 13;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
retur... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 769,156 | 769,157 | u940569542 | cpp |
p02960 | // Gracias, Rodolfo
// Gracias, MarcosK
// Gracias, Graphter
// Obrigado, Dilson
//#pragma GCC optimize ("Ofast,unroll-loops")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define fastio ... | // Gracias, Rodolfo
// Gracias, MarcosK
// Gracias, Graphter
// Obrigado, Dilson
//#pragma GCC optimize ("Ofast,unroll-loops")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define fastio ... | [
"literal.number.change",
"variable_declaration.value.change",
"literal.number.type.widen.change"
] | 769,158 | 769,159 | u371012206 | cpp |
p02960 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#includ... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#includ... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 769,170 | 769,171 | u845000384 | cpp |
p02960 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
const int MOD = 1e9 + 7;
ll dp[100100][13];
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
rep(i, 100100) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?')... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
const int MOD = 1e9 + 7;
ll dp[100100][13];
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
rep(i, 100100) rep(j, 13) dp[i][j] = 0;
if (s[0] == '?')... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 769,176 | 769,177 | u840810569 | cpp |
p02960 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int n_digits = s.size();
vector<vector<long long>> dp(n_digits + 1, vector<long long>(13, 0));
dp[0][0] = 1; // 0 (mod 13) \equiv 0
long long digit = 1;
for (int i =... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int n_digits = s.size();
vector<vector<long long>> dp(n_digits + 1, vector<long long>(13, 0));
dp[0][0] = 1; // 0 (mod 13) \equiv 0
long long digit = 1;
for (int i =... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,180 | 769,181 | u886790158 | cpp |
p02960 | #include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int N = 13;
const int MOD = 1e9 + 7;
const int REM = 5;
int main() {
string s;
cin >> s;
int n_digits = s.size();
vector<vector<long>> dp(n_digits + 1, vector<... | #include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int N = 13;
const int MOD = 1e9 + 7;
const int REM = 5;
int main() {
string s;
cin >> s;
int n_digits = s.size();
vector<vector<long>> dp(n_digits + 1, vector<... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 769,182 | 769,183 | u886790158 | cpp |
p02960 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"literal.number.change",
"call.arguments.change"
] | 769,194 | 769,195 | u526630579 | cpp |
p02960 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
const long long MOD_CONST = 1000000007;
using namespace std;
int main() {
string s;
cin >> s;
int len = s.length();
vector<vector<long long>> dp(len + 1, vector<long long>(13));
d... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
const long long MOD_CONST = 1000000007;
using namespace std;
int main() {
string s;
cin >> s;
int len = s.length();
vector<vector<long long>> dp(len + 1, vector<long long>(13));
d... | [
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 769,196 | 769,197 | u156778176 | cpp |
p02960 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数 ==============... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数 ==============... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 769,200 | 769,201 | u433195318 | cpp |
p02960 | #include "bits/stdc++.h"
using namespace std;
using lint = long long;
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (lint i = 0; i < lint(n); ++i)
#define Rep(i, n) for (lint i = lint(n); i >= 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define cend printf("\n");
#define prique(T) priori... | #include "bits/stdc++.h"
using namespace std;
using lint = long long;
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (lint i = 0; i < lint(n); ++i)
#define Rep(i, n) for (lint i = lint(n); i >= 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define cend printf("\n");
#define prique(T) priori... | [
"literal.number.change",
"call.arguments.change"
] | 769,206 | 769,207 | u054475353 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 769,214 | 769,215 | u106297876 | cpp |
p02960 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | [
"variable_declaration.type.change"
] | 769,229 | 769,230 | u255001744 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.