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) \
each( \
x.begin(), x.end(), (int &y) { cout << y << " "; })
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool mini(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define y0 y3487465 // j0
#define y1 y1347829 // j1
#define INF2 4000000000000000037
#define INF 1000000007
#define PI (acos(-1))
#define MOD 1000000007
#define EPS 1e(-9);
using namespace std;
typedef long long ll;
struct UnionFind {
vector<int> par; // 親ノード
vector<int> rank; // ランク
UnionFind(int n) { //初期化
par.resize(n);
rank.resize(n);
rep(i, n) { par[i] = i, rank[i] = 0; }
}
int root(int x) { //ノードの根を返す
if (par[x] == x)
return x; //親が自分なら自分を返す
else {
int r = root(par[x]); //根まで遡りながら経路圧縮
return par[x] = r;
}
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x; //ランクの小さい方に接続
return true;
}
};
ll xx[200000], yy[200000]; // parent
void Main() {
int N;
cin >> N;
UnionFind uf(200000);
rep(i, N) {
int x, y;
cin >> x >> y;
uf.merge(x - 1, 100000 + y - 1);
}
rep(i, 200000) {
if (i < 100000)
++xx[uf.par[i]];
else
++yy[uf.par[i]];
}
ll ans = 0;
rep(i, 200000) {
if (xx[i] >= 2 and yy[i] >= 2)
ans += xx[i] * yy[i];
else
ans += max(0LL, xx[i] + yy[i] - 1);
}
ans -= N;
cout << ans << "\n";
}
//-----------------------------------
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
//-----------------------------------
| #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) \
each( \
x.begin(), x.end(), (int &y) { cout << y << " "; })
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool mini(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define y0 y3487465 // j0
#define y1 y1347829 // j1
#define INF2 4000000000000000037
#define INF 1000000007
#define PI (acos(-1))
#define MOD 1000000007
#define EPS 1e(-9);
using namespace std;
typedef long long ll;
struct UnionFind {
vector<int> par; // 親ノード
vector<int> rank; // ランク
UnionFind(int n) { //初期化
par.resize(n);
rank.resize(n);
rep(i, n) { par[i] = i, rank[i] = 0; }
}
int root(int x) { //ノードの根を返す
if (par[x] == x)
return x; //親が自分なら自分を返す
else {
int r = root(par[x]); //根まで遡りながら経路圧縮
return par[x] = r;
}
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x; //ランクの小さい方に接続
return true;
}
};
ll xx[200000], yy[200000]; // parent
void Main() {
int N;
cin >> N;
UnionFind uf(200000);
rep(i, N) {
int x, y;
cin >> x >> y;
uf.merge(x - 1, 100000 + y - 1);
}
rep(i, 200000) {
if (i < 100000)
++xx[uf.root(i)];
else
++yy[uf.root(i)];
}
ll ans = 0;
rep(i, 200000) {
if (xx[i] >= 2 and yy[i] >= 2)
ans += xx[i] * yy[i];
else
ans += max(0LL, xx[i] + yy[i] - 1);
}
ans -= N;
cout << ans << "\n";
}
//-----------------------------------
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
//-----------------------------------
| [
"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(int x) {
if (parent[x] == x)
return x;
return parent[x] = root(parent[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
parent[y] = parent[x];
psize[x] += psize[y];
psize[y] = 0;
}
int main() {
UFinit();
int N, x, y, vs;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x >> y;
P[y].push_back(x);
P2[x].push_back(y);
}
for (int i = 0; i < 100010; i++) {
vs = P[i].size();
if (vs == 0)
continue;
for (int j = 1; j < vs; j++) {
unite(P[i][0], P[i][j]);
}
}
for (int i = 0; i < 100010; i++) {
x = root(i);
for (int j : P2[x]) {
A[x].insert(j);
}
}
ll ans = 0;
for (int i = 0; i < 100010; i++) {
ans += psize[i] * A[i].size();
// cout << i << " " << psize[i] << " " << A[i].size() << endl;
}
cout << ans - N << endl;
} | #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(int x) {
if (parent[x] == x)
return x;
return parent[x] = root(parent[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
parent[y] = parent[x];
psize[x] += psize[y];
psize[y] = 0;
}
int main() {
UFinit();
int N, x, y, vs;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x >> y;
P[y].push_back(x);
P2[x].push_back(y);
}
for (int i = 0; i < 100010; i++) {
vs = P[i].size();
if (vs == 0)
continue;
for (int j = 1; j < vs; j++) {
unite(P[i][0], P[i][j]);
}
}
for (int i = 0; i < 100010; i++) {
x = root(i);
for (int j : P2[i]) {
A[x].insert(j);
// cout << x << " " << j << endl;
}
}
ll ans = 0;
for (int i = 0; i < 100010; i++) {
ans += psize[i] * A[i].size();
// cout << i << " " << psize[i] << " " << A[i].size() << endl;
}
cout << ans - N << endl;
} | [
"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, 0};
if (isX)
num.first++;
else
num.second++;
for (int64_t next_v : g[v]) {
pair<int64_t, int64_t> child = dfs(g, next_v, !isX);
num.first += child.first;
num.second += child.second;
}
return num;
}
int main() {
int64_t n;
cin >> n;
Graph g(MAX * 2);
for (int64_t i = 0; i < n; i++) {
int64_t x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y + MAX);
g[y + MAX].push_back(x);
}
int64_t ans = 0;
for (int64_t i = 0; i < MAX; i++) {
pair<int64_t, int64_t> num = dfs(g, i);
ans += num.first * num.second;
}
ans -= n;
cout << ans << endl;
return 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, 0};
if (isX)
num.first++;
else
num.second++;
for (int64_t next_v : g[v]) {
pair<int64_t, int64_t> child = dfs(g, next_v, !isX);
num.first += child.first;
num.second += child.second;
}
return num;
}
int main() {
int64_t n;
cin >> n;
Graph g(MAX * 2);
for (int64_t i = 0; i < n; i++) {
int64_t x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y + MAX);
g[y + MAX].push_back(x);
}
int64_t ans = 0;
for (int64_t i = 0; i < MAX; i++) {
pair<int64_t, int64_t> num = dfs(g, i);
ans += num.first * num.second;
}
ans -= n;
cout << ans << endl;
return 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 = 1LL << 60;
int n;
pi p[100000];
bool saw[100000];
vector<int> x[100000], y[100000];
queue<int> que;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i].first >> p[i].second;
p[i].first--;
p[i].second--;
x[p[i].first].push_back(i);
x[p[i].second].push_back(i);
}
ll ans = 0;
rep(i, n) {
if (saw[i])
continue;
que.push(i);
saw[i] = true;
set<int> sx, sy;
ll sum = 1;
while (!que.empty()) {
int q = que.front();
que.pop();
sx.insert(p[q].first);
sy.insert(p[q].second);
for (int j : x[p[q].first]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
for (int j : y[p[q].second]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
}
ans += (ll)sx.size() * (ll)sy.size() - sum;
}
cout << ans << endl;
} | #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 = 1LL << 60;
int n;
pi p[100000];
bool saw[100000];
vector<int> x[100000], y[100000];
queue<int> que;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i].first >> p[i].second;
p[i].first--;
p[i].second--;
x[p[i].first].push_back(i);
y[p[i].second].push_back(i);
}
ll ans = 0;
rep(i, n) {
if (saw[i])
continue;
que.push(i);
saw[i] = true;
set<int> sx, sy;
ll sum = 1;
while (!que.empty()) {
int q = que.front();
que.pop();
sx.insert(p[q].first);
sy.insert(p[q].second);
for (int j : x[p[q].first]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
for (int j : y[p[q].second]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
}
ans += (ll)sx.size() * (ll)sy.size() - sum;
}
cout << ans << endl;
} | [
"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 = 1LL << 60;
int n;
pi p[100000];
bool saw[100000];
vector<int> x[100000], y[100000];
queue<int> que;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i].first >> p[i].second;
p[i].first--;
p[i].second--;
x[p[i].first].push_back(i);
x[p[i].second].push_back(i);
}
ll ans = 0;
rep(i, n) {
if (saw[i])
continue;
que.push(i);
saw[i] = true;
set<int> sx, sy;
ll sum = 1;
while (!que.empty()) {
int q = que.front();
que.pop();
sx.insert(p[q].first);
sy.insert(p[q].second);
for (int j : x[p[q].first]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
for (int j : y[p[q].second]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
}
ans += sx.size() * (ll)sy.size() - sum;
}
cout << ans << endl;
} | #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 = 1LL << 60;
int n;
pi p[100000];
bool saw[100000];
vector<int> x[100000], y[100000];
queue<int> que;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i].first >> p[i].second;
p[i].first--;
p[i].second--;
x[p[i].first].push_back(i);
y[p[i].second].push_back(i);
}
ll ans = 0;
rep(i, n) {
if (saw[i])
continue;
que.push(i);
saw[i] = true;
set<int> sx, sy;
ll sum = 1;
while (!que.empty()) {
int q = que.front();
que.pop();
sx.insert(p[q].first);
sy.insert(p[q].second);
for (int j : x[p[q].first]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
for (int j : y[p[q].second]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
}
ans += (ll)sx.size() * (ll)sy.size() - sum;
}
cout << ans << endl;
} | [
"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 = 1LL << 60;
int n;
pi p[100000];
bool saw[100000];
vector<int> x[100000], y[100000];
queue<int> que;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i].first >> p[i].second;
p[i].first--;
p[i].second--;
x[p[i].first].push_back(i);
x[p[i].second].push_back(i);
}
ll ans = 0;
rep(i, n) {
if (saw[i])
continue;
que.push(i);
saw[i] = true;
set<int> sx, sy;
ll sum = 1;
while (!que.empty()) {
int q = que.front();
que.pop();
sx.insert(p[q].first);
sy.insert(p[q].second);
for (int j : x[p[q].first]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
for (int j : y[p[q].first]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
}
ans += sx.size() * (ll)sy.size() - sum;
}
cout << ans << endl;
} | #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 = 1LL << 60;
int n;
pi p[100000];
bool saw[100000];
vector<int> x[100000], y[100000];
queue<int> que;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i].first >> p[i].second;
p[i].first--;
p[i].second--;
x[p[i].first].push_back(i);
y[p[i].second].push_back(i);
}
ll ans = 0;
rep(i, n) {
if (saw[i])
continue;
que.push(i);
saw[i] = true;
set<int> sx, sy;
ll sum = 1;
while (!que.empty()) {
int q = que.front();
que.pop();
sx.insert(p[q].first);
sy.insert(p[q].second);
for (int j : x[p[q].first]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
for (int j : y[p[q].second]) {
if (saw[j])
continue;
saw[j] = true;
que.push(j);
sum++;
}
}
ans += (ll)sx.size() * (ll)sy.size() - sum;
}
cout << ans << endl;
} | [
"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] < ra[y])
swap(x, y);
fa[y] = x;
if (ra[x] == ra[y])
ra[x]++;
}
int main(void) {
cin >> n;
for (int i = 0; i < 200001; i++)
fa[i] = i;
for (int i = 0; i < n; i++) {
cin >> a >> b;
uni(a, b + 100000);
}
for (int i = 1; i <= 100000; i++)
mx[fa[i]]++;
for (int i = 100001; i <= 200000; i++)
my[fa[i]]++;
for (int i = 1; i <= 100000; i++)
ans += mx[i] * my[i];
cout << ans - n << endl;
}
| #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] < ra[y])
swap(x, y);
fa[y] = x;
if (ra[x] == ra[y])
ra[x]++;
}
int main(void) {
cin >> n;
for (int i = 0; i < 200001; i++)
fa[i] = i;
for (int i = 0; i < n; i++) {
cin >> a >> b;
uni(a, b + 100000);
}
for (int i = 1; i <= 100000; i++)
mx[find(i)]++;
for (int i = 100001; i <= 200000; i++)
my[find(i)]++;
for (int i = 1; i <= 100000; i++)
ans += mx[i] * my[i];
cout << ans - n << endl;
}
| [
"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, u, v, vis[maxn], x, y;
vector<int> a[maxn];
void dfs(int nod, int dis) {
vis[nod] = true;
if (dis & 1)
x++;
else
y++;
for (auto i : a[nod]) {
if (!vis[i]) {
dfs(i, dis + 1);
}
}
return;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &u, &v);
v += (n);
a[u].push_back(v);
a[v].push_back(u);
}
long long ans = 0;
for (int i = 1; i <= 200010; i++) {
if (!vis[i]) {
x = 0, y = 0;
dfs(i, 0);
ans += (1LL * x * y);
}
}
printf("%lld\n", ans - n);
}
/*
6
1 1
1 2
1 3
2 2
2 3
2 4
*/
| /*
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, u, v, vis[maxn], x, y;
vector<int> a[maxn];
void dfs(int nod, int dis) {
vis[nod] = true;
if (dis & 1)
x++;
else
y++;
for (auto i : a[nod]) {
if (!vis[i]) {
dfs(i, dis + 1);
}
}
return;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &u, &v);
v += (100000);
a[u].push_back(v);
a[v].push_back(u);
}
long long ans = 0;
for (int i = 1; i <= 200010; i++) {
if (!vis[i]) {
x = 0, y = 0;
dfs(i, 0);
ans += (1LL * x * y);
}
}
printf("%lld\n", ans - n);
}
/*
6
1 1
1 2
1 3
2 2
2 3
2 4
*/
| [
"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)
return false;
--N;
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
return x != y;
}
bool same(int x, int y) { return find(x) == find(y); }
int find(int x) {
if (data[x] < 0)
return x;
return data[x] = find(data[x]);
}
int size(int x) { return -data[find(x)]; }
};
int main() {
int N, M = 1e5 + 1;
cin >> N;
vector<pair<int, int>> P;
// vector<int> X(M,0), Y(M,0);
set<int> XX, YY;
UnionFind uf(2 * M);
for (int i = 0; i < N; ++i) {
int x, y;
cin >> x >> y;
P.emplace_back(x, y);
// ++X[x];
// ++Y[y];
uf.unite(x, y + M);
XX.insert(x);
YY.insert(y);
}
vector<int> X(2 * M, 0), Y(2 * M, 0);
for (auto x : XX)
++X[uf.find(x)];
for (auto y : YY)
++Y[uf.find(y)];
long long ans = -N;
for (int i = 0; i < 2 * M; ++i) {
ans += (long long)X[i] * Y[i];
}
cout << ans << endl;
}
| #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)
return false;
--N;
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
return x != y;
}
bool same(int x, int y) { return find(x) == find(y); }
int find(int x) {
if (data[x] < 0)
return x;
return data[x] = find(data[x]);
}
int size(int x) { return -data[find(x)]; }
};
int main() {
int N, M = 1e5 + 1;
cin >> N;
vector<pair<int, int>> P;
set<int> XX, YY;
UnionFind uf(2 * M);
for (int i = 0; i < N; ++i) {
int x, y;
cin >> x >> y;
P.emplace_back(x, y);
uf.unite(x, y + M);
XX.insert(x);
YY.insert(y);
}
vector<int> X(2 * M, 0), Y(2 * M, 0);
for (auto x : XX)
++X[uf.find(x)];
for (auto y : YY)
++Y[uf.find(y + M)];
long long ans = -N;
for (int i = 0; i < 2 * M; ++i) {
ans += (long long)X[i] * Y[i];
}
cout << ans << endl;
}
| [
"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)
return false;
--N;
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
return x != y;
}
bool same(int x, int y) { return find(x) == find(y); }
int find(int x) {
if (data[x] < 0)
return x;
return data[x] = find(data[x]);
}
int size(int x) { return -data[find(x)]; }
};
int main() {
int N, M = 1e5 + 1;
cin >> N;
vector<pair<int, int>> P;
// vector<int> X(M,0), Y(M,0);
set<int> XX, YY;
UnionFind uf(2 * M);
for (int i = 0; i < N; ++i) {
int x, y;
cin >> x >> y;
P.emplace_back(x, y);
// ++X[x];
// ++Y[y];
uf.unite(x, y + M);
XX.insert(x);
YY.insert(y);
}
// sort(P.begin(), P.end());
// long long ans = 0;
// for(int i = 0; i < N; ++i){
// int x, y;
// tie(x,y) = P[i];
// ans += (X[x]-1)*(Y[y]-1);
// }
vector<int> X(2 * M, 0), Y(2 * M, 0);
for (auto x : XX)
++X[uf.find(x)];
for (auto y : YY)
++Y[uf.find(y)];
// for(auto p : P){
// int x, y;
// tie(x,y) = p;
// ++X[uf.find(x)];
// ++Y[uf.find(y+M)];
// cerr << x << " " << y << " " << uf.find(x) << endl;
// }
long long ans = -N;
for (int i = 0; i < 2 * M; ++i) {
ans += X[i] * Y[i];
}
cout << ans << endl;
}
| #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)
return false;
--N;
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
return x != y;
}
bool same(int x, int y) { return find(x) == find(y); }
int find(int x) {
if (data[x] < 0)
return x;
return data[x] = find(data[x]);
}
int size(int x) { return -data[find(x)]; }
};
int main() {
int N, M = 1e5 + 1;
cin >> N;
vector<pair<int, int>> P;
set<int> XX, YY;
UnionFind uf(2 * M);
for (int i = 0; i < N; ++i) {
int x, y;
cin >> x >> y;
P.emplace_back(x, y);
uf.unite(x, y + M);
XX.insert(x);
YY.insert(y);
}
vector<int> X(2 * M, 0), Y(2 * M, 0);
for (auto x : XX)
++X[uf.find(x)];
for (auto y : YY)
++Y[uf.find(y + M)];
long long ans = -N;
for (int i = 0; i < 2 * M; ++i) {
ans += (long long)X[i] * Y[i];
}
cout << ans << endl;
}
| [
"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_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll power(ll base, ll exponent) {
if (exponent % 2) {
return power(base, exponent - 1) * base % mod;
} else if (exponent) {
ll root_ans = power(base, exponent / 2);
return root_ans * root_ans % mod;
} else {
return 1;
}
}
ll inverse(ll x) { return power(x, mod - 2); }
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
ll r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
int bsearch(const vector<ll> &a, ll x) {
int lft = 0;
int rgt = a.size();
while (rgt - lft > 1) {
int mid = (lft + rgt) / 2;
if (a[mid] < x) {
lft = mid;
} else {
rgt = mid;
}
}
return lft;
}
vector<ll> cnt;
vector<vector<ll>> g;
vector<bool> used;
int V = 100000 + 10;
void dfs(int v) {
if (used[v])
return;
used[v] = true;
cnt[v / V]++;
for (const auto &next : g[v])
dfs(next);
}
signed main() {
ios::sync_with_stdio(false);
ll n;
cin >> n;
g = vector<vector<ll>>(V * 2);
used = vector<bool>(V * 2, false);
REP(i, n) {
int x, y;
cin >> x >> y;
x--;
y--;
y += V;
g[x].push_back(y);
g[y].push_back(x);
}
ll ans = 0;
REP(i, n) {
if (used[i])
continue;
cnt = vector<ll>(2);
dfs(i);
ans += cnt[0] * cnt[1];
}
cout << ans - n << endl;
return 0;
}
| #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_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll power(ll base, ll exponent) {
if (exponent % 2) {
return power(base, exponent - 1) * base % mod;
} else if (exponent) {
ll root_ans = power(base, exponent / 2);
return root_ans * root_ans % mod;
} else {
return 1;
}
}
ll inverse(ll x) { return power(x, mod - 2); }
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
ll r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
int bsearch(const vector<ll> &a, ll x) {
int lft = 0;
int rgt = a.size();
while (rgt - lft > 1) {
int mid = (lft + rgt) / 2;
if (a[mid] < x) {
lft = mid;
} else {
rgt = mid;
}
}
return lft;
}
vector<ll> cnt;
vector<vector<ll>> g;
vector<bool> used;
int V = 100000 + 10;
void dfs(int v) {
if (used[v])
return;
used[v] = true;
cnt[v / V]++;
for (const auto &next : g[v])
dfs(next);
}
signed main() {
ios::sync_with_stdio(false);
ll n;
cin >> n;
g = vector<vector<ll>>(V * 2);
used = vector<bool>(V * 2, false);
REP(i, n) {
int x, y;
cin >> x >> y;
x--;
y--;
y += V;
g[x].push_back(y);
g[y].push_back(x);
}
ll ans = 0;
REP(i, V) {
if (used[i])
continue;
cnt = vector<ll>(2);
dfs(i);
ans += cnt[0] * cnt[1];
}
cout << ans - n << endl;
return 0;
}
| [] | 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 SZ(x) ((int)(x).size())
#define all(v) v.begin(), v.end()
#define ios \
cin.tie(0); \
ios::sync_with_stdio(false)
#define FIX(a) cout << fixed << setprecision(a)
// loop
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep3(i, st, n) for (int i = st; i < n; ++i)
// manip
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end(), v.end());
#define fill(x, y) memset(x, y, sizeof(x))
#define ceil(a, b) a / b + !!(a % b)
template <class T> T power_mod(T a, T b) {
return b ? power_mod(a * a % inf, b / 2) * (b % 2 ? a : 1) % inf : 1;
}
template <class T> T power(T a, T b) {
return b ? power(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
#define LB(v, x) (int)(lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (int)(upper_bound(v.begin(), v.end(), x) - v.begin())
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) {
return a / gcd(max(a, b), min(a, b)) * b;
} //先に割る!!
#define outa(a, n) \
rep(i, n) cout << a[i] << " "; \
cout << endl
#define outaa(a, m, n) \
rep(i, m) { \
rep(j, n) cout << a[i][j] << " "; \
cout << endl; \
} \
cout << endl
#define out(a) cout << a << endl
#define outv(v) \
rep(i, SZ(v)) cout << v[i] << " "; \
cout << endl
// algorithm
// double pointer, l start, how many adds, can be 0 -> init r = l, sum = 0
// bfs, not x, y, i, j
// not !(i % 2), i % 2 == 0
// minimal required terms
// cast caution
// look constraints always
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(3 * n);
rep(i, m) {
int s, t;
cin >> s >> t;
s--;
t--;
v[s * 3].eb(t * 3 + 1); // 0 to 1
v[s * 3 + 1].eb(t * 3 + 2);
v[s * 3 + 2].eb(t * 3);
}
int s, t;
cin >> s >> t;
s--;
t--;
ll reached[300001];
fill_n(reached, 300001, -1);
queue<pair<int, ll>> q;
q.push(pii(s, 0));
reached[s] = 0;
while (!q.empty()) {
int now = q.front().F;
ll cost = q.front().S;
q.pop();
rep(i, SZ(v[now])) {
int nxt = v[now][i];
if (reached[nxt] != -1)
continue;
reached[nxt] = cost + 1;
q.push({nxt, cost + 1});
}
}
// outa(reached, 9);
out((reached[t * 3] == -1 ? -1 : reached[t * 3] / 3));
}
| #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 SZ(x) ((int)(x).size())
#define all(v) v.begin(), v.end()
#define ios \
cin.tie(0); \
ios::sync_with_stdio(false)
#define FIX(a) cout << fixed << setprecision(a)
// loop
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep3(i, st, n) for (int i = st; i < n; ++i)
// manip
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end(), v.end());
#define fill(x, y) memset(x, y, sizeof(x))
#define ceil(a, b) a / b + !!(a % b)
template <class T> T power_mod(T a, T b) {
return b ? power_mod(a * a % inf, b / 2) * (b % 2 ? a : 1) % inf : 1;
}
template <class T> T power(T a, T b) {
return b ? power(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
#define LB(v, x) (int)(lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (int)(upper_bound(v.begin(), v.end(), x) - v.begin())
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) {
return a / gcd(max(a, b), min(a, b)) * b;
} //先に割る!!
#define outa(a, n) \
rep(i, n) cout << a[i] << " "; \
cout << endl
#define outaa(a, m, n) \
rep(i, m) { \
rep(j, n) cout << a[i][j] << " "; \
cout << endl; \
} \
cout << endl
#define out(a) cout << a << endl
#define outv(v) \
rep(i, SZ(v)) cout << v[i] << " "; \
cout << endl
// algorithm
// double pointer, l start, how many adds, can be 0 -> init r = l, sum = 0
// bfs, not x, y, i, j
// not !(i % 2), i % 2 == 0
// minimal required terms
// cast caution
// look constraints always
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(3 * n);
rep(i, m) {
int s, t;
cin >> s >> t;
s--;
t--;
v[s * 3].eb(t * 3 + 1); // 0 to 1
v[s * 3 + 1].eb(t * 3 + 2);
v[s * 3 + 2].eb(t * 3);
}
int s, t;
cin >> s >> t;
s--;
t--;
ll reached[300001];
fill_n(reached, 300001, -1);
queue<pair<int, ll>> q;
q.push(pii(s * 3, 0));
reached[s * 3] = 0;
while (!q.empty()) {
int now = q.front().F;
ll cost = q.front().S;
q.pop();
rep(i, SZ(v[now])) {
int nxt = v[now][i];
if (reached[nxt] != -1)
continue;
reached[nxt] = cost + 1;
q.push({nxt, cost + 1});
}
}
// outa(reached, 9);
out((reached[t * 3] == -1 ? -1 : reached[t * 3] / 3));
}
| [
"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
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
inline void Yes(bool condition) {
if (condition)
PRINT("Yes");
else
PRINT("No");
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class itr> void array_output(itr start, itr goal) {
string ans = "", k = " ";
for (auto i = start; i != goal; i++)
ans += to_string(*i) + k;
if (!ans.empty())
ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) { return a ? gcd(b % a, a) : b; }
const ll INF = 1e18;
const ll MOD = 1000000007;
typedef pair<ll, ll> P;
const ll MAX = 20000;
constexpr ll nx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
constexpr ll ny[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m, u, v, s, t;
cin >> n >> m;
vector<vector<ll>> g(3 * n);
vector<ll> d(3 * n, -1);
rep(i, m) {
cin >> u >> v;
--u;
--v;
g[3 * u].push_back(3 * v + 1);
g[3 * u + 1].push_back(3 * v + 2);
g[3 * u + 2].push_back(3 * v);
}
cin >> s >> t;
--s;
--t;
d[s] = 0;
queue<ll> q;
q.push(s);
while (!q.empty()) {
ll x;
x = q.front();
q.pop();
for (ll i : g[x]) {
if (d[i] != -1)
continue;
d[i] = d[x] + 1;
q.push(i);
}
}
if (d[3 * t] != -1)
PRINT(d[3 * t] / 3);
else
PRINT(-1);
}
| #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
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
inline void Yes(bool condition) {
if (condition)
PRINT("Yes");
else
PRINT("No");
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class itr> void array_output(itr start, itr goal) {
string ans = "", k = " ";
for (auto i = start; i != goal; i++)
ans += to_string(*i) + k;
if (!ans.empty())
ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) { return a ? gcd(b % a, a) : b; }
const ll INF = 1e18;
const ll MOD = 1000000007;
typedef pair<ll, ll> P;
const ll MAX = 20000;
constexpr ll nx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
constexpr ll ny[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m, u, v, s, t;
cin >> n >> m;
vector<vector<ll>> g(3 * n);
vector<ll> d(3 * n, -1);
rep(i, m) {
cin >> u >> v;
--u;
--v;
g[3 * u].push_back(3 * v + 1);
g[3 * u + 1].push_back(3 * v + 2);
g[3 * u + 2].push_back(3 * v);
}
cin >> s >> t;
--s;
--t;
d[3 * s] = 0;
queue<ll> q;
q.push(3 * s);
while (!q.empty()) {
ll x;
x = q.front();
q.pop();
for (ll i : g[x]) {
if (d[i] != -1)
continue;
d[i] = d[x] + 1;
q.push(i);
}
}
if (d[3 * t] != -1)
PRINT(d[3 * t] / 3);
else
PRINT(-1);
}
| [
"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, int> P;
// lcm//
ll gcd(ll x, ll y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
// a^n mod p//
ll modpow(ll a, ll n, ll p) {
if (n == 1)
return a % p;
if (n % 2 == 1)
return (a * modpow(a, n - 1, p)) % p;
ll t = modpow(a, n / 2, p);
return (t * t) % p;
}
// inversemod//
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// Cmonp//
ll fac[MAX], finv[MAX], inv[MAX];
//
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
//
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// LARGE n
ll com(ll n, ll m) {
if (n < m || n <= 0 || m < 0) {
return 0;
}
if (m == 0 || n == m) {
return 1;
}
ll k = 1;
for (ll i = 1; i <= m; i++) {
k *= (n - i + 1);
k %= MOD;
k *= modinv(i, MOD);
k %= MOD;
}
return k;
}
////////////////////////////////////////////////////////////////////
vector<int> vec[300016]{};
queue<P> que{};
int dp[300016];
void bfs(ll u) {
que.push(make_pair(u, 0));
while (que.size()) {
P p = que.front();
int s = p.first;
int d = p.second;
que.pop();
if (dp[s] != -1) {
} else {
dp[s] = d;
for (int i = 0; i < vec[s].size(); i++) {
que.push(make_pair(vec[s][i], d + 1));
}
}
}
}
int main() {
ll n, m;
cin >> n >> m;
rep(i, m) {
int p, q;
cin >> p >> q;
vec[p].push_back(q + n);
vec[p + n].push_back(q + n + n);
vec[p + n + n].push_back(q);
}
int s, g;
cin >> s >> g;
rep(i, 3 * n) { dp[i] = -1; }
bfs(s);
cout << dp[g] / 3 << "\n";
return 0;
}
| #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, int> P;
// lcm//
ll gcd(ll x, ll y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
// a^n mod p//
ll modpow(ll a, ll n, ll p) {
if (n == 1)
return a % p;
if (n % 2 == 1)
return (a * modpow(a, n - 1, p)) % p;
ll t = modpow(a, n / 2, p);
return (t * t) % p;
}
// inversemod//
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// Cmonp//
ll fac[MAX], finv[MAX], inv[MAX];
//
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
//
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// LARGE n
ll com(ll n, ll m) {
if (n < m || n <= 0 || m < 0) {
return 0;
}
if (m == 0 || n == m) {
return 1;
}
ll k = 1;
for (ll i = 1; i <= m; i++) {
k *= (n - i + 1);
k %= MOD;
k *= modinv(i, MOD);
k %= MOD;
}
return k;
}
////////////////////////////////////////////////////////////////////
vector<int> vec[300016]{};
queue<P> que{};
int dp[300016];
void bfs(ll u) {
que.push(make_pair(u, 0));
while (que.size()) {
P p = que.front();
int s = p.first;
int d = p.second;
que.pop();
if (dp[s] != -3) {
} else {
dp[s] = d;
for (int i = 0; i < vec[s].size(); i++) {
que.push(make_pair(vec[s][i], d + 1));
}
}
}
}
int main() {
ll n, m;
cin >> n >> m;
rep(i, m) {
int p, q;
cin >> p >> q;
vec[p].push_back(q + n);
vec[p + n].push_back(q + n + n);
vec[p + n + n].push_back(q);
}
int s, g;
cin >> s >> g;
rep(i, 3 * n) { dp[i] = -3; }
bfs(s);
cout << dp[g] / 3 << "\n";
return 0;
}
| [
"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, s--, t--;
queue<int> q;
q.push(s * 3);
vector<int> dist(n * 3, -1);
dist[s * 3] = 0;
while (!q.empty()) {
int a = q.front();
q.pop();
for (auto &e : g[a]) {
if (dist[a] != -1)
continue;
dist[e] = dist[a] + 1;
q.push(e);
}
}
cout << (dist[t * 3] % 3 == 0 ? dist[t * 3] / 3 : -1) << endl;
return 0;
} | #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, s--, t--;
queue<int> q;
q.push(s * 3);
vector<int> dist(n * 3, -1);
dist[s * 3] = 0;
while (!q.empty()) {
int a = q.front();
q.pop();
for (auto &e : g[a]) {
if (dist[e] != -1)
continue;
dist[e] = dist[a] + 1;
q.push(e);
}
}
cout << (dist[t * 3] % 3 == 0 ? dist[t * 3] / 3 : -1) << endl;
return 0;
} | [
"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) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int dist[100005][3];
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> to(N);
rep(i, N) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
}
int sv, tv;
cin >> sv >> tv;
sv--;
tv--;
rep(i, N) rep(j, 3) dist[i][j] = INF;
queue<P> q;
q.push({sv, 0});
dist[sv][0] = 0;
while (!q.empty()) {
int v = q.front().first;
int l = q.front().second;
q.pop();
for (int u : to[v]) {
int nl = (l + 1) % 3;
if (dist[u][nl] != INF)
continue;
dist[u][nl] = dist[v][l] + 1;
q.push({u, nl});
}
}
int ans = dist[tv][0];
if (ans == INF)
ans = -1;
else
ans /= 3;
cout << ans << endl;
} | #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) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int dist[100005][3];
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> to(N);
rep(i, M) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
}
int sv, tv;
cin >> sv >> tv;
sv--;
tv--;
rep(i, N) rep(j, 3) dist[i][j] = INF;
queue<P> q;
q.push({sv, 0});
dist[sv][0] = 0;
while (!q.empty()) {
int v = q.front().first;
int l = q.front().second;
q.pop();
for (int u : to[v]) {
int nl = (l + 1) % 3;
if (dist[u][nl] != INF)
continue;
dist[u][nl] = dist[v][l] + 1;
q.push({u, nl});
}
}
int ans = dist[tv][0];
if (ans == INF)
ans = -1;
else
ans /= 3;
cout << ans << endl;
} | [] | 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 + (j + 1) % 3);
}
}
i32 s, t;
cin >> s >> t, s--, t--;
queue<i32> q;
q.push(s);
vector<i32> dist(n * 3, -1);
dist[s * 3] = 0;
while (!q.empty()) {
i32 a = q.front();
q.pop();
for (auto &e : g[a]) {
if (dist[e] != -1)
continue;
dist[e] = dist[a] + 1;
q.push(e);
}
}
cout << (dist[t * 3] % 3 == 0 ? dist[t * 3] / 3 : -1) << endl;
}
| #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 + (j + 1) % 3);
}
}
i32 s, t;
cin >> s >> t, s--, t--;
queue<i32> q;
q.push(s * 3);
vector<i32> dist(n * 3, -1);
dist[s * 3] = 0;
while (!q.empty()) {
i32 a = q.front();
q.pop();
for (auto &e : g[a]) {
if (dist[e] != -1)
continue;
dist[e] = dist[a] + 1;
q.push(e);
}
}
cout << (dist[t * 3] % 3 == 0 ? dist[t * 3] / 3 : -1) << endl;
}
| [
"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<vector<ll>> dis(n, vector<ll>(3, -1));
queue<pll> q;
q.push(pll(s, 0));
dis[0][0] = 0;
while (q.size()) {
ll f = q.front().first;
ll d = q.front().second;
q.pop();
for (ll t : v[f]) {
if (dis[t][(d + 1) % 3] < 0) {
dis[t][(d + 1) % 3] = d + 1;
q.push(pll(t, d + 1));
}
}
}
if (dis[t][0] < 0) {
cout << -1 << endl;
} else {
cout << dis[t][0] / 3 << endl;
}
} | #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<vector<ll>> dis(n, vector<ll>(3, -1));
queue<pll> q;
q.push(pll(s, 0));
dis[s][0] = 0;
while (q.size()) {
ll f = q.front().first;
ll d = q.front().second;
q.pop();
for (ll t : v[f]) {
if (dis[t][(d + 1) % 3] < 0) {
dis[t][(d + 1) % 3] = d + 1;
q.push(pll(t, d + 1));
}
}
}
if (dis[t][0] < 0) {
cout << -1 << endl;
} else {
cout << dis[t][0] / 3 << endl;
}
} | [
"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<int, int> pii;
typedef pair<long long, long long> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////////////////////////////////////////////////////////
ll dist[101010][3];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
rep(i, M) {
int u, v;
cin >> u >> v;
--u;
--v;
G[u].emplace_back(v);
}
int S, T;
cin >> S >> T;
--S;
--T;
rep(i, N) rep(j, 3) dist[i][j] = -1;
dist[S][0] = 0;
queue<pii> que;
que.emplace(0, 0);
while (!que.empty()) {
int v, c;
tie(v, c) = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv][(c + 1) % 3] != -1)
continue;
dist[nv][(c + 1) % 3] = dist[v][c] + 1;
que.emplace(nv, (c + 1) % 3);
}
}
cout << (dist[T][0] == -1 ? -1 : dist[T][0] / 3) << ln;
} | #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<int, int> pii;
typedef pair<long long, long long> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////////////////////////////////////////////////////////
int dist[101010][3];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
rep(i, M) {
int u, v;
cin >> u >> v;
--u;
--v;
G[u].emplace_back(v);
}
int S, T;
cin >> S >> T;
--S;
--T;
rep(i, N) rep(j, 3) dist[i][j] = -1;
dist[S][0] = 0;
queue<pii> que;
que.emplace(S, 0);
while (!que.empty()) {
int v, c;
tie(v, c) = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv][(c + 1) % 3] != -1)
continue;
dist[nv][(c + 1) % 3] = dist[v][c] + 1;
que.emplace(nv, (c + 1) % 3);
}
}
cout << (dist[T][0] == -1 ? -1 : dist[T][0] / 3) << ln;
} | [
"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<int, int> pii;
typedef pair<long long, long long> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////////////////////////////////////////////////////////
int dist[101010][3];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
rep(i, M) {
int u, v;
cin >> u >> v;
--u;
--v;
G[u].emplace_back(v);
}
int S, T;
cin >> S >> T;
--S;
--T;
rep(i, N) rep(j, 3) dist[i][j] = -1;
dist[S][0] = 0;
queue<pii> que;
que.emplace(0, 0);
while (!que.empty()) {
int v, c;
tie(v, c) = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv][(c + 1) % 3] != -1)
continue;
dist[nv][(c + 1) % 3] = dist[v][c] + 1;
que.emplace(nv, (c + 1) % 3);
}
}
cout << (dist[T][0] == -1 ? -1 : dist[T][0] / 3) << ln;
} | #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<int, int> pii;
typedef pair<long long, long long> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////////////////////////////////////////////////////////
int dist[101010][3];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
rep(i, M) {
int u, v;
cin >> u >> v;
--u;
--v;
G[u].emplace_back(v);
}
int S, T;
cin >> S >> T;
--S;
--T;
rep(i, N) rep(j, 3) dist[i][j] = -1;
dist[S][0] = 0;
queue<pii> que;
que.emplace(S, 0);
while (!que.empty()) {
int v, c;
tie(v, c) = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv][(c + 1) % 3] != -1)
continue;
dist[nv][(c + 1) % 3] = dist[v][c] + 1;
que.emplace(nv, (c + 1) % 3);
}
}
cout << (dist[T][0] == -1 ? -1 : dist[T][0] / 3) << ln;
} | [
"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
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define mod 1000000007
using namespace std;
typedef long long ll;
template <class T> using V = vector<T>;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// V,P(大文字)使用不可
const ll INF = 1e18;
signed main() {
int n, m;
cin >> n >> m;
Graph G(3 * n);
rep(i, m) {
int u, v;
cin >> u >> v;
u--;
v--;
G[3 * u].push_back(3 * v + 1);
G[3 * u + 1].push_back(3 * v + 2);
G[3 * u + 2].push_back(3 * v);
}
int s, t;
cin >> s >> t;
s--;
t--;
V<int> dist(3 * n, -1);
queue<int> que;
dist[s] = 0;
que.push(3 * s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : G[v]) {
if (dist[nv] != -1)
continue;
dist[nv] = dist[v] + 1;
que.push(nv);
}
}
int d = dist[3 * t];
if (d == -1 || d % 3 != 0)
cout << -1 << endl;
else
cout << d / 3 << endl;
} | #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
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define mod 1000000007
using namespace std;
typedef long long ll;
template <class T> using V = vector<T>;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// V,P(大文字)使用不可
const ll INF = 1e18;
signed main() {
int n, m;
cin >> n >> m;
Graph G(3 * n);
rep(i, m) {
int u, v;
cin >> u >> v;
u--;
v--;
G[3 * u].push_back(3 * v + 1);
G[3 * u + 1].push_back(3 * v + 2);
G[3 * u + 2].push_back(3 * v);
}
int s, t;
cin >> s >> t;
s--;
t--;
V<int> dist(3 * n, -1);
queue<int> que;
dist[3 * s] = 0;
que.push(3 * s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : G[v]) {
if (dist[nv] != -1)
continue;
dist[nv] = dist[v] + 1;
que.push(nv);
}
}
int d = dist[3 * t];
if (d == -1 || d % 3 != 0)
cout << -1 << endl;
else
cout << d / 3 << endl;
}
| [
"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();
que.pop();
if (v == 3 * T) {
break;
}
for (ll i = 0; i < G[v].size(); i++) {
ll to = G[v][i];
if (d[to] == INF) {
d[to] = d[v] + 1;
que.push(to);
} else {
continue;
}
}
}
if (d[3 * T] == INF) {
return -1;
} else {
return d[3 * T] / 3;
}
}
int main() {
cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll u, v;
cin >> u >> v;
u--;
v--;
G[3 * u].push_back(3 * v + 1);
G[3 * u + 1].push_back(3 * v + 2);
G[3 * u + 2].push_back(3 * v);
}
cin >> S >> T;
S--;
T--;
cout << bfs(3 * S) / 3 << endl;
} | #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();
que.pop();
if (v == 3 * T) {
break;
}
for (ll i = 0; i < G[v].size(); i++) {
ll to = G[v][i];
if (d[to] == INF) {
d[to] = d[v] + 1;
que.push(to);
} else {
continue;
}
}
}
if (d[3 * T] == INF) {
return -1;
} else {
return d[3 * T] / 3;
}
}
int main() {
cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll u, v;
cin >> u >> v;
u--;
v--;
G[3 * u].push_back(3 * v + 1);
G[3 * u + 1].push_back(3 * v + 2);
G[3 * u + 2].push_back(3 * v);
}
cin >> S >> T;
S--;
T--;
cout << bfs(3 * S) << endl;
}
| [
"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();
que.pop();
if (v == T) {
break;
}
for (ll i = 0; i < G[v].size(); i++) {
ll to = G[v][i];
if (d[to] == INF) {
d[to] = d[v] + 1;
que.push(to);
} else {
continue;
}
}
}
if (d[3 * T] == INF) {
return -1;
} else {
return d[3 * T] / 3;
}
}
int main() {
cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll u, v;
cin >> u >> v;
u--;
v--;
G[3 * u].push_back(3 * v + 1);
G[3 * u + 1].push_back(3 * v + 2);
G[3 * u + 2].push_back(3 * v);
}
cin >> S >> T;
S--;
T--;
cout << bfs(3 * S) << endl;
} | #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();
que.pop();
if (v == 3 * T) {
break;
}
for (ll i = 0; i < G[v].size(); i++) {
ll to = G[v][i];
if (d[to] == INF) {
d[to] = d[v] + 1;
que.push(to);
} else {
continue;
}
}
}
if (d[3 * T] == INF) {
return -1;
} else {
return d[3 * T] / 3;
}
}
int main() {
cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll u, v;
cin >> u >> v;
u--;
v--;
G[3 * u].push_back(3 * v + 1);
G[3 * u + 1].push_back(3 * v + 2);
G[3 * u + 2].push_back(3 * v);
}
cin >> S >> T;
S--;
T--;
cout << bfs(3 * S) << endl;
}
| [
"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 debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef vector<vector<P>> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<ll> vec;
const vec dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vec dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef vector<vector<P>> Graph;
vector<int> dijkstra(int s, Graph &G) {
priority_queue<P, vector<P>, greater<P>> que;
int n = G.size();
vector<int> dist(n);
dist.assign(n, INF);
dist[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.sc;
REP(i, G[v].size()) {
if (dist[G[v][i].fs] > dist[v] + G[v][i].sc) {
dist[G[v][i].fs] = dist[v] + G[v][i].sc;
que.push(P(dist[G[v][i].fs], G[v][i].fs));
}
}
}
return dist;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
//---------------------------------------------
int n, m;
cin >> n >> m;
Graph edge(3 * n);
rep(i, n) {
int x, y;
cin >> x >> y;
x--;
y--;
edge[3 * x].pb(P(3 * y + 1, 1));
edge[3 * x + 1].pb(P(3 * y + 2, 1));
edge[3 * x + 2].pb(P(3 * y, 1));
}
int s, t;
cin >> s >> t;
s--;
t--;
vec dist = dijkstra(3 * s, edge);
if (dist[3 * t] == INF)
cout << -1 << endl;
else
cout << dist[3 * t] / 3 << endl;
} | // #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 debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef vector<vector<P>> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<ll> vec;
const vec dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vec dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef vector<vector<P>> Graph;
vector<int> dijkstra(int s, Graph &G) {
priority_queue<P, vector<P>, greater<P>> que;
int n = G.size();
vector<int> dist(n);
dist.assign(n, INF);
dist[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.sc;
REP(i, G[v].size()) {
if (dist[G[v][i].fs] > dist[v] + G[v][i].sc) {
dist[G[v][i].fs] = dist[v] + G[v][i].sc;
que.push(P(dist[G[v][i].fs], G[v][i].fs));
}
}
}
return dist;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
//---------------------------------------------
int n, m;
cin >> n >> m;
Graph edge(3 * n);
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
edge[3 * x].pb(P(3 * y + 1, 1));
edge[3 * x + 1].pb(P(3 * y + 2, 1));
edge[3 * x + 2].pb(P(3 * y, 1));
}
int s, t;
cin >> s >> t;
s--;
t--;
vec dist = dijkstra(3 * s, edge);
if (dist[3 * t] == INF)
cout << -1 << endl;
else
cout << dist[3 * t] / 3 << endl;
} | [] | 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) {
a = b;
return true;
}
return false;
}
const int INF = INT_MAX / 2;
const int MAX_N = 100005;
int dist[MAX_N][3];
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> edges(N);
for (int i = 0; i < M; i++) {
int u, v;
cin >> u >> v;
edges[u - 1].push_back(v - 1);
}
int S, T;
cin >> S >> T;
S--;
T--;
for (int i = 0; i < MAX_N; i++) {
for (int j = 0; j < 3; j++) {
dist[i][j] = INF;
}
}
// {vertex, dist}
queue<pair<int, int>> q;
q.push({0, 0});
dist[0][0] = 0;
while (!q.empty()) {
int v = q.front().first;
int d = q.front().second;
q.pop();
for (int i = 0; i < (int)edges[v].size(); i++) {
int nv = edges[v][i];
int nd = d + 1;
int nl = (d + 1) % 3;
if (dist[nv][nl] != INF)
continue;
dist[nv][nl] = nd;
q.push({nv, nd});
}
}
int ans;
if (dist[T][0] == INF)
ans = -1;
else
ans = dist[T][0] / 3;
cout << ans << endl;
return 0;
}
| #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) {
a = b;
return true;
}
return false;
}
const int INF = INT_MAX / 2;
const int MAX_N = 100005;
int dist[MAX_N][3];
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> edges(N);
for (int i = 0; i < M; i++) {
int u, v;
cin >> u >> v;
edges[u - 1].push_back(v - 1);
}
int S, T;
cin >> S >> T;
S--;
T--;
for (int i = 0; i < MAX_N; i++) {
for (int j = 0; j < 3; j++) {
dist[i][j] = INF;
}
}
// {vertex, dist}
queue<pair<int, int>> q;
q.push({S, 0});
dist[S][0] = 0;
while (!q.empty()) {
int v = q.front().first;
int d = q.front().second;
q.pop();
for (int i = 0; i < (int)edges[v].size(); i++) {
int nv = edges[v][i];
int nd = d + 1;
int nl = (d + 1) % 3;
if (dist[nv][nl] != INF)
continue;
dist[nv][nl] = nd;
q.push({nv, nd});
}
}
int ans;
if (dist[T][0] == INF)
ans = -1;
else
ans = dist[T][0] / 3;
cout << ans << endl;
return 0;
}
| [
"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) cerr << #x << " = " << (x) << endl
#define UNIQUE(c) sort(ALL(c)), c.erase(unique(ALL(c)), c.end())
const int dr[4] = {-1, 0, 1, 0};
const int dc[4] = {0, 1, 0, -1};
const int INF = 1 << 30;
int main() {
// use scanf in CodeForces!
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> edges(N);
REP(i, M) {
int u, v;
cin >> u >> v;
u--, v--;
edges[u].emplace_back(v);
}
int S, T;
cin >> S >> T;
S--, T--;
vector<vector<int>> dist(3, vector<int>(N, INF));
using Tu = tuple<int, int, int>;
priority_queue<Tu, vector<Tu>, greater<Tu>> pque;
pque.emplace(S, 0, 0);
while (not pque.empty()) {
int d, s, v;
tie(d, s, v) = pque.top();
pque.pop();
// cerr << v << ' ' << s << ' ' << d << endl;
if (s == 0 and v == T) {
cout << d / 3 << endl;
return 0;
}
if (dist[s][v] < d)
continue;
dist[s][v] = d;
int next_s = (s + 1) % 3;
for (int c : edges[v]) {
if (d + 1 < dist[next_s][c]) {
dist[next_s][c] = d + 1;
pque.emplace(d + 1, next_s, c);
}
}
}
cout << -1 << endl;
return 0;
}
| #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) cerr << #x << " = " << (x) << endl
#define UNIQUE(c) sort(ALL(c)), c.erase(unique(ALL(c)), c.end())
const int dr[4] = {-1, 0, 1, 0};
const int dc[4] = {0, 1, 0, -1};
const int INF = 1 << 30;
int main() {
// use scanf in CodeForces!
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> edges(N);
REP(i, M) {
int u, v;
cin >> u >> v;
u--, v--;
edges[u].emplace_back(v);
}
int S, T;
cin >> S >> T;
S--, T--;
vector<vector<int>> dist(3, vector<int>(N, INF));
using Tu = tuple<int, int, int>;
priority_queue<Tu, vector<Tu>, greater<Tu>> pque;
pque.emplace(0, 0, S);
while (not pque.empty()) {
int d, s, v;
tie(d, s, v) = pque.top();
pque.pop();
// cerr << v << ' ' << s << ' ' << d << endl;
if (s == 0 and v == T) {
cout << d / 3 << endl;
return 0;
}
if (dist[s][v] < d)
continue;
dist[s][v] = d;
int next_s = (s + 1) % 3;
for (int c : edges[v]) {
if (d + 1 < dist[next_s][c]) {
dist[next_s][c] = d + 1;
pque.emplace(d + 1, next_s, c);
}
}
}
cout << -1 << endl;
return 0;
}
| [
"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;
typedef priority_queue<ll, vector<ll>, greater<ll>> SMALLPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
ll inf = 1000000000000007;
const int mod = 1000000007;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
ll n, m;
cin >> n >> m;
vi v(n * 3, inf);
vvi g(n * 3);
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
rep(j, 3) g[a * 3 + j].push_back((b * 3) + ((j + 1) % 3));
}
ll s, t;
cin >> s >> t;
s--;
t--;
v[s] = 0;
queue<ll> q;
q.push(s);
while (!q.empty()) {
ll a = q.front();
q.pop();
for (ll i : g[a]) {
if (v[i] == inf) {
v[i] = v[a] + 1;
q.push(i);
}
}
}
if (v[t * 3] == inf)
cout << -1 << endl;
else
cout << v[t * 3] / 3 << endl;
}
| #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;
typedef priority_queue<ll, vector<ll>, greater<ll>> SMALLPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
ll inf = 1000000000000007;
const int mod = 1000000007;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
ll n, m;
cin >> n >> m;
vi v(n * 3, inf);
vvi g(n * 3);
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
rep(j, 3) g[a * 3 + j].push_back((b * 3) + ((j + 1) % 3));
}
ll s, t;
cin >> s >> t;
s--;
t--;
v[s * 3] = 0;
queue<ll> q;
q.push(s * 3);
while (!q.empty()) {
ll a = q.front();
q.pop();
for (ll i : g[a]) {
if (v[i] == inf) {
v[i] = v[a] + 1;
q.push(i);
}
}
}
if (v[t * 3] == inf)
cout << -1 << endl;
else
cout << v[t * 3] / 3 << endl;
}
| [
"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] = d[i - 1] + l[i - 1];
}
int ans = 0;
rep(i, n) {
if (d[i] <= x)
ans++;
}
cout << ans << endl;
}
| #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] = d[i - 1] + l[i - 1];
}
int ans = 0;
rep(i, n + 1) {
if (d[i] <= x)
ans++;
}
cout << ans << endl;
}
| [
"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 - 1] + l[i - 1];
}
int ans = 0;
rep(i, n) {
if (d[i] <= x)
ans++;
}
cout << ans << endl;
} | #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] = d[i - 1] + l[i - 1];
}
int ans = 0;
rep(i, n + 1) {
if (d[i] <= x)
ans++;
}
cout << ans << endl;
}
| [
"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) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
int N, x, l[101], ans = 0, cnt = 0;
cin >> N >> x;
rep(i, N) {
cin >> l[i];
ans = l[i];
if (ans <= x)
cnt++;
}
cnt++;
cout << cnt << endl;
} | #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) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
int N, x, l[101], ans = 0, cnt = 0;
cin >> N >> x;
rep(i, N) {
cin >> l[i];
ans += l[i];
if (ans <= x)
cnt++;
}
cnt++;
cout << cnt << endl;
} | [
"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) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
int N, x, l[101], ans = 0, cnt = 0;
cin >> N >> x;
rep(i, N) {
cin >> l[i];
ans = l[i];
if (ans <= x)
cnt++;
}
cout << cnt << endl;
} | #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) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
int N, x, l[101], ans = 0, cnt = 0;
cin >> N >> x;
rep(i, N) {
cin >> l[i];
ans += l[i];
if (ans <= x)
cnt++;
}
cnt++;
cout << cnt << endl;
} | [
"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) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
int N, x, l[101], ans = 0, cnt = 0;
cin >> N >> x;
rep(i, N) {
cin >> l[i];
ans = l[i];
if (ans <= x)
cnt++;
}
cnt--;
cout << cnt << endl;
} | #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) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
int N, x, l[101], ans = 0, cnt = 0;
cin >> N >> x;
rep(i, N) {
cin >> l[i];
ans += l[i];
if (ans <= x)
cnt++;
}
cnt++;
cout << cnt << endl;
} | [
"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++;
}
cout << ans << endl;
} | #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++;
}
cout << ans << endl;
} | [
"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;
arr.pb(sum);
}
ll count = 0;
for (i = 0; i < n; i++) {
if (arr[i] <= m)
count++;
else
break;
}
cout << count;
} | #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;
arr.pb(sum);
}
ll count = 0;
for (i = 0; i < n + 1; i++) {
if (arr[i] <= m)
count++;
else
break;
}
cout << count;
} | [
"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 << count;
return 0;
}
| #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 << count;
return 0;
} | [
"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 <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
//名前
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef map<string, int> msi;
typedef map<string, ll> msll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pllll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<vector<string>> vvs;
typedef vector<vector<bool>> vvb;
//定数
const ll MOD = 1000000007;
const ll INF = 1000000000000000000;
//マクロ
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, e) for (int i = s; i < e; i++)
#define repse(i, s, e) for (int i = s; i <= e; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define in(x1) cin >> x1
#define in2(x1, x2) cin >> x1 >> x2
#define in3(x1, x2, x3) cin >> x1 >> x2 >> x3
#define outl(x) cout << x << endl
#define out2l(x, y) cout << x << " " << y << endl
//よく使う関数
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
//標準入力をファイルに変更
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
int N, X;
in2(N, X);
vi L(N);
rep(i, N) in(L[i]);
int d = 1;
int count = 0;
rep(i, N) {
d += L[i];
if (d > X)
break;
count++;
}
outl(count);
return 0;
} | #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 <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
//名前
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef map<string, int> msi;
typedef map<string, ll> msll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pllll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<vector<string>> vvs;
typedef vector<vector<bool>> vvb;
//定数
const ll MOD = 1000000007;
const ll INF = 1000000000000000000;
//マクロ
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, e) for (int i = s; i < e; i++)
#define repse(i, s, e) for (int i = s; i <= e; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define in(x1) cin >> x1
#define in2(x1, x2) cin >> x1 >> x2
#define in3(x1, x2, x3) cin >> x1 >> x2 >> x3
#define outl(x) cout << x << endl
#define out2l(x, y) cout << x << " " << y << endl
//よく使う関数
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
//標準入力をファイルに変更
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
int N, X;
in2(N, X);
vi L(N);
rep(i, N) in(L[i]);
int d = 0;
int count = 1;
rep(i, N) {
d += L[i];
if (d > X)
break;
count++;
}
outl(count);
return 0;
} | [
"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 <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
//名前
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef map<string, int> msi;
typedef map<string, ll> msll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pllll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<vector<string>> vvs;
typedef vector<vector<bool>> vvb;
//定数
const ll MOD = 1000000007;
const ll INF = 1000000000000000000;
//マクロ
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, e) for (int i = s; i < e; i++)
#define repse(i, s, e) for (int i = s; i <= e; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define in(x) cin >> x
#define outl(x) cout << x << endl
#define out2l(x, y) cout << x << " " << y << endl
//よく使う関数
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
//標準入力をファイルに変更
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
int N, X;
in(N);
in(X);
vi L(N);
rep(i, N) in(L[i]);
int d = 0;
int count = 0;
rep(i, N) {
d += L[i];
if (d > X)
break;
count++;
}
outl(count);
return 0;
} | #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 <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
//名前
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef map<string, int> msi;
typedef map<string, ll> msll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pllll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<vector<string>> vvs;
typedef vector<vector<bool>> vvb;
//定数
const ll MOD = 1000000007;
const ll INF = 1000000000000000000;
//マクロ
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, e) for (int i = s; i < e; i++)
#define repse(i, s, e) for (int i = s; i <= e; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define in(x) cin >> x
#define outl(x) cout << x << endl
#define out2l(x, y) cout << x << " " << y << endl
//よく使う関数
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
//標準入力をファイルに変更
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
int N, X;
in(N);
in(X);
vi L(N);
rep(i, N) in(L[i]);
int d = 0;
int count = 1;
rep(i, N) {
d += L[i];
if (d > X)
break;
count++;
}
outl(count);
return 0;
} | [
"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 -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
/*MODの割り算の際に
a/＝b;
を
a *= modinv(b,MOD);
とする。
*/
}
const int maxn = 100;
int main() {
int n, x;
cin >> n >> x;
int l[maxn];
int counter = 0;
rep(i, n) { cin >> l[i]; }
int num = 1;
for (int i = 2; i <= n + 1; i++) {
counter = counter + l[i - 1];
if (counter > x)
break;
num++;
}
cout << num << endl;
return 0;
} | #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 -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
/*MODの割り算の際に
a/＝b;
を
a *= modinv(b,MOD);
とする。
*/
}
const int maxn = 100;
int main() {
int n, x;
cin >> n >> x;
int l[maxn];
int counter = 0;
rep(i, n) { cin >> l[i]; }
int num = 1;
for (int i = 1; i <= n; i++) {
counter = counter + l[i - 1];
if (counter > x)
break;
num++;
}
cout << num << endl;
return 0;
} | [
"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)
count++;
else
break;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
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 <= X)
count++;
else
break;
}
cout << count << endl;
}
| [
"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] <= x)
ans++;
else
break;
}
cout << ans << endl;
return 0;
} | #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[i] <= x)
ans++;
else
break;
}
cout << ans << endl;
return 0;
} | [
"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); \
cout.tie(0)
#define MOD 1000000007
void solve() {
ll n, x;
cin >> n >> x;
ll a[n];
ll ans = 0, sum = 0;
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 1; i < n; i++) {
sum += a[i];
if (sum <= x)
ans++;
}
cout << ans + 1;
return;
}
int main() {
fast;
ll q;
q = 1;
// cin>>q;
while (q--)
solve();
return 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); \
cout.tie(0)
#define MOD 1000000007
void solve() {
ll n, x;
cin >> n >> x;
ll a[n];
ll ans = 0, sum = 0;
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++) {
sum += a[i];
if (sum <= x)
ans++;
}
cout << ans + 1;
return;
}
int main() {
fast;
ll q;
q = 1;
// cin>>q;
while (q--)
solve();
return 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 << ans;
} | #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 << endl;
ans++;
}
}
cout << ans;
} | [
"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) {
sum[i] += sum[i - 1] + l[i - 1];
if (sum[i] > x) {
cout << i << endl;
return 0;
}
}
if (sum[n] <= x)
cout << n << endl;
else
cout << 0 << endl;
} | #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) {
sum[i] += sum[i - 1] + l[i - 1];
// cout<<sum[i]<<' ';
if (sum[i] > x) {
cout << i << endl;
return 0;
}
}
if (sum[n] <= x)
cout << n + 1 << endl;
else
cout << 0 << endl;
} | [
"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++;
t += tmp;
}
cout << cnt << endl;
} | #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++;
t += tmp;
}
cout << cnt << endl;
} | [
"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;
return 0;
} | #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;
return 0;
} | [
"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 << endl;
return 0;
} | #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;
return 0;
} | [
"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;
return 0;
} | #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;
return 0;
} | [
"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;
for (int i = 0; i < N; i++) {
z += vec.at(i);
count++;
if (z > X)
break;
}
cout << count << endl;
}
} | #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;
for (int i = 0; i < N; i++) {
z += vec.at(i);
count++;
if (z > X)
break;
}
cout << count << endl;
}
} | [
"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>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define forn(i, a, b) for (int i = (a); i < ll(b); ++i)
#define fo(i, a) forn(i, 0, ll(a))
#define rforn(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ro(i, a) rforn(i, 0, a)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rsz resize
#define ins insert
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifdef CREED
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
const ll INF = 9e18;
ll mod = 1000000007;
inline ll fast_expo(ll base, ll power, ll modulo = mod) {
base %= modulo;
if (base < 0)
base += modulo;
ll x = base, cnt = power, ans = 1;
while (cnt) {
if (cnt & 1)
ans = (ans * x) % modulo;
x = (x * x) % modulo;
cnt >>= 1;
}
return ans;
}
ll takemod(ll a, ll mo) {
a %= mo;
if (a < 0)
a += mo;
return a;
}
// if mod is prime
ll modinv(ll a, ll mo) {
return takemod(fast_expo(takemod(a, mo), mo - 2, mo), mo);
}
// 297586BQ
//=========================CODE STARTS HERE=============================//
int main() {
fast_cin();
ll n;
cin >> n;
ll x, y;
cin >> y;
ll sum = 0;
ll ans = 0;
fo(i, n) {
cin >> x;
sum += x;
if (sum <= x)
ans++;
}
cout << ans << '\n';
return 0;
}
| /*
* 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>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define forn(i, a, b) for (int i = (a); i < ll(b); ++i)
#define fo(i, a) forn(i, 0, ll(a))
#define rforn(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ro(i, a) rforn(i, 0, a)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rsz resize
#define ins insert
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifdef CREED
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
const ll INF = 9e18;
ll mod = 1000000007;
inline ll fast_expo(ll base, ll power, ll modulo = mod) {
base %= modulo;
if (base < 0)
base += modulo;
ll x = base, cnt = power, ans = 1;
while (cnt) {
if (cnt & 1)
ans = (ans * x) % modulo;
x = (x * x) % modulo;
cnt >>= 1;
}
return ans;
}
ll takemod(ll a, ll mo) {
a %= mo;
if (a < 0)
a += mo;
return a;
}
// if mod is prime
ll modinv(ll a, ll mo) {
return takemod(fast_expo(takemod(a, mo), mo - 2, mo), mo);
}
// 297586BQ
//=========================CODE STARTS HERE=============================//
int main() {
fast_cin();
ll n;
cin >> n;
ll x, y;
cin >> y;
ll sum = 0;
ll ans = 1;
fo(i, n) {
cin >> x;
sum += x;
if (sum <= y)
ans++;
}
cout << ans << '\n';
return 0;
}
| [
"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 unsigned long long
#define ld long double
#define pii pair<int, int>
#define piii pair<int, pair<int, int>>
#define pll pair<ll, ll>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
string to_string(string s) { return '"' + s + '"'; }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename T> string to_string(A v) {
bool first = true;
string res = "{";
for (const T &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string((T)x);
}
res += "}";
return res;
}
// add templates here
template <class T> void println(const vector<T> &data) {
cout << to_string<vector<T>, T>(data) << endl;
}
template <class T> void println(const T &data) {
cout << to_string((T)data) << endl;
}
const int MOD = int(1e9 + 7);
const int oo = int(1e9 + 20);
const ll lloo = (ll)(1e18 + 10);
const int N = 1e5 + 10;
vector<int> values;
vector<int> memo(N, -1);
int solve(int d) {
if (d == 1)
return 0;
if (memo[d] != -1)
return memo[d];
memo[d] = solve(d - 1) + values[d - 1];
return memo[d];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
values.resize(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> values[i];
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (solve(i) <= k) {
ans++;
}
}
cout << ans << endl;
return 0;
} | // 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 unsigned long long
#define ld long double
#define pii pair<int, int>
#define piii pair<int, pair<int, int>>
#define pll pair<ll, ll>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
string to_string(string s) { return '"' + s + '"'; }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename T> string to_string(A v) {
bool first = true;
string res = "{";
for (const T &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string((T)x);
}
res += "}";
return res;
}
// add templates here
template <class T> void println(const vector<T> &data) {
cout << to_string<vector<T>, T>(data) << endl;
}
template <class T> void println(const T &data) {
cout << to_string((T)data) << endl;
}
const int MOD = int(1e9 + 7);
const int oo = int(1e9 + 20);
const ll lloo = (ll)(1e18 + 10);
const int N = 1e5 + 10;
vector<int> values;
vector<int> memo(N, -1);
int solve(int d) {
if (d == 1)
return 0;
if (memo[d] != -1)
return memo[d];
memo[d] = solve(d - 1) + values[d - 1];
return memo[d];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
values.resize(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> values[i];
}
int ans = 0;
for (int i = 1; i <= n + 1; ++i) {
if (solve(i) <= k) {
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"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 \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vlli vector<lli>
#define vulli vector<ulli>
#define vchar vector<char>
#define vstr vector<string>
#define vb vector<bool>
#define fst first
#define sec second
#define all(a) (a).begin(), (a).end()
#define srt(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define vpii vector<pair<int, int>>
#define pii pair<int, int>
#define vplli vector<pair<lli, lli>>
#define vvi vector<vector<int>>
#define vvlli vector<vector<lli>>
#define vvpii vector<vector<pair<int, int>>>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define frbig(i, n) for (lli i = 0; i < (n); ++i)
#define fra(i, a, n) for (lli i = a; i < (n); ++i)
#define run(c, s) for (auto c : s)
#define read(n) \
int n; \
cin >> n;
#define readchar(n) \
char n; \
cin >> n;
#define readstr(n) \
string n; \
cin >> n;
#define readarr(a, n) fr(i, n) cin >> a[i];
#define read2(x, y) \
int x, y; \
cin >> x >> y;
#define read2ll(x, y) \
long long int x, y; \
cin >> x >> y;
#define readll(n) \
lli n; \
cin >> n;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define print_array(x) fr(i, x.size()) cout << x[i];
using namespace std;
const lli MOD = 1e9 + 7;
const lli MAXN = 5e4 + 1;
const ld PI = acos(-1);
int main() {
rapgame
// freopen("bridges.in", "r", stdin);
// freopen("bridges.out", "w", stdout);
int t = 1;
// cin>>t;
while (t--) {
read2(n, x);
lli sum = 0, ans = n + 1;
fr(i, n) {
readll(y);
sum += y;
if (sum > x)
ans = i + 1;
}
cout << ans;
}
return 0;
} | /******************************************************************************
рассвет.
*******************************************************************************/
#include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define rapgame \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vlli vector<lli>
#define vulli vector<ulli>
#define vchar vector<char>
#define vstr vector<string>
#define vb vector<bool>
#define fst first
#define sec second
#define all(a) (a).begin(), (a).end()
#define srt(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define vpii vector<pair<int, int>>
#define pii pair<int, int>
#define vplli vector<pair<lli, lli>>
#define vvi vector<vector<int>>
#define vvlli vector<vector<lli>>
#define vvpii vector<vector<pair<int, int>>>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define frbig(i, n) for (lli i = 0; i < (n); ++i)
#define fra(i, a, n) for (lli i = a; i < (n); ++i)
#define run(c, s) for (auto c : s)
#define read(n) \
int n; \
cin >> n;
#define readchar(n) \
char n; \
cin >> n;
#define readstr(n) \
string n; \
cin >> n;
#define readarr(a, n) fr(i, n) cin >> a[i];
#define read2(x, y) \
int x, y; \
cin >> x >> y;
#define read2ll(x, y) \
long long int x, y; \
cin >> x >> y;
#define readll(n) \
lli n; \
cin >> n;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define print_array(x) fr(i, x.size()) cout << x[i];
using namespace std;
const lli MOD = 1e9 + 7;
const lli MAXN = 5e4 + 1;
const ld PI = acos(-1);
int main() {
rapgame
// freopen("bridges.in", "r", stdin);
// freopen("bridges.out", "w", stdout);
int t = 1;
// cin>>t;
while (t--) {
read2ll(n, x);
lli sum = 0, ans = n + 1;
fr(i, n) {
readll(y);
sum += y;
if (sum > x) {
ans = i + 1;
break;
}
}
cout << ans;
}
return 0;
} | [
"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 = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod = 1000000007;
typedef pair<ll, ll> P;
using graph = vector<vector<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) {
a = b;
return true;
}
return false;
}
template <class T> inline bool change(T a, T b) {
if (a > b) {
swap(a, b);
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
//素数判定O(sqrt(N))
bool isp(ll n) {
bool res = true;
if (n == 1)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = false;
break;
}
}
return res;
}
}
const ll cmax = 1000000;
ll fac[cmax], finv[cmax], inv[cmax];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < cmax; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
ll nCk(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
// nのm乗をMODで割ったあまりO(logN)
ll modpow(ll n, ll m, ll MOD) {
ll res = 1;
while (m) {
if (m & 1)
res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
// printf("%.10f\n", N);
/* vector<ll> vec = {1,2,5,6,8,9,10};
cout << binary_search(all(vec),5) << endl; -> true*/
/*
vector<ll> vec = {1,2,5,6,8,9,10};
auto n = upper_bound(all(vec),4);
cout << *n << endl; -> 5*/
// cout << fixed << setprecision(15);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, M;
cin >> N >> M;
vector<ll> vec(N);
vecin(vec);
rep(i, N - 1) vec[i + 1] += vec[i];
ll ans = 0;
rep(i, N) {
if (vec[i] <= M)
ans++;
else
break;
}
cout << ans << endl;
}
| #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 = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod = 1000000007;
typedef pair<ll, ll> P;
using graph = vector<vector<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) {
a = b;
return true;
}
return false;
}
template <class T> inline bool change(T a, T b) {
if (a > b) {
swap(a, b);
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
//素数判定O(sqrt(N))
bool isp(ll n) {
bool res = true;
if (n == 1)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = false;
break;
}
}
return res;
}
}
const ll cmax = 1000000;
ll fac[cmax], finv[cmax], inv[cmax];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < cmax; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
ll nCk(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
// nのm乗をMODで割ったあまりO(logN)
ll modpow(ll n, ll m, ll MOD) {
ll res = 1;
while (m) {
if (m & 1)
res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
// printf("%.10f\n", N);
/* vector<ll> vec = {1,2,5,6,8,9,10};
cout << binary_search(all(vec),5) << endl; -> true*/
/*
vector<ll> vec = {1,2,5,6,8,9,10};
auto n = upper_bound(all(vec),4);
cout << *n << endl; -> 5*/
// cout << fixed << setprecision(15);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, M;
cin >> N >> M;
vector<ll> vec(N);
vecin(vec);
rep(i, N - 1) vec[i + 1] += vec[i];
ll ans = 0;
rep(i, N) {
if (vec[i] <= M)
ans++;
else
break;
}
cout << ans + 1 << endl;
}
| [
"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; ++i) {
uint32_t l;
cin >> l;
L.push_back(l);
}
uint32_t D = 0;
for (uint32_t i = 0; i < N; ++i) {
D = D + L[i];
if (D > X) {
cout << i + 1 << endl;
return;
}
}
cout << N + 1 << endl;
}
int main() {
// making data IO Fast
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
/****************************/
#ifdef DEBUG
int TEST_CASES = 2;
while (TEST_CASES--) {
#endif // DEBBUG
solve();
#ifdef DEBUG
}
#endif // DEBUG
return 0;
}
| #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; ++i) {
uint32_t l;
cin >> l;
L.push_back(l);
}
uint32_t D = 0;
for (uint32_t i = 0; i < N; ++i) {
D = D + L[i];
if (D > X) {
cout << i + 1 << endl;
return;
}
}
cout << N + 1 << endl;
}
int main() {
// making data IO Fast
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
/****************************/
#ifdef DEBUG
int TEST_CASES = 2;
while (TEST_CASES--) {
#endif // DEBBUG
solve();
#ifdef DEBUG
}
#endif // DEBUG
return 0;
}
| [] | 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 (int i = 2; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
cnt++;
}
cout << cnt << endl;
return 0;
} | #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 (int i = 2; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"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 (int i = 2; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
cnt++;
else
break;
}
cout << cnt << endl;
return 0;
} | #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 (int i = 2; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"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)
#define all(x) (x).begin(), (x).end()
//#define repitr(itr, st) for(auto itr = st.begin(); itr != st.end(); ++itr)
#define P_B push_back
#define PO_B pop_back
#define E_B emplace_back
#define M_P make_pair
#define fi first
#define se second
#define debug(x) cout << #x << ": " << x << endl
//#define print(x) printf("%d\n", x)
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
using VI = vector<int>;
using VL = vector<ll>;
using VVI = vector<vector<int>>;
using VVL = vector<vector<ll>>;
// int dx[4] = {1, 0, -1, 0};
// int dy[4] = {0, 1, 0, -1};
// const ll LINF = (ll)1e18 - 1;
// const int INF = 1e9 - 1;
// int:±2*10^9くらい ll:±9*10^18くらい
void Main() {
int N, x, nx = 0, ans = 1;
cin >> N >> x;
VI L(N);
rep(i, N) cin >> L[i];
int s = 0;
while (s <= N) {
nx += L[s];
s++;
if (nx > x)
break;
ans++;
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| #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)
#define all(x) (x).begin(), (x).end()
//#define repitr(itr, st) for(auto itr = st.begin(); itr != st.end(); ++itr)
#define P_B push_back
#define PO_B pop_back
#define E_B emplace_back
#define M_P make_pair
#define fi first
#define se second
#define debug(x) cout << #x << ": " << x << endl
//#define print(x) printf("%d\n", x)
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
using VI = vector<int>;
using VL = vector<ll>;
using VVI = vector<vector<int>>;
using VVL = vector<vector<ll>>;
// int dx[4] = {1, 0, -1, 0};
// int dy[4] = {0, 1, 0, -1};
// const ll LINF = (ll)1e18 - 1;
// const int INF = 1e9 - 1;
// int:±2*10^9くらい ll:±9*10^18くらい
void Main() {
int N, x, nx = 0, ans = 1;
cin >> N >> x;
VI L(N);
rep(i, N) cin >> L[i];
int s = 0;
while (s < N) {
nx += L[s];
s++;
if (nx > x)
break;
ans++;
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| [
"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 << ans << "\n";
} | #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 << ans << "\n";
} | [
"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++;
s += l[i];
}
}
cout << c << endl;
} | #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++;
s += l[i];
} else
break;
}
cout << c << endl;
} | [
"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 main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, x;
cin >> n >> x;
int cnt = 1;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
int now = 0;
for (int i = 1; i < n; i++) {
if (now + a[i - 1] <= x) {
cnt++;
now += a[i - 1];
} else {
break;
}
}
cout << cnt;
return 0;
} | #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 main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, x;
cin >> n >> x;
int cnt = 1;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
int now = 0;
for (int i = 1; i < n + 1; i++) {
if (now + a[i - 1] <= x) {
cnt++;
now += a[i - 1];
} else {
break;
}
}
cout << cnt;
return 0;
} | [
"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 main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, x;
cin >> n >> x;
int cnt = 1;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
int now = 0;
for (int i = 1; i < n; i++) {
if (now + a[i] <= x) {
cnt++;
now += a[i];
} else {
break;
}
}
cout << cnt;
return 0;
} | #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 main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, x;
cin >> n >> x;
int cnt = 1;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
int now = 0;
for (int i = 1; i < n + 1; i++) {
if (now + a[i - 1] <= x) {
cnt++;
now += a[i - 1];
} else {
break;
}
}
cout << cnt;
return 0;
} | [
"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) {
printf("%d", i);
return 0;
}
}
if (sum < x) {
printf("%d", n + 1);
}
return 0;
} | #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) {
printf("%d", i);
return 0;
}
}
if (sum <= x) {
printf("%d", n + 1);
}
return 0;
} | [
"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];
}
ll d = 0;
int cnt = 1;
for (int i = 0; i < N - 1; i++) {
d += L[i];
if (d > X)
break;
cnt++;
}
cout << cnt << endl;
return 0;
} | #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];
}
ll d = 0;
int cnt = 1;
for (int i = 0; i < N; i++) {
d += L[i];
if (d > X)
break;
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"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"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, X;
cin >> N >> X;
vector<int> c(N);
rep(i, N) { cin >> c[i]; }
ll ans = 0;
vector<int> sum(N + 1, -1);
sum[0] = 0;
repi(i, 1, N + 1) {
ans++;
sum[i] = sum[i - 1] + c[i - 1];
if (sum[i] > X) {
break;
}
}
if (sum[N] != 0 && sum[N] <= X)
ans++;
cout << ans << endl;
} | #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"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, X;
cin >> N >> X;
vector<int> c(N);
rep(i, N) { cin >> c[i]; }
ll ans = 0;
vector<int> sum(N + 1, -1);
sum[0] = 0;
repi(i, 1, N + 1) {
ans++;
sum[i] = sum[i - 1] + c[i - 1];
if (sum[i] > X) {
break;
}
}
if (sum[N] != -1 && sum[N] <= X)
ans++;
cout << ans << endl;
} | [
"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] = v[i - 1] + a[i];
}
for (int i = 0; i < v.size(); i++) {
if (v[i] > m) {
cout << i << endl;
return 0;
} /*if(v[i] == m){
cout<<i<<endl;
return 0;
}*/
}
cout << n << endl;
return 0;
} | // 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] = v[i - 1] + a[i];
}
for (int i = 0; i < v.size(); i++) {
if (v[i] > m) {
cout << i << endl;
return 0;
} /*if(v[i] == m){
cout<<i<<endl;
return 0;
}*/
}
cout << n + 1 << endl;
return 0;
} | [
"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[i - 1] + a[i];
}
for (int i = 0; i < v.size(); i++) {
if (v[i] > m) {
cout << i << endl;
return 0;
} /*if(v[i] == m){
cout<<i<<endl;
return 0;
}*/
}
cout << n << endl;
return 0;
} | // 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] = v[i - 1] + a[i];
}
for (int i = 0; i < v.size(); i++) {
if (v[i] > m) {
cout << i << endl;
return 0;
} /*if(v[i] == m){
cout<<i<<endl;
return 0;
}*/
}
cout << n + 1 << endl;
return 0;
} | [
"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;
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
int p = 0;
int cnt = 1;
rep(i, n + 1) {
p += l[i];
if (p <= x)
cnt++;
}
put(cnt)
return 0;
} | #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;
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) cin >> l[i];
int p = 0;
int cnt = 1;
rep(i, n) {
p += l[i];
if (p <= x)
cnt++;
else
break;
}
put(cnt)
return 0;
} | [
"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++) {
if (D.at(i) <= X) {
count++;
}
}
cout << count << endl;
} | #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++) {
if (D.at(i) <= X) {
count++;
}
}
cout << count << endl;
} | [
"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 (D.at(i) <= X) {
count++;
}
}
cout << count << endl;
} | #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++) {
if (D.at(i) <= X) {
count++;
}
}
cout << count << endl;
} | [
"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] = D[i] + x;
}
int ans = 0;
rep(i, N) {
if (D[i] <= X)
ans++;
}
cout << ans << endl;
}
| #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] = D[i] + x;
}
int ans = 0;
rep(i, N + 1) {
if (D[i] <= X)
ans++;
}
cout << ans << endl;
}
| [
"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 << endl;
return 0;
} | #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 << endl;
return 0;
} | [
"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(i, n) {
if (D.at(i) <= x) {
count++;
}
}
cout << count << endl;
return 0;
} | #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(i, n + 1) {
if (D.at(i) <= x) {
count++;
}
}
cout << count << endl;
return 0;
} | [
"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 // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Z class
// OTHER
// xの二乗を返す (関数テンプレート版)
template <typename T> T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
// loop
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
// vector
#define ALL(x) x.begin(), x.end()
// output
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) {
cout << a << ' ';
pr(b);
}
int ans = 0;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n), d(n + 1);
rep(i, n) cin >> l[i];
for (int i = 1; i <= n + 1; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
ans++;
}
pr(ans + 1);
return 0;
}
| #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 // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Z class
// OTHER
// xの二乗を返す (関数テンプレート版)
template <typename T> T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
// loop
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
// vector
#define ALL(x) x.begin(), x.end()
// output
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) {
cout << a << ' ';
pr(b);
}
int ans = 0;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n), d(n + 1);
rep(i, n) cin >> l[i];
for (int i = 1; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
ans++;
}
pr(ans + 1);
return 0;
}
| [
"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;
}
cout << ans << endl;
} | #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;
}
cout << ans << endl;
} | [
"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 << ans << endl;
}
| #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 << ans << endl;
}
| [
"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 << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N + 1);
L.at(0) = 0;
for (int i = 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++;
}
}
cout << ans << endl;
}
| [
"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++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1);
l.at(0) = 0;
for (int i = 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++;
}
}
cout << ans << endl;
}
| [
"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) {
cout << i << endl;
return 0;
}
now += l;
}
cout << n << endl;
return 0;
} | /*
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) {
cout << i << endl;
return 0;
}
now += l;
}
cout << n + 1 << endl;
return 0;
} | [
"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[count];
count++;
} else
break;
}
print(count);
} | #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[count];
count++;
} else {
count++;
break;
}
}
print(count);
} | [
"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 > 0; i--)
#define repi(i, x) \
for (auto i = (x).begin(), i##_fin = (x).end(); i != i##_fin; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a) ? "Yes" : "No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int, int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n, x;
int ans = 0;
cin >> n >> x;
int at = 0;
int l;
rep(i, n) {
cin >> l;
at += l;
if (at <= x) {
ans++;
}
}
cout << ans << endl;
}
| #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 > 0; i--)
#define repi(i, x) \
for (auto i = (x).begin(), i##_fin = (x).end(); i != i##_fin; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a) ? "Yes" : "No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int, int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n, x;
int ans = 0;
cin >> n >> x;
int at = 0;
int l;
rep(i, n) {
cin >> l;
at += l;
if (at <= x) {
ans++;
}
}
cout << ans + 1 << endl;
}
| [
"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 << endl;
return 0;
}
t++;
}
cout << t + 1 << endl;
return 0;
} | #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 << endl;
return 0;
}
t++;
}
cout << t << endl;
return 0;
}
| [
"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 ll;
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef pair<long long, long long> P;
// typedef pair<long long,P> P1;
// typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
//#define INF 100000000000000000//19桁
#define INF 1e18 + 5 // 19桁
#define mod 1000000007
#define fi first
#define se second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define REP(i, n, x) for (long long i = n; i < x; i++)
#define REPN(i, n, x) for (long long i = n + 1; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define rrep(i, x) for (long long i = x - 1; i >= 0; i--)
#define rrepn(i, x) for (long long i = x; i > 1; i--)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ALL(v) (v).begin(), (v).end()
//#define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define popcount __builtin_popcount
const string MINUSINF = "-";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void chmax(string &a, string b) {
if (a == MINUSINF)
a = b;
else if (a.size() < b.size())
a = b;
else if (a.size() == b.size()) {
if (a < b)
a = b;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define pr printf
#define re return
#define CASET \
int ___T, case_n = 1; \
scanf("%d ", &___T); \
while (___T-- > 0)
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
stack<long long> sta;
queue<long long> que;
deque<long long> dque;
set<string> s_set;
long long sum, sum1, sum2, sum3, sum4;
long long flg, flg1, flg2, flg3, cnt, cnt1, cnt2, cnt3, cnt4;
long long wk, wk1, wk2, wk3, wk4;
long long ans;
double dsum, dsum1, dsum2, dsum3, dsum4;
double dcnt, dcnt1, dcnt2, dcnt3, dcnt4;
double dwk, dwk1, dwk2, dwk3, dwk4;
double dans;
double dmax, dmax1;
double dmin, dmin1;
// bool f;
long long weight[110],
value[110]; // 品物の個数は 100 個なので少し余裕持たせてサイズ 110 に
// ll a[100010][3]; // a[i], b[i], c[i] をそれぞれまとめて a[i][0], a[i][1],
// a[i][2] にしてしまう
long long n, h[100005];
vector<long long> p, c;
int vis[200001];
vector<string> fi;
int Left[2100][2100], Right[2100][2100], Up[2100][2100], Down[2100][2100];
long long match[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<long long> box;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// 約数列挙
vector<long long> calc_divisor(long long n) {
vector<long long> res;
for (long long i = 1LL; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
long long j = n / i;
if (j != i)
res.push_back(j);
}
}
sort(res.begin(), res.end());
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long max, max1;
long long min, min1;
cin >> N >> M;
vector<ll> v(N + 1);
vector<ll> w(N + 1);
rep(i, N) { cin >> v[i]; }
rep(i, N) { w[i] = 0; }
rep(i, N + 1) {
if (i == 0) {
cnt++;
} else {
w[i] = v[i - 1] + w[i - 1];
cnt++;
}
}
rep(i, N) {
if (w[i] > M) {
pr("%lld", i);
re 0;
}
}
pr("%lld", N);
}
| 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 ll;
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef pair<long long, long long> P;
// typedef pair<long long,P> P1;
// typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
//#define INF 100000000000000000//19桁
#define INF 1e18 + 5 // 19桁
#define mod 1000000007
#define fi first
#define se second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define REP(i, n, x) for (long long i = n; i < x; i++)
#define REPN(i, n, x) for (long long i = n + 1; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define rrep(i, x) for (long long i = x - 1; i >= 0; i--)
#define rrepn(i, x) for (long long i = x; i > 1; i--)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ALL(v) (v).begin(), (v).end()
//#define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define popcount __builtin_popcount
const string MINUSINF = "-";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void chmax(string &a, string b) {
if (a == MINUSINF)
a = b;
else if (a.size() < b.size())
a = b;
else if (a.size() == b.size()) {
if (a < b)
a = b;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define pr printf
#define re return
#define CASET \
int ___T, case_n = 1; \
scanf("%d ", &___T); \
while (___T-- > 0)
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
stack<long long> sta;
queue<long long> que;
deque<long long> dque;
set<string> s_set;
long long sum, sum1, sum2, sum3, sum4;
long long flg, flg1, flg2, flg3, cnt, cnt1, cnt2, cnt3, cnt4;
long long wk, wk1, wk2, wk3, wk4;
long long ans;
double dsum, dsum1, dsum2, dsum3, dsum4;
double dcnt, dcnt1, dcnt2, dcnt3, dcnt4;
double dwk, dwk1, dwk2, dwk3, dwk4;
double dans;
double dmax, dmax1;
double dmin, dmin1;
// bool f;
long long weight[110],
value[110]; // 品物の個数は 100 個なので少し余裕持たせてサイズ 110 に
// ll a[100010][3]; // a[i], b[i], c[i] をそれぞれまとめて a[i][0], a[i][1],
// a[i][2] にしてしまう
long long n, h[100005];
vector<long long> p, c;
int vis[200001];
vector<string> fi;
int Left[2100][2100], Right[2100][2100], Up[2100][2100], Down[2100][2100];
long long match[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<long long> box;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// 約数列挙
vector<long long> calc_divisor(long long n) {
vector<long long> res;
for (long long i = 1LL; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
long long j = n / i;
if (j != i)
res.push_back(j);
}
}
sort(res.begin(), res.end());
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long max, max1;
long long min, min1;
cin >> N >> M;
vector<ll> v(N + 1);
vector<ll> w(N + 1);
rep(i, N) { cin >> v[i]; }
rep(i, N) { w[i] = 0; }
rep(i, N + 1) {
if (i == 0) {
cnt++;
} else {
w[i] = v[i - 1] + w[i - 1];
cnt++;
}
}
rep(i, N + 1) {
if (w[i] > M) {
pr("%lld", i);
re 0;
}
}
pr("%lld", N + 1);
}
| [
"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, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
signed main() {
int n, x;
cin >> n >> x;
vi d(n + 1);
d[0] = 0;
int ans = 1;
REP(i, n) {
d[i] = d[i - 1] + read();
if (d[i] <= x)
ans++;
}
print(ans);
}
| #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, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
signed main() {
int n, x;
cin >> n >> x;
vi d(n + 1);
d[0] = 0;
int ans = 1;
FOR(i, 1, n + 1) {
d[i] = d[i - 1] + read();
if (d[i] <= x)
ans++;
}
print(ans);
}
| [
"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, n) FOR((i), 0, (n))
#define REPe(i, n) FORe((i), 1, (n))
#define REPo(i, n) FORe((i), 0, (n))
#define rREP(i, n) rFOR((i), 0, (n))
#define rREPe(i, n) rFORe((i), 1, (n))
#define rREPo(i, n) rFORe((i), 0, (n))
#define rep(i, n) FOR((i), 0, (n))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define dup(x, y) (((x) + (y)-1) / (y))
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vs = vector<string>;
using vp = vector<P>;
using vt = vector<T>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, x;
cin >> n >> x;
vi l(n);
REP(i, n) cin >> l[i];
int d = 0;
int ans = n + 1;
REP(i, n) {
if (d > x) {
ans = i;
break;
}
d += l[i];
}
cout << ans << endl;
return 0;
} | #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, n) FOR((i), 0, (n))
#define REPe(i, n) FORe((i), 1, (n))
#define REPo(i, n) FORe((i), 0, (n))
#define rREP(i, n) rFOR((i), 0, (n))
#define rREPe(i, n) rFORe((i), 1, (n))
#define rREPo(i, n) rFORe((i), 0, (n))
#define rep(i, n) FOR((i), 0, (n))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define dup(x, y) (((x) + (y)-1) / (y))
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vs = vector<string>;
using vp = vector<P>;
using vt = vector<T>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, x;
cin >> n >> x;
vi l(n + 1);
REP(i, n) cin >> l[i];
int d = 0;
int ans = n + 1;
REP(i, n + 1) {
if (d > x) {
ans = i;
break;
}
d += l[i];
}
cout << ans << endl;
return 0;
} | [
"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(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d, m, n, maxi = 0, f = 0, mini = INF, sum = 0;
string str1, str2;
cin >> n >> a;
vector<ll> v(n);
rep(i, n) cin >> v[i];
rep(i, n) {
if (sum <= a)
f++;
sum += v[i];
}
cout << f << endl;
return 0;
}
| // 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(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d, m, n, maxi = 0, f = 0, mini = INF, sum = 0;
string str1, str2;
cin >> n >> a;
vector<ll> v(n + 1);
rep(i, n) cin >> v[i];
rep(i, n + 1) {
if (sum <= a)
f++;
sum += v[i];
}
cout << f << endl;
return 0;
}
| [
"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] + l[i];
if (d[i] <= x)
cnt++;
}
cout << cnt << '\n';
return 0;
} | #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] + l[i];
if (d[i] <= x)
cnt++;
}
cout << cnt << '\n';
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 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
break;
}
cout << count << 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];
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++;
} else
break;
}
cout << count << endl;
return 0;
} | [
"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;
}
}
ans++;
cout << ans << endl;
return 0;
} | #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;
}
}
ans++;
cout << ans << endl;
return 0;
} | [
"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;
}
}
ans++;
cout << ans << endl;
return 0;
} | #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;
}
}
ans++;
cout << ans << endl;
return 0;
} | [
"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++;
d += a;
} else {
break;
}
}
cout << ans << endl;
}
| #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++;
d += a;
} else {
break;
}
}
cout << ans << endl;
} | [
"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>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-14)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} com(10);
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int n, x;
cin >> n >> x;
VE a(n);
rep(i, n) cin >> a[i];
VE d(n + 1);
rep(i, n) d[i + 1] = d[i] + a[i];
int ans = 0;
rep(i, n) {
if (d[i] <= x) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #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>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-14)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} com(10);
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int n, x;
cin >> n >> x;
VE a(n);
rep(i, n) cin >> a[i];
VE d(n + 1);
rep(i, n) d[i + 1] = d[i] + a[i];
int ans = 0;
rep(i, n + 1) {
if (d[i] <= x) {
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"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 + 7;
using namespace std;
typedef long long ll;
map<ll, int> mp;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n, x;
cin >> n >> x;
vector<int> a(n);
int sum = 0;
int counter = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (sum >= x)
break;
else
counter++;
}
cout << counter << endl;
return 0;
} | #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 + 7;
using namespace std;
typedef long long ll;
map<ll, int> mp;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n, x;
cin >> n >> x;
vector<int> a(n);
int sum = 0;
int counter = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (sum > x)
break;
else
counter++;
}
cout << counter << endl;
return 0;
}
| [
"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);
cnt++;
}
cout << cnt << endl;
}
| #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;
}
D += L.at(cnt);
cnt++;
}
cout << cnt << endl;
}
| [
"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.