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 |
|---|---|---|---|---|---|---|---|
p03000 | #include <iostream>
using namespace std;
int main(void) {
int N, X;
int res = 1;
cin >> N >> X;
int L[100];
int D[100] = {0};
for (int i = 0; i < N; i++) {
cin >> L[i];
D[i + 1] = D[i] + L[i];
if (D[i + 1] <= X) {
++res;
cout << res << endl;
}
}
} | #include <iostream>
using namespace std;
int main(void) {
int N, X;
int res = 1;
cin >> N >> X;
int L[100];
int D[100] = {0};
for (int i = 0; i < N; i++) {
cin >> L[i];
D[i + 1] = D[i] + L[i];
if (D[i + 1] <= X) {
++res;
}
}
cout << res << endl;
}
| [] | 813,059 | 813,060 | u698598617 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, X;
cin >> N >> X;
vector<ll> L(N);
L[0] = 0;
for (ll i = 1; i < N; i++)
cin >> L[i];
ll cnt = 0, position = 0;
for (ll i = 0; i < N; i++) {
position += L[i];
if (position <= X)
cnt++;
}
cout << cnt... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, X;
cin >> N >> X;
vector<ll> L(N + 1);
L[0] = 0;
for (ll i = 1; i <= N; i++)
cin >> L[i];
ll cnt = 0, position = 0;
for (ll i = 0; i <= N; i++) {
position += L[i];
if (position <= X)
cnt++;
}
cout ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,069 | 813,070 | u530497183 | cpp |
p03000 | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s... | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.add"
] | 813,090 | 813,091 | u375267383 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L.at(0) = 0;
for (int i = 1; i < N + 1; i++) {
cin >> L.at(i);
}
int count = 0;
int sumD = 0;
for (int j = 1; j < N + 1; j++) {
count++;
sumD += L.at(j);
if (sumD > X) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L.at(0) = 0;
for (int i = 1; i < N + 1; i++) {
cin >> L.at(i);
}
int count = 0;
int sumD = 0;
for (int j = 1; j < N + 1; j++) {
count++;
sumD += L.at(j);
if (sumD > X) {
... | [
"expression.unary.arithmetic.add"
] | 813,092 | 813,093 | u802997491 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, k, sum = 0, ans = 1;
cin >> n >> x;
for (int i = 1; i < n; i++) {
cin >> k;
sum += k;
if (sum <= x)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, k, sum = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> k;
sum += k;
if (sum <= x)
ans++;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 813,100 | 813,101 | u396071074 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
D = D + L[i];
if (D > X) {
ans = i + 1;
break;
}
}
cout << (ans == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
D = D + L[i];
if (D > X) {
ans = i + 1;
break;
}
}
cout << (ans == ... | [
"expression.operation.binary.add"
] | 813,110 | 813,111 | u945359338 | cpp |
p03000 | #include <iostream>
int main(void) {
int N;
int X;
int L;
int D = 0;
int count = 0;
std::cin >> N >> X;
while ((count < N) && (D <= X)) {
count++;
std::cin >> L;
D += L;
}
std::cout << count;
return 0;
}
| #include <iostream>
int main(void) {
int N;
int X;
int L;
int D = 0;
int count = 0;
std::cin >> N >> X;
while ((count <= N) && (D <= X)) {
count++;
std::cin >> L;
D += L;
}
std::cout << count;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 813,112 | 813,113 | u459819918 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
int count = 1;
vector<int> D(N + 1);
for (int j = 1; j < N + 1; j++) {
D.at(j) = D.at(j - 1) + L.at(j - 1);
if (D.at(j) < X) {
count+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
int count = 1;
vector<int> D(N + 1);
for (int j = 1; j < N + 1; j++) {
D.at(j) = D.at(j - 1) + L.at(j - 1);
if (D.at(j) <= X) {
count... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,114 | 813,115 | u521975232 | cpp |
p03000 | #include <stdio.h>
int main(void) {
int n, x, i;
int j = 0;
scanf("%d %d", &n, &x);
int l[n], r[n + 1];
r[0] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
r[i + 1] = r[i] + l[i];
}
for (i = 0; i <= n; i++) {
if (x >= r[i]) {
j + j + 1;
}
}
printf("%d", j);
} | #include <stdio.h>
int main(void) {
int n, x, i;
int j = 0;
scanf("%d %d", &n, &x);
int l[n], r[n + 1];
r[0] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
r[i + 1] = r[i] + l[i];
}
for (i = 0; i <= n; i++) {
if (x >= r[i]) {
j = j + 1;
}
}
printf("%d", j);
}
| [
"expression.operation.binary.change"
] | 813,118 | 813,119 | u222643545 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
using namespace std;
signed main() {
int a, n, x;
cin >> n >> x;
int ans = 1, m = 0;
for (int i = 0; i < n; i++) {
cin >> a;
m += a;
ans += (m <= a);
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
using namespace std;
signed main() {
int a, n, x;
cin >> n >> x;
int ans = 1, m = 0;
for (int i = 0; i < n; i++) {
cin >> a;
m += a;
ans += (m <= x);
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 813,122 | 813,123 | u141968173 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 813,124 | 813,125 | u337775536 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int... | [
"identifier.change",
"io.output.change"
] | 813,128 | 813,129 | u981890679 | cpp |
p03000 | /**
AUTHOR:Jun_SH
TIME:2019/6/16
PROBLEM:ABC130_b
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll l[105];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, x;
cin >> n >> x;
for (ll i = 1; i <= n; ++i) {
cin >> l[i];
}
ll sum = 0;
ll ans... | /**
AUTHOR:Jun_SH
TIME:2019/6/16
PROBLEM:ABC130_b
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll l[105];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, x;
cin >> n >> x;
for (ll i = 1; i <= n; ++i) {
cin >> l[i];
}
ll sum = 0;
ll ans... | [
"control_flow.loop.condition.change"
] | 813,130 | 813,131 | u976418120 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t < m)
cout << n << endl;
else
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t <= m)
cout << n + 1 << endl;
else
cou... | [
"expression.operator.compare.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"
] | 813,140 | 813,141 | u573035837 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t > m)
cout << n - 1 << endl;
else
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t <= m)
cout << n + 1 << endl;
else
cou... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 813,142 | 813,141 | u573035837 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t > m)
cout << n << endl;
else
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t <= m)
cout << n + 1 << endl;
else
cou... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 813,143 | 813,141 | u573035837 | cpp |
p03000 | #include <iostream>
using namespace std;
int n, sum, x, v, nr;
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> v;
sum += v;
if (sum <= x)
nr++;
else
break;
}
cout << nr;
} | #include <iostream>
using namespace std;
int n, sum, x, v, nr;
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> v;
sum += v;
if (sum <= x)
nr++;
else
break;
}
cout << nr + 1;
}
| [
"expression.operation.binary.add"
] | 813,144 | 813,145 | u620278296 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
vector<int> d(n);
for (int j = 0; j < n; j++) {
d.at(j + 1) = d.at(j) + l.at(j);
}
int y = 0;
for (int k = 0; k < n; k++) {
if (d.at(k) <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
vector<int> d(n + 1);
for (int j = 0; j < n; j++) {
d.at(j + 1) = d.at(j) + l.at(j);
}
int y = 0;
for (int k = 0; k < n + 1; k++) {
if (d... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,146 | 813,147 | u072080927 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 1;
int D = 0;
L[1000] = {};
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i <= N; i++) {
D += L[i];
if (D > X)
break;
count++;
}
cout << count << endl;
return ... | #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 1;
int D = 0;
L[1000] = {};
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
D += L[i];
if (D > X)
break;
count++;
}
cout << count << endl;
return 0... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,148 | 813,149 | u217799598 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 0;
int D = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
D += L[i];
count++;
if (D > X)
break;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 0;
int D = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i <= N; i++) {
D += L[i];
count++;
if (D > X)
break;
}
cout << count << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,150 | 813,151 | u217799598 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[101];
int count = 0;
int a = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
a += L[i];
count++;
if (a < X)
break;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 0;
int D = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i <= N; i++) {
D += L[i];
count++;
if (D > X)
break;
}
cout << count << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.name.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.variable.change... | 813,153 | 813,151 | u217799598 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define MOD 1000000009
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s; i <= e; i++)
#define LLI long long int
#define chmax(a, b) a = max(a, b)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define MOD 1000000009
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s; i <= e; i++)
#define LLI long long int
#define chmax(a, b) a = max(a, b)
#defin... | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,166 | 813,167 | u840105874 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) FOR(i, 0, b)
#define INF mugen
#define dump(x) cerr << #x << "=" << x << endl
#define ALL(a) (a).begin(), (a).end()
#define EACH(e, v) for (auto &e : v)
#define SORT(v) sort(ALL(v))
#define PERM(v) ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) FOR(i, 0, b)
#define INF mugen
#define dump(x) cerr << #x << "=" << x << endl
#define ALL(a) (a).begin(), (a).end()
#define EACH(e, v) for (auto &e : v)
#define SORT(v) sort(ALL(v))
#define PERM(v) ... | [
"expression.operation.binary.add"
] | 813,170 | 813,171 | u373844230 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int N, X;
vector<int> L;
int main() {
cin >> N >> X;
L.resize(N);
for (int i = 0; i < N; i++)
scanf("%d", &L[i]);
int ans = 1;
for (int i = 0; i < N; i++) {
X -= L[i];
if (X <= 0)
break;
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, X;
vector<int> L;
int main() {
cin >> N >> X;
L.resize(N);
for (int i = 0; i < N; i++)
scanf("%d", &L[i]);
int ans = 1;
for (int i = 0; i < N; i++) {
X -= L[i];
if (X < 0)
break;
ans++;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,186 | 813,187 | u877476774 | cpp |
p03000 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,188 | 813,189 | u284124505 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
int L[N + 1];
L[0] = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> L[i + 1];
}
for (int i = 1; i < N + 1; i++) {
L[i] += L[i - 1];
if (L[i] <= X) {
ans++;
}
}
cout << an... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
int L[N + 1];
L[0] = 0;
int ans = 1;
for (int i = 0; i < N; i++) {
cin >> L[i + 1];
}
for (int i = 1; i < N + 1; i++) {
L[i] += L[i - 1];
if (L[i] <= X) {
ans++;
}
}
cout << an... | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,190 | 813,191 | u359856428 | cpp |
p03000 | /// ..:: In The Name Of God ::..
#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 endl '??/n'
#define INF 2e9
#define int ll
#define vi vector<int>
#define vii vector<pii>
#defi... | /// ..:: In The Name Of God ::..
#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 endl '\n'
#define INF 2e9
#define int ll
#define vi vector<int>
#define vii vector<pii>
#define... | [
"preprocessor.define.value.change"
] | 813,196 | 813,197 | u809816772 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, X;
cin >> N >> X;
vector<int> L;
for (int i = 0; i < N; i++) {
int inp;
cin >> inp;
L.push_back(inp);
}
vector<int> D;
D.push_back(0);
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, X;
cin >> N >> X;
vector<int> L;
for (int i = 0; i < N; i++) {
int inp;
cin >> inp;
L.push_back(inp);
}
vector<int> D;
D.push_back(0);
for (int i = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,206 | 813,207 | u412960991 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0, count = 0;
while (d <= x && count < n) {
d += l[count++];
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0, count = 0;
while (d <= x && count <= n) {
d += l[count++];
}
cout << count << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 813,208 | 813,209 | u781762706 | cpp |
p03000 | #include <bits/stdc++.h>
#define int long long
#define pb emplace_back
#define mp make_pair
#define mt make_tuple
#define all(v) v.begin(), v.end()
#define rep(i, start, lim) for (long long(i) = (start); i < (lim); i++)
#define revrep(i, n) for (long long i = n - 1; i >= 0; i--)
#define boost ... | #include <bits/stdc++.h>
#define int long long
#define pb emplace_back
#define mp make_pair
#define mt make_tuple
#define all(v) v.begin(), v.end()
#define rep(i, start, lim) for (long long(i) = (start); i < (lim); i++)
#define revrep(i, n) for (long long i = n - 1; i >= 0; i--)
#define boost ... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 813,210 | 813,211 | u606350691 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i;
cin >> n >> x;
int arr[n];
for (i = 0; i < n; i++)
cin >> arr[i];
int d1 = 0, op = 0;
while (d1 <= x && i <= n) {
op++;
d1 = d1 + arr[i];
i++;
}
cout << op;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i;
cin >> n >> x;
int arr[n];
for (i = 0; i < n; i++)
cin >> arr[i];
int d1 = 0, op = 0;
i = 0;
while (d1 <= x && i <= n) {
op++;
d1 = d1 + arr[i];
i++;
}
cout << op;
return 0;
} | [
"assignment.add"
] | 813,221 | 813,222 | u549517003 | cpp |
p03000 | #include <iostream>
using namespace std;
const int Max = 1e6;
int main() {
int n, x, L[Max], D[Max], cnt = 1;
cin >> n >> x;
D[1] = 0;
for (int i = 1; i <= n; ++i)
cin >> L[i];
for (int i = 2; i <= n; ++i) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
++cnt;
}
cout << cnt;
return 0;
... | #include <iostream>
using namespace std;
const int Max = 1e6;
int main() {
int n, x, L[Max], D[Max], cnt = 1;
cin >> n >> x;
D[1] = 0;
for (int i = 1; i <= n; ++i)
cin >> L[i];
for (int i = 2; i <= n + 1; ++i) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
++cnt;
}
cout << cnt;
return... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,225 | 813,226 | u992218377 | cpp |
p03000 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, x, arr[100], pos = 0;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
pos += arr[i];
if (pos > x)
return cout... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, x, arr[100], pos = 0;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
pos += arr[i];
if (pos > x)
return cout... | [
"expression.operation.binary.add"
] | 813,227 | 813,228 | u769237842 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x, y;
cin >> n >> x;
vector<int> v(n + 1);
v[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> y;
v[i] = v[i - 1] + y;
}
int ans = 0;
for (auto u : v) {
if (u < x) {
++ans;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x, y;
cin >> n >> x;
vector<int> v(n + 1);
v[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> y;
v[i] = v[i - 1] + y;
}
int ans = 0;
for (auto u : v) {
if (u <= x) {
++ans;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,231 | 813,232 | u256901785 | cpp |
p03000 | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll a, b;
cin >> a >> b;
ll ans(0);
ll k, cnt(0);
while (a--) {
cin >> k;
if (ans <= b)
cnt++;
ans += k;
}
if (ans < b)
cnt++;
cout << cnt << endl;
}
| #include <iostream>
using namespace std;
#define ll long long
int main() {
ll a, b;
cin >> a >> b;
ll ans(0);
ll k, cnt(0);
while (a--) {
cin >> k;
if (ans <= b)
cnt++;
ans += k;
}
if (ans <= b)
cnt++;
cout << cnt << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,233 | 813,234 | u982650258 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
int L[100];
for (int i = 0; i < N; i++)
cin >> L[i];
int D[101], ans = 0;
D[0] = 0;
ans++;
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X)
ans++;
els... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
int L[100];
for (int i = 0; i < N; i++)
cin >> L[i];
int D[101], ans = 0;
D[0] = 0;
ans++;
for (int i = 1; i <= N; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X)
ans++;
el... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,235 | 813,236 | u960997735 | cpp |
p03000 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int N, X, L[101], D = 0, counter = 1;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 2; i < N + 1; i++) {
D += L[i - 1];
if (D <= X)
counter++;
}
cout << counter << endl;
return 0;
}
| #include <iostream>
#include <string.h>
using namespace std;
int main() {
int N, X, L[101], D = 0, counter = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 1; i < N + 1; i++) {
D += L[i - 1];
if (D <= X)
counter++;
}
cout << counter + 1 << endl;
return 0;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 813,237 | 813,238 | u573083749 | cpp |
p03000 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, x, tmp, ans, cur;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> x;
for (int i = 0; i < n; i++) ... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, x, tmp, ans, cur;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> x;
for (int i = 0; i < n; i++) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,243 | 813,244 | u398025421 | cpp |
p03000 | /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB ... | /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB ... | [
"expression.operation.binary.add"
] | 813,249 | 813,250 | u904221771 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include... | [
"assignment.change",
"expression.operation.binary.add"
] | 813,251 | 813,252 | u535107169 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,259 | 813,260 | u784072785 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
const int N = 11... | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
const int N = 11... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,264 | 813,265 | u855248478 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
// 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, X;
cin >> N >> X;
vector<int> L(N);
vector<int> D(N, 0);
REP(i, N) cin >> ... | #include <bits/stdc++.h>
using namespace std;
// 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, X;
cin >> N >> X;
vector<int> L(N);
vector<int> D(N, 0);
REP(i, N) cin >> ... | [
"expression.operation.binary.add"
] | 813,266 | 813,267 | u594140666 | cpp |
p03000 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | [
"identifier.change",
"io.output.change"
] | 813,272 | 813,273 | u502721867 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[101] = {};
int ball[101] = {};
for (int i = 0; i < N; i++) {
cin >> L[i];
ball[i + 1] = ball[i] ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[101] = {};
int ball[101] = {};
for (int i = 0; i < N; i++) {
cin >> L[i];
ball[i + 1] = ball[i] ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,274 | 813,275 | u451206510 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[100] = {};
int ball[100] = {};
for (int i = 0; i < N; i++) {
cin >> L[i];
ball[i + 1] = ball[i] ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[101] = {};
int ball[101] = {};
for (int i = 0; i < N; i++) {
cin >> L[i];
ball[i + 1] = ball[i] ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,276 | 813,275 | u451206510 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,288 | 813,289 | u342051078 | cpp |
p03000 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,290 | 813,291 | u229842440 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 1, now = 0, a;
for (int i = 0; i < N; i++) {
cin >> a;
if (X >= a + now) {
count++;
now += a;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 1, now = 0, a;
for (int i = 0; i < N; i++) {
cin >> a;
if (X >= a + now) {
count++;
now += a;
} else
break;
}
cout << count << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 813,294 | 813,295 | u239087789 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const ll dx[] = {1, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const ll dx[] = {1, ... | [
"control_flow.branch.else.add"
] | 813,296 | 813,297 | u666721654 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, x, point = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i != n; i++)
cin >> l[i];
for (int i = 0; i != n; i++) {
point += l[i];
if (point > x) {
cout << i + 1 <<... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, x, point = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i != n; i++)
cin >> l[i];
for (int i = 0; i != n; i++) {
point += l[i];
if (point > x) {
cout << i + 1 <<... | [
"expression.operation.binary.add"
] | 813,298 | 813,299 | u762917276 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3")
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3")
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 813,300 | 813,301 | u953587543 | cpp |
p03000 | using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> D(N);
int ... | using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> D(N);
int ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,302 | 813,303 | u766779796 | cpp |
p03000 | #include <bits/stdc++.h>
#include <iomanip> // std::setprecision
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) ... | #include <bits/stdc++.h>
#include <iomanip> // std::setprecision
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) ... | [] | 813,308 | 813,309 | u381312634 | cpp |
p03000 | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef long long ll;
ll inf = -1;
ll mod = mod = pow(10, 9) + 7;
int main() {
int n, x;
cin >> n >> ... | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef long long ll;
ll inf = -1;
ll mod = mod = pow(10, 9) + 7;
int main() {
int n, x;
cin >> n >> ... | [
"control_flow.break.add"
] | 813,310 | 813,311 | u678503521 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
vector<int> par(100010);
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
void unite(int x, int y) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
vector<int> par(100010);
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
void unite(int x, int y) {
... | [
"assignment.add"
] | 813,312 | 813,313 | u604231488 | cpp |
p03000 | #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 AC> void in(AC &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 AC> void in(AC &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,314 | 813,315 | u591725500 | cpp |
p03000 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define NMAX 110000
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, x;
cin >> n >> x;
vector<in... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define NMAX 110000
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, x;
cin >> n >> x;
vector<in... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,316 | 813,317 | u416434647 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
int n, x;
int bounds[102];
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> bounds... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
int n, x;
int bounds[102];
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> bounds... | [
"identifier.replace.add",
"literal.replace.remove"
] | 813,318 | 813,319 | u588399226 | cpp |
p03000 | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MAXSIZE 100005
#define MAXL 100
#define MOD_CONST 1000000007
typedef long long int lli;
vector<int> input_vector(const int &num) {
v... | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MAXSIZE 100005
#define MAXL 100
#define MOD_CONST 1000000007
typedef long long int lli;
vector<int> input_vector(const int &num) {
v... | [] | 813,320 | 813,321 | u078832908 | cpp |
p03000 | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
using ll = long long int;
... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
using ll = long long int;
... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 813,324 | 813,325 | u131340563 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[110], D[110], z = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i - 1];
}
for (int i = 0; i < N; i++) {
if (D[i] <= X) {
z = z + 1;
}
... | #include <iostream>
using namespace std;
int main() {
int N, X, L[110], D[110], z = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
}
for (int i = 0; i < N + 1; i++) {
if (D[i] <= X) {
z = z + 1;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,332 | 813,333 | u428229036 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[110], D[110], z = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i];
}
for (int i = 0; i < N; i++) {
if (D[i] <= X) {
z = z + 1;
}
}
... | #include <iostream>
using namespace std;
int main() {
int N, X, L[110], D[110], z = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
}
for (int i = 0; i < N + 1; i++) {
if (D[i] <= X) {
z = z + 1;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 813,334 | 813,333 | u428229036 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
int D = 0;
int count = 0;
for (int i = 0; i < N; i++) {
D = D + L.at(i);
if (D <= X) {
count++;
}
}
cout << count << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
int D = 0;
int count = 0;
for (int i = 0; i < N; i++) {
D = D + L.at(i);
if (D <= X) {
count++;
}
}
cout << count + 1 << endl;... | [
"expression.operation.binary.add"
] | 813,337 | 813,338 | u394973531 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int dp[110];
int N, X;
cin >> N >> X;
int L[110];
for (int i = 0; i < N; ++i)
cin >> L[i];
for (int i = 0; i < N; ++i) {
if (i == 0)
dp[i] = 0;
else
dp[i] = dp[i - 1] + L[i - 1];
}
int count = 0;
for (int i = 0; i < N; ++i) ... | #include <iostream>
using namespace std;
int main() {
int dp[110];
int N, X;
cin >> N >> X;
int L[110];
for (int i = 0; i < N; ++i)
cin >> L[i];
for (int i = 0; i <= N; ++i) {
if (i == 0)
dp[i] = 0;
else
dp[i] = dp[i - 1] + L[i - 1];
}
int count = 0;
for (int i = 0; i <= N; ++i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,339 | 813,340 | u730594702 | cpp |
p03000 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __built... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __built... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,341 | 813,342 | u091650402 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void _dump(const char *s, T &&head) {
cerr << s << "=" << head << endl;
}
template <typename T, typename... Args>
void _dump(const char *s, T &&head, Args &&...tail) {
while (*s != ',')
cerr << *s++;
cerr << "=" << h... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void _dump(const char *s, T &&head) {
cerr << s << "=" << head << endl;
}
template <typename T, typename... Args>
void _dump(const char *s, T &&head, Args &&...tail) {
while (*s != ',')
cerr << *s++;
cerr << "=" << h... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,345 | 813,346 | u147305315 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N, X, s = 0;
cin >> N >> X;
vector<ll> L(N);
for (auto &l : L)
cin >> l;
for (int i = 0; i < N; i++) {
s += L[i];
if (s > X) {
cout << i... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N, X, s = 0;
cin >> N >> X;
vector<ll> L(N);
for (auto &l : L)
cin >> l;
for (int i = 0; i < N; i++) {
s += L[i];
if (s > X) {
cout << i... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 813,349 | 813,350 | u634208461 | cpp |
p03000 | #include <iostream>
#include <stdio.h>
using namespace std;
int l[110];
int N, X;
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> l[i];
int r = 0;
int cnt = 0;
while (r <= X && cnt < N) {
r += l[cnt];
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int l[110];
int N, X;
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> l[i];
int r = 0;
int cnt = 0;
while (r <= X && cnt <= N) {
r += l[cnt];
cnt++;
}
cout << cnt << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 813,351 | 813,352 | u090967649 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<int> d(n + 1);
for (int i = 1; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
}
for (int i = 0; i <= n; i++) {
if (d[i] > ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<int> d(n + 1);
for (int i = 1; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
}
for (int i = 0; i <= n; i++) {
if (d[i] > ... | [
"expression.operation.binary.add"
] | 813,353 | 813,354 | u881599732 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
int main() {
int n, x;
cin >> n >> x;
int l[n], d[n + 1];
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
int main() {
int n, x;
cin >> n >> x;
int l[n], d[n + 1];
for (int i = 0; i < n; ++i) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,355 | 813,356 | u876386943 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 813,361 | 813,362 | u160321725 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#def... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#def... | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 813,363 | 813,364 | u767543103 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#def... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#def... | [
"control_flow.loop.condition.change"
] | 813,365 | 813,364 | u767543103 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int d[n + 2];
d[0] = 0;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int d[n + 1];
d[0] = 0;... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change"
] | 813,379 | 813,380 | u241908712 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int d[n + 2];
d[0] = 0;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int d[n + 1];
d[0] = 0;... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 813,381 | 813,380 | u241908712 | cpp |
p03000 | #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 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n... | #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 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,382 | 813,383 | u276682785 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
int n, x;
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> a[i];
int curr = 0, ans = 1;
;
for (int i = 2; i <= n; i++) {
curr += a[i - 1];
if (curr <= x)
ans++;
else
break;
}
cout << ans << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
int n, x;
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> a[i];
int curr = 0, ans = 1;
;
for (int i = 2; i <= n + 1; i++) {
curr += a[i - 1];
if (curr <= x)
ans++;
else
break;
}
cout << ans << endl;
r... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,390 | 813,391 | u365513379 | cpp |
p03000 | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/05/20.
// 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, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin ... | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/05/20.
// 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, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin ... | [
"expression.operation.binary.add"
] | 813,394 | 813,395 | u422769833 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define ... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define ... | [
"expression.operation.binary.remove"
] | 813,396 | 813,397 | u314008046 | cpp |
p03000 | #import <bits/stdc++.h>
using namespace std;
int a, b, c, i, j, k, l, m, n, s, x, y, z, w[105];
main() {
scanf("%d%d", &n, &k);
for (; i++ < n;) {
scanf("%d", &x);
s += x;
if (s > k)
return printf("%d", i), 0;
}
printf("%d", n);
} | #import <bits/stdc++.h>
using namespace std;
int a, b, c, i, j, k, l, m, n, s, x, y, z, w[105];
main() {
scanf("%d%d", &n, &k);
for (; i++ < n;) {
scanf("%d", &x);
s += x;
if (s > k)
return printf("%d", i), 0;
}
printf("%d", n + 1);
} | [
"expression.operation.binary.add"
] | 813,404 | 813,405 | u381108555 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int d = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
int y;
cin >> y;
d += y;
if (y <= X)
ans++;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int d = 0;
int ans = 1;
for (int i = 0; i < N; i++) {
int y;
cin >> y;
d += y;
if (d <= X)
ans++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,406 | 813,407 | u792217717 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using llint = long long;
using pint = pair<int, int>;
#define LOG(x) cout << "# " << #x << " => " << (x) << endl
const int INF = 1 << 28;
const llint LLINF = 1LL << 60;
int n, x, ans = 0;
vector<int> l;
vector<int> cumulativeSum(vector<int> &a) {
int n = a.size();
... | #include <bits/stdc++.h>
using namespace std;
using llint = long long;
using pint = pair<int, int>;
#define LOG(x) cout << "# " << #x << " => " << (x) << endl
const int INF = 1 << 28;
const llint LLINF = 1LL << 60;
int n, x, ans = 0;
vector<int> l;
vector<int> cumulativeSum(vector<int> &a) {
int n = a.size();
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,410 | 813,411 | u135954097 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x;
cin >> n >> x;
vector<int> L(n);
int di = 0;
int i;
for (i = 0; i < n; i++) {
cin >> L[i];
di += L[i];
if (di > x)
break;
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x;
cin >> n >> x;
vector<int> L(n);
int di = 0;
int i;
for (i = 0; i < n; i++) {
cin >> L[i];
di += L[i];
if (di > x)
break;
}
cout << i + 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 813,414 | 813,415 | u360441331 | cpp |
p03000 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,420 | 813,421 | u918357423 | cpp |
p03000 | //#define anjn
// Anjan Agarwala - anjn98
//#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")... | //#define anjn
// Anjan Agarwala - anjn98
//#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 813,436 | 813,437 | u089572841 | cpp |
p03000 | //#define anjn
// Anjan Agarwala - anjn98
//#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")... | //#define anjn
// Anjan Agarwala - anjn98
//#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")... | [
"identifier.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 813,438 | 813,437 | u089572841 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N), D(N + 1);
for (int i = 0; i < N; ++i)
cin >> L[i];
D[0] = 0;
for (int i = 1; i <= N; ++i) {
D[i] = D[i - 1] + L[i - 1];
// cout << D[i] << endl;
}
int sum = 0;
for (int i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N), D(N + 1);
for (int i = 0; i < N; ++i)
cin >> L[i];
D[0] = 0;
for (int i = 1; i <= N; ++i) {
D[i] = D[i - 1] + L[i - 1];
// cout << D[i] << endl;
}
int sum = 0;
for (int i... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,441 | 813,442 | u477694598 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 10e9 + 7
#define MAX 100005
typedef unsigned int uint;
typedef unsigned long long int ull;
type... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 10e9 + 7
#define MAX 100005
typedef unsigned int uint;
typedef unsigned long long int ull;
type... | [
"assignment.change"
] | 813,443 | 813,444 | u090325904 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
///定義場所///
int i, j, k, l, m, n;
int N, M, K, H, W;
ll MOD = 1000000007;
int ans = 1;
//関数リスト//
int ctoi(char c) {
switch (c) {
case '0':
r... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
///定義場所///
int i, j, k, l, m, n;
int N, M, K, H, W;
ll MOD = 1000000007;
int ans = 1;
//関数リスト//
int ctoi(char c) {
switch (c) {
case '0':
r... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,457 | 813,458 | u916974091 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
///定義場所///
int i, j, k, l, m, n;
int N, M, K, H, W;
ll MOD = 1000000007;
int ans = 0;
//関数リスト//
int ctoi(char c) {
switch (c) {
case '0':
r... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
///定義場所///
int i, j, k, l, m, n;
int N, M, K, H, W;
ll MOD = 1000000007;
int ans = 1;
//関数リスト//
int ctoi(char c) {
switch (c) {
case '0':
r... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,459 | 813,458 | u916974091 | cpp |
p03000 | #include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define nl std::cout << "\n"
#define in(x) std::cin >> (x)
#define out(x) std::cout << (x) << " "
#define err(x) std::cerr << "DBG: " << #x << ... | #include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define nl std::cout << "\n"
#define in(x) std::cin >> (x)
#define out(x) std::cout << (x) << " "
#define err(x) std::cerr << "DBG: " << #x << ... | [
"expression.operation.binary.add"
] | 813,464 | 813,465 | u811925505 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"expression.operation.binary.remove"
] | 813,466 | 813,467 | u406225550 | cpp |
p03000 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 813,470 | 813,471 | u493750228 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, pos = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int l;
cin >> l;
pos += l;
if (pos <= X)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 1, pos = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int l;
cin >> l;
pos += l;
if (pos <= X)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,472 | 813,473 | u573082373 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,474 | 813,475 | u856232850 | cpp |
p03000 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ll long long
#define ss second
#define ff first
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define f(i, n) fr(i, 0, n)
#define rf(i, b, a) for (ll i = b - 1; i >= a; i--)
#define r(i, n) rf(i, n, 0)
#define inf 1000000007
#define eps 0.00000... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ll long long
#define ss second
#define ff first
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define f(i, n) fr(i, 0, n)
#define rf(i, b, a) for (ll i = b - 1; i >= a; i--)
#define r(i, n) rf(i, n, 0)
#define inf 1000000007
#define eps 0.00000... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,478 | 813,479 | u151137534 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, M;
cin >> n >> M;
int cur = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
cur += x;
if (cur <= M)
ans = max(ans, i + 1);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, M;
cin >> n >> M;
int cur = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
cur += x;
if (cur <= M)
ans = max(ans, i + 2);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 813,482 | 813,483 | u027091475 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int d[n + 1], k[n + 1];
for (int i = 1; i <= n; ++i)
cin >> k[i];
d[0] = 0;
for (int i = 1; i <= n; ++i)
d[i] = d[i - 1] + k[i];
int sum = 0;
for (int i = 1; i <= n; ++i)
sum += (d[i] < x);
cout << sum + 1;
re... | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int d[n + 1], k[n + 1];
for (int i = 1; i <= n; ++i)
cin >> k[i];
d[0] = 0;
for (int i = 1; i <= n; ++i)
d[i] = d[i - 1] + k[i];
int sum = 0;
for (int i = 1; i <= n; ++i)
sum += (d[i] <= x);
cout << sum + 1;
r... | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 813,484 | 813,485 | u146240825 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, s, e) for (int i = (s); i < (e); i++)
#define all(x) x.begin(), x.end()
#define endl "\n"
void use_cio() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, s, e) for (int i = (s); i < (e); i++)
#define all(x) x.begin(), x.end()
#define endl "\n"
void use_cio() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 813,490 | 813,491 | u847501264 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.