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 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#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;
template <class T>
using Tree =
tree<T, n... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#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;
template <class T>
using Tree =
tree<T, n... | [
"identifier.change",
"io.output.change"
] | 813,492 | 813,493 | u631674931 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define bug(x) cout << "zdongdebug: " << x << endl;
#define bug2(x, y) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define bug(x) cout << "zdongdebug: " << x << endl;
#define bug2(x, y) ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 813,494 | 813,495 | u541410431 | cpp |
p03000 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,496 | 813,497 | u237010411 | cpp |
p03000 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | [
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,498 | 813,497 | u237010411 | cpp |
p03000 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define speedio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pretime float(clock() - clk) / CLOCKS_PER_SEC
#define max2(a, b) ((a) > (b) ?... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define speedio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pretime float(clock() - clk) / CLOCKS_PER_SEC
#define max2(a, b) ((a) > (b) ?... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.change"
] | 813,503 | 813,504 | u969686438 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%... | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%... | [
"expression.operation.binary.add"
] | 813,507 | 813,508 | u069870334 | cpp |
p03000 | #include <bits/stdc++.h>
#define LL long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPA(i, n) for (int i = 1; i < (n); ++i)
#define PII pair<int, int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define MOD ((int)1e9 + 7)
#define INF ((int)1e9)
#define INFLL ((LL)1e18)
#de... | #include <bits/stdc++.h>
#define LL long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPA(i, n) for (int i = 1; i < (n); ++i)
#define PII pair<int, int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define MOD ((int)1e9 + 7)
#define INF ((int)1e9)
#define INFLL ((LL)1e18)
#de... | [
"control_flow.branch.else.add"
] | 813,509 | 813,510 | u493610446 | cpp |
p03000 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int dx[4] =... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int dx[4] =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,513 | 813,514 | u199371251 | cpp |
p03000 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"expression.operation.binary.add"
] | 813,515 | 813,516 | u093922224 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<int> retu(a);
for (int i = 0; i < a; i++) {
cin >> retu.at(i);
}
int cnt = 1;
int sum = 0;
for (int j = 0; j < a; j++) {
sum = sum + retu.at(j);
if (sum < b) {
cnt++;
} else {
break;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<int> retu(a);
for (int i = 0; i < a; i++) {
cin >> retu.at(i);
}
int cnt = 1;
int sum = 0;
for (int j = 0; j < a; j++) {
sum = sum + retu.at(j);
if (sum <= b) {
cnt++;
} else {
break... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,517 | 813,518 | u153794369 | cpp |
p03000 | #include <bits/stdc++.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 count = 0;
vector<int> a(n + 1);
a[0] = 0;
for (int i = 1; i < n + 1; i++) {
a[i] = a[i - 1] + l[i -... | #include <bits/stdc++.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 count = 0;
vector<int> a(n + 1);
a[0] = 0;
for (int i = 1; i < n + 1; i++) {
a[i] = a[i - 1] + l[i -... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 813,523 | 813,524 | u939401127 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int i = 1, cnt = 1, val;
cin >> val;
while (i < n && val <= x) {
++cnt;
++i;
int v;
cin >> v;
val += v;
}
if (i >= n) {
++cnt;
}
while (i < n) {
int v;
cin >> v;
++i;
}
cout << cnt <<... | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int i = 1, cnt = 1, val;
cin >> val;
while (i < n && val <= x) {
++cnt;
++i;
int v;
cin >> v;
val += v;
}
if (i >= n && val <= x) {
++cnt;
}
while (i < n) {
int v;
cin >> v;
++i;
}
co... | [
"control_flow.branch.if.condition.change"
] | 813,529 | 813,530 | u301432992 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int X, N;
int L[101];
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
bool flg = false;
int D[100];
D[0] = 0;
for (int i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
if (D[i + 1] > X) {
flg = true;
cout << i + 1 ... | #include <iostream>
using namespace std;
int main() {
int X, N;
int L[101];
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
bool flg = false;
int D[100];
D[0] = 0;
for (int i = 0; i < N; i++) {
D[i + 1] = D[i] + L[i];
if (D[i + 1] > X) {
flg = true;
cout << i + 1 ... | [
"expression.operation.binary.add"
] | 813,535 | 813,536 | u551795653 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, d = 0, ans = 1;
cin >> n >> x;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int s[10001];
s[0] = 0;
for (int i = 2; i <= n; i++) {
s[i] = a[i] + s[i - 1];
if (s[i] <= x)
ans++;
}
cout << ans << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, d = 0, ans = 1;
cin >> n >> x;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int s[10001];
s[0] = 0;
for (int i = 1; i <= n; i++) {
s[i] = a[i] + s[i - 1];
if (s[i] <= x)
ans++;
}
cout << ans << endl;
re... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 813,537 | 813,538 | u504403442 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl ... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl ... | [
"variable_declaration.value.change"
] | 813,541 | 813,542 | u669461113 | cpp |
p03000 | #include <bits/stdc++.h>
//#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popc... | #include <bits/stdc++.h>
//#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popc... | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,547 | 813,548 | u381626581 | cpp |
p03000 | #include <bits/stdc++.h>
#define MOD 1000000007
#define MX INT_MAX
using namespace std;
#define int long long
int32_t main() {
int n, x, s = 0, l, i;
cin >> n >> x;
for (i = 1; i <= n; ++i) {
cin >> l;
s += l;
if (s > x)
break;
}
if (s <= x)
cout << n << endl;
else {
cout << i <<... | #include <bits/stdc++.h>
#define MOD 1000000007
#define MX INT_MAX
using namespace std;
#define int long long
int32_t main() {
int n, x, s = 0, l, i;
cin >> n >> x;
for (i = 1; i <= n; ++i) {
cin >> l;
s += l;
if (s > x)
break;
}
if (s <= x)
cout << n + 1 << endl;
else {
cout << ... | [
"expression.operation.binary.add"
] | 813,549 | 813,550 | u976783709 | cpp |
p03000 | #include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size)
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
... | #include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size)
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
template <class T> bool chmax(T &a, const 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"
] | 813,551 | 813,552 | u917013605 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
vector<int> D(N + 3);
D[1] = 0;
int count = 0;
for (int i = 1; i <= N; i++) {
cin >> L[i];
}
for (int i = 1; i <= N + 1; i++) {
D[i + 1] = D[i] + L[i];
}
for (int i = 1; i <= N +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
vector<int> D(N + 3);
D[1] = 0;
int count = 0;
for (int i = 1; i <= N; i++) {
cin >> L[i];
}
for (int i = 1; i <= N; i++) {
D[i + 1] = D[i] + L[i];
}
for (int i = 1; i <= N + 1; ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,565 | 813,566 | u527058497 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b = 0, c = 0, a, d = 0, e, m, n, k, x, o = 0, p, q, x1, y1, z, max1 = 0,
s = 0, ans, r, i1 = -1;
string t, u;
cin >> n >> x;
ll l;
for (ll i = 0; i < n; i++) {
cin >> l;
o += l;... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b = 0, c = 0, a, d = 0, e, m, n, k, x, o = 0, p, q, x1, y1, z, max1 = 0,
s = 0, ans, r, i1 = -1;
string t, u;
cin >> n >> x;
ll l;
for (ll i = 0; i < n; i++) {
cin >> l;
o += l;... | [
"assignment.change"
] | 813,569 | 813,570 | u953532675 | cpp |
p03000 | #include <stdio.h>
int main() {
int N, X;
scanf("%d %d", &N, &X);
int L[N + 1];
L[0] = 0;
for (int i = 1; i < N + 1; i++) {
scanf("%d", &L[i]);
}
int D = 0;
for (int i = 0; i < N + 1; i++) {
D = D + L[i];
if (D > X) {
printf("%d", i);
break;
}
if (i == N) {
printf(... | #include <stdio.h>
int main() {
int N, X;
scanf("%d %d", &N, &X);
int L[N + 1];
L[0] = 0;
for (int i = 1; i < N + 1; i++) {
scanf("%d", &L[i]);
}
int D = 0;
for (int i = 0; i < N + 1; i++) {
D = D + L[i];
if (D > X) {
printf("%d", i);
break;
}
if (i == N) {
printf(... | [
"expression.operation.binary.add"
] | 813,573 | 813,574 | u729937959 | cpp |
p03000 | #include <stdio.h>
int main() {
int N, X;
scanf("%d %d", &N, &X);
int L[N + 1];
L[0] = 0;
for (int i = 1; i < N + 1; i++) {
scanf("%d", &L[i]);
}
int D = 0;
for (int i = 0; i < N + 1; i++) {
D = D + L[i];
if (D > X) {
printf("%d", i);
break;
}
if (i = N) {
printf("... | #include <stdio.h>
int main() {
int N, X;
scanf("%d %d", &N, &X);
int L[N + 1];
L[0] = 0;
for (int i = 1; i < N + 1; i++) {
scanf("%d", &L[i]);
}
int D = 0;
for (int i = 0; i < N + 1; i++) {
D = D + L[i];
if (D > X) {
printf("%d", i);
break;
}
if (i == N) {
printf(... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 813,575 | 813,574 | u729937959 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0, c = 0;
for (int i = 0; i < N; i++) {
if (D > X)
break;
c++;
int L;
cin >> L;
D += L;
}
cout << c << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0, c = 0;
for (int i = 0; i <= N; i++) {
if (D > X)
break;
c++;
int L;
cin >> L;
D += L;
}
cout << c << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,576 | 813,577 | u472926449 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
ll n, x;
cin >> n >> x;
ll d1 = 0;
ll cnt = 1;
while (n--) {
ll ln;
cin >> ln;
ll dn;
dn = d1 + ln;
if (dn <= x) {
d1 = dn;
cnt++;
}
}
cout << cnt << endl;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
ll n, x;
cin >> n >> x;
ll d1 = 0;
ll cnt = 1;
while (n--) {
ll ln;
cin >> ln;
ll dn;
dn = d1 + ln;
if (dn <= x) {
d1 = dn;
cnt++;
// cout << dn << endl;
} e... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 813,578 | 813,579 | u326782582 | 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 coun = 0;
int pos = 0;
for (int i = 0; i < n; i++) {
if (pos <= x) {
++coun;
}
pos = pos + l[i];
}
cout << coun << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int coun = 0;
int pos = 0;
for (int i = 0; i < n + 1; i++) {
if (pos <= x) {
++coun;
}
pos = pos + l[i];
}
cout << coun << endl;
retur... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,580 | 813,581 | u514429645 | cpp |
p03000 | #include <cstdio>
#include <iostream>
using namespace std;
const int maxn = 10000 + 5;
int n, x;
int mem[105];
int ans[maxn];
int solve() {
int i;
for (i = 0; i < n; i++) {
if (i) {
ans[i] = mem[i - 1] + ans[i - 1];
if (ans[i] > x)
break;
} else
ans[i] = 0;
}
return i;
}
int... | #include <cstdio>
#include <iostream>
using namespace std;
const int maxn = 10000 + 5;
int n, x;
int mem[105];
int ans[maxn];
int solve() {
int i;
for (i = 0; i <= n; i++) {
if (i) {
ans[i] = mem[i - 1] + ans[i - 1];
if (ans[i] > x)
break;
} else
ans[i] = 0;
}
return i;
}
in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,582 | 813,583 | u141938981 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define forn for (int i = 0; i < n; i++)
int main() {
int n, x;
cin >> n >> x;
int arr[n];
forn cin >> arr[i];
int ans[n + 1];
ans[0] = 0;
for (int i = 1; i <= n; i++)
ans[i] = ans[i - 1] + arr[i];
int cnt = 0;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define forn for (int i = 0; i < n; i++)
int main() {
int n, x;
cin >> n >> x;
int arr[n];
forn cin >> arr[i];
int ans[n + 1];
ans[0] = 0;
for (int i = 1; i <= n; i++)
ans[i] = ans[i - 1] + arr[i - 1];
int cnt = 0;
for (int i ... | [
"assignment.change"
] | 813,586 | 813,587 | u972416449 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, sum = 0, sum2 = 0;
cin >> n >> x;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
if (sum > x)
sum2++;
}
cout << sum2 + 1;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, sum = 0, sum2 = 0;
cin >> n >> x;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
if (sum <= x)
sum2++;
}
cout << sum2 + 1;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,588 | 813,589 | u127882207 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// rep
//------------------------------------------
#define FOR(i, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// rep
//------------------------------------------
#define FOR(i, ... | [
"expression.operation.binary.add"
] | 813,592 | 813,593 | u187153832 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int D[105], L[105];
int n, x, count = 0;
scanf("%d%d", &n, &x);
D[0] = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &L[i]);
}
for (int i = 1; i < n; ++i) {
D[i] = D[i - 1] + L[i - 1];
}
for (int i = 0; i < n; ++i) {
if (D[i] <= x)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int D[105], L[105];
int n, x, count = 0;
scanf("%d%d", &n, &x);
D[0] = 0;
for (int i = 0; i <= n; ++i) {
scanf("%d", &L[i]);
}
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] <=... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,596 | 813,597 | u078168127 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, kq = 0;
cin >> n >> x;
int a[n], b[n + 1];
for (int i = 0; i < n + 1; i++) {
if (i < n)
cin >> a[i];
if (i == 0)
b[i] = 0;
else
b[i] = b[i - 1] + a[i];
if (x >= b[i])
kq++;
else
break;
}
cout <<... | #include <iostream>
using namespace std;
int main() {
int n, x, kq = 0;
cin >> n >> x;
int a[n], b[n + 1];
for (int i = 0; i < n + 1; i++) {
if (i < n)
cin >> a[i];
if (i == 0)
b[i] = 0;
else
b[i] = b[i - 1] + a[i - 1];
if (x >= b[i])
kq++;
else
break;
}
cou... | [
"assignment.change"
] | 813,600 | 813,601 | u296264105 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll N;
ll M;
string s;
vector<ll> input1;
vector<vector<... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll N;
ll M;
string s;
vector<ll> input1;
vector<vector<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,602 | 813,603 | u048791623 | 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 ans = 1;
int sum = 0;
int che = 0;
for (int i = 1; i < N; i++) {
sum += L.at(i - 1);
ans++;
if (sum > X) {
che++;
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.at(i);
}
int ans = 1;
int sum = 0;
int che = 0;
for (int i = 0; i < N; i++) {
sum += L.at(i);
ans++;
if (sum > X) {
che++;
break;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 813,604 | 813,605 | u096717230 | cpp |
p03000 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, x;
int a[105], d[105];
cin >> n >> x;
cin >> a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
}
d[0] = 0;
for (int i = 1; i <= n; i++) {
d[i] = a[i] + d[i - 1];
}
int cnt = 0;
for (int i = 0... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, x;
int a[105], d[105];
cin >> n >> x;
cin >> a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
}
d[0] = 0;
for (int i = 1; i <= n; i++) {
d[i] = a[i - 1] + d[i - 1];
}
int cnt = 0;
for (int i... | [
"assignment.change"
] | 813,612 | 813,613 | u517312043 | cpp |
p03000 | #include <iostream>
using namespace std;
int main(void) {
int n, x, c = 0;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
for (int i = 1; i < n - 1; i++) {
l[i] = l[i - 1] + l[i];
}
for (int i = 0; i < n; i++) {
if (l[i] <= x) {
c++;
}
}
cout << c << endl... | #include <iostream>
using namespace std;
int main(void) {
int n, x, c = 0;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
for (int i = 1; i < n; i++) {
l[i] = l[i - 1] + l[i];
}
for (int i = 0; i < n; i++) {
if (l[i] <= x) {
c++;
}
}
cout << c + 1 << endl... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 813,614 | 813,615 | u884336498 | 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() {
ll n, x, L[200001], A[200001];
cin >> n >> x;
rep(i, n) cin >> L[i];
A[0] = 0;
rep(i, n) A[i + 1] = A[i] + L[i];
int ans = 0;
rep(i, n) if (A[i] <= x) ans++;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll n, x, L[200001], A[200001];
cin >> n >> x;
rep(i, n) cin >> L[i];
A[0] = 0;
rep(i, n) A[i + 1] = A[i] + L[i];
int ans = 0;
rep(i, n + 1) if (A[i] <= x) ans++;
cout << ans;
}
| [
"expression.operation.binary.add"
] | 813,625 | 813,626 | u441296840 | cpp |
p03000 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
int l[105];
cin >> n >> m;
l[0] = 0;
int d[105] = {0};
for (int i = 0; i < n; ++i) {
cin >> l[i]... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
int l[105];
cin >> n >> m;
l[0] = 0;
int d[105] = {0};
for (int i = 0; i < n; ++i) {
cin >> l[i]... | [
"expression.operation.binary.add"
] | 813,632 | 813,633 | u582817680 | 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, ans = 0, d;
cin >> n >> x;
vector<int> l(n);
REP(i, n) cin >> l[i];
REP(i, n) {
if (i == 0) {
d = 0;
ans++;
} else {
d = d + l[i - 1];
if (d <= x)
ans++;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int n, x, ans = 0, d;
cin >> n >> x;
vector<int> l(n);
REP(i, n) cin >> l[i];
REP(i, n + 1) {
if (i == 0) {
d = 0;
ans++;
} else {
d = d + l[i - 1];
if (d <= x)
ans+... | [
"expression.operation.binary.add"
] | 813,634 | 813,635 | u303884911 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, i;
int c = 0;
int s = 0;
int l[100] = {};
cin >> n >> x;
for (i = 0; i < n; i++) {
cin >> l[i];
s += l[i];
if (s <= x) {
c++;
}
}
cout << c;
}
| #include <iostream>
using namespace std;
int main() {
int n, x, i;
int c = 1;
int s = 0;
int l[100] = {};
cin >> n >> x;
for (i = 0; i < n; i++) {
cin >> l[i];
s += l[i];
if (s <= x) {
c++;
}
}
cout << c;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 813,638 | 813,639 | u664272778 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, l, s = 0, m = 0;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l;
s += l;
m++;
if (s > x) {
break;
}
}
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, l, s = 0, m = 0;
cin >> n >> x;
for (int i = 0; i < n + 1; i++) {
cin >> l;
s += l;
m++;
if (s > x) {
break;
}
}
cout << m << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,640 | 813,641 | u167226536 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int x, n, l[110], d = 0, res = 1;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> l[i];
for (int i = 2; i <= n + 1; i++) {
if (d + l[i - 1] <= x) {
res++;
d = d + l[i - 1];
} else
break;
}
cout << res << endl;
return ... | #include <iostream>
using namespace std;
int main() {
int x, n, l[110], d = 0, res = 1;
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> l[i];
for (int i = 2; i <= n + 1; i++) {
if (d + l[i - 2] <= x) {
res++;
d = d + l[i - 2];
} else
break;
}
cout << res << endl;
return ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 813,642 | 813,643 | u455317716 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int i, n, x, sum = 0, ans = 0;
cin >> n >> x;
int l[n + 1];
for (i = 0; i < n; i++) {
cin >> l[i];
}
for (i = 0; sum <= x; i++) {
sum += l[i];
ans++;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long i, n, x, sum = 0, ans = 0;
cin >> n >> x;
long l[n + 1];
for (i = 0; i < n; i++) {
cin >> l[i];
}
for (i = 0; sum <= x; i++) {
sum += l[i];
ans++;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 813,655 | 813,656 | u821416900 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 1;
int L[101], D[10001];
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> D[i];
D[1] = 0;
for (int i = 2; i <= n + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
cnt++;
}
cout << cnt;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 1;
int L[101], D[10001];
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> L[i];
D[1] = 0;
for (int i = 2; i <= n + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
cnt++;
}
cout << cnt;
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 813,661 | 813,662 | u426432817 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 1;
int L[101], D[10001];
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> D[i];
D[1] = 0;
for (int i = 2; i <= n; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
cnt++;
}
cout << cnt;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 1;
int L[101], D[10001];
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> L[i];
D[1] = 0;
for (int i = 2; i <= n + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
cnt++;
}
cout << cnt;
return 0;
} | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,663 | 813,662 | u426432817 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 1;
int L[101], D[10001];
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> D[i];
D[1] = 0;
for (int i = 2; i <= x; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
cnt++;
}
cout << cnt;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 1;
int L[101], D[10001];
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> L[i];
D[1] = 0;
for (int i = 2; i <= n + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= x)
cnt++;
}
cout << cnt;
return 0;
} | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,664 | 813,662 | u426432817 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, x, d = 0, l, t = 1;
cin >> n >> x;
for (int a = 0; a < n; a++) {
cin >> l;
d += l;
if (x ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, x, d = 0, l, t = 1;
cin >> n >> x;
for (int a = 0; a < n; a++) {
cin >> l;
d += l;
if (x ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,669 | 813,670 | u468506413 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1), L(N + 1);
for (int i = 1; i <= N; i++) {
cin >> L.at(i);
}
D.at(1) = 0;
for (int i = 2; i <= N; i++) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
}
int ans = 0;
for (int i = 1; i <= N; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 2), L(N + 1);
for (int i = 1; i <= N; i++) {
cin >> L.at(i);
}
D.at(1) = 0;
for (int i = 2; i <= N + 1; i++) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
}
int ans = 0;
for (int i = 1; i <= N... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,671 | 813,672 | u372299304 | cpp |
p03000 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// b
int n, x;
cin >> n >> x;
int cur = 0;
int ans = 0;
for (int i = 0; i + 1 < n; i++) {
int l;
cin >> l;
if (cur <= x)
ans++;
cur = cur + l;
}
if (... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// b
int n, x;
cin >> n >> x;
int cur = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
if (cur <= x)
ans++;
cur = cur + l;
}
if (cur ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 813,681 | 813,682 | u817760251 | 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];
vector<int> D(N + 1, 0);
for (int i = 1; i < N + 1; ++i) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] > X) {
cout << i << endl;
re... | #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];
vector<int> D(N + 1, 0);
for (int i = 1; i < N + 1; ++i) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] > X) {
cout << i << endl;
re... | [
"expression.operation.binary.add"
] | 813,690 | 813,691 | u777474133 | cpp |
p03000 | #include <iostream>
using namespace std;
int N;
int X;
int L[100];
int main() {
cin >> N >> X;
for (int i = 0; i < N; ++i)
cin >> L[i];
int count = 0;
int L_all = 0;
for (int j = 0; j < N; ++j) {
L_all += L[j];
if (L_all > X)
break;
count += 1;
}
cout << count << endl;
} | #include <iostream>
using namespace std;
int N;
int X;
int L[100];
int main() {
cin >> N >> X;
for (int i = 0; i < N; ++i)
cin >> L[i];
int count = 1;
int L_all = 0;
for (int j = 0; j < N; ++j) {
L_all += L[j];
if (L_all > X)
break;
count += 1;
}
cout << count << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,698 | 813,699 | u061898182 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#incl... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#incl... | [
"variable_declaration.name.change",
"identifier.change",
"io.output.change"
] | 813,704 | 813,705 | u559149715 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D[N + 1];
D[0] = 0;
int count = 1;
for (int i = 1; i < N + 2; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] < X) {
count++;
}
}
cout << cou... | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D[N + 1];
D[0] = 0;
int count = 1;
for (int i = 1; i <= N; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X) {
count++;
}
}
cout << count... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 813,717 | 813,718 | u249466958 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D[N + 1];
D[0] = 0;
int count = 0;
for (int i = 1; i <= N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] < X) {
count++;
}
}
cout << co... | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D[N + 1];
D[0] = 0;
int count = 1;
for (int i = 1; i <= N; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X) {
count++;
}
}
cout << count... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,719 | 813,718 | u249466958 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D[N + 1];
D[0] = 0;
int count = 0;
for (int i = 1; i < N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] < X) {
count++;
}
}
cout << cou... | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int D[N + 1];
D[0] = 0;
int count = 1;
for (int i = 1; i <= N; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X) {
count++;
}
}
cout << count... | [
"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",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 813,720 | 813,718 | u249466958 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define push emplace_back
#define each(i, x) for ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define push emplace_back
#define each(i, x) for ... | [
"call.remove"
] | 813,727 | 813,728 | u244806387 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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 = 1; i < N; i++) {
d = d + L[i - 1];
if (d > X)
break;
ans+... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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 = 1; i < N + 1; i++) {
d = d + L[i - 1];
if (d > X)
break;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,729 | 813,730 | u743574271 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, sum = 0, summ = 0, a;
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> a;
summ += a;
if (summ <= m)
sum++;
else
break;
}
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, sum = 0, summ = 0, a;
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> a;
summ += a;
if (summ <= m)
sum++;
else
break;
}
cout << sum + 1;
return 0;
} | [
"expression.operation.binary.add"
] | 813,733 | 813,734 | u879895449 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x;
int l[110];
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int d[110];
d[0] = 0;
for (int i = 1; i < n; i++) {... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x;
int l[110];
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int d[110];
d[0] = 0;
for (int i = 1; i < n + 1; i+... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,735 | 813,736 | u372177994 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x;
int l[100];
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += l[i];
if (ans > x) {
cout << i + 1 << endl;
return 0;
}
}
cout << n << endl;
retu... | #include <iostream>
using namespace std;
int main() {
int n, x;
int l[100];
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += l[i];
if (ans > x) {
cout << i + 1 << endl;
return 0;
}
}
cout << n + 1 << endl;
... | [
"expression.operation.binary.add"
] | 813,739 | 813,740 | u752013826 | cpp |
p03000 | #define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N, 0);
vector<int> D(N, 0);
REP(i, N) { cin >> L[i]; }
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i - 1];
}
int cnt = 0;
REP(i, N) {
... | #define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N, 0);
vector<int> D(N + 1, 0);
REP(i, N) { cin >> L[i]; }
for (int i = 1; i < N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
}
int cnt = 0;
REP(i,... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,757 | 813,758 | u518206537 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N + 1], D[N + 1];
int cnt = 0;
for (int i = 1; i <= N; i++) {
cin >> L[i];
}
D[1] = 0;
for (int i = 2; i <= N; i++) {
D[i] = D[i - 1] + L[i - 1];
}
for (int i = 1; i <= N; i++) {
if (D[i] <= X)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N + 1], D[N + 2];
int cnt = 0;
for (int i = 1; i <= N; i++) {
cin >> L[i];
}
D[1] = 0;
for (int i = 2; i <= N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
}
for (int i = 1; i <= N + 1; i++) {
if (D[i... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,761 | 813,762 | u998379501 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
int a = 0;
int b = 0;
cin >> n >> x;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
if (a > x) {
break;
}
a += vec.at(i);
b++;
}
if (x > a) {
b += ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
int a = 0;
int b = 0;
cin >> n >> x;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
if (a > x) {
break;
}
a += vec.at(i);
b++;
}
if (x >= a) {
b +=... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,763 | 813,764 | u469451657 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> v(N);
vector<int> s(N);
for (int i = 0; i < N; i++)
cin >> v[i];
for (int i = 0; i <= N; i++) {
s[i + 1] = s[i] + v[i];
}
int ans = 1;
for (int i = 1; i <= N; i++)... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> v(N + 10);
vector<int> s(N + 10);
for (int i = 0; i < N; i++)
cin >> v[i];
for (int i = 0; i <= N; i++) {
s[i + 1] = s[i] + v[i];
}
int ans = 1;
for (int i = 1; i ... | [
"assignment.change"
] | 813,778 | 813,779 | u390901416 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1], d[n];
d[0] = 0;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
d[i + 1] = d[i] + l[i];
if (d[i + 1] <= x)
c++;
}
cout << c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1], d[n];
d[0] = 0;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
d[i + 1] = d[i] + l[i];
if (d[i + 1] <= x)
c++;
}
cout << c + 1;
return 0;
} | [
"expression.operation.binary.add"
] | 813,782 | 813,783 | u331404418 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1], d[n];
d[0] = 1;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
d[i + 1] = d[i] + l[i];
if (d[i + 1] <= x)
c++;
}
cout << c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n + 1], d[n];
d[0] = 0;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
d[i + 1] = d[i] + l[i];
if (d[i + 1] <= x)
c++;
}
cout << c + 1;
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 813,784 | 813,783 | u331404418 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (auto &i : l)
cin >> i;
int ans = 0;
for (int i = 0, sum = 0; i < n; ++i) {
if (sum + l[i] <= x) {
sum += l[i];
++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 (auto &i : l)
cin >> i;
int ans = 0;
for (int i = 0, sum = 0; i < n; ++i) {
if (sum + l[i] <= x) {
sum += l[i];
++ans;
} else
break;
}
cout << ans + 1 << endl;
} | [
"expression.operation.binary.add"
] | 813,785 | 813,786 | u647474992 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int zahyou = 0, count = 1;
vector<int> vec;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
zahyou += vec.at(i);
if (zahyou > X) {
break;
}
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int zahyou = 0, count = 1;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
zahyou += vec.at(i);
if (zahyou > X) {
break;
}
count++;
}
cout << count << endl;
}
| [] | 813,794 | 813,795 | u003761219 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxN = 1e5 + 7;
const int maxV = 90010;
// const int INF = 1e9+9;
// const ll INF = (1ll)<<60;
const int INF = 2e9 + 9;
const ull MOD = 16769023;
const ull ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxN = 1e5 + 7;
const int maxV = 90010;
// const int INF = 1e9+9;
// const ll INF = (1ll)<<60;
const int INF = 2e9 + 9;
const ull MOD = 16769023;
const ull ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,798 | 813,799 | u807919574 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void init() {}
void solve() {
int n, k;
scanf("%d %d", &n, &k);
int s = 0, ans = 0;
while (n-- && s <= k) {
int p;
scanf("%d", &p);
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void init() {}
void solve() {
int n, k;
scanf("%d %d", &n, &k);
int s = 0, ans = 0;
while (n-- && s <= k) {
int p;
scanf("%d", &p);
... | [
"control_flow.branch.if.condition.change"
] | 813,800 | 813,801 | u800645121 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0;
int count = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
if (D <= X) {
D += L;
count++;
} else
break;
}
cout << count << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int D = 0;
int count = 1;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
if (D + L <= X) {
D += L;
count++;
} else
break;
}
cout << count << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 813,804 | 813,805 | u694711153 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--)
#define IREP(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--)
#define IREP(i, m, n) for (int i = ... | [
"call.arguments.add"
] | 813,810 | 813,811 | u530107518 | cpp |
p03000 | #include <bits/stdc++.h>
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
vector<int> D(N + 1, 0);
for (int i = 1; i < N + 1; i++) {
D[i] = D[i - 1]... | #include <bits/stdc++.h>
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
vector<int> D(N + 1, 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,814 | 813,815 | u228351697 | cpp |
p03000 | #include <bits/stdc++.h>
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
vector<int> D(N, 0);
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i -... | #include <bits/stdc++.h>
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
vector<int> D(N + 1, 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,816 | 813,815 | u228351697 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int sum = 1;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
X -= a;
if (X >= 0) {
cin >> a;
sum++;
} else
break;
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int sum = 1;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
X -= a;
if (X >= 0) {
sum++;
} else
break;
}
cout << sum;
} | [] | 813,817 | 813,818 | u593555034 | cpp |
p03000 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#define rep(index, num) for (int index = 0; index < num; ++index)
using namespace std;
int X, N;
int L[101];
int solve(int X, int N) {
int count = 0;
int D = 0;
while (D <= X &&... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#define rep(index, num) for (int index = 0; index < num; ++index)
using namespace std;
int X, N;
int L[101];
int solve(int X, int N) {
int count = 0;
int D = 0;
while (D <= X &&... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 813,821 | 813,822 | u640931866 | cpp |
p03000 | //#include "pch.h"
#include <algorithm>
#include <iostream>
#include <string>
#include <iostream>
using namespace std;
int main() {
int N, X;
int L[110], D[110];
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i - 1];
}
... | //#include "pch.h"
#include <algorithm>
#include <iostream>
#include <string>
#include <iostream>
using namespace std;
int main() {
int N, X;
int L[110], D[110];
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,827 | 813,828 | u919992484 | cpp |
p03000 | #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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define all(x) (x).begin(), (x).end()
... | #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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define all(x) (x).begin(), (x).end()
... | [
"identifier.replace.add",
"literal.replace.remove"
] | 813,829 | 813,830 | u034671639 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N;
int X;
int L[101];
int D[101];
L[0] = 0;
D[0] = 0;
D[1] = 0;
cin >> N >> X;
for (int i = 1; i <= N; i++) {
cin >> L[i];
}
int itr = 1;
for (int i = 2; i <= N; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X)
itr+... | #include <iostream>
using namespace std;
int main() {
int N;
int X;
int L[101];
int D[101];
L[0] = 0;
D[0] = 0;
D[1] = 0;
cin >> N >> X;
for (int i = 1; i <= N; i++) {
cin >> L[i];
}
int itr = 1;
for (int i = 2; i <= N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X)
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,850 | 813,851 | u126644974 | cpp |
p03000 | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, X, l, count = 1;
cin >> N >> X;
vector<int> L(N, 0);
for (int i = 1; i < N; i++) {
cin >> l;
L[i] = L[i - 1] + l;
if (L[i] > X)
break;
count++;
}
cout << count << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, X, l, count = 1;
cin >> N >> X;
vector<int> L(N, 0);
for (int i = 1; i <= N; i++) {
cin >> l;
L[i] = L[i - 1] + l;
if (L[i] > X)
break;
count++;
}
cout << count << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,852 | 813,853 | u780684946 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, x;
vector<int> l;
cin >> n >> x;
l.resize(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ans, d;
ans = 0;
d = 0;
while (d <= x) {
d += l[ans];
ans++;
if (ans == n)
break;
}
cout << a... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, x;
vector<int> l;
cin >> n >> x;
l.resize(n + 1);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ans, d;
ans = 0;
d = 0;
while (d <= x) {
d += l[ans];
ans++;
if (ans == n + 1)
break;
}
c... | [
"control_flow.branch.if.condition.change"
] | 813,856 | 813,857 | u536922989 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
int main() {
ll n, x, ans = 1;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
for (ll i = 0, d = 0;; ++i) {
d += l[i];
if (d <= x)
ans++;
else
break;
}
cout <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
int main() {
ll n, x, ans = 1;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
for (ll i = 0, d = 0; i < n; ++i) {
d += l[i];
if (d <= x)
ans++;
else
break;
}
... | [
"control_flow.loop.for.condition.change"
] | 813,860 | 813,861 | u147571984 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
int D = 0;
int ans = 1;
for (ans = 0; D <= X && ans < N; ++ans) {
D += L[ans];
}
if (D == X) {
++ans;
}
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 D = 0;
int ans = 1;
for (ans = 0; D <= X && ans < N; ++ans) {
D += L[ans];
}
if (D <= X) {
++ans;
}
cout << ans << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,868 | 813,869 | u627431737 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, i, x, l[1000], d = 0, dem = 1;
cin >> n >> x;
for (i = 0; i < n; i++)
cin >> l[0];
for (i = 0; i < n; i++) {
d += l[i];
if (d > x)
break;
dem++;
}
cout << dem;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, i, x, l[1000], d = 0, dem = 1;
cin >> n >> x;
for (i = 0; i < n; i++)
cin >> l[i];
for (i = 0; i < n; i++) {
d += l[i];
if (d > x)
break;
dem++;
}
cout << dem;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 813,881 | 813,882 | u244011526 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, i, x, l[1000], d = 0, dem = 1;
cin >> n >> x;
for (i = 0; i < n; i++)
cin >> l[0];
for (i = 0; i < n; i++) {
d += l[i];
if (d > x)
break;
dem++;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, i, x, l[1000], d = 0, dem = 1;
cin >> n >> x;
for (i = 0; i < n; i++)
cin >> l[i];
for (i = 0; i < n; i++) {
d += l[i];
if (d > x)
break;
dem++;
}
cout << dem;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 813,883 | 813,882 | u244011526 | cpp |
p03000 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define INF 1e9
#define MOD 1e9 + 7
#defi... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define INF 1e9
#define MOD 1e9 + 7
#defi... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,884 | 813,885 | u270170852 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[100];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ans = 0;
int now = 0;
for (int i = 0; i < n; i++) {
now += l[i];
ans++;
if (now > x) {
break;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[100];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int ans = 0;
int now = 0;
for (int i = 0; i < (n + 1); i++) {
now += l[i];
ans++;
if (now > x) {
break;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change"
] | 813,886 | 813,887 | u745852541 | cpp |
p03000 | #include <cstdlib>
#include <iostream>
int main() {
int n, x;
std::cin >> n >> x;
int l[110];
for (int i = 0; i < n; ++i)
std::cin >> l[i];
int d[110];
d[0] = 0;
int count = 0;
for (int i = 1; i <= n; ++i) {
d[i] = d[i - 1] + l[i - 1];
if (d[i - 1] <= x)
++count;
}
std::cout << ... | #include <cstdlib>
#include <iostream>
int main() {
int n, x;
std::cin >> n >> x;
int l[110];
for (int i = 0; i < n; ++i)
std::cin >> l[i];
int d[110];
d[0] = 0;
int count = 1;
for (int i = 1; i <= n; ++i) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
++count;
}
std::cout << coun... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 813,890 | 813,891 | u853146173 | cpp |
p03000 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,903 | 813,904 | u628047647 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define pb push_back
#define mp make_pair
#define... | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define pb push_back
#define mp make_pair
#define... | [
"expression.operation.binary.add"
] | 813,907 | 813,908 | u303059352 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define pb push_back
#define mp make_pair
#define... | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define pb push_back
#define mp make_pair
#define... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,909 | 813,908 | u303059352 | 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 i;
for (i = 0; i < n; i++) {
cin >> L[i];
sum = sum + L[i];
if (sum > x) {
cout << i + 1;
break;
}
}
if (sum < x) {
cout << i;
}
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, x;
cin >> n >> x;
int L[n];
int sum = 0;
int i;
for (i = 0; i < n; i++) {
cin >> L[i];
sum = sum + L[i];
if (sum > x) {
cout << i + 1;
break;
}
}
if (sum <= x) {
cout << i + 1;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,914 | 813,915 | u851558026 | 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 i;
int ans = 0;
for (i = 0; i < n; i++) {
cin >> L[i];
sum = sum + L[i];
if (sum <= x) {
ans++;
}
}
cout << ans;
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, x;
cin >> n >> x;
int L[n];
int sum = 0;
int i;
int ans = 1;
for (i = 0; i < n; i++) {
cin >> L[i];
sum = sum + L[i];
if (sum <= x) {
ans++;
}
}
cout << ans;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 813,916 | 813,917 | u851558026 | cpp |
p03000 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
int b = 1, k = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
k += a[i];
if (k < x) {
b++;
}
}
cout << b;
} | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
int b = 1, k = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
k += a[i];
if (k <= x) {
b++;
}
}
cout << b;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,926 | 813,927 | u714650028 | cpp |
p03000 | #include <iostream>
using namespace std;
int a[101];
int n, x, c, s, k;
int main() {
cin >> n >> x;
k = 1;
for (int i = 1; i < n; i++) {
cin >> c;
s += c;
if (s > x) {
cout << k;
return 0;
}
k += 1;
}
cout << k;
return 0;
}
| #include <iostream>
using namespace std;
int a[101];
int n, x, c, s, k;
int main() {
cin >> n >> x;
k = 1;
for (int i = 1; i <= n; i++) {
cin >> c;
s += c;
if (s > x) {
cout << k;
return 0;
}
k += 1;
}
cout << k;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,928 | 813,929 | u169354034 | cpp |
p03000 | #pragma warning(disable : 4996)
#include <stdio.h>
int main() {
int n, x;
int L[150];
scanf("%d %d", &n, &x);
for (int i = 0; i < n; i++) {
scanf("%d", &L[i]);
}
int answer = 0;
int a = 0;
for (int i = 0; i < n; i++) {
if (a <= x) {
answer++;
a += L[i];
} else {
break;
... | #pragma warning(disable : 4996)
#include <stdio.h>
int main() {
int n, x;
int L[150];
scanf("%d %d", &n, &x);
for (int i = 0; i < n; i++) {
scanf("%d", &L[i]);
}
int answer = 0;
int a = 0;
for (int i = 0; i < n + 1; i++) {
if (a <= x) {
answer++;
a += L[i];
} else {
brea... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 813,932 | 813,933 | u691912637 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define faster_io \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
#define faster_io \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 813,938 | 813,939 | u080773878 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, a;
cin >> N >> X;
int L[200];
int S[200];
a = 0;
for (int i = 0; i < N + 1; i++) {
cin >> L[i];
S[0] = 0;
S[1] = L[1];
}
for (int i = 2; i < 200; i++) {
S[i] = S[i - 1] + L[i - 1];
if (S[i] <= X) {
a++;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, a;
cin >> N >> X;
int L[200];
int S[200];
a = 0;
for (int i = 0; i < N + 1; i++) {
cin >> L[i];
S[0] = 0;
S[1] = L[0];
}
for (int i = 2; i < N + 1; i++) {
S[i] = S[i - 1] + L[i - 1];
if (S[i] <= X) {
a++;
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one"
] | 813,940 | 813,941 | u190066528 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, a;
cin >> N >> X;
int L[200];
int S[200];
a = 0;
for (int i = 0; i < 200; i++) {
cin >> L[i];
S[0] = 0;
S[1] = L[1];
}
for (int i = 2; i < N + 1; i++) {
S[i] = S[i - 1] + L[i - 1];
if (S[i] <= X) {
a++;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, a;
cin >> N >> X;
int L[200];
int S[200];
a = 0;
for (int i = 0; i < N + 1; i++) {
cin >> L[i];
S[0] = 0;
S[1] = L[0];
}
for (int i = 2; i < N + 1; i++) {
S[i] = S[i - 1] + L[i - 1];
if (S[i] <= X) {
a++;
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 813,942 | 813,941 | u190066528 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int X;
cin >> N >> X;
vector<int> L;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
L.push_back(tmp);
}
int D = 0;
int count = 1;
for (int i = 0; i < N + 1; i++) {
D = D + L.at(i);
if (D > X)
break;
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int X;
cin >> N >> X;
vector<int> L;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
L.push_back(tmp);
}
int D = 0;
int count = 1;
for (int i = 0; i < N; i++) {
D = D + L.at(i);
if (D > X)
break;
count+... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 813,945 | 813,946 | u758091069 | cpp |
p03000 | // wawando's template
#include <algorithm>
#include <cctype>
#include <climits> // LLONG_MAX , LLONG_MIN , INT_MAX , INT_MIN
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime> //clock_t , clock() , CLOCKS_PER_SEC
#include <deque>
#include <fstream>
#include <functional>
#include ... | // wawando's template
#include <algorithm>
#include <cctype>
#include <climits> // LLONG_MAX , LLONG_MIN , INT_MAX , INT_MIN
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime> //clock_t , clock() , CLOCKS_PER_SEC
#include <deque>
#include <fstream>
#include <functional>
#include ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,951 | 813,952 | u109770730 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.