problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define mod 1000000007
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define mod 1000000007
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 812,559 | 812,560 | u931071094 | 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 count = 1;
for (int i = 2; i <= n; i++) {
if (d + l[i - 1] > x) {
break;
}
count++;
d = d + l[i - 1];
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int d = 0;
int count = 1;
for (int i = 2; i <= n + 1; i++) {
if (d + l[i - 2] > x) {
break;
}
count++;
d = d + l[i - 2];
}
c... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 812,561 | 812,562 | u931071094 | cpp |
p03000 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define scin(a) scanf("%d", &a);
#define scdo(a) scanf("%lf", &a);
#define scch(a) scanf("%s", a);
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
#define anch(a... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define scin(a) scanf("%d", &a);
#define scdo(a) scanf("%lf", &a);
#define scch(a) scanf("%s", a);
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
#define anch(a... | [
"control_flow.branch.if.condition.change"
] | 812,563 | 812,564 | u456658814 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) { cin >> l[i]; }
int count = 0;
long long ans = 0;
rep(i, n) {
if (ans > x)
break;
ans += l[i];
count++;
}
cout << count << en... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) { cin >> l[i]; }
int count = 0;
int ans = 0;
rep(i, n + 1) {
if (ans > x)
break;
ans += l[i];
count++;
}
cout << count << endl... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 812,568 | 812,569 | u326152409 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) { cin >> l[i]; }
int count = 0;
int ans = 0;
rep(i, n) {
if (ans > x)
break;
ans += l[i];
count++;
}
cout << count << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n, x;
cin >> n >> x;
int l[n];
rep(i, n) { cin >> l[i]; }
int count = 0;
int ans = 0;
rep(i, n + 1) {
if (ans > x)
break;
ans += l[i];
count++;
}
cout << count << endl... | [
"expression.operation.binary.add"
] | 812,570 | 812,569 | u326152409 | 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 ans;
for (int i = 0; i < n; i++) {
d += l.at(i);
if (x < d) {
ans = i + 1;
break;
}
}
cout << 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.at(i);
int d = 0;
int ans = n + 1; //最後まで座標xを超えなければans=n+1
for (int i = 0; i < n; i++) {
d += l.at(i);
if (x < d) {
ans = i + 1;
break;
}... | [
"variable_declaration.value.change"
] | 812,571 | 812,572 | u661308718 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
#define pint pair<int, int>
#define pdouble pair<double, double>
using namespace std;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
#define pint pair<int, int>
#define pdouble pair<double, double>
using namespace std;
typedef long long ll;
int mai... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,573 | 812,574 | u319093540 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (L[i] <= X)
ans++;
}
cout << ans ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; ++i) {
if (L[i] <= X)
ans++;
}
cout << ans... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,580 | 812,581 | u506858457 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (L[i] <= X)
++ans;
}
cout << ans ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; ++i) {
if (L[i] <= X)
ans++;
}
cout << ans... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,582 | 812,581 | u506858457 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 1; i < N; ++i) {
if (L[i] <= X)
++ans;
}
cout << ans ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; ++i) {
if (L[i] <= X)
ans++;
}
cout << ans... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 812,583 | 812,581 | u506858457 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 1; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 1; i < N; ++i) {
if (L[i] <= X)
++ans;
}
cout << ans ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; ++i) {
if (L[i] <= X)
ans++;
}
cout << ans... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 812,584 | 812,581 | u506858457 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (L[i] <= X) {
ans++;
}
}
cout... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; ++i) {
if (L[i] <= X)
ans++;
}
cout << ans... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,585 | 812,581 | u506858457 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (L[i] <= X)
ans++;
}
cout << ans ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; ++i) {
if (L[i] <= X) {
ans++;
}
}
cou... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,580 | 812,586 | u506858457 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (L[i] <= X)
++ans;
}
cout << ans ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; ++i) {
if (L[i] <= X) {
ans++;
}
}
cou... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,582 | 812,586 | u506858457 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 1; i < N; ++i) {
if (L[i] <= X)
++ans;
}
cout << ans ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; ++i) {
if (L[i] <= X) {
ans++;
}
}
cou... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 812,583 | 812,586 | u506858457 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (L[i] <= X) {
ans++;
}
}
cout... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L[0] = 0;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
L[i + 1] = L[i] + x;
}
int ans = 0;
for (int i = 0; i <= N; ++i) {
if (L[i] <= X) {
ans++;
}
}
cou... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,585 | 812,586 | u506858457 | cpp |
p03000 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, x;
cin >> n >> x;
int L[n];
int sum = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> L[i];
// cout << sum << endl;
sum = sum + L[i];
if (sum < x) {
ans++;
}
}
cout << ans + 1 << endl;
... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, x;
cin >> n >> x;
int L[n];
int sum = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> L[i];
// cout << sum << endl;
sum = sum + L[i];
if (sum <= x) {
ans++;
}
}
cout << ans + 1 << endl;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,599 | 812,600 | u840810569 | cpp |
p03000 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, x;
cin >> n >> x;
int L[n];
int sum = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> L[i];
// cout << sum << endl;
sum = sum + L[i];
if (sum > x)
ans++;
}
cout << ans + 1 << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, x;
cin >> n >> x;
int L[n];
int sum = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> L[i];
// cout << sum << endl;
sum = sum + L[i];
if (sum <= x) {
ans++;
}
}
cout << ans + 1 << endl;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,601 | 812,600 | u840810569 | 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 now = 0;
int ans = 0;
for (int i = 1; i < N; i++) {
now = now + L[i - 1];
if (now <= X)
ans++;
}
cout << ans + 1 << endl;
} | #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 now = 0;
int ans = 0;
// cout << now << endl;
for (int i = 1; i < N + 1; i++) {
now = now + L[i - 1];
// cout << now << endl;
if (now <= X)
an... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,604 | 812,605 | u840810569 | cpp |
p03000 | #include <math.h> /*計算*/
#include <stdio.h> /*入出力*/
#include <stdlib.h> /*標準ライブラリ*/
#include <string.h> /*文字列*/
/*
ご指導ご鞭撻のほどよろしくお願いいたします。
@oct0pus_G
*/
int main(void) {
int N, X;
int L[100] = {0};
int D = 0;
scanf("%d%d", &N, &X);
for (size_t i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (size... | #include <math.h> /*計算*/
#include <stdio.h> /*入出力*/
#include <stdlib.h> /*標準ライブラリ*/
#include <string.h> /*文字列*/
/*
ご指導ご鞭撻のほどよろしくお願いいたします。
@oct0pus_G
*/
int main(void) {
int N, X;
int L[100] = {0};
int D = 0;
scanf("%d%d", &N, &X);
for (size_t i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (size... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,606 | 812,607 | u484407086 | cpp |
p03000 | #include <math.h> /*計算*/
#include <stdio.h> /*入出力*/
#include <stdlib.h> /*標準ライブラリ*/
#include <string.h> /*文字列*/
/*
ご指導ご鞭撻のほどよろしくお願いいたします。
@oct0pus_G
*/
int main(void) {
int N, X;
int L[100] = {0};
int D = 0;
scanf("%d%d", &N, &X);
for (size_t i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (size... | #include <math.h> /*計算*/
#include <stdio.h> /*入出力*/
#include <stdlib.h> /*標準ライブラリ*/
#include <string.h> /*文字列*/
/*
ご指導ご鞭撻のほどよろしくお願いいたします。
@oct0pus_G
*/
int main(void) {
int N, X;
int L[100] = {0};
int D = 0;
scanf("%d%d", &N, &X);
for (size_t i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (size... | [
"expression.operation.binary.add"
] | 812,608 | 812,607 | u484407086 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0, cnt = 1, L = 0;
for (int i = 1; i < N; i++) {
cin >> L;
if (D + L <= X)
cnt++;
D = D + L;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0, cnt = 1, L = 0;
for (int i = 0; i < N; i++) {
cin >> L;
if (D + L <= X)
cnt++;
D = D + L;
}
cout << cnt << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 812,611 | 812,612 | u204523044 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0, cnt = 1, L = 0;
for (int i = 1; i <= N; i++) {
cin >> L;
if (D + L < X)
cnt++;
D = D + L;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0, cnt = 1, L = 0;
for (int i = 0; i < N; i++) {
cin >> L;
if (D + L <= X)
cnt++;
D = D + L;
}
cout << cnt << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 812,613 | 812,612 | u204523044 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0, cnt = 1, L = 0;
for (int i = 1; i < N; i++) {
cin >> L;
if (D + L < X)
cnt++;
D = D + L;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0, cnt = 1, L = 0;
for (int i = 0; i < N; i++) {
cin >> L;
if (D + L <= X)
cnt++;
D = D + L;
}
cout << cnt << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,614 | 812,612 | u204523044 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define pi 3.1415926536
#define ff first
#define ss second
#defin... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define pi 3.1415926536
#define ff first
#define ss second
#defin... | [] | 812,621 | 812,622 | u075520262 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int ans = 0;
long long sum = 0;
;
int n;
int ni;
for (ni = 0; ni < N; ni++) {
cin >> n;
su... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int ans = 0;
long long sum = 0;
;
int n;
int ni;
for (ni = 0; ni < N; ni++) {
cin >> n;
s... | [
"expression.unary.arithmetic.remove",
"assignment.change"
] | 812,623 | 812,624 | u388763757 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define mp make_pair
int main() {
int n, x, nr;
cin >> n >> x;
vector<int> v;
rep(i, n) {
cin >> nr;
v.pb(nr);
}
int d = 0;
int bou... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define mp make_pair
int main() {
int n, x, nr;
cin >> n >> x;
vector<int> v;
rep(i, n) {
cin >> nr;
v.pb(nr);
}
int d = 0;
int bou... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,625 | 812,626 | u391340825 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define mp make_pair
int main() {
int n, x, nr;
cin >> n >> x;
vector<int> v;
rep(i, n) {
cin >> nr;
v.pb(nr);
}
int d = 0;
int bou... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define mp make_pair
int main() {
int n, x, nr;
cin >> n >> x;
vector<int> v;
rep(i, n) {
cin >> nr;
v.pb(nr);
}
int d = 0;
int bou... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,627 | 812,626 | u391340825 | 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 ad = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
ad += L[i];
if (ad >= X) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int ad = 0;
int ans = 1;
for (int i = 0; i < N; i++) {
ad += L[i];
if (X >= ad) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 812,632 | 812,633 | u106782100 | cpp |
p03000 | #include <stdio.h>
int main() {
int N, X, L[10010], sum = 0, count = 0;
scanf("%d%d", &N, &X);
for (int i = 0; i <= N; i++) {
scanf("%d", &L[i]);
}
for (int i = 0; i <= N; i++) {
sum += L[i];
if (sum < X) {
count++;
}
}
printf("%d", count + 1);
return 0;
}
| #include <stdio.h>
int main() {
int N, X, L[10010], sum = 0, count = 0;
scanf("%d%d", &N, &X);
for (int i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum <= X) {
count++;
}
}
printf("%d", count + 1);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 812,645 | 812,646 | u195269284 | cpp |
p03000 | #include <stdio.h>
int main() {
int N, X, L[10010], sum = 0, count = 0;
scanf("%d%d", &N, &X);
for (int i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum < X) {
count++;
}
}
printf("%d", count + 1);
return 0;
}
| #include <stdio.h>
int main() {
int N, X, L[10010], sum = 0, count = 0;
scanf("%d%d", &N, &X);
for (int i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum <= X) {
count++;
}
}
printf("%d", count + 1);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,647 | 812,646 | u195269284 | 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++)
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
vector<int> D(n);
rep(i, n) { cin >> L[i]; }
int ans = 1;
for (int i = 1; i < n; i++) {
D[i] = D[i - 1] + L[i - 1];
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
vector<int> D(n + 1);
rep(i, n) { cin >> L[i]; }
int ans = 1;
for (int i = 1; i <= n; i++) {
D[i] = D[i - 1] + L[i - 1];
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,656 | 812,657 | u590000849 | cpp |
p03000 | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 812,658 | 812,659 | u055131803 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ans = 1;
int td = 0;
for (int i = 0; i < n; i++) {
td += l[i];
if (td < x)
ans++;
else
break;
}
cout << 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 ans = 1;
int td = 0;
for (int i = 0; i < n; i++) {
td += l[i];
if (td <= x)
ans++;
else
break;
}
cout << ans << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,664 | 812,665 | u568419568 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, x;
cin >> n >> x;
ll sum = 0;
for (int i = 1; i <= n; i++) {
int r;
cin >> r;
sum += r;
if (sum > x) {
cout << i << endl;
return 0;
}
}
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, x;
cin >> n >> x;
ll sum = 0;
for (int i = 1; i <= n; i++) {
int r;
cin >> r;
sum += r;
if (sum > x) {
cout << i << endl;
return 0;
}
}
cout << n + 1 << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 812,668 | 812,669 | u708590262 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i ... | [] | 812,672 | 812,673 | u184335045 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0;
int i = 0;
while (i < N) {
int L;
cin >> L;
D += L;
if (D > X) {
break;
}
i++;
}
cout << i << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0;
int i = 0;
while (i < N) {
int L;
cin >> L;
D += L;
if (D > X) {
break;
}
i++;
}
cout << i + 1 << endl;
}
| [
"expression.operation.binary.add"
] | 812,678 | 812,679 | u817769480 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, answer = 0;
cin >> N >> X;
vector<int> L(N), D(N + 1);
D.at(0) = 0;
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
for (int i = 0; i < N; i++) {
D.at(i + 1) = D.at(i) + L.at(i);
}
for (int i = 0; i < N; i++) {
if (D.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, answer = 0;
cin >> N >> X;
vector<int> L(N), D(N + 1);
D.at(0) = 0;
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
for (int i = 0; i < N; i++) {
D.at(i + 1) = D.at(i) + L.at(i);
}
for (int i = 0; i <= N; i++) {
if (D.at... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,680 | 812,681 | u852770206 | 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];
}
vector<int> D(N + 1);
D[0] = 0;
for (int i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (D[... | #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];
}
vector<int> D(N + 1);
D[0] = 0;
for (int i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
}
int ans = 0;
for (int i = 0; i < N + 1; i++) {
if... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,694 | 812,695 | u914086391 | cpp |
p03000 | #include <stdio.h>
int main(void) {
int N, X, D = 0;
scanf("%d %d", &N, &X);
int L;
for (int i = 0; i < N; i++) {
scanf("%d", &L);
D += L;
if (D > X) {
printf("%d", i + 1);
return 0;
}
}
printf("%d", N);
return 0;
}
| #include <stdio.h>
int main(void) {
int N, X, D = 0;
scanf("%d %d", &N, &X);
int L;
for (int i = 0; i < N; i++) {
scanf("%d", &L);
D += L;
if (D > X) {
printf("%d", i + 1);
return 0;
}
}
printf("%d", N + 1);
return 0;
}
| [
"expression.operation.binary.add"
] | 812,714 | 812,715 | u651802048 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1);
l[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> l[i];
}
int d = 0, c = 0;
for (int i = 1; i <= n; i++) {
d = d + l[i - 1];
if (d < x + 1)
c++;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1);
l[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> l[i];
}
int d = 0, c = 0;
for (int i = 1; i < n + 2; i++) {
d = d + l[i - 1];
if (d < x + 1)
c++... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,716 | 812,717 | u666121874 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, X;
vector<int> L;
vector<int> D;
int main() {
cin >> N >> X;
L.resize(N + 1);
D.resize(N + 1);
int counter = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L[i] = x;
if (i == 0) {
D[i] = 0;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, X;
vector<int> L;
vector<int> D;
int main() {
cin >> N >> X;
L.resize(N + 1);
D.resize(N + 1);
int counter = 0;
for (int i = 0; i < N + 1; i++) {
int x;
cin >> x;
L[i] = x;
if (i == 0) {
D[i] = 0;... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,729 | 812,730 | u820164965 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
vector<int> t(111), u(111);
int n, x;
int main() {
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> t[i];
u[0] = 0;
for (int i = 1; i <= n; i++) {
u[i] = u[i - 1] + t[i - 1];
// cout <<u[i]<<" ";
}
for (int i = 0; i <= n; i++)
if (u[i] > x) {
... | #include <bits/stdc++.h>
using namespace std;
vector<int> t(111), u(111);
int n, x;
int main() {
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> t[i];
u[0] = 0;
for (int i = 1; i <= n; i++) {
u[i] = u[i - 1] + t[i - 1];
// cout <<u[i]<<" ";
}
for (int i = 0; i <= n; i++)
if (u[i] > x) {
... | [
"expression.operation.binary.add"
] | 812,742 | 812,743 | u514602572 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int bounce[N + 1];
bounce[0] = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
bounce[i + 1] = bounce[i] + L;
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (bounce[i] <= X) {
ans++;
}
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int bounce[N + 1];
bounce[0] = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
bounce[i + 1] = bounce[i] + L;
}
int ans = 0;
for (int i = 0; i < N + 1; i++) {
if (bounce[i] <= X) {
ans++;
}... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,757 | 812,758 | u873269440 | cpp |
p03000 | #include <bits/stdc++.h>
#define lli long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, x, cnt = 1;
cin >> n >> x;
int a[n + 5];
a[0] = 0;
for (int i = 1; i < n; i++) {
cin >> a[i];
a[i] += a[i - 1];
if (a[i] <= x)
cn... | #include <bits/stdc++.h>
#define lli long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, x, cnt = 1;
cin >> n >> x;
int a[n + 5];
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
if (a[i] <= x)
c... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,770 | 812,771 | u842407954 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i, l, t;
int a = 0;
vector<int> d(101);
cin >> n >> x;
for (i = 0; i < n; i = i + 1) {
cin >> l;
d.at(i + 1) = d.at(i) + l;
}
for (i = 0; i < n; i = i + 1) {
if (d.at(i) <= x)
a += 1;
}
cout << a << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i, l, t;
int a = 0;
vector<int> d(101);
cin >> n >> x;
for (i = 0; i < n; i = i + 1) {
cin >> l;
d.at(i + 1) = d.at(i) + l;
}
for (i = 0; i <= n; i = i + 1) {
if (d.at(i) <= x)
a += 1;
}
cout << a << endl... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,774 | 812,775 | u854243627 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[100];
for (int i = 1; i <= n; i++)
cin >> l[i];
int d[10000];
d[0] = 0;
for (int i = 1; i <= n; i++) {
d[i] = d[i - 1] + l[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (d[i] <= x)
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[100];
for (int i = 1; i <= n; i++)
cin >> l[i];
int d[10000];
d[0] = 0;
for (int i = 1; i <= n; i++) {
d[i] = d[i - 1] + l[i];
}
int ans = 0;
for (int i = 0; i <= n; i++) {
if (d[i] <= x)
a... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,776 | 812,777 | u525137785 | 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 sum = 0, ans = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
break;
}
ans += 1;
}
cout << 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 sum = 0;
int ans = 1;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
break;
}
ans += 1;
}
cout << ans << en... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,778 | 812,779 | u358859892 | 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 sum = 0, ans = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
break;
}
ans += 1;
}
cout << 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 sum = 0, ans = 1;
for (int i = 0; i < N; i++) {
sum += L[i];
if (sum > X) {
break;
}
ans += 1;
}
cout << ans << endl;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,778 | 812,780 | u358859892 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,783 | 812,784 | u679071005 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l;
int d = 0, counter = 0;
for (int i = 0; i < n; i++) {
counter++;
cin >> l;
d += l;
if (d > x)
break;
}
cout << counter;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l;
int d = 0, counter = 0;
for (int i = 0; i <= n; i++) {
counter++;
cin >> l;
d += l;
if (d > x)
break;
}
cout << counter;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,789 | 812,790 | u865979946 | cpp |
p03000 | #include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
int n, x;
cin >> n >> x;
int *l = new int[n + 1];
int *j = new int[n + 1];
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int k = 0;
j[0] = 0;
while (k < n) {
j[k + 1]... | #include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
int n, x;
cin >> n >> x;
int *l = new int[n + 1];
int *j = new int[n + 1];
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int k = 0;
j[0] = 0;
while (k < n) {
j[k + 1]... | [
"control_flow.branch.if.condition.change"
] | 812,794 | 812,795 | u871841829 | cpp |
p03000 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define Get(ty, ...) \
ty __VA_ARGS__... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define Get(ty, ...) \
ty __VA_ARGS__... | [
"control_flow.branch.else.add"
] | 812,805 | 812,806 | u258855829 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int sum = 0;
int count = 0;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
sum += temp;
if (sum > x) {
break;
}
count++;
}
cout << count;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int sum = 0;
int count = 1;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
sum += temp;
if (sum > x) {
break;
}
count++;
}
cout << count;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,813 | 812,814 | u117615163 | cpp |
p03000 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, x, i, d = 0;
cin >> n >> x;
vector<int> l(n);
for (i = 0; i < n; i++)
cin >> l[i];
for (i = 2; i < n + 1; i++) {
d = d + l[i - 2];
if (x < d)
break;
}
cout << i - 1 << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int n, x, i, d = 0;
cin >> n >> x;
vector<int> l(n);
for (i = 0; i < n; i++)
cin >> l[i];
for (i = 2; i <= n + 1; i++) {
d = d + l[i - 2];
if (x < d)
break;
}
cout << i - 1 << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,815 | 812,816 | u038841188 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define int long long
using namespace std;
signed main() {
int x, y, z = 0, w, i, j = 1;
cin >> x >> y;
std::vector<int> v(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define int long long
using namespace std;
signed main() {
int x, y, z = 0, w, i, j = 1;
cin >> x >> y;
std::vector<int> v(... | [
"control_flow.branch.else.add"
] | 812,834 | 812,835 | u893330446 | cpp |
p03000 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <random>
#include <set>
#include <sstream>
#includ... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <random>
#include <set>
#include <sstream>
#includ... | [
"expression.operation.binary.add"
] | 812,845 | 812,846 | u133607477 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e4;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int d = 0, ans = 1;
for (int i = 1; i < n; i++) {
d = d + a[i - 1];
if (d > x)
break... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e4;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int d = 0, ans = 1;
for (int i = 1; i <= n; i++) {
d = d + a[i - 1];
if (d > x)
bre... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,853 | 812,854 | u382773334 | cpp |
p03000 | #include <stdio.h>
int main(void) {
int i, n, x, c = 0, a = 0;
scanf("%d%d", &n, &x);
int l[n];
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
}
for (i = 0; i < n; i++) {
a += l[i];
if (a < x)
c++;
}
printf("%d", c + 1);
return 0;
} | #include <stdio.h>
int main(void) {
int i, n, x, c = 0, a = 0;
scanf("%d%d", &n, &x);
int l[n];
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
}
for (i = 0; i < n; i++) {
a += l[i];
if (a <= x)
c++;
}
printf("%d", c + 1);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,855 | 812,856 | u351322912 | cpp |
p03000 | // gauravsinghh
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define ld long double
#define db double
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sii set<int>... | // gauravsinghh
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define ld long double
#define db double
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sii set<int>... | [
"expression.operation.binary.remove"
] | 812,865 | 812,866 | u480527921 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int ans = 1;
int D = 0;
for (int i = 0; i < N; i++) {
D += L[i];
if (D < X) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int ans = 1;
int D = 0;
for (int i = 0; i < N; i++) {
D += L[i];
if (D <= X) {
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,877 | 812,878 | u855985627 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | [
"call.add"
] | 812,890 | 812,891 | u866107333 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | [
"expression.operation.binary.add"
] | 812,892 | 812,893 | u598755311 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int n, x, l[105];
int main() {
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; ++i) {
scanf("%d", &l[i]);
l[i] += l[i - 1];
}
printf("%d\n", upper_bound(l + 1, l + n + 1, x) - (l + 1));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, x, l[105];
int main() {
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; ++i) {
scanf("%d", &l[i]);
l[i] += l[i - 1];
}
printf("%d\n", upper_bound(l + 1, l + n + 1, x) - l);
return 0;
} | [
"call.arguments.change"
] | 812,894 | 812,895 | u147067618 | cpp |
p03000 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,896 | 812,897 | u057611820 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | [
"expression.operation.binary.remove"
] | 812,898 | 812,899 | u949798495 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 812,898 | 812,900 | u949798495 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change",
"expression.unary.arithmetic.remove"
] | 812,901 | 812,900 | u949798495 | cpp |
p03000 | //#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// namespace mp = boost... | //#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// namespace mp = boost... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,904 | 812,905 | u569367525 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int... | [
"identifier.replace.add",
"literal.replace.remove"
] | 812,906 | 812,907 | u352200121 | cpp |
p03000 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, x, L, ans;
cin >> N >> X;
L = 0;
ans = 0;
for (int i = 0; i < N; i++) {
cin >> x;
L += x;
if (L < X) {
ans += 1;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, x, L, ans;
cin >> N >> X;
L = 0;
ans = 1;
for (int i = 0; i < N; i++) {
cin >> x;
L += x;
if (L <= X) {
ans += 1;
}
}
cout << ans;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 812,908 | 812,909 | u947426792 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, x, L, ans;
cin >> N >> X;
L = 0;
ans = 0;
for (int i = 0; i < N; i++) {
cin >> x;
L += x;
if (L < X) {
ans += i;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, x, L, ans;
cin >> N >> X;
L = 0;
ans = 1;
for (int i = 0; i < N; i++) {
cin >> x;
L += x;
if (L <= X) {
ans += 1;
}
}
cout << ans;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add"
] | 812,910 | 812,909 | u947426792 | cpp |
p03000 | #include <iostream>
using namespace std;
int main(void) {
int N, X, L[10000];
cin >> N >> X;
int i, j;
for (i = 0; i < N; i++) {
cin >> L[i];
}
int D[10001];
for (j = 0; j < N + 1; j++) {
D[0] = 0;
D[j + 1] = D[j] + L[j];
if (D[j + 1] > X) {
break;
}
}
cout << j + 1;
}
| #include <iostream>
using namespace std;
int main(void) {
int N, X, L[100];
cin >> N >> X;
int i, j;
for (i = 0; i < N; i++) {
cin >> L[i];
}
int D[100];
for (j = 0; j < N; j++) {
D[0] = 0;
D[j + 1] = D[j] + L[j];
if (D[j + 1] > X) {
break;
}
}
cout << j + 1;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 812,918 | 812,919 | u968313090 | 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> L(N), D(N);
rep(i, N) cin >> L[i];
int ans = 1;
for (int i = 1; i < N; ++i) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X) {
ans++;
}
}
cout << a... | #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> L(N), D(N + 1);
rep(i, N) cin >> L[i];
int ans = 1;
for (int i = 1; i <= N; ++i) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X) {
ans++;
}
}
cout... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,924 | 812,925 | u887207211 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | [
"expression.operation.binary.add"
] | 812,948 | 812,949 | u635484372 | cpp |
p03000 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int N, X;
cin >> N >> X;
vector<int> arr(N, 0);
for (int i = 0; i < N; i+... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int N, X;
cin >> N >> X;
vector<int> arr(N, 0);
for (int i = 0; i < N; i+... | [
"control_flow.branch.else.add"
] | 812,950 | 812,951 | u067694854 | cpp |
p03000 | #include <iostream>
int main() {
int N, X;
int L[100] = {}, D[101] = {};
std::cin >> N >> X;
int counter = 0;
for (int i = 0; i < N; i++) {
std::cin >> L[i];
if (D[i] <= X) {
counter++;
} else {
break;
}
D[i + 1] = D[i] + L[i];
}
std::cout << counter << std::endl;
} | #include <iostream>
int main() {
int N, X;
int L[100] = {}, D[101] = {};
std::cin >> N >> X;
int counter = 0;
for (int i = 0; i < N + 1; i++) {
std::cin >> L[i];
if (D[i] <= X) {
counter++;
} else {
break;
}
D[i + 1] = D[i] + L[i];
}
std::cout << counter << std::endl;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 812,952 | 812,953 | u632628124 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
int bound_count = 0;
int zahyou = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
zahyou += L;
if (zahyou <= X)
bound_count += 1;
else
break;
}
cout << bound_count;
} | #include <iostream>
using namespace std;
int main() {
int N, X;
int bound_count = 1;
int zahyou = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
zahyou += L;
if (zahyou <= X)
bound_count += 1;
else
break;
}
cout << bound_count;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 812,954 | 812,955 | u104740664 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, X;
int L[110];
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> L[i];
int l = 0;
int cnt = 0;
for (int i = 0; i < N; i++) {
l += L[i];
if (l <= X)
cnt++;
}
cout << cnt... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, X;
int L[110];
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> L[i];
int l = 0;
int cnt = 1;
for (int i = 0; i < N; i++) {
l += L[i];
if (l <= X)
cnt++;
}
cout << cnt... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,956 | 812,957 | u489053642 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
#define rep(i, N... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
#define rep(i, N... | [
"expression.operation.binary.add"
] | 812,962 | 812,963 | u003860320 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define pb push_back
#define size(v) (int)v.size()
#define fast \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define pb push_back
#define size(v) (int)v.size()
#define fast \
ios_base::sync_with_stdio(false); ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,964 | 812,965 | u742642200 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> l(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
int dist, count, sum = 0;
for (int i = 0; i < N; i++) {
sum += l[i];
if (sum > X) {
break;
}
count += 1;
}
cout <<... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> l(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
int count = 1;
int sum = 0;
for (int i = 0; i < N; i++) {
sum += l[i];
if (sum > X) {
break;
}
count += 1;
}
co... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 812,966 | 812,967 | u894411949 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d = 0, cou = 0;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> c;
d += c;
if (b >= d)
cou++;
}
cout << cou << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d = 0, cou = 1;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> c;
d += c;
if (b >= d)
cou++;
}
cout << cou << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 812,983 | 812,984 | u705030113 | cpp |
p03000 | #include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll N, X;
cin >> N >> X;
ll L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
ll D[N + 1];
D[0] = 0;
for (int i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
}
ll count = 0;
for (int i = 0; i < N; i++) {
... | #include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll N, X;
cin >> N >> X;
ll L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
ll D[N + 1];
D[0] = 0;
for (int i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
}
ll count = 0;
for (int i = 0; i <= N; i++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,996 | 812,997 | u948515969 | cpp |
p03000 | #include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll N, X;
cin >> N >> X;
ll L[N];
for (ll i = 0; i < N; i++) {
cin >> L[i];
}
ll D[N + 1];
D[0] = 0;
for (ll i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
}
ll count = 0;
for (ll i = 0; i < N; i++) {
... | #include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll N, X;
cin >> N >> X;
ll L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
ll D[N + 1];
D[0] = 0;
for (int i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
}
ll count = 0;
for (int i = 0; i <= N; i++) {
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 812,998 | 812,997 | u948515969 | cpp |
p03000 | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,003 | 813,004 | u245710867 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, n;
cin >> x >> n;
int ans = 0;
int c1 = 0;
for (int i = 0; i < x; i++) {
int rr;
cin >> rr;
if (c1 + rr <= n) {
ans++;
c1 += rr;
} else {
c1 += rr;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, n;
cin >> x >> n;
int ans = 1;
int c1 = 0;
for (int i = 0; i < x; i++) {
int rr;
cin >> rr;
if (c1 + rr <= n) {
ans++;
c1 += rr;
} else {
c1 += rr;
}
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 813,009 | 813,010 | u432205669 | cpp |
p03000 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | [
"expression.operation.binary.add"
] | 813,011 | 813,012 | u775507068 | cpp |
p03000 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,013 | 813,012 | u775507068 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 10];
rep(i, n) { cin >> l[i]; }
int d[n + 10];
int cnt = 1;
d[0] = 0;
for (int i = 1; i < n; i++) {
d[i] = d[i - 1] + l[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 10];
rep(i, n) { cin >> l[i]; }
int d[n + 10];
int cnt = 1;
d[0] = 0;
for (int i = 1; i < n + 1; i++) {
d[i] = d[i - 1] ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,015 | 813,016 | u479032944 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, sum = 0, cnt = 0;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
for (int i = 0; i < n; i++) {
if (sum <= x) {
cnt++;
}
sum += l[i];
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x, sum = 0, cnt = 0;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
for (int i = 0; i <= n; i++) {
if (sum <= x) {
cnt++;
}
sum += l[i];
}
cout << cnt << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,023 | 813,024 | u561790111 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
for (int i = 0; i <= N; ++i)
cin >> L[i];
int jumpNb = 1;
long d = 0;
int i = 0;
while (i <= N && d <= X) {
d += L[i];
if (d <= X)
jumpNb++;
else
break;
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[i];
int jumpNb = 1;
long d = 0;
int i = 0;
while (i < N && d <= X) {
d += L[i];
if (d <= X)
jumpNb++;
else
break;
i++;
}
c... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 813,030 | 813,031 | u425389149 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
for (int i = 0; i <= N; ++i)
cin >> L[i];
int jumpNb = 1;
int d = 0;
int i = 0;
while (i <= N && d <= X) {
d += L[i];
if (d <= X)
jumpNb++;
else
break;
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[i];
int jumpNb = 1;
long d = 0;
int i = 0;
while (i < N && d <= X) {
d += L[i];
if (d <= X)
jumpNb++;
else
break;
i++;
}
c... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"control_flow.loop.condition.change"
] | 813,032 | 813,031 | u425389149 | cpp |
p03000 | //#pragma comment(linker, "/stack:247474112")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_... | //#pragma comment(linker, "/stack:247474112")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,038 | 813,039 | u003576582 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 0;
for (int i = 0; i <= x && ++ans < n;) {
int in;
cin >> in;
i += in;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int ans = 0;
for (int i = 0; i <= x && ++ans < n + 1;) {
int in;
cin >> in;
i += in;
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,040 | 813,041 | u450908524 | cpp |
p03000 | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <ios... | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <ios... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 813,044 | 813,045 | u410866813 | cpp |
p03000 | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <ios... | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <ios... | [
"variable_declaration.remove"
] | 813,046 | 813,045 | u410866813 | cpp |
p03000 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, x;
cin >> n >> x;... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, x;
cin >> n >> x;... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 813,047 | 813,048 | u287988203 | 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];
}
vector<int> D(N + 1);
int cnt;
D[0] = 0;
for (cnt = 1; cnt < N; cnt++) {
D[cnt] = D[cnt - 1] + L[cnt - 1];
if (D[cnt] > X)
break;
}... | #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];
}
vector<int> D(N + 1);
int cnt;
D[0] = 0;
for (cnt = 1; cnt < N + 1; cnt++) {
D[cnt] = D[cnt - 1] + L[cnt - 1];
if (D[cnt] > X)
break;... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,049 | 813,050 | u475690012 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int i = 1, D = 0;
for (; i <= N; i++) {
cin >> L;
D = D + L;
if (D < X)
continue;
break;
}
cout << i << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int i = 1, D = 0;
for (; i <= N; i++) {
cin >> L;
D = D + L;
if (D > X)
break;
}
cout << i << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,053 | 813,054 | u303454114 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.