problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03000 | /*B - Bounding*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ant = 0;
int ans = 0;
int tam, X;
int aux;
cin >> tam >> X;
vector<int> arr(tam);
for (int i = 0; i < tam; ++i)
cin >> arr[i];
if (ant <= X)
ans++;
... | /*B - Bounding*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ant = 0;
int ans = 0;
int tam, X;
int aux;
cin >> tam >> X;
vector<int> arr(tam);
for (int i = 0; i < tam; ++i)
cin >> arr[i];
if (ant <= X)
ans++;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,342 | 811,343 | u854087773 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,346 | 811,347 | u264405855 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> D(n + 1);
D[0] = 0;
rep(i, n) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (D[i] <= x) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> D(n + 1);
D[0] = 0;
rep(i, n) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i <= n; ++i) {
if (D[i] <= x) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,348 | 811,349 | u264405855 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> D(n + 1);
D[0] = 0;
rep(i, n) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (D[i] <= x) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> D(n + 1);
D[0] = 0;
rep(i, n) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int ans = 0;
for (int i = 0; i <= n; ++i) {
if (D[i] <= x) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,350 | 811,349 | u264405855 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, d, x, r;
int main() {
for (cin >> n >> x; i < n; i++) {
cin >> d, r += d;
if (r > x)
return cout << i + 1, 0;
}
cout << n;
} | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, d, x, r;
int main() {
for (cin >> n >> x; i < n; i++) {
cin >> d;
r += d;
if (r > x)
return cout << i + 1, 0;
}
cout << n + 1;
} | [
"expression.operation.binary.add"
] | 811,362 | 811,363 | u303621502 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(x, y) for (int i = (x); i < (y); i++)
typedef long long ll;
using namespace std;
void solve() {
int n, x;
cin >> n >> x;
int l[n];
rep(0, n) cin >> l[i];
int d[n];
d[0] = 0;
rep(1, n) { d[i] = d[i - 1] + l[i - 1]; }
int cnt = 0;
rep(0, n) {
if (d[i] <= x... | #include <bits/stdc++.h>
#define rep(x, y) for (int i = (x); i < (y); i++)
typedef long long ll;
using namespace std;
void solve() {
int n, x;
cin >> n >> x;
int l[n];
rep(0, n) cin >> l[i];
int d[n + 1];
d[0] = 0;
rep(1, n + 1) { d[i] = d[i - 1] + l[i - 1]; }
int cnt = 0;
rep(0, n + 1) {
i... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 811,364 | 811,365 | u298123314 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 0;
int sum = 0;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
sum = sum + L.at(i);
if (sum <= X) {
count = count + 1;
} else {
break;
}
}
cout << count << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int count = 1;
int sum = 0;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
sum = sum + L.at(i);
if (sum <= X) {
count = count + 1;
} else {
break;
}
}
cout << count << end... | [
"literal.number.change",
"variable_declaration.value.change"
] | 811,378 | 811,379 | u028061225 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
vector<int> j(n);
int sum = 0;
rep(i, n) {
j[i] = s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
vector<int> j(n);
int sum = 0;
rep(i, n) {
j[i] = s... | [
"expression.operation.binary.add"
] | 811,382 | 811,383 | u213800869 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | [
"control_flow.loop.condition.change"
] | 811,390 | 811,391 | u328811800 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.condition.change"
] | 811,392 | 811,391 | u328811800 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int l[300000], d[300000];
int main() {
int n, x;
cin >> n >> x;
for (int i = 1; i <= n; ++i) {
cin >> l[i];
}
d[1] = 0;
int cnt = 1;
for (int i = 2; i <= n; ++i) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] > x) {
break;
}
cnt++;
}
cou... | #include <bits/stdc++.h>
using namespace std;
int l[300000], d[300000];
int main() {
int n, x;
cin >> n >> x;
for (int i = 1; i <= n; ++i) {
cin >> l[i];
}
d[1] = 0;
int cnt = 1;
for (int i = 2; i <= n + 1; ++i) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] > x) {
break;
}
cnt++;
}
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,399 | 811,400 | u699384531 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define COUT(x) cout << (x) << endl
#define ALL(a) (a.begin()), (a.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define COUT(x) cout << (x) << endl
#define ALL(a) (a.begin()), (a.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL << 60;
co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 811,412 | 811,413 | u045224675 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define COUT(x) cout << (x) << endl
#define ALL(a) (a.begin()), (a.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define COUT(x) cout << (x) << endl
#define ALL(a) (a.begin()), (a.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL << 60;
co... | [
"call.add"
] | 811,414 | 811,413 | u045224675 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int l[105];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, x, d = 0, b = 1;
cin >> n >> x;
for (int i = 1; i <= n; ++i) {
cin >> l[i];
}
while (1) {
d = d + l[b];
if (d > x)
break;
b++... | #include <bits/stdc++.h>
using namespace std;
int l[105];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, x, d = 0, b = 1;
cin >> n >> x;
for (int i = 1; i <= n; ++i) {
cin >> l[i];
}
while (b < n + 1) {
d = d + l[b];
if (d > x)
break;... | [
"control_flow.loop.condition.change"
] | 811,415 | 811,416 | u194015723 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
int sum = 0, res = 1;
rep(i, n + 1) {
sum += sum + l[i - 1];
if (sum > x) {
cout << res << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
int sum = 0, res = 1;
rep(i, n) {
sum = sum + l[i];
if (sum > x) {
cout << res << endl;
retu... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operation.binary.remove",
"assignment.value.change"
] | 811,417 | 811,418 | u816145694 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, d = 0, c = 1;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
while (d + l[c - 1] <= x) {
d = d + l[c - 1];
c++;
}
return cout << c, 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, d = 0, c = 1;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
while (d + l[c - 1] <= x && c <= n) {
d = d + l[c - 1];
c++;
}
return cout << c, 0;
} | [
"control_flow.loop.condition.change"
] | 811,431 | 811,432 | u313970998 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 1;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1), d(n + 3);
d[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> l.at(i);
}... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 1;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1), d(n + 2);
d[1] = 0;
for (int i = 1; i <= n; i++) {
cin >> l.at(i);
}... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 811,435 | 811,436 | u179593519 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, bounces = 0;
cin >> n >> x;
vector<int> l(n);
vector<int> d(n + 1);
for (int i = 0; i < n; i++)
cin >> l[i];
d[0] = 0;
for (int i = 1; i < n; i++)
d[i] = d[i - 1] + l[i - 1];
for (int i = 0; i < n + 1; i++)
if ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, bounces = 0;
cin >> n >> x;
vector<int> l(n);
vector<int> d(n + 1);
for (int i = 0; i < n; i++)
cin >> l[i];
d[0] = 0;
for (int i = 1; i < n + 1; i++)
d[i] = d[i - 1] + l[i - 1];
for (int i = 0; i < n + 1; i++)
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,437 | 811,438 | u918865212 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, bounces = 0;
cin >> n >> x;
vector<int> l(n);
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> l[i];
d[0] = 0;
for (int i = 1; i < n; i++)
d[i] = d[i - 1] + l[i - 1];
for (int i = 0; i < n; i++)
if (d[i] <=... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, bounces = 0;
cin >> n >> x;
vector<int> l(n);
vector<int> d(n + 1);
for (int i = 0; i < n; i++)
cin >> l[i];
d[0] = 0;
for (int i = 1; i < n + 1; i++)
d[i] = d[i - 1] + l[i - 1];
for (int i = 0; i < n + 1; i++)
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,439 | 811,438 | u918865212 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a;
int i = 0;
int xxx = 0;
cin >> n >> x;
vector<int> l(n);
while (i < n) {
cin >> a;
l.push_back(a);
i++;
}
i = 0;
while (xxx <= x) {
i++;
if (i <= n) {
xxx += l.at(i - 1);
} else {
break;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a;
int i = 0;
int xxx = 0;
cin >> n >> x;
vector<int> l;
while (i < n) {
cin >> a;
l.push_back(a);
i++;
}
i = 0;
while (xxx <= x) {
i++;
if (i <= n) {
xxx += l.at(i - 1);
} else {
break;
}
... | [] | 811,445 | 811,446 | u437779154 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
int i = 0;
int xxx = 0;
cin >> n >> x;
vector<int> l(n);
while (i < n) {
cin >> l.at(i++);
}
i = 0;
while (xxx <= x) {
i++;
if (i <= n) {
xxx += l.at(i - 1);
}
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
int i = 0;
int xxx = 0;
cin >> n >> x;
vector<int> l(n);
while (i < n) {
cin >> l.at(i++);
}
i = 0;
while (xxx <= x) {
i++;
if (i <= n) {
xxx += l.at(i - 1);
} else {
break;
}
}
cout << i << endl... | [
"control_flow.branch.else.add"
] | 811,449 | 811,448 | u437779154 | cpp |
p03000 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N, X;
cin >> N >> X;
ll L[N];
rep(i, N) cin >> L[i];
ll D[N];
ll out = ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N, X;
cin >> N >> X;
ll L[N];
rep(i, N) cin >> L[i];
ll D[N + 1];
ll ou... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 811,454 | 811,455 | u742595961 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, k = 1, n, x, l[101];
cin >> n >> x;
l[0] = 0;
for (i = 0; i < n; i++)
cin >> l[i];
int d = 0; //[x+1];
// j=0;
/*for(i=1;i<=n;i++)
{
d[i]=j;
j++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, k = 0, n, x, l[101];
cin >> n >> x;
l[0] = 0;
for (i = 0; i < n; i++)
cin >> l[i];
int d = 0; //[x+1];
// j=0;
/*for(i=1;i<=n;i++)
{
d[i]=j;
j++;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 811,458 | 811,459 | u724499479 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int d = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
d = d + l[cnt];
if (d > x)
bre... | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int d = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
d = d + l[cnt];
if (d > x)
bre... | [
"expression.unary.arithmetic.add"
] | 811,460 | 811,461 | u476027087 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int now = 0, cnt = 1;
while (cin >> L)
if (now += L <= X)
cnt++;
cout << cnt << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int now = 0, cnt = 1;
while (cin >> L)
if ((now += L) <= X)
cnt++;
cout << cnt << "\n";
} | [
"control_flow.branch.if.condition.change"
] | 811,465 | 811,466 | u045289115 | cpp |
p03000 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int sum = 0;
for (int i = 0; i < n; ++i) {
if (sum + v[i] > x) {
cout << i + 1;
return 0;
}
sum += v[i];
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int sum = 0;
for (int i = 0; i < n; ++i) {
if (sum + v[i] > x) {
cout << i + 1;
return 0;
}
sum += v[i];
... | [
"expression.operation.binary.add"
] | 811,475 | 811,476 | u403668916 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int d[n + 1];
d[0] = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
d[i + 1] = d[i] + x;
}
for (int i = 0; i <= n; i++) {
if (d[i] <= x)
ans++;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int d[n + 1];
d[0] = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
d[i + 1] = d[i] + a;
}
for (int i = 0; i <= n; i++) {
if (d[i] <= x) {
ans++;
}
}
cout << ans;
ret... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 811,477 | 811,478 | u581172017 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1];
rep(i, n + 1) cin >> l[i];
int hazumu = 1;
int sum = 0;
for (int i = 0; i <= n; i++) {
sum += l[i];
if (sum <= x) {
hazumu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1];
rep(i, n + 1) cin >> l[i];
int hazumu = 1;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += l[i];
if (sum <= x) {
hazumu+... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,484 | 811,485 | u096030913 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, j = 1, k = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
k += L;
if (L <= X)
j++;
}
cout << j << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, j = 1, k = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
k += L;
if (k <= X)
j++;
}
cout << j << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,505 | 811,506 | u306482197 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int cnt = 0;
int length = 0;
for (int i = 0; i < n; i++) {
if (length <= x) {
cnt++;
}
int l;
cin >> l;
length += l;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int cnt = 0;
int length = 0;
for (int i = 0; i <= n; i++) {
if (length <= x) {
cnt++;
}
int l;
cin >> l;
length += l;
}
cout << cnt << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,533 | 811,534 | u524568016 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,535 | 811,536 | u958873500 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3], n;
using Graph = vector<vector<int>>;
vec... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3], n;
using Graph = vector<vector<int>>;
vec... | [
"expression.operation.binary.add"
] | 811,537 | 811,538 | u218707541 | cpp |
p03000 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | [
"expression.operation.binary.add"
] | 811,539 | 811,540 | u705990127 | cpp |
p03000 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr ... | [
"expression.operation.binary.add"
] | 811,554 | 811,555 | u486105630 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | [
"control_flow.branch.if.condition.change"
] | 811,564 | 811,565 | u682191329 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#defi... | [
"expression.operation.binary.remove"
] | 811,566 | 811,567 | u053035261 | cpp |
p03000 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <vector>
using nam... | [
"literal.number.change",
"variable_declaration.value.change"
] | 811,570 | 811,571 | u211074525 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
ll cur = 0;
int bnd = 0;
rep(i, n) {
cur += a.at(i);
if (cur > x)
break;
bnd++;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
ll cur = 0;
int bnd = 1;
rep(i, n) {
cur += a.at(i);
if (cur <= x)
bnd++;
}
cout << ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,584 | 811,585 | u062727117 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, in = 0, nu = 0;
cin >> n >> x;
vector<int> d(n);
for (int i = 1; i <= n; i++) {
cin >> d[i];
}
for (int i = 1; i <= n; i++) {
in += d[i];
if (in <= x) {
nu++;
}
}
cout << nu << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, in = 0, nu = 0;
cin >> n >> x;
vector<int> d(n);
for (int i = 1; i <= n; i++) {
cin >> d[i];
}
for (int i = 1; i <= n; i++) {
in += d[i];
if (in <= x) {
nu++;
}
}
cout << nu + 1 << endl;
}
| [
"expression.operation.binary.add"
] | 811,588 | 811,589 | u834753207 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
vector<int> d(n + 1);
d[0] = 0;
int key = n;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
vector<int> d(n + 1);
d[0] = 0;
int key = n + 1;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i]... | [
"assignment.change"
] | 811,592 | 811,593 | u582588783 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
vector<int> d(n + 1);
d[0] = 0;
int key = 0;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
vector<int> d(n + 1);
d[0] = 0;
int key = n + 1;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i]... | [
"identifier.replace.add",
"literal.replace.remove"
] | 811,594 | 811,593 | u582588783 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N, X;
cin >> N >> X;
vector<int> list(N);
for (int i = 0; i < N; i++)
cin >> list[i];
int count = 0, now = 0;
for (int i = 0; i < N; i++) {
now = now + list[i];
if (now <=... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N, X;
cin >> N >> X;
vector<int> list(N);
for (int i = 0; i < N; i++)
cin >> list[i];
int count = 1, now = 0;
for (int i = 0; i < N; i++) {
now = now + list[i];
if (now <=... | [
"literal.number.change",
"variable_declaration.value.change"
] | 811,595 | 811,596 | u058742919 | cpp |
p03000 | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, X;
scanf("%d%d", &N, &X);
vector<int> L(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &L[i]);
}
int ans = 1;
int d = 0;
for (int i = 0; i <= N; ++i) {
d = d + L[i];
if (d <= X)
++ans;
}
printf("%d", ans);... | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, X;
scanf("%d%d", &N, &X);
vector<int> L(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &L[i]);
}
int ans = 1;
int d = 0;
for (int i = 0; i < N; ++i) {
d = d + L[i];
if (d <= X)
++ans;
}
printf("%d\n", ans)... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 811,605 | 811,606 | u774438048 | cpp |
p03000 | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, X;
scanf("%d%d", &N, &X);
vector<int> L(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &L[i]);
}
int ans = 1;
int d = 0;
for (int i = 0; i <= N; ++i) {
d = d + L[i];
if (d <= X)
++ans;
}
printf("%d", ans);... | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, X;
scanf("%d%d", &N, &X);
vector<int> L(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &L[i]);
}
int ans = 1;
int d = 0;
for (int i = 0; i < N; ++i) {
d = d + L[i];
if (d <= X)
++ans;
}
printf("%d", ans);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,605 | 811,607 | u774438048 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define mod 1000000007
#define size_f 100002
int main() {
int n, x;
cin >> n >> x;
ll l[x];
for (int i = 0; i < n; i++) {
int q;
cin >> q;
if (i == 0)
l[0] = q;
else
l[i] =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define mod 1000000007
#define size_f 100002
int main() {
int n, x;
cin >> n >> x;
ll l[n];
for (int i = 0; i < n; i++) {
int q;
cin >> q;
if (i == 0)
l[0] = q;
else
l[i] =... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 811,615 | 811,616 | u507549471 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define mod 1000000007
#define size_f 100002
int main() {
int n, x;
cin >> n >> x;
int l[x];
for (int i = 0; i < n; i++) {
int q;
cin >> q;
if (i == 0)
l[0] = q;
else
l[i] ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define mod 1000000007
#define size_f 100002
int main() {
int n, x;
cin >> n >> x;
ll l[n];
for (int i = 0; i < n; i++) {
int q;
cin >> q;
if (i == 0)
l[0] = q;
else
l[i] =... | [
"variable_declaration.type.change",
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 811,617 | 811,616 | u507549471 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int loc = 0;
int ans = 0;
do {
int l;
cin >> l;
loc += l;
ans++;
} while (ans < n && loc <= x);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int loc = 0;
int ans = 0;
do {
int l;
cin >> l;
loc += l;
ans++;
} while (ans <= n && loc <= x);
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,618 | 811,619 | u732578115 | cpp |
p03000 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 1;
for (int i = 2; i < n + 1; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << e... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 1;
for (int i = 2; i < n + 2; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << e... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,624 | 811,625 | u675314298 | cpp |
p03000 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 0;
for (int i = 2; i < n + 1; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << e... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 1;
for (int i = 2; i < n + 2; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << e... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,626 | 811,625 | u675314298 | cpp |
p03000 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 0;
for (int i = 1; i < n + 1; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << e... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1] = {0};
for (int i = 1; i < n + 1; i++)
cin >> l[i];
int tmp = 0;
int ans = 1;
for (int i = 2; i < n + 2; i++) {
tmp += l[i - 1];
if (tmp <= x)
ans++;
}
cout << ans << e... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 811,627 | 811,625 | u675314298 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
cout << i << endl... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
cout << i + 1 << ... | [
"expression.operation.binary.add"
] | 811,628 | 811,629 | u711676593 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
cout << i + 1 << ... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
cout << i + 1 << ... | [
"expression.operation.binary.add"
] | 811,630 | 811,629 | u711676593 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ans = 0;
int d[n + 1];
d[0] = 0;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
}
for (int i = 0; i < n; i++) {
if (d[i] > x) {
br... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ans = 0;
int d[n + 1];
d[0] = 0;
for (int i = 0; i < n; i++) {
d[i + 1] = d[i] + l[i];
}
for (int i = 0; i <= n; i++) {
if (d[i] > x) {
b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,631 | 811,632 | u251242696 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n + 1] = {};
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
if (a[i] > x)
return cout << i, 0;
}
cout << n;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n + 1] = {};
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
if (a[i] > x)
return cout << i, 0;
}
cout << n + 1;
return 0;
}
| [
"expression.operation.binary.add"
] | 811,635 | 811,636 | u798562499 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
int cnt = 0;
while (now <= x) {
int l;
cin >> l;
now += l;
cnt++;
if (cnt == n) {
cnt++;
break;
}
}
cout << cnt << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
int cnt = 0;
while (now <= x) {
int l;
cin >> l;
now += l;
cnt++;
if (cnt == n && now <= x) {
cnt++;
break;
}
}
cout << cnt << endl;
} | [
"control_flow.branch.if.condition.change"
] | 811,639 | 811,640 | u136086822 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
int ans = 1;
int d = 0;
for (int i = 1; i < n + 1; i++) {
cin >> l[i - 1];
if (d + l[i - 1] < x) {
ans++;
}
d = d + l[i - 1];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
int ans = 1;
int d = 0;
for (int i = 1; i < n + 1; i++) {
cin >> l[i - 1];
if (d + l[i - 1] <= x) {
ans++;
}
d = d + l[i - 1];
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,641 | 811,642 | u739955570 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
vector<int> d(n + 1);
d.at(0) = 0;
for (int i = 1; i < n + 1; i++) {
d.at(i) = d.at(i - 1) + l.at(i - 1);
}
int cnt = 0;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
vector<int> d(n + 1);
d.at(0) = 0;
for (int i = 1; i < n + 1; i++) {
d.at(i) = d.at(i - 1) + l.at(i - 1);
}
int cnt = 0;
for (int i = 0; i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,645 | 811,646 | u739095155 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
int sum = 0;
int i = 0;
while (sum <= x) {
if (i == n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
int sum = 0;
int i = 0;
while (sum <= x) {
if (i == n) {
... | [
"expression.unary.arithmetic.add"
] | 811,651 | 811,652 | u680574634 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0, now = 0;
for (int i = 0; i < n; i++) {
now += a[i];
if (now > x)
break;
ans++;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 1, now = 0;
for (int i = 0; i < n; i++) {
now += a[i];
if (now > x)
break;
ans++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 811,653 | 811,654 | u777394984 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 811,657 | 811,658 | u448922807 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t... | [
"identifier.replace.add",
"literal.replace.remove"
] | 811,659 | 811,660 | u448922807 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int t[n];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t[i] ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int t[n + 1];
t[0] = 0;
for (int i = 1; i < n + 1; i++) {
t... | [
"identifier.replace.add",
"literal.replace.remove"
] | 811,661 | 811,660 | u448922807 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b)... | [
"assignment.change"
] | 811,662 | 811,663 | u842897677 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b)... | [
"assignment.change",
"expression.operation.binary.add"
] | 811,664 | 811,663 | u842897677 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typ... | [
"expression.operation.binary.add"
] | 811,667 | 811,668 | u981759938 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
int main() {
int n, x;
cin >> n >> x;
int dp[n + 1];
int l[n + 1];
int ans = 1;
for (int i = 1; i <= n; i++)
cin >> l[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i ... | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
int main() {
int n, x;
cin >> n >> x;
int dp[n + 2];
int l[n + 2];
int ans = 1;
for (int i = 1; i <= n; i++)
cin >> l[i];
dp[1] = 0;
for (int i = 2; i <= n + 1; i++) {
dp[i] = d... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,669 | 811,670 | u579160735 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
ll l[n];
rep(i, n) cin >> l[i];
ll now = 0, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
ll l[n];
rep(i, n) cin >> l[i];
ll now = 0, ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 811,675 | 811,676 | u501163846 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) cin >> l[i];
ll now = 0,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
ll l[n];
rep(i, n) cin >> l[i];
ll now = 0, ... | [
"variable_declaration.type.change",
"control_flow.loop.condition.change"
] | 811,677 | 811,676 | u501163846 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
int hoge = 0;
rep(i, n) {
int foo;
cin >> foo;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
int hoge = 0;
rep(i, n) {
int foo;
cin >> foo;
... | [
"identifier.change",
"io.output.change"
] | 811,680 | 811,681 | u184929210 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define ea... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define ea... | [
"expression.operation.binary.add"
] | 811,682 | 811,683 | u423624748 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define ea... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define ea... | [
"expression.operation.binary.remove"
] | 811,684 | 811,683 | u423624748 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | [
"control_flow.loop.for.condition.change"
] | 811,685 | 811,686 | u649915042 | cpp |
p03000 | /*its_Rashid*/
#include <bits/stdc++.h>
using namespace std;
typedef double du;
typedef string st;
typedef long long ll;
typedef long double ld;
typedef long long int lli;
#define vi vector<lli>
#define loop(num) for (lli i = 0; i < num; i++)
#define loopcin(num, ar) ... | /*its_Rashid*/
#include <bits/stdc++.h>
using namespace std;
typedef double du;
typedef string st;
typedef long long ll;
typedef long double ld;
typedef long long int lli;
#define vi vector<lli>
#define loop(num) for (lli i = 0; i < num; i++)
#define loopcin(num, ar) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,689 | 811,690 | u911135089 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }
int d = 0;
int cnt = 1;
for (int i = 1; i < n; ++i) {
d += l[i - 1];
if (d <= x) {
cnt++;
}
}
cout << cn... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }
int d = 0;
int cnt = 1;
for (int i = 1; i <= n; ++i) {
d += l[i - 1];
if (d <= x) {
cnt++;
}
}
cout << c... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,692 | 811,693 | u561143568 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int curSum = 0;
int count = 0;
for (int i = 0; i < n; i++) {
curSum += a[i];
if (curSum > x)
count++;
}
cout << count;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int curSum = 0;
int count = 0;
for (int i = 0; i < n; i++) {
curSum += a[i];
if (curSum <= x)
count++;
}
cout << count + 1;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,696 | 811,697 | u964018037 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, c, ans = 1;
cin >> n >> c;
vector<int> a(n);
for (int &x : a)
cin >> x;
int now = 0;
for (int i = 0; i < n; i++)
now = now + a[i];
if (now <= c)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, c, ans = 1;
cin >> n >> c;
vector<int> a(n, 0);
for (int &x : a)
cin >> x;
int now = 0;
for (int i = 0; i < n; i++) {
now = now + a[i];
if (now <= c)
ans++;
}
cout << ans << endl;
}
| [
"call.arguments.add"
] | 811,700 | 811,701 | u508688268 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | [
"variable_declaration.value.change"
] | 811,702 | 811,703 | u832995587 | cpp |
p03000 | #include <iostream>
using namespace std;
int N, X, L[110];
int main(void) {
int i, cnt = 0;
cin >> N >> X;
for (i = 0; i < N; i++) {
cin >> L[i];
cnt += L[i];
if (X < cnt) {
cout << i + 1 << endl;
return 0;
}
}
cout << N << endl;
} | #include <iostream>
using namespace std;
int N, X, L[110];
int main(void) {
int i, cnt = 0;
cin >> N >> X;
for (i = 0; i < N; i++) {
cin >> L[i];
cnt += L[i];
if (X < cnt) {
cout << i + 1 << endl;
return 0;
}
}
cout << N + 1 << endl;
} | [
"expression.operation.binary.add"
] | 811,732 | 811,733 | u803684095 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
int ans, flag = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
D.at(i + 1) = D.at(i) + tmp;
if (D.at(i + 1) > X && flag == 0) {
ans = i + 1;
flag = 1;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
int ans = N + 1, flag = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
D.at(i + 1) = D.at(i) + tmp;
if (D.at(i + 1) > X && flag == 0) {
ans = i + 1;
flag =... | [
"variable_declaration.value.change"
] | 811,734 | 811,735 | u227604873 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int answer = 1;
int distance = 0;
for (int i = 0; i <= n; ++i) {
distance += l[i];
if (distance <= x) {
answer++;
}
}
cout << answ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int bounds = 1;
int distance = 0;
for (int i = 0; i < n; ++i) {
distance += l[i];
if (distance <= x) {
bounds++;
}
}
cout << bound... | [
"variable_declaration.name.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 811,740 | 811,741 | u442877951 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int boundsCount = 0;
int distance = 0;
for (int i = 0; i <= n; ++i) {
distance += l[i];
if (distance <= x) {
boundsCount++;
}
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int bounds = 1;
int distance = 0;
for (int i = 0; i < n; ++i) {
distance += l[i];
if (distance <= x) {
bounds++;
}
}
cout << bound... | [
"variable_declaration.name.change",
"identifier.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 811,742 | 811,741 | u442877951 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int boundsCount = 1;
int distance = 0;
for (int i = 0; i <= n; ++i) {
distance += l[i];
if (distance <= x) {
boundsCount++;
}
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int bounds = 1;
int distance = 0;
for (int i = 0; i < n; ++i) {
distance += l[i];
if (distance <= x) {
bounds++;
}
}
cout << bound... | [
"variable_declaration.name.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 811,743 | 811,741 | u442877951 | cpp |
p03000 | #include <iostream>
#include <vector>
int main() {
long n, x;
std::cin >> n >> x;
std::vector<int> l;
int temp;
while (std::cin >> temp)
l.push_back(temp);
long cnt = 0;
long bound = 0;
for (int i = 0; bound <= x && cnt <= n + 1; ++i, ++cnt)
bound = bound + l[i];
std::cout << cnt << std::endl... | #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> l;
int temp;
while (std::cin >> temp)
l.push_back(temp);
int cnt = 0;
long bound = 0;
for (int i = 0; bound <= x && cnt < n + 1; ++i, ++cnt)
bound = bound + l[i];
std::cout << cnt << std::endl;
... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,744 | 811,745 | u864752370 | cpp |
p03000 | #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> l;
int temp;
while (std::cin >> temp)
l.push_back(temp);
int cnt = 0;
long bound = 0;
for (int i = 0; bound <= x; ++i, ++cnt)
bound = bound + l[i];
std::cout << cnt << std::endl;
return 0;
} | #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> l;
int temp;
while (std::cin >> temp)
l.push_back(temp);
int cnt = 0;
long bound = 0;
for (int i = 0; bound <= x && cnt < n + 1; ++i, ++cnt)
bound = bound + l[i];
std::cout << cnt << std::endl;
... | [
"control_flow.loop.for.condition.change"
] | 811,746 | 811,745 | u864752370 | cpp |
p03000 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 10, M = 5e5 + 10, MOD = 1e9 + 7;
const int OO = 0x3f3f3f3f;
const double EPS = 1e-3;
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#define rloop(i, n) for (int i = int(n) -... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 10, M = 5e5 + 10, MOD = 1e9 + 7;
const int OO = 0x3f3f3f3f;
const double EPS = 1e-3;
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#define rloop(i, n) for (int i = int(n) -... | [
"variable_declaration.add",
"identifier.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 811,758 | 811,759 | u551374420 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
cnt += l;
if (l <= x)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
cnt += l;
if (cnt <= x)
ans++;
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,762 | 811,763 | u113298224 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n + 1; i++) {
int l;
cin >> l;
cnt += l;
if (l <= x)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
cnt += l;
if (cnt <= x)
ans++;
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,764 | 811,763 | u113298224 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, x, a, now = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
ll a;
now += a;
if (now <= x)
ans++;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, x, a, now = 0, ans = 1;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> a;
now += a;
if (now <= x)
ans++;
}
cout << ans;
return 0;
}
| [] | 811,803 | 811,804 | u774202056 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, p = 0;
cin >> a >> b;
int ans = 1;
for (int i = 0; i <= a; i++) {
int t;
cin >> t;
p += t;
if (p <= b)
ans++;
}
cout << p << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, p = 0;
cin >> a >> b;
int ans = 1;
for (int i = 0; i < a; i++) {
int t;
cin >> t;
p += t;
if (p <= b)
ans++;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 811,813 | 811,814 | u729337236 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> vec(n);
int ans = 0;
int d = 0;
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; d <= m; i++) {
ans++;
if (ans == n)
break;
d += vec.at(i);
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> vec(n);
int ans = 0;
int d = 0;
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; d <= m; i++) {
ans++;
if (ans == n + 1)
break;
d += vec.at(i);
}
cout << ans;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,815 | 811,816 | u260907804 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { r... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { r... | [
"expression.operation.binary.remove"
] | 811,817 | 811,818 | u697090185 | cpp |
p03000 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | "... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | "... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,823 | 811,824 | u083041127 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 2000... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 2000... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 811,829 | 811,830 | u980909653 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
long long N, X, L[101], i, d = 0, ans = 1;
cin >> N >> X;
for (i = 1; i <= N; i++) {
cin >> L[i];
}
for (i = 2; i <= N + 1; i++) {
d += L[i];
if (d <= X) {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
long long N, X, L[101], i, d = 0, ans = 1;
cin >> N >> X;
for (i = 1; i <= N; i++) {
cin >> L[i];
}
for (i = 2; i <= N + 1; i++) {
d += L[i - 1];
if (d <= X) ... | [
"assignment.change"
] | 811,831 | 811,832 | u246639932 | cpp |
p03000 | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typed... | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typed... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,854 | 811,855 | u506295831 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, x;
cin >> n >> x;
int ans = 1;
int w = 0;
rep(i, n) {
int r;
cin >> r;
w += r;
if (ans <= x)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, x;
cin >> n >> x;
int ans = 1;
int w = 0;
rep(i, n) {
int r;
cin >> r;
w += r;
if (w <= x)
ans++;
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,866 | 811,867 | u525560003 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility> // for pair
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep4(i, start, end, step) for (int i = (start); i < (end); i += (s... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility> // for pair
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep4(i, start, end, step) for (int i = (start); i < (end); i += (s... | [
"identifier.change",
"expression.operation.binary.remove"
] | 811,871 | 811,872 | u799164835 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define mod 1000000007
#define fi first
#define se second
#define endl '\n'
#define fast \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define mod 1000000007
#define fi first
#define se second
#define endl '\n'
#define fast \
ios_base::sync_with_stdio(false); ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,873 | 811,874 | u015580732 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | [
"control_flow.branch.else.add"
] | 811,875 | 811,876 | u880221923 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); ... | [] | 811,877 | 811,878 | u187013893 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.