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 |
|---|---|---|---|---|---|---|---|
p02998 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
#define deb(x) ... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
#define deb(x) ... | [
"variable_access.subscript.index.change"
] | 810,756 | 810,757 | u556276145 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
vector<vector<int>> P(100010), P2 = P;
vector<set<ll>> A(100010);
vector<ll> parent(100010), psize(100000);
void UFinit(void) {
for (int i = 0; i < 100010; i++) {
parent[i] = i;
psize[i] = 1;
}
return;
}
int root(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
vector<vector<int>> P(100010), P2 = P;
vector<set<ll>> A(100010);
vector<ll> parent(100010), psize(100000);
void UFinit(void) {
for (int i = 0; i < 100010; i++) {
parent[i] = i;
psize[i] = 1;
}
return;
}
int root(... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 810,766 | 810,767 | u045811375 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int64_t>>;
static const int64_t MAX = 10;
static vector<bool> seen(MAX * 2, false);
pair<int64_t, int64_t> dfs(const Graph &g, int64_t v, bool isX = true) {
if (seen[v])
return {0, 0};
seen[v] = true;
pair<int64_t, int64_t> num = {0,... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int64_t>>;
static const int64_t MAX = 1e5;
static vector<bool> seen(MAX * 2, false);
pair<int64_t, int64_t> dfs(const Graph &g, int64_t v, bool isX = true) {
if (seen[v])
return {0, 0};
seen[v] = true;
pair<int64_t, int64_t> num = {0... | [
"literal.number.change",
"variable_declaration.value.change"
] | 810,772 | 810,773 | u355520191 | cpp |
p02998 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf =... | [
"identifier.change"
] | 810,789 | 810,790 | u450494974 | cpp |
p02998 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf =... | [
"identifier.change"
] | 810,791 | 810,790 | u450494974 | cpp |
p02998 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf =... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 810,792 | 810,790 | u450494974 | cpp |
p02998 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll fa[200001], ra[200001], n, a, b, ans;
map<ll, ll> mx, my;
ll find(ll x) {
if (x == fa[x])
return fa[x];
return fa[x] = find(fa[x]);
}
void uni(ll x, ll y) {
x = find(x), y = find(y);
if (x == y)
return;
if (ra[x... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll fa[200001], ra[200001], n, a, b, ans;
map<ll, ll> mx, my;
ll find(ll x) {
if (x == fa[x])
return fa[x];
return fa[x] = find(fa[x]);
}
void uni(ll x, ll y) {
x = find(x), y = find(y);
if (x == y)
return;
if (ra[x... | [
"variable_access.subscript.index.change"
] | 810,802 | 810,803 | u050428930 | cpp |
p02998 | /*
Task:F - Must Be Rectangular!
Statement: Given N points (1<=x,y<=10^5)
You can do the following operation find acute triangle
add the point to form it rectangular if that point doesn't exist yet;
Find the maximum number of operation
*/
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
int n, ... | /*
Task:F - Must Be Rectangular!
Statement: Given N points (1<=x,y<=10^5)
You can do the following operation find acute triangle
add the point to form it rectangular if that point doesn't exist yet;
Find the maximum number of operation
*/
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
int n, ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 810,815 | 810,816 | u047398677 | cpp |
p02998 | #include <algorithm>
#include <iostream>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
struct UnionFind {
private:
vector<int> data;
public:
int N;
UnionFind(int n) : data(n, -1), N(n) {}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
... | #include <algorithm>
#include <iostream>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
struct UnionFind {
private:
vector<int> data;
public:
int N;
UnionFind(int n) : data(n, -1), N(n) {}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
... | [
"expression.operation.binary.add"
] | 810,819 | 810,820 | u107077660 | cpp |
p02998 | #include <algorithm>
#include <iostream>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
struct UnionFind {
private:
vector<int> data;
public:
int N;
UnionFind(int n) : data(n, -1), N(n) {}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
... | #include <algorithm>
#include <iostream>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
struct UnionFind {
private:
vector<int> data;
public:
int N;
UnionFind(int n) : data(n, -1), N(n) {}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
... | [
"expression.operation.binary.add",
"type_conversion.add"
] | 810,821 | 810,820 | u107077660 | cpp |
p02998 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FRO... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FRO... | [] | 810,831 | 810,832 | u702582248 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
// type
typedef long long ll;
#define pii pair<int, int>
#define vi vector<int>
// x * y * 1.0 can cause overflow
// constant
#define inf (int)(1e9 + 7)
#define mod (ll)(1e9 + 7)
#define eps 1e-10
// omission
#define eb emplace_back
#define F first
#define S second
#define ... | #include <bits/stdc++.h>
using namespace std;
// type
typedef long long ll;
#define pii pair<int, int>
#define vi vector<int>
// x * y * 1.0 can cause overflow
// constant
#define inf (int)(1e9 + 7)
#define mod (ll)(1e9 + 7)
#define eps 1e-10
// omission
#define eb emplace_back
#define F first
#define S second
#define ... | [
"assignment.change"
] | 810,841 | 810,842 | u277556971 | cpp |
p02991 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
... | [
"assignment.change"
] | 810,843 | 810,844 | u892687772 | cpp |
p02991 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rrep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define dcout cout << fixed << setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<int, ... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rrep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define dcout cout << fixed << setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<int, ... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 810,847 | 810,848 | u233626335 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n * 3);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v, u--, v--;
for (int j = 0; j < 3; j++) {
g[u * 3 + j].push_back(v * 3 + (j + 1) % 3);
}
}
int s, t;
cin >> s >> t, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n * 3);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v, u--, v--;
for (int j = 0; j < 3; j++) {
g[u * 3 + j].push_back(v * 3 + (j + 1) % 3);
}
}
int s, t;
cin >> s >> t, ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 810,853 | 810,854 | u647653350 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | [] | 810,855 | 810,856 | u106297876 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
int main() {
i32 n, m;
cin >> n >> m;
vector<vector<i32>> g(n * 3);
for (i32 i = 0; i < m; i++) {
i32 u, v;
cin >> u >> v, u--, v--;
for (i32 j = 0; j < 3; j++) {
g[u * 3 + j].push_back(v * 3 + ... | #include <bits/stdc++.h>
using namespace std;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
int main() {
i32 n, m;
cin >> n >> m;
vector<vector<i32>> g(n * 3);
for (i32 i = 0; i < m; i++) {
i32 u, v;
cin >> u >> v, u--, v--;
for (i32 j = 0; j < 3; j++) {
g[u * 3 + j].push_back(v * 3 + ... | [
"expression.operation.binary.add"
] | 810,859 | 810,860 | u820225607 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n, m;
cin >> n >> m;
vector<set<ll>> v(n);
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
v[a].insert(b);
}
ll s, t;
cin >> s >> t;
s--;
t--;
vector<vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n, m;
cin >> n >> m;
vector<set<ll>> v(n);
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
v[a].insert(b);
}
ll s, t;
cin >> s >> t;
s--;
t--;
vector<vect... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 810,863 | 810,864 | u718758485 | cpp |
p02991 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) x.begin(), x.end()
#define ln '\n'
const double PI = acos(-1.0);
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<in... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) x.begin(), x.end()
#define ln '\n'
const double PI = acos(-1.0);
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<in... | [
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 810,873 | 810,874 | u842939260 | cpp |
p02991 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) x.begin(), x.end()
#define ln '\n'
const double PI = acos(-1.0);
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<in... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) x.begin(), x.end()
#define ln '\n'
const double PI = acos(-1.0);
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<in... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 810,875 | 810,874 | u842939260 | cpp |
p02991 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define ft first
#define sc second
#defi... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define ft first
#define sc second
#defi... | [
"assignment.change"
] | 810,876 | 810,877 | u619683748 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> G[300000];
ll d[300000];
const ll INF = 10000000000000000;
ll N, M;
ll S, T;
ll bfs(ll s) {
for (ll i = 0; i < 3 * N; i++) {
d[i] = INF;
}
d[s] = 0;
queue<ll> que;
que.push(s);
while (!que.empty()) {
ll v = que.front();... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> G[300000];
ll d[300000];
const ll INF = 10000000000000000;
ll N, M;
ll S, T;
ll bfs(ll s) {
for (ll i = 0; i < 3 * N; i++) {
d[i] = INF;
}
d[s] = 0;
queue<ll> que;
que.push(s);
while (!que.empty()) {
ll v = que.front();... | [
"expression.operation.binary.remove"
] | 810,892 | 810,893 | u559578080 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> G[300000];
ll d[300000];
const ll INF = 10000000000000000;
ll N, M;
ll S, T;
ll bfs(ll s) {
for (ll i = 0; i < 3 * N; i++) {
d[i] = INF;
}
d[s] = 0;
queue<ll> que;
que.push(s);
while (!que.empty()) {
ll v = que.front();... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> G[300000];
ll d[300000];
const ll INF = 10000000000000000;
ll N, M;
ll S, T;
ll bfs(ll s) {
for (ll i = 0; i < 3 * N; i++) {
d[i] = INF;
}
d[s] = 0;
queue<ll> que;
que.push(s);
while (!que.empty()) {
ll v = que.front();... | [
"control_flow.branch.if.condition.change"
] | 810,894 | 810,893 | u559578080 | cpp |
p02991 | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define ... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define ... | [] | 810,898 | 810,899 | u521723672 | cpp |
p02991 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 810,917 | 810,918 | u644332191 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
// typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP(x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
// typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP(x)... | [
"call.arguments.change",
"call.arguments.add"
] | 810,927 | 810,928 | u315078622 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef priority_queue<ll> PQ;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef priority_queue<ll> PQ;
... | [
"assignment.change"
] | 810,960 | 810,961 | u422633119 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
vector<int> d(n + 1, 0);
rep(i, n + 1) {
if (i == 0)
continue;
d[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
vector<int> d(n + 1, 0);
rep(i, n + 1) {
if (i == 0)
continue;
d[i... | [
"expression.operation.binary.add"
] | 810,967 | 810,968 | u350308906 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
vector<int> d(n, 0);
rep(i, n) {
if (i == 0)
continue;
d[i] = d[i ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
vector<int> d(n + 1, 0);
rep(i, n + 1) {
if (i == 0)
continue;
d[i... | [
"assignment.change",
"expression.operation.binary.add"
] | 810,969 | 810,968 | u350308906 | cpp |
p03000 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
#define rep(i, n) fo... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
#define rep(i, n) fo... | [
"assignment.value.change"
] | 810,972 | 810,973 | u917502362 | cpp |
p03000 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
#define rep(i, n) fo... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
#define rep(i, n) fo... | [
"assignment.value.change",
"expression.unary.arithmetic.add"
] | 810,974 | 810,973 | u917502362 | cpp |
p03000 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
#define rep(i, n) fo... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
#define rep(i, n) fo... | [
"assignment.value.change"
] | 810,975 | 810,973 | u917502362 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int d = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
d += p[i];
if (ans > x) {
cout << ans << endl;
return 0;
}
ans++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int d = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
d += p[i];
if (d > x) {
cout << ans << endl;
return 0;
}
ans++;
}
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 810,976 | 810,977 | u225777148 | cpp |
p03000 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main() {
ll a, b, i, j, n, t, m;
vl<ll> arr;
arr.pb(0);
cin >> n >> m;
ll sum = 0;
for (i = 0; i < n; i++) {
cin >> a;
sum += a;
... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main() {
ll a, b, i, j, n, t, m;
vl<ll> arr;
arr.pb(0);
cin >> n >> m;
ll sum = 0;
for (i = 0; i < n; i++) {
cin >> a;
sum += a;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 810,978 | 810,979 | u042481711 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, aaa = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int S;
cin >> S;
ans += S;
if (ans < X) {
aaa++;
}
}
cout << aaa << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, aaa = 0;
cin >> N >> X;
for (int i = 0; i < N; i++) {
int S;
cin >> S;
ans += S;
if (ans <= X) {
aaa++;
}
}
cout << aaa + 1 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,980 | 810,981 | u187772564 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 0; i < X; i++) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int count = 0;
for (int i = 0; i <= N; i++) {
if (D[i] <= X)
count++;
}
cout << coun... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
D[i + 1] = D[i] + x;
}
int count = 0;
for (int i = 0; i <= N; i++) {
if (D[i] <= X)
count++;
}
cout << coun... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 810,982 | 810,983 | u269786286 | cpp |
p03000 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> /... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> /... | [
"literal.number.change",
"variable_declaration.value.change"
] | 810,984 | 810,985 | u889915625 | cpp |
p03000 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> /... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> /... | [
"literal.number.change",
"variable_declaration.value.change"
] | 810,986 | 810,987 | u889915625 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m = MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m = MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 810,993 | 810,994 | u942850310 | 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() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L.at(i);
int sum = 0, count = 1;
for (int i = 0;; i++) {
sum += L.at(i);
if (sum <= X)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L.at(i);
int sum = 0, count = 1;
for (int i = 0; i < N; i++) {
sum += L.at(i);
if (sum ... | [
"control_flow.loop.for.condition.change"
] | 810,995 | 810,996 | u922449177 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1);
for (int i = 1; i <= n; i++) {
cin >> l[i];
}
vector<int> d(n + 2);
d[1] = 0;
int ans = 1;
for (int i = 2; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1);
for (int i = 1; i <= n; i++) {
cin >> l[i];
}
vector<int> d(n + 2);
d[1] = 0;
int ans = 1;
for (int i = 2; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,003 | 811,004 | u221391729 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 811,010 | 811,011 | u972911059 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (int)(n); i++)
int main() {
int n, x;
int ans = 1;
cin >> n >> x;
vector<int> l(n);
rep(i, n) { cin >> l.at(i); }
int total = 1;
rep(i, n) {
total += l.at(i);
if (total <= x)
ans++;
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (int)(n); i++)
int main() {
int n, x;
int ans = 1;
cin >> n >> x;
vector<int> l(n);
rep(i, n) { cin >> l.at(i); }
int total = 0;
rep(i, n) {
total += l.at(i);
if (total <= x) {
// cout << total <<... | [
"literal.number.change",
"variable_declaration.value.change"
] | 811,012 | 811,013 | u478705580 | cpp |
p03000 | #include <iostream>
using namespace std;
int const NMAX = 50;
int v[1 + NMAX];
int main() {
int n, m, sum = 0, ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> v[i];
sum += v[i];
if (m <= sum) {
ans++;
}
}
cout << ans;
return 0;
}
| #include <iostream>
using namespace std;
int const NMAX = 50;
int v[1 + NMAX];
int main() {
int n, m, sum = 0, ans = 1;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> v[i];
sum += v[i];
if (m >= sum) {
ans++;
}
}
cout << ans;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,014 | 811,015 | u529371621 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n), sum(n + 1, 0);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
for (int i = 1; i < n + 1; ++i) {
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n), sum(n + 1, 0);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
for (int i = 1; i < n + 1; ++i) {
... | [
"expression.operation.binary.add"
] | 811,020 | 811,021 | u141567616 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int t = 0;
int cnt = 0;
for (int i = 0; i < a; i++) {
int tmp = 0;
cin >> tmp;
if (t + tmp <= b)
cnt++... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int t = 0;
int cnt = 1;
for (int i = 0; i < a; i++) {
int tmp = 0;
cin >> tmp;
if (t + tmp <= b)
cnt++... | [
"literal.number.change",
"variable_declaration.value.change"
] | 811,037 | 811,038 | u127741845 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 D = 0;
while (ans < N) {
D += L[ans - 1];
if (D > X)
break;
ans++;
}
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 D = 0;
while (ans <= N) {
D += L[ans - 1];
if (D > X)
break;
ans++;
}
cout << ans << endl;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 811,045 | 811,046 | u084069244 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 D = 0;
while (ans <= N + 1) {
D += L[ans - 1];
if (D > X)
break;
ans++;
}
cout << ans << end... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 D = 0;
while (ans <= N) {
D += L[ans - 1];
if (D > X)
break;
ans++;
}
cout << ans << endl;
... | [
"expression.operation.binary.remove"
] | 811,047 | 811,046 | u084069244 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 D = 0;
while (ans < N) {
D += L[ans];
if (D > X)
break;
ans++;
}
cout << ans << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 D = 0;
while (ans <= N) {
D += L[ans - 1];
if (D > X)
break;
ans++;
}
cout << ans << endl;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.change"
] | 811,048 | 811,046 | u084069244 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int a = 0;
for (int i = 0; i < N; i++) {
a += vec.at(i);
}
if (a < X)
cout << N + 1 << endl;
else {
int z = 0;
int count = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int a = 0;
for (int i = 0; i < N; i++) {
a += vec.at(i);
}
if (a <= X)
cout << N + 1 << endl;
else {
int z = 0;
int count = 0;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,049 | 811,050 | u516876944 | cpp |
p03000 | /*
* zyrch - Rupanshu Yadav
*/
#ifdef CREED
#include "creed.h"
#else
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#... | /*
* zyrch - Rupanshu Yadav
*/
#ifdef CREED
#include "creed.h"
#else
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,051 | 811,052 | u175695110 | cpp |
p03000 | // Made by Luis Miguel Baez
// es.luismiguelbaez@gmail.com
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n, k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull uns... | // Made by Luis Miguel Baez
// es.luismiguelbaez@gmail.com
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n, k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull uns... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,056 | 811,057 | u192061265 | cpp |
p03000 | /******************************************************************************
рассвет.
*******************************************************************************/
#include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define rapgame ... | /******************************************************************************
рассвет.
*******************************************************************************/
#include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define rapgame ... | [
"identifier.change",
"call.function.change"
] | 811,060 | 811,061 | u229098121 | cpp |
p03000 | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <unistd.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
#define vecin(a) rep(i, a.size()) cin >> a[i]
#define vecout(a) rep(i, a.size()) cout << a[i] << " "
using ll = long long;
using ld = lo... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <unistd.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
#define vecin(a) rep(i, a.size()) cin >> a[i]
#define vecout(a) rep(i, a.size()) cout << a[i] << " "
using ll = long long;
using ld = lo... | [
"expression.operation.binary.add"
] | 811,066 | 811,067 | u527652459 | cpp |
p03000 | #include <bits/stdc++.h>
#define DEBUG
using namespace std;
template <class T> void print_vect(std::vector<T> v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
void solve() {
uint32_t N, X;
cin >> N >> X;
std::vector<uint32_t> L;
L.reserve(N);
for (uint32_t i = 0; i < N;... | #include <bits/stdc++.h>
//#define DEBUG
using namespace std;
template <class T> void print_vect(std::vector<T> v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
void solve() {
uint32_t N, X;
cin >> N >> X;
std::vector<uint32_t> L;
L.reserve(N);
for (uint32_t i = 0; i < ... | [] | 811,074 | 811,075 | u161190523 | 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 i = 1;
int D = 0;
while (D <= X && i <= N) {
D += L.at(i - 1);
i++;
}
cout << i - 1 << endl;
} | #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 + 1; i++) {
cin >> L.at(i);
}
int i = 1;
int D = 0;
while (D <= X && i <= N + 1) {
D += L.at(i - 1);
i++;
}
cout << i - 1 << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.condition.change"
] | 811,092 | 811,093 | u187393226 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x, cnt = 1;
cin >> n >> x;
vector<int> l(n + 1), d(n + 1);
l[0] = 0;
d[0] = 0;
d[1] = 0;
for (int i = 1; i <= n; i++)
cin >> l[i];
for ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x, cnt = 1;
cin >> n >> x;
vector<int> l(n + 1), d(n + 2);
l[0] = 0;
d[0] = 0;
d[1] = 0;
for (int i = 1; i <= n; i++)
cin >> l[i];
for ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,099 | 811,100 | u681323954 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x, cnt = 1;
cin >> n >> x;
vector<int> l(n + 1), d(n + 1);
l[0] = 0;
d[0] = 0;
d[1] = 0;
for (int i = 1; i <= n; i++)
cin >> l[i];
for ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x, cnt = 1;
cin >> n >> x;
vector<int> l(n + 1), d(n + 2);
l[0] = 0;
d[0] = 0;
d[1] = 0;
for (int i = 1; i <= n; i++)
cin >> l[i];
for ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.else.remove"
] | 811,101 | 811,100 | u681323954 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#de... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#de... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 811,104 | 811,105 | u444645674 | cpp |
p03000 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, x, a, ans = 0;
cin >> n >> x;
int d[n + 1];
d[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a;
d[i + 1] = d[i] + a;
}
for (int i = 0; i < n; i++) {
if (d[i] <= x)
ans++;
else
break;
}
cout ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, x, a, ans = 0;
cin >> n >> x;
int d[n + 1];
d[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a;
d[i + 1] = d[i] + a;
}
for (int i = 0; i <= n; i++) {
if (d[i] <= x)
ans++;
else
break;
}
cout... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,115 | 811,116 | u205280593 | cpp |
p03000 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll n, x;
cin >> n >> x;
ll l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
ll s = 0;
ll c = 1;
for (int i = 0; i < n; i++) {
if (s + l[i] <= x) {
c++;
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll n, x;
cin >> n >> x;
ll l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
ll s = 0;
ll c = 1;
for (int i = 0; i < n; i++) {
if (s + l[i] <= x) {
c++;
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 811,139 | 811,140 | u016987091 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,141 | 811,142 | u931173291 | cpp |
p03000 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 811,143 | 811,142 | u931173291 | cpp |
p03000 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, x;
scanf("%d %d", &n, &x);
long long int a[200];
for (int i = 1; i < n + 1; i++) {
scanf("%lld", &a[i]);
}
long long int sum = 0;
for (int i = 1; i < n + 1; i++) {
sum += a[i];
if (sum > x) {
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, x;
scanf("%d %d", &n, &x);
long long int a[200];
for (int i = 1; i < n + 1; i++) {
scanf("%lld", &a[i]);
}
long long int sum = 0;
for (int i = 1; i < n + 1; i++) {
sum += a[i];
if (sum > x) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,149 | 811,150 | u018679195 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pii = pair<int, int>;
template <class T> using v = vector<T>;
template <class T> using vv = v<v<T>>;
#define ALL(c) (c).begin(), (c).end()
int main() {
int N, X;
cin >> N >> X;
v<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pii = pair<int, int>;
template <class T> using v = vector<T>;
template <class T> using vv = v<v<T>>;
#define ALL(c) (c).begin(), (c).end()
int main() {
int N, X;
cin >> N >> X;
v<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 811,153 | 811,154 | u779618803 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("abc130/abc130_b.txt"); ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("abc130/abc130_b.txt"); ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 811,160 | 811,161 | u513083943 | cpp |
p03000 | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int n, m;
cin >> n >> m;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++) {
v[i] ... | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int n, m;
cin >> n >> m;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++) {
v[i] ... | [
"expression.operation.binary.add"
] | 811,192 | 811,193 | u526278960 | cpp |
p03000 | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int n, m;
cin >> n >> m;
int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++) {
v[i] = v[... | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int n, m;
cin >> n >> m;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++) {
v[i] ... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 811,194 | 811,193 | u526278960 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int total = 0;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> L;
total += L;
count += 1;
if (total <= X) {
continue;
} else {
break;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int total = 0;
int count = 0;
for (int i = 0; i < N + 1; i++) {
cin >> L;
total += L;
count += 1;
if (total <= X) {
continue;
} else {
break;
}
}
cout << count << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,201 | 811,202 | u163072432 | cpp |
p03000 | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;... | [
"expression.operation.binary.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 811,208 | 811,209 | u570601094 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i, a[1000], s = 0, c = 0;
cin >> n >> x;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 1; i <= n + 1; i++) {
if (s >= x)
c++;
s += a[i - 1];
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i, a[1000], s = 0, c = 0;
cin >> n >> x;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 1; i <= n + 1; i++) {
if (s <= x)
c++;
s += a[i - 1];
}
cout << c << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,218 | 811,219 | u317830102 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, count = 0;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
vector<long long> D(N + 1);
for (int i = 1; i < N + 1; i++) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
}
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, count = 0;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
vector<long long> D(N + 1);
for (int i = 1; i < N + 1; i++) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
}
for (int i = 0; i < N + 1; i++)... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,220 | 811,221 | u280966279 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, count = 0;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
vector<int> D(N + 1);
for (int i = 1; i < N + 1; i++) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
}
for (int i = 0; i < N; i++) {
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, count = 0;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
vector<long long> D(N + 1);
for (int i = 1; i < N + 1; i++) {
D.at(i) = D.at(i - 1) + L.at(i - 1);
}
for (int i = 0; i < N + 1; i++)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,222 | 811,221 | u280966279 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
rep(i, N) {
int x;
cin >> x; // L[i]
D[i + 1] = ... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D[0] = 0;
rep(i, N) {
int x;
cin >> x; // L[i]
D[i + 1] = ... | [
"expression.operation.binary.add"
] | 811,225 | 811,226 | u437633151 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x;
cin >> n >> x;
int ans = 1;
int p = 0;
rep(i, n) {
int l;
cin >> l;
p += l;
if (p > n)
break;
ans++;
}
cout << ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, x;
cin >> n >> x;
int ans = 1;
int p = 0;
rep(i, n) {
int l;
cin >> l;
p += l;
if (p > x)
break;
ans++;
}
cout << ans... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 811,229 | 811,230 | u005006157 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L.at(i);
vector<int> D(n);
D.at(0) = 0;
rep(i, n - 1) { D.at(i + 1) = D.at(i) + L.at(i); }
int count = 0;
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L.at(i);
vector<int> D(n + 1);
D.at(0) = 0;
rep(i, n) { D.at(i + 1) = D.at(i) + L.at(i); }
int count = 0;
rep(... | [
"expression.operation.binary.remove"
] | 811,234 | 811,235 | u028862479 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N >> x;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int d = 0, num = 1;
for (int i = 1; i < N + 1; i++) {
d = d - a[i - 1];
if (d <= x) {
num++;
}
}
cout << num << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N >> x;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int d = 0, num = 1;
for (int i = 1; i < N + 1; i++) {
d = d + a[i - 1];
if (d <= x) {
num++;
}
}
cout << num << endl;
return 0;
}... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 811,245 | 811,246 | u438189153 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first ... | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 811,247 | 811,248 | u506464494 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int n, x;
cin >> n >> x;
vector<int> c(n);
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int ans = 1;
int k = 0;
for (int i = 0; i < n; ++i) {
k += c[i];
if (k <= c[i])
++ans;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int n, x;
cin >> n >> x;
vector<int> c(n);
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
int ans = 1;
int k = 0;
for (int i = 0; i < n; ++i) {
k += c[i];
if (k <= x)
++ans;
}
co... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 811,249 | 811,250 | u321280590 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L.at(0) = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.at(i + 1) = L.at(i) + x;
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (L.at(i) <= X) {
ans++;
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> D(N + 1);
D.at(0) = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
D.at(i + 1) = D.at(i) + x;
}
int ans = 0;
for (int i = 0; i <= N; i++) {
if (D.at(i) <= X) {
ans++;
}
}
cout... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 811,253 | 811,254 | u856957535 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L.at(0) = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.at(i + 1) = L.at(i) + x;
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (L.at(i) <= X) {
ans++;
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L.at(0) = 0;
for (int i = 0; i < N; i++) {
int x = 0;
cin >> x;
L.at(i + 1) = L.at(i) + x;
}
int ans = 0;
for (int i = 0; i <= N; i++) {
if (L.at(i) <= X) {
ans++;
}
}
... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,253 | 811,255 | u856957535 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1);
l.at(0) = 0;
for (int i = 0; i < n; i++) {
int y = 0;
cin >> y;
l.at(i + 1) = l.at(i) + y;
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (l.at(i) < x) {
ans++;
}
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1);
l.at(0) = 0;
for (int i = 0; i < n; i++) {
int y = 0;
cin >> y;
l.at(i + 1) = l.at(i) + y;
}
int ans = 0;
for (int i = 0; i <= n; i++) {
if (l.at(i) <= x) {
ans++;
}
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 811,256 | 811,257 | u856957535 | cpp |
p03000 | /*
author : nishi5451
created : 15.08.2020 10:42:10
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
for (int i = 1; i <= n; i++) {
int l;
cin >> l;
if (now + l > x) ... | /*
author : nishi5451
created : 15.08.2020 10:42:10
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
int now = 0;
for (int i = 1; i <= n; i++) {
int l;
cin >> l;
if (now + l > x) ... | [
"expression.operation.binary.add"
] | 811,262 | 811,263 | u033937898 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L[i];
int count = 0;
int sum = 0;
while (x >= sum) {
if (count < n) {
sum += L[cou... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L[i];
int count = 0;
int sum = 0;
while (x >= sum) {
if (count < n) {
sum += L[cou... | [
"expression.unary.arithmetic.add"
] | 811,264 | 811,265 | u999788719 | cpp |
p03000 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [
"expression.operation.binary.add"
] | 811,270 | 811,271 | u179778090 | cpp |
p03000 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L[i];
int s = 0;
int t = 1;
rep(i, n) {
s += L[i];
if (s > x) {
cout << t <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
rep(i, n) cin >> L[i];
int s = 0;
int t = 1;
rep(i, n) {
s += L[i];
if (s > x) {
cout << t <<... | [
"expression.operation.binary.remove"
] | 811,276 | 811,277 | u210234656 | cpp |
p03000 | long long A, B, C, D, E, F, I, J, K, M, N, O, Q, R, S, T, U, V, X, Y, Z;
// long long A,B,C,D,E,F, H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z;
double dA, dB, dC, dD, dE, dF, dI, dJ, dK, dM, dN, dO, dP, dQ, dR, dS, dT, dU,
dV, dX, dY, dZ;
#include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ... | long long A, B, C, D, E, F, I, J, K, M, N, O, Q, R, S, T, U, V, X, Y, Z;
// long long A,B,C,D,E,F, H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z;
double dA, dB, dC, dD, dE, dF, dI, dJ, dK, dM, dN, dO, dP, dQ, dR, dS, dT, dU,
dV, dX, dY, dZ;
#include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ... | [
"expression.operation.binary.add"
] | 811,278 | 811,279 | u069521477 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int total = 0;
int count = 0;
int L;
while (total <= X) {
cin >> L;
total = total + L;
count++;
}
if (count > N) {
cout << N << endl;
return 0;
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int total = 0;
int count = 0;
int L;
while (total <= X) {
cin >> L;
total = total + L;
count++;
}
if (count > N + 1) {
cout << N + 1 << endl;
return 0;
}
cout << count << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 811,282 | 811,283 | u469315559 | cpp |
p03000 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | [
"call.arguments.add"
] | 811,284 | 811,285 | u700484101 | cpp |
p03000 | #include <bits/stdc++.h>
#define FOR(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define FORe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define rFOR(i, a, n) for (int(i) = (int)(n)-1; (i) >= (int)(a); --(i))
#define rFORe(i, a, n) for (int(i) = (int)(n); (i) >= (int)(a); --(i))
#define REP(i,... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define FORe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define rFOR(i, a, n) for (int(i) = (int)(n)-1; (i) >= (int)(a); --(i))
#define rFORe(i, a, n) for (int(i) = (int)(n); (i) >= (int)(a); --(i))
#define REP(i,... | [
"assignment.change",
"expression.operation.binary.add"
] | 811,290 | 811,291 | u809589926 | cpp |
p03000 | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
// vector<vector<ll>> piyo(tate,vector<ll> (yoko));
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1000000000
#define ll long long
#define ln cout << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define double long double
#define REP... | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
// vector<vector<ll>> piyo(tate,vector<ll> (yoko));
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1000000000
#define ll long long
#define ln cout << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define double long double
#define REP... | [
"assignment.change",
"expression.operation.binary.add"
] | 811,292 | 811,293 | u683769494 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
ll d[200];
d[0] = 0;
int l[200];
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
int cnt = 1;
for (int i = 1; i < n; ++i) {
d[i] = d[i - 1] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
ll d[200];
d[0] = 0;
int l[200];
for (int i = 1; i <= n; ++i) {
cin >> l[i];
}
int cnt = 1;
for (int i = 1; i <= n; ++i) {
d[i] = d[i - 1... | [
"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"
] | 811,296 | 811,297 | u671257784 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
long long count = 1;
long long d = 0;
for (int i = 1; i < n + 2; i++) {
long long tmp = d + a[i - 1];
d = tmp;
if (d <= x)
count++;
else... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
long long count = 1;
long long d = 0;
for (int i = 1; i < n + 1; i++) {
long long tmp = d + a[i - 1];
d = tmp;
if (d <= x) {
count++;
} ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 811,300 | 811,301 | u406647332 | 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, i, f, ans;
ans = 0;
f = 0;
for (i = 2; i <= n; i++) {
d = f + l[i - 1];
if (x >= d) {
f = d;
ans++;
} else {
break;
... | #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, i, f, ans;
ans = 0;
f = 0;
for (i = 2; i <= n + 1; i++) {
d = f + l[i - 1];
if (x >= d) {
f = d;
ans++;
} else {
break... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 811,302 | 811,303 | u074488832 | 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, i, f, ans;
ans = 0;
f = 0;
for (i = 2; i <= n; i++) {
d = f + l[i - 1];
if (x >= d) {
f = d;
ans++;
} else {
break;
... | #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, i, f, ans;
ans = 0;
f = 0;
for (i = 2; i <= n + 1; i++) {
d = f + l[i - 1];
if (x >= d) {
f = d;
ans++;
} else {
break... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 811,304 | 811,303 | u074488832 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int N, X;
cin >> N >> X;
int ans = 1;
int d = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (d <= X) {
ans++;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int N, X;
cin >> N >> X;
int ans = 1;
int d = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (d + a <= X) {
ans... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 811,305 | 811,306 | u342075214 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int count = 1;
int sum = 0;
for (int i = 0; i < a; i++) {
int c;
cin >> c;
sum += c;
if (b <= sum) {
break;
}
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int count = 1;
int sum = 0;
for (int i = 0; i < a; i++) {
int c;
cin >> c;
sum += c;
if (b < sum) {
break;
}
count++;
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,317 | 811,318 | u613960672 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"expression.operation.binary.add"
] | 811,324 | 811,325 | u809967037 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
const long long MOD = 1e9 +... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
const long long MOD = 1e9 +... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 811,326 | 811,327 | u809967037 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) { cin >> L.at(i); }
int D = 0;
int cnt = 0;
while (D <= X) {
if (cnt == N)
break;
D += L.at(cnt);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) { cin >> L.at(i); }
int D = 0;
int cnt = 0;
while (D <= X) {
if (cnt == N) {
cnt++;
break;
}
... | [
"expression.unary.arithmetic.add"
] | 811,328 | 811,329 | u978308810 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.