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 |
|---|---|---|---|---|---|---|---|
p02970 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
const long long MOD = 1000000007;
using namesp... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
const long long MOD = 1000000007;
using namesp... | [] | 773,681 | 773,682 | u809967037 | cpp |
p02970 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << ceil(n / (d * 2 + 1)) << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double n, d;
cin >> n >> d;
cout << ceil(n / (d * 2 + 1)) << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 773,689 | 773,690 | u993074316 | cpp |
p02970 | /* B */
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << n + 2 * d / (2 * d + 1) << endl;
} | /* B */
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (n + 2 * d) / (2 * d + 1) << endl;
} | [] | 773,691 | 773,692 | u147762850 | cpp |
p02966 |
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int Max_N(505);
typedef long long int LL;
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
qu[55];
int f, qr;
#define gc... |
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int Max_N(505);
typedef long long int LL;
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
qu[55];
int f, qr;
#define gc... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 773,744 | 773,745 | u710399266 | cpp |
p02966 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
template <typename tn> void read(tn &a) {
tn x = 0, f = 1;
char c = ' ';
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); c = getchar())
x = x * 10 + c - '0';
a = x * f;
}
int main() {
int n;
read(n... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
template <typename tn> void read(tn &a) {
tn x = 0, f = 1;
char c = ' ';
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); c = getchar())
x = x * 10 + c - '0';
a = x * f;
}
int main() {
int n;
read(n... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 773,748 | 773,749 | u684730254 | cpp |
p02966 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define sqr(x) ((x) * (x))
#define fz1(i, n) for ((i) = 1; (i) <= (n); (i)++)
#define fd... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define sqr(x) ((x) * (x))
#define fz1(i, n) for ((i) = 1; (i) <= (n); (i)++)
#define fd... | [
"expression.operation.binary.remove",
"assignment.change"
] | 773,752 | 773,753 | u083440680 | cpp |
p02967 | #include <cstdio>
#include <cstdlib>
using namespace std;
int main() {
char *s = new char[1000010];
scanf("%s", s);
char *s_compr = new char[1000010];
int N = 0, N_compr = 0;
while (s[N]) {
if (N == 0 || s_compr[N_compr - 1] != s[N])
s_compr[N_compr++] = s[N];
N++;
}
delete[] s;
int cnt[3... | #include <cstdio>
#include <cstdlib>
using namespace std;
int main() {
char *s = new char[1000010];
scanf("%s", s);
char *s_compr = new char[1000010];
int N = 0, N_compr = 0;
while (s[N]) {
if (N == 0 || s_compr[N_compr - 1] != s[N])
s_compr[N_compr++] = s[N];
N++;
}
delete[] s;
int cnt[3... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 773,772 | 773,771 | u642082255 | cpp |
p02968 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 505
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 505
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3... | [
"call.arguments.change"
] | 773,773 | 773,774 | u979500307 | cpp |
p02968 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
const int N = 502;
int n, M, i, j, k, L[N], R[N], o, t;
ll f[N][N], Ans;
struct Uzi {
int id, u, v;
bool operator<(const Uzi &k) const {
if (u != k.u)
return u < k.u;
return v < k.v;
}
} p[N];
void i... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
const int N = 502;
int n, M, i, j, k, L[N], R[N], o, t;
ll f[N][N], Ans;
struct Uzi {
int id, u, v;
bool operator<(const Uzi &k) const {
if (u != k.u)
return u < k.u;
return v < k.v;
}
} p[N];
void i... | [
"assignment.change"
] | 773,779 | 773,780 | u517245163 | cpp |
p02968 | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int N = 300;
int n, mod, Nf, Ng;
vector<pair<int, int>> Epr;
int Ef[N + 3][N + 3];
int main() {
scanf("%d%d", &n, &mod);
Nf = 2 * n - 1;
Ng = 2 * n - 1;
for (int i = 0; i < 2 * n; i++) {
... | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int N = 700;
int n, mod, Nf, Ng;
vector<pair<int, int>> Epr;
int Ef[N + 3][N + 3];
int main() {
scanf("%d%d", &n, &mod);
Nf = 2 * n - 1;
Ng = 2 * n - 1;
for (int i = 0; i < 2 * n; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 773,790 | 773,791 | u414712570 | cpp |
p02968 | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int N = 300;
int n, mod, Nf, Ng;
vector<pair<int, int>> Epr;
int Ef[N + 3][N + 3];
int main() {
scanf("%d%d", &n, &mod);
Nf = 2 * n - 1;
Ng = 2 * n - 1;
for (int i = 0; i < 2 * n; i++) {
... | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int N = 700;
int n, mod, Nf, Ng;
vector<pair<int, int>> Epr;
int Ef[N + 3][N + 3];
int main() {
scanf("%d%d", &n, &mod);
Nf = 2 * n - 1;
Ng = 2 * n - 1;
for (int i = 0; i < 2 * n; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 773,790 | 773,792 | u414712570 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int cnt = 0;
while (n < 0) {
cnt++;
n -= 2 * d + 1;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int cnt = 0;
while (n > 0) {
cnt++;
n -= 2 * d + 1;
}
cout << cnt << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 773,797 | 773,798 | u796877631 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int ans;
ans = N / (2 * D + 1);
if (ans * (2 * D + 1) > N)
ans++;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int ans;
ans = N / (2 * D + 1);
if (ans * (2 * D + 1) < N)
ans++;
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 773,799 | 773,800 | u429665788 | cpp |
p02970 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 773,809 | 773,810 | u971166345 | cpp |
p02970 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
int n, d;
cin >> n >> d;
cout << ceil(n / (2 * d + 1)) << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
int n, d;
cin >> n >> d;
cout << ceil((double)n / (2 * d + 1)) << endl;
return 0;
} | [
"type_conversion.add"
] | 773,825 | 773,826 | u932319885 | cpp |
p02970 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
int n, d;
cin >> n >> d;
cout << floor(n / (2 * d + 1)) << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
int n, d;
cin >> n >> d;
cout << ceil((double)n / (2 * d + 1)) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 773,827 | 773,826 | u932319885 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, h, ans;
cin >> n >> d;
h = d * 1;
ans = n / h;
if (n % h > 0) {
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, h, ans;
cin >> n >> d;
h = d * 2 + 1;
ans = n / h;
if (n % h > 0) {
ans++;
}
cout << ans << endl;
} | [
"assignment.change"
] | 773,836 | 773,837 | u442754977 | cpp |
p02970 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << ceil(n / (2 * d + 1)) << endl;
} | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
float n, d;
cin >> n >> d;
cout << ceil(n / (2 * d + 1)) << endl;
} | [
"variable_declaration.type.primitive.change"
] | 773,848 | 773,849 | u267222408 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | [
"expression.operation.binary.remove"
] | 773,852 | 773,853 | u547754910 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, d;
cin >> n >> d;
b = 2 * d + 1;
cout << (n + d - 1) / d;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, d;
cin >> n >> d;
b = 2 * d + 1;
cout << (n + b - 1) / b;
} | [
"identifier.change",
"io.output.change"
] | 773,858 | 773,859 | u930243369 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, d;
cin >> n >> d;
b = 2 * d + 1;
cout << n + d - 1 / d;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, d;
cin >> n >> d;
b = 2 * d + 1;
cout << (n + b - 1) / b;
} | [
"identifier.change",
"io.output.change"
] | 773,860 | 773,859 | u930243369 | cpp |
p02970 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int x, long long int y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
int main(void) {
double n, d;
cin >> n >> d;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int x, long long int y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
int main(void) {
double n, d;
cin >> n >> d;
... | [
"call.arguments.change"
] | 773,864 | 773,865 | u114838227 | cpp |
p02970 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
for (i = 0;; i++) {
if (a < (1 + 2 * b) * i)
break;
}
cout << i << endl;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
for (i = 0;; i++) {
if (a <= (1 + 2 * b) * i)
break;
}
cout << i << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 773,875 | 773,876 | u937275419 | cpp |
p02970 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int n, d, m;
cin >> n >> d;
d *= 2;
m = n / d;
if (n % d > 0) {
m++;
}
cout << m;
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int n, d, m;
cin >> n >> d;
d *= 2;
d++;
m = n / d;
if (n % d > 0) {
m++;
}
cout << m;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 773,889 | 773,890 | u834488582 | cpp |
p02970 | #include <stdio.h>
int solve(int n, int d);
int main() {
int n, d;
//入力
scanf("%d%d", &n, &d);
int ans = solve(n, d);
printf("%d\n", ans);
return 0;
}
int solve(int n, int d) {
if (n < 0)
return 0;
else
return solve(n - (2 * d + 1), d) + 1;
} | #include <stdio.h>
int solve(int n, int d);
int main() {
int n, d;
//入力
scanf("%d%d", &n, &d);
int ans = solve(n, d);
printf("%d\n", ans);
return 0;
}
int solve(int n, int d) {
if (n <= 0)
return 0;
else
return solve(n - (2 * d + 1), d) + 1;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 773,900 | 773,901 | u469783285 | cpp |
p02970 | #include <stdio.h>
int solve(int n, int d);
int main() {
int n, d;
//入力
scanf("%d%d", &n, &d);
int ans = solve(n, d);
printf("%d\n", ans);
return 0;
}
int solve(int n, int d) {
if (n > 0)
return 0;
else
return solve(n - (2 * d + 1), d) + 1;
} | #include <stdio.h>
int solve(int n, int d);
int main() {
int n, d;
//入力
scanf("%d%d", &n, &d);
int ans = solve(n, d);
printf("%d\n", ans);
return 0;
}
int solve(int n, int d) {
if (n <= 0)
return 0;
else
return solve(n - (2 * d + 1), d) + 1;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 773,902 | 773,901 | u469783285 | cpp |
p02970 | #include <stdio.h>
int solve(int n, int d);
int main() {
int n, d;
//入力
scanf("%d%d", &n, &d);
int ans = solve(n, d);
printf("%d\n", ans);
return 0;
}
int solve(int n, int d) {
if (n > 0)
return 0;
else
solve(n - (2 * d + 1), d) + 1;
} | #include <stdio.h>
int solve(int n, int d);
int main() {
int n, d;
//入力
scanf("%d%d", &n, &d);
int ans = solve(n, d);
printf("%d\n", ans);
return 0;
}
int solve(int n, int d) {
if (n <= 0)
return 0;
else
return solve(n - (2 * d + 1), d) + 1;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add"
] | 773,903 | 773,901 | u469783285 | cpp |
p02970 | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | [
"variable_declaration.type.primitive.change"
] | 773,904 | 773,905 | u685346012 | cpp |
p02970 | #include <algorithm>
#include <bitset>
#include <cfenv>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
usi... | #include <algorithm>
#include <bitset>
#include <cfenv>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
usi... | [
"expression.operation.binary.add"
] | 773,906 | 773,907 | u143100985 | cpp |
p02970 | #include <algorithm>
#include <bitset>
#include <cfenv>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
usi... | #include <algorithm>
#include <bitset>
#include <cfenv>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
usi... | [
"identifier.change",
"call.function.near.change",
"io.output.change"
] | 773,908 | 773,907 | u143100985 | cpp |
p02970 | #include <algorithm>
#include <bitset>
#include <cfenv>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
usi... | #include <algorithm>
#include <bitset>
#include <cfenv>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
usi... | [
"identifier.change",
"call.function.near.change",
"io.output.change"
] | 773,909 | 773,907 | u143100985 | cpp |
p02970 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(void) {
int n, d;
cin >> n >> d;
cout << (n + 2 * d - 1) / (2 * d);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(void) {
int n, d;
cin >> n >> d;
cout << (n + 2 * d) / (2 * d + 1);
}
| [
"expression.operation.binary.remove"
] | 773,912 | 773,913 | u243407720 | cpp |
p02970 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define PB push_back
#define MP make_pairA
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, d;
cin >> n >> d;
cout << n / (d * 2 + 1) << endl;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define PB push_back
#define MP make_pairA
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, d;
cin >> n >> d;
cout << (n + d * 2) / (d * 2 + 1) << endl;
}
| [] | 773,918 | 773,919 | u572537642 | cpp |
p02970 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース... | [
"variable_declaration.type.primitive.change"
] | 773,933 | 773,934 | u154645927 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, d;
cin >> n >> d;
d *= 2;
cout << ll(ceil(1.0 * n / d));
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, d;
cin >> n >> d;
d = 2 * d + 1;
cout << ll(ceil(1.0 * n / d));
}
| [
"assignment.value.change",
"assignment.change"
] | 773,935 | 773,936 | u193637378 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, x;
cin >> n >> x;
cout << (n + 2 * x - 1) / (2 * x) << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, x;
cin >> n >> x;
cout << (n + 2 * x) / (2 * x + 1) << '\n';
return 0;
}
| [
"expression.operation.binary.remove"
] | 773,941 | 773,942 | u577246184 | cpp |
p02970 | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false... | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false... | [
"expression.operation.binary.remove"
] | 773,943 | 773,944 | u032226420 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int ans = 0;
int range = d * 2 + 1;
for (int i = 0; n > 1; i++) {
ans++;
n -= range;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int ans = 0;
int range = d * 2 + 1;
for (int i = 0; n > 0; i++) {
ans++;
n -= range;
}
cout << ans;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 773,960 | 773,961 | u260907804 | cpp |
p02970 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int N, D, X_beta;
int X = 0;
int count = 0;
cin >> N >> D;
X_beta = 2 * D + 1;
while (N >= X) {
++c... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int N, D, X_beta;
int X = 0;
int count = 0;
cin >> N >> D;
X_beta = 2 * D + 1;
while (N > X) {
++co... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 773,964 | 773,965 | u949097771 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << int(ceil(n / (d + d + 1)));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, d;
cin >> n >> d;
cout << int(ceil((float)n / float(d + d + 1)));
return 0;
}
| [
"type_conversion.add",
"call.add",
"call.arguments.change"
] | 773,970 | 773,971 | u767871438 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int d;
cin >> d;
cout << (n - (d * 2)) / (d * 2 + 1);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int d;
cin >> d;
cout << (n + (d * 2)) / (d * 2 + 1);
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 773,985 | 773,986 | u901813121 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << "\n";
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define rep1(i, a, n) for (int i = a; i >= n; --i)
#define pb push_back
#define mp make_pair
#define int long long
#define fr first
#define sc second
#define vc vector
#... | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << "\n";
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define rep1(i, a, n) for (int i = a; i >= n; --i)
#define pb push_back
#define mp make_pair
#define int long long
#define fr first
#define sc second
#define vc vector
#... | [
"expression.operation.binary.remove"
] | 773,991 | 773,992 | u177897754 | cpp |
p02970 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int count = 0;
int tree[20];
for (int i = 0; i < n; i++) {
tree[i] = 0;
}
for (int i = 0; i < n; i++) {
if (tree[i] == 0) {
for (int j = i; j <= i + 2 * d; j++) {
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int count = 0;
int tree[100];
for (int i = 0; i < n; i++) {
tree[i] = 0;
}
for (int i = 0; i < n; i++) {
if (tree[i] == 0) {
for (int j = i; j <= i + 2 * d; j++) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 773,995 | 773,996 | u738164318 | cpp |
p02970 | #include <iostream>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
int main(void) {
int N, D;
cin >> N >> D;
cout << (N + (2 * D - 1)) / (2 * D) << endl;
return 0;
} | #include <iostream>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
int main(void) {
int N, D;
cin >> N >> D;
cout << (N + 2 * D) / (2 * D + 1) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 774,005 | 774,006 | u664652017 | cpp |
p02970 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
int ans = (n + 2 * d) / 2 * d + 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
int ans = (n + 2 * d) / (2 * d + 1);
cout << ans << endl;
}
| [] | 774,007 | 774,008 | u902803949 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define _GLIBCXX_DEBUG
static const int MAX = 20;
int main() {
int N, D, ans;
cin >> N >> D;
rep(i, N) {
if ((2 * D + 1) * i >= N) {
ans = i;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define _GLIBCXX_DEBUG
static const int MAX = 20;
int main() {
int N, D, ans;
cin >> N >> D;
rep2(i, 1, N + 1) {
if ((2 * D + 1) * i >= N) {
ans ... | [
"call.arguments.add"
] | 774,029 | 774,030 | u378125390 | cpp |
p02970 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
int a;
a = 0;
int enp;
enp = 0;
rep(i, n) {
a += 2 * d;
enp++;
if (a >= n) {
break;
}
}
cout << enp << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
int a;
a = 0;
int enp;
enp = 0;
rep(i, n) {
a += 2 * d + 1;
enp++;
if (a >= n) {
break;
}
}
cout << enp << endl;
}
| [
"assignment.change"
] | 774,068 | 774,069 | u274883254 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, d;
cin >> n >> d;
cout << ceil((n - 1) / float(2 * d)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, d;
cin >> n >> d;
cout << ceil(n / float(2 * d + 1)) << endl;
return 0;
}
| [
"call.arguments.change"
] | 774,074 | 774,075 | u006425112 | cpp |
p02970 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int D;
cin >> N >> D;
int ans = (N + (2 * D) - 1) / (2 * D);
cout << ans << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int D;
cin >> N >> D;
int ans = (N + (2 * D + 1) - 1) / (2 * D + 1);
cout << ans << endl;
} | [
"assignment.change"
] | 774,084 | 774,085 | u419501474 | cpp |
p02970 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, d;
cin >> n >> d;
cout << ceil(n / float(2 * d)) << endl;
// system("pause");
retu... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, d;
cin >> n >> d;
cout << ceil(n / float(2 * d + 1)) << endl;
// system("pause");
... | [
"expression.operation.binary.add"
] | 774,092 | 774,093 | u438265890 | cpp |
p02970 | #include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int i = d + 1, count = 0;
while ((i - d) <= n) {
count += 2;
i += 2 * d + 1;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int i = d + 1, count = 0;
while ((i - d) <= n) {
count++;
i += 2 * d + 1;
}
cout << count << endl;
return 0;
}
| [] | 774,108 | 774,109 | u006279390 | cpp |
p02970 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | [
"type_conversion.add"
] | 774,110 | 774,111 | u843739531 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int s = 2 * d + 1;
int a = n / s;
if (n % s > 0) {
s = s + 1;
}
cout << s;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int s = 2 * d + 1;
int a = n / s;
if (n % s > 0) {
a = a + 1;
}
cout << a;
} | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 774,123 | 774,124 | u069273180 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d;
cin >> n >> d;
cout << floor((n * 1.0) / (2 * d + 1)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d;
cin >> n >> d;
cout << ceil((n * 1.0) / (2 * d + 1)) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 774,125 | 774,126 | u708590262 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, D;
cin >> N >> D;
int ans;
rep(i, N) { // i人を置くとする
if ((2 * D + 1) * i >= N) {
ans = i;
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
int main() {
int N, D;
cin >> N >> D;
int ans;
rep(i, N + 1) { // i人を置くとする(1~N人)
if ((2 * D + 1) * i >= N) {
ans = i;
break;
}
}
cout << ans << endl;
} | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 774,137 | 774,138 | u319179101 | cpp |
p02970 | #include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int a = 2 * d + 1;
int ans = n / d;
if (n % d > 0)
ans++;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int a = 2 * d + 1;
int ans = n / a;
if (n % a > 0)
ans++;
cout << ans << endl;
return 0;
} | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 774,141 | 774,142 | u367199607 | cpp |
p02970 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"expression.operation.binary.add"
] | 774,161 | 774,162 | u186359321 | cpp |
p02970 | /**************************************
Author : Susanka Majumder ( bingobong )
***************************************/
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp... | /**************************************
Author : Susanka Majumder ( bingobong )
***************************************/
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp... | [] | 774,167 | 774,168 | u562820818 | cpp |
p02970 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 774,173 | 774,174 | u525288965 | cpp |
p02970 | #include <iostream>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << N / (2 * D + 1) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << (N + 2 * D) / (2 * D + 1) << endl;
return 0;
} | [] | 774,196 | 774,197 | u152315108 | cpp |
p02970 | #include <iostream>
#include <math.h>
using namespace std;
main() {
float n, d, ans;
cin >> n >> d;
ans = ceil(n / (2 * d));
cout << ans << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
main() {
float n, d, ans;
cin >> n >> d;
ans = ceil(n / (2 * d + 1));
cout << ans << endl;
} | [
"assignment.change"
] | 774,220 | 774,221 | u703537155 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
int count = 0;
cin >> n;
cin >> d;
count = ceil(n / (2 * d + 1));
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
float n, d;
int count = 0;
cin >> n;
cin >> d;
count = ceil(n / (2 * d + 1));
cout << count;
} | [
"variable_declaration.type.primitive.change"
] | 774,322 | 774,323 | u793276813 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
double tmpdou;
int tmpint;
int n, d;
cin >> n >> d;
tmpint = n / (1 + 2 * d);
tmpdou = n / (1 + 2 * d);
if (tmpint < tmpdou)
tmpint++;
cout << tmpint << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double tmpdou;
int tmpint;
int n, d;
cin >> n >> d;
tmpint = n / (1.0 + 2 * d);
tmpdou = n / (1.0 + 2 * d);
if (tmpint < tmpdou)
tmpint++;
cout << tmpint << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 774,328 | 774,329 | u059207724 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
double tmpdou;
int tmpint;
int n, d;
cin >> n >> d;
tmpint = n / (1 + 2 * d);
tmpdou = n / (1 + 2 * d);
if (tmpint < tmpdou)
tmpint + 1;
cout << tmpint << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double tmpdou;
int tmpint;
int n, d;
cin >> n >> d;
tmpint = n / (1.0 + 2 * d);
tmpdou = n / (1.0 + 2 * d);
if (tmpint < tmpdou)
tmpint++;
cout << tmpint << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 774,330 | 774,329 | u059207724 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define LLI long long int
#define _min(a, b) ((a <... | #include <bits/stdc++.h>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define LLI long long int
#define _min(a, b) ((a <... | [
"call.arguments.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 774,347 | 774,348 | u840105874 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int res;
res = (N + D * 2) / (D * 2 + 1) + 1;
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int res;
res = (N + D * 2) / (D * 2 + 1);
cout << res << endl;
} | [
"expression.operation.binary.remove"
] | 774,349 | 774,350 | u650773146 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << ceil(N / (2 * (D + 1))) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << ceil((double)N / (2 * D + 1)) << endl;
} | [
"call.arguments.change"
] | 774,360 | 774,361 | u656368720 | cpp |
p02970 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, D;
int n = 0;
cin >> N >> D;
while ((2 * D * n + n) <= N)
n++;
cout << n << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, D;
int n = 0;
cin >> N >> D;
while ((2 * D * n + n) < N)
n++;
cout << n << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 774,381 | 774,382 | u297292406 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
d = 2 * d + 1;
cout << ceil(n / d);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
d = 2 * d + 1;
cout << ceil(n / (float)d);
} | [
"type_conversion.add"
] | 774,397 | 774,398 | u085643978 | cpp |
p02970 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
constexpr static ll MOD = 1000000007ll;
constexpr static int INF = 1 << 28; // for x <= 10^9
constexpr static ll INFL = 1ll << 60; // for x <= 10^19
constexpr static double EPS = 1e-10;
int main() {
int n, d;
cin >> n >> d;
int ans = ceil((d... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
constexpr static ll MOD = 1000000007ll;
constexpr static int INF = 1 << 28; // for x <= 10^9
constexpr static ll INFL = 1ll << 60; // for x <= 10^19
constexpr static double EPS = 1e-10;
int main() {
int n, d;
cin >> n >> d;
int ans = ceil((d... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 774,402 | 774,403 | u784448849 | cpp |
p02970 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
constexpr static ll MOD = 1000000007ll;
constexpr static int INF = 1 << 28; // for x <= 10^9
constexpr static ll INFL = 1ll << 60; // for x <= 10^19
constexpr static double EPS = 1e-10;
int main() {
int n, d;
cin >> n >> d;
int ans = ceil((d... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
constexpr static ll MOD = 1000000007ll;
constexpr static int INF = 1 << 28; // for x <= 10^9
constexpr static ll INFL = 1ll << 60; // for x <= 10^19
constexpr static double EPS = 1e-10;
int main() {
int n, d;
cin >> n >> d;
int ans = ceil((d... | [] | 774,404 | 774,403 | u784448849 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int n, d;
int main() {
cin >> n >> d;
cout << (n + 2 * d - 1) / (2 * d + 1);
} | #include <bits/stdc++.h>
using namespace std;
int n, d;
int main() {
cin >> n >> d;
cout << (n + 2 * d) / (2 * d + 1);
}
| [
"expression.operation.binary.remove"
] | 774,408 | 774,409 | u709966987 | cpp |
p02970 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (int)ceil(1.0 * n / (2 * d - 1)) << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (int)ceil(1.0 * n / (2 * d + 1)) << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 774,415 | 774,416 | u338990986 | cpp |
p02970 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | [
"assignment.change"
] | 774,427 | 774,428 | u650565403 | cpp |
p02970 | #include <iostream>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << N / (2 * D) + (N % (2 * D) > 0) << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << N / (2 * D + 1) + (N % (2 * D + 1) > 0) << endl;
} | [
"expression.operation.binary.add"
] | 774,456 | 774,457 | u498467508 | cpp |
p02970 | #include <iostream>
using namespace std;
int main() {
int N, D;
cin >> N, D;
cout << N / (2 * D) + (N % (2 * D) > 0) << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << N / (2 * D + 1) + (N % (2 * D + 1) > 0) << endl;
} | [
"expression.operation.binary.add"
] | 774,458 | 774,457 | u498467508 | cpp |
p02970 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double n, d;
cin >> n >> d;
cout << floor(n / (2 * d + 1)) << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double n, d;
cin >> n >> d;
cout << ceil(n / (2 * d + 1)) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 774,465 | 774,466 | u689193446 | cpp |
p02970 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, d;
scanf("%d %d", &n, &d);
d *= 2;
printf("%d\n", (n + d - 1) / d);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, d;
scanf("%d %d", &n, &d);
d = 2 * d + 1;
printf("%d\n", (n + d - 1) / d);
return 0;
} | [
"assignment.value.change",
"assignment.change"
] | 774,469 | 774,470 | u315350841 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int i = 0;
while (((D * 2) + 1) * i <= N) {
i++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int i = 0;
while (((D * 2) + 1) * i < N) {
i++;
}
cout << i << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 774,477 | 774,478 | u337024735 | cpp |
p02970 | #define REP(i, t, n) for (int i = t; i < n; i++)
#define ALL(n) (n).begin(), (n).end()
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include... | #define REP(i, t, n) for (int i = t; i < n; i++)
#define ALL(n) (n).begin(), (n).end()
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include... | [
"literal.number.change",
"variable_declaration.value.change"
] | 774,502 | 774,503 | u717315282 | cpp |
p02970 |
#include <iostream>
#include <math.h>
int main() {
int n, d;
std::cin >> n >> d;
int num = (int)ceil((double)n / (2 * d));
std::cout << num;
return 0;
} |
#include <iostream>
#include <math.h>
int main() {
int n, d;
std::cin >> n >> d;
int num = (int)ceil((double)n / (2 * d + 1));
std::cout << num;
return 0;
} | [
"assignment.change"
] | 774,519 | 774,520 | u889915625 | cpp |
p02970 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 774,528 | 774,529 | u261965335 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll l... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll l... | [
"expression.operation.binary.add"
] | 774,542 | 774,543 | u630231163 | cpp |
p02970 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int d = b * 2 + 1;
cout << (a - (d - 1)) / d << '\n';
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int d = b * 2 + 1;
cout << (a + (d - 1)) / d << '\n';
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 774,551 | 774,552 | u603234915 | cpp |
p02970 | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namesp... | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namesp... | [
"expression.unary.arithmetic.add"
] | 774,564 | 774,565 | u165374901 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << n / (2 * d + 1) + 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, d;
cin >> n >> d;
cout << ceil(n / (2 * d + 1));
return 0;
} | [
"variable_declaration.type.primitive.change",
"call.add",
"io.output.change"
] | 774,568 | 774,569 | u152997492 | cpp |
p02970 | #include <iostream>
#include <math.h>
using namespace std;
void func_b(int N, int D) {
int range = 2 * D + 1;
cout << ceil(N / range);
}
int main() {
int N, D;
cin >> N >> D;
func_b(N, D);
}
| #include <iostream>
#include <math.h>
using namespace std;
void func_b(int N, int D) {
double range = 2 * D + 1;
cout << (int)ceil(N / range);
}
int main() {
int N, D;
cin >> N >> D;
func_b(N, D);
}
| [
"variable_declaration.type.primitive.change"
] | 774,583 | 774,584 | u096502015 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d;
cin >> n >> d;
long long ab = 2 * d;
cout << ceil((n * 1.0) / ab);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d;
cin >> n >> d;
long long ab = 2 * d + 1;
cout << ceil((n * 1.0) / ab);
} | [
"assignment.change"
] | 774,587 | 774,588 | u870168650 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int ans;
ans = ceil(N / (2 * D + 1));
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
float N, D;
cin >> N >> D;
float ans;
ans = ceil(N / (2 * D + 1));
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 774,599 | 774,600 | u349117935 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, D;
cin >> N >> D;
// cout << N << ";" << D << endl;
cout << ceil(N / (2 * D)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double N, D;
cin >> N >> D;
// cout << N << ";" << D << endl;
cout << ceil(N / ((2 * D) + 1)) << endl;
}
| [
"call.arguments.change"
] | 774,603 | 774,604 | u995485610 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int n, d;
int main(void) {
// Here your code !
scanf("%d %d", &n, &d);
printf("%d", (n - 1 + 2 * d) / (2 * d));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int n, d;
int main(void) {
// Here your code !
scanf("%d %d", &n, &d);
printf("%d", (n - 1 + 2 * d + 1) / (2 * d + 1));
return 0;
}
| [
"expression.operation.binary.add"
] | 774,621 | 774,622 | u497422208 | cpp |
p02970 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define pb push_back
#define vi vector<int>
#define vl vector<long long>
#define MOD 1000000007
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define forn(i, n) for (int i = 0; i ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define pb push_back
#define vi vector<int>
#define vl vector<long long>
#define MOD 1000000007
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define forn(i, n) for (int i = 0; i ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 774,625 | 774,626 | u391675729 | cpp |
p02970 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int m;
m = 2 * d + 1;
int p = 0;
for (int i = 0; i < n; i++) {
if (n <= m * i) {
p = i;
break;
}
}
cout << p << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int m;
m = 2 * d + 1;
int p = 0;
for (int i = 1; i <= n; i++) {
if (n <= m * i) {
p = i;
break;
}
}
cout << p << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 774,629 | 774,630 | u208102827 | cpp |
p02970 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int N, D;
cin >> N >> D;
int r = N % (2 * D);
int ans = N / (2 * D);
if (r > 0)
ans++;
cout << ans << endl;
}
| #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int N, D;
cin >> N >> D;
int r = N % (2 * D + 1);
int ans = N / (2 * D + 1);
if (r > 0)
ans++;
cout << ans << endl;
}
| [
"assignment.change"
] | 774,639 | 774,640 | u904131021 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (n + 2 * d - 2) / (2 * d - 1);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (n + 2 * d) / (2 * d + 1);
}
| [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 774,650 | 774,651 | u115838990 | cpp |
p02970 | /*input
9 5
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma GCC optimize("u... | /*input
9 5
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma GCC optimize("u... | [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 774,686 | 774,687 | u110464018 | cpp |
p02970 | #include <iostream>
using namespace std;
int main() {
int n, d, a, b, c = 0, cnt = 0, i;
cin >> n >> d;
for (i = 1; i < n; i++) {
a = i - d;
b = i + d;
c += b - a + 1;
cnt++;
if (c >= n) {
// cnt++;
break;
}
}
cout << cnt << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, d, a, b, c = 0, cnt = 0, i;
cin >> n >> d;
for (i = 1; i <= n; i++) {
a = i - d;
b = i + d;
c += b - a + 1;
cnt++;
if (c >= n) {
// cnt++;
break;
}
}
cout << cnt << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 774,695 | 774,696 | u358577903 | cpp |
p02970 | #include <iostream>
using namespace std;
int main() {
int n, d, a, b, c = 0, cnt = 0, i;
cin >> n >> d;
for (i = 1; i < n; i++) {
a = i - d;
b = i + d;
c += b - a + 1;
cnt++;
if (c > n) {
// cnt++;
break;
}
}
cout << cnt << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, d, a, b, c = 0, cnt = 0, i;
cin >> n >> d;
for (i = 1; i <= n; i++) {
a = i - d;
b = i + d;
c += b - a + 1;
cnt++;
if (c >= n) {
// cnt++;
break;
}
}
cout << cnt << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 774,697 | 774,696 | u358577903 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
float n, d;
cin >> n >> d;
int x = ceil(n / (2 * d));
cout << x << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
float n, d;
cin >> n >> d;
int x = ceil(n / ((2 * d) + 1));
cout << x << endl;
} | [
"call.arguments.change"
] | 774,708 | 774,709 | u673058289 | cpp |
p02970 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
float result = (n * (1.0)) / (2 * d);
cout << round(result);
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
float result = (n * (1.0)) / (2 * d + 1);
cout << ceil(result);
} | [
"identifier.change",
"call.function.near.change",
"io.output.change"
] | 774,716 | 774,717 | u055711678 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.