problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p03000 | #include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int d[a];
int e;
int ans;
ans = 1;
for (int i = 0; i < a; i++) {
cin >> d[i];
e = e + d[i];
if (e <= b) {
ans = ans + 1;
}
}
cout << ans << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int d[a];
int e;
e = 0;
int ans;
ans = 1;
for (int i = 0; i < a; i++) {
cin >> d[i];
e = e + d[i];
if (e <= b) {
ans = ans + 1;
}
}
cout << ans << '\n';
return 0;
} | [
"assignment.add"
] | 813,953 | 813,954 | u927933718 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int d[a];
int e;
e = 0;
int ans;
ans = 1;
for (int i = 0; i < a + 1; i++) {
cin >> d[i];
e = e + d[i];
if (e < b) {
ans = ans + 1;
}
}
cout << ans << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int d[a];
int e;
e = 0;
int ans;
ans = 1;
for (int i = 0; i < a; i++) {
cin >> d[i];
e = e + d[i];
if (e <= b) {
ans = ans + 1;
}
}
cout << ans << '\n';
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,955 | 813,954 | u927933718 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int d[a];
int e;
int ans;
ans = 1;
for (int i = 0; i < a; i++) {
cin >> d[i];
e = e + d[i];
if (e < b) {
ans = ans + 1;
}
}
cout << ans << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int d[a];
int e;
e = 0;
int ans;
ans = 1;
for (int i = 0; i < a; i++) {
cin >> d[i];
e = e + d[i];
if (e <= b) {
ans = ans + 1;
}
}
cout << ans << '\n';
return 0;
} | [
"assignment.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,956 | 813,954 | u927933718 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int sum = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
sum += vec.at(i);
if (X < sum) {
cout << i + 1 << endl;
break;
}
}
if (sum <= X)
cout << N;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int sum = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
sum += vec.at(i);
if (X < sum) {
cout << i + 1 << endl;
break;
}
}
if (sum <= X)
cout << N + 1;
} | [
"expression.operation.binary.add"
] | 813,975 | 813,976 | u341447450 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int sum = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
sum += vec.at(i);
if (X < sum) {
cout << i + 1 << endl;
break;
}
}
if (sum <= X)
cout << N;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int sum = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
sum += vec.at(i);
if (X < sum) {
cout << i + 1 << endl;
break;
}
}
if (sum <= X)
cout << N + 1;
} | [
"expression.operation.binary.add"
] | 813,977 | 813,976 | u341447450 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int sum = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
sum += vec.at(i);
if (X < sum) {
cout << i << endl;
break;
}
}
if (sum <= X)
cout << N;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int sum = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
sum += vec.at(i);
if (X < sum) {
cout << i + 1 << endl;
break;
}
}
if (sum <= X)
cout << N + 1;
} | [
"expression.operation.binary.add"
] | 813,978 | 813,976 | u341447450 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int n, x, i, j, k;
cin >> n >> x;
int l[100];
int dd = 0;
int count = 0;
// int b[200002];
for (i = 0; i < n; i++) {
cin >> l[i];
}
for (i = 0; i < n; i++) {
if (dd <= x)
count++;
dd += l[i];
}
cout << count;
} | #include <iostream>
using namespace std;
int main() {
int n, x, i, j, k;
cin >> n >> x;
int l[100];
int dd = 0;
int count = 0;
// int b[200002];
for (i = 0; i < n; i++) {
cin >> l[i];
}
for (i = 0; i <= n; i++) {
if (dd <= x)
count++;
dd += l[i];
}
cout << count;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 813,993 | 813,994 | u049736167 | cpp |
p03000 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#pragma GCC optimize("Ofast")
#pragma target("sse", "sse1")
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 gen(43);
int x, n, ans;
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#else
// freopen("rps2.in", "r", stdin);
// freopen("rps2.out", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> x;
ll t = 0;
for (int i = 0; i < n; i++) {
ll d;
cin >> d;
t += d;
ans += (t >= x);
}
cout << ans;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#pragma GCC optimize("Ofast")
#pragma target("sse", "sse1")
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 gen(43);
int x, n, ans = 1;
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#else
// freopen("rps2.in", "r", stdin);
// freopen("rps2.out", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> x;
ll t = 0;
for (int i = 0; i < n; i++) {
ll d;
cin >> d;
t += d;
ans += (t <= x);
}
cout << ans;
return 0;
} | [
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 813,995 | 813,996 | u754233329 | cpp |
p03000 | #include <iostream>
using namespace std;
int L[110];
long long int D[110];
int main() {
int N, X;
cin >> N >> X;
for (int i = 1; i <= N; i++)
cin >> L[i];
for (int i = 1; i <= (N + 1); i++) {
if (i == 1)
D[i] = 0;
else
D[i] = D[i - 1] + L[i - 1];
}
int cnt = 0;
for (int i = 1; i <= N; i++) {
if (D[i] <= X)
cnt++;
else
break;
}
cout << cnt << endl;
return 0;
}
| #include <iostream>
using namespace std;
int L[110];
long long int D[110];
int main() {
int N, X;
cin >> N >> X;
for (int i = 1; i <= N; i++)
cin >> L[i];
for (int i = 2; i <= (N + 1); i++) {
if (i == 1)
D[i] = 0;
else
D[i] = D[i - 1] + L[i - 1];
}
int cnt = 0;
for (int i = 1; i <= (N + 1); i++) {
if (D[i] <= X)
cnt++;
else
break;
}
cout << cnt << 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"
] | 813,997 | 813,998 | u474377871 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
uint32_t N, X, *L;
cin >> N >> X;
L = new uint32_t[N + 1];
uint32_t tmp;
L[0] = 0;
for (uint32_t i = 0; i < N; ++i) {
cin >> tmp;
L[i + 1] = L[i] + tmp;
}
uint32_t res = 0;
for (uint32_t i = 0; i < N + 1; ++i) {
if (L[i] < X)
++res;
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
uint32_t N, X, *L;
cin >> N >> X;
L = new uint32_t[N + 1];
uint32_t tmp;
L[0] = 0;
for (uint32_t i = 0; i < N; ++i) {
cin >> tmp;
L[i + 1] = L[i] + tmp;
}
uint32_t res = 0;
for (uint32_t i = 0; i < N + 1; ++i) {
if (L[i] <= X)
++res;
}
cout << res << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 813,999 | 814,000 | u846796522 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
typedef long long lint;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep0(i, n) rep(i, 0, n)
int main(void) {
ios::sync_with_stdio(false);
int N, X, i, j, k, length;
cin >> N >> X;
int L[N];
k = 1;
rep0(i, N) { cin >> L[i]; }
length = 0;
for (i = 0; i < N; i++) {
length += L[i];
if (X >= length) {
k += 1;
break;
}
}
cout << k;
return 0;
}
// sort Ｎ個の配列a
// sort(a, a + N); //昇順
// sort(a, a + N, greater<int>()); //降順
////最大公約数（ユークリッドの互除法利用）
// int gcd(int a, int b) {
// if (a == 0) return b;
// if (b == 0) return a;
// int m = max(a, b);
// int n = min(a, b);
// if (m%n == 0) return n;
// else return gcd(n, m%n);
//
//}
//
////最小公倍数
// int lca(int a, int b) {
// if (a == 0) return 0;
// if (b == 0) return 0;
// return a * b / gcm(a, b);
//}
//
////n^k(整数)
// int pow_int(int n, int k) {
// int re = 1;
// for (int i = 0; i < k; i++) re *= n;
// return re;
//}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
typedef long long lint;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep0(i, n) rep(i, 0, n)
int main(void) {
ios::sync_with_stdio(false);
int N, X, i, j, k, length;
cin >> N >> X;
int L[N];
k = 1;
rep0(i, N) { cin >> L[i]; }
length = 0;
for (i = 0; i < N; i++) {
length += L[i];
if (X >= length) {
k += 1;
}
}
cout << k;
return 0;
}
// sort Ｎ個の配列a
// sort(a, a + N); //昇順
// sort(a, a + N, greater<int>()); //降順
////最大公約数（ユークリッドの互除法利用）
// int gcd(int a, int b) {
// if (a == 0) return b;
// if (b == 0) return a;
// int m = max(a, b);
// int n = min(a, b);
// if (m%n == 0) return n;
// else return gcd(n, m%n);
//
//}
//
////最小公倍数
// int lca(int a, int b) {
// if (a == 0) return 0;
// if (b == 0) return 0;
// return a * b / gcm(a, b);
//}
//
////n^k(整数)
// int pow_int(int n, int k) {
// int re = 1;
// for (int i = 0; i < k; i++) re *= n;
// return re;
//}
| [] | 814,003 | 814,004 | u809278162 | cpp |
p03000 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
int X;
cin >> N;
cin >> X;
int L[N];
for (int i = 0; i < N; i++)
cin >> L[i];
int D[N + 1];
D[0] = 0;
int x = 0;
while (D[x] <= X && x < N) {
x++;
D[x] = D[x - 1] + L[x - 1];
}
cout << x;
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
int X;
cin >> N;
cin >> X;
int L[N];
for (int i = 0; i < N; i++)
cin >> L[i];
int D[N + 2];
D[0] = 0;
int x = 0;
while (D[x] <= X && x < N + 1) {
x++;
D[x] = D[x - 1] + L[x - 1];
}
cout << x;
} | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 814,005 | 814,006 | u137051876 | cpp |
p03000 | #include <iostream>
using namespace std;
int main(void) {
int n, x;
int l;
int cnt = 1;
cin >> n;
cin >> x;
int i = 0;
while ((i < n) && (x >= 0)) {
cin >> l;
x -= l;
cnt += 1;
i++;
}
if (x >= 0)
cnt++;
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n, x;
int l;
int cnt = 0;
cin >> n;
cin >> x;
int i = 0;
while ((i < n) && (x >= 0)) {
cin >> l;
x -= l;
cnt += 1;
i++;
}
if (x >= 0) {
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 814,007 | 814,008 | u810075828 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
//////////////////
int N, X, number = 0;
cin >> N >> X;
vector<int> L(N), D(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
for (int i = 0; i < N - 1; i++) {
D.at(0) = 0;
D.at(i + 1) = D.at(i) + L.at(i);
}
for (int i = 0; i < N; i++) {
if (D.at(i) <= X) {
number += 1;
}
}
cout << number << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
//////////////////
int N, X, number = 0;
cin >> N >> X;
vector<int> L(N), D(N + 1);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
for (int i = 0; i < N; i++) {
D.at(0) = 0;
D.at(i + 1) = D.at(i) + L.at(i);
}
for (int i = 0; i <= N; i++) {
if (D.at(i) <= X) {
number += 1;
}
}
cout << number << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,009 | 814,010 | u095894956 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int a, b, c[100000], d, e;
cin >> a >> b;
d = 0;
e = 1;
for (int i = 0; i < a; i++) {
cin >> c[i];
c[i] += d;
if (d <= b) {
e++;
}
}
cout << e;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c[100000], d, e;
cin >> a >> b;
d = 0;
e = 1;
for (int i = 0; i < a; i++) {
cin >> c[i];
d += c[i];
if (d <= b) {
e++;
}
}
cout << e;
}
| [
"assignment.change"
] | 814,011 | 814,012 | u661845689 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP1(i, n) for (long long i = 1; i <= n; i++)
#define PER(i, n) for (long long i = ((n)-1); i >= 0; i--)
#define PER1(i, n) for (long long i = (n); i > 0; i--)
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define FORE(i, a, b) for (long long i = (a); i <= (b); i++)
#define ITE(arr) for (auto ite = (arr).begin(); ite != (arr).end(); ite++)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define YNPRT(b) cout << ((b) ? "Yes" : "No") << endl
#define REV(arr) reverse(ALL(arr))
#define PRT(a) cout << a << endl;
#define PRTLST(arr, num) REP(_i, num) cout << _i << " - " << arr[_i] << endl;
#define PRTLST2(arr2, d1, d2) \
REP(_i, d1) \
REP(_j, d2) cout << _i << "," << _j << " : " << arr2[_i][_j] << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int INF_INT = 2147483647;
const ll INF_LL = 9223372036854775807LL;
const ull INF_ULL = 18446744073709551615Ull;
const ll P = 92540646808111039LL;
const int Move[4][2] = {-1, 0, 1, 0, 0, 1, 0, -1};
const int Move_[8][2] = {-1, -1, -1, 0, -1, 1, 0, -1, 0, 1, 1, -1, 1, 0, 1, 1};
//---------------------
#define MAXN 100
//---------------------
ll n, x, l[MAXN];
ll jumppoint[MAXN + 5];
ll ret = -1;
int main() {
cin >> n >> x;
REP(i, MAXN + 5) jumppoint[i] = 100000;
REP(i, n) { cin >> l[i]; }
jumppoint[0] = 0;
REP1(i, n) { jumppoint[i] = jumppoint[i - 1] + l[i - 1]; }
// PRTLST(jumppoint,n+1);
REP1(i, n) {
if (jumppoint[i] >= x) {
ret = i;
break;
}
}
if (ret < 0)
ret = n;
cout << ret << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP1(i, n) for (long long i = 1; i <= n; i++)
#define PER(i, n) for (long long i = ((n)-1); i >= 0; i--)
#define PER1(i, n) for (long long i = (n); i > 0; i--)
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define FORE(i, a, b) for (long long i = (a); i <= (b); i++)
#define ITE(arr) for (auto ite = (arr).begin(); ite != (arr).end(); ite++)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define YNPRT(b) cout << ((b) ? "Yes" : "No") << endl
#define REV(arr) reverse(ALL(arr))
#define PRT(a) cout << a << endl;
#define PRTLST(arr, num) REP(_i, num) cout << _i << " - " << arr[_i] << endl;
#define PRTLST2(arr2, d1, d2) \
REP(_i, d1) \
REP(_j, d2) cout << _i << "," << _j << " : " << arr2[_i][_j] << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int INF_INT = 2147483647;
const ll INF_LL = 9223372036854775807LL;
const ull INF_ULL = 18446744073709551615Ull;
const ll P = 92540646808111039LL;
const int Move[4][2] = {-1, 0, 1, 0, 0, 1, 0, -1};
const int Move_[8][2] = {-1, -1, -1, 0, -1, 1, 0, -1, 0, 1, 1, -1, 1, 0, 1, 1};
//---------------------
#define MAXN 100
//---------------------
ll n, x, l[MAXN];
ll jumppoint[MAXN + 5];
ll ret = -1;
int main() {
cin >> n >> x;
REP(i, MAXN + 5) jumppoint[i] = 100000;
REP(i, n) { cin >> l[i]; }
jumppoint[0] = 0;
REP1(i, n) { jumppoint[i] = jumppoint[i - 1] + l[i - 1]; }
// PRTLST(jumppoint,n+1);
REP1(i, n) {
if (jumppoint[i] > x) {
ret = i;
break;
}
}
if (ret < 0)
ret = n + 1;
cout << ret << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 814,015 | 814,016 | u786318703 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP1(i, n) for (long long i = 1; i <= n; i++)
#define PER(i, n) for (long long i = ((n)-1); i >= 0; i--)
#define PER1(i, n) for (long long i = (n); i > 0; i--)
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define FORE(i, a, b) for (long long i = (a); i <= (b); i++)
#define ITE(arr) for (auto ite = (arr).begin(); ite != (arr).end(); ite++)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define YNPRT(b) cout << ((b) ? "Yes" : "No") << endl
#define REV(arr) reverse(ALL(arr))
#define PRT(a) cout << a << endl;
#define PRTLST(arr, num) REP(_i, num) cout << _i << " - " << arr[_i] << endl;
#define PRTLST2(arr2, d1, d2) \
REP(_i, d1) \
REP(_j, d2) cout << _i << "," << _j << " : " << arr2[_i][_j] << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int INF_INT = 2147483647;
const ll INF_LL = 9223372036854775807LL;
const ull INF_ULL = 18446744073709551615Ull;
const ll P = 92540646808111039LL;
const int Move[4][2] = {-1, 0, 1, 0, 0, 1, 0, -1};
const int Move_[8][2] = {-1, -1, -1, 0, -1, 1, 0, -1, 0, 1, 1, -1, 1, 0, 1, 1};
//---------------------
#define MAXN 100
//---------------------
ll n, x, l[MAXN];
ll jumppoint[MAXN + 5];
ll ret = -1;
int main() {
cin >> n >> x;
REP(i, MAXN + 5) jumppoint[i] = 100000;
REP(i, n) { cin >> l[i]; }
jumppoint[0] = 0;
REP1(i, n) { jumppoint[i] = jumppoint[i - 1] + l[i - 1]; }
// PRTLST(jumppoint,n+1);
REP1(i, n) {
if (jumppoint[i] > x) {
ret = i;
break;
}
}
if (ret < 0)
ret = n;
cout << ret << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP1(i, n) for (long long i = 1; i <= n; i++)
#define PER(i, n) for (long long i = ((n)-1); i >= 0; i--)
#define PER1(i, n) for (long long i = (n); i > 0; i--)
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define FORE(i, a, b) for (long long i = (a); i <= (b); i++)
#define ITE(arr) for (auto ite = (arr).begin(); ite != (arr).end(); ite++)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define YNPRT(b) cout << ((b) ? "Yes" : "No") << endl
#define REV(arr) reverse(ALL(arr))
#define PRT(a) cout << a << endl;
#define PRTLST(arr, num) REP(_i, num) cout << _i << " - " << arr[_i] << endl;
#define PRTLST2(arr2, d1, d2) \
REP(_i, d1) \
REP(_j, d2) cout << _i << "," << _j << " : " << arr2[_i][_j] << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int INF_INT = 2147483647;
const ll INF_LL = 9223372036854775807LL;
const ull INF_ULL = 18446744073709551615Ull;
const ll P = 92540646808111039LL;
const int Move[4][2] = {-1, 0, 1, 0, 0, 1, 0, -1};
const int Move_[8][2] = {-1, -1, -1, 0, -1, 1, 0, -1, 0, 1, 1, -1, 1, 0, 1, 1};
//---------------------
#define MAXN 100
//---------------------
ll n, x, l[MAXN];
ll jumppoint[MAXN + 5];
ll ret = -1;
int main() {
cin >> n >> x;
REP(i, MAXN + 5) jumppoint[i] = 100000;
REP(i, n) { cin >> l[i]; }
jumppoint[0] = 0;
REP1(i, n) { jumppoint[i] = jumppoint[i - 1] + l[i - 1]; }
// PRTLST(jumppoint,n+1);
REP1(i, n) {
if (jumppoint[i] > x) {
ret = i;
break;
}
}
if (ret < 0)
ret = n + 1;
cout << ret << endl;
return 0;
} | [
"assignment.change"
] | 814,017 | 814,016 | u786318703 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int j = 0; j < n; j++) {
cin >> l[j];
}
vector<int> d;
int i = 0;
d.push_back(0);
while (i < n) {
d.push_back(d[i] + l[i]);
i++;
}
int ans = 0;
for (int a = 0; a < n; a++) {
if (d[a] <= x)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int j = 0; j < n; j++) {
cin >> l[j];
}
vector<int> d;
int i = 0;
d.push_back(0);
while (i < n) {
d.push_back(d[i] + l[i]);
i++;
}
int ans = 0;
for (int a = 0; a < n + 1; a++) {
if (d[a] <= x)
ans++;
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 814,035 | 814,036 | u321761416 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, x;
cin >> n >> x;
std::vector<int> l(100, 0);
for (int i = 0; i < n; i++)
cin >> l[i];
int total = 0, j;
for (j = 0; j < n; j++) {
total += l[j];
if (total > x) {
break;
}
}
cout << j << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, x;
cin >> n >> x;
std::vector<int> l(100, 0);
for (int i = 0; i < n; i++)
cin >> l[i];
int total = 0, j;
for (j = 0; j < n; j++) {
total += l[j];
if (total > x) {
break;
}
}
cout << j + 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 814,043 | 814,044 | u336694829 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l;
for (int i = 0; i < n; i++) {
int num;
cin >> num;
l.push_back(num);
}
int cnt = 1;
int now = 0;
for (int i = 1; i < n; i++) {
now += l.at(i - 1);
if (now > x) {
break;
} else {
cnt++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> l;
for (int i = 0; i < n; i++) {
int num;
cin >> num;
l.push_back(num);
}
int cnt = 1;
int now = 0;
for (int i = 1; i <= n; i++) {
now += l.at(i - 1);
if (now > x) {
break;
} else {
cnt++;
}
}
cout << cnt << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,045 | 814,046 | u291178324 | cpp |
p03000 | #include "iostream"
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, X, tmp_l;
ll di = 0, pre_di = 0;
vector<int> L;
cin >> N >> X;
for (ll i = 0; i < N; i++) {
cin >> tmp_l;
L.push_back(tmp_l);
}
ll i;
for (i = 1; i < N && di <= X; i++) {
di = pre_di + L[i - 1];
pre_di = di;
if (di > X) {
break;
}
// cout << di << endl;
}
cout << i << endl;
return 0;
} | #include "iostream"
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, X, tmp_l;
ll di = 0, pre_di = 0;
vector<int> L;
cin >> N >> X;
for (ll i = 0; i < N; i++) {
cin >> tmp_l;
L.push_back(tmp_l);
}
ll i;
for (i = 1; i < N + 1 && di <= X; i++) {
di = pre_di + L[i - 1];
pre_di = di;
if (di > X) {
break;
}
// cout << di << endl;
}
cout << i << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 814,050 | 814,051 | u439303935 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int a = 0, b = 0, c = 0, ans = 0;
cin >> a;
cin >> b;
int ball[a];
for (int i = 0; i < a; i++) {
cin >> ball[i];
}
for (int j = 1; c < b; j++) {
c += ball[j];
ans++;
}
cout << ans;
} | #include <iostream>
using namespace std;
int main() {
int a = 0, b = 0, c = 0, ans = 0;
cin >> a;
cin >> b;
int ball[a];
for (int i = 0; i < a; i++) {
cin >> ball[i];
}
for (int j = 0; c <= b; j++) {
c += ball[j];
ans++;
}
cout << ans;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 814,052 | 814,053 | u461215920 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
long X;
cin >> N;
cin >> X;
long L[N];
for (long i = 0; i < N; i++) {
cin >> L[i];
}
long D = 0;
long cnt = 0;
while (D <= X) {
D = D + L[cnt];
cnt++;
if (cnt == N)
break;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
long X;
cin >> N;
cin >> X;
long L[N];
for (long i = 0; i < N; i++) {
cin >> L[i];
}
long D = 0;
long cnt = 0;
while (D <= X) {
D = D + L[cnt];
cnt++;
if (cnt > N)
break;
}
cout << cnt << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 814,054 | 814,055 | u526630579 | cpp |
p03000 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x, l[1001] = {}, d = 0, cnt = 0;
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> l[i];
l[n] = 100000;
while (d <= x) {
d = d + l[cnt];
cnt++;
}
cout << cnt - 1 << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x, l[1001] = {}, d = 0, cnt = 0;
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> l[i];
l[n + 1] = 100001;
while (d <= x) {
d = d + l[cnt];
cnt++;
}
cout << cnt - 1 << endl;
} | [
"assignment.change",
"literal.number.change",
"assignment.value.change"
] | 814,074 | 814,075 | u317177661 | cpp |
p03000 | #include <bits/stdc++.h>
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 min_3(a, b, c) min(a, min(b, c))
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0;
ll ans = 0;
for (int i = 0; i < n; i++) {
if (d <= x) {
d = d + l[i];
ans++;
} else
break;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
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 min_3(a, b, c) min(a, min(b, c))
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1);
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0;
ll ans = 0;
for (int i = 0; i <= n; i++) {
if (d <= x) {
d = d + l[i];
ans++;
} else
break;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,076 | 814,077 | u170650966 | cpp |
p03000 | #include <bits/stdc++.h>
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 min_3(a, b, c) min(a, min(b, c))
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (d <= x) {
d = d + l[i];
ans++;
} else
break;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
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 min_3(a, b, c) min(a, min(b, c))
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n, x;
cin >> n >> x;
vector<int> l(n + 1);
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0;
ll ans = 0;
for (int i = 0; i <= n; i++) {
if (d <= x) {
d = d + l[i];
ans++;
} else
break;
}
cout << ans << endl;
}
| [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,078 | 814,077 | u170650966 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int p = 0;
int c = 0;
for (int i = 0; i < n; i++) {
p += v[i];
if (p >= x) {
c++;
}
}
cout << c;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int p = 0;
int c = 1;
for (int i = 0; i < n; i++) {
p += v[i];
if (p <= x) {
c++;
}
}
cout << c;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 814,099 | 814,100 | u031034560 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
main() {
long long i, j, k, m, n, ans, cnt = 0, x;
vector<long long> l(110), d(110);
cin >> n >> x;
d[1] = 0;
if (x < 0) {
puts("0");
return 0;
};
if (n == 0 || x == 0) {
puts("1");
return 0;
}
for (int i = 0; i < n; i++)
cin >> l[i];
if (n == 1) {
if (l[0] <= x) {
puts("2");
return 0;
} else {
puts("1");
return 0;
}
}
for (int i = 1; i < n; i++) {
d[i] = d[i - 1] + l[i - 1];
}
for (int i = 1; i <= n; i++) {
if (d[i] > x) {
cout << i << endl;
return 0;
}
}
cout << n + 1 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
main() {
long long i, j, k, m, n, ans, cnt = 0, x;
vector<long long> l(110), d(110);
cin >> n >> x;
d[1] = 0;
if (x < 0) {
puts("0");
return 0;
};
if (n == 0 || x == 0) {
puts("1");
return 0;
}
for (int i = 0; i < n; i++)
cin >> l[i];
if (n == 1) {
if (l[0] <= x) {
puts("2");
return 0;
} else {
puts("1");
return 0;
}
}
for (int i = 1; i <= n; i++) {
d[i] = d[i - 1] + l[i - 1];
}
for (int i = 1; i <= n; i++) {
if (d[i] > x) {
cout << i << endl;
return 0;
}
}
cout << n + 1 << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,113 | 814,114 | u468811760 | cpp |
p03000 | #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int ans = 0;
int d = 1;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
d += tmp;
if (d <= X)
ans++;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int ans = 1;
int d = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
d += tmp;
if (d <= X)
ans++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 814,117 | 814,118 | u090436701 | cpp |
p03000 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main(int argc, char *argv[]) {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int D = 0;
int cnt = 1;
for (int i = 1; i < N; i++) {
D = D + L[i - 1];
if (D <= X) {
cnt++;
}
}
cout << cnt << endl;
}
| #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main(int argc, char *argv[]) {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int D = 0;
int cnt = 1;
for (int i = 1; i <= N; i++) {
D = D + L[i - 1];
if (D <= X) {
cnt++;
}
}
cout << cnt << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,119 | 814,120 | u961555816 | cpp |
p03000 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main(int argc, char *argv[]) {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int D = 0;
int cnt = 1;
for (int i = 1; i < N; i++) {
D = D + L[i - 1];
if (D <= X) {
cnt++;
} else {
break;
}
}
cout << cnt << endl;
}
| #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main(int argc, char *argv[]) {
int N, X;
cin >> N >> X;
vector<int> L(N);
rep(i, N) cin >> L[i];
int D = 0;
int cnt = 1;
for (int i = 1; i <= N; i++) {
D = D + L[i - 1];
if (D <= X) {
cnt++;
}
}
cout << cnt << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,121 | 814,120 | u961555816 | cpp |
p03000 | #include <stdio.h>
int main() {
int i;
int N, X, D = 0, flag = 0;
scanf("%d %d", &N, &X);
int L[N];
for (i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (i = 0; i < N; i++) {
D += L[i];
if (D > X) {
printf("%d", i + 1);
flag = 1;
break;
}
}
if (flag = 0)
printf("%d", i + 1);
} | #include <stdio.h>
int main() {
int i;
int N, X, D = 0, flag = 0;
scanf("%d %d", &N, &X);
int L[N];
for (i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (i = 0; i < N; i++) {
D += L[i];
if (D > X) {
printf("%d", i + 1);
flag = 1;
break;
}
}
if (flag == 0)
printf("%d", i + 1);
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 814,122 | 814,123 | u703877026 | cpp |
p03000 | #include <stdio.h>
int main() {
int i;
int N, X, D = 0, flag = 0;
scanf("%d %d", &N, &X);
int L[N];
for (i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (i = 0; i < N; i++) {
D += L[i];
if (D > X) {
printf("%d", i + 1);
flag = 1;
break;
}
}
if (flag = 0)
printf("%d", i);
} | #include <stdio.h>
int main() {
int i;
int N, X, D = 0, flag = 0;
scanf("%d %d", &N, &X);
int L[N];
for (i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
for (i = 0; i < N; i++) {
D += L[i];
if (D > X) {
printf("%d", i + 1);
flag = 1;
break;
}
}
if (flag == 0)
printf("%d", i + 1);
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 814,124 | 814,123 | u703877026 | cpp |
p03000 | #include <stdio.h>
int main(void) {
int a, b, c = 1, x = 0;
int l[100] = {0};
scanf("%d %d", &a, &b);
getchar();
for (int i = 0; i < a; i++) {
scanf("%d", l[i]);
getchar();
}
for (int i = 0; i < a; i++) {
x += l[i];
if (c <= b) {
c++;
}
}
printf("%d\n", c);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c = 1, x = 0;
int l[100] = {0};
scanf("%d %d", &a, &b);
getchar();
for (int i = 0; i < a; i++) {
scanf("%d", &l[i]);
getchar();
}
for (int i = 0; i < a; i++) {
x += l[i];
if (x <= b) {
c++;
}
}
printf("%d\n", c);
return 0;
}
| [
"expression.operation.unary.reference.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 814,125 | 814,126 | u337266378 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int n;
int l[110];
int s[110];
int x;
int main() {
scanf("%d%d", &n, &x);
s[0] = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &(l[i]));
s[i + 1] = s[i] + l[i];
}
int p = 0;
while (p < n && s[p] <= x)
p++;
printf("%d\n", p);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int n;
int l[110];
int s[110];
int x;
int main() {
scanf("%d%d", &n, &x);
s[0] = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &(l[i]));
s[i + 1] = s[i] + l[i];
}
int p = 0;
while (p <= n && s[p] <= x)
p++;
printf("%d\n", p);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 814,144 | 814,145 | u127473726 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int n;
int l[110];
int s[110];
int x;
int main() {
scanf("%d%d", &n, &x);
s[0] = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &(l[i]));
s[i + 1] = s[i] + l[i];
}
int p = 0;
while (s[p] <= x)
p++;
printf("%d\n", p);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int n;
int l[110];
int s[110];
int x;
int main() {
scanf("%d%d", &n, &x);
s[0] = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &(l[i]));
s[i + 1] = s[i] + l[i];
}
int p = 0;
while (p <= n && s[p] <= x)
p++;
printf("%d\n", p);
return 0;
}
| [
"control_flow.loop.condition.change"
] | 814,146 | 814,145 | u127473726 | cpp |
p03000 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long int
using namespace std;
int main() {
speed;
int n, x;
int L[110];
cin >> n >> x;
for (int i = 1; i < n + 1; i++) {
cin >> L[i];
}
int d[110];
int ans = 2;
d[1] = 0;
for (int i = 2; i < n + 2; i++) {
d[i] = d[i - 1] + L[i - 1];
if (d[i] > x) {
ans = i;
break;
}
if (i == n + 1 && d[i] <= x)
ans = n + 1;
}
cout << ans - 1;
ed;
return 0;
}
| #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long int
using namespace std;
int main() {
speed;
int n, x;
int L[110];
cin >> n >> x;
for (int i = 1; i < n + 1; i++) {
cin >> L[i];
}
int d[110];
int ans = 2;
d[1] = 0;
for (int i = 2; i < n + 2; i++) {
d[i] = d[i - 1] + L[i - 1];
if (d[i] > x) {
ans = i;
break;
}
if (i == n + 1 && d[i] <= x)
ans = n + 2;
}
cout << ans - 1;
ed;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 814,147 | 814,148 | u662918817 | cpp |
p03000 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long int
using namespace std;
int main() {
speed;
int n, x;
int L[110];
cin >> n >> x;
for (int i = 1; i < n + 2; i++) {
cin >> L[i];
}
int d[110];
int ans = 0;
d[1] = 0;
for (int i = 2; i < n + 2; i++) {
d[i] = d[i - 1] + L[i - 1];
if (d[i] > x) {
ans = i;
break;
}
if (i == n + 1 && d[i] <= x)
ans = n + 1;
}
cout << ans - 1;
ed;
return 0;
}
| #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long int
using namespace std;
int main() {
speed;
int n, x;
int L[110];
cin >> n >> x;
for (int i = 1; i < n + 1; i++) {
cin >> L[i];
}
int d[110];
int ans = 2;
d[1] = 0;
for (int i = 2; i < n + 2; i++) {
d[i] = d[i - 1] + L[i - 1];
if (d[i] > x) {
ans = i;
break;
}
if (i == n + 1 && d[i] <= x)
ans = n + 2;
}
cout << ans - 1;
ed;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 814,149 | 814,148 | u662918817 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int n, m, l[105], now, ans, cnt, d[105];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> l[i];
d[1] = 0;
for (int i = 2; i <= n; i++)
d[i] = d[i - 1] + l[i - 1];
for (int i = 1; i <= n; i++)
if (d[i] <= m)
ans++;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, m, l[105], now, ans, cnt, d[105];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> l[i];
d[1] = 0;
for (int i = 2; i <= n + 1; i++)
d[i] = d[i - 1] + l[i - 1];
for (int i = 1; i <= n + 1; i++)
if (d[i] <= m)
ans++;
cout << ans;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 814,154 | 814,153 | u051670389 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int D = 0;
int c = 1;
for (int i = 1; i < N; i++) {
D += L[i - 1];
if (D <= X) {
c++;
} else {
break;
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int D = 0;
int c = 1;
for (int i = 1; i <= N; i++) {
D += L[i - 1];
if (D <= X) {
c++;
} else {
break;
}
}
cout << c << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,155 | 814,156 | u369479899 | cpp |
p03000 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
long long int x, n, r, i, j, min, ans = 0;
scanf("%lld %lld", &n, &x);
long long int l[n + 1], d[n + 1];
for (i = 0; i < n; i++)
scanf("%lld", &l[i + 1]);
d[0] = 0;
for (i = 1; i < n + 1; i++)
d[i] = d[i - 1] + l[i];
for (i = 0; 1; i++) {
if (d[i] > x)
break;
ans++;
}
// for(i=0; i<n+1; i++) printf("%lld ", d[i]);
printf("%lld", ans);
} | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
long long int x, n, r, i, j, min, ans = 0;
scanf("%lld %lld", &n, &x);
long long int l[n + 1], d[n + 1];
for (i = 0; i < n; i++)
scanf("%lld", &l[i + 1]);
d[0] = 0;
for (i = 1; i < n + 1; i++)
d[i] = d[i - 1] + l[i];
for (i = 0; i < n + 1; i++) {
if (d[i] > x)
break;
ans++;
}
// for(i=0; i<n+1; i++) printf("%lld ", d[i]);
printf("%lld", ans);
} | [
"control_flow.loop.for.condition.change"
] | 814,176 | 814,177 | u356991267 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int sum = 0;
int count = 0;
if (std::accumulate(L.begin(), L.end(), 0) <= X) {
cout << N + 1;
} else {
while (!(sum + L[count] > X)) {
sum += L[count];
count++;
}
}
cout << count + 1 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int sum = 0;
int count = 0;
if (std::accumulate(L.begin(), L.end(), 0) <= X) {
cout << N + 1 << endl;
} else {
while (!(sum + L[count] > X)) {
sum += L[count];
count++;
}
cout << count + 1 << endl;
}
return 0;
}
| [
"io.output.newline.add"
] | 814,184 | 814,185 | u387977464 | cpp |
p03000 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, X, count = 1;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
int d = 0;
for (int i = 0; i <= N; ++i) {
d += L[i];
if (d <= X) {
count += 1;
}
}
cout << count << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, X, count = 1;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
int d = 0;
for (int i = 0; i < N; ++i) {
d += L[i];
if (d <= X) {
count += 1;
}
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,186 | 814,187 | u523788288 | cpp |
p03000 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int ans = 1;
int sum = 0;
int L = 0;
for (int i = 1; i < N; i++) {
/* code */
cin >> L;
sum = sum + L;
// cout << "te:" << sum << endl;
if (sum <= X) {
ans++;
}
}
cout << ans << endl;
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int ans = 1;
int sum = 0;
int L = 0;
for (int i = 1; i <= N; i++) {
/* code */
cin >> L;
sum += L;
// cout <<"te:" << sum << endl;
// cout << "te:" << sum << endl;
if (sum <= X) {
ans++;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 814,190 | 814,191 | u123724799 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, sum;
cin >> N >> X;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<int> D(N + 1);
D.at(0) = 0;
for (int i = 0; i < N + 1; i++) {
D.at(i + 1) = D.at(i) + vec.at(i);
}
sum = 0;
for (int i = 0; i < N; i++) {
if (X < D.at(i)) {
break;
}
sum++;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, sum;
cin >> N >> X;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<int> D(N + 1);
D.at(0) = 0;
for (int i = 0; i < N; i++) {
D.at(i + 1) = D.at(i) + vec.at(i);
}
sum = 0;
for (int i = 0; i < N + 1; i++) {
if (X < D.at(i)) {
break;
}
sum++;
}
cout << sum << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 814,192 | 814,193 | u189449016 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, sum;
cin >> N >> X;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<int> D(N + 1);
D.at(0) = 0;
for (int i = 0; i < N; i++) {
D.at(i + 1) = D.at(i) + vec.at(i);
}
sum = 0;
for (int i = 0; i < N; i++) {
if (X < D.at(i)) {
break;
}
sum++;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, sum;
cin >> N >> X;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<int> D(N + 1);
D.at(0) = 0;
for (int i = 0; i < N; i++) {
D.at(i + 1) = D.at(i) + vec.at(i);
}
sum = 0;
for (int i = 0; i < N + 1; i++) {
if (X < D.at(i)) {
break;
}
sum++;
}
cout << sum << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 814,194 | 814,193 | u189449016 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, D[1000000] = {0}, i;
cin >> N >> X;
D[0] = 0;
D[1] = 0;
for (i = 2; i < N + 1; i++) {
int L;
cin >> L;
D[i] = D[i - 1] + L;
if (D[i] > X) {
break;
}
}
cout << i - 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, D[1000000] = {0}, i;
cin >> N >> X;
D[0] = 0;
D[1] = 0;
for (i = 2; i <= N + 1; i++) {
int L;
cin >> L;
D[i] = D[i - 1] + L;
if (D[i] > X) {
break;
}
}
cout << i - 1;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,218 | 814,219 | u653388379 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, X;
cin >> N >> X;
vector<int> L(N);
vector<int> Zahyou(N + 1);
int count;
int L_n;
Zahyou[0] = 0;
for (int n = 0; n < N; n++) {
cin >> L[n];
}
for (int n = 1; n < N + 1; n++) {
// cout << L[n - 1] << '\n';
Zahyou[n] = Zahyou[n - 1] + L[n - 1];
}
for (int n = 0; n < N + 1; n++) {
// cout << Zahyou[n] << '\n';
if (Zahyou[n] > X) {
count = n;
break;
}
}
if (Zahyou[N] <= X) {
count = N;
}
cout << count << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, X;
cin >> N >> X;
vector<int> L(N);
vector<int> Zahyou(N + 1);
int count;
int L_n;
Zahyou[0] = 0;
for (int n = 0; n < N; n++) {
cin >> L[n];
}
for (int n = 1; n < N + 1; n++) {
// cout << L[n - 1] << '\n';
Zahyou[n] = Zahyou[n - 1] + L[n - 1];
}
for (int n = 0; n < N + 1; n++) {
// cout << Zahyou[n] << '\n';
if (Zahyou[n] > X) {
count = n;
break;
}
}
if (Zahyou[N] <= X) {
count = N + 1;
}
cout << count << '\n';
return 0;
}
| [
"assignment.change"
] | 814,226 | 814,227 | u518623219 | cpp |
p03000 | #include <iostream>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
int lastTime = 0;
int count = 1, L;
for (int i = 0; i < N; i++) {
cin >> L;
if (lastTime + L <= X) {
count += 1;
lastTime = L;
} else {
break;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int N, X;
cin >> N >> X;
int lastTime = 0;
int count = 1, L;
for (int i = 0; i < N; i++) {
cin >> L;
if (lastTime + L <= X) {
count += 1;
lastTime = L + lastTime;
} else {
break;
}
}
cout << count << endl;
return 0;
} | [
"assignment.change"
] | 814,228 | 814,229 | u161955763 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, X;
cin >> N >> X;
vector<int> L(N);
for (auto &l : L)
cin >> l;
int pos = 0;
int ans = 0;
while (pos <= X and ans < N - 1) {
pos += L[ans];
ans++;
}
if (pos <= X)
ans++;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, X;
cin >> N >> X;
vector<int> L(N);
for (auto &l : L)
cin >> l;
int pos = 0;
int ans = 0;
while (pos <= X and ans < N) {
pos += L[ans];
ans++;
}
if (pos <= X)
ans++;
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 814,238 | 814,239 | u500092662 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int X;
int count = 0;
cin >> N;
cin >> X;
vector<int> L(N + 1);
vector<int> sumL(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> L.at(i);
}
for (int j = 0; j < N; j++) {
for (int i = 0; i < j + 1; i++) {
sumL.at(j) += L.at(i);
}
}
for (int i = 0; i < N; i++) {
if (sumL.at(i) <= X)
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int X;
int count = 0;
cin >> N;
cin >> X;
vector<int> L(N + 1);
vector<int> sumL(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> L.at(i);
}
for (int j = 0; j < N + 1; j++) {
for (int i = 0; i < j + 1; i++) {
sumL.at(j) += L.at(i);
}
}
for (int i = 0; i < N + 1; i++) {
if (sumL.at(i) <= X)
count++;
}
cout << count << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 814,240 | 814,241 | u028358201 | cpp |
p03000 | #include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N + 1], sumL = 0;
for (int i = 1; i <= N; i++) {
cin >> L[i];
// cout << L[i] << '\n';
}
int count = 0;
for (int i = 1; i <= N; i++) {
if (X >= sumL)
count++;
sumL += L[i];
// cout << sumL << ',';
// cout << count << '\n';
}
cout << count << '\n';
return 0;
}
// g++ ファイル名 --input-charset=utf-8 --exec-charset=cp932
//日本語出力するときのやつ | #include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
int L[N], sumL = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
// cout << L[i] << '\n';
}
int count = 0;
for (int i = 0; i <= N; i++) {
if (X >= sumL)
count++;
sumL += L[i];
// cout << sumL << ',';
// cout << count << '\n';
}
cout << count << '\n';
return 0;
}
// g++ ファイル名 --input-charset=utf-8 --exec-charset=cp932
//日本語出力するときのやつ | [
"expression.operation.binary.remove",
"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"
] | 814,242 | 814,243 | u760132207 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> d;
vector<int> l;
d.push_back(0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
l.push_back(k);
}
for (int i = 0; i < n + 1; i++) {
d.push_back(d[i] + l[i]);
}
int ans = 0;
for (int i = 0; i < d.size(); i++) {
if (d[i] <= x) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> d;
vector<int> l;
d.push_back(0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
l.push_back(k);
}
for (int i = 0; i < n; i++) {
d.push_back(d[i] + l[i]);
}
int ans = 0;
for (int i = 0; i < d.size(); i++) {
if (d[i] <= x) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 814,244 | 814,245 | u240010800 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> d;
vector<int> l;
d.push_back(0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
l.push_back(k);
}
for (int i = 1; i < n; i++) {
d.push_back(d[i - 1] + l[i - 1]);
}
int ans = 0;
for (int i = 0; i < d.size(); i++) {
if (d[i] <= x) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> d;
vector<int> l;
d.push_back(0);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
l.push_back(k);
}
for (int i = 0; i < n; i++) {
d.push_back(d[i] + l[i]);
}
int ans = 0;
for (int i = 0; i < d.size(); i++) {
if (d[i] <= x) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 814,246 | 814,245 | u240010800 | cpp |
p03000 | #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> point(n);
for (auto &e : point)
std::cin >> e;
auto p = 0, count = 0;
try {
while (p <= x) {
p += point.at(count);
++count;
}
} catch (...) {
count--;
}
std::cout << count;
return 0;
} | #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> point(n);
for (auto &e : point)
std::cin >> e;
auto p = 0, count = 0;
try {
while (p <= x) {
p += point.at(count);
++count;
}
} catch (...) {
count++;
}
std::cout << count;
return 0;
} | [] | 814,253 | 814,254 | u259946904 | cpp |
p03000 | #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> point(n);
for (auto &e : point)
std::cin >> e;
auto p = 0, count = 0;
try {
while (p <= x) {
p += point.at(count);
++count;
}
} catch (...) {
}
std::cout << count;
return 0;
} | #include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> point(n);
for (auto &e : point)
std::cin >> e;
auto p = 0, count = 0;
try {
while (p <= x) {
p += point.at(count);
++count;
}
} catch (...) {
count++;
}
std::cout << count;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 814,255 | 814,254 | u259946904 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
int sum = 0;
int i;
for (i = 0; i < n; i++) {
if (sum <= x) {
cin >> L.at(i);
sum += L.at(i);
} else {
break;
}
}
if (sum < x) {
cout << i + 1 << endl;
} else {
cout << i << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> L(n);
int sum = 0;
int i;
for (i = 0; i < n; i++) {
if (sum <= x) {
cin >> L.at(i);
sum += L.at(i);
} else {
break;
}
}
if (sum <= x) {
cout << i + 1 << endl;
} else {
cout << i << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 814,258 | 814,259 | u600611341 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 1, a = 0;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
a = a + L[i];
if (a <= X) {
ans++;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 1, a = 0;
cin >> N >> X;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
a = a + L[i];
if (a <= X) {
ans++;
}
}
cout << ans;
}
| [] | 814,266 | 814,267 | u811897616 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
int ans = 1;
cin >> N >> X;
vector<int> L(N), D(N + 1);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i < N; i++) {
D[i] += D[i - 1] + L[i - 1];
if (D[i] <= X) {
ans++;
}
}
cout << ans;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
int ans = 1;
cin >> N >> X;
vector<int> L(N), D(N + 1);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
D[0] = 0;
for (int i = 1; i <= N; i++) {
D[i] += D[i - 1] + L[i - 1];
if (D[i] <= X) {
ans++;
}
}
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,272 | 814,273 | u293511800 | cpp |
p03000 | #include <stdio.h>
int main(void) {
// Input
int N, X;
scanf("%d", &N);
scanf("%d", &X);
int L[N], i;
for (i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
int D[N], n = 1;
D[0] = 0;
for (i = 1; i < N; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X) {
n += 1;
}
}
printf("%d\n", n);
return 0;
} | #include <stdio.h>
int main(void) {
// Input
int N, X;
scanf("%d", &N);
scanf("%d", &X);
int L[N], i;
for (i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
int D[N + 1], n = 1;
D[0] = 0;
for (i = 1; i < N + 1; i++) {
D[i] = D[i - 1] + L[i - 1];
if (D[i] <= X) {
n += 1;
}
}
printf("%d\n", n);
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 814,277 | 814,278 | u302993900 | cpp |
p03000 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, x, za = 0, bd = 0, ans = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
ans++;
for (int i = 0; i <= n; i++) {
za += bd + l[i];
ans++;
if (za > x) {
ans--;
break;
}
}
cout << ans;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, x, za = 0, bd = 0, ans = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
ans++;
for (int i = 0; i < n; i++) {
za += bd + l[i];
ans++;
if (za > x) {
ans--;
break;
}
}
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,283 | 814,284 | u125051909 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
int d[n + 2];
d[1] = 0;
// for(int i=2;i<=(n+1);i++)
int c = 0;
for (int i = 1; i <= (n + 1); i++) {
if (i >= 2)
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
c++;
else
break;
}
cout << c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
int d[n + 1];
d[0] = 0;
int c = 0;
for (int i = 0; i <= (n); i++) {
if (i >= 1)
d[i] = d[i - 1] + l[i - 1];
if (d[i] <= x)
c++;
else
break;
}
cout << c;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.opera... | 814,285 | 814,286 | u254663986 | cpp |
p03000 | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define ll long long
#define fast_io \
cin.tie(0); \
cout.tie(0); \
ios::sync_with_stdio(0)
#define MOD 1000000007
using namespace std;
int main() {
fast_io;
ll n, x;
cin >> n >> x;
vector<ll> l;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
l.push_back(a);
}
ll cnt = 0;
vector<ll> d;
d.push_back(0);
for (int i = 1; i < n; i++) {
ll a;
a = d[i - 1] + l[i - 1];
d.push_back(a);
}
for (int i = 0; i < d.size(); i++) {
if (d[i] <= x) {
cnt++;
}
}
cout << cnt;
return 0;
}
| #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define ll long long
#define fast_io \
cin.tie(0); \
cout.tie(0); \
ios::sync_with_stdio(0)
#define MOD 1000000007
using namespace std;
int main() {
fast_io;
ll n, x;
cin >> n >> x;
vector<ll> l;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
l.push_back(a);
}
ll cnt = 0;
vector<ll> d;
d.push_back(0);
for (int i = 1; i <= n; i++) {
ll a;
a = d[i - 1] + l[i - 1];
d.push_back(a);
}
for (int i = 0; i < d.size(); i++) {
if (d[i] <= x) {
cnt++;
}
}
cout << cnt;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,289 | 814,290 | u656026366 | cpp |
p03000 | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define ll long long
#define fast_io \
cin.tie(0); \
cout.tie(0); \
ios::sync_with_stdio(0)
#define MOD 1000000007
using namespace std;
int main() {
fast_io;
ll n, x;
cin >> n >> x;
vector<ll> l;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
l.push_back(a);
}
ll cnt = 0;
vector<ll> d;
d.push_back(0);
for (int i = 1; i < n; i++) {
ll a;
a = d[i - 1] + l[i - 1];
d.push_back(a);
}
for (int i = 0; i < d.size(); i++) {
if (d[i] <= x) {
cnt++;
} else {
break;
}
}
cout << cnt;
return 0;
}
| #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define ll long long
#define fast_io \
cin.tie(0); \
cout.tie(0); \
ios::sync_with_stdio(0)
#define MOD 1000000007
using namespace std;
int main() {
fast_io;
ll n, x;
cin >> n >> x;
vector<ll> l;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
l.push_back(a);
}
ll cnt = 0;
vector<ll> d;
d.push_back(0);
for (int i = 1; i <= n; i++) {
ll a;
a = d[i - 1] + l[i - 1];
d.push_back(a);
}
for (int i = 0; i < d.size(); i++) {
if (d[i] <= x) {
cnt++;
}
}
cout << cnt;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 814,291 | 814,290 | u656026366 | cpp |
p03000 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<long long> D(N + 1, 0);
for (int i = 1; i <= N + 1; i++) {
int tmp;
cin >> tmp;
D[i] = D[i - 1] + tmp;
if (D[i] > X) {
cout << i << endl;
return 0;
}
}
cout << N << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<long long> D(N + 2, 0);
for (int i = 2; i <= N + 1; i++) {
int tmp;
cin >> tmp;
D[i] = D[i - 1] + tmp;
if (D[i] > X) {
cout << i - 1 << endl;
return 0;
}
}
cout << N + 1 << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 814,294 | 814,295 | u119477929 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ans = 1, d = 0, num = 0;
cin >> n >> x;
vector<int> l(n, 100000);
for (int i = 0; i < n; i++)
cin >> l[i];
int i = 1;
while (i != n + 10) {
d = num + l[i];
if (d <= x)
ans++;
num = d;
i++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ans = 1, d = 0, num = 0;
cin >> n >> x;
vector<int> l(n, 100000);
for (int i = 0; i < n; i++)
cin >> l[i];
int i = 0;
while (i != n) {
d = num + l[i];
if (d <= x)
ans++;
num = d;
i++;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 814,300 | 814,301 | u902149880 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ans = 1, d = 0, num = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int i = 1;
while (i != n + 2) {
d = num + l[i];
if (d <= x)
ans++;
num = d;
i++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ans = 1, d = 0, num = 0;
cin >> n >> x;
vector<int> l(n, 100000);
for (int i = 0; i < n; i++)
cin >> l[i];
int i = 0;
while (i != n) {
d = num + l[i];
if (d <= x)
ans++;
num = d;
i++;
}
cout << ans << endl;
}
| [
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 814,302 | 814,301 | u902149880 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ans = 1, d = 0, num = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int i = 1;
while (i != n + 1) {
d = num + l[i];
if (d <= x)
ans++;
num = d;
i++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ans = 1, d = 0, num = 0;
cin >> n >> x;
vector<int> l(n, 100000);
for (int i = 0; i < n; i++)
cin >> l[i];
int i = 0;
while (i != n) {
d = num + l[i];
if (d <= x)
ans++;
num = d;
i++;
}
cout << ans << endl;
}
| [
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 814,303 | 814,301 | u902149880 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ans = 1, d = 0, num = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int i = 1;
while (i != n) {
d = num + l[i];
if (d <= x)
ans++;
num = d;
i++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ans = 1, d = 0, num = 0;
cin >> n >> x;
vector<int> l(n, 100000);
for (int i = 0; i < n; i++)
cin >> l[i];
int i = 0;
while (i != n) {
d = num + l[i];
if (d <= x)
ans++;
num = d;
i++;
}
cout << ans << endl;
}
| [
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change"
] | 814,304 | 814,301 | u902149880 | cpp |
p03000 | #include <iostream>
#include <vector>
int main(void) {
using namespace std;
int n, x;
std::cin >> n >> x;
int d = 0;
int count = n;
for (int i = 0; i < n; i++) {
int l;
std::cin >> l;
d += l;
if (d > x) {
count = i + 1;
break;
}
}
std::cout << count << std::endl;
return 0;
} | #include <iostream>
#include <vector>
int main(void) {
using namespace std;
int n, x;
std::cin >> n >> x;
int d = 0;
int count = n + 1;
for (int i = 0; i < n; i++) {
int l;
std::cin >> l;
d += l;
if (d > x) {
count = i + 1;
break;
}
}
std::cout << count << std::endl;
return 0;
} | [
"assignment.change"
] | 814,308 | 814,309 | u894129918 | cpp |
p03000 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0;
int j;
for (j = 0; d <= x; j++) {
d += l[j];
}
cout << j << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
int d = 0;
int j = 0;
for (j = 0; d <= x; j++) {
d += l[j];
}
cout << j << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 814,314 | 814,315 | u297292406 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, x;
cin >> n >> x;
int a[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> a[i];
int c = 0, d = 0;
for (int i = 1; i <= n; i++) {
a[i] = a[i] + a[i - 1];
if (a[i] > x) {
d = 1;
cout << i << endl;
break;
}
}
if (d != 1) {
cout << n << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, x;
cin >> n >> x;
int a[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> a[i];
int c = 0, d = 0;
for (int i = 1; i <= n; i++) {
a[i] = a[i] + a[i - 1];
if (a[i] > x) {
d = 1;
cout << i << endl;
break;
}
}
if (d != 1) {
cout << n + 1 << endl;
}
} | [
"expression.operation.binary.add"
] | 814,316 | 814,317 | u010952096 | cpp |
p03000 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int D = 0, sum = 0, ans = 0;
while (cin >> L) {
if (D + L > X)
break;
sum += D + L;
D += L;
ans++;
}
cout << ans << "\n";
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, X, L;
cin >> N >> X;
int D = 0, sum = 0, ans = 1;
while (cin >> L) {
if (D + L > X)
break;
sum += D + L;
D += L;
ans++;
}
cout << ans << "\n";
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 814,335 | 814,336 | u002428461 | cpp |
p03000 | #include <cstdio>
#include <cstring>
#define maxn 105
int main() {
int n, m, cnt = 1;
int a[maxn];
long long b[maxn];
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
memset(b, 0, sizeof(b));
for (int i = 2; i <= n; i++) {
b[i] = (long long)b[i - 1] + a[i - 1];
if (b[i] <= (long long)m)
cnt++;
}
printf("%d", cnt);
return 0;
}
| #include <cstdio>
#include <cstring>
#define maxn 105
int main() {
int n, m, cnt = 1;
int a[maxn];
long long b[maxn];
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
memset(b, 0, sizeof(b));
for (int i = 2; i <= n + 1; i++) {
b[i] = (long long)b[i - 1] + a[i - 1];
if (b[i] <= (long long)m)
cnt++;
}
printf("%d", cnt);
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 814,337 | 814,338 | u074650488 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> a(N);
int sum = 0;
for (int i = 0; i < N; ++i) {
cin >> a[i];
sum += a[i];
if (sum > X) {
cout << i + 1;
break;
}
}
if (sum <= X)
cout << N;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> a(N);
int sum = 0;
for (int i = 0; i < N; ++i) {
cin >> a[i];
sum += a[i];
if (sum > X) {
cout << i + 1;
break;
}
}
if (sum <= X)
cout << N + 1;
} | [
"expression.operation.binary.add"
] | 814,345 | 814,346 | u314816992 | cpp |
p03000 | #include <cstdio>
int main(void) {
int n;
int l[101];
int x;
scanf("%d %d\n", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d", &l[i]);
}
int count;
int d = 0;
for (count = 1; d <= x && count <= n; count++) {
d = d + l[count];
}
printf("%d\n", count - 1);
return 0;
} | #include <cstdio>
int main(void) {
int n;
int l[101];
int x;
scanf("%d %d\n", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d", &l[i]);
}
int count;
int d = 0;
for (count = 1; d <= x && count <= n + 1; count++) {
d = d + l[count];
}
printf("%d\n", count - 1);
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 814,355 | 814,356 | u684901760 | cpp |
p03000 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
//マクロ定義
#define vvint(vec, n, m, l) \
vector<vector<int>> vec(n, vector<int>(m, l)); // lで初期化
#define vvll(vec, n, m, l) vector<vector<ll>> vec(n, vector<ll>(m, l));
#define vint vector<int>
#define pint pair<int, int>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define all(x) (x).begin(), (x).end()
#define debug system("pause") //デバッグ用
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }
int ans = 1;
int tmp = 0;
rep(i, n) {
if (tmp + l[i] <= x) {
ans++;
tmp += l[i];
}
}
cout << ans << endl;
} | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
//マクロ定義
#define vvint(vec, n, m, l) \
vector<vector<int>> vec(n, vector<int>(m, l)); // lで初期化
#define vvll(vec, n, m, l) vector<vector<ll>> vec(n, vector<ll>(m, l));
#define vint vector<int>
#define pint pair<int, int>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define all(x) (x).begin(), (x).end()
#define debug system("pause") //デバッグ用
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
vector<int> l(n);
rep(i, n) { cin >> l[i]; }
int ans = 1;
int tmp = 0;
rep(i, n) {
if (tmp + l[i] <= x) {
ans++;
}
tmp += l[i];
}
cout << ans << endl;
} | [] | 814,369 | 814,370 | u776194115 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int ans = 0;
int c;
int d;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> c;
ans += c;
d = i + 1;
if (ans > b) {
break;
}
}
if (ans < b)
cout << d << endl;
else
cout << d + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int ans = 0;
int c;
int d;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> c;
ans += c;
d = i + 1;
if (ans > b) {
break;
}
}
if (ans <= b)
cout << d + 1 << endl;
else
cout << d << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 814,383 | 814,384 | u288905450 | cpp |
p03000 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a = 1, lsum = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
lsum = lsum + l.at(i);
if (lsum < x)
a++;
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a = 1, lsum = 0;
cin >> n >> x;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
lsum = lsum + l.at(i);
if (lsum <= x)
a++;
}
cout << a << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 814,392 | 814,393 | u371381963 | cpp |
p03000 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
int ans = 0;
int d = 0;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
d += l;
if (d <= x)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n, x;
cin >> n >> x;
int ans = 1;
int d = 0;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
d += l;
if (d <= x)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 814,406 | 814,407 | u930898631 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
//周上あるいは対角線上か調べる
int64_t W, H, x, y;
cin >> W >> H >> x >> y;
int ans = 1;
if (x == W || y == H || x == W / 2.0 || y == H / 2.0 || x == 0 ||
y == 0) //周上
ans = 0;
if (y == x || y == H - x)
ans = 0;
if (x == W / 2.0 && y == H / 2.0)
ans = 1;
cout << W * H / 2.0 << " " << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
//周上あるいは対角線上か調べる
int64_t W, H, x, y;
cin >> W >> H >> x >> y;
int ans = 0;
if (x == W || y == H || x == W / 2.0 || y == H / 2.0 || x == 0 ||
y == 0) //周上
ans = 0;
if (y == x || y == H - x)
ans = 0;
if (x == W / 2.0 && y == H / 2.0)
ans = 1;
cout << W * H / 2.0 << " " << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 814,416 | 814,417 | u084686060 | cpp |
p03001 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
using Graph = vector<vector<ll>>;
int main() {
long long w, h;
cin >> w >> h;
long long int x, y;
cin >> x >> y;
long double area = w / 2 * h;
int flag = 0;
if (w == 2 * x && h == 2 * y) {
flag = 1;
}
cout << fixed << setprecision(10) << area << ' ' << flag << endl;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
using Graph = vector<vector<ll>>;
int main() {
long long w, h;
cin >> w >> h;
long long int x, y;
cin >> x >> y;
long double area = w / 2.0 * h;
int flag = 0;
if (w == 2 * x && h == 2 * y) {
flag = 1;
}
cout << fixed << setprecision(10) << area << ' ' << flag << endl;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 814,418 | 814,419 | u830087664 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; //無い場合
return right;
}
vector<ll> prime;
void Prime(ll n) { //線形篩,素数列挙
vector<ll> p(n, 0);
p[0] = 1;
p[1] = 1;
for (ll i = 2; i < n; i++) {
if (p[i] == 0) {
prime.push_back(i);
p[i] = i;
}
ll k = prime.size();
for (ll j = 0; j < k && i * prime[j] < n && prime[j] <= p[i]; j++) {
p[i * prime[j]] = prime[j];
}
}
}
#define MOD ((ll)1e+9 + 7)
// cout<<fixed<<setprecision(10);
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
bool type = (2 * x == w && 2 * y == h);
double ans = (w * h) / 2;
cout << fixed << setprecision(10);
cout << ans << ' ' << type << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; //無い場合
return right;
}
vector<ll> prime;
void Prime(ll n) { //線形篩,素数列挙
vector<ll> p(n, 0);
p[0] = 1;
p[1] = 1;
for (ll i = 2; i < n; i++) {
if (p[i] == 0) {
prime.push_back(i);
p[i] = i;
}
ll k = prime.size();
for (ll j = 0; j < k && i * prime[j] < n && prime[j] <= p[i]; j++) {
p[i * prime[j]] = prime[j];
}
}
}
#define MOD ((ll)1e+9 + 7)
// cout<<fixed<<setprecision(10);
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
bool type = (2 * x == w && 2 * y == h);
double ans = (double)(w * h) / 2;
cout << fixed << setprecision(10);
cout << ans << ' ' << type << endl;
return 0;
}
| [
"type_conversion.add"
] | 814,427 | 814,428 | u000113982 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, beg, end) for (int i = (beg); i < (end); i++)
#define rrep(i, beg, end) for (int i = (beg); i >= (end); i--)
typedef long long ll;
typedef pair<ll, ll> P;
typedef unsigned long long ull;
const int INF = 2e9;
const int mod = 1e9 + 7;
const int N = 1010;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main(void) {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)w * h / 2;
if (x * 2 == w && y * 2 == h)
cout << "1" << endl;
else
cout << "0" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, beg, end) for (int i = (beg); i < (end); i++)
#define rrep(i, beg, end) for (int i = (beg); i >= (end); i--)
typedef long long ll;
typedef pair<ll, ll> P;
typedef unsigned long long ull;
const int INF = 2e9;
const int mod = 1e9 + 7;
const int N = 1010;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main(void) {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)w * h / 2;
if (x * 2 == w && y * 2 == h)
cout << " 1" << endl;
else
cout << " 0" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 814,442 | 814,443 | u462639463 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y, b = 0;
cin >> W >> H >> x >> y;
double s;
s = W * H / 2.0;
if (W / 2 == x && H / 2 == y) {
b++;
}
cout << s << " " << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y, b = 0;
cin >> W >> H >> x >> y;
double s;
s = W * H / 2.0;
if (W / 2.0 == x && H / 2.0 == y) {
b++;
}
cout << s << " " << b << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 814,444 | 814,445 | u276588887 | cpp |
p03001 | #include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
const int N = 100;
bool isprime(int n) {
if (n <= 1)
return false;
for (int i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
int binarySearch(int arr[], int l, int r, int x) {
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
long long lcm(long long a, long long b) {
long long p, r;
p = a * b;
r = __gcd(a, b);
return p / r;
}
bool ispalindrome(string s) {
int n = s.length();
for (int i = 0; i < n / 2; i++) {
if (s[i] != s[n - i - 1])
return false;
}
return true;
}
bool isPerfectSquare(long double x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
ll f(ll n) { return n * (n - 1) / 2; }
bool cmp(const tuple<int, string, string> &a,
const tuple<int, string, string> &b) {
return (get<0>(a) < get<0>(b));
}
void solve() {
long double w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10) << (w * h) / 2 << " ";
if (w == 2 * x || h == 2 * y)
cout << 1 << endl;
else
cout << 0 << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
const int N = 100;
bool isprime(int n) {
if (n <= 1)
return false;
for (int i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
int binarySearch(int arr[], int l, int r, int x) {
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
long long lcm(long long a, long long b) {
long long p, r;
p = a * b;
r = __gcd(a, b);
return p / r;
}
bool ispalindrome(string s) {
int n = s.length();
for (int i = 0; i < n / 2; i++) {
if (s[i] != s[n - i - 1])
return false;
}
return true;
}
bool isPerfectSquare(long double x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
ll f(ll n) { return n * (n - 1) / 2; }
bool cmp(const tuple<int, string, string> &a,
const tuple<int, string, string> &b) {
return (get<0>(a) < get<0>(b));
}
void solve() {
long double w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10) << (w * h) / 2 << " ";
if (w == 2 * x && h == 2 * y)
cout << 1 << endl;
else
cout << 0 << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 814,446 | 814,447 | u381721359 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
int main() {
ll W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
cout << fixed << setprecision(9) << W * H / 2 << " "
<< ((x + x == W) && (y + y == H)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
int main() {
long double W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
cout << fixed << setprecision(9) << W * H / 2 << " "
<< ((x + x == W) && (y + y == H)) << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 814,457 | 814,458 | u058106405 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (w / 2 == h && h / 2 == y) {
cout << 1 << endl;
} else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (w / 2 == x && h / 2 == y) {
cout << 1 << endl;
} else
cout << 0 << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 814,459 | 814,460 | u816631826 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << fixed << setprecision(6) << a * b / 2.0 << " ";
if (c == a / 2 && d == b / 2)
cout << "1" << endl;
else
cout << "0" << endl;
return 0;
} | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double a, b, c, d;
cin >> a >> b >> c >> d;
cout << fixed << setprecision(6) << a * b / 2.0 << " ";
if (c == a / 2.0 && d == b / 2.0)
cout << "1" << endl;
else
cout << "0" << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 814,461 | 814,462 | u089230684 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double s = (double)w * h / 2;
printf("%.10f ", s);
if (w == x * 2 && h == y * h)
cout << 1;
else
cout << 0;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double s = (double)w * h / 2;
printf("%.10f ", s);
if (w == x * 2 && h == y * 2)
cout << 1;
else
cout << 0;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 814,463 | 814,464 | u353919145 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, w, x, y;
cin >> w >> h >> x >> y;
double s = (h * w) / 2;
char p = '0';
if (x * 2 == w && y * 2 == h) {
p = '1';
}
cout << fixed << setprecision(15) << s << ' ' << p << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, x, y;
cin >> w >> h >> x >> y;
double s = (double)h * w / 2;
char p = '0';
if (x * 2 == w && y * 2 == h) {
p = '1';
}
cout << fixed << setprecision(15) << s << ' ' << p << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 814,489 | 814,488 | u323864528 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, w, x, y;
cin >> w >> h >> x >> y;
long double s = (h * w) / 2;
char p = '0';
if (x * 2 == w && y * 2 == h) {
p = '1';
}
cout << fixed << setprecision(15) << s << ' ' << p << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, x, y;
cin >> w >> h >> x >> y;
double s = (double)h * w / 2;
char p = '0';
if (x * 2 == w && y * 2 == h) {
p = '1';
}
cout << fixed << setprecision(15) << s << ' ' << p << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 814,490 | 814,488 | u323864528 | cpp |
p03001 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define pb push_back
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
const int INF = 1e9;
const ll INFS = 1e18;
const int MOD = INF + 7;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const double PI = acos(-1);
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = 0;
if (w % 2 == 0 && h % 2 == 0) {
if (w / 2 == x && h / 2 == y) {
ans = w * h / 2;
cout << ans << " 1" << endl;
return 0;
}
}
ans = w * h / 2;
cout << ans << " 0" << endl;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define pb push_back
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
const int INF = 1e9;
const ll INFS = 1e18;
const int MOD = INF + 7;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const double PI = acos(-1);
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = 0;
if (w % 2 == 0 && h % 2 == 0) {
if (w / 2 == x && h / 2 == y) {
ans = (double)w * h / 2;
cout << ans << " 1" << endl;
return 0;
}
}
ans = (double)w * h / 2;
cout << ans << " 0" << endl;
} | [
"type_conversion.add"
] | 814,494 | 814,495 | u818755983 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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 int INF = 1001001001;
vector<pair<int64_t, int64_t>> pppp(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int ans = 0;
if (2 * x == w && 2 * y == h) {
ans = 1;
}
cout << fixed << setprecision(10) << (double)(w * h / 2) << " " << ans
<< endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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 int INF = 1001001001;
vector<pair<int64_t, int64_t>> pppp(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int ans = 0;
if (2 * x == w && 2 * y == h) {
ans = 1;
}
cout << fixed << setprecision(10) << (double)w * h / 2 << " " << ans << endl;
return 0;
} | [] | 814,504 | 814,505 | u209457657 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, a, b) for (ll i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define PRINT(V) \
for (auto v : (V)) { \
cerr << v << " "; \
} \
cerr << endl
#define dump(x) cerr << #x << " : " << (x) << endl
#define dump2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
const ll MOD = 1000000007;
const ll INF = 100000000000000000LL;
/* END OF TEMPLATE */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h;
ans /= 2;
int mul;
if (x * 2 == w && w * 2 == h) {
mul = 1;
} else {
mul = 0;
}
cout << fixed << setprecision(15) << ans << " " << mul << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, a, b) for (ll i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define PRINT(V) \
for (auto v : (V)) { \
cerr << v << " "; \
} \
cerr << endl
#define dump(x) cerr << #x << " : " << (x) << endl
#define dump2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
const ll MOD = 1000000007;
const ll INF = 100000000000000000LL;
/* END OF TEMPLATE */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h;
ans /= 2;
int mul;
if (x * 2 == w && y * 2 == h) {
mul = 1;
} else {
mul = 0;
}
cout << fixed << setprecision(15) << ans << " " << mul << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 814,512 | 814,513 | u116670634 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, a, b) for (ll i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define PRINT(V) \
for (auto v : (V)) { \
cerr << v << " "; \
} \
cerr << endl
#define dump(x) cerr << #x << " : " << (x) << endl
#define dump2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
const ll MOD = 1000000007;
const ll INF = 100000000000000000LL;
/* END OF TEMPLATE */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int mul;
if (x * 2 == w && w * 2 == h) {
mul = 1;
} else {
mul = 0;
}
cout << fixed << setprecision(15) << ans << " " << mul << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, a, b) for (ll i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define PRINT(V) \
for (auto v : (V)) { \
cerr << v << " "; \
} \
cerr << endl
#define dump(x) cerr << #x << " : " << (x) << endl
#define dump2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
const ll MOD = 1000000007;
const ll INF = 100000000000000000LL;
/* END OF TEMPLATE */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h;
ans /= 2;
int mul;
if (x * 2 == w && y * 2 == h) {
mul = 1;
} else {
mul = 0;
}
cout << fixed << setprecision(15) << ans << " " << mul << endl;
return 0;
} | [
"expression.operation.binary.change",
"assignment.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 814,514 | 814,513 | u116670634 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (W == 2 * x || H == 2 * y)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << (double)W * H / 2 << " ";
if (W == 2 * x && H == 2 * y)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 814,517 | 814,518 | u415325136 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, (n)-1, 0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-10;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << (ld)w * h / 2 << ' ';
if (x == w / 2 && y == h / 2) {
cout << 1 << endk;
} else {
cout << 0 << endk;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, (n)-1, 0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-10;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << (ld)w * h / 2 << ' ';
if (x == (ld)w / 2 && y == (ld)h / 2) {
cout << 1 << endk;
} else {
cout << 0 << endk;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 814,519 | 814,520 | u137747137 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * y / 2;
int num = (w == x * 2 && h == y * 2) ? 1 : 0;
printf("%.6f %d\n", ans, num);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * h / 2;
int num = (w == x * 2 && h == y * 2) ? 1 : 0;
printf("%.10f %d\n", ans, num);
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,525 | 814,526 | u280728543 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * y / 2;
int num = (w == x * 2 && h == y * 2) ? 1 : 0;
printf("%.10f %d\n", ans, num);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * h / 2;
int num = (w == x * 2 && h == y * 2) ? 1 : 0;
printf("%.10f %d\n", ans, num);
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 814,527 | 814,526 | u280728543 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.