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 <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);
D[0] = 0;
int count = 0;
for (int i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
}
for (int i = 0; i < N; i++) {
if... | #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);
D[0] = 0;
int count = 0;
for (int i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
}
for (int i = 0; i <= N; i++) {
i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,881 | 811,882 | u016183710 | cpp |
p03000 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | [
"expression.operation.binary.add"
] | 811,883 | 811,884 | u610897920 | cpp |
p03000 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | [
"variable_declaration.value.change"
] | 811,885 | 811,884 | u610897920 | cpp |
p03000 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数... | [
"expression.operation.binary.add"
] | 811,887 | 811,888 | u545938555 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 0;
int dist = 0;
int leap;
for (int i = 0; i < n; i++) {
cin >> leap;
dist += leap;
ans++;
if (dist > x) {
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 0;
int dist = 0;
int leap;
for (int i = 0; i < n + 1; i++) {
cin >> leap;
dist += leap;
ans++;
if (dist > x) {
break;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,891 | 811,892 | u176218583 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 0;
int dist = 0;
int leap;
for (int i = 0; i < n; i++) {
cin >> leap;
dist += leap;
ans++;
if (dist >= x) {
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 0;
int dist = 0;
int leap;
for (int i = 0; i < n + 1; i++) {
cin >> leap;
dist += leap;
ans++;
if (dist > x) {
break;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,893 | 811,892 | u176218583 | cpp |
p03000 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, X, ans;
cin >> N >> X;
vector<int> L(N), D(N);
D[0] = 0;
ans = 0;
rep(i, N) cin >> L[i];
for (int i = 1; i < N; i++)
D[i] = D[i - 1] + L[i - 1];
rep(i, N)(D[... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, X, ans;
cin >> N >> X;
vector<int> L(N), D(N + 1);
D[0] = 0;
ans = 0;
rep(i, N) cin >> L[i];
for (int i = 1; i < N + 1; i++)
D[i] = D[i - 1] + L[i - 1];
rep(... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,894 | 811,895 | u879294842 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
int N, X;
int L[101];
int main() {
cin >> N >> X;... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
int N, X;
int L[105];
int main() {
cin >> N >> X;... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,901 | 811,902 | u731886385 | cpp |
p03000 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 811,911 | 811,912 | u822725754 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
int main() {
int n, x, ans = 1, d = 0;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
rep(i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
int main() {
int n, x, ans = 1, d = 0;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
... | [
"expression.operation.binary.add"
] | 811,921 | 811,922 | u088751997 | cpp |
p03000 | #include <iostream>
using namespace std;
void _130() {
int n, x;
int l[100];
cin >> n >> x;
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int d = 0;
for (int i = 0; i < n; ++i) {
d = d + l[i];
// cout << d << endl;
if (d > x) {
cout << i + 1 << endl;
return;
}
}
cout <... | #include <iostream>
using namespace std;
void _130() {
int n, x;
int l[100];
cin >> n >> x;
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int d = 0;
for (int i = 0; i < n; ++i) {
d = d + l[i];
// cout << d << endl;
if (d > x) {
cout << i + 1 << endl;
return;
}
}
cout <... | [
"expression.operation.binary.add"
] | 811,933 | 811,934 | u243740419 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int Y = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
if (Y > X) {
break;
}
int L;
cin >> L;
ans++;
Y += L;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int Y = 0;
int ans = 0;
for (int i = 0; i <= N; i++) {
if (Y > X) {
break;
}
int L;
cin >> L;
ans++;
Y += L;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,935 | 811,936 | u280120599 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> D(110, 0), L(110, 0);
for (int i = 0; i < n; i++) {
cin >> L[i];
D[i + 1] = D[i] + L[i];
}
int ans = 0;
for (int i = 0; i < n && D[i] <= x; i++) {
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> D(110, 0), L(110, 0);
for (int i = 0; i < n; i++) {
cin >> L[i];
D[i + 1] = D[i] + L[i];
}
int ans = 0;
for (int i = 0; i < n + 1 && D[i] <= x; i++) {
ans++;
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,942 | 811,943 | u756208532 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int d = l[0];
int c = 1;
while (d <= x) {
d += l[c];
c++;
}
cout << c << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int d = l[0];
int c = 1;
while (d <= x && c < n + 1) {
d += l[c];
c++;
}
cout << c << endl;
} | [
"control_flow.loop.condition.change"
] | 811,946 | 811,947 | u765815947 | cpp |
p03000 | #include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define rep(I, N) for (int I = 1; I <= (N); ++I)
#define repp(I, N) for (int I = 0; I < (N); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORR(I, A, B) for (int I = (A); I >= (B); I--)
#define SORT_UNIQU... | #include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define rep(I, N) for (int I = 1; I <= (N); ++I)
#define repp(I, N) for (int I = 0; I < (N); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORR(I, A, B) for (int I = (A); I >= (B); I--)
#define SORT_UNIQU... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,952 | 811,953 | u842262709 | cpp |
p03000 | #include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define rep(I, N) for (int I = 1; I <= (N); ++I)
#define repp(I, N) for (int I = 0; I < (N); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORR(I, A, B) for (int I = (A); I >= (B); I--)
#define SORT_UNIQU... | #include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define rep(I, N) for (int I = 1; I <= (N); ++I)
#define repp(I, N) for (int I = 0; I < (N); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORR(I, A, B) for (int I = (A); I >= (B); I--)
#define SORT_UNIQU... | [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,954 | 811,953 | u842262709 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, x;
cin >> n >> x;
vector<int> ls(n);
for (int i = 0; i < n; i++) {
cin >> ls[i];
}
int d = 0, cnt = 1;
for (int i = 0; i < n + 1; i++) {
d = d + ls[cnt - 1];
if (d > x) {
break;... | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, x;
cin >> n >> x;
vector<int> ls(n);
for (int i = 0; i < n; i++) {
cin >> ls[i];
}
int d = 0, cnt = 1;
for (int i = 0; i < n; i++) {
d = d + ls[i];
if (d > x) {
break;
}
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 811,959 | 811,960 | u289545075 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> pair_t;
using Graph = vector<vector<ll>>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> pair_t;
using Graph = vector<vector<ll>>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1... | [
"expression.operation.binary.add"
] | 811,961 | 811,962 | u313994303 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) {
cin >> l[i];
x -= l[i];
if (x < 0) {
cout << i + 1;
return 0;
}
}
cout << n;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) {
cin >> l[i];
x -= l[i];
if (x < 0) {
cout << i + 1;
return 0;
}
}
cout << n + 1;
} | [
"expression.operation.binary.add"
] | 811,966 | 811,967 | u018372223 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int d[N + 1];
int count = 0;
for (int i = 1; i <= N; i++) {
d[i] = d[i - 1] + L[i - 1];
if (d[i] > X) {
break;
} else
count++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int d[N + 1] = {0};
int count = 1;
for (int i = 1; i <= N; i++) {
d[i] = d[i - 1] + L[i - 1];
if (d[i] > X) {
break;
} else
count++;
... | [
"variable_declaration.value.change",
"literal.number.change"
] | 811,972 | 811,971 | u109191542 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iomanip> //doubleの桁数指定
#include <iostream>
#include <list> //前後に数値を入れれる配列
#include <map> //map
#include <string> //文字列
#include <vector> //vecror
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++) // forの短縮
#define rep(i, n) REP(i, 0, n) ... | #include <algorithm>
#include <cmath>
#include <iomanip> //doubleの桁数指定
#include <iostream>
#include <list> //前後に数値を入れれる配列
#include <map> //map
#include <string> //文字列
#include <vector> //vecror
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++) // forの短縮
#define rep(i, n) REP(i, 0, n) ... | [
"expression.operation.binary.add"
] | 811,975 | 811,976 | u751428191 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
int ans = 0, sum = 0;
for (int i = 0; i < n && sum <= x; ++i) {
int y;
cin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
int ans = 0, sum = 0;
for (int i = 0; i <= n && sum <= x; ++i) {
int y;
ci... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,977 | 811,978 | u505466816 | cpp |
p03000 | #include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, x, ans = 0, sum = 0;
cin >> n >> x;
REP(i, n) {
int y;
cin >> y;
sum += y;
ans += sum <= x;
}
cout << ans;
}
| #include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, x, ans = 0, sum = 0;
cin >> n >> x;
REP(i, n) {
int y;
cin >> y;
sum += y;
ans += (sum <= x);
}
cout << ans + 1;
}
| [
"expression.operation.binary.add"
] | 811,979 | 811,980 | u505466816 | cpp |
p03000 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void) {
int N, X;
cin >> N >> X;
vector<int> L(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
vector<int> D(N + 1, 0);
for (int i = 1; i < N + 1; i++) {
D.at(i) = D.at(i - 1) + L... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void) {
int N, X;
cin >> N >> X;
vector<int> L(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
vector<int> D(N + 1, 0);
for (int i = 1; i < N + 1; i++) {
D.at(i) = D.at(i - 1) + L.... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,992 | 811,993 | u027946359 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, D = 0, count = 1;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L.at(i);
for (int i = 1; i < N; i++) {
D += L.at(i);
if (D <= X)
count++;
else
break;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, D = 0, count = 1;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L.at(i);
for (int i = 0; i < N; i++) {
D += L.at(i);
if (D <= X)
count++;
else
break;
}
cout << count << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 811,998 | 811,999 | u485673106 | cpp |
p03000 | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 0, D = 0;
for (int i = 0; i < N; ++i) {
int L;
cin >> L;
D += L;
if (D < X)
++count;
else
break;
... | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 1, D = 0;
for (int i = 0; i < N; ++i) {
int L;
cin >> L;
D += L;
if (D <= X)
++count;
else
break;... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,000 | 812,001 | u323542775 | 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 = 0;
int bounce = 0;
while (count <= N - 1 && bounce <= X) {
bounce += L.at(count);
count++;
}
if (count == N - 1) ... | #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 = 0;
int bounce = 0;
while (count <= N - 1 && bounce <= X) {
bounce += L.at(count);
count++;
}
if (bounce <= X) {
... | [
"expression.operation.binary.remove"
] | 812,002 | 812,003 | u629548179 | 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 = 0;
int bounce = 0;
while (count <= N - 1 && bounce <= X) {
bounce += L.at(count);
count++;
}
if (count == N - 1) {
cout <... | #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 = 0;
int bounce = 0;
while (count <= N - 1 && bounce <= X) {
bounce += L.at(count);
count++;
}
if (bounce <= X) {
... | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 812,004 | 812,003 | u629548179 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, X, L[100];
cin >> N >> X;
rep(i, N) cin >> L[i];
int diff = 0, norm = 1;
rep(i, N + 1) {
diff += L[i];
if (diff > X)
break;
/... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, X, L[100];
cin >> N >> X;
rep(i, N) cin >> L[i];
int diff = 0, norm = 1;
rep(i, N) {
diff += L[i];
if (diff > X)
break;
// di... | [
"expression.operation.binary.remove"
] | 812,007 | 812,008 | u258108378 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[100];
int sum = 0;
int cnt = 1;
rep(i, n) {
cin >> l[i];
if (sum <= x) {
sum += l[i];
cnt++;
}
}
cout <... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[100];
int sum = 0;
int cnt = 0;
rep(i, n + 1) {
cin >> l[i];
if (sum <= x) {
sum += l[i];
cnt++;
}
}
co... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,011 | 812,012 | u745267317 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[100];
int sum = 0;
int cnt = 0;
rep(i, n) {
cin >> l[i];
if (sum <= x) {
sum += l[i];
cnt++;
}
}
cout <... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[100];
int sum = 0;
int cnt = 0;
rep(i, n + 1) {
cin >> l[i];
if (sum <= x) {
sum += l[i];
cnt++;
}
}
co... | [
"expression.operation.binary.add"
] | 812,013 | 812,012 | u745267317 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int pos = 0;
int ans = 1;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
pos += L;
if (L <= X)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int pos = 0;
int ans = 1;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
pos += L;
if (pos <= X)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 812,015 | 812,016 | u016119075 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 0;
int sum = 0;
for (int i = 0; i < n; ++i) {
int l;
cin >> l;
if (sum <= x) {
++ans;
}
sum += l;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 0;
int sum = 0;
for (int i = 0; i < n; ++i) {
int l;
cin >> l;
if (sum + l <= x) {
++ans;
}
sum += l;
}
cout << ans + 1 << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 812,019 | 812,020 | u497552697 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, X;
cin >> N >> X;
int D = 0;
int count = 0;
vector<int> l(N);
for (int i = 0; i < N; i++) {
cin >> l.at(i);
}
for (int i = 0; i < N; i++) {
if (i == 0) {
count++;
} e... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, X;
cin >> N >> X;
int D = 0;
int count = 0;
vector<int> l(N);
for (int i = 0; i < N; i++) {
cin >> l.at(i);
}
for (int i = 0; i < N + 1; i++) {
if (i == 0) {
count++;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,021 | 812,022 | u537507471 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x, l, count = 0;
cin >> n >> x;
int point = 0;
for (int i = 1; i <= n; i++) {
if (i != 1) {
cin >> l;
point += l;
}
if (point <= x) {
count++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x, l, count = 0;
cin >> n >> x;
int point = 0;
for (int i = 1; i <= n + 1; i++) {
if (i != 1) {
cin >> l;
point += l;
}
if (point <= x) {
count++;
}
}
cout << count << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,025 | 812,026 | u485821416 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, x;
cin >> n >> x;
vector<int> l(n + 2);
vector<int> d(n + 2);
for (int i = 1; i <= n; ++i)
cin >> l[i];
l[1] = 0;
d[1] = 0;
for (int i = 2; i <= n + 1; ++i) {
d[i] = d[i - 1] + l[i - 1];
}
int counter = ... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, x;
cin >> n >> x;
vector<int> l(n + 2);
vector<int> d(n + 2);
for (int i = 1; i <= n + 1; ++i)
cin >> l[i];
l[0] = 0;
d[0] = 0;
for (int i = 1; i <= n + 1; ++i) {
d[i] = d[i - 1] + l[i - 1];
}
int counte... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 812,027 | 812,028 | u699111690 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int D = 0;
int ans = 1;
for (int i = 0; i <= N; i++) {
cin >> L;
D += L;
if (D >= X)
break;
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int D = 0;
int ans = 1;
for (int i = 0; i < N; i++) {
cin >> L;
D += L;
if (D > X)
break;
ans++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 812,031 | 812,032 | u455876837 | cpp |
p03000 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#inclu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#inclu... | [
"assignment.change"
] | 812,040 | 812,041 | u080318287 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int boundCount = 1;
int prevD = 0;
for (int i = 0; i < n; ++i) {
int input;
cin >> input;
int boundD = prevD + input;
if (boundD <= x) {
++boundCount;
prevD = boundD;
}
}
cout << boundC... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int boundCount = 1;
int prevD = 0;
for (int i = 0; i < n; ++i) {
int input;
cin >> input;
int boundD = prevD + input;
if (boundD <= x) {
++boundCount;
}
prevD = boundD;
}
cout << boundCo... | [] | 812,042 | 812,043 | u584797714 | cpp |
p03000 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
using namespace std;
int ans = 0, cnt = 0, n, x;
int main() {
cin >> n >> x;
rep(i, 1, n) {
int a;
cin >> a;... | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
using namespace std;
int ans = 1, cnt = 0, n, x;
int main() {
cin >> n >> x;
rep(i, 1, n) {
int a;
cin >> a;... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,056 | 812,057 | u796123030 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> vec(n);
int sum = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
sum += vec.at(i);
if (sum <= x) {
ans++;
} else
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> vec(n);
int sum = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
sum += vec.at(i);
if (sum <= x) {
ans++;
} else
break;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,060 | 812,061 | u873762144 | cpp |
p03000 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | [
"call.arguments.change"
] | 812,066 | 812,067 | u899220667 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,070 | 812,071 | u228475480 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> x >> n;
vector<int> d(n + 1);
d[0] = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
d[i + 1] = d[i] + x;
}
int ans = 0;
for (int i = 0; i <= n; i++) {
if (d[i] <= x) {
ans++;
}
}
cout << ans << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> d(n + 1);
d[0] = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
d[i + 1] = d[i] + x;
}
int ans = 0;
for (int i = 0; i <= n; i++) {
if (d[i] <= x) {
ans++;
}
}
cout << ans << ... | [
"expression.operation.binary.remove"
] | 812,072 | 812,073 | u227722533 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"expression.operation.binary.add"
] | 812,078 | 812,079 | u043443359 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb emplace_back
#define mp make_pair
#define f(i, a, n) for (int i = a; i < n; i++)
#define F first
#define E endl
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(0);
int main() {
ll n, b;
cin >> n >> b;
ll a[n + 1]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb emplace_back
#define mp make_pair
#define f(i, a, n) for (int i = a; i < n; i++)
#define F first
#define E endl
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(0);
int main() {
ll n, b;
cin >> n >> b;
ll a[n + 1]... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 812,080 | 812,081 | u366029725 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N, X;
int L[100];
int main() {
cin >> N >> X;
rep(i, N) { cin >> L[i]; }
int sum = 0;
int ans = 0;
rep(i, N) {
sum += L[i];
if (sum > X) {
break;
}
ans++;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N, X;
int L[1000];
int main() {
cin >> N >> X;
rep(i, N) { cin >> L[i]; }
int sum = 0;
int ans = 1;
rep(i, N) {
sum += L[i];
// printf("i: %d sum: %d\n", i, sum);
if (s... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 812,082 | 812,083 | u455366471 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N, -1);
ll sum = 0;
rep(i, N) cin >> L.at(i);
for (int i = 0; i < N; i++) {
sum += L.at(i);
if (X < sum) {
cout << i + 1 << en... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N, -1);
ll sum = 0;
rep(i, N) cin >> L.at(i);
for (int i = 0; i < N; i++) {
sum += L.at(i);
if (X < sum) {
cout << i + 1 << en... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 812,091 | 812,092 | u343935874 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x, l[105] = {}, d[105] = {};
int ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> l[i];
for (int i = 1; i < n; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x, l[105] = {}, d[105] = {};
int ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> l[i];
for (int i = 1; i < n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
ans++;
}
cout << ans;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,093 | 812,094 | u512624048 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1), D(N + 1);
for (int i = 1; i < N + 1; i++)
cin >> L.at(i);
// D1 = 0
// D2 = D1 + L1 = 0 + 3 = 3
// D3 = D2 + L2 = 3 + 4 = 7
int i;
D.at... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1), D(N + 10);
for (int i = 1; i < N + 1; i++)
cin >> L.at(i);
// D1 = 0
// D2 = D1 + L1 = 0 + 3 = 3
// D3 = D2 + L2 = 3 + 4 = 7
// 0,3,7,12
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 812,095 | 812,096 | u440632112 | cpp |
p03000 | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9 + 7;
const int INF = 1e... | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9 + 7;
const int INF = 1e... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 812,108 | 812,109 | u736209378 | cpp |
p03000 | /*
[abc130] B - Bounding
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int MAX_N = 100;
int N, X;
int L[MAX_N];
ll solve() {
int d = 0;
int ans = 0;
for (int i = 0; i < N && d <= X; i++) {
a... | /*
[abc130] B - Bounding
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int MAX_N = 100;
int N, X;
int L[MAX_N + 1];
ll solve() {
int d = 0;
int ans = 0;
for (int i = 0; i <= N && d <= X; i++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,110 | 812,111 | u302149106 | cpp |
p03000 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 812,112 | 812,113 | u378419207 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int ans = 1;
int len = 0;
rep(i, N) {
len += L[i];
if (len >= X)
break;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int ans = 1;
int len = 0;
rep(i, N) {
len += L[i];
if (len > X)
break;
ans++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,116 | 812,117 | u147556624 | cpp |
p03000 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int count = 0;
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
for (int i = 0; i < N; i++) {
if (D[i] <= X) {
count++;
}
... | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int count = 0;
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
for (int i = 0; i <= N; ++i) {
if (D[i] <= X) {
count++;
}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,118 | 812,119 | u573537453 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 1;
int total = 0;
rep(i, n) {
int tmp;
cin >> tmp;
total += tmp;
if (total < x)
ans++;
else
break;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 1;
int total = 0;
rep(i, n) {
int tmp;
cin >> tmp;
total += tmp;
if (total <= x)
ans++;
else
break;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,140 | 812,141 | u741134767 | cpp |
p03000 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,157 | 812,158 | u637983859 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,161 | 812,162 | u612271542 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, coo, count;
cin >> n >> x;
coo = 0;
count = 0;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
coo = l;
if (coo <= x) {
count += 1;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x, coo, count;
cin >> n >> x;
coo = 0;
count = 1;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
coo += l;
if (coo <= x) {
count += 1;
}
}
cout << count << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 812,166 | 812,167 | u961443099 | cpp |
p03000 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const int INF = 10010010;
const double PI = 3.141592653589;
int main() {
int x, n;
cin >> n >> x;
int c = 1;
int sum = 0;
vector<int> ... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const int INF = 10010010;
const double PI = 3.141592653589;
int main() {
int x, n;
cin >> n >> x;
int c = 1;
int sum = 0;
vector<int> ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,171 | 812,172 | u634999820 | 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 ans = 1;
int sum = 0;
for (int i = 0; i <= n; i++) {
sum += l[i];
if (sum <= x)
++ans;
}
cout << ans << endl;
return 0;
} | #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 ans = 1;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += l[i];
if (sum <= x)
++ans;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,175 | 812,176 | u804520294 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
typedef long long ll;
#define endl '\n'
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 1000000007;
//////////////////////////////////////////
int n, x;
int L[100];
void Input() {
cin >> n... | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
typedef long long ll;
#define endl '\n'
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 1000000007;
//////////////////////////////////////////
int n, x;
int L[100];
void Input() {
cin >> n... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,192 | 812,193 | u423831742 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | [
"expression.operation.binary.add"
] | 812,194 | 812,195 | u517411077 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, i, j, s = 0, b = -1;
int a[110];
cin >> n >> x;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
if (s > x && b == -1) {
b = i + 1;
}
}
if (b == -1)
b = n;
cout << b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x, i, j, s = 0, b = -1;
int a[110];
cin >> n >> x;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
if (s > x && b == -1) {
b = i + 1;
}
}
if (b == -1)
b = n + 1;
cout << b << endl;
return 0;
} | [
"assignment.change"
] | 812,233 | 812,234 | u834488582 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, i, j, s = 0, b = -1;
int a[110];
cin >> n >> x;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
if (s > x && b == -1) {
b = i + 1;
}
}
if (b = -1)
b = n;
cout << b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x, i, j, s = 0, b = -1;
int a[110];
cin >> n >> x;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
if (s > x && b == -1) {
b = i + 1;
}
}
if (b == -1)
b = n + 1;
cout << b << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"assignment.change"
] | 812,235 | 812,234 | u834488582 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, l[101], total = 0, cnt = 0;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
for (int i = 0; i < n; i++) {
total += l[i];
if (total <= x)
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, x, l[101], total = 0, cnt = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
for (int i = 0; i < n; i++) {
total += l[i];
if (total <= x)
cnt++;
}
cout << cnt << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 812,244 | 812,245 | u522506260 | cpp |
p03000 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, X, D = 0, cnt = 0;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++)
cin >> L[i];
for (int i = 0;; i++, cnt++) {
D = D + L[i - 1];
if (D > X)
break;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, X, D = 0, cnt = 1;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++)
cin >> L[i];
for (int i = 1;; i++, cnt++) {
D = D + L[i - 1];
if (D > X)
break;
}
cout << cnt << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 812,248 | 812,249 | u937275419 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
int main() {
ll n, x;
cin >> n >> x;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll d = 0, i = 1, c = 1;
while ((d + a[i - 1]) <= x && i < n) {
d = a[i - 1] + d;
// cout<<"d "<<d<<endl;
i++;
... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
int main() {
ll n, x;
cin >> n >> x;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll d = 0, i = 0, c = 1;
while ((d + a[i]) <= x && i < n) {
d = a[i] + d;
// cout<<"d "<<d<<endl;
i++;
c++;
}... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 812,250 | 812,251 | u159663513 | cpp |
p03000 | #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int n, x, l[100];
int i, j, k, sum = 0;
cin >> n >> x;
l[0] = 0;
for (i = 1; i < n; i++) {
cin >> l[i];
sum = sum + l[i];
if (sum > x) {
break;
}
}
cout << i;
return 0;
}
| #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int n, x, l[100];
int i, j, k, sum = 0;
cin >> n >> x;
l[0] = 0;
for (i = 1; i <= n; i++) {
cin >> l[i];
sum = sum + l[i];
if (sum > x) {
break;
}
}
cout << i;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,266 | 812,267 | u660656075 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int N, X;
cin >> N >> X;
int result = 1, sum = 0;
rep(i, N) {
int L;
cin >> ... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int N, X;
cin >> N >> X;
int result = 1, sum = 0;
rep(i, N) {
int L;
cin >> ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 812,274 | 812,275 | u680707192 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int N, X;
cin >> N >> X;
int result = 1, sum = 0;
rep(i, N) {
int L;
cin >> ... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int N, X;
cin >> N >> X;
int result = 1, sum = 0;
rep(i, N) {
int L;
cin >> ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 812,276 | 812,275 | u680707192 | cpp |
p03000 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 812,279 | 812,280 | u896838289 | cpp |
p03000 | #define rep(i, n) for (int i = 0; i < (int)n; i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef LOCAL
// 以降 cin の入力元が 'xxx.txt' になる
std::ifstream in("b.txt");
std::cin.rdbuf(in.rdbuf());
#endif
int n, x;
cin >> n >> x;
int d = 0;
int ans = 1;
vector<int> l(n);
rep(i, n) cin >>... | #define rep(i, n) for (int i = 0; i < (int)n; i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef LOCAL
// 以降 cin の入力元が 'xxx.txt' になる
std::ifstream in("b.txt");
std::cin.rdbuf(in.rdbuf());
#endif
int n, x;
cin >> n >> x;
int d = 0;
int ans = 1;
vector<int> l(n);
rep(i, n) cin >>... | [
"control_flow.loop.for.condition.change"
] | 812,286 | 812,287 | u234248338 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, D = 0, L;
cin >> N >> X;
for (int i = 0; D <= X; i++) {
cin >> L;
D += L;
ans++;
if (i = N)
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, D = 0, L;
cin >> N >> X;
for (int i = 0; D <= X; i++) {
cin >> L;
D += L;
ans++;
if (i == N)
break;
}
cout << ans << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 812,309 | 812,310 | u028572059 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, l[101], now = 0, ans = 0, idx = 0;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> l[i];
while (now <= x && idx < n) {
now += l[idx];
idx++;
ans++;
}
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x, l[101], now = 0, ans = 0, idx = 0;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> l[i];
while (now <= x && idx <= n) {
now += l[idx];
idx++;
ans++;
}
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 812,321 | 812,322 | u628758223 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> temp(N);
for (int i = 0; i < N; i++)
cin >> temp[i];
int count = 0;
int coor = 0;
for (int i = 0; i < N; i++) {
coor += temp[i];
if (coor >= X)
count++;
}
cout << 1 + coun... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> temp(N);
for (int i = 0; i < N; i++)
cin >> temp[i];
int count = 0;
int coor = 0;
for (int i = 0; i < N; i++) {
coor += temp[i];
if (coor <= X)
count++;
}
cout << 1 + coun... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,330 | 812,331 | u079736142 | cpp |
p03000 | #include <iostream>
#include <vector>
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 hight = 0;
int cnt = 1;
for (int i = 0; i < N; i++) {
hight += L[i];
cnt++;
if (hight > X) {
break;
}
}
c... | #include <iostream>
#include <vector>
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 hight = 0;
int cnt = 1;
for (int i = 0; i < N; i++) {
hight += L[i];
cnt++;
if (hight > X) {
cnt--;
break;
... | [
"expression.unary.arithmetic.add"
] | 812,334 | 812,335 | u904123392 | cpp |
p03000 | #include <iostream>
#include <vector>
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 hight = 0;
int cnt = 1;
for (int i = 0; i < N; i++) {
hight += L[i];
cnt++;
if (hight > X) {
break;
}
}
c... | #include <iostream>
#include <vector>
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 hight = 0;
int cnt = 1;
for (int i = 0; i < N; i++) {
hight += L[i];
cnt++;
if (hight > X) {
cnt--;
break;
... | [
"expression.unary.arithmetic.add"
] | 812,334 | 812,336 | u904123392 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, x;
cin >> n >> x;
int d[n + 1];
d[0] = 0;
rep(i,... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, x;
cin >> n >> x;
int d[n + 1];
d[0] = 0;
rep(i,... | [
"expression.operation.binary.add"
] | 812,337 | 812,338 | u654115954 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, x;
cin >> n >> x;
long long int l[n], d[n + 1];
for (int i = 0; i < n; i++)
cin >> l[i];
d[0] = 0;
for (long long int i = 1; i < n; i++)
d[i] = d[i - 1] + l[i - 1];
long long int k = 0;
for (long long int i = 0; i < n ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, x;
cin >> n >> x;
long long int l[n], d[n + 1];
for (int i = 0; i < n; i++)
cin >> l[i];
d[0] = 0;
for (long long int i = 1; i < n + 1; i++)
d[i] = d[i - 1] + l[i - 1];
long long int k = 0;
for (long long int i = 0; i ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,372 | 812,373 | u796786871 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 200005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define F first
#define S se... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 200005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define F first
#define S se... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 812,374 | 812,375 | u308590217 | cpp |
p03000 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#define REP_1(i, n) for (int i = 1; i < n + 1; i++)
#define bitSearch(bit, n) for (int bit =... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#define REP_1(i, n) for (int i = 1; i < n + 1; i++)
#define bitSearch(bit, n) for (int bit =... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 812,378 | 812,379 | u741556152 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, count = 0;
cin >> N >> X;
vector<int> D(N + 1);
D.at(0) = 0;
for (int i = 0; i < N; i++) {
cin >> X;
D.at(i + 1) = D.at(i) + X;
}
// for (int i = 0; i < N;i++)
// cout << L.at(i) << endl;
for (int i = 0; i <= N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, count = 0;
cin >> N >> X;
vector<int> D(N + 1);
D.at(0) = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
D.at(i + 1) = D.at(i) + x;
}
// for (int i = 0; i < N;i++)
// cout << L.at(i) << endl;
for (int i = 0; i <= N... | [
"variable_declaration.add",
"identifier.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 812,416 | 812,417 | u995485610 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define mm map<ii>
#define ff fir... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define mm map<ii>
#define ff fir... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,442 | 812,443 | u460819600 | cpp |
p03000 | #include <iostream>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
long long int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
long long int D[N];
D[0] = 0;
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i - 1];
}
int counter = 0;
for (int i = 0; i < N; i++) {
... | #include <iostream>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
long long int L[N + 1];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
long long int D[N];
D[0] = 0;
for (int i = 1; i <= N; i++) {
D[i] = D[i - 1] + L[i - 1];
}
int counter = 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"
] | 812,460 | 812,461 | u036238364 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, X, D = 0, j = 2, count = 1;
cin >> N >> X;
vector<int> L(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> L[i];
}
while (D + L[j - 1] <= X && j < N + 1) {
D += L[j - 1];
count++;
j++;
}
cout << cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, X, D = 0, j = 2, count = 1;
cin >> N >> X;
vector<int> L(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> L[i];
}
while (D + L[j - 1] <= X && j < N + 2) {
D += L[j - 1];
count++;
j++;
}
cout << cou... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 812,464 | 812,465 | u703503553 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, X, D = 0, j = 2, count = 1;
cin >> N >> X;
vector<int> L(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> L[i];
}
while (D + L[j - 1] <= X) {
D += L[j - 1];
count++;
j++;
}
cout << count << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, X, D = 0, j = 2, count = 1;
cin >> N >> X;
vector<int> L(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> L[i];
}
while (D + L[j - 1] <= X && j < N + 2) {
D += L[j - 1];
count++;
j++;
}
cout << cou... | [
"control_flow.loop.condition.change"
] | 812,466 | 812,465 | u703503553 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#define LL long long
#define inf 0x3f3f3f3f
using namespace std;
const int MAXN = 1000005;
int D[105], L[105];
int main() {
// freopen("../in.txt... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#define LL long long
#define inf 0x3f3f3f3f
using namespace std;
const int MAXN = 1000005;
int D[105], L[105];
int main() {
// freopen("../in.txt... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,488 | 812,489 | u481292708 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#define LL long long
#define inf 0x3f3f3f3f
using namespace std;
const int MAXN = 1000005;
int D[105], L[105];
int main() {
// freopen("../in.txt... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#define LL long long
#define inf 0x3f3f3f3f
using namespace std;
const int MAXN = 1000005;
int D[105], L[105];
int main() {
// freopen("../in.txt... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,490 | 812,489 | u481292708 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n;
int count = 1;
int d = 0;
int l;
for (int i = 0; i < n; i++) {
cin >> l;
d += l;
if (d <= x)
count++;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int count = 1;
int d = 0;
int l;
for (int i = 0; i < n; i++) {
cin >> l;
d += l;
if (d <= x)
count++;
}
cout << count << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 812,493 | 812,494 | u639203570 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L_i;
for (int i{0}; i < N; ++i) {
int tmp;
cin >> tmp;
L_i.push_back(tmp);
}
int count{1};
int d{0};
for (int i{1}; i < N; ++i) {
d = d + L_i[i];
if (d > X)
break;... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L_i;
for (int i{0}; i < N; ++i) {
int tmp;
cin >> tmp;
L_i.push_back(tmp);
}
int count{1};
int d{0};
for (int i{0}; i < N; ++i) {
d = d + L_i[i];
if (d > X)
break;... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 812,495 | 812,496 | u989899651 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, l[101] = {};
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
long long int d[101] = {};
for (int i = 1; i < n; i++) {
d[i] = d[i - 1] + l[i - 1];
}
int ct = 1;
for (int i = 1; i < n; i++) {
if (d[i] <= x) {
c... | #include <iostream>
using namespace std;
int main() {
int n, x, l[101] = {};
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
long long int d[101] = {};
for (int i = 1; i < n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
}
int ct = 1;
for (int i = 1; i < n + 1; i++) {
if (d[i] <= x) {... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,502 | 812,503 | u632679464 | cpp |
p03000 | #include <iostream>
using namespace std;
#define N 101
int main() {
int n, x, l[N] = {};
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ct = 1;
long long int d = 0;
for (int i = 1; i < n; i++) {
d = d + l[i - 1];
if (d <= x) {
ct++;
} else {
break;
}
}
... | #include <iostream>
using namespace std;
#define N 101
int main() {
int n, x, l[N] = {};
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ct = 1;
long long int d = 0;
for (int i = 1; i < n + 1; i++) {
d = d + l[i - 1];
if (d <= x) {
ct++;
} else {
break;
}
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,504 | 812,505 | u632679464 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,517 | 812,518 | u355371431 | 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;
int y = 0;
for (int i = 0; i <= n; i++) {
y += l.at(i);
if (y > x)
count++;
else
break;
}
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 count = 1;
int y = 0;
for (int i = 0; i < n; i++) {
y += l.at(i);
if (y <= x)
count++;
else
break;
}
cout << count << endl;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 812,521 | 812,520 | u191476275 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int cur = 0;
int res = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
cur += x;
if (cur <= L)
++res;
}
cout << res;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int cur = 0;
int res = 1;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
cur += x;
if (cur <= L)
++res;
}
cout << res;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,523 | 812,524 | u427589390 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 1; i < N; i++) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i < N + 1; i++) {
if (D[i] <= X)
ans++;
}
cout... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; i++) {
if (D[i] <= X)
ans++;
}
cout <<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 812,527 | 812,528 | u544511937 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 1; i < N + 1; i++) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i < N + 1; i++) {
if (D[i] <= X)
ans++;
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; i++) {
if (D[i] <= X)
ans++;
}
cout <<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 812,529 | 812,528 | u544511937 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 1; i < N + 1; i++) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (D[i] <= X)
ans++;
}
cout... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; i++) {
if (D[i] <= X)
ans++;
}
cout <<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 812,530 | 812,528 | u544511937 | cpp |
p03000 | #include <cstdio>
#include <iostream>
using namespace std;
int n, x, pos, l;
int main() {
scanf("%d%d", &n, &x);
for (register int i = 1; i <= n; i++) {
scanf("%d", &l);
pos += l;
if (pos > x) {
cout << i - 1 << endl;
return 0;
}
}
cout << n << endl;
} | #include <cstdio>
#include <iostream>
using namespace std;
int n, x, pos, l;
int main() {
scanf("%d%d", &n, &x);
for (register int i = 1; i <= n; i++) {
scanf("%d", &l);
pos += l;
if (pos > x) {
cout << i << endl;
return 0;
}
}
cout << n + 1 << endl;
} | [
"expression.operation.binary.remove"
] | 812,555 | 812,556 | u131977721 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.