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 | /*B - Bounding*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ant = 0;
int ans = 0;
int tam, X;
int aux;
cin >> tam >> X;
vector<int> arr(tam);
for (int i = 0; i < tam; ++i)
cin >> arr[i];
if (ant <= X)
ans++;
for (int i = 1; i < tam; ++i) {
aux = ant + arr[i - 1];
if (aux <= X)
ans++;
ant = aux;
}
cout << ans;
return 0;
} | /*B - Bounding*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ant = 0;
int ans = 0;
int tam, X;
int aux;
cin >> tam >> X;
vector<int> arr(tam);
for (int i = 0; i < tam; ++i)
cin >> arr[i];
if (ant <= X)
ans++;
for (int i = 1; i <= tam; ++i) {
aux = ant + arr[i - 1];
if (aux <= X)
ans++;
ant = aux;
}
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,342 | 811,343 | u854087773 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll pow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n = n >> 1;
}
return res;
}
ll GetDiviserCount(ll N) //約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) //約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
int ans;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x;
IN(n, x);
vi l(n);
rep(i, n) IN(l[i]);
vi D(n + 1);
D[0] = 0;
ans = 1;
rep(i, n) {
D[i + 1] = D[i] + l[i];
// dump(D[i+1]);
if (D[i + 1] < x)
ans++;
}
cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll pow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n = n >> 1;
}
return res;
}
ll GetDiviserCount(ll N) //約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) //約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
int ans;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x;
IN(n, x);
vi l(n);
rep(i, n) IN(l[i]);
vi D(n + 1);
D[0] = 0;
ans = 1;
rep(i, n) {
D[i + 1] = D[i] + l[i];
if (D[i + 1] <= x)
ans++;
}
cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,346 | 811,347 | u264405855 | 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;
vector<int> D(n + 1);
D[0] = 0;
rep(i, n) {
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 << endl;
return 0;
} | #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;
vector<int> D(n + 1);
D[0] = 0;
rep(i, n) {
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 << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,348 | 811,349 | u264405855 | 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;
vector<int> D(n + 1);
D[0] = 0;
rep(i, n) {
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 << endl;
return 0;
}
| #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;
vector<int> D(n + 1);
D[0] = 0;
rep(i, n) {
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 << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,350 | 811,349 | u264405855 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, d, x, r;
int main() {
for (cin >> n >> x; i < n; i++) {
cin >> d, r += d;
if (r > x)
return cout << i + 1, 0;
}
cout << n;
} | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, d, x, r;
int main() {
for (cin >> n >> x; i < n; i++) {
cin >> d;
r += d;
if (r > x)
return cout << i + 1, 0;
}
cout << n + 1;
} | [
"expression.operation.binary.add"
] | 811,362 | 811,363 | u303621502 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(x, y) for (int i = (x); i < (y); i++)
typedef long long ll;
using namespace std;
void solve() {
int n, x;
cin >> n >> x;
int l[n];
rep(0, n) cin >> l[i];
int d[n];
d[0] = 0;
rep(1, n) { d[i] = d[i - 1] + l[i - 1]; }
int cnt = 0;
rep(0, n) {
if (d[i] <= x)
cnt++;
}
cout << cnt << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(x, y) for (int i = (x); i < (y); i++)
typedef long long ll;
using namespace std;
void solve() {
int n, x;
cin >> n >> x;
int l[n];
rep(0, n) cin >> l[i];
int d[n + 1];
d[0] = 0;
rep(1, n + 1) { d[i] = d[i - 1] + l[i - 1]; }
int cnt = 0;
rep(0, n + 1) {
if (d[i] <= x)
cnt++;
}
cout << cnt << endl;
}
int main() {
solve();
return 0;
} | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 811,364 | 811,365 | u298123314 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 0;
int sum = 0;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
sum = sum + L.at(i);
if (sum <= X) {
count = count + 1;
} else {
break;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 1;
int sum = 0;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
sum = sum + L.at(i);
if (sum <= X) {
count = count + 1;
} else {
break;
}
}
cout << count << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 811,378 | 811,379 | u028061225 | 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>;
const int INF = 1001001001;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
vector<int> j(n);
int sum = 0;
rep(i, n) {
j[i] = sum + l[i];
sum = j[i];
}
j.insert(j.begin(), 0);
int ans = 0;
rep(i, n) {
if (j[i] <= x)
ans++;
}
cout << ans << endl;
return 0;
} | #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>;
const int INF = 1001001001;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
vector<int> j(n);
int sum = 0;
rep(i, n) {
j[i] = sum + l[i];
sum = j[i];
}
j.insert(j.begin(), 0);
int ans = 0;
rep(i, n + 1) {
if (j[i] <= x)
ans++;
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 811,382 | 811,383 | u213800869 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, x;
cin >> n >> x;
vl L(n);
rep(i, n) { cin >> L[i]; }
ll d = 0;
ll i = 0;
ll cnt = 1;
while (d <= x) {
d += L[i];
if (d > x) {
break;
} else {
cnt++;
i++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, x;
cin >> n >> x;
vl L(n);
rep(i, n) { cin >> L[i]; }
ll d = 0;
ll i = 0;
ll cnt = 1;
while (d <= x && i < n) {
d += L[i];
if (d > x) {
break;
} else {
cnt++;
i++;
}
}
cout << cnt << endl;
} | [
"control_flow.loop.condition.change"
] | 811,390 | 811,391 | u328811800 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, x;
cin >> n >> x;
vl L(n);
rep(i, n) { cin >> L[i]; }
ll d = 0;
ll i = 0;
ll cnt = 0;
while (d <= x) {
d += L[i];
if (d > x) {
break;
} else {
cnt++;
i++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, x;
cin >> n >> x;
vl L(n);
rep(i, n) { cin >> L[i]; }
ll d = 0;
ll i = 0;
ll cnt = 1;
while (d <= x && i < n) {
d += L[i];
if (d > x) {
break;
} else {
cnt++;
i++;
}
}
cout << cnt << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.condition.change"
] | 811,392 | 811,391 | u328811800 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int l[300000], d[300000];
int main() {
int n, x;
cin >> n >> x;
for (int i = 1; i <= n; ++i) {
cin >> l[i];
}
d[1] = 0;
int cnt = 1;
for (int i = 2; i <= n; ++i) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] > x) {
break;
}
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int l[300000], d[300000];
int main() {
int n, x;
cin >> n >> x;
for (int i = 1; i <= n; ++i) {
cin >> l[i];
}
d[1] = 0;
int cnt = 1;
for (int i = 2; i <= n + 1; ++i) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] > x) {
break;
}
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,399 | 811,400 | u699384531 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define COUT(x) cout << (x) << endl
#define ALL(a) (a.begin()), (a.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL << 60;
const int INF = 1001001001;
const int MOD = 1000000007;
/* --------------------------------------------------- */
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L[i];
int ans = 1, cnt = 0;
rep(i, n) {
cnt += L[i];
if (cnt >= x) {
COUT(ans);
return 0;
}
ans++;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define COUT(x) cout << (x) << endl
#define ALL(a) (a.begin()), (a.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL << 60;
const int INF = 1001001001;
const int MOD = 1000000007;
/* --------------------------------------------------- */
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L[i];
int ans = 1, cnt = 0;
rep(i, n) {
cnt += L[i];
if (cnt > x) {
COUT(ans);
return 0;
}
ans++;
}
COUT(ans);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 811,412 | 811,413 | u045224675 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define COUT(x) cout << (x) << endl
#define ALL(a) (a.begin()), (a.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL << 60;
const int INF = 1001001001;
const int MOD = 1000000007;
/* --------------------------------------------------- */
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L[i];
int ans = 1, cnt = 0;
rep(i, n) {
cnt += L[i];
if (cnt > x) {
COUT(ans);
return 0;
}
ans++;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define COUT(x) cout << (x) << endl
#define ALL(a) (a.begin()), (a.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL << 60;
const int INF = 1001001001;
const int MOD = 1000000007;
/* --------------------------------------------------- */
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L[i];
int ans = 1, cnt = 0;
rep(i, n) {
cnt += L[i];
if (cnt > x) {
COUT(ans);
return 0;
}
ans++;
}
COUT(ans);
return 0;
} | [
"call.add"
] | 811,414 | 811,413 | u045224675 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int l[105];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, x, d = 0, b = 1;
cin >> n >> x;
for (int i = 1; i <= n; ++i) {
cin >> l[i];
}
while (1) {
d = d + l[b];
if (d > x)
break;
b++;
}
cout << b << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int l[105];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, x, d = 0, b = 1;
cin >> n >> x;
for (int i = 1; i <= n; ++i) {
cin >> l[i];
}
while (b < n + 1) {
d = d + l[b];
if (d > x)
break;
b++;
}
cout << b << '\n';
return 0;
} | [
"control_flow.loop.condition.change"
] | 811,415 | 811,416 | u194015723 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
int sum = 0, res = 1;
rep(i, n + 1) {
sum += sum + l[i - 1];
if (sum > x) {
cout << res << endl;
return 0;
}
res++;
}
cout << n + 1 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
int sum = 0, res = 1;
rep(i, n) {
sum = sum + l[i];
if (sum > x) {
cout << res << endl;
return 0;
}
res++;
}
cout << n + 1 << endl;
}
| [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operation.binary.remove",
"assignment.value.change"
] | 811,417 | 811,418 | u816145694 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, d = 0, c = 1;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
while (d + l[c - 1] <= x) {
d = d + l[c - 1];
c++;
}
return cout << c, 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, d = 0, c = 1;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
while (d + l[c - 1] <= x && c <= n) {
d = d + l[c - 1];
c++;
}
return cout << c, 0;
} | [
"control_flow.loop.condition.change"
] | 811,431 | 811,432 | u313970998 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 1;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1), d(n + 3);
d[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> l.at(i);
}
for (int i = 2; i <= n + 2; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
cnt++;
else
break;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 1;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1), d(n + 2);
d[1] = 0;
for (int i = 1; i <= n; i++) {
cin >> l.at(i);
}
for (int i = 2; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
cnt++;
else
break;
}
cout << cnt << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 811,435 | 811,436 | u179593519 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, bounces = 0;
cin >> n >> x;
vector<int> l(n);
vector<int> 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];
for (int i = 0; i < n + 1; i++)
if (d[i] <= x)
bounces++;
cout << bounces << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, bounces = 0;
cin >> n >> x;
vector<int> l(n);
vector<int> d(n + 1);
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)
bounces++;
cout << bounces << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,437 | 811,438 | u918865212 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, bounces = 0;
cin >> n >> x;
vector<int> l(n);
vector<int> d(n);
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)
bounces++;
cout << bounces << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, bounces = 0;
cin >> n >> x;
vector<int> l(n);
vector<int> d(n + 1);
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)
bounces++;
cout << bounces << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,439 | 811,438 | u918865212 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a;
int i = 0;
int xxx = 0;
cin >> n >> x;
vector<int> l(n);
while (i < n) {
cin >> a;
l.push_back(a);
i++;
}
i = 0;
while (xxx <= x) {
i++;
if (i <= n) {
xxx += l.at(i - 1);
} else {
break;
}
}
cout << i << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a;
int i = 0;
int xxx = 0;
cin >> n >> x;
vector<int> l;
while (i < n) {
cin >> a;
l.push_back(a);
i++;
}
i = 0;
while (xxx <= x) {
i++;
if (i <= n) {
xxx += l.at(i - 1);
} else {
break;
}
}
cout << i << endl;
return 0;
} | [] | 811,445 | 811,446 | u437779154 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
int i = 0;
int xxx = 0;
cin >> n >> x;
vector<int> l(n);
while (i < n) {
cin >> l.at(i++);
}
i = 0;
while (xxx <= x) {
i++;
if (i <= n) {
xxx += l.at(i - 1);
}
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
int i = 0;
int xxx = 0;
cin >> n >> x;
vector<int> l(n);
while (i < n) {
cin >> l.at(i++);
}
i = 0;
while (xxx <= x) {
i++;
if (i <= n) {
xxx += l.at(i - 1);
} else {
break;
}
}
cout << i << endl;
return 0;
}
| [
"control_flow.branch.else.add"
] | 811,449 | 811,448 | u437779154 | cpp |
p03000 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N, X;
cin >> N >> X;
ll L[N];
rep(i, N) cin >> L[i];
ll D[N];
ll out = 0;
rep(i, N) {
if (i == 0)
D[i] = 0;
else
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X)
out++;
}
cout << out << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N, X;
cin >> N >> X;
ll L[N];
rep(i, N) cin >> L[i];
ll D[N + 1];
ll out = 0;
rep(i, N + 1) {
if (i == 0)
D[i] = 0;
else
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X)
out++;
}
cout << out << endl;
return 0;
}
| [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 811,454 | 811,455 | u742595961 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, k = 1, n, x, l[101];
cin >> n >> x;
l[0] = 0;
for (i = 0; i < n; i++)
cin >> l[i];
int d = 0; //[x+1];
// j=0;
/*for(i=1;i<=n;i++)
{
d[i]=j;
j++;
if(j>x)
break;
}*/
// d[1]=0;
// int a[x+1];
// a[1]=0;
for (i = 0; i < n; i++) {
d = d + l[k]; // d[i]=d[i-1]+l[i-1];
// a[i]=d[i];
if (d > x)
break;
k++;
}
cout << k << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i, k = 0, n, x, l[101];
cin >> n >> x;
l[0] = 0;
for (i = 0; i < n; i++)
cin >> l[i];
int d = 0; //[x+1];
// j=0;
/*for(i=1;i<=n;i++)
{
d[i]=j;
j++;
if(j>x)
break;
}*/
// d[1]=0;
// int a[x+1];
// a[1]=0;
for (i = 0; i < n; i++) {
d = d + l[k]; // d[i]=d[i-1]+l[i-1];
// a[i]=d[i];
if (d > x)
break;
k++;
}
cout << k + 1 << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 811,458 | 811,459 | u724499479 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
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 cnt = 0;
for (int i = 0; i < n; i++) {
d = d + l[cnt];
if (d > x)
break;
cnt++;
}
cout << cnt++ << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
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 cnt = 0;
for (int i = 0; i < n; i++) {
d = d + l[cnt];
if (d > x)
break;
cnt++;
}
cnt++;
cout << cnt << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 811,460 | 811,461 | u476027087 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int now = 0, cnt = 1;
while (cin >> L)
if (now += L <= X)
cnt++;
cout << cnt << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int now = 0, cnt = 1;
while (cin >> L)
if ((now += L) <= X)
cnt++;
cout << cnt << "\n";
} | [
"control_flow.branch.if.condition.change"
] | 811,465 | 811,466 | u045289115 | cpp |
p03000 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int sum = 0;
for (int i = 0; i < n; ++i) {
if (sum + v[i] > x) {
cout << i + 1;
return 0;
}
sum += v[i];
}
cout << n;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int sum = 0;
for (int i = 0; i < n; ++i) {
if (sum + v[i] > x) {
cout << i + 1;
return 0;
}
sum += v[i];
}
cout << n + 1;
}
| [
"expression.operation.binary.add"
] | 811,475 | 811,476 | u403668916 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int d[n + 1];
d[0] = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
d[i + 1] = d[i] + x;
}
for (int i = 0; i <= n; i++) {
if (d[i] <= x)
ans++;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int d[n + 1];
d[0] = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
d[i + 1] = d[i] + a;
}
for (int i = 0; i <= n; i++) {
if (d[i] <= x) {
ans++;
}
}
cout << ans;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 811,477 | 811,478 | u581172017 | 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;
int l[n + 1];
rep(i, n + 1) cin >> l[i];
int hazumu = 1;
int sum = 0;
for (int i = 0; i <= n; i++) {
sum += l[i];
if (sum <= x) {
hazumu++;
}
}
cout << hazumu << endl;
} | #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;
int l[n + 1];
rep(i, n + 1) cin >> l[i];
int hazumu = 1;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += l[i];
if (sum <= x) {
hazumu++;
}
}
cout << hazumu << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,484 | 811,485 | u096030913 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, j = 1, k = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
k += L;
if (L <= X)
j++;
}
cout << j << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, j = 1, k = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
k += L;
if (k <= X)
j++;
}
cout << j << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,505 | 811,506 | u306482197 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int cnt = 0;
int length = 0;
for (int i = 0; i < n; i++) {
if (length <= x) {
cnt++;
}
int l;
cin >> l;
length += l;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int cnt = 0;
int length = 0;
for (int i = 0; i <= n; i++) {
if (length <= x) {
cnt++;
}
int l;
cin >> l;
length += l;
}
cout << cnt << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,533 | 811,534 | u524568016 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int inf = 1001001001;
int main() {
ll n, x, count = 0;
cin >> n >> x;
vector<ll> L(n + 2, 0);
vector<ll> D(n + 2, 0);
for (ll i = 1; i <= n + 1; i++) {
if (i == n + 1) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
break;
}
cin >> L.at(i);
D.at(i) = D.at(i - 1) + L.at(i - 1);
}
for (ll i = 1; i < n + 1; i++) {
if (D.at(i) <= x) {
count++;
}
if (D.at(i) > x) {
break;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int inf = 1001001001;
int main() {
ll n, x, count = 0;
cin >> n >> x;
vector<ll> L(n + 2, 0);
vector<ll> D(n + 2, 0);
for (ll i = 1; i <= n + 1; i++) {
if (i == n + 1) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
break;
}
cin >> L.at(i);
D.at(i) = D.at(i - 1) + L.at(i - 1);
}
for (ll i = 1; i <= n + 1; i++) {
if (D.at(i) <= x) {
count++;
}
if (D.at(i) > x) {
break;
}
}
cout << count << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,535 | 811,536 | u958873500 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3], n;
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
int main() {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int cnt = 0, d = 0;
rep(i, n) {
if (d > x) {
break;
}
cnt++;
d += l[i];
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3], n;
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
int main() {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int cnt = 0, d = 0;
rep(i, n + 1) {
if (d > x) {
break;
}
cnt++;
d += l[i];
}
cout << cnt << endl;
}
| [
"expression.operation.binary.add"
] | 811,537 | 811,538 | u218707541 | cpp |
p03000 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int sum(int n) {
if (n == 0) {
return 0;
}
int s = sum(n - 1);
return s + n;
}
int main() {
cout << fixed << setprecision(10);
int N, X;
cin >> N >> X;
vector<int> L(N), vec(N + 1);
rep(i, N) { cin >> L[i]; }
int su = 0;
rep(i, N) {
su += L[i];
vec[i + 1] = su;
}
int count = 0;
rep(i, N) {
if (vec[i] <= X) {
count++;
}
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int sum(int n) {
if (n == 0) {
return 0;
}
int s = sum(n - 1);
return s + n;
}
int main() {
cout << fixed << setprecision(10);
int N, X;
cin >> N >> X;
vector<int> L(N), vec(N + 1);
rep(i, N) { cin >> L[i]; }
int su = 0;
rep(i, N) {
su += L[i];
vec[i + 1] = su;
}
int count = 0;
rep(i, N + 1) {
if (vec[i] <= X) {
count++;
}
}
cout << count << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 811,539 | 811,540 | u705990127 | cpp |
p03000 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int l[105];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, x;
cin >> n >> x;
rep(i, n) cin >> l[i];
int d = 0;
int cnt = 0;
rep(i, n) {
d += l[i];
cnt++;
if (d > x)
break;
}
cout << cnt << ln;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int l[105];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, x;
cin >> n >> x;
rep(i, n) cin >> l[i];
int d = 0;
int cnt = 0;
rep(i, n + 1) {
d += l[i];
cnt++;
if (d > x)
break;
}
cout << cnt << ln;
return 0;
} | [
"expression.operation.binary.add"
] | 811,554 | 811,555 | u486105630 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define rep2(i, n) for (ll i = 1; i <= ll(n); i++)
//#define rep(i, k, n) for(ll i = k-1; i < ll(n); i++)
//#define rep2(i, k, n) for(ll i = k; i <= ll(n); i++)
#define all(v) (v).begin(), (v).end()
bool chmin(ll &a, ll b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
bool chmax(ll &a, ll b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll MAX = 1e9;
const char newl = '\n';
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, x;
cin >> n >> x;
vl l(n);
rep(i, n) cin >> l[i];
ll sum = 0;
rep(i, n) {
sum += l[i];
if (l[i] > x) {
cout << i + 1 << newl;
return 0;
}
}
cout << n + 1 << newl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define rep2(i, n) for (ll i = 1; i <= ll(n); i++)
//#define rep(i, k, n) for(ll i = k-1; i < ll(n); i++)
//#define rep2(i, k, n) for(ll i = k; i <= ll(n); i++)
#define all(v) (v).begin(), (v).end()
bool chmin(ll &a, ll b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
bool chmax(ll &a, ll b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll MAX = 1e9;
const char newl = '\n';
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, x;
cin >> n >> x;
vl l(n);
rep(i, n) cin >> l[i];
ll sum = 0;
rep(i, n) {
sum += l[i];
if (sum > x) {
cout << i + 1 << newl;
return 0;
}
}
cout << n + 1 << newl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 811,564 | 811,565 | u682191329 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int ans[1000010] = {-1};
int l[1000100] = {-1};
void solve(int n) {
ans[0] = 0;
REP(i, n - 1) { ans[i + 1] = ans[i] + l[i]; }
}
int main(int argc, char const *argv[]) {
int n, x;
cin >> n >> x;
REP(i, n)
cin >> l[i];
int tot = 0;
solve(n);
REP(i, n) {
if (ans[i] <= x)
tot++;
}
cout << tot << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int ans[1000010] = {-1};
int l[1000100] = {-1};
void solve(int n) {
ans[0] = 0;
REP(i, n) { ans[i + 1] = ans[i] + l[i]; }
}
int main(int argc, char const *argv[]) {
int n, x;
cin >> n >> x;
REP(i, n)
cin >> l[i];
int tot = 0;
solve(n);
REP(i, n + 1) {
if (ans[i] <= x)
tot++;
}
cout << tot << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 811,566 | 811,567 | u053035261 | cpp |
p03000 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
//#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long double ld;
typedef long long ll;
#define X first
#define Y second
#define all(o) o.begin(), o.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0)
int gcd(int x, int y) { return (!y ? x : gcd(y, x % y)); }
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
int sum = 0, ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
sum += x;
if (sum <= k)
ans++;
}
cout << ans << endl;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
//#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long double ld;
typedef long long ll;
#define X first
#define Y second
#define all(o) o.begin(), o.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0)
int gcd(int x, int y) { return (!y ? x : gcd(y, x % y)); }
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
int sum = 0, ans = 1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
sum += x;
if (sum <= k)
ans++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 811,570 | 811,571 | u211074525 | 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;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
ll cur = 0;
int bnd = 0;
rep(i, n) {
cur += a.at(i);
if (cur > x)
break;
bnd++;
}
cout << bnd << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
ll cur = 0;
int bnd = 1;
rep(i, n) {
cur += a.at(i);
if (cur <= x)
bnd++;
}
cout << bnd << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,584 | 811,585 | u062727117 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, in = 0, nu = 0;
cin >> n >> x;
vector<int> d(n);
for (int i = 1; i <= n; i++) {
cin >> d[i];
}
for (int i = 1; i <= n; i++) {
in += d[i];
if (in <= x) {
nu++;
}
}
cout << nu << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, in = 0, nu = 0;
cin >> n >> x;
vector<int> d(n);
for (int i = 1; i <= n; i++) {
cin >> d[i];
}
for (int i = 1; i <= n; i++) {
in += d[i];
if (in <= x) {
nu++;
}
}
cout << nu + 1 << endl;
}
| [
"expression.operation.binary.add"
] | 811,588 | 811,589 | u834753207 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
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);
d[0] = 0;
int key = n;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
if (d[i + 1] > x) {
key = i + 1;
break;
}
}
cout << key << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
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);
d[0] = 0;
int key = n + 1;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
if (d[i + 1] > x) {
key = i + 1;
break;
}
}
cout << key << endl;
return 0;
} | [
"assignment.change"
] | 811,592 | 811,593 | u582588783 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
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);
d[0] = 0;
int key = 0;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
if (d[i + 1] > x) {
key = i + 1;
break;
}
}
cout << key << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
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);
d[0] = 0;
int key = n + 1;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
if (d[i + 1] > x) {
key = i + 1;
break;
}
}
cout << key << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove"
] | 811,594 | 811,593 | u582588783 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N, X;
cin >> N >> X;
vector<int> list(N);
for (int i = 0; i < N; i++)
cin >> list[i];
int count = 0, now = 0;
for (int i = 0; i < N; i++) {
now = now + list[i];
if (now <= X)
count++;
}
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N, X;
cin >> N >> X;
vector<int> list(N);
for (int i = 0; i < N; i++)
cin >> list[i];
int count = 1, now = 0;
for (int i = 0; i < N; i++) {
now = now + list[i];
if (now <= X)
count++;
}
cout << count;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 811,595 | 811,596 | u058742919 | cpp |
p03000 | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, X;
scanf("%d%d", &N, &X);
vector<int> L(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &L[i]);
}
int ans = 1;
int d = 0;
for (int i = 0; i <= N; ++i) {
d = d + L[i];
if (d <= X)
++ans;
}
printf("%d", ans);
return 0;
}
| #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, X;
scanf("%d%d", &N, &X);
vector<int> L(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &L[i]);
}
int ans = 1;
int d = 0;
for (int i = 0; i < N; ++i) {
d = d + L[i];
if (d <= X)
++ans;
}
printf("%d\n", ans);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 811,605 | 811,606 | u774438048 | cpp |
p03000 | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, X;
scanf("%d%d", &N, &X);
vector<int> L(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &L[i]);
}
int ans = 1;
int d = 0;
for (int i = 0; i <= N; ++i) {
d = d + L[i];
if (d <= X)
++ans;
}
printf("%d", ans);
return 0;
}
| #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, X;
scanf("%d%d", &N, &X);
vector<int> L(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &L[i]);
}
int ans = 1;
int d = 0;
for (int i = 0; i < N; ++i) {
d = d + L[i];
if (d <= X)
++ans;
}
printf("%d", ans);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,605 | 811,607 | u774438048 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define mod 1000000007
#define size_f 100002
int main() {
int n, x;
cin >> n >> x;
ll l[x];
for (int i = 0; i < n; i++) {
int q;
cin >> q;
if (i == 0)
l[0] = q;
else
l[i] = l[i - 1] + q;
}
int c = 1;
for (int i = 0; l[i] <= x; i++)
c++;
cout << c << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define mod 1000000007
#define size_f 100002
int main() {
int n, x;
cin >> n >> x;
ll l[n];
for (int i = 0; i < n; i++) {
int q;
cin >> q;
if (i == 0)
l[0] = q;
else
l[i] = l[i - 1] + q;
}
int c = 1;
for (int i = 0; l[i] <= x; i++)
c++;
cout << c << "\n";
return 0;
}
| [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 811,615 | 811,616 | u507549471 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define mod 1000000007
#define size_f 100002
int main() {
int n, x;
cin >> n >> x;
int l[x];
for (int i = 0; i < n; i++) {
int q;
cin >> q;
if (i == 0)
l[0] = q;
else
l[i] = l[i - 1] + q;
}
int c = 1;
for (int i = 0; l[i] <= x; i++)
c++;
cout << c << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define mod 1000000007
#define size_f 100002
int main() {
int n, x;
cin >> n >> x;
ll l[n];
for (int i = 0; i < n; i++) {
int q;
cin >> q;
if (i == 0)
l[0] = q;
else
l[i] = l[i - 1] + q;
}
int c = 1;
for (int i = 0; l[i] <= x; i++)
c++;
cout << c << "\n";
return 0;
}
| [
"variable_declaration.type.change",
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 811,617 | 811,616 | u507549471 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int loc = 0;
int ans = 0;
do {
int l;
cin >> l;
loc += l;
ans++;
} while (ans < n && loc <= x);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int loc = 0;
int ans = 0;
do {
int l;
cin >> l;
loc += l;
ans++;
} while (ans <= n && loc <= x);
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,618 | 811,619 | u732578115 | cpp |
p03000 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 1;
for (int i = 2; i < n + 1; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 1;
for (int i = 2; i < n + 2; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,624 | 811,625 | u675314298 | cpp |
p03000 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 0;
for (int i = 2; i < n + 1; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 1;
for (int i = 2; i < n + 2; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,626 | 811,625 | u675314298 | cpp |
p03000 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 0;
for (int i = 1; i < n + 1; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 1;
for (int i = 2; i < n + 2; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"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.change"
] | 811,627 | 811,625 | u675314298 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
cout << i << endl;
return (0);
}
}
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
cout << i + 1 << endl;
return (0);
}
}
cout << N + 1 << endl;
} | [
"expression.operation.binary.add"
] | 811,628 | 811,629 | u711676593 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
cout << i + 1 << endl;
return (0);
}
}
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
cout << i + 1 << endl;
return (0);
}
}
cout << N + 1 << endl;
} | [
"expression.operation.binary.add"
] | 811,630 | 811,629 | u711676593 | 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 ans = 0;
int d[n + 1];
d[0] = 0;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
}
for (int i = 0; i < n; i++) {
if (d[i] > x) {
break;
}
ans++;
}
cout << ans << endl;
return 0;
}
| #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 ans = 0;
int d[n + 1];
d[0] = 0;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
}
for (int i = 0; i <= n; i++) {
if (d[i] > x) {
break;
}
ans++;
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,631 | 811,632 | u251242696 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n + 1] = {};
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
if (a[i] > x)
return cout << i, 0;
}
cout << n;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n + 1] = {};
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
if (a[i] > x)
return cout << i, 0;
}
cout << n + 1;
return 0;
}
| [
"expression.operation.binary.add"
] | 811,635 | 811,636 | u798562499 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
int cnt = 0;
while (now <= x) {
int l;
cin >> l;
now += l;
cnt++;
if (cnt == n) {
cnt++;
break;
}
}
cout << cnt << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
int cnt = 0;
while (now <= x) {
int l;
cin >> l;
now += l;
cnt++;
if (cnt == n && now <= x) {
cnt++;
break;
}
}
cout << cnt << endl;
} | [
"control_flow.branch.if.condition.change"
] | 811,639 | 811,640 | u136086822 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
int ans = 1;
int d = 0;
for (int i = 1; i < n + 1; i++) {
cin >> l[i - 1];
if (d + l[i - 1] < x) {
ans++;
}
d = d + l[i - 1];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
int ans = 1;
int d = 0;
for (int i = 1; i < n + 1; i++) {
cin >> l[i - 1];
if (d + l[i - 1] <= x) {
ans++;
}
d = d + l[i - 1];
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,641 | 811,642 | u739955570 | 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 + 1);
d.at(0) = 0;
for (int i = 1; i < n + 1; i++) {
d.at(i) = d.at(i - 1) + l.at(i - 1);
}
int cnt = 0;
for (int i = 0; i < n + 1; i++) {
if (d.at(i) < x)
cnt++;
}
cout << cnt << 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.at(i);
}
vector<int> d(n + 1);
d.at(0) = 0;
for (int i = 1; i < n + 1; i++) {
d.at(i) = d.at(i - 1) + l.at(i - 1);
}
int cnt = 0;
for (int i = 0; i < n + 1; i++) {
if (d.at(i) <= x)
cnt++;
}
cout << cnt << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,645 | 811,646 | u739095155 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
int sum = 0;
int i = 0;
while (sum <= x) {
if (i == n) {
break;
}
sum += v[i];
i++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
int sum = 0;
int i = 0;
while (sum <= x) {
if (i == n) {
i++;
break;
}
sum += v[i];
i++;
}
cout << i << endl;
} | [
"expression.unary.arithmetic.add"
] | 811,651 | 811,652 | u680574634 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0, now = 0;
for (int i = 0; i < n; i++) {
now += a[i];
if (now > x)
break;
ans++;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 1, now = 0;
for (int i = 0; i < n; i++) {
now += a[i];
if (now > x)
break;
ans++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 811,653 | 811,654 | u777394984 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#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 t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t[i] = t[i - 1] + l[i - 1];
}
int ans = n + 1;
// for(int i=0;i<n+1;i++) cout<<t[i]<<endl;
for (int i = 0; i < n + 1; i++) {
if (t[i] <= x)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#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 t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t[i] = t[i - 1] + l[i - 1];
}
int ans = 0;
// for(int i=0;i<n+1;i++) cout<<t[i]<<endl;
for (int i = 0; i < n + 1; i++) {
if (t[i] <= x)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 811,657 | 811,658 | u448922807 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#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 t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t[i] = t[i - 1] + l[i - 1];
}
int ans = 0;
// for(int i=0;i<n+1;i++) cout<<t[i]<<endl;
for (int i = 0; i < n + 1; i++) {
if (t[i] > x) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#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 t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t[i] = t[i - 1] + l[i - 1];
}
int ans = n + 1;
// for(int i=0;i<n+1;i++) cout<<t[i]<<endl;
for (int i = 0; i < n + 1; i++) {
if (t[i] > x) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove"
] | 811,659 | 811,660 | u448922807 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#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 t[n];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t[i] = t[i - 1] + l[i - 1];
}
int ans = 0;
// for(int i=0;i<n+1;i++) cout<<t[i]<<endl;
for (int i = 0; i < n + 1; i++) {
if (t[i] > x) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#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 t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t[i] = t[i - 1] + l[i - 1];
}
int ans = n + 1;
// for(int i=0;i<n+1;i++) cout<<t[i]<<endl;
for (int i = 0; i < n + 1; i++) {
if (t[i] > x) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove"
] | 811,661 | 811,660 | u448922807 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#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 ALL(n) begin(n), end(n)
#define IN(a, x, b) (a <= x && x < b)
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
template <class T> inline T CHMAX(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <class T> inline T CHMIN(T &a, const T b) {
return a = (a > b) ? b : a;
}
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
int main() {
INIT;
int N, X;
cin >> N >> X;
vector<int> L(N);
REP(i, N) { cin >> L.at(i); }
vector<int> D(N);
int ans = 0;
D.at(0) = 0;
if (D.at(0) <= X)
ans++;
FOR(i, 1, N + 1) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
if (D.at(i) <= X)
ans++;
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#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 ALL(n) begin(n), end(n)
#define IN(a, x, b) (a <= x && x < b)
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
template <class T> inline T CHMAX(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <class T> inline T CHMIN(T &a, const T b) {
return a = (a > b) ? b : a;
}
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
int main() {
INIT;
int N, X;
cin >> N >> X;
vector<int> L(N);
REP(i, N) cin >> L.at(i);
vector<int> D(N + 1);
int ans = 0;
D.at(0) = 0;
if (D.at(0) <= X)
ans++;
FOR(i, 1, N + 1) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
if (D.at(i) <= X)
ans++;
}
printf("%d\n", ans);
return 0;
} | [
"assignment.change"
] | 811,662 | 811,663 | u842897677 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#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 ALL(n) begin(n), end(n)
#define IN(a, x, b) (a <= x && x < b)
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
template <class T> inline T CHMAX(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <class T> inline T CHMIN(T &a, const T b) {
return a = (a > b) ? b : a;
}
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
int main() {
INIT;
int N, X;
cin >> N >> X;
vector<int> L(N);
REP(i, N) { cin >> L.at(i); }
vector<int> D(N);
int ans = 0;
D.at(0) = 0;
if (D.at(0) <= X)
ans++;
FOR(i, 1, N) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
if (D.at(i) <= X)
ans++;
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#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 ALL(n) begin(n), end(n)
#define IN(a, x, b) (a <= x && x < b)
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
template <class T> inline T CHMAX(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <class T> inline T CHMIN(T &a, const T b) {
return a = (a > b) ? b : a;
}
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
int main() {
INIT;
int N, X;
cin >> N >> X;
vector<int> L(N);
REP(i, N) cin >> L.at(i);
vector<int> D(N + 1);
int ans = 0;
D.at(0) = 0;
if (D.at(0) <= X)
ans++;
FOR(i, 1, N + 1) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
if (D.at(i) <= X)
ans++;
}
printf("%d\n", ans);
return 0;
} | [
"assignment.change",
"expression.operation.binary.add"
] | 811,664 | 811,663 | u842897677 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n), d(n + 1);
rep(i, n) cin >> l[i];
int cnt = 0;
rep(i, n) { d[i + 1] = d[i] + l[i]; }
rep(i, n) {
if (d[i] <= x)
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n), d(n + 1);
rep(i, n) cin >> l[i];
int cnt = 0;
rep(i, n) { d[i + 1] = d[i] + l[i]; }
rep(i, n + 1) {
if (d[i] <= x)
cnt++;
}
cout << cnt << endl;
} | [
"expression.operation.binary.add"
] | 811,667 | 811,668 | u981759938 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
int main() {
int n, x;
cin >> n >> x;
int dp[n + 1];
int l[n + 1];
int ans = 1;
for (int i = 1; i <= n; i++)
cin >> l[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + l[i - 1];
if (dp[i] <= x)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
int main() {
int n, x;
cin >> n >> x;
int dp[n + 2];
int l[n + 2];
int ans = 1;
for (int i = 1; i <= n; i++)
cin >> l[i];
dp[1] = 0;
for (int i = 2; i <= n + 1; i++) {
dp[i] = dp[i - 1] + l[i - 1];
if (dp[i] <= x)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,669 | 811,670 | u579160735 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
ll l[n];
rep(i, n) cin >> l[i];
ll now = 0, cnt = 0;
int i = 0;
while (now <= x && i < n) {
cnt++;
now += l[i];
i++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
ll l[n];
rep(i, n) cin >> l[i];
ll now = 0, cnt = 0;
int i = 0;
while (now <= x && i <= n) {
cnt++;
now += l[i];
i++;
}
cout << cnt << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 811,675 | 811,676 | u501163846 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
ll now = 0, cnt = 0;
int i = 0;
while (now <= x) {
cnt++;
now += l[i];
i++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
ll l[n];
rep(i, n) cin >> l[i];
ll now = 0, cnt = 0;
int i = 0;
while (now <= x && i <= n) {
cnt++;
now += l[i];
i++;
}
cout << cnt << endl;
} | [
"variable_declaration.type.change",
"control_flow.loop.condition.change"
] | 811,677 | 811,676 | u501163846 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
int hoge = 0;
rep(i, n) {
int foo;
cin >> foo;
now = now + foo;
hoge++;
if (x < now) {
cout << hoge << endl;
return 0;
}
}
cout << hoge << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
int hoge = 0;
rep(i, n) {
int foo;
cin >> foo;
now = now + foo;
hoge++;
if (x < now) {
cout << hoge << endl;
return 0;
}
}
cout << n + 1 << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 811,680 | 811,681 | u184929210 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define each(i, vec) for (auto i : vec)
#define cinv(n, vec) \
VL vec(n); \
for (auto &v : vec) \
cin >> v;
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#define m_t make_tuple
#define p_p(a, b) pb(m_p(a, b))
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(all(a), greater<>())
#define UNIQUE(a) a.erase(unique(all(a)), a.end())
#define SZ(a) (signed)(a.size())
#define debg(a) cout << #a << " " << a << endl;
#define debgp(a) cout << #a << " " << a.fi << " : " << a.se << endl
#define call(a) \
for (auto i : a) \
cout << i << " "; \
cout << endl
#define callp(a) \
for (auto [k, v] : a) \
cout << k << ":" << v << endl
#define show(a) \
for (cont & y : a) { \
for (cont & x : y) { \
cout << x << " "; \
} \
cout << endl; \
}
#define out(a) cout << (a) << endl
#define ENDL cout << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define fi first
#define se second
#define V vector
#define P pair
#define T tuple
#define PQ priority_queue
#define cont const auto
#define VV(type, name, y, x, a) \
vector<vector<type>> name = vector<vector<type>>(y, vector<type>(x, a))
typedef long long ll;
typedef double D;
typedef long double LD;
typedef string str;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
typedef vector<pair<ll, ll>> VP;
typedef tuple<ll, ll, ll> T3;
typedef tuple<ll, ll, ll, ll> T4;
const signed INF = (1LL << 30);
const long long MOD = (1e9 + 7);
const long long LINF = (1LL << 60);
const long long LMAX = LLONG_MAX;
void YN(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n, x;
cin >> n >> x;
cinv(n, l);
VL D(n + 1);
D[0] = 0;
reps(i, n) { D[i] = D[i - 1] + l[i - 1]; }
int sum = 0;
rep(i, n) if (D[i] <= x) sum++;
out(sum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define each(i, vec) for (auto i : vec)
#define cinv(n, vec) \
VL vec(n); \
for (auto &v : vec) \
cin >> v;
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#define m_t make_tuple
#define p_p(a, b) pb(m_p(a, b))
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(all(a), greater<>())
#define UNIQUE(a) a.erase(unique(all(a)), a.end())
#define SZ(a) (signed)(a.size())
#define debg(a) cout << #a << " " << a << endl;
#define debgp(a) cout << #a << " " << a.fi << " : " << a.se << endl
#define call(a) \
for (auto i : a) \
cout << i << " "; \
cout << endl
#define callp(a) \
for (auto [k, v] : a) \
cout << k << ":" << v << endl
#define show(a) \
for (cont & y : a) { \
for (cont & x : y) { \
cout << x << " "; \
} \
cout << endl; \
}
#define out(a) cout << (a) << endl
#define ENDL cout << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define fi first
#define se second
#define V vector
#define P pair
#define T tuple
#define PQ priority_queue
#define cont const auto
#define VV(type, name, y, x, a) \
vector<vector<type>> name = vector<vector<type>>(y, vector<type>(x, a))
typedef long long ll;
typedef double D;
typedef long double LD;
typedef string str;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
typedef vector<pair<ll, ll>> VP;
typedef tuple<ll, ll, ll> T3;
typedef tuple<ll, ll, ll, ll> T4;
const signed INF = (1LL << 30);
const long long MOD = (1e9 + 7);
const long long LINF = (1LL << 60);
const long long LMAX = LLONG_MAX;
void YN(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n, x;
cin >> n >> x;
cinv(n, l);
VL D(n + 1);
D[0] = 0;
reps(i, n) { D[i] = D[i - 1] + l[i - 1]; }
int sum = 0;
rep(i, n + 1) if (D[i] <= x) sum++;
out(sum);
return 0;
} | [
"expression.operation.binary.add"
] | 811,682 | 811,683 | u423624748 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define each(i, vec) for (auto i : vec)
#define cinv(n, vec) \
VL vec(n); \
for (auto &v : vec) \
cin >> v;
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#define m_t make_tuple
#define p_p(a, b) pb(m_p(a, b))
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(all(a), greater<>())
#define UNIQUE(a) a.erase(unique(all(a)), a.end())
#define SZ(a) (signed)(a.size())
#define debg(a) cout << #a << " " << a << endl;
#define debgp(a) cout << #a << " " << a.fi << " : " << a.se << endl
#define call(a) \
for (auto i : a) \
cout << i << " "; \
cout << endl
#define callp(a) \
for (auto [k, v] : a) \
cout << k << ":" << v << endl
#define show(a) \
for (cont & y : a) { \
for (cont & x : y) { \
cout << x << " "; \
} \
cout << endl; \
}
#define out(a) cout << (a) << endl
#define ENDL cout << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define fi first
#define se second
#define V vector
#define P pair
#define T tuple
#define PQ priority_queue
#define cont const auto
#define VV(type, name, y, x, a) \
vector<vector<type>> name = vector<vector<type>>(y, vector<type>(x, a))
typedef long long ll;
typedef double D;
typedef long double LD;
typedef string str;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
typedef vector<pair<ll, ll>> VP;
typedef tuple<ll, ll, ll> T3;
typedef tuple<ll, ll, ll, ll> T4;
const signed INF = (1LL << 30);
const long long MOD = (1e9 + 7);
const long long LINF = (1LL << 60);
const long long LMAX = LLONG_MAX;
void YN(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n, x;
cin >> n >> x;
cinv(n, l);
VL D(n);
D[0] = 0;
reps(i, n - 1) { D[i] = D[i - 1] + l[i - 1]; }
int sum = 0;
rep(i, n) if (D[i] <= x) sum++;
out(sum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define each(i, vec) for (auto i : vec)
#define cinv(n, vec) \
VL vec(n); \
for (auto &v : vec) \
cin >> v;
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#define m_t make_tuple
#define p_p(a, b) pb(m_p(a, b))
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(all(a), greater<>())
#define UNIQUE(a) a.erase(unique(all(a)), a.end())
#define SZ(a) (signed)(a.size())
#define debg(a) cout << #a << " " << a << endl;
#define debgp(a) cout << #a << " " << a.fi << " : " << a.se << endl
#define call(a) \
for (auto i : a) \
cout << i << " "; \
cout << endl
#define callp(a) \
for (auto [k, v] : a) \
cout << k << ":" << v << endl
#define show(a) \
for (cont & y : a) { \
for (cont & x : y) { \
cout << x << " "; \
} \
cout << endl; \
}
#define out(a) cout << (a) << endl
#define ENDL cout << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define fi first
#define se second
#define V vector
#define P pair
#define T tuple
#define PQ priority_queue
#define cont const auto
#define VV(type, name, y, x, a) \
vector<vector<type>> name = vector<vector<type>>(y, vector<type>(x, a))
typedef long long ll;
typedef double D;
typedef long double LD;
typedef string str;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
typedef vector<pair<ll, ll>> VP;
typedef tuple<ll, ll, ll> T3;
typedef tuple<ll, ll, ll, ll> T4;
const signed INF = (1LL << 30);
const long long MOD = (1e9 + 7);
const long long LINF = (1LL << 60);
const long long LMAX = LLONG_MAX;
void YN(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n, x;
cin >> n >> x;
cinv(n, l);
VL D(n + 1);
D[0] = 0;
reps(i, n) { D[i] = D[i - 1] + l[i - 1]; }
int sum = 0;
rep(i, n + 1) if (D[i] <= x) sum++;
out(sum);
return 0;
} | [
"expression.operation.binary.remove"
] | 811,684 | 811,683 | u423624748 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<double> Complex;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
int d = 0;
int ans = 1;
for (int i = 0; d + l[i] <= x; i++) {
d += l[i];
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<double> Complex;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
int d = 0;
int ans = 1;
for (int i = 0; i < n && d + l[i] <= x; i++) {
d += l[i];
ans++;
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change"
] | 811,685 | 811,686 | u649915042 | cpp |
p03000 | /*its_Rashid*/
#include <bits/stdc++.h>
using namespace std;
typedef double du;
typedef string st;
typedef long long ll;
typedef long double ld;
typedef long long int lli;
#define vi vector<lli>
#define loop(num) for (lli i = 0; i < num; i++)
#define loopcin(num, ar) \
for (lli i = 0; i < num; i++) { \
cin >> ar[i]; \
}
#define loopcout(num, ar) \
for (lli i = 0; i < num; i++) { \
cout << ar[i] << ' '; \
}
#define looppu(num, ar) \
for (lli i = 0; i < num; i++) { \
lli x; \
cin >> x; \
ar.push_back(x); \
}
#define loopin(num, ar) \
for (lli i = 0; i < num; i++) { \
lli x; \
cin >> x; \
ar.insert(x); \
}
#define forr(num1, num2) for (lli i = num1; i < num2; i++)
#define forrcin(num1, num2, ar) \
for (lli i = num1; i < num2; i++) { \
cin >> ar[i]; \
}
#define forrcout(num1, num2, ar) \
for (lli i = num1; i < num2; i++) { \
cout << ar[i] << ' '; \
}
#define D2forrcin(num1_1, num1_2, num2_1, num2_2, A) \
for (lli i = num1_1; i < num1_2; i++) { \
for (lli j = num2_1; j < num2_2; j++) { \
cin >> A[i][j]; \
} \
}
#define D2forrcout(num1_1, num1_2, num2_1, num2_2, A) \
for (lli i = num1_1; i < num1_2; i++) { \
for (lli j = num2_1; j < num2_2; j++) { \
cout << A[i][j] << ' '; \
} \
cout << endl; \
}
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define F first
#define S second
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
signed main() {
fastio lli n, x, sum = 0, cnt = 0;
cin >> n >> x;
n++;
lli a[n];
loop(n) {
cin >> a[i];
sum += a[i];
cnt++;
if (sum >= x)
break;
}
cout << cnt << endl;
return 0;
}
/*___________________________________________________________________functions___________________________________________________________________________*/
| /*its_Rashid*/
#include <bits/stdc++.h>
using namespace std;
typedef double du;
typedef string st;
typedef long long ll;
typedef long double ld;
typedef long long int lli;
#define vi vector<lli>
#define loop(num) for (lli i = 0; i < num; i++)
#define loopcin(num, ar) \
for (lli i = 0; i < num; i++) { \
cin >> ar[i]; \
}
#define loopcout(num, ar) \
for (lli i = 0; i < num; i++) { \
cout << ar[i] << ' '; \
}
#define looppu(num, ar) \
for (lli i = 0; i < num; i++) { \
lli x; \
cin >> x; \
ar.push_back(x); \
}
#define loopin(num, ar) \
for (lli i = 0; i < num; i++) { \
lli x; \
cin >> x; \
ar.insert(x); \
}
#define forr(num1, num2) for (lli i = num1; i < num2; i++)
#define forrcin(num1, num2, ar) \
for (lli i = num1; i < num2; i++) { \
cin >> ar[i]; \
}
#define forrcout(num1, num2, ar) \
for (lli i = num1; i < num2; i++) { \
cout << ar[i] << ' '; \
}
#define D2forrcin(num1_1, num1_2, num2_1, num2_2, A) \
for (lli i = num1_1; i < num1_2; i++) { \
for (lli j = num2_1; j < num2_2; j++) { \
cin >> A[i][j]; \
} \
}
#define D2forrcout(num1_1, num1_2, num2_1, num2_2, A) \
for (lli i = num1_1; i < num1_2; i++) { \
for (lli j = num2_1; j < num2_2; j++) { \
cout << A[i][j] << ' '; \
} \
cout << endl; \
}
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define F first
#define S second
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
signed main() {
fastio lli n, x, sum = 0, cnt = 0;
cin >> n >> x;
n++;
lli a[n];
loop(n) {
cin >> a[i];
sum += a[i];
cnt++;
if (sum > x)
break;
}
cout << cnt << endl;
return 0;
}
/*___________________________________________________________________functions___________________________________________________________________________*/
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,689 | 811,690 | u911135089 | 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 d = 0;
int cnt = 1;
for (int i = 1; i < n; ++i) {
d += l[i - 1];
if (d <= x) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #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 d = 0;
int cnt = 1;
for (int i = 1; i <= n; ++i) {
d += l[i - 1];
if (d <= x) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,692 | 811,693 | u561143568 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int curSum = 0;
int count = 0;
for (int i = 0; i < n; i++) {
curSum += a[i];
if (curSum > x)
count++;
}
cout << count;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int curSum = 0;
int count = 0;
for (int i = 0; i < n; i++) {
curSum += a[i];
if (curSum <= x)
count++;
}
cout << count + 1;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,696 | 811,697 | u964018037 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, c, ans = 1;
cin >> n >> c;
vector<int> a(n);
for (int &x : a)
cin >> x;
int now = 0;
for (int i = 0; i < n; i++)
now = now + a[i];
if (now <= c)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, c, ans = 1;
cin >> n >> c;
vector<int> a(n, 0);
for (int &x : a)
cin >> x;
int now = 0;
for (int i = 0; i < n; i++) {
now = now + a[i];
if (now <= c)
ans++;
}
cout << ans << endl;
}
| [
"call.arguments.add"
] | 811,700 | 811,701 | u508688268 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
double ki(double a) {
int su = 0;
for (int i = 1; i <= a; i++)
su += i;
return su / a;
}
int main() {
int n, x;
cin >> n >> x;
int sum = 0;
int ans;
REP(i, n) {
int a;
cin >> a;
sum += a;
if (sum > x) {
ans = i + 1;
break;
}
}
print(ans);
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
double ki(double a) {
int su = 0;
for (int i = 1; i <= a; i++)
su += i;
return su / a;
}
int main() {
int n, x;
cin >> n >> x;
int sum = 0;
int ans = n + 1;
REP(i, n) {
int a;
cin >> a;
sum += a;
if (sum > x) {
ans = i + 1;
break;
}
}
print(ans);
}
| [
"variable_declaration.value.change"
] | 811,702 | 811,703 | u832995587 | cpp |
p03000 | #include <iostream>
using namespace std;
int N, X, L[110];
int main(void) {
int i, cnt = 0;
cin >> N >> X;
for (i = 0; i < N; i++) {
cin >> L[i];
cnt += L[i];
if (X < cnt) {
cout << i + 1 << endl;
return 0;
}
}
cout << N << endl;
} | #include <iostream>
using namespace std;
int N, X, L[110];
int main(void) {
int i, cnt = 0;
cin >> N >> X;
for (i = 0; i < N; i++) {
cin >> L[i];
cnt += L[i];
if (X < cnt) {
cout << i + 1 << endl;
return 0;
}
}
cout << N + 1 << endl;
} | [
"expression.operation.binary.add"
] | 811,732 | 811,733 | u803684095 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
int ans, flag = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
D.at(i + 1) = D.at(i) + tmp;
if (D.at(i + 1) > X && flag == 0) {
ans = i + 1;
flag = 1;
}
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
int ans = N + 1, flag = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
D.at(i + 1) = D.at(i) + tmp;
if (D.at(i + 1) > X && flag == 0) {
ans = i + 1;
flag = 1;
}
}
cout << ans << endl;
} | [
"variable_declaration.value.change"
] | 811,734 | 811,735 | u227604873 | 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 answer = 1;
int distance = 0;
for (int i = 0; i <= n; ++i) {
distance += l[i];
if (distance <= x) {
answer++;
}
}
cout << answer << 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 bounds = 1;
int distance = 0;
for (int i = 0; i < n; ++i) {
distance += l[i];
if (distance <= x) {
bounds++;
}
}
cout << bounds << endl;
return 0;
} | [
"variable_declaration.name.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 811,740 | 811,741 | u442877951 | 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 boundsCount = 0;
int distance = 0;
for (int i = 0; i <= n; ++i) {
distance += l[i];
if (distance <= x) {
boundsCount++;
}
}
cout << boundsCount << 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 bounds = 1;
int distance = 0;
for (int i = 0; i < n; ++i) {
distance += l[i];
if (distance <= x) {
bounds++;
}
}
cout << bounds << endl;
return 0;
} | [
"variable_declaration.name.change",
"identifier.change",
"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",
"io.output.change"
] | 811,742 | 811,741 | u442877951 | 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 boundsCount = 1;
int distance = 0;
for (int i = 0; i <= n; ++i) {
distance += l[i];
if (distance <= x) {
boundsCount++;
}
}
cout << boundsCount << 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 bounds = 1;
int distance = 0;
for (int i = 0; i < n; ++i) {
distance += l[i];
if (distance <= x) {
bounds++;
}
}
cout << bounds << endl;
return 0;
} | [
"variable_declaration.name.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 811,743 | 811,741 | u442877951 | cpp |
p03000 | #include <iostream>
#include <vector>
int main() {
long n, x;
std::cin >> n >> x;
std::vector<int> l;
int temp;
while (std::cin >> temp)
l.push_back(temp);
long cnt = 0;
long bound = 0;
for (int i = 0; bound <= x && cnt <= n + 1; ++i, ++cnt)
bound = bound + l[i];
std::cout << cnt << std::endl;
return 0;
}
| #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> l;
int temp;
while (std::cin >> temp)
l.push_back(temp);
int cnt = 0;
long bound = 0;
for (int i = 0; bound <= x && cnt < n + 1; ++i, ++cnt)
bound = bound + l[i];
std::cout << cnt << std::endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,744 | 811,745 | u864752370 | cpp |
p03000 | #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> l;
int temp;
while (std::cin >> temp)
l.push_back(temp);
int cnt = 0;
long bound = 0;
for (int i = 0; bound <= x; ++i, ++cnt)
bound = bound + l[i];
std::cout << cnt << std::endl;
return 0;
} | #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> l;
int temp;
while (std::cin >> temp)
l.push_back(temp);
int cnt = 0;
long bound = 0;
for (int i = 0; bound <= x && cnt < n + 1; ++i, ++cnt)
bound = bound + l[i];
std::cout << cnt << std::endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 811,746 | 811,745 | u864752370 | cpp |
p03000 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 10, M = 5e5 + 10, MOD = 1e9 + 7;
const int OO = 0x3f3f3f3f;
const double EPS = 1e-3;
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#define rloop(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define range(i, a, b) for (int i = int(a); i <= int(b); i++)
#define ALL(v) ((v).begin()), ((v).end())
#define SZ(v) ((int)((v).size()))
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1}; // 4 Direction
// int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
// int dx[]={2,1,-1,-2,-2,-1,1,2};int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight
// Direction int dx[6]={2,1,-1,-2,-1,1};int dy[6]={0,1,1,0,-1,-1}; //Hexagonal
// Direction freopen("input.txt", "r", stdin); freopen("output.txt", "w",
// stdout);
int n, x, dis[N];
int main() {
// ios_base::sync_with_stdio(0);
// cin.tie(0);cout.tie(0);
cin >> n >> x;
// vi a(n+1);
for (int i = 1; i <= n; ++i) {
cin >> x;
dis[i] = dis[i - 1] + x;
}
int cnt = 0;
for (int i = 0; i <= n; ++i) {
if (dis[i] <= x)
cnt++;
}
cout << cnt << "\n";
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 10, M = 5e5 + 10, MOD = 1e9 + 7;
const int OO = 0x3f3f3f3f;
const double EPS = 1e-3;
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#define rloop(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define range(i, a, b) for (int i = int(a); i <= int(b); i++)
#define ALL(v) ((v).begin()), ((v).end())
#define SZ(v) ((int)((v).size()))
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1}; // 4 Direction
// int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
// int dx[]={2,1,-1,-2,-2,-1,1,2};int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight
// Direction int dx[6]={2,1,-1,-2,-1,1};int dy[6]={0,1,1,0,-1,-1}; //Hexagonal
// Direction freopen("input.txt", "r", stdin); freopen("output.txt", "w",
// stdout);
int n, x, dis[N], a;
int main() {
// ios_base::sync_with_stdio(0);
// cin.tie(0);cout.tie(0);
cin >> n >> x;
// vi a(n+1);
for (int i = 1; i <= n; ++i) {
cin >> a;
dis[i] = dis[i - 1] + a;
}
int cnt = 0;
for (int i = 0; i <= n; ++i) {
if (dis[i] <= x)
cnt++;
}
cout << cnt << "\n";
return 0;
}
| [
"variable_declaration.add",
"identifier.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 811,758 | 811,759 | u551374420 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
cnt += l;
if (l <= x)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
cnt += l;
if (cnt <= x)
ans++;
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,762 | 811,763 | u113298224 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n + 1; i++) {
int l;
cin >> l;
cnt += l;
if (l <= x)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
cnt += l;
if (cnt <= x)
ans++;
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,764 | 811,763 | u113298224 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, x, a, now = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
ll a;
now += a;
if (now <= x)
ans++;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, x, a, now = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> a;
now += a;
if (now <= x)
ans++;
}
cout << ans;
return 0;
}
| [] | 811,803 | 811,804 | u774202056 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, p = 0;
cin >> a >> b;
int ans = 1;
for (int i = 0; i <= a; i++) {
int t;
cin >> t;
p += t;
if (p <= b)
ans++;
}
cout << p << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, p = 0;
cin >> a >> b;
int ans = 1;
for (int i = 0; i < a; i++) {
int t;
cin >> t;
p += t;
if (p <= b)
ans++;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 811,813 | 811,814 | u729337236 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> vec(n);
int ans = 0;
int d = 0;
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; d <= m; i++) {
ans++;
if (ans == n)
break;
d += vec.at(i);
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> vec(n);
int ans = 0;
int d = 0;
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; d <= m; i++) {
ans++;
if (ans == n + 1)
break;
d += vec.at(i);
}
cout << ans;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,815 | 811,816 | u260907804 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, X;
cin >> N >> X;
vector<int> L(N), D(N);
rep(i, N) cin >> L[i];
D[0] = 0;
int cnt = 1;
rep(i, N - 1) {
D[i + 1] = D[i] + L[i];
if (D[i + 1] <= X)
cnt++;
}
cout << cnt;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, X;
cin >> N >> X;
vector<int> L(N), D(N + 1);
rep(i, N) cin >> L[i];
D[0] = 0;
int cnt = 1;
rep(i, N) {
D[i + 1] = D[i] + L[i];
if (D[i + 1] <= X)
cnt++;
}
cout << cnt;
} | [
"expression.operation.binary.remove"
] | 811,817 | 811,818 | u697090185 | cpp |
p03000 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define sa(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define scan() \
int n; \
cin >> n; \
int a[n]; \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define print(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << ' '
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, x;
cin >> n >> x;
ll a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll d[n];
d[0] = 0;
ll ans = 1;
for (ll i = 1; i < n; i++) {
d[i] = d[i - 1] + a[i - 1];
if (d[i] <= x)
ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define sa(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define scan() \
int n; \
cin >> n; \
int a[n]; \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define print(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << ' '
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, x;
cin >> n >> x;
ll a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll d[n];
d[0] = 0;
ll ans = 1;
for (ll i = 1; i <= n; i++) {
d[i] = d[i - 1] + a[i - 1];
if (d[i] <= x)
ans++;
}
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,823 | 811,824 | u083041127 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 200010;
const ll mod = 1e9 + 7;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(110, 0);
rep(i, n) { cin >> l[i]; }
int d = 0, ans = 0;
while (x >= d && ans < 105) {
d += l[ans];
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 200010;
const ll mod = 1e9 + 7;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(110, 0);
rep(i, n) { cin >> l[i]; }
int d = 0, ans = 0;
while (x >= d && ans < n + 1) {
d += l[ans];
ans++;
}
cout << ans << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 811,829 | 811,830 | u980909653 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
long long N, X, L[101], i, d = 0, ans = 1;
cin >> N >> X;
for (i = 1; i <= N; i++) {
cin >> L[i];
}
for (i = 2; i <= N + 1; i++) {
d += L[i];
if (d <= X) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
long long N, X, L[101], i, d = 0, ans = 1;
cin >> N >> X;
for (i = 1; i <= N; i++) {
cin >> L[i];
}
for (i = 2; i <= N + 1; i++) {
d += L[i - 1];
if (d <= X) {
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 811,831 | 811,832 | u246639932 | cpp |
p03000 | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
LL D[10005];
LL L[10005];
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
LL n, x;
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> L[i];
}
LL ans = 0;
for (int i = 1; i <= n; i++) {
// cout << "Current i: " << i << '\n';
D[i] = D[i - 1] + L[i - 1];
// cout << "current D[i]: " << D[i] << '\n';
if (D[i] <= x) {
ans++;
// cout << "Current ans: " << ans << '\n';
}
}
cout << ans << '\n';
return 0;
}
| /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
LL D[10005];
LL L[10005];
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
LL n, x;
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> L[i];
}
LL ans = 0;
for (int i = 1; i <= n + 1; i++) {
// cout << "Current i: " << i << '\n';
D[i] = D[i - 1] + L[i - 1];
// cout << "current D[i]: " << D[i] << '\n';
if (D[i] <= x) {
ans++;
// cout << "Current ans: " << ans << '\n';
}
}
cout << ans << '\n';
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,854 | 811,855 | u506295831 | 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;
int ans = 1;
int w = 0;
rep(i, n) {
int r;
cin >> r;
w += r;
if (ans <= x)
ans++;
}
cout << ans << endl;
}
| #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;
int ans = 1;
int w = 0;
rep(i, n) {
int r;
cin >> r;
w += r;
if (w <= x)
ans++;
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,866 | 811,867 | u525560003 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility> // for pair
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep4(i, start, end, step) for (int i = (start); i < (end); i += (step))
#define BIG_PRIME 1000000007
#define BP_remainder(x) ((x) % BIG_PRIME)
#define INF 0x3fffFFFF
#define INF_NEG (INF * -1)
#define INF_LONG (INF << 32)
#define INF_LONG_NEG (INF_LONG * -1L)
typedef long long ll;
typedef pair<ll, ll> lpair;
typedef char str255[256];
// char *用、strlen の ll 版
ll StrLen(char *s) {
for (ll ptr = 0L;; ++ptr)
if (!s[ptr])
return ptr;
}
// char * の後ろから n 文字削除, 削除後の文字数を返す
ll StrDel(char *s, int n) {
ll l = StrLen(s);
s[l - n + 1L] = '\0';
return l - n;
}
// 正の整数の桁数
ll NumDigits(ll l) {
char s[30];
sprintf(s, "%lld", l);
return StrLen(s);
}
int isFirst = 1;
template <class T> void print(T t) {
if (isFirst)
cout << t, isFirst = 0;
else
cout << " " << t;
}
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
ll gcd(ll a, ll b) {
if (a % b)
return (gcd(b, a % b));
else
return b;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
signed main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int ans = 1;
int D = 0;
rep1(i, N) {
D += L[i - 1];
if (D > X)
break;
++ans;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility> // for pair
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep4(i, start, end, step) for (int i = (start); i < (end); i += (step))
#define BIG_PRIME 1000000007
#define BP_remainder(x) ((x) % BIG_PRIME)
#define INF 0x3fffFFFF
#define INF_NEG (INF * -1)
#define INF_LONG (INF << 32)
#define INF_LONG_NEG (INF_LONG * -1L)
typedef long long ll;
typedef pair<ll, ll> lpair;
typedef char str255[256];
// char *用、strlen の ll 版
ll StrLen(char *s) {
for (ll ptr = 0L;; ++ptr)
if (!s[ptr])
return ptr;
}
// char * の後ろから n 文字削除, 削除後の文字数を返す
ll StrDel(char *s, int n) {
ll l = StrLen(s);
s[l - n + 1L] = '\0';
return l - n;
}
// 正の整数の桁数
ll NumDigits(ll l) {
char s[30];
sprintf(s, "%lld", l);
return StrLen(s);
}
int isFirst = 1;
template <class T> void print(T t) {
if (isFirst)
cout << t, isFirst = 0;
else
cout << " " << t;
}
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
ll gcd(ll a, ll b) {
if (a % b)
return (gcd(b, a % b));
else
return b;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
signed main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int ans = 1;
int D = 0;
rep(i, N) {
D += L[i];
if (D > X)
break;
++ans;
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"expression.operation.binary.remove"
] | 811,871 | 811,872 | u799164835 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define mod 1000000007
#define fi first
#define se second
#define endl '\n'
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
ll n, k;
cin >> n >> k;
ll arr[n], i, j;
for (i = 0; i < n; i++) {
cin >> arr[i];
}
ll d[n] = {0};
for (i = 1; i < n; i++) {
d[i] = d[i - 1] + arr[i - 1];
}
ll ans = 0;
for (i = 0; i < n; i++) {
if (d[i] <= k) {
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define mod 1000000007
#define fi first
#define se second
#define endl '\n'
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
ll n, k;
cin >> n >> k;
ll arr[n], i, j;
for (i = 0; i < n; i++) {
cin >> arr[i];
}
ll d[n + 1] = {0};
for (i = 1; i <= n; i++) {
d[i] = d[i - 1] + arr[i - 1];
}
ll ans = 0;
for (i = 0; i <= n; i++) {
if (d[i] <= k) {
ans++;
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,873 | 811,874 | u015580732 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
ll n, x;
cin >> n >> x;
ll ans = 1;
ll l;
ll d = 0;
for (int i = 0; i < n; i++) {
cin >> l;
d += l;
if (d <= x) {
ans++;
break;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
ll n, x;
cin >> n >> x;
ll ans = 1;
ll l;
ll d = 0;
for (int i = 0; i < n; i++) {
cin >> l;
d += l;
if (d <= x) {
ans++;
} else {
break;
}
}
cout << ans << endl;
} | [
"control_flow.branch.else.add"
] | 811,875 | 811,876 | u880221923 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define repb(bit, n, init) for (ll bit = init; bit < (1 << n); ++bit)
int main() {
ll N, X, tmp, cnt = 0, dst = 0;
cin >> N >> X;
repi(i, N, 0) {
cin >> tmp;
dst += tmp;
cnt++;
if (dst > X) {
cout << cnt << endl;
return 0;
}
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define repb(bit, n, init) for (ll bit = init; bit < (1 << n); ++bit)
int main() {
ll N, X, tmp, cnt = 0, dst = 0;
cin >> N >> X;
repi(i, N, 0) {
cin >> tmp;
dst += tmp;
cnt++;
if (dst > X) {
cout << cnt << endl;
return 0;
}
}
cout << ++cnt << endl;
return 0;
} | [] | 811,877 | 811,878 | u187013893 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.