problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p03000 | #include <iostream>
using namespace std;
int main(void) {
int N, X;
int res = 1;
cin >> N >> X;
int L[100];
int D[100] = {0};
for (int i = 0; i < N; i++) {
cin >> L[i];
D[i + 1] = D[i] + L[i];
if (D[i + 1] <= X) {
++res;
cout << res << endl;
}
}
} | #include <iostream>
using namespace std;
int main(void) {
int N, X;
int res = 1;
cin >> N >> X;
int L[100];
int D[100] = {0};
for (int i = 0; i < N; i++) {
cin >> L[i];
D[i + 1] = D[i] + L[i];
if (D[i + 1] <= X) {
++res;
}
}
cout << res << endl;
}
| [] | 813,059 | 813,060 | u698598617 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, X;
cin >> N >> X;
vector<ll> L(N);
L[0] = 0;
for (ll i = 1; i < N; i++)
cin >> L[i];
ll cnt = 0, position = 0;
for (ll i = 0; i < N; i++) {
position += L[i];
if (position <= X)
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, X;
cin >> N >> X;
vector<ll> L(N + 1);
L[0] = 0;
for (ll i = 1; i <= N; i++)
cin >> L[i];
ll cnt = 0, position = 0;
for (ll i = 0; i <= N; i++) {
position += L[i];
if (position <= X)
cnt++;
}
cout << cnt << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,069 | 813,070 | u530497183 | cpp |
p03000 | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s.order_of_key(x); // gives order of x in the set
#define For(i, x, n) for (long long i = x; i < n; i++)
#define rFor(i, x, n) for (long long i = x; i >= n; i--)
#define itFor(it, st) for (auto it = st.begin(); it != st.end(); it++)
#define MOD 1000000007
#define PI 3.141592653589793
#define INF 999999999999999999
#define N 1000005
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sp " "
#define cont continue
#define brk break
#define deb1(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define deb3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define deb4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define deb6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
using namespace std;
void setprime(ll n = 15000002);
ll choose(ll n, ll k);
void showArray(ll a[], ll n);
ll gcd(ll a, ll b);
ld len(ld x1, ld y1, ld x2, ld y2);
ld gcd_ld(ld x, ld y);
ll power(ll x, ll n);
ll power1(ll x, ll n);
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed;
cout << setprecision(3);
srand(time(NULL));
ll n, x;
cin >> n >> x;
ll a[n];
For(i, 0, n) cin >> a[i];
ll cnt = 0;
ll cur = 0;
ll last = 0;
For(i, 0, n) {
ll tmp = last + a[i];
if (tmp <= x)
cnt++;
else
break;
}
cout << cnt;
// cout<<"\nTime used =
// "<<static_cast<double>(clock())/(CLOCKS_PER_SEC)<<"s"<<endl; // - for
// checking time used for a test case
return 0;
}
// s1.substr(1,3) - return 3 characters starting from position 1 as substring of
// string sz1. eg sz1="shreynumh" sz1.substr(2,5)="reyan" num = atoi(s.c_str());
// //convert string s to integer num n.erase(i,std::string::npos); //erase i th
// position in string n , decreasing string size s.find(b)!= std::string::npos -
// finds string b in string a - true if found cout<<"Time used =
// "<<static_cast<double>(clock())/(CLOCKS_PER_SEC)<<"s"<<endl; // - for
// checking time used for a test case
void setprime(ll isprime[], ll n, ll cc = 0) {
isprime[1] = 1;
map<ll, ll> hm;
ll i;
for (i = 2; i * i <= 15000002; i++)
if (isprime[i] == 0) {
for (ll j = 2 * i; j <= 15000001; j += i)
if (isprime[j] == 0)
isprime[j] = i;
isprime[i] = i;
hm[i] = cc;
cc++;
}
for (; i < 15000002; i++)
if (isprime[i] == 0)
isprime[i] = i, hm[i] = cc, cc++;
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
void showArray(ll a[], ll n) {
For(i, 0, n) { cout << a[i] << " "; }
cout << endl;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ld len(ld x1, ld y1, ld x2, ld y2) {
return sqrt(pow((x1 - x2), 2) + pow((y1 - y2), 2));
}
ld gcd_ld(ld x, ld y) {
ld eps = 0.0001;
while (fabs(x) > eps && fabs(y) > eps) {
if (x > y)
x -= floor(x / y) * y;
else
y -= floor(y / x) * x;
}
return x + y;
}
ll power(ll x, ll n) {
if (n == 0)
return 1;
else if (n % 2 == 0) // n is even
return (power((x * x) % MOD, n / 2)) % MOD;
else // n is bal
return (x * power((x * x) % MOD, (n - 1) / 2)) % MOD;
}
ll power1(ll x, ll n) {
ll num = 1;
For(i, 0, n) { num = (num * x) % MOD; }
return num;
} | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s.order_of_key(x); // gives order of x in the set
#define For(i, x, n) for (long long i = x; i < n; i++)
#define rFor(i, x, n) for (long long i = x; i >= n; i--)
#define itFor(it, st) for (auto it = st.begin(); it != st.end(); it++)
#define MOD 1000000007
#define PI 3.141592653589793
#define INF 999999999999999999
#define N 1000005
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sp " "
#define cont continue
#define brk break
#define deb1(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define deb3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define deb4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define deb6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
using namespace std;
void setprime(ll n = 15000002);
ll choose(ll n, ll k);
void showArray(ll a[], ll n);
ll gcd(ll a, ll b);
ld len(ld x1, ld y1, ld x2, ld y2);
ld gcd_ld(ld x, ld y);
ll power(ll x, ll n);
ll power1(ll x, ll n);
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed;
cout << setprecision(3);
srand(time(NULL));
ll n, x;
cin >> n >> x;
ll a[n];
For(i, 0, n) cin >> a[i];
ll cnt = 1;
ll cur = 0;
ll last = 0;
For(i, 0, n) {
ll tmp = last + a[i];
last = tmp;
if (tmp <= x)
cnt++;
else
break;
}
cout << cnt;
// cout<<"\nTime used =
// "<<static_cast<double>(clock())/(CLOCKS_PER_SEC)<<"s"<<endl; // - for
// checking time used for a test case
return 0;
}
// s1.substr(1,3) - return 3 characters starting from position 1 as substring of
// string sz1. eg sz1="shreynumh" sz1.substr(2,5)="reyan" num = atoi(s.c_str());
// //convert string s to integer num n.erase(i,std::string::npos); //erase i th
// position in string n , decreasing string size s.find(b)!= std::string::npos -
// finds string b in string a - true if found cout<<"Time used =
// "<<static_cast<double>(clock())/(CLOCKS_PER_SEC)<<"s"<<endl; // - for
// checking time used for a test case
void setprime(ll isprime[], ll n, ll cc = 0) {
isprime[1] = 1;
map<ll, ll> hm;
ll i;
for (i = 2; i * i <= 15000002; i++)
if (isprime[i] == 0) {
for (ll j = 2 * i; j <= 15000001; j += i)
if (isprime[j] == 0)
isprime[j] = i;
isprime[i] = i;
hm[i] = cc;
cc++;
}
for (; i < 15000002; i++)
if (isprime[i] == 0)
isprime[i] = i, hm[i] = cc, cc++;
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
void showArray(ll a[], ll n) {
For(i, 0, n) { cout << a[i] << " "; }
cout << endl;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ld len(ld x1, ld y1, ld x2, ld y2) {
return sqrt(pow((x1 - x2), 2) + pow((y1 - y2), 2));
}
ld gcd_ld(ld x, ld y) {
ld eps = 0.0001;
while (fabs(x) > eps && fabs(y) > eps) {
if (x > y)
x -= floor(x / y) * y;
else
y -= floor(y / x) * x;
}
return x + y;
}
ll power(ll x, ll n) {
if (n == 0)
return 1;
else if (n % 2 == 0) // n is even
return (power((x * x) % MOD, n / 2)) % MOD;
else // n is bal
return (x * power((x * x) % MOD, (n - 1) / 2)) % MOD;
}
ll power1(ll x, ll n) {
ll num = 1;
For(i, 0, n) { num = (num * x) % MOD; }
return num;
} | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.add"
] | 813,090 | 813,091 | u375267383 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L.at(0) = 0;
for (int i = 1; i < N + 1; i++) {
cin >> L.at(i);
}
int count = 0;
int sumD = 0;
for (int j = 1; j < N + 1; j++) {
count++;
sumD += L.at(j);
if (sumD > X) {
cout << count << endl;
return 0;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L.at(0) = 0;
for (int i = 1; i < N + 1; i++) {
cin >> L.at(i);
}
int count = 0;
int sumD = 0;
for (int j = 1; j < N + 1; j++) {
count++;
sumD += L.at(j);
if (sumD > X) {
cout << count << endl;
return 0;
}
}
count++;
cout << count << endl;
} | [
"expression.unary.arithmetic.add"
] | 813,092 | 813,093 | u802997491 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, k, sum = 0, ans = 1;
cin >> n >> x;
for (int i = 1; i < n; i++) {
cin >> k;
sum += k;
if (sum <= x)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, k, sum = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> k;
sum += k;
if (sum <= x)
ans++;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 813,100 | 813,101 | u396071074 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
D = D + L[i];
if (D > X) {
ans = i + 1;
break;
}
}
cout << (ans == 0 ? N : ans) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
D = D + L[i];
if (D > X) {
ans = i + 1;
break;
}
}
cout << (ans == 0 ? N + 1 : ans) << endl;
} | [
"expression.operation.binary.add"
] | 813,110 | 813,111 | u945359338 | cpp |
p03000 | #include <iostream>
int main(void) {
int N;
int X;
int L;
int D = 0;
int count = 0;
std::cin >> N >> X;
while ((count < N) && (D <= X)) {
count++;
std::cin >> L;
D += L;
}
std::cout << count;
return 0;
}
| #include <iostream>
int main(void) {
int N;
int X;
int L;
int D = 0;
int count = 0;
std::cin >> N >> X;
while ((count <= N) && (D <= X)) {
count++;
std::cin >> L;
D += L;
}
std::cout << count;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 813,112 | 813,113 | u459819918 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
int count = 1;
vector<int> D(N + 1);
for (int j = 1; j < N + 1; j++) {
D.at(j) = D.at(j - 1) + L.at(j - 1);
if (D.at(j) < X) {
count++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
int count = 1;
vector<int> D(N + 1);
for (int j = 1; j < N + 1; j++) {
D.at(j) = D.at(j - 1) + L.at(j - 1);
if (D.at(j) <= X) {
count++;
}
}
cout << count << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,114 | 813,115 | u521975232 | cpp |
p03000 | #include <stdio.h>
int main(void) {
int n, x, i;
int j = 0;
scanf("%d %d", &n, &x);
int l[n], r[n + 1];
r[0] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
r[i + 1] = r[i] + l[i];
}
for (i = 0; i <= n; i++) {
if (x >= r[i]) {
j + j + 1;
}
}
printf("%d", j);
} | #include <stdio.h>
int main(void) {
int n, x, i;
int j = 0;
scanf("%d %d", &n, &x);
int l[n], r[n + 1];
r[0] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
r[i + 1] = r[i] + l[i];
}
for (i = 0; i <= n; i++) {
if (x >= r[i]) {
j = j + 1;
}
}
printf("%d", j);
}
| [
"expression.operation.binary.change"
] | 813,118 | 813,119 | u222643545 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
using namespace std;
signed main() {
int a, n, x;
cin >> n >> x;
int ans = 1, m = 0;
for (int i = 0; i < n; i++) {
cin >> a;
m += a;
ans += (m <= a);
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
using namespace std;
signed main() {
int a, n, x;
cin >> n >> x;
int ans = 1, m = 0;
for (int i = 0; i < n; i++) {
cin >> a;
m += a;
ans += (m <= x);
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 813,122 | 813,123 | u141968173 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef map<int, int> mint;
typedef map<ll, ll> mll;
typedef set<int> si;
typedef set<ll> sll;
typedef si ::iterator sitr;
typedef si ::reverse_iterator rsitr;
typedef sll ::iterator sltr;
typedef sll ::reverse_iterator rsltr;
#define mset multiset
typedef mset<int> msi;
typedef mset<ll> msll;
typedef msi ::iterator msitr;
typedef msi ::reverse_iterator msritr;
typedef msll ::iterator msltr;
typedef msll ::reverse_iterator mslritr;
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define fs first.second
#define ss second.second
#define ff first.first
#define sf second.first
#define newl '\n'
char to_upper(char x) {
if (97 <= int(x) && int(x) <= 126)
return char(x - 32);
else if (65 <= int(x) && int(x) <= 90)
return x;
}
char to_lower(char x) {
if (97 <= int(x) && int(x) <= 126)
return x;
else if (65 <= int(x) && int(x) <= 90)
return char(x + 32);
}
int numerize(char x) {
if (48 <= int(x) && int(x) <= 57)
return int(x - '0');
else if (97 <= int(x) && int(x) <= 126)
return int(x - 96);
else if (65 <= int(x) && int(x) <= 90)
return int(x - 64);
}
// void IO(){
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
//}
// end of Template
int d[200], l[200], n, x, ans;
int main() {
// IO();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> l[i];
for (int i = 1; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x) {
ans++;
}
}
cout << ans << newl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef map<int, int> mint;
typedef map<ll, ll> mll;
typedef set<int> si;
typedef set<ll> sll;
typedef si ::iterator sitr;
typedef si ::reverse_iterator rsitr;
typedef sll ::iterator sltr;
typedef sll ::reverse_iterator rsltr;
#define mset multiset
typedef mset<int> msi;
typedef mset<ll> msll;
typedef msi ::iterator msitr;
typedef msi ::reverse_iterator msritr;
typedef msll ::iterator msltr;
typedef msll ::reverse_iterator mslritr;
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define fs first.second
#define ss second.second
#define ff first.first
#define sf second.first
#define newl '\n'
char to_upper(char x) {
if (97 <= int(x) && int(x) <= 126)
return char(x - 32);
else if (65 <= int(x) && int(x) <= 90)
return x;
}
char to_lower(char x) {
if (97 <= int(x) && int(x) <= 126)
return x;
else if (65 <= int(x) && int(x) <= 90)
return char(x + 32);
}
int numerize(char x) {
if (48 <= int(x) && int(x) <= 57)
return int(x - '0');
else if (97 <= int(x) && int(x) <= 126)
return int(x - 96);
else if (65 <= int(x) && int(x) <= 90)
return int(x - 64);
}
// void IO(){
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
//}
// end of Template
int d[200], l[200], n, x, ans;
int main() {
// IO();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> l[i];
for (int i = 1; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x) {
ans++;
} else
break;
}
cout << ans << newl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 813,124 | 813,125 | u337775536 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define llrep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define llRep(i, n) for (ll i = 1; i <= (ll)(n); i++)
using namespace std;
struct Point {
int x, y;
};
bool vector_finder(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return true;
} else { // 発見できなかったとき
return false;
}
}
ll factorial(ll N) {
ll ans = 1;
llRep(i, N) { ans *= i; }
return ans;
}
ll extended_factorial(ll N) {
ll ans = 1;
llRep(i, N) {
ans *= i;
ans %= (ll)(1e9 + 7);
}
return ans;
}
vector<ll> Eratosthenes(ll N) {
bool arr[N + 1];
// initialization
arr[0] = false;
arr[1] = false;
for (ll i = 2; i < N + 1; i++) {
arr[i] = true;
}
// eratosthenes
for (ll i = 2; i <= sqrt(N); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) <= N; j++) {
arr[i * (j + 2)] = false; // not prime number
}
}
}
vector<ll> prime;
llRep(i, N) {
if (arr[i] == true) {
prime.push_back(i);
}
}
return prime;
}
char alphabet[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
// 二分探索
// llrep(i,N){
// b = B[i];
// auto cntA = lower_bound(A.begin(), A.end(),
// b);//イテレータなのでそのままllに変換とかはできない auto cntC =
// upper_bound(C.begin(), C.end(), b); ll cntA_ll = distance(A.begin(),
// cntA); ll cntC_ll = C.size() - distance(C.begin(), cntC); cnt += (cntA_ll
// * cntC_ll);
// }
int L[102];
int main() {
int N, X, l, sum = 0, cnt = 1;
cin >> N >> X;
rep(i, N) {
cin >> l;
sum += l;
if (sum <= X) {
cnt++;
} else {
cout << cnt << endl;
return 0;
}
}
cout << N << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define llrep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define llRep(i, n) for (ll i = 1; i <= (ll)(n); i++)
using namespace std;
struct Point {
int x, y;
};
bool vector_finder(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return true;
} else { // 発見できなかったとき
return false;
}
}
ll factorial(ll N) {
ll ans = 1;
llRep(i, N) { ans *= i; }
return ans;
}
ll extended_factorial(ll N) {
ll ans = 1;
llRep(i, N) {
ans *= i;
ans %= (ll)(1e9 + 7);
}
return ans;
}
vector<ll> Eratosthenes(ll N) {
bool arr[N + 1];
// initialization
arr[0] = false;
arr[1] = false;
for (ll i = 2; i < N + 1; i++) {
arr[i] = true;
}
// eratosthenes
for (ll i = 2; i <= sqrt(N); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) <= N; j++) {
arr[i * (j + 2)] = false; // not prime number
}
}
}
vector<ll> prime;
llRep(i, N) {
if (arr[i] == true) {
prime.push_back(i);
}
}
return prime;
}
char alphabet[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
// 二分探索
// llrep(i,N){
// b = B[i];
// auto cntA = lower_bound(A.begin(), A.end(),
// b);//イテレータなのでそのままllに変換とかはできない auto cntC =
// upper_bound(C.begin(), C.end(), b); ll cntA_ll = distance(A.begin(),
// cntA); ll cntC_ll = C.size() - distance(C.begin(), cntC); cnt += (cntA_ll
// * cntC_ll);
// }
int L[102];
int main() {
int N, X, l, sum = 0, cnt = 1;
cin >> N >> X;
rep(i, N) {
cin >> l;
sum += l;
if (sum <= X) {
cnt++;
} else {
cout << cnt << endl;
return 0;
}
}
cout << cnt << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 813,128 | 813,129 | u981890679 | cpp |
p03000 | /**
AUTHOR:Jun_SH
TIME:2019/6/16
PROBLEM:ABC130_b
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll l[105];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, x;
cin >> n >> x;
for (ll i = 1; i <= n; ++i) {
cin >> l[i];
}
ll sum = 0;
ll ans = 0;
ll tot = 1;
while (sum <= x && tot <= n) {
ans++;
sum += l[tot++];
}
cout << ans << endl;
}
| /**
AUTHOR:Jun_SH
TIME:2019/6/16
PROBLEM:ABC130_b
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll l[105];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, x;
cin >> n >> x;
for (ll i = 1; i <= n; ++i) {
cin >> l[i];
}
ll sum = 0;
ll ans = 0;
ll tot = 1;
while (sum <= x && tot <= n + 1) {
ans++;
sum += l[tot++];
}
cout << ans << endl;
}
| [
"control_flow.loop.condition.change"
] | 813,130 | 813,131 | u976418120 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t < m)
cout << n << endl;
else
cout << n + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t <= m)
cout << n + 1 << endl;
else
cout << n << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 813,140 | 813,141 | u573035837 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t > m)
cout << n - 1 << endl;
else
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t <= m)
cout << n + 1 << endl;
else
cout << n << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 813,142 | 813,141 | u573035837 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t > m)
cout << n << endl;
else
cout << n - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int t = 0, ans = 0;
for (int i = 0; i < n; i++) {
int te;
scanf("%d", &te);
if (t > m) {
printf("%d\n", i);
return 0;
}
t += te;
}
if (t <= m)
cout << n + 1 << endl;
else
cout << n << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 813,143 | 813,141 | u573035837 | cpp |
p03000 | #include <iostream>
using namespace std;
int n, sum, x, v, nr;
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> v;
sum += v;
if (sum <= x)
nr++;
else
break;
}
cout << nr;
} | #include <iostream>
using namespace std;
int n, sum, x, v, nr;
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> v;
sum += v;
if (sum <= x)
nr++;
else
break;
}
cout << nr + 1;
}
| [
"expression.operation.binary.add"
] | 813,144 | 813,145 | u620278296 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
vector<int> d(n);
for (int j = 0; j < n; j++) {
d.at(j + 1) = d.at(j) + l.at(j);
}
int y = 0;
for (int k = 0; k < n; k++) {
if (d.at(k) <= x) {
y++;
}
}
cout << y << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
vector<int> d(n + 1);
for (int j = 0; j < n; j++) {
d.at(j + 1) = d.at(j) + l.at(j);
}
int y = 0;
for (int k = 0; k < n + 1; k++) {
if (d.at(k) <= x) {
y++;
}
}
cout << y << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,146 | 813,147 | u072080927 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 1;
int D = 0;
L[1000] = {};
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i <= N; i++) {
D += L[i];
if (D > X)
break;
count++;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 1;
int D = 0;
L[1000] = {};
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
D += L[i];
if (D > X)
break;
count++;
}
cout << count << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,148 | 813,149 | u217799598 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 0;
int D = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
D += L[i];
count++;
if (D > X)
break;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 0;
int D = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i <= N; i++) {
D += L[i];
count++;
if (D > X)
break;
}
cout << count << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,150 | 813,151 | u217799598 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[101];
int count = 0;
int a = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
a += L[i];
count++;
if (a < X)
break;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, X, L[1000];
int count = 0;
int D = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i <= N; i++) {
D += L[i];
count++;
if (D > X)
break;
}
cout << count << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.name.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.variable.change... | 813,153 | 813,151 | u217799598 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define MOD 1000000009
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s; i <= e; i++)
#define LLI long long int
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(a, shift) ((a>>shift)&1))
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort((v).rbegin(), (v).rend())
// int 2.14E±9 lli 9.2E±18 double 1.7E±380
int main() {
int N, X;
cin >> N >> X;
LLI sum = 0;
LLI c = 0;
REP(i, N) {
int t;
cin >> t;
sum += t;
if (sum <= X) {
c++;
} else {
cout << c;
return 0;
}
}
cout << c;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define MOD 1000000009
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s; i <= e; i++)
#define LLI long long int
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(a, shift) ((a>>shift)&1))
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort((v).rbegin(), (v).rend())
// int 2.14E±9 lli 9.2E±18 double 1.7E±380
int main() {
int N, X;
cin >> N >> X;
LLI sum = 0;
LLI c = 1;
REP(i, N) {
int t;
cin >> t;
sum += t;
if (sum <= X) {
c++;
} else {
cout << c;
return 0;
}
}
cout << c;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 813,166 | 813,167 | u840105874 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) FOR(i, 0, b)
#define INF mugen
#define dump(x) cerr << #x << "=" << x << endl
#define ALL(a) (a).begin(), (a).end()
#define EACH(e, v) for (auto &e : v)
#define SORT(v) sort(ALL(v))
#define PERM(v) \
SORT(v); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(v)))
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<vii> viii;
typedef pair<int, int> P;
template <class T> void chmin(T &a, T const &b) {
if (b < a)
a = b;
}
template <class T> void chmax(T &a, T const &b) {
if (b > a)
a = b;
}
template <typename T> string to_string(const T &n) {
ostringstream stm;
stm << n;
return stm.str();
}
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
using ll = long long;
const ll mod = 1000'000'007;
int N, X;
int L[110], ans;
signed main() {
cin >> N >> X;
rep(i, N) cin >> L[i];
int now = 0;
rep(i, N) {
if (now <= X)
ans++;
now += L[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) FOR(i, 0, b)
#define INF mugen
#define dump(x) cerr << #x << "=" << x << endl
#define ALL(a) (a).begin(), (a).end()
#define EACH(e, v) for (auto &e : v)
#define SORT(v) sort(ALL(v))
#define PERM(v) \
SORT(v); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(v)))
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<vii> viii;
typedef pair<int, int> P;
template <class T> void chmin(T &a, T const &b) {
if (b < a)
a = b;
}
template <class T> void chmax(T &a, T const &b) {
if (b > a)
a = b;
}
template <typename T> string to_string(const T &n) {
ostringstream stm;
stm << n;
return stm.str();
}
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
using ll = long long;
const ll mod = 1000'000'007;
int N, X;
int L[110], ans;
signed main() {
cin >> N >> X;
rep(i, N) cin >> L[i];
int now = 0;
rep(i, N + 1) {
if (now <= X)
ans++;
now += L[i];
}
cout << ans << endl;
} | [
"expression.operation.binary.add"
] | 813,170 | 813,171 | u373844230 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int N, X;
vector<int> L;
int main() {
cin >> N >> X;
L.resize(N);
for (int i = 0; i < N; i++)
scanf("%d", &L[i]);
int ans = 1;
for (int i = 0; i < N; i++) {
X -= L[i];
if (X <= 0)
break;
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, X;
vector<int> L;
int main() {
cin >> N >> X;
L.resize(N);
for (int i = 0; i < N; i++)
scanf("%d", &L[i]);
int ans = 1;
for (int i = 0; i < N; i++) {
X -= L[i];
if (X < 0)
break;
ans++;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,186 | 813,187 | u877476774 | cpp |
p03000 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
LL N, X;
R(N, X);
LL an = 1;
LL v = 0;
REP(i, N) {
LL t;
R(t);
v += t;
if (t <= X)
an++;
}
W(an);
return 0;
}
| /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
LL N, X;
R(N, X);
LL an = 1;
LL v = 0;
REP(i, N) {
LL t;
R(t);
v += t;
if (v <= X)
an++;
}
W(an);
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,188 | 813,189 | u284124505 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
int L[N + 1];
L[0] = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> L[i + 1];
}
for (int i = 1; i < N + 1; i++) {
L[i] += L[i - 1];
if (L[i] <= X) {
ans++;
}
}
cout << ans << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
int L[N + 1];
L[0] = 0;
int ans = 1;
for (int i = 0; i < N; i++) {
cin >> L[i + 1];
}
for (int i = 1; i < N + 1; i++) {
L[i] += L[i - 1];
if (L[i] <= X) {
ans++;
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 813,190 | 813,191 | u359856428 | cpp |
p03000 | /// ..:: In The Name Of God ::..
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define endl '??/n'
#define INF 2e9
#define int ll
#define vi vector<int>
#define vii vector<pii>
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int N, X;
cin >> N >> X;
vi v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
int flag = 1;
ll point = 0;
for (int i = 0; i < N; i++) {
point += v[i];
if (point <= X) {
flag += 1;
}
}
cout << flag << endl;
}
| /// ..:: In The Name Of God ::..
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define endl '\n'
#define INF 2e9
#define int ll
#define vi vector<int>
#define vii vector<pii>
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int N, X;
cin >> N >> X;
vi v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
int flag = 1;
ll point = 0;
for (int i = 0; i < N; i++) {
point += v[i];
if (point <= X) {
flag += 1;
}
}
cout << flag << endl;
}
| [
"preprocessor.define.value.change"
] | 813,196 | 813,197 | u809816772 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, X;
cin >> N >> X;
vector<int> L;
for (int i = 0; i < N; i++) {
int inp;
cin >> inp;
L.push_back(inp);
}
vector<int> D;
D.push_back(0);
for (int i = 1; i < N + 1; i++) {
int inp = D[i - 1] + L[i - 1];
D.push_back(inp);
}
int count = 0;
for (int i = 0; i < N + 1; i++) {
if (D[i] < X)
count++;
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, X;
cin >> N >> X;
vector<int> L;
for (int i = 0; i < N; i++) {
int inp;
cin >> inp;
L.push_back(inp);
}
vector<int> D;
D.push_back(0);
for (int i = 1; i < N + 1; i++) {
int inp = D[i - 1] + L[i - 1];
D.push_back(inp);
}
int count = 0;
for (int i = 0; i < N + 1; i++) {
if (D[i] <= X)
count++;
}
cout << count << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,206 | 813,207 | u412960991 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0, count = 0;
while (d <= x && count < n) {
d += l[count++];
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0, count = 0;
while (d <= x && count <= n) {
d += l[count++];
}
cout << count << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 813,208 | 813,209 | u781762706 | cpp |
p03000 | #include <bits/stdc++.h>
#define int long long
#define pb emplace_back
#define mp make_pair
#define mt make_tuple
#define all(v) v.begin(), v.end()
#define rep(i, start, lim) for (long long(i) = (start); i < (lim); i++)
#define revrep(i, n) for (long long i = n - 1; i >= 0; i--)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define osit ostream_iterator<int> output(cout, " ")
#define endl '\n'
#define f first
#define s second
#define PI 3.141592653589793
#define MOD 1000000007
#define set0(x) memset(x, 0, sizeof(x))
#define set1(x) memset(x, 1, sizeof(x))
using namespace std;
typedef vector<int> vi;
typedef list<int> li;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef tuple<int, int, int> iii;
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
template <typename P> P dectobin(P a) {
if (a == 0)
return 0;
else
return (a % 2 + 10 * dectobin(a / 2));
}
template <typename Y> Y bintodec(Y a) {
int ans = 0, b = 1, t = a;
while (t) {
int ld = t % 10;
t /= 10;
ans += ld * b;
b = b * 2;
}
return ans;
}
template <typename H> H modExp(H x, H n) {
int r = 1;
while (n > 0) {
if (n % 2 == 1) {
r = (r * x) % MOD;
}
x = (x * x) % MOD;
n /= 2;
}
return r;
}
template <typename T> T isPowerOfTwo(T x) { return x && (!(x & (x - 1))); }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
// template<typename T> T extendedEuclid(T A,T B){if(B==0){d=A; x=1;y=0;}else{
// extendedEuclid(B,A%B);int temp=x; x=y; y=temp-(A B)*y;}}
int32_t main() {
boost;
osit;
int n, x;
cin >> n >> x;
int arr[n], sum[n + 1];
rep(i, 0, n) { cin >> arr[i]; }
sum[0] = 0;
rep(i, 0, n) { sum[i + 1] = sum[i] + arr[i]; }
rep(i, 0, n + 1) {
// cout<<sum[i]<<" ";
if (sum[i] > x) {
cout << i;
return 0;
}
}
cout << 0;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define pb emplace_back
#define mp make_pair
#define mt make_tuple
#define all(v) v.begin(), v.end()
#define rep(i, start, lim) for (long long(i) = (start); i < (lim); i++)
#define revrep(i, n) for (long long i = n - 1; i >= 0; i--)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define osit ostream_iterator<int> output(cout, " ")
#define endl '\n'
#define f first
#define s second
#define PI 3.141592653589793
#define MOD 1000000007
#define set0(x) memset(x, 0, sizeof(x))
#define set1(x) memset(x, 1, sizeof(x))
using namespace std;
typedef vector<int> vi;
typedef list<int> li;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef tuple<int, int, int> iii;
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
template <typename P> P dectobin(P a) {
if (a == 0)
return 0;
else
return (a % 2 + 10 * dectobin(a / 2));
}
template <typename Y> Y bintodec(Y a) {
int ans = 0, b = 1, t = a;
while (t) {
int ld = t % 10;
t /= 10;
ans += ld * b;
b = b * 2;
}
return ans;
}
template <typename H> H modExp(H x, H n) {
int r = 1;
while (n > 0) {
if (n % 2 == 1) {
r = (r * x) % MOD;
}
x = (x * x) % MOD;
n /= 2;
}
return r;
}
template <typename T> T isPowerOfTwo(T x) { return x && (!(x & (x - 1))); }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
// template<typename T> T extendedEuclid(T A,T B){if(B==0){d=A; x=1;y=0;}else{
// extendedEuclid(B,A%B);int temp=x; x=y; y=temp-(A B)*y;}}
int32_t main() {
boost;
osit;
int n, x;
cin >> n >> x;
int arr[n], sum[n + 1];
rep(i, 0, n) { cin >> arr[i]; }
sum[0] = 0;
rep(i, 0, n) { sum[i + 1] = sum[i] + arr[i]; }
rep(i, 0, n + 1) {
// cout<<sum[i]<<" ";
if (sum[i] > x) {
cout << i;
return 0;
}
}
cout << n + 1;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 813,210 | 813,211 | u606350691 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i;
cin >> n >> x;
int arr[n];
for (i = 0; i < n; i++)
cin >> arr[i];
int d1 = 0, op = 0;
while (d1 <= x && i <= n) {
op++;
d1 = d1 + arr[i];
i++;
}
cout << op;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i;
cin >> n >> x;
int arr[n];
for (i = 0; i < n; i++)
cin >> arr[i];
int d1 = 0, op = 0;
i = 0;
while (d1 <= x && i <= n) {
op++;
d1 = d1 + arr[i];
i++;
}
cout << op;
return 0;
} | [
"assignment.add"
] | 813,221 | 813,222 | u549517003 | cpp |
p03000 | #include <iostream>
using namespace std;
const int Max = 1e6;
int main() {
int n, x, L[Max], D[Max], cnt = 1;
cin >> n >> x;
D[1] = 0;
for (int i = 1; i <= n; ++i)
cin >> L[i];
for (int i = 2; i <= n; ++i) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
++cnt;
}
cout << cnt;
return 0;
} | #include <iostream>
using namespace std;
const int Max = 1e6;
int main() {
int n, x, L[Max], D[Max], cnt = 1;
cin >> n >> x;
D[1] = 0;
for (int i = 1; i <= n; ++i)
cin >> L[i];
for (int i = 2; i <= n + 1; ++i) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
++cnt;
}
cout << cnt;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,225 | 813,226 | u992218377 | cpp |
p03000 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, x, arr[100], pos = 0;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
pos += arr[i];
if (pos > x)
return cout << i + 1 << '\n', 0;
}
cout << n << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, x, arr[100], pos = 0;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
pos += arr[i];
if (pos > x)
return cout << i + 1 << '\n', 0;
}
cout << n + 1 << '\n';
return 0;
}
| [
"expression.operation.binary.add"
] | 813,227 | 813,228 | u769237842 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x, y;
cin >> n >> x;
vector<int> v(n + 1);
v[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> y;
v[i] = v[i - 1] + y;
}
int ans = 0;
for (auto u : v) {
if (u < x) {
++ans;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x, y;
cin >> n >> x;
vector<int> v(n + 1);
v[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> y;
v[i] = v[i - 1] + y;
}
int ans = 0;
for (auto u : v) {
if (u <= x) {
++ans;
}
}
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,231 | 813,232 | u256901785 | cpp |
p03000 | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll a, b;
cin >> a >> b;
ll ans(0);
ll k, cnt(0);
while (a--) {
cin >> k;
if (ans <= b)
cnt++;
ans += k;
}
if (ans < b)
cnt++;
cout << cnt << endl;
}
| #include <iostream>
using namespace std;
#define ll long long
int main() {
ll a, b;
cin >> a >> b;
ll ans(0);
ll k, cnt(0);
while (a--) {
cin >> k;
if (ans <= b)
cnt++;
ans += k;
}
if (ans <= b)
cnt++;
cout << cnt << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,233 | 813,234 | u982650258 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
int L[100];
for (int i = 0; i < N; i++)
cin >> L[i];
int D[101], ans = 0;
D[0] = 0;
ans++;
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X)
ans++;
else
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
int L[100];
for (int i = 0; i < N; i++)
cin >> L[i];
int D[101], ans = 0;
D[0] = 0;
ans++;
for (int i = 1; i <= N; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X)
ans++;
else
break;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,235 | 813,236 | u960997735 | cpp |
p03000 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int N, X, L[101], D = 0, counter = 1;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 2; i < N + 1; i++) {
D += L[i - 1];
if (D <= X)
counter++;
}
cout << counter << endl;
return 0;
}
| #include <iostream>
#include <string.h>
using namespace std;
int main() {
int N, X, L[101], D = 0, counter = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 1; i < N + 1; i++) {
D += L[i - 1];
if (D <= X)
counter++;
}
cout << counter + 1 << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 813,237 | 813,238 | u573083749 | cpp |
p03000 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, x, tmp, ans, cur;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> x;
for (int i = 0; i < n; i++) {
if (cur == x) {
ans++;
}
cin >> tmp;
cur = cur + tmp;
}
if (cur == x) {
ans++;
}
cout << ans << "\n";
// system("pause");
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, x, tmp, ans, cur;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> x;
for (int i = 0; i < n; i++) {
if (cur <= x) {
ans++;
}
cin >> tmp;
cur = cur + tmp;
}
if (cur <= x) {
ans++;
}
cout << ans << "\n";
// system("pause");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,243 | 813,244 | u398025421 | cpp |
p03000 | /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB iBBB
BBQ BQB BBD QBBi
BBB BQB iQBi 1BBv
sBBg wBBB QBB iBBB
7BBBBBBBBBi BBR wBBBBBBBBBBBBB
irvi ii ii i i iii
i5U
BBB
BB7
1BB
iPBBBBBKBBR JBR1 rQBO BR UBQP iBBQi
7BBBGs7sXBBBi QBBr gBBE rBB BB2BB7HBZQBB
QBBi sBQ BBB iBBB SQBBR BBBB cBQ
gBQ BBg BBB KBBi MBBH BBB BBs
iBBv iBBi QBBBL BBR pBB iBB
pBB BBB iBBBB iBB BBL KBB
MBB BBBR BBB JBBi DBR iBQ BBL
GBB 7BBBB2 PBBH BBBi BQr DBB iBB
BQBXwgBBP BB7 1BBB BBQ7 1BB BBc BBB
2BBBBw BB EBBS QBBi HBa iBB BB7
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define x0 x0123456789
#define y0 y0123456789
#define x1 x1234567890
#define y1 y1234567890
#define x2 x2345678901
#define y2 y2345678901
typedef double db;
typedef long long ll;
typedef long double ldb;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 7;
int n, x, sum;
int main() {
scanf("%d%d", &n, &x);
FOR(i, 0, n) {
int y;
scanf("%d", &y);
sum += y;
if (sum > x) {
printf("%d\n", i + 1);
return 0;
}
}
printf("%d\n", n);
return 0;
}
| /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB iBBB
BBQ BQB BBD QBBi
BBB BQB iQBi 1BBv
sBBg wBBB QBB iBBB
7BBBBBBBBBi BBR wBBBBBBBBBBBBB
irvi ii ii i i iii
i5U
BBB
BB7
1BB
iPBBBBBKBBR JBR1 rQBO BR UBQP iBBQi
7BBBGs7sXBBBi QBBr gBBE rBB BB2BB7HBZQBB
QBBi sBQ BBB iBBB SQBBR BBBB cBQ
gBQ BBg BBB KBBi MBBH BBB BBs
iBBv iBBi QBBBL BBR pBB iBB
pBB BBB iBBBB iBB BBL KBB
MBB BBBR BBB JBBi DBR iBQ BBL
GBB 7BBBB2 PBBH BBBi BQr DBB iBB
BQBXwgBBP BB7 1BBB BBQ7 1BB BBc BBB
2BBBBw BB EBBS QBBi HBa iBB BB7
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define x0 x0123456789
#define y0 y0123456789
#define x1 x1234567890
#define y1 y1234567890
#define x2 x2345678901
#define y2 y2345678901
typedef double db;
typedef long long ll;
typedef long double ldb;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 7;
int n, x, sum;
int main() {
scanf("%d%d", &n, &x);
FOR(i, 0, n) {
int y;
scanf("%d", &y);
sum += y;
if (sum > x) {
printf("%d\n", i + 1);
return 0;
}
}
printf("%d\n", n + 1);
return 0;
}
| [
"expression.operation.binary.add"
] | 813,249 | 813,250 | u904221771 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int(i) = (n); (i) >= (0); (i)--)
#define SIZE(x) ((int)(x).size())
#define GCD(a, b) \
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
#define QP(a, b) \
int qp(int a, ll b) { \
int ans = 1; \
do { \
if (b & 1) \
ans = 1ll * ans * a % mo; \
a = 1ll * a * a % mo; \
} while (b >>= 1); \
return ans; \
}
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define all(v) (v).begin(), (v).end()
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
template <typename A, size_t N, typename T>
void FILL(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
typedef vector<int, int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1LL << 60;
const ll MOD = 1000000007LL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
vector<ll> l(n), d(n);
d[0] = 0;
ll res = 1;
rep(i, n) cin >> l[i];
rep(i, n) {
if (i == 0)
continue;
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
res++;
}
cout << res;
cout << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int(i) = (n); (i) >= (0); (i)--)
#define SIZE(x) ((int)(x).size())
#define GCD(a, b) \
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
#define QP(a, b) \
int qp(int a, ll b) { \
int ans = 1; \
do { \
if (b & 1) \
ans = 1ll * ans * a % mo; \
a = 1ll * a * a % mo; \
} while (b >>= 1); \
return ans; \
}
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define all(v) (v).begin(), (v).end()
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
template <typename A, size_t N, typename T>
void FILL(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
typedef vector<int, int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1LL << 60;
const ll MOD = 1000000007LL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
vector<ll> l(n), d(n + 1);
d[0] = 0;
ll res = 1;
rep(i, n) cin >> l[i];
rep(i, n + 1) {
if (i == 0)
continue;
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
res++;
}
cout << res;
cout << endl;
return 0;
}
| [
"assignment.change",
"expression.operation.binary.add"
] | 813,251 | 813,252 | u535107169 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
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 = 0; i <= n; i++) {
d = d + L[i];
if (d <= x)
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
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 = 0; i <= n - 1; i++) {
d = d + L[i];
if (d <= x)
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,259 | 813,260 | u784072785 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
const int N = 110;
int a[N];
int s[N];
int main() {
int n = read(), x = read();
for (int i = 1; i <= n; i++)
a[i] = read();
for (int i = 2; i <= n; i++) {
s[i] = s[i - 1] + a[i - 1];
if (s[i] > x) {
printf("%d\n", i - 1);
return 0;
}
}
printf("%d\n", n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
const int N = 110;
int a[N];
int s[N];
int main() {
int n = read(), x = read();
for (int i = 1; i <= n; i++)
a[i] = read();
for (int i = 2; i <= n + 1; i++) {
s[i] = s[i - 1] + a[i - 1];
if (s[i] > x) {
printf("%d\n", i - 1);
return 0;
}
}
printf("%d\n", n + 1);
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,264 | 813,265 | u855248478 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int N, X;
cin >> N >> X;
vector<int> L(N);
vector<int> D(N, 0);
REP(i, N) cin >> L[i];
int ans = 1;
FOR(i, 1, N) {
int d = D[i - 1] + L[i - 1];
D[i] = d;
if (d <= X)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int N, X;
cin >> N >> X;
vector<int> L(N);
vector<int> D(N, 0);
REP(i, N) cin >> L[i];
int ans = 1;
FOR(i, 1, N + 1) {
int d = D[i - 1] + L[i - 1];
D[i] = d;
if (d <= X)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 813,266 | 813,267 | u594140666 | cpp |
p03000 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<ll> vec;
typedef vector<vec> vec2;
typedef map<ll, ll> MPll;
typedef set<ll> setl;
const ll INF = 1ll << 60;
const ld EPS = 1e-10;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll mods = 1000000007;
// for文
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define FORE(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define REP(i, size) for (ll i = (ll)0; i < size; i++)
#define REPE(i, size) for (ll i = (ll)0; i <= size; i++)
#define REPR(i, size) for (ll i = (ll)size; i >= 0; i--)
#define FOREACH(it, vec) for (auto it = vec.begin(); it != vec.end(); it++)
//ソート
#define ALL(vec) (vec).begin(), (vec).end()
#define SORT(vec) sort(ALL(vec))
#define SORTA(arr) sort(arr, arr + (sizeof(arr) / sizeof(ll)))
#define INVSORT(vec) sort((vec).rbegin(), (vec).rend())
#define REV(vec) reverse(ALL(vec))
#define REVA(arr) reverse(arr, arr + (sizeof(arr) / sizeof(ll)))
#define INVSORTA(arr) sort(arr, arr + (sizeof(arr) / sizeof(ll))), REVA(arr)
//最大値最小値
#define MAX(vec) *max_element(ALL(vec))
#define UNIQ(vec) \
SORT(vec); \
vec.erase(unique(ALL(vec)), vec.end())
#define MIN(vec) *min_element(ALL(vec))
//出力
#define printl(a) cout << a << "\n"
#define print(a) cout << a
#define OUT(a) printf("%lld\n", a)
#define OUTA(array) \
REP(i, sizeof(array) / sizeof(ll)) printf("%lld\n", array[i])
#define OUTV(vec) REP(i, vec.size()) printf("%lld\n", vec[i])
#define SP printf(" ")
//入力
#define IN(x) scanf("%lld", &x)
#define INV(vec) REP(i, vec.size()) scanf("%lld", &vec[i])
#define INA(array) REP(i, sizeof(array) / sizeof(ll)) scanf("%lld", array + i)
#define INS(x) cin >> x
#define INCH(x) scanf(" %c", &x)
//型
#define P pair
#define vp vector<P>
#define F first
#define S second
//その他
#define PB push_back
#define MP make_pair
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, -1, sizeof(a))
#define INFI(a) memset(a, INF, sizeof(a))
#define MEM(a, b) memset(a, (b), sizeof(a))
//関数
template <class T> inline void amax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void amin(T &a, const T &b) {
if (a > b)
a = b;
}
/*
struct structure{
ll num1,num2,string s;
bool operator<(const rest &another) const{
return this->s < another.s;
}
structure(ll a,ll b,string s){
this->num1 = a,this->num2=b,this->s=s;
}
};a
*/
//特殊
//#define int ll
#define _CRT_SECURE_NO_WARNINGS
/*
template <typename T>
struct UnionFindTree{
vector<T> par;
UnionFindTree(T n) : par(n+1){
for (int i = 1; i <= n; ++i) {
par[i] = i;
}
}
T root(T x){
if(par[x] == x) return x;
else return par[x] = root(par[x]);
}
void unite(T x,T y){
if(!same(x,y)) par[root(x)] = root(par[y]);
}
T same(T x,T y){
return root(x) == root(y);
}
};
*/
#define DEBUG
#ifdef DEBUG
#define debugl(x) cerr << #x << ":" << x << "\n"
#define debug(x) cerr << #x << ":" << x << endl;
#define debugV(V) \
REP(iiiii, V.size()) { cerr << iiiii << ":" << V[iiiii] << endl; }
#define debugA(A) \
REP(iiiiiii, sizeof(A) / sizeof(ll)) { \
cerr << iiiiiii << ":" << V[iiiiiii] << endl; \
}
#define debugVV(V) \
REP(i123, V[0].size()) { \
cerr << endl; \
REP(i1234, V.size()) { cerr << V[i1234][i123]; } \
}
#else
#define debug(x)
#define debugV(x)
#define debugA(x)
#define debugl(x)
#endif
#define ZERO(a) memset(a, 0, sizeof(a))
#define ALL(vec) (vec).begin(), (vec).end()
#define SORT(vec) sort(ALL(vec))
ll binary(ll key, vec &a) {
ll ok = a.size();
ll dame = -1;
while (abs(ok - dame) > 1) {
ll mid = (ok + dame) / 2;
if (a[mid] <= key)
ok = mid;
else
dame = mid;
}
return ok;
}
ll n;
ll m;
ll k;
ll l;
ll temp;
ll x, y;
ll H, W;
signed main() {
IN(n);
IN(x);
vec L(n);
ll d = 0;
ll ans = 0;
FOR(i, 0, n) {
IN(temp);
d += temp;
ans++;
if (d > x) {
cout << ans << endl;
return 0;
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<ll> vec;
typedef vector<vec> vec2;
typedef map<ll, ll> MPll;
typedef set<ll> setl;
const ll INF = 1ll << 60;
const ld EPS = 1e-10;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll mods = 1000000007;
// for文
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define FORE(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define REP(i, size) for (ll i = (ll)0; i < size; i++)
#define REPE(i, size) for (ll i = (ll)0; i <= size; i++)
#define REPR(i, size) for (ll i = (ll)size; i >= 0; i--)
#define FOREACH(it, vec) for (auto it = vec.begin(); it != vec.end(); it++)
//ソート
#define ALL(vec) (vec).begin(), (vec).end()
#define SORT(vec) sort(ALL(vec))
#define SORTA(arr) sort(arr, arr + (sizeof(arr) / sizeof(ll)))
#define INVSORT(vec) sort((vec).rbegin(), (vec).rend())
#define REV(vec) reverse(ALL(vec))
#define REVA(arr) reverse(arr, arr + (sizeof(arr) / sizeof(ll)))
#define INVSORTA(arr) sort(arr, arr + (sizeof(arr) / sizeof(ll))), REVA(arr)
//最大値最小値
#define MAX(vec) *max_element(ALL(vec))
#define UNIQ(vec) \
SORT(vec); \
vec.erase(unique(ALL(vec)), vec.end())
#define MIN(vec) *min_element(ALL(vec))
//出力
#define printl(a) cout << a << "\n"
#define print(a) cout << a
#define OUT(a) printf("%lld\n", a)
#define OUTA(array) \
REP(i, sizeof(array) / sizeof(ll)) printf("%lld\n", array[i])
#define OUTV(vec) REP(i, vec.size()) printf("%lld\n", vec[i])
#define SP printf(" ")
//入力
#define IN(x) scanf("%lld", &x)
#define INV(vec) REP(i, vec.size()) scanf("%lld", &vec[i])
#define INA(array) REP(i, sizeof(array) / sizeof(ll)) scanf("%lld", array + i)
#define INS(x) cin >> x
#define INCH(x) scanf(" %c", &x)
//型
#define P pair
#define vp vector<P>
#define F first
#define S second
//その他
#define PB push_back
#define MP make_pair
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, -1, sizeof(a))
#define INFI(a) memset(a, INF, sizeof(a))
#define MEM(a, b) memset(a, (b), sizeof(a))
//関数
template <class T> inline void amax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void amin(T &a, const T &b) {
if (a > b)
a = b;
}
/*
struct structure{
ll num1,num2,string s;
bool operator<(const rest &another) const{
return this->s < another.s;
}
structure(ll a,ll b,string s){
this->num1 = a,this->num2=b,this->s=s;
}
};a
*/
//特殊
//#define int ll
#define _CRT_SECURE_NO_WARNINGS
/*
template <typename T>
struct UnionFindTree{
vector<T> par;
UnionFindTree(T n) : par(n+1){
for (int i = 1; i <= n; ++i) {
par[i] = i;
}
}
T root(T x){
if(par[x] == x) return x;
else return par[x] = root(par[x]);
}
void unite(T x,T y){
if(!same(x,y)) par[root(x)] = root(par[y]);
}
T same(T x,T y){
return root(x) == root(y);
}
};
*/
#define DEBUG
#ifdef DEBUG
#define debugl(x) cerr << #x << ":" << x << "\n"
#define debug(x) cerr << #x << ":" << x << endl;
#define debugV(V) \
REP(iiiii, V.size()) { cerr << iiiii << ":" << V[iiiii] << endl; }
#define debugA(A) \
REP(iiiiiii, sizeof(A) / sizeof(ll)) { \
cerr << iiiiiii << ":" << V[iiiiiii] << endl; \
}
#define debugVV(V) \
REP(i123, V[0].size()) { \
cerr << endl; \
REP(i1234, V.size()) { cerr << V[i1234][i123]; } \
}
#else
#define debug(x)
#define debugV(x)
#define debugA(x)
#define debugl(x)
#endif
#define ZERO(a) memset(a, 0, sizeof(a))
#define ALL(vec) (vec).begin(), (vec).end()
#define SORT(vec) sort(ALL(vec))
ll binary(ll key, vec &a) {
ll ok = a.size();
ll dame = -1;
while (abs(ok - dame) > 1) {
ll mid = (ok + dame) / 2;
if (a[mid] <= key)
ok = mid;
else
dame = mid;
}
return ok;
}
ll n;
ll m;
ll k;
ll l;
ll temp;
ll x, y;
ll H, W;
signed main() {
IN(n);
IN(x);
vec L(n);
ll d = 0;
ll ans = 0;
FOR(i, 0, n) {
IN(temp);
d += temp;
ans++;
if (d > x) {
cout << ans << endl;
return 0;
}
}
cout << n + 1 << endl;
}
| [
"identifier.change",
"io.output.change"
] | 813,272 | 813,273 | u502721867 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[101] = {};
int ball[101] = {};
for (int i = 0; i < N; i++) {
cin >> L[i];
ball[i + 1] = ball[i] + L[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (ball[i] <= X) {
cnt++;
}
}
cout << cnt << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[101] = {};
int ball[101] = {};
for (int i = 0; i < N; i++) {
cin >> L[i];
ball[i + 1] = ball[i] + L[i];
}
int cnt = 0;
for (int i = 0; i <= N; i++) {
if (ball[i] <= X) {
cnt++;
}
}
cout << cnt << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,274 | 813,275 | u451206510 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[100] = {};
int ball[100] = {};
for (int i = 0; i < N; i++) {
cin >> L[i];
ball[i + 1] = ball[i] + L[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (ball[i] <= X) {
cnt++;
}
}
cout << cnt << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[101] = {};
int ball[101] = {};
for (int i = 0; i < N; i++) {
cin >> L[i];
ball[i + 1] = ball[i] + L[i];
}
int cnt = 0;
for (int i = 0; i <= N; i++) {
if (ball[i] <= X) {
cnt++;
}
}
cout << cnt << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,276 | 813,275 | u451206510 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
#define MM 1000000000
#define MOD MM + 7
#define pi pair<int, int>
#define pl pair<ll, ll>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
const long double PI = acos(-1);
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int GCD(int x, int y) { return y ? GCD(y, x % y) : x; }
int main() {
int N, X;
cin >> N >> X;
int L[101], D[101];
int cnt = 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];
if (D[i] <= X)
cnt++;
}
cout << cnt << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
#define MM 1000000000
#define MOD MM + 7
#define pi pair<int, int>
#define pl pair<ll, ll>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
const long double PI = acos(-1);
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int GCD(int x, int y) { return y ? GCD(y, x % y) : x; }
int main() {
int N, X;
cin >> N >> X;
int L[101], D[101];
int cnt = 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];
if (D[i] <= X)
cnt++;
}
cout << cnt << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,288 | 813,289 | u342051078 | cpp |
p03000 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n, 0)
#define all(a) a.begin(), a.end()
#define IN(a, n) \
rep(i, n) { cin >> a[i]; }
const int vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
}
main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
int l = 0;
int ans = 1;
int i = 1;
while (i < n) {
l += v[i++];
if (l > x)
break;
ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n, 0)
#define all(a) a.begin(), a.end()
#define IN(a, n) \
rep(i, n) { cin >> a[i]; }
const int vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
}
main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
int l = 0;
int ans = 1;
int i = 0;
while (i < n) {
l += v[i++];
if (l > x)
break;
ans++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 813,290 | 813,291 | u229842440 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 1, now = 0, a;
for (int i = 0; i < N; i++) {
cin >> a;
if (X >= a + now) {
count++;
now += a;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 1, now = 0, a;
for (int i = 0; i < N; i++) {
cin >> a;
if (X >= a + now) {
count++;
now += a;
} else
break;
}
cout << count << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 813,294 | 813,295 | u239087789 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
/// cin/cout overloading
template <typename T> ostream &operator<<(ostream &out, vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
out << *it << " ";
}
return out;
}
template <typename T> ostream &operator<<(ostream &out, pair<T, T> &P) {
out << P.first << " " << P.second;
return out;
}
template <typename T> istream &operator>>(istream &in, vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
in >> *it;
}
return in;
}
template <typename T> istream &operator>>(istream &in, pair<T, T> &P) {
in >> P.first >> P.second;
return in;
}
/// 图相关
ll N, M;
//
// struct Edge {
// ll to;
// ll weight;
// ll next;
// bool operator<(const Edge& rhs) {
// return weight < rhs.weight;
// }
// };
struct Edge2 {
ll u, v, w;
Edge2(ll u_, ll v_, ll w_) : u(u_), v(v_), w(w_) {}
Edge2() : u(0ll), v(0ll), w(0ll) {}
bool operator<(const Edge2 &rhs) { return w < rhs.w; }
};
// vector<Edge> edges(MAXN);
// vector<ll> head(MAXN, -1);
// vector<int> matchingx(MAXN, -1);
// vector<int> matchingy(MAXN, -1);
// vector<bool> check(MAXN);
// vector<ll> dis(MAXN);
// vector<bool> vis(MAXN, false);
//
// ll cnt = 1;
//
// void addEdge(ll from, ll to, ll weight) {
// edges[cnt].to = to;
// edges[cnt].weight = weight;
// edges[cnt].next = head[from];
// head[from] = cnt++;
//}
//
// bool dfs(int u) {
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (!check[v]) {
// check[v] = true;
// if (matchingy[v] == -1 || dfs(matchingy[v])) {
// matchingy[v] = u;
// matchingx[u] = v;
// return true;
// }
// }
// }
// return false;
//}
//
// int hungarian() {
// int ans = 0;
// fill(matchingx.begin(), matchingx.end(), -1);
// fill(matchingy.begin(), matchingy.end(), -1);
// for (int u = 1; u <= N; ++u) {
//// if (matchingx[u] == -1) {
// {
// fill(check.begin(), check.end(), false);
// if (dfs(u)) {
// ++ans;
// }
// }
// }
// return ans;
//}
//
// void dijkstra(const ll s) {
// priority_queue<P, vector<P>, greater<P>> que;
// fill(dis.begin(), dis.end(), INF);
// dis[s] = 0;
// que.push(P(0, s));
//////multiple sources
//// for (auto& x : shops) {
//// dis[x] = 0;
//// que.push(P(0, x));
//// }
// while (!que.empty()) {
// P p = que.top();
// que.pop();
//// cout << "pop " << p.second << endl;
// int u = p.second;
// if (dis[u] < p.first) continue;
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (dis[v] > dis[u] + edges[i].weight) {
// dis[v] = dis[u] + edges[i].weight;
//// cout << "push " << v << endl;
// que.push(P(dis[v], v));
// }
// }
// }
//}
// void zeroOneBFS(const int s) {
// deque<P> que;
// fill(dis.begin(), dis.end(), INF);
// dis[s] = 0;
// que.push_front(P(0, s));
// while (!que.empty()) {
// P p = que.front();
// que.pop_front();
// int u = p.second;
// if (dis[u] < p.first) continue;
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (dis[v] > dis[u] + edges[i].weight) {
// dis[v] = dis[u] + edges[i].weight;
// if (edges[i].weight) {
// que.push_back(P(dis[v], v));
// } else {
// que.push_front(P(dis[v], v));
// }
// }
// }
// }
//}
// Union-Find 并查集
class UnionFind {
vector<ll> par;
public:
explicit UnionFind(ll n) : par(n, -1) {}
ll root(ll a) {
if (par[a] < 0) {
return a;
}
return par[a] = root(par[a]);
}
ll size(ll a) { return -par[root(a)]; }
void unite(ll a, ll b) {
a = root(a);
b = root(b);
if (a != b) {
if (size(a) < size(b)) {
swap(a, b);
}
par[a] += par[b];
par[b] = a;
}
}
};
ll kruskal(vector<Edge2> &edges2, const ll V) {
sort(edges2.begin(), edges2.end());
UnionFind uf(V + 10);
ll res = 0;
Edge2 e;
for (int i = 0; i < edges2.size(); ++i) {
e = edges2[i];
if (uf.root(e.u) != uf.root(e.v)) {
uf.unite(e.u, e.v);
res += e.w;
}
}
return res;
}
/// 线段树
// struct SegmentTreeNode {
// ll maxVal;
// ll minVal;
// ll sum;
// ll len;
// ll lazy;
// ll left, right;
// SegmentTreeNode() {}
//};
//
// class SegmentTree {
// public:
// explicit SegmentTree(size_t size, const vll& nums) : tree(size << 2),
// nums(nums) {
//
// }
// void build(ll root, ll left, ll right) {
// tree[root].lazy = 0;
// tree[root].left = left;
// tree[root].right = right;
// tree[root].len = right - left + 1;
// if (left == right) {
// tree[root].maxVal = nums[left];
// tree[root].minVal = nums[left];
// tree[root].sum = nums[left];
// } else {
// ll mid = (right - left) / 2 + left;
// build(root * 2, left, mid);
// build(root * 2 + 1, mid + 1, right);
// tree[root].minVal = min(tree[root * 2].minVal, tree[root * 2 +
// 1].minVal); tree[root].maxVal = max(tree[root * 2].maxVal,
// tree[root * 2 + 1].maxVal); tree[root].sum = tree[root * 2].sum +
// tree[root * 2 + 1].sum;
// }
// }
//
// void pushup(ll root) {
// tree[root].minVal = min(tree[root * 2].minVal, tree[root * 2 +
// 1].minVal); tree[root].maxVal = max(tree[root * 2].maxVal, tree[root *
// 2 + 1].maxVal); tree[root].sum = tree[root * 2].sum + tree[root * 2 +
// 1].sum;
// }
////// add single node val
// void add(ll root, ll id, ll addVal) {
// if (tree[root].left == tree[root].right) {
// tree[root].maxVal += addVal;
// tree[root].minVal += addVal;
// tree[root].sum += addVal;
// return;
// }
// ll mid = (tree[root].right - tree[root].left) / 2 + tree[root].left;
// if (id <= mid) {
// add(root * 2, id, addVal);
// } else {
// add(root * 2 + 1, id, addVal);
// }
// pushup(root);
// }
//
// void pushdown(ll root) {
// if (tree[root].lazy) {
// tree[root * 2].lazy += tree[root].lazy;
// tree[root * 2 + 1].lazy += tree[root].lazy;
// tree[root * 2].sum += tree[root * 2].len * tree[root].lazy;
// tree[root * 2 + 1].sum += tree[root * 2 + 1].len *
// tree[root].lazy; tree[root * 2].maxVal += tree[root].lazy;
// tree[root * 2 + 1].maxVal += tree[root].lazy;
// tree[root * 2].minVal += tree[root].lazy;
// tree[root * 2 + 1].minVal += tree[root].lazy;
// tree[root].lazy = 0;
// }
// }
// //// query range sum
// ll querySum(ll root, ll left, ll right) {
// if (tree[root].left >= left && tree[root].right <= right) {
// return tree[root].sum;
// }
// if (tree[root].left > right || tree[root].right < left) {
// return 0;
// }
// if (tree[root].lazy) {
// pushdown(root);
// }
// return querySum(root * 2, left, right) + querySum(root * 2 + 1, left,
// right);
// }
// //// query range max/min
// ll queryMax(ll root, ll left, ll right) {
// if (tree[root].left >= left && tree[root].right <= right) {
// return tree[root].maxVal;
// }
// if (tree[root].left > right || tree[root].right < left) {
// return -INF;
// }
// if (tree[root].lazy) {
// pushdown(root);
// }
// return max(queryMax(root * 2, left, right), queryMax(root * 2 + 1,
// left, right));
// }
//
// ll queryMin(ll root, ll left, ll right) {
// if (tree[root].left >= left && tree[root].right <= right) {
// return tree[root].minVal;
// }
// if (tree[root].left > right || tree[root].right < left) {
// return INF;
// }
// if (tree[root].lazy) {
// pushdown(root);
// }
// return min(queryMin(root * 2, left, right), queryMin(root * 2 + 1,
// left, right));
// }
// //// add range val
// void update(ll root, ll left, ll right, ll addVal) {
// if (tree[root].left >= left && tree[root].right <= right) {
// tree[root].lazy += addVal;
// tree[root].sum += tree[root].len * addVal;
// tree[root].maxVal += addVal;
// tree[root].minVal += addVal;
// return;
// }
// if (tree[root].left > right || tree[root].right < left) {
// return;
// }
// if (tree[root].lazy) {
// pushdown(root);
// }
// update(root * 2, left, right, addVal);
// update(root * 2 + 1, left, right, addVal);
// pushup(root);
// }
//
//
// private:
// vector<SegmentTreeNode> tree;
// const vll &nums;
//};
/// 组合数
////約数求める //約数
// void divisor(ll n, vector<ll> &ret) {
// for (ll i = 1; i * i <= n; i++) {
// if (n % i == 0) {
// ret.push_back(i);
// if (i * i != n) ret.push_back(n / i);
// }
// }
// sort(ret.begin(), ret.end());
//}
////階乗
// ll factorial(ll n, ll mod) {
// ll ret = 1;
// for (ll i = 1; i <= n; i++) {
// ret = (ret * i) % mod;
// }
// return ret;
//}
////モジュラ逆数
// ll inv_mod(ll n, ll mod) {
// ll a = n % mod, b = mod - 2, ret = 1;
// while (b > 0) {
// if (b & 1) ret = (ret * a) % mod;
// a = (a * a) % mod;
// b >>= 1;
// }
// return ret;
//}
//
// ll nPr(ll n, ll r, ll mod) {
// ll ret = 1;
// for (ll i = n; i >= n - r + 1; i--) {
// ret = ret * (i % mod) % mod;
// }
// return ret;
//}
//
// ll nCr(ll n, ll r, ll mod) {
// return nPr(n, r, mod) * inv_mod(factorial(r, mod), mod) % mod;
//}
//
// vll F(MAXN), Finv(MAXN), inv(MAXN);
//
// ll pow_mod(ll a, ll b, ll p) {
// ll ret = 1;
// while (b) {
// if (b & 1) ret = (ret * a) % p;
// a = (a * a) % p;
// b >>= 1;
// }
// return ret;
//}
//
// void comb_init() {
// inv[1] = 1;
// for (int i = 2; i < MAXN; ++i) {
// inv[i] = (MOD - MOD / i) * 1ll * inv[MOD % i] % MOD;
// }
// F[0] = Finv[0] = 1;
// for (int i = 1; i < MAXN; ++i) {
// F[i] = F[i-1] * 1ll * i % MOD;
// Finv[i] = Finv[i-1] * 1ll * inv[i] % MOD;
// }
//}
//
// inline ll comb(ll n, ll m) {
// if (m < 0 || m > n) return 0;
// return F[n] * 1ll * Finv[n - m] % MOD * Finv[m] % MOD;
//}
//
inline ll add_mod(ll a, ll b) { return (a + b) % MOD; }
inline ll mul_mod(ll a, ll b) { return a * b % MOD; }
inline ll sub_mod(ll a, ll b) { return (a + MOD - b) % MOD; }
/// main函数
int main() {
int N, X;
cin >> N >> X;
vi L(N + 1);
for (int i = 1; i <= N; ++i) {
cin >> L[i];
}
int cnt = 1;
int last = 0;
for (int i = 2; i <= N + 1; ++i) {
if (last + L[i - 1] <= X) {
++cnt;
last += L[i - 1];
}
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
/// cin/cout overloading
template <typename T> ostream &operator<<(ostream &out, vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
out << *it << " ";
}
return out;
}
template <typename T> ostream &operator<<(ostream &out, pair<T, T> &P) {
out << P.first << " " << P.second;
return out;
}
template <typename T> istream &operator>>(istream &in, vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
in >> *it;
}
return in;
}
template <typename T> istream &operator>>(istream &in, pair<T, T> &P) {
in >> P.first >> P.second;
return in;
}
/// 图相关
ll N, M;
//
// struct Edge {
// ll to;
// ll weight;
// ll next;
// bool operator<(const Edge& rhs) {
// return weight < rhs.weight;
// }
// };
struct Edge2 {
ll u, v, w;
Edge2(ll u_, ll v_, ll w_) : u(u_), v(v_), w(w_) {}
Edge2() : u(0ll), v(0ll), w(0ll) {}
bool operator<(const Edge2 &rhs) { return w < rhs.w; }
};
// vector<Edge> edges(MAXN);
// vector<ll> head(MAXN, -1);
// vector<int> matchingx(MAXN, -1);
// vector<int> matchingy(MAXN, -1);
// vector<bool> check(MAXN);
// vector<ll> dis(MAXN);
// vector<bool> vis(MAXN, false);
//
// ll cnt = 1;
//
// void addEdge(ll from, ll to, ll weight) {
// edges[cnt].to = to;
// edges[cnt].weight = weight;
// edges[cnt].next = head[from];
// head[from] = cnt++;
//}
//
// bool dfs(int u) {
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (!check[v]) {
// check[v] = true;
// if (matchingy[v] == -1 || dfs(matchingy[v])) {
// matchingy[v] = u;
// matchingx[u] = v;
// return true;
// }
// }
// }
// return false;
//}
//
// int hungarian() {
// int ans = 0;
// fill(matchingx.begin(), matchingx.end(), -1);
// fill(matchingy.begin(), matchingy.end(), -1);
// for (int u = 1; u <= N; ++u) {
//// if (matchingx[u] == -1) {
// {
// fill(check.begin(), check.end(), false);
// if (dfs(u)) {
// ++ans;
// }
// }
// }
// return ans;
//}
//
// void dijkstra(const ll s) {
// priority_queue<P, vector<P>, greater<P>> que;
// fill(dis.begin(), dis.end(), INF);
// dis[s] = 0;
// que.push(P(0, s));
//////multiple sources
//// for (auto& x : shops) {
//// dis[x] = 0;
//// que.push(P(0, x));
//// }
// while (!que.empty()) {
// P p = que.top();
// que.pop();
//// cout << "pop " << p.second << endl;
// int u = p.second;
// if (dis[u] < p.first) continue;
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (dis[v] > dis[u] + edges[i].weight) {
// dis[v] = dis[u] + edges[i].weight;
//// cout << "push " << v << endl;
// que.push(P(dis[v], v));
// }
// }
// }
//}
// void zeroOneBFS(const int s) {
// deque<P> que;
// fill(dis.begin(), dis.end(), INF);
// dis[s] = 0;
// que.push_front(P(0, s));
// while (!que.empty()) {
// P p = que.front();
// que.pop_front();
// int u = p.second;
// if (dis[u] < p.first) continue;
// for (int i = head[u]; i != -1; i = edges[i].next) {
// int v = edges[i].to;
// if (dis[v] > dis[u] + edges[i].weight) {
// dis[v] = dis[u] + edges[i].weight;
// if (edges[i].weight) {
// que.push_back(P(dis[v], v));
// } else {
// que.push_front(P(dis[v], v));
// }
// }
// }
// }
//}
// Union-Find 并查集
class UnionFind {
vector<ll> par;
public:
explicit UnionFind(ll n) : par(n, -1) {}
ll root(ll a) {
if (par[a] < 0) {
return a;
}
return par[a] = root(par[a]);
}
ll size(ll a) { return -par[root(a)]; }
void unite(ll a, ll b) {
a = root(a);
b = root(b);
if (a != b) {
if (size(a) < size(b)) {
swap(a, b);
}
par[a] += par[b];
par[b] = a;
}
}
};
ll kruskal(vector<Edge2> &edges2, const ll V) {
sort(edges2.begin(), edges2.end());
UnionFind uf(V + 10);
ll res = 0;
Edge2 e;
for (int i = 0; i < edges2.size(); ++i) {
e = edges2[i];
if (uf.root(e.u) != uf.root(e.v)) {
uf.unite(e.u, e.v);
res += e.w;
}
}
return res;
}
/// 线段树
// struct SegmentTreeNode {
// ll maxVal;
// ll minVal;
// ll sum;
// ll len;
// ll lazy;
// ll left, right;
// SegmentTreeNode() {}
//};
//
// class SegmentTree {
// public:
// explicit SegmentTree(size_t size, const vll& nums) : tree(size << 2),
// nums(nums) {
//
// }
// void build(ll root, ll left, ll right) {
// tree[root].lazy = 0;
// tree[root].left = left;
// tree[root].right = right;
// tree[root].len = right - left + 1;
// if (left == right) {
// tree[root].maxVal = nums[left];
// tree[root].minVal = nums[left];
// tree[root].sum = nums[left];
// } else {
// ll mid = (right - left) / 2 + left;
// build(root * 2, left, mid);
// build(root * 2 + 1, mid + 1, right);
// tree[root].minVal = min(tree[root * 2].minVal, tree[root * 2 +
// 1].minVal); tree[root].maxVal = max(tree[root * 2].maxVal,
// tree[root * 2 + 1].maxVal); tree[root].sum = tree[root * 2].sum +
// tree[root * 2 + 1].sum;
// }
// }
//
// void pushup(ll root) {
// tree[root].minVal = min(tree[root * 2].minVal, tree[root * 2 +
// 1].minVal); tree[root].maxVal = max(tree[root * 2].maxVal, tree[root *
// 2 + 1].maxVal); tree[root].sum = tree[root * 2].sum + tree[root * 2 +
// 1].sum;
// }
////// add single node val
// void add(ll root, ll id, ll addVal) {
// if (tree[root].left == tree[root].right) {
// tree[root].maxVal += addVal;
// tree[root].minVal += addVal;
// tree[root].sum += addVal;
// return;
// }
// ll mid = (tree[root].right - tree[root].left) / 2 + tree[root].left;
// if (id <= mid) {
// add(root * 2, id, addVal);
// } else {
// add(root * 2 + 1, id, addVal);
// }
// pushup(root);
// }
//
// void pushdown(ll root) {
// if (tree[root].lazy) {
// tree[root * 2].lazy += tree[root].lazy;
// tree[root * 2 + 1].lazy += tree[root].lazy;
// tree[root * 2].sum += tree[root * 2].len * tree[root].lazy;
// tree[root * 2 + 1].sum += tree[root * 2 + 1].len *
// tree[root].lazy; tree[root * 2].maxVal += tree[root].lazy;
// tree[root * 2 + 1].maxVal += tree[root].lazy;
// tree[root * 2].minVal += tree[root].lazy;
// tree[root * 2 + 1].minVal += tree[root].lazy;
// tree[root].lazy = 0;
// }
// }
// //// query range sum
// ll querySum(ll root, ll left, ll right) {
// if (tree[root].left >= left && tree[root].right <= right) {
// return tree[root].sum;
// }
// if (tree[root].left > right || tree[root].right < left) {
// return 0;
// }
// if (tree[root].lazy) {
// pushdown(root);
// }
// return querySum(root * 2, left, right) + querySum(root * 2 + 1, left,
// right);
// }
// //// query range max/min
// ll queryMax(ll root, ll left, ll right) {
// if (tree[root].left >= left && tree[root].right <= right) {
// return tree[root].maxVal;
// }
// if (tree[root].left > right || tree[root].right < left) {
// return -INF;
// }
// if (tree[root].lazy) {
// pushdown(root);
// }
// return max(queryMax(root * 2, left, right), queryMax(root * 2 + 1,
// left, right));
// }
//
// ll queryMin(ll root, ll left, ll right) {
// if (tree[root].left >= left && tree[root].right <= right) {
// return tree[root].minVal;
// }
// if (tree[root].left > right || tree[root].right < left) {
// return INF;
// }
// if (tree[root].lazy) {
// pushdown(root);
// }
// return min(queryMin(root * 2, left, right), queryMin(root * 2 + 1,
// left, right));
// }
// //// add range val
// void update(ll root, ll left, ll right, ll addVal) {
// if (tree[root].left >= left && tree[root].right <= right) {
// tree[root].lazy += addVal;
// tree[root].sum += tree[root].len * addVal;
// tree[root].maxVal += addVal;
// tree[root].minVal += addVal;
// return;
// }
// if (tree[root].left > right || tree[root].right < left) {
// return;
// }
// if (tree[root].lazy) {
// pushdown(root);
// }
// update(root * 2, left, right, addVal);
// update(root * 2 + 1, left, right, addVal);
// pushup(root);
// }
//
//
// private:
// vector<SegmentTreeNode> tree;
// const vll &nums;
//};
/// 组合数
////約数求める //約数
// void divisor(ll n, vector<ll> &ret) {
// for (ll i = 1; i * i <= n; i++) {
// if (n % i == 0) {
// ret.push_back(i);
// if (i * i != n) ret.push_back(n / i);
// }
// }
// sort(ret.begin(), ret.end());
//}
////階乗
// ll factorial(ll n, ll mod) {
// ll ret = 1;
// for (ll i = 1; i <= n; i++) {
// ret = (ret * i) % mod;
// }
// return ret;
//}
////モジュラ逆数
// ll inv_mod(ll n, ll mod) {
// ll a = n % mod, b = mod - 2, ret = 1;
// while (b > 0) {
// if (b & 1) ret = (ret * a) % mod;
// a = (a * a) % mod;
// b >>= 1;
// }
// return ret;
//}
//
// ll nPr(ll n, ll r, ll mod) {
// ll ret = 1;
// for (ll i = n; i >= n - r + 1; i--) {
// ret = ret * (i % mod) % mod;
// }
// return ret;
//}
//
// ll nCr(ll n, ll r, ll mod) {
// return nPr(n, r, mod) * inv_mod(factorial(r, mod), mod) % mod;
//}
//
// vll F(MAXN), Finv(MAXN), inv(MAXN);
//
// ll pow_mod(ll a, ll b, ll p) {
// ll ret = 1;
// while (b) {
// if (b & 1) ret = (ret * a) % p;
// a = (a * a) % p;
// b >>= 1;
// }
// return ret;
//}
//
// void comb_init() {
// inv[1] = 1;
// for (int i = 2; i < MAXN; ++i) {
// inv[i] = (MOD - MOD / i) * 1ll * inv[MOD % i] % MOD;
// }
// F[0] = Finv[0] = 1;
// for (int i = 1; i < MAXN; ++i) {
// F[i] = F[i-1] * 1ll * i % MOD;
// Finv[i] = Finv[i-1] * 1ll * inv[i] % MOD;
// }
//}
//
// inline ll comb(ll n, ll m) {
// if (m < 0 || m > n) return 0;
// return F[n] * 1ll * Finv[n - m] % MOD * Finv[m] % MOD;
//}
//
inline ll add_mod(ll a, ll b) { return (a + b) % MOD; }
inline ll mul_mod(ll a, ll b) { return a * b % MOD; }
inline ll sub_mod(ll a, ll b) { return (a + MOD - b) % MOD; }
/// main函数
int main() {
int N, X;
cin >> N >> X;
vi L(N + 1);
for (int i = 1; i <= N; ++i) {
cin >> L[i];
}
int cnt = 1;
int last = 0;
for (int i = 2; i <= N + 1; ++i) {
if (last + L[i - 1] <= X) {
++cnt;
last += L[i - 1];
} else {
break;
}
}
cout << cnt << endl;
return 0;
} | [
"control_flow.branch.else.add"
] | 813,296 | 813,297 | u666721654 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, x, point = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i != n; i++)
cin >> l[i];
for (int i = 0; i != n; i++) {
point += l[i];
if (point > x) {
cout << i + 1 << endl;
return 0;
}
}
cout << n << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, x, point = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i != n; i++)
cin >> l[i];
for (int i = 0; i != n; i++) {
point += l[i];
if (point > x) {
cout << i + 1 << endl;
return 0;
}
}
cout << n + 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 813,298 | 813,299 | u762917276 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3")
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define MOD 1000000007
#define PI 3.14159265359
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
typedef tree<pii,null_type,less
<pii>,rb_tree_tag,tree_order_statistics_node_update>ind_set;
*/
///*X.find_by_order("index")
/// X.order_of_key("key")
#define deb(x) cerr << #x << " : " << x << "\n";
#ifndef local
#define deb(x) ;
#endif
///----------------------------------------------------------------------------------
int n, x, l[100005];
void solve() {
cin >> n >> x;
rep(i, 0, n) cin >> l[i];
int ans = 1;
int c = 0, num = 0;
while (1) {
c += l[num++];
if (c <= x)
ans++;
else
break;
}
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef local
freopen("input.txt", "r", stdin);
/// freopen("output.txt","w",stdout);
#endif
clock_t qwertyuiop = clock();
int t = 1;
/// cin>>t;
rep(a, 0, t) {
/// cout<<"Case #"<<a+1<<": ";
solve();
}
#ifdef local
{
qwertyuiop = clock() - qwertyuiop;
double time_taken = ((double)qwertyuiop) / CLOCKS_PER_SEC;
cerr << fixed << setprecision(5) << "\n\nTime Taken : " << time_taken
<< " seconds\n";
}
#endif
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3")
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define MOD 1000000007
#define PI 3.14159265359
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
typedef tree<pii,null_type,less
<pii>,rb_tree_tag,tree_order_statistics_node_update>ind_set;
*/
///*X.find_by_order("index")
/// X.order_of_key("key")
#define deb(x) cerr << #x << " : " << x << "\n";
#ifndef local
#define deb(x) ;
#endif
///----------------------------------------------------------------------------------
int n, x, l[100005];
void solve() {
cin >> n >> x;
rep(i, 0, n) cin >> l[i];
int ans = 1;
int c = 0, num = 0;
while (num < n) {
c += l[num++];
if (c <= x)
ans++;
else
break;
}
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef local
freopen("input.txt", "r", stdin);
/// freopen("output.txt","w",stdout);
#endif
clock_t qwertyuiop = clock();
int t = 1;
/// cin>>t;
rep(a, 0, t) {
/// cout<<"Case #"<<a+1<<": ";
solve();
}
#ifdef local
{
qwertyuiop = clock() - qwertyuiop;
double time_taken = ((double)qwertyuiop) / CLOCKS_PER_SEC;
cerr << fixed << setprecision(5) << "\n\nTime Taken : " << time_taken
<< " seconds\n";
}
#endif
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 813,300 | 813,301 | u953587543 | cpp |
p03000 | using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> D(N);
int now = 0, r = 1;
for (auto &i : D) {
cin >> i;
now += i;
if (i <= M)
r++;
}
cout << r << endl;
return 0;
}
| using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> D(N);
int now = 0, r = 1;
for (auto &i : D) {
cin >> i;
now += i;
if (now <= M)
r++;
}
cout << r << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,302 | 813,303 | u766779796 | cpp |
p03000 | #include <bits/stdc++.h>
#include <iomanip> // std::setprecision
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) \
asm("bsrl %1,%0" \
: "=r"(msb) \
: "r"(n)) // get the highest bit of x, maybe the fastest
#define IN(i, l, r) (l < i && i < r) // the next for are for checking bound
#define LINR(i, l, r) (l <= i && i <= r)
#define LIN(i, l, r) (l <= i && i < r)
#define INR(i, l, r) (l < i && i <= r)
#define F(i, L, R) for (int i = L; i < R; i++) // next four are for "for loops"
#define FE(i, L, R) for (int i = L; i <= R; i++)
#define FF(i, L, R) for (int i = L; i > R; i--)
#define FFE(i, L, R) for (int i = L; i >= R; i--)
#define char2Int(c) (c - '0')
#define lastEle(vec) vec[vec.size() - 1]
#define SZ(x) ((int)((x).size()))
#define REMAX(a, b) (a) = max((a), (b)) // set a to the maximum of a and b
#define REMIN(a, b) (a) = min((a), (b));
#define FENWICK(k) (k & -k)
#define FOREACH(i, t) \
for (auto i = t.begin(); i != t.end(); i++) // traverse an STL data structure
#define ALL(c) (c).begin(), (c).end() // handy for function like "sort()"
#define PRESENT(c, x) ((c).find(x) != (c).end())
#define CPRESENT(c, x) (find(ALL(c), x) != (c).end())
#define LL \
long long // data types used often, but you don't want to type them time by
// time
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define IOS \
ios_base::sync_with_stdio(0); // to synchronize the input of cin and scanf
#define INF 1001001001
#define PI 3.1415926535897932384626
// for map, pair
#define mp make_pair
#define fi first
#define se second
// for vectors
#define pb push_back
typedef int elem_t;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
// directions
const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
const int rogi[4][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
int n, x;
void dane() {
cin >> n >> x;
int ans = 0;
int d = -1;
F(i, 0, n) {
int l;
cin >> l;
ans += l;
if (ans > x && d == -1) {
d = i + 1;
}
}
cout << (d == -1 ? n : d) << endl;
}
int main() {
IOS
// int t;
// cin>>t;
// F(i,0,t)
dane();
return 0;
} | #include <bits/stdc++.h>
#include <iomanip> // std::setprecision
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) \
asm("bsrl %1,%0" \
: "=r"(msb) \
: "r"(n)) // get the highest bit of x, maybe the fastest
#define IN(i, l, r) (l < i && i < r) // the next for are for checking bound
#define LINR(i, l, r) (l <= i && i <= r)
#define LIN(i, l, r) (l <= i && i < r)
#define INR(i, l, r) (l < i && i <= r)
#define F(i, L, R) for (int i = L; i < R; i++) // next four are for "for loops"
#define FE(i, L, R) for (int i = L; i <= R; i++)
#define FF(i, L, R) for (int i = L; i > R; i--)
#define FFE(i, L, R) for (int i = L; i >= R; i--)
#define char2Int(c) (c - '0')
#define lastEle(vec) vec[vec.size() - 1]
#define SZ(x) ((int)((x).size()))
#define REMAX(a, b) (a) = max((a), (b)) // set a to the maximum of a and b
#define REMIN(a, b) (a) = min((a), (b));
#define FENWICK(k) (k & -k)
#define FOREACH(i, t) \
for (auto i = t.begin(); i != t.end(); i++) // traverse an STL data structure
#define ALL(c) (c).begin(), (c).end() // handy for function like "sort()"
#define PRESENT(c, x) ((c).find(x) != (c).end())
#define CPRESENT(c, x) (find(ALL(c), x) != (c).end())
#define LL \
long long // data types used often, but you don't want to type them time by
// time
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define IOS \
ios_base::sync_with_stdio(0); // to synchronize the input of cin and scanf
#define INF 1001001001
#define PI 3.1415926535897932384626
// for map, pair
#define mp make_pair
#define fi first
#define se second
// for vectors
#define pb push_back
typedef int elem_t;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
// directions
const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
const int rogi[4][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
int n, x;
void dane() {
cin >> n >> x;
int ans = 0;
int d = -1;
F(i, 0, n) {
int l;
cin >> l;
ans += l;
if (ans > x && d == -1) {
d = i + 1;
}
}
cout << (d == -1 ? (n + 1) : d) << endl;
}
int main() {
IOS
// int t;
// cin>>t;
// F(i,0,t)
dane();
return 0;
} | [] | 813,308 | 813,309 | u381312634 | cpp |
p03000 | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef long long ll;
ll inf = -1;
ll mod = mod = pow(10, 9) + 7;
int main() {
int n, x;
cin >> n >> x;
int d = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
d = d + l;
if (d <= x) {
ans++;
} else {
cout << ans << endl;
return 0;
}
}
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef long long ll;
ll inf = -1;
ll mod = mod = pow(10, 9) + 7;
int main() {
int n, x;
cin >> n >> x;
int d = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
d = d + l;
if (d <= x) {
ans++;
} else {
break;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.break.add"
] | 813,310 | 813,311 | u678503521 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
vector<int> par(100010);
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
par[x] = y;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x, a = 0;
cin >> n >> x;
int t = 0;
rep(i, n) {
int l;
cin >> l;
if (t + l > x) {
a = i + 1;
break;
}
t += l;
}
cout << a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
vector<int> par(100010);
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
par[x] = y;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x, a = 0;
cin >> n >> x;
int t = 0;
a = n + 1;
rep(i, n) {
int l;
cin >> l;
if (t + l > x) {
a = i + 1;
break;
}
t += l;
}
cout << a << endl;
return 0;
} | [
"assignment.add"
] | 813,312 | 813,313 | u604231488 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class AC> void in(AC &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
f |= (ch == '-');
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
x = f ? -x : x;
return;
}
int n, x, ans, d[1005], l[1005];
int main() {
in(n);
in(x);
for (int i = 1; i <= n; i++)
in(l[i]);
for (int i = 2; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
ans++;
}
if (x >= 0)
ans++;
printf("%d\n", ans);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class AC> void in(AC &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
f |= (ch == '-');
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
x = f ? -x : x;
return;
}
int n, x, ans, d[1005], l[1005];
int main() {
in(n);
in(x);
for (int i = 1; i <= n; i++)
in(l[i]);
for (int i = 2; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
ans++;
}
if (x >= 0)
ans++;
printf("%d\n", ans);
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,314 | 813,315 | u591725500 | cpp |
p03000 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define NMAX 110000
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, x;
cin >> n >> x;
vector<int> l, d;
l.resize(n);
d.resize(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];
}
int count(0);
for (int i = 0; i < n; i++) {
if (d[i] <= x)
count++;
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define NMAX 110000
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, x;
cin >> n >> x;
vector<int> l, d;
l.resize(n);
d.resize(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];
}
int count(0);
for (int i = 0; i < n + 1; i++) {
if (d[i] <= x)
count++;
}
cout << count << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,316 | 813,317 | u416434647 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
int n, x;
int bounds[102];
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> bounds[i];
}
int sum = 0;
int result = 0;
for (int i = 1; i <= n; i++) {
sum += bounds[i];
if (sum > x) {
result = i;
break;
}
}
cout << result << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
int n, x;
int bounds[102];
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> bounds[i];
}
int sum = 0;
int result = n + 1;
for (int i = 1; i <= n; i++) {
sum += bounds[i];
if (sum > x) {
result = i;
break;
}
}
cout << result << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove"
] | 813,318 | 813,319 | u588399226 | cpp |
p03000 | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MAXSIZE 100005
#define MAXL 100
#define MOD_CONST 1000000007
typedef long long int lli;
vector<int> input_vector(const int &num) {
vector<int> res(num);
for (int i = 0; i < num; ++i) {
cin >> res[i];
}
return res;
}
int get_ans(int &point, const int &x, const vector<int> &l_vec) {
int cnt = 1;
for (int i : l_vec) {
point += l_vec[i];
if (point <= x) {
cnt++;
}
}
return cnt;
}
int main() {
int n, x;
cin >> n >> x;
vector<int> l_vec = input_vector(n);
int point = 0;
int ans = get_ans(point, x, l_vec);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MAXSIZE 100005
#define MAXL 100
#define MOD_CONST 1000000007
typedef long long int lli;
vector<int> input_vector(const int &num) {
vector<int> res(num);
for (int i = 0; i < num; ++i) {
cin >> res[i];
}
return res;
}
int get_ans(int &point, const int &x, const vector<int> &l_vec) {
int cnt = 1;
for (int i : l_vec) {
point += i;
if (point <= x) {
cnt++;
}
}
return cnt;
}
int main() {
int n, x;
cin >> n >> x;
vector<int> l_vec = input_vector(n);
int point = 0;
int ans = get_ans(point, x, l_vec);
cout << ans << endl;
return 0;
} | [] | 813,320 | 813,321 | u078832908 | cpp |
p03000 | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
using ll = long long int;
int main(void) {
int n, x;
cin >> n >> x;
vector<int> v(n);
int d = 0;
int prev = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
d = prev + v[i];
prev = d;
if (d > x) {
std::cout << i + 1 << std::endl;
break;
}
}
if (d > x)
std::cout << n << std::endl;
else
std::cout << n + 1 << std::endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
using ll = long long int;
int main(void) {
int n, x;
cin >> n >> x;
vector<int> v(n);
int d = 0;
int prev = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
d = prev + v[i];
prev = d;
if (d > x) {
std::cout << i + 1 << std::endl;
return 0;
}
}
if (d > x)
std::cout << n << std::endl;
else
std::cout << n + 1 << std::endl;
return 0;
}
| [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 813,324 | 813,325 | u131340563 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[110], D[110], z = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i - 1];
}
for (int i = 0; i < N; i++) {
if (D[i] <= X) {
z = z + 1;
}
}
cout << z << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, X, L[110], D[110], z = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
}
for (int i = 0; i < N + 1; i++) {
if (D[i] <= X) {
z = z + 1;
}
}
cout << z << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,332 | 813,333 | u428229036 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X, L[110], D[110], z = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i];
}
for (int i = 0; i < N; i++) {
if (D[i] <= X) {
z = z + 1;
}
}
cout << z << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, X, L[110], D[110], z = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
}
for (int i = 0; i < N + 1; i++) {
if (D[i] <= X) {
z = z + 1;
}
}
cout << z << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 813,334 | 813,333 | u428229036 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
int D = 0;
int count = 0;
for (int i = 0; i < N; i++) {
D = D + L.at(i);
if (D <= X) {
count++;
}
}
cout << count << endl;
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);
}
int D = 0;
int count = 0;
for (int i = 0; i < N; i++) {
D = D + L.at(i);
if (D <= X) {
count++;
}
}
cout << count + 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 813,337 | 813,338 | u394973531 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int dp[110];
int N, X;
cin >> N >> X;
int L[110];
for (int i = 0; i < N; ++i)
cin >> L[i];
for (int i = 0; i < N; ++i) {
if (i == 0)
dp[i] = 0;
else
dp[i] = dp[i - 1] + L[i - 1];
}
int count = 0;
for (int i = 0; i < N; ++i) {
if (dp[i] <= X)
count++;
else
break;
}
cout << count << endl;
} | #include <iostream>
using namespace std;
int main() {
int dp[110];
int N, X;
cin >> N >> X;
int L[110];
for (int i = 0; i < N; ++i)
cin >> L[i];
for (int i = 0; i <= N; ++i) {
if (i == 0)
dp[i] = 0;
else
dp[i] = dp[i - 1] + L[i - 1];
}
int count = 0;
for (int i = 0; i <= N; ++i) {
if (dp[i] <= X)
count++;
else
break;
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,339 | 813,340 | u730594702 | cpp |
p03000 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
using namespace __gnu_pbds;
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<int, int>> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
// constants
const long long MOD = 1000000007;
const long long MAX = 100005;
const long double PI = 3.14159265359;
const long double G = 9.807;
const long long INF = 1e18;
const long double EPS = 1e-6;
// gcd of a and b
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
// distance between (a,b) and (c,d)
long double dis(long long a, long long b, long long c, long long d) {
return sqrt(((a) - (c)) * ((a) - (c)) + ((b) - (d)) * ((b) - (d)));
}
// simple prime check
bool isprime(long long a) {
if (a == 2)
return 1;
if (!(a & 1))
return 0;
for (ll i = 3; i * i <= a; i += 2) {
if (a % i == 0)
return 0;
}
return 1;
}
// fast expo
long long mpow(long long base, long long exponent, long long modulus) {
if (modulus == 1)
return 0;
long long result = 1;
base = base % modulus;
while (exponent) {
if (exponent % 2 == 1)
result = (result * base) % modulus;
exponent = exponent >> 1;
base = (base * base) % modulus;
}
return result;
}
// modular inverse
ll minv(ll a, ll mod) {
ll _gcd = gcd(a, mod);
assert(_gcd == 1);
return mpow(a, mod - 2, mod);
}
/*
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>;
*/
/*
ll dx[]={1,0,-1,0,1,1,-1,-1};
ll dy[]={0,-1,0,1,1,-1,-1,1};
*/
/*
void sieve(int N){
for(int i=0;i<=N;i++){
spf[i]=i;
}
for(int i=2;i*i<=N;i++){
if(spf[i]==i){
for(int j=i*i;j<=N;j+=i){
spf[j]=min(spf[j],i);
}
}
}
return;
}
*/
/*
void nCr(ll n,ll k){
ll i,j;
for(i=0;i<=n;i++){
for(j=0;j<=min(i,k);j++){
if(j==0 or j==i)C[i][j]=1LL;
else C[i][j]=(C[i-1][j-1]+C[i-1][j])%MOD;
}
}
return;
}
*/
/*
ll ncr(ll N,ll K){
if(N<K)return 0;
if(K==0)return 1;
if(N==0)return 0;
ll den=1;
for(ll i=1;i<=K;i++)den*=i;
ll num=1;
while(K--){
num*=N;
if(num%den==0){
num/=den;
den=1;
}
N--;
}
return num;
}
*/
ll n, x;
ll l[1005], d[1005];
int main() {
FAST;
cin >> n >> x;
for (ll i = 1; i <= n; i++) {
cin >> l[i];
}
for (ll i = 2; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
}
ll ans = 0;
for (ll i = 1; i <= n; i++)
if (d[i] <= x)
ans++;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
using namespace __gnu_pbds;
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<int, int>> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
// constants
const long long MOD = 1000000007;
const long long MAX = 100005;
const long double PI = 3.14159265359;
const long double G = 9.807;
const long long INF = 1e18;
const long double EPS = 1e-6;
// gcd of a and b
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
// distance between (a,b) and (c,d)
long double dis(long long a, long long b, long long c, long long d) {
return sqrt(((a) - (c)) * ((a) - (c)) + ((b) - (d)) * ((b) - (d)));
}
// simple prime check
bool isprime(long long a) {
if (a == 2)
return 1;
if (!(a & 1))
return 0;
for (ll i = 3; i * i <= a; i += 2) {
if (a % i == 0)
return 0;
}
return 1;
}
// fast expo
long long mpow(long long base, long long exponent, long long modulus) {
if (modulus == 1)
return 0;
long long result = 1;
base = base % modulus;
while (exponent) {
if (exponent % 2 == 1)
result = (result * base) % modulus;
exponent = exponent >> 1;
base = (base * base) % modulus;
}
return result;
}
// modular inverse
ll minv(ll a, ll mod) {
ll _gcd = gcd(a, mod);
assert(_gcd == 1);
return mpow(a, mod - 2, mod);
}
/*
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>;
*/
/*
ll dx[]={1,0,-1,0,1,1,-1,-1};
ll dy[]={0,-1,0,1,1,-1,-1,1};
*/
/*
void sieve(int N){
for(int i=0;i<=N;i++){
spf[i]=i;
}
for(int i=2;i*i<=N;i++){
if(spf[i]==i){
for(int j=i*i;j<=N;j+=i){
spf[j]=min(spf[j],i);
}
}
}
return;
}
*/
/*
void nCr(ll n,ll k){
ll i,j;
for(i=0;i<=n;i++){
for(j=0;j<=min(i,k);j++){
if(j==0 or j==i)C[i][j]=1LL;
else C[i][j]=(C[i-1][j-1]+C[i-1][j])%MOD;
}
}
return;
}
*/
/*
ll ncr(ll N,ll K){
if(N<K)return 0;
if(K==0)return 1;
if(N==0)return 0;
ll den=1;
for(ll i=1;i<=K;i++)den*=i;
ll num=1;
while(K--){
num*=N;
if(num%den==0){
num/=den;
den=1;
}
N--;
}
return num;
}
*/
ll n, x;
ll l[1005], d[1005];
int main() {
FAST;
cin >> n >> x;
for (ll i = 1; i <= n; i++) {
cin >> l[i];
}
for (ll i = 2; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
}
ll ans = 0;
for (ll i = 1; i <= n + 1; i++)
if (d[i] <= x)
ans++;
cout << ans;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,341 | 813,342 | u091650402 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void _dump(const char *s, T &&head) {
cerr << s << "=" << head << endl;
}
template <typename T, typename... Args>
void _dump(const char *s, T &&head, Args &&...tail) {
while (*s != ',')
cerr << *s++;
cerr << "=" << head << ",";
_dump(s + 1, tail...);
}
template <typename T> void _dumpv(const char *s, T &&v) {
cerr << *s << "=";
for (auto it = v.begin(); it != v.end(); it++) {
cerr << *it << " ";
}
cerr << endl;
}
#define dump(...) _dump(#__VA_ARGS__, __VA_ARGS__)
#define dumpv(...) _dumpv(#__VA_ARGS__, __VA_ARGS__)
// #define dump(...)
// #define dumpv(...)
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("template.1", "r", stdin);
int N, X;
cin >> N >> X;
vector<int> L(N);
int i;
for (i = 0; i < N; i++) {
cin >> L[i];
}
int ans = 1;
int x = 0;
// dump(N, X);
for (i = 1; i < N; i++) {
x = x + L[i - 1];
if (X < x) {
break;
}
ans++;
// dump(ans, x);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void _dump(const char *s, T &&head) {
cerr << s << "=" << head << endl;
}
template <typename T, typename... Args>
void _dump(const char *s, T &&head, Args &&...tail) {
while (*s != ',')
cerr << *s++;
cerr << "=" << head << ",";
_dump(s + 1, tail...);
}
template <typename T> void _dumpv(const char *s, T &&v) {
cerr << *s << "=";
for (auto it = v.begin(); it != v.end(); it++) {
cerr << *it << " ";
}
cerr << endl;
}
#define dump(...) _dump(#__VA_ARGS__, __VA_ARGS__)
#define dumpv(...) _dumpv(#__VA_ARGS__, __VA_ARGS__)
// #define dump(...)
// #define dumpv(...)
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("template.1", "r", stdin);
int N, X;
cin >> N >> X;
vector<int> L(N);
int i;
for (i = 0; i < N; i++) {
cin >> L[i];
}
int ans = 1;
int x = 0;
// dump(N, X);
for (i = 1; i <= N; i++) {
x = x + L[i - 1];
if (X < x) {
break;
}
ans++;
// dump(ans, x);
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,345 | 813,346 | u147305315 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N, X, s = 0;
cin >> N >> X;
vector<ll> L(N);
for (auto &l : L)
cin >> l;
for (int i = 0; i < N; i++) {
s += L[i];
if (s > X) {
cout << i + 1 << endl;
break;
}
}
cout << N + 1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N, X, s = 0;
cin >> N >> X;
vector<ll> L(N);
for (auto &l : L)
cin >> l;
for (int i = 0; i < N; i++) {
s += L[i];
if (s > X) {
cout << i + 1 << endl;
return 0;
}
}
cout << N + 1 << endl;
return 0;
} | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 813,349 | 813,350 | u634208461 | cpp |
p03000 | #include <iostream>
#include <stdio.h>
using namespace std;
int l[110];
int N, X;
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> l[i];
int r = 0;
int cnt = 0;
while (r <= X && cnt < N) {
r += l[cnt];
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int l[110];
int N, X;
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> l[i];
int r = 0;
int cnt = 0;
while (r <= X && cnt <= N) {
r += l[cnt];
cnt++;
}
cout << cnt << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 813,351 | 813,352 | u090967649 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<int> d(n + 1);
for (int i = 1; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
}
for (int i = 0; i <= n; i++) {
if (d[i] > x) {
cout << i << endl;
return 0;
}
}
cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<int> d(n + 1);
for (int i = 1; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
}
for (int i = 0; i <= n; i++) {
if (d[i] > x) {
cout << i << endl;
return 0;
}
}
cout << n + 1 << endl;
} | [
"expression.operation.binary.add"
] | 813,353 | 813,354 | u881599732 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
int main() {
int n, x;
cin >> n >> x;
int l[n], d[n + 1];
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
d[0] = 0;
int ans = 1;
for (int i = 1; i < n; ++i) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
int main() {
int n, x;
cin >> n >> x;
int l[n], d[n + 1];
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
d[0] = 0;
int ans = 1;
for (int i = 1; i <= n; ++i) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
ans++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,355 | 813,356 | u876386943 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) xの絶対値
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) x!
int fib(int x) {
if (x <= 2)
return x;
int a[x];
a[0] = 1;
a[1] = 2;
for (int i = 2; i < x; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[x - 1];
} //(x) フィボナッチ数列のx番目
int div1(ll x) { return x % 1000000007; }
main() {
int n = in(), x = in(), l[n], m = 0, i;
forin(l, n);
for (i = 0; i < n; i++) {
m += l[n];
if (m > x)
break;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) xの絶対値
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) x!
int fib(int x) {
if (x <= 2)
return x;
int a[x];
a[0] = 1;
a[1] = 2;
for (int i = 2; i < x; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[x - 1];
} //(x) フィボナッチ数列のx番目
int div1(ll x) { return x % 1000000007; }
main() {
int n = in(), x = in(), l[n], m = 0, i;
forin(l, n);
for (i = 0; i < n; i++) {
m += l[i];
if (m > x)
break;
}
cout << i + 1 << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 813,361 | 813,362 | u160321725 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const int MAX_N = 100;
int main(void) {
int N, X;
int L[MAX_N];
int answer = 0;
int D = 0;
cin >> N >> X;
rep(i, N) cin >> L[i];
int i = 0;
while (D <= X || answer < N + 1) {
D += L[i];
i++;
answer++;
}
cout << answer << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const int MAX_N = 100;
int main(void) {
int N, X;
int L[MAX_N];
int answer = 0;
int D = 0;
cin >> N >> X;
rep(i, N) cin >> L[i];
int i = 0;
while (D <= X && answer < N + 1) {
D += L[i];
i++;
answer++;
}
cout << answer << endl;
return 0;
} | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 813,363 | 813,364 | u767543103 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const int MAX_N = 100;
int main(void) {
int N, X;
int L[MAX_N];
int answer = 0;
int D = 0;
cin >> N >> X;
rep(i, N) cin >> L[i];
int i = 0;
while (D <= X) {
D += L[i];
i++;
answer++;
}
cout << answer << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const int MAX_N = 100;
int main(void) {
int N, X;
int L[MAX_N];
int answer = 0;
int D = 0;
cin >> N >> X;
rep(i, N) cin >> L[i];
int i = 0;
while (D <= X && answer < N + 1) {
D += L[i];
i++;
answer++;
}
cout << answer << endl;
return 0;
} | [
"control_flow.loop.condition.change"
] | 813,365 | 813,364 | u767543103 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int d[n + 2];
d[0] = 0;
for (int i = 1; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
}
int ans = 0;
rep(i, n + 2) {
if (x >= d[i])
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int d[n + 1];
d[0] = 0;
for (int i = 1; i < n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
}
int ans = 0;
rep(i, n + 1) {
if (x >= d[i])
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change"
] | 813,379 | 813,380 | u241908712 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int d[n + 2];
d[0] = 0;
for (int i = 1; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
}
int ans = 0;
rep(i, n) {
if (x >= d[i])
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
int d[n + 1];
d[0] = 0;
for (int i = 1; i < n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
}
int ans = 0;
rep(i, n + 1) {
if (x >= d[i])
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 813,381 | 813,380 | u241908712 | cpp |
p03000 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
REP(i, n) cin >> L[i];
vector<int> D(n + 1);
D[0] = 0;
int ans = 1;
for (int i = 1; i <= n + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
REP(i, n) cin >> L[i];
vector<int> D(n + 1);
D[0] = 0;
int ans = 1;
for (int i = 1; i < n + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
ans++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,382 | 813,383 | u276682785 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
int n, x;
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> a[i];
int curr = 0, ans = 1;
;
for (int i = 2; i <= n; i++) {
curr += a[i - 1];
if (curr <= x)
ans++;
else
break;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
int n, x;
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> a[i];
int curr = 0, ans = 1;
;
for (int i = 2; i <= n + 1; i++) {
curr += a[i - 1];
if (curr <= x)
ans++;
else
break;
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,390 | 813,391 | u365513379 | cpp |
p03000 | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/05/20.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int place = 0;
for (int i = 0; i < N; i++) {
place += L[i];
if (place > X) {
cout << i + 1 << endl;
return 0;
;
}
}
cout << N << endl;
return 0;
}
| //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/05/20.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int place = 0;
for (int i = 0; i < N; i++) {
place += L[i];
if (place > X) {
cout << i + 1 << endl;
return 0;
;
}
}
cout << N + 1 << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 813,394 | 813,395 | u422769833 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
using ll = long long;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int D = 0;
int cnt = 1;
rep(i, N - 1) {
D += L[i];
if (D > X)
break;
cnt++;
}
cout << cnt << endl;
} | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
using ll = long long;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int D = 0;
int cnt = 1;
rep(i, N) {
D += L[i];
if (D > X)
break;
cnt++;
}
cout << cnt << endl;
}
| [
"expression.operation.binary.remove"
] | 813,396 | 813,397 | u314008046 | cpp |
p03000 | #import <bits/stdc++.h>
using namespace std;
int a, b, c, i, j, k, l, m, n, s, x, y, z, w[105];
main() {
scanf("%d%d", &n, &k);
for (; i++ < n;) {
scanf("%d", &x);
s += x;
if (s > k)
return printf("%d", i), 0;
}
printf("%d", n);
} | #import <bits/stdc++.h>
using namespace std;
int a, b, c, i, j, k, l, m, n, s, x, y, z, w[105];
main() {
scanf("%d%d", &n, &k);
for (; i++ < n;) {
scanf("%d", &x);
s += x;
if (s > k)
return printf("%d", i), 0;
}
printf("%d", n + 1);
} | [
"expression.operation.binary.add"
] | 813,404 | 813,405 | u381108555 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int d = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
int y;
cin >> y;
d += y;
if (y <= X)
ans++;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int d = 0;
int ans = 1;
for (int i = 0; i < N; i++) {
int y;
cin >> y;
d += y;
if (d <= X)
ans++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,406 | 813,407 | u792217717 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using llint = long long;
using pint = pair<int, int>;
#define LOG(x) cout << "# " << #x << " => " << (x) << endl
const int INF = 1 << 28;
const llint LLINF = 1LL << 60;
int n, x, ans = 0;
vector<int> l;
vector<int> cumulativeSum(vector<int> &a) {
int n = a.size();
vector<int> res(n);
res.at(0) = 0;
for (int i = 1; i < n; ++i) {
res.at(i) = a.at(i - 1) + res.at(i - 1);
}
return res;
}
int main() {
// Input
cin >> n >> x;
l.resize(n);
for (int i = 0; i < n; ++i) {
cin >> l.at(i);
}
// Solve
vector<int> ls = cumulativeSum(l);
for (int i = 0; i < n; ++i) {
if (ls.at(i) <= x) {
++ans;
}
}
// Output
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using llint = long long;
using pint = pair<int, int>;
#define LOG(x) cout << "# " << #x << " => " << (x) << endl
const int INF = 1 << 28;
const llint LLINF = 1LL << 60;
int n, x, ans = 0;
vector<int> l;
vector<int> cumulativeSum(vector<int> &a) {
int n = a.size();
vector<int> res(n + 1);
res.at(0) = 0;
for (int i = 1; i <= n; ++i) {
res.at(i) = a.at(i - 1) + res.at(i - 1);
}
return res;
}
int main() {
// Input
cin >> n >> x;
l.resize(n);
for (int i = 0; i < n; ++i) {
cin >> l.at(i);
}
// Solve
vector<int> ls = cumulativeSum(l);
for (int i = 0; i <= n; ++i) {
if (ls.at(i) <= x) {
++ans;
}
}
// Output
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,410 | 813,411 | u135954097 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x;
cin >> n >> x;
vector<int> L(n);
int di = 0;
int i;
for (i = 0; i < n; i++) {
cin >> L[i];
di += L[i];
if (di > x)
break;
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x;
cin >> n >> x;
vector<int> L(n);
int di = 0;
int i;
for (i = 0; i < n; i++) {
cin >> L[i];
di += L[i];
if (di > x)
break;
}
cout << i + 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 813,414 | 813,415 | u360441331 | cpp |
p03000 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
vi v(n);
REP(i, n) cin >> v[i];
ll pos = 0;
int cnt = 1;
REP(i, n) {
pos += v[i];
if (x <= pos)
cnt++;
}
cout << cnt << endl;
} | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
vi v(n);
REP(i, n) cin >> v[i];
ll pos = 0;
int cnt = 1;
REP(i, n) {
pos += v[i];
if (x >= pos)
cnt++;
}
cout << cnt << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,420 | 813,421 | u918357423 | cpp |
p03000 | //#define anjn
// Anjan Agarwala - anjn98
//#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// ll power(ll x,ll y,ll p){ll r=1; x=x%p; while(y){ if(y&1) r= r*x%p; y=y>>1;
// x=x*x%p; } return r; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int csrand(int l = 0, int r = 1e9) {
uniform_int_distribution<int> uid(l, r);
return uid(rng);
}
#define PR(x) cout << #x << ": " << x << "\n";
#define PR1(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << "\n";
#define PR2(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z \
<< ": " << z << "\n";
#define ED cout << '\n';
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define FILEIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define all(v) v.begin(), v.end()
#define endl '\n'
#define fr1(j, n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = 0; i < n; i++)
#define trav(x, s) for (auto x : s)
#define PB push_back
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define F first
#define S second
#define binf 2000000000000000001
#define mod 1000000007
const int N = 5e3 + 99;
int32_t main() {
IO
ll n,
x, cnt = 1, d = 0, l;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l;
if (d + l <= x)
cnt++, d += l;
}
cout << cnt << endl;
}
| //#define anjn
// Anjan Agarwala - anjn98
//#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// ll power(ll x,ll y,ll p){ll r=1; x=x%p; while(y){ if(y&1) r= r*x%p; y=y>>1;
// x=x*x%p; } return r; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int csrand(int l = 0, int r = 1e9) {
uniform_int_distribution<int> uid(l, r);
return uid(rng);
}
#define PR(x) cout << #x << ": " << x << "\n";
#define PR1(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << "\n";
#define PR2(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z \
<< ": " << z << "\n";
#define ED cout << '\n';
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define FILEIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define all(v) v.begin(), v.end()
#define endl '\n'
#define fr1(j, n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = 0; i < n; i++)
#define trav(x, s) for (auto x : s)
#define PB push_back
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define F first
#define S second
#define binf 2000000000000000001
#define mod 1000000007
const int N = 5e3 + 99;
int32_t main() {
IO
ll n,
x, cnt = 1, d = 0, l;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l;
if (d + l <= x)
cnt++, d += l;
else
break;
}
cout << cnt << endl;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 813,436 | 813,437 | u089572841 | cpp |
p03000 | //#define anjn
// Anjan Agarwala - anjn98
//#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// ll power(ll x,ll y,ll p){ll r=1; x=x%p; while(y){ if(y&1) r= r*x%p; y=y>>1;
// x=x*x%p; } return r; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int csrand(int l = 0, int r = 1e9) {
uniform_int_distribution<int> uid(l, r);
return uid(rng);
}
#define PR(x) cout << #x << ": " << x << "\n";
#define PR1(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << "\n";
#define PR2(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z \
<< ": " << z << "\n";
#define ED cout << '\n';
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define FILEIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define all(v) v.begin(), v.end()
#define endl '\n'
#define fr1(j, n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = 0; i < n; i++)
#define trav(x, s) for (auto x : s)
#define PB push_back
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define F first
#define S second
#define binf 2000000000000000001
#define mod 1000000007
const int N = 5e3 + 99;
int32_t main() {
IO
int n,
x, cnt = 1, d = 0, l;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l;
if (d + l <= x)
cnt++, d += l;
}
cout << cnt << endl;
}
| //#define anjn
// Anjan Agarwala - anjn98
//#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// ll power(ll x,ll y,ll p){ll r=1; x=x%p; while(y){ if(y&1) r= r*x%p; y=y>>1;
// x=x*x%p; } return r; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int csrand(int l = 0, int r = 1e9) {
uniform_int_distribution<int> uid(l, r);
return uid(rng);
}
#define PR(x) cout << #x << ": " << x << "\n";
#define PR1(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << "\n";
#define PR2(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z \
<< ": " << z << "\n";
#define ED cout << '\n';
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define FILEIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define all(v) v.begin(), v.end()
#define endl '\n'
#define fr1(j, n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = 0; i < n; i++)
#define trav(x, s) for (auto x : s)
#define PB push_back
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define F first
#define S second
#define binf 2000000000000000001
#define mod 1000000007
const int N = 5e3 + 99;
int32_t main() {
IO
ll n,
x, cnt = 1, d = 0, l;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l;
if (d + l <= x)
cnt++, d += l;
else
break;
}
cout << cnt << endl;
}
| [
"identifier.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 813,438 | 813,437 | u089572841 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N), D(N + 1);
for (int i = 0; i < N; ++i)
cin >> L[i];
D[0] = 0;
for (int i = 1; i <= N; ++i) {
D[i] = D[i - 1] + L[i - 1];
// cout << D[i] << endl;
}
int sum = 0;
for (int i = 0; i < N; ++i) {
if (D[i] <= X)
sum++;
else
break;
}
cout << min(sum, N + 1) << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N), D(N + 1);
for (int i = 0; i < N; ++i)
cin >> L[i];
D[0] = 0;
for (int i = 1; i <= N; ++i) {
D[i] = D[i - 1] + L[i - 1];
// cout << D[i] << endl;
}
int sum = 0;
for (int i = 0; i < N + 1; ++i) {
if (D[i] <= X)
sum++;
else
break;
}
cout << min(sum, N + 1) << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,441 | 813,442 | u477694598 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 10e9 + 7
#define MAX 100005
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
REP(i, N) cin >> L[i];
int suml = 0;
int cnt = 0;
REP(i, N) {
suml += L[i];
if (suml > X) {
cnt = i;
break;
}
}
cout << (cnt == 0 ? N : cnt) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 10e9 + 7
#define MAX 100005
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
REP(i, N) cin >> L[i];
int suml = 0;
int cnt = 0;
REP(i, N) {
suml += L[i];
if (suml > X) {
cnt = i + 1;
break;
}
}
cout << (cnt == 0 ? N + 1 : cnt) << endl;
return 0;
}
| [
"assignment.change"
] | 813,443 | 813,444 | u090325904 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
///定義場所///
int i, j, k, l, m, n;
int N, M, K, H, W;
ll MOD = 1000000007;
int ans = 1;
//関数リスト//
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
//(注)pairの型・比較する場所(first/second)は毎回変えて使用する
bool pairCompare(const pair<int, int> firstElof, pair<int, int> secondElof) {
return firstElof.second > secondElof.second;
}
int Keta(ll F) {
int keta = 1;
while (F / 10 > 0) {
keta++;
F /= 10;
}
return keta;
}
//////////////
int main() {
int X;
cin >> N >> X;
vector<int> L(N);
for (i = 0; i < N; i++) {
cin >> L[i];
}
int sum = 0;
for (i = 1; i < N; i++) {
sum += L[i - 1];
if (sum <= X) {
ans = i + 1;
}
}
cout << ans;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
///定義場所///
int i, j, k, l, m, n;
int N, M, K, H, W;
ll MOD = 1000000007;
int ans = 1;
//関数リスト//
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
//(注)pairの型・比較する場所(first/second)は毎回変えて使用する
bool pairCompare(const pair<int, int> firstElof, pair<int, int> secondElof) {
return firstElof.second > secondElof.second;
}
int Keta(ll F) {
int keta = 1;
while (F / 10 > 0) {
keta++;
F /= 10;
}
return keta;
}
//////////////
int main() {
int X;
cin >> N >> X;
vector<int> L(N);
for (i = 0; i < N; i++) {
cin >> L[i];
}
int sum = 0;
for (i = 1; i <= N; i++) {
sum += L[i - 1];
if (sum <= X) {
ans = i + 1;
}
}
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,457 | 813,458 | u916974091 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
///定義場所///
int i, j, k, l, m, n;
int N, M, K, H, W;
ll MOD = 1000000007;
int ans = 0;
//関数リスト//
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
//(注)pairの型・比較する場所(first/second)は毎回変えて使用する
bool pairCompare(const pair<int, int> firstElof, pair<int, int> secondElof) {
return firstElof.second > secondElof.second;
}
int Keta(ll F) {
int keta = 1;
while (F / 10 > 0) {
keta++;
F /= 10;
}
return keta;
}
//////////////
int main() {
int X;
cin >> N >> X;
vector<int> L(N);
for (i = 0; i < N; i++) {
cin >> L[i];
}
int sum = 0;
for (i = 1; i < N; i++) {
sum += L[i - 1];
if (sum <= X) {
ans = i + 1;
}
}
cout << ans;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
///定義場所///
int i, j, k, l, m, n;
int N, M, K, H, W;
ll MOD = 1000000007;
int ans = 1;
//関数リスト//
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
//(注)pairの型・比較する場所(first/second)は毎回変えて使用する
bool pairCompare(const pair<int, int> firstElof, pair<int, int> secondElof) {
return firstElof.second > secondElof.second;
}
int Keta(ll F) {
int keta = 1;
while (F / 10 > 0) {
keta++;
F /= 10;
}
return keta;
}
//////////////
int main() {
int X;
cin >> N >> X;
vector<int> L(N);
for (i = 0; i < N; i++) {
cin >> L[i];
}
int sum = 0;
for (i = 1; i <= N; i++) {
sum += L[i - 1];
if (sum <= X) {
ans = i + 1;
}
}
cout << ans;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,459 | 813,458 | u916974091 | cpp |
p03000 | #include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define nl std::cout << "\n"
#define in(x) std::cin >> (x)
#define out(x) std::cout << (x) << " "
#define err(x) std::cerr << "DBG: " << #x << " " << (x) << "\n"
#define inn(x) \
int x; \
in(x);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i > -1; --i)
#define no puts("NO")
#define yes puts("YES")
using ll = long long int;
using vi = std::vector<int>;
using ii = std::pair<int, int>;
using iii = std::pair<ii, int>;
using vii = std::vector<ii>;
const int N = 1010101;
const int MD = 1e9 + 7;
void solve() {
inn(n);
inn(x);
int d = 0;
rep(i, n) {
inn(l);
d += l;
if (d > x) {
out(i + 1);
return;
}
}
out(n);
}
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
// int t; in(t); repr(tc, 1, t + 1)
solve();
return 0;
}
| #include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define nl std::cout << "\n"
#define in(x) std::cin >> (x)
#define out(x) std::cout << (x) << " "
#define err(x) std::cerr << "DBG: " << #x << " " << (x) << "\n"
#define inn(x) \
int x; \
in(x);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i > -1; --i)
#define no puts("NO")
#define yes puts("YES")
using ll = long long int;
using vi = std::vector<int>;
using ii = std::pair<int, int>;
using iii = std::pair<ii, int>;
using vii = std::vector<ii>;
const int N = 1010101;
const int MD = 1e9 + 7;
void solve() {
inn(n);
inn(x);
int d = 0;
rep(i, n) {
inn(l);
d += l;
if (d > x) {
out(i + 1);
return;
}
}
out(n + 1);
}
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
// int t; in(t); repr(tc, 1, t + 1)
solve();
return 0;
}
| [
"expression.operation.binary.add"
] | 813,464 | 813,465 | u811925505 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <stdio.h>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define urep(i, a, n) for (ll i = (a); i >= (n); --i)
#define all(x) (x).begin(), (x).end()
#define INF 1e18
const int mod = 1e9 + 7;
typedef long long ll;
using namespace std;
ll dx[4] = {1, -1, 0, 0};
ll dy[4] = {0, 0, 1, -1};
ll N, M, X, Y, A, B, C, D, Q, K, R, W, H, P, L, G;
ll ans;
string S, T;
ll y[101010];
ll a[101010];
ll k[101010];
ll b[101010];
ll d[101010];
ll t[101010];
ll p[101010];
ll n[101010];
ll l[101010];
ll r[101010];
ll v[101010];
ll s[101010];
ll x[101010];
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
struct Edge {
ll to, cost;
Edge(ll to, ll cost) : to(to), cost(cost) {}
};
typedef vector<vector<Edge>> AdjList;
AdjList graph;
vector<ll> dist;
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> size;
UnionFind(ll N) : par(N), size(N) { //最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
size[i] = 1;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
ll GetSize(ll x) { return size[root(x)]; }
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
size[ry] += size[rx];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
};
int main() {
cin >> N >> X;
ans = 1;
ll num = 0;
rep(i, 0, N + 1) {
cin >> l[i];
num += l[i];
if (num > X)
break;
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <stdio.h>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define urep(i, a, n) for (ll i = (a); i >= (n); --i)
#define all(x) (x).begin(), (x).end()
#define INF 1e18
const int mod = 1e9 + 7;
typedef long long ll;
using namespace std;
ll dx[4] = {1, -1, 0, 0};
ll dy[4] = {0, 0, 1, -1};
ll N, M, X, Y, A, B, C, D, Q, K, R, W, H, P, L, G;
ll ans;
string S, T;
ll y[101010];
ll a[101010];
ll k[101010];
ll b[101010];
ll d[101010];
ll t[101010];
ll p[101010];
ll n[101010];
ll l[101010];
ll r[101010];
ll v[101010];
ll s[101010];
ll x[101010];
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
struct Edge {
ll to, cost;
Edge(ll to, ll cost) : to(to), cost(cost) {}
};
typedef vector<vector<Edge>> AdjList;
AdjList graph;
vector<ll> dist;
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> size;
UnionFind(ll N) : par(N), size(N) { //最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
size[i] = 1;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
ll GetSize(ll x) { return size[root(x)]; }
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
size[ry] += size[rx];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
};
int main() {
cin >> N >> X;
ans = 1;
ll num = 0;
rep(i, 0, N) {
cin >> l[i];
num += l[i];
if (num > X)
break;
ans++;
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 813,466 | 813,467 | u406225550 | cpp |
p03000 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
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 = 1; i < n; i++) {
d += l[i];
if (d <= x)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
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; i++) {
d += l[i];
if (d <= x)
ans++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 813,470 | 813,471 | u493750228 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, pos = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int l;
cin >> l;
pos += l;
if (pos <= X)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 1, pos = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int l;
cin >> l;
pos += l;
if (pos <= X)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,472 | 813,473 | u573082373 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define fore(i, a) for (auto &i : a)
typedef pair<int, int> P;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1 << 30;
const ll INFL = 1LL << 60;
const ll mod = 1000000007;
int main() {
int n, x;
cin >> n >> x;
int cur = 1;
int ans = 0;
REP(i, n) {
int l;
cin >> l;
cur += l;
if (cur <= x)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define fore(i, a) for (auto &i : a)
typedef pair<int, int> P;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1 << 30;
const ll INFL = 1LL << 60;
const ll mod = 1000000007;
int main() {
int n, x;
cin >> n >> x;
int cur = 0;
int ans = 1;
REP(i, n) {
int l;
cin >> l;
cur += l;
if (cur <= x)
ans++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 813,474 | 813,475 | u856232850 | cpp |
p03000 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ll long long
#define ss second
#define ff first
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define f(i, n) fr(i, 0, n)
#define rf(i, b, a) for (ll i = b - 1; i >= a; i--)
#define r(i, n) rf(i, n, 0)
#define inf 1000000007
#define eps 0.000000000000001
#define endl '\n'
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof(c).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define pi pair<int, int>
#define PI \
3.141592653589793238462643383279502884197169399375105820974944592307816406286
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int dx[8] = {1, -1, 0, 0, -1, -1, 1, 1};
int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
void solve() {
int n;
cin >> n;
vector<int> v(n);
int cnt = 0;
f(i, n) { cin >> v[i]; }
int k, x;
cin >> k >> x;
vector<int> a;
f(i, n) {
a.pb((v[i] ^ x) - v[i]);
if (a.back() >= 0) {
cnt++;
}
}
sort(all(a), greater<int>());
if (cnt >= k) {
int i = 0;
ll sum = 0;
while (i < n && a[i] >= 0) {
sum = sum + a[i];
i++;
}
if (cnt % k && cnt % 2) {
if (i >= 0) {
if (abs(v[i + 1]) < abs(v[i])) {
sum = sum - a[i + 1];
} else {
sum = sum + a[i];
}
sum = accumulate(all(v), sum);
cout << sum << endl;
} else {
sum = sum - a[i + 1];
sum = accumulate(all(v), sum);
cout << sum << endl;
}
} else {
sum = accumulate(all(v), sum);
cout << sum << endl;
}
} else {
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// ifstream fin;
// ofstream fout;
// fin.open("input.txt");
// fout.open("output.txt");
// let's fuck dp
ll n, x;
cin >> n >> x;
vector<ll> v(n);
int cnt = 1;
ll sum = 0;
f(i, n) {
cin >> v[i];
sum = sum + v[i];
if (sum < x) {
cnt++;
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ll long long
#define ss second
#define ff first
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define f(i, n) fr(i, 0, n)
#define rf(i, b, a) for (ll i = b - 1; i >= a; i--)
#define r(i, n) rf(i, n, 0)
#define inf 1000000007
#define eps 0.000000000000001
#define endl '\n'
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof(c).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define pi pair<int, int>
#define PI \
3.141592653589793238462643383279502884197169399375105820974944592307816406286
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int dx[8] = {1, -1, 0, 0, -1, -1, 1, 1};
int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
void solve() {
int n;
cin >> n;
vector<int> v(n);
int cnt = 0;
f(i, n) { cin >> v[i]; }
int k, x;
cin >> k >> x;
vector<int> a;
f(i, n) {
a.pb((v[i] ^ x) - v[i]);
if (a.back() >= 0) {
cnt++;
}
}
sort(all(a), greater<int>());
if (cnt >= k) {
int i = 0;
ll sum = 0;
while (i < n && a[i] >= 0) {
sum = sum + a[i];
i++;
}
if (cnt % k && cnt % 2) {
if (i >= 0) {
if (abs(v[i + 1]) < abs(v[i])) {
sum = sum - a[i + 1];
} else {
sum = sum + a[i];
}
sum = accumulate(all(v), sum);
cout << sum << endl;
} else {
sum = sum - a[i + 1];
sum = accumulate(all(v), sum);
cout << sum << endl;
}
} else {
sum = accumulate(all(v), sum);
cout << sum << endl;
}
} else {
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// ifstream fin;
// ofstream fout;
// fin.open("input.txt");
// fout.open("output.txt");
// let's fuck dp
ll n, x;
cin >> n >> x;
vector<ll> v(n);
int cnt = 1;
ll sum = 0;
f(i, n) {
cin >> v[i];
sum = sum + v[i];
if (sum <= x) {
cnt++;
}
}
cout << cnt << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,478 | 813,479 | u151137534 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, M;
cin >> n >> M;
int cur = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
cur += x;
if (cur <= M)
ans = max(ans, i + 1);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, M;
cin >> n >> M;
int cur = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
cur += x;
if (cur <= M)
ans = max(ans, i + 2);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 813,482 | 813,483 | u027091475 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int d[n + 1], k[n + 1];
for (int i = 1; i <= n; ++i)
cin >> k[i];
d[0] = 0;
for (int i = 1; i <= n; ++i)
d[i] = d[i - 1] + k[i];
int sum = 0;
for (int i = 1; i <= n; ++i)
sum += (d[i] < x);
cout << sum + 1;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int d[n + 1], k[n + 1];
for (int i = 1; i <= n; ++i)
cin >> k[i];
d[0] = 0;
for (int i = 1; i <= n; ++i)
d[i] = d[i - 1] + k[i];
int sum = 0;
for (int i = 1; i <= n; ++i)
sum += (d[i] <= x);
cout << sum + 1;
return 0;
} | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 813,484 | 813,485 | u146240825 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, s, e) for (int i = (s); i < (e); i++)
#define all(x) x.begin(), x.end()
#define endl "\n"
void use_cio() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) {
return os << "(" << P.first << "," << P.second << ")";
}
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[";
for (auto x : V)
os << x << ", ";
return os << "]";
}
//--------------------------------------------------//
int main() {
use_cio();
int n, x;
ll sum = 0;
cin >> n >> x;
rep(i, n) {
int l;
cin >> l;
sum += l;
if (sum > x) {
cout << i + 1 << endl;
break;
}
}
cout << n + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, s, e) for (int i = (s); i < (e); i++)
#define all(x) x.begin(), x.end()
#define endl "\n"
void use_cio() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) {
return os << "(" << P.first << "," << P.second << ")";
}
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[";
for (auto x : V)
os << x << ", ";
return os << "]";
}
//--------------------------------------------------//
int main() {
use_cio();
int n, x;
ll sum = 0;
cin >> n >> x;
rep(i, n) {
int l;
cin >> l;
sum += l;
if (sum > x) {
cout << i + 1 << endl;
return 0;
}
}
cout << n + 1 << endl;
}
| [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 813,490 | 813,491 | u847501264 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.