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 8
values |
|---|---|---|---|---|---|---|---|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int an = K - X + 1;
for (int i = 0; i < 2 * K - 1; i++) {
cout << an << " ";
an++;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int an = X - K + 1;
for (int i = 0; i < 2 * K - 1; i++) {
cout << an << " ";
an++;
}
cout << endl;
}
|
[
"expression.operation.binary.remove"
] | 745,339
| 745,340
|
u615258936
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = -(K - 1); i < K; i++) {
cout << X + i;
}
cout << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = -(K - 1); i < K; i++) {
cout << X + i << " ";
}
cout << endl;
}
|
[
"io.output.change"
] | 745,357
| 745,358
|
u917518913
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; i++) {
cout << i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; i++) {
cout << i << ' ';
}
return 0;
}
|
[
"io.output.change"
] | 745,374
| 745,375
|
u175232503
|
cpp
|
p02946
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int left = k - (n - 1);
int right = k + (n + 1);
for (int i = left; i <= right; i++) {
cout << i << " ";
}
cout << endl;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int left = k - (n - 1);
int right = k + (n - 1);
for (int i = left; i <= right; i++) {
cout << i << " ";
}
cout << endl;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 745,376
| 745,377
|
u023473244
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int k, x;
cin >> k >> x;
for (int i = -1000000; i <= 1000000; i++)
if (abs(i - x) <= k)
cout << i << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int k, x;
cin >> k >> x;
for (int i = -1000000; i <= 1000000; i++)
if (abs(i - x) < k)
cout << i << " ";
cout << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 745,386
| 745,387
|
u168698471
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = 0; i < k; i++) {
cout << x + i << ' ';
}
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = -(k - 1); i < k; i++) {
cout << x + i << ' ';
}
}
|
[
"control_flow.loop.for.initializer.change"
] | 745,388
| 745,389
|
u061626279
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int l = x - k + 1;
int r = k + x + 1;
for (int i = l; i <= r; i++)
cout << i << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int l = x - k + 1;
int r = k + x - 1;
for (int i = l; i <= r; i++)
cout << i << " ";
cout << endl;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 745,402
| 745,403
|
u059990701
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
for (int i = n - x + 1; i <= n + x - 1; i++) {
cout << i << " ";
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
for (int i = x - n + 1; i <= n + x - 1; i++) {
cout << i << " ";
}
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 745,406
| 745,407
|
u094768815
|
cpp
|
p02946
|
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int K, X;
cin >> K >> X;
int s = max(X - K + 1, -1000000);
int e = min(X + K - 1, 1000000);
cout << s;
for (int x = s; x <= e; x++)
cout << " " << x;
cout << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int K, X;
cin >> K >> X;
int s = max(X - K + 1, -1000000);
int e = min(X + K - 1, 1000000);
cout << s;
for (int x = s + 1; x <= e; x++)
cout << " " << x;
cout << endl;
}
|
[
"control_flow.loop.for.initializer.change"
] | 745,418
| 745,419
|
u991692050
|
cpp
|
p02946
|
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int K, X;
cin >> K >> X;
for (int i = X - (K - 1); i < X + (K - 1); i++) {
if (i < -1000000)
i = -1000000;
cout << i;
if (i > 1000000)
break;
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int K, X;
cin >> K >> X;
for (int i = X - (K - 1); i <= X + (K - 1); i++) {
if (i < -1000000)
i = -1000000;
cout << i << " ";
if (i > 1000000)
break;
}
cout << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 745,428
| 745,429
|
u630765015
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x, min, max;
cin >> k >> x;
min = k - (x - 1);
max = k + x;
for (int i = min; i < max; i++) {
if (i == max - 1) {
cout << i << endl;
} else {
cout << i << " ";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x, min, max;
cin >> k >> x;
min = x - (k - 1);
max = x + k;
for (int i = min; i < max; i++) {
if (i == max - 1) {
cout << i << endl;
} else {
cout << i << " ";
}
}
}
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.change"
] | 745,432
| 745,433
|
u663775885
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
double k, x;
cin >> k >> x;
for (int i = x - (k - 1); i < x + (k - 1); i++) {
cout << i << ' ';
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
double k, x;
cin >> k >> x;
for (int i = x - (k - 1); i <= x + (k - 1); i++) {
cout << i << ' ';
}
cout << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,438
| 745,439
|
u747497660
|
cpp
|
p02946
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
#define ll long long
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k; i < x + k; i++) {
cout << i;
cout << ' ';
}
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
#define ll long long
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; i++) {
cout << i;
cout << ' ';
}
}
|
[
"control_flow.loop.for.initializer.change"
] | 745,440
| 745,441
|
u389766217
|
cpp
|
p02946
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int n, k;
int main() {
scanf("%d%d", &k, &n);
for (int p = n - k + 1; p <= n + k - 1; p++)
printf("%d", p);
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int n, k;
int main() {
scanf("%d%d", &k, &n);
for (int p = n - k + 1; p <= n + k - 1; p++)
printf("%d ", p);
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 745,444
| 745,445
|
u896820793
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int k, x;
cin >> k >> x;
rep(i, 2 * k - 1) cout << x - k + 1 + i;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int k, x;
cin >> k >> x;
rep(i, 2 * k - 1) cout << x - k + 1 + i << " ";
}
|
[
"expression.operation.binary.add"
] | 745,446
| 745,447
|
u441296840
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define ll long long
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
#define mp make_pair
#define tr(con) for (auto it = con.begin(); it != con.end(); it++)
#define INF 1e9 + 7
#define rep(i, l, r) for (i = l; i <= r; i++)
#define fo(i, n) for (ll i = 0; i < n; i++)
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k, x;
cin >> k >> x;
for (int i = max(-1000000, x - k - 1); i <= min(1000000, x + k - 1); i++) {
cout << i << " ";
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
#define mp make_pair
#define tr(con) for (auto it = con.begin(); it != con.end(); it++)
#define INF 1e9 + 7
#define rep(i, l, r) for (i = l; i <= r; i++)
#define fo(i, n) for (ll i = 0; i < n; i++)
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k, x;
cin >> k >> x;
// cout << max(-1000000,x-k+1)<<"\n";
for (int i = max(-1000000, x - k + 1); i <= min(1000000, x + k - 1); i++) {
cout << i << " ";
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 745,448
| 745,449
|
u243556669
|
cpp
|
p02946
|
#define _USE_MATH_DEFINES
//
#include <bits/stdc++.h>
//
using namespace std;
//
#define krep(i, k, n) for (int i = k; i < n; ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define toupp(s) transform(s.begin(), s.end(), s.begin(), ::toupper) // string
#define tolow(s) transform(s.begin(), s.end(), s.begin(), ::tolower) // string
#define pb(v) push_back(v)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define __sort(v) sort(v.begin(), v.end()) // vector
#define __stable_sort(v) stable_sort(v.begin(), v.end()) // vector
#define __exists(c, v) (find(all(c), (v)) != (c).end()) // vector
#define __unique(v) \
__sort(v); \
v.erase(unique(v.begin(), v.end()), v.end()) // vector
#define __swap(a, b, tmp) \
tmp = a; \
a = b; \
b = tmp;
#define __memset(a) memset(a, 0, sizeof(a));
//
#define dumpVar(v) cout << setw(30) << #v " = [" << v << "]" << endl
#define dumpArr(v, n) \
for (int i = 0; i < n; ++i) { \
cout << v[i] << ", "; \
} \
cout << endl
#define dumpPair(p) cout << "<" << p.first << ", " << p.second << ">" << endl
//
typedef long long ll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
//
int main() {
ios::sync_with_stdio(false);
//
/* code start */
int k, x;
cin >> k >> x;
dumpVar(k);
dumpVar(x);
vi arr;
for (int i = -k + 1; i < k; ++i) {
arr.pb(x - i);
__sort(arr);
}
for (int i = 0; i < arr.size(); ++i) {
if (i == 0)
cout << arr[i];
else
cout << " " << arr[i];
}
cout << endl;
/* code end */
//
return 0;
}
|
#define _USE_MATH_DEFINES
//
#include <bits/stdc++.h>
//
using namespace std;
//
#define krep(i, k, n) for (int i = k; i < n; ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define toupp(s) transform(s.begin(), s.end(), s.begin(), ::toupper) // string
#define tolow(s) transform(s.begin(), s.end(), s.begin(), ::tolower) // string
#define pb(v) push_back(v)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define __sort(v) sort(v.begin(), v.end()) // vector
#define __stable_sort(v) stable_sort(v.begin(), v.end()) // vector
#define __exists(c, v) (find(all(c), (v)) != (c).end()) // vector
#define __unique(v) \
__sort(v); \
v.erase(unique(v.begin(), v.end()), v.end()) // vector
#define __swap(a, b, tmp) \
tmp = a; \
a = b; \
b = tmp;
#define __memset(a) memset(a, 0, sizeof(a));
//
#define dumpVar(v) cerr << setw(30) << #v " = [" << v << "]" << endl
#define dumpArr(v, n) \
for (int i = 0; i < n; ++i) { \
cerr << v[i] << ", "; \
} \
cerr << endl
#define dumpPair(p) cout << "<" << p.first << ", " << p.second << ">" << endl
//
typedef long long ll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
//
int main() {
ios::sync_with_stdio(false);
//
/* code start */
int k, x;
cin >> k >> x;
dumpVar(k);
dumpVar(x);
vi arr;
for (int i = -k + 1; i < k; ++i) {
arr.pb(x - i);
__sort(arr);
}
for (int i = 0; i < arr.size(); ++i) {
if (i == 0)
cout << arr[i];
else
cout << " " << arr[i];
}
cout << endl;
/* code end */
//
return 0;
}
|
[
"preprocessor.define.value.change"
] | 745,450
| 745,451
|
u387775996
|
cpp
|
p02946
|
#include <stdio.h>
int main() {
int k, x;
scanf("%d %d", k, x);
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d ", i);
}
printf("\n");
return 0;
}
|
#include <stdio.h>
int main() {
int k, x;
scanf("%d %d", &k, &x);
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d ", i);
}
printf("\n");
return 0;
}
|
[
"expression.operation.unary.reference.add"
] | 745,452
| 745,453
|
u438565384
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k;
for (int i = x - k + 1; i < x + k; ++i)
cout << i << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; ++i)
cout << i << " ";
cout << endl;
}
|
[
"expression.operation.binary.add"
] | 745,464
| 745,465
|
u971421535
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = max(-1000000, k - x + 1); i < min(1000001, k + x); i++)
cout << i << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = max(-1000000, x - k + 1); i < min(1000001, k + x); i++)
cout << i << " ";
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 745,466
| 745,467
|
u741543978
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int i;
for (int i = x - k + 1; i < k + x; i++) {
cout << i;
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int i;
for (int i = x - k + 1; i < k + x; i++) {
cout << i << " ";
}
cout << endl;
return 0;
}
|
[
"io.output.change"
] | 745,473
| 745,474
|
u336661869
|
cpp
|
p02946
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
const ll mod = 1e9 + 7;
#define REP(i, o, n) for (ll i = o; i < n; i++)
#define rep(i, n) REP(i, 0, n)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(b, a % b) * b; }
void actual() {
ll k, x;
cin >> k >> x;
ll s = x - k, e = x + k;
REP(i, s, e) {
if (k == 1) {
cout << x << endl;
return;
}
if (i == s) {
printf("%d", i);
} else {
printf(" %d", i);
}
}
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
actual();
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
const ll mod = 1e9 + 7;
#define REP(i, o, n) for (ll i = o; i < n; i++)
#define rep(i, n) REP(i, 0, n)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(b, a % b) * b; }
void actual() {
ll k, x;
cin >> k >> x;
ll s = x - k, e = x + k;
REP(i, s + 1, e) {
if (k == 1) {
cout << x << endl;
return;
}
if (i == s) {
printf("%d", i);
} else {
printf(" %d", i);
}
}
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
actual();
return 0;
}
|
[
"expression.operation.binary.add"
] | 745,484
| 745,485
|
u453070758
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
for (i = -a; i <= a; i++) {
cout << b + i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
for (i = -a + 1; i <= a - 1; i++) {
cout << b + i << " ";
}
}
|
[
"control_flow.loop.for.initializer.change",
"assignment.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 745,486
| 745,487
|
u016726316
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i != x + k - 1; i++) {
cout << i;
if (i != x + k - 1) {
cout << ' ';
}
}
cout << '\n';
}
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << i;
if (i != x + k - 1) {
cout << ' ';
}
}
cout << '\n';
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 745,491
| 745,492
|
u589810630
|
cpp
|
p02946
|
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int i, k, x, ans;
cin >> k >> x;
for (i = 0; i < (2 * k - 1); i++) {
if (i != 0)
cout << " ";
cout << x - i - (k - 1);
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int i, k, x, ans;
cin >> k >> x;
for (i = 0; i < (2 * k - 1); i++) {
if (i != 0)
cout << " ";
cout << x + i - (k - 1);
}
cout << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 745,502
| 745,503
|
u736278528
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int l = X - (K - 1);
int r = X + (K - 1);
rep(i, r - l) { cout << l + i << " "; }
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int l = X - (K - 1);
int r = X + (K - 1);
rep(i, r - l + 1) { cout << l + i << " "; }
cout << endl;
return 0;
}
|
[
"expression.operation.binary.add"
] | 745,506
| 745,507
|
u000623733
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int l = X - (K - 1);
int r = X + (K - 1);
rep(i, r - l - 1) { cout << l + i << " "; }
cout << r << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int l = X - (K - 1);
int r = X + (K - 1);
rep(i, r - l + 1) { cout << l + i << " "; }
cout << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 745,508
| 745,507
|
u000623733
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int l = X - (K - 1);
int r = X + (K - 1);
if (r == l) {
cout << l << endl;
} else {
rep(i, r - l) { cout << l + i << " "; }
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int l = X - (K - 1);
int r = X + (K - 1);
if (r == l) {
cout << l << endl;
} else {
rep(i, r - l + 1) { cout << l + i << " "; }
cout << endl;
}
return 0;
}
|
[
"expression.operation.binary.add"
] | 745,509
| 745,510
|
u000623733
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define mm map<ii>
#define ff first
#define ss second
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define forv(i, m) for (auto i : m)
#define imx INT_MAX
#define imn INT_MIN
#define inf LONG_MAX
#define minf LONG_MIN
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define sze size()
#define rvs reverse
#define itr iterator
/*
#define MODM(a,b,md) ((a%md)*(b%md))%md
#define MODA(a,b,md) ((a%md)+(b%md))%md
#define ull unsigned long long int
#define si short int
*/
/*
bool compare(int a,int b) {return a > b;}
bool compare1(ppi a,ppi b) {return a.ff > b.ff;}
bool compare2(ppi a,ppi b) {return a.ss < b.ss;}
ll Npower(ll a,ll b) {ll product = 1; while(b){if(b&1){product = product*a;}a =
a*a;b = b>>1;} return product;} ll power(ll a,ll b,ll md) {ll product = 1;
while(b){if(b&1){product = MODM(product,a,md);}a = MODM(a,a,md);b = b>>1;}
return product%md;} ll GCD(ll a,ll b) {return b==0 ? a:GCD(b,a%b);} ll LCM(ll
a,ll b) {return (a/GCD(a,b))*b; }
*/
int main() {
fast
int a,
b;
cin >> a >> b;
for (int i = b - a + 1; i <= b + a - 1; i++) {
cout << i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define mm map<ii>
#define ff first
#define ss second
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define forv(i, m) for (auto i : m)
#define imx INT_MAX
#define imn INT_MIN
#define inf LONG_MAX
#define minf LONG_MIN
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define sze size()
#define rvs reverse
#define itr iterator
/*
#define MODM(a,b,md) ((a%md)*(b%md))%md
#define MODA(a,b,md) ((a%md)+(b%md))%md
#define ull unsigned long long int
#define si short int
*/
/*
bool compare(int a,int b) {return a > b;}
bool compare1(ppi a,ppi b) {return a.ff > b.ff;}
bool compare2(ppi a,ppi b) {return a.ss < b.ss;}
ll Npower(ll a,ll b) {ll product = 1; while(b){if(b&1){product = product*a;}a =
a*a;b = b>>1;} return product;} ll power(ll a,ll b,ll md) {ll product = 1;
while(b){if(b&1){product = MODM(product,a,md);}a = MODM(a,a,md);b = b>>1;}
return product%md;} ll GCD(ll a,ll b) {return b==0 ? a:GCD(b,a%b);} ll LCM(ll
a,ll b) {return (a/GCD(a,b))*b; }
*/
int main() {
fast
int a,
b;
cin >> a >> b;
for (int i = b - a + 1; i <= b + a - 1; i++) {
cout << i << " ";
}
return 0;
}
|
[
"io.output.change"
] | 745,514
| 745,515
|
u460819600
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// alias
#define gcd __gcd
#define pb push_back
#define all(x) (x).begin(), (x).end()
template <typename T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <typename T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
template <class T> int lb(vector<T> &x, T n) {
return lower_bound(all(x), n) - x.begin();
}
template <class T> int ub(vector<T> &x, T n) {
return upper_bound(all(x), n) - x.begin();
}
// for
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
// 入力
void in() {}
template <typename F, typename... R> bool in(F &f, R &...r) {
if (cin >> f) {
in(r...);
return true;
} else
return false;
}
// 出力
#define out(x) cout << (x)
#define space() cout << " "
#define indent() cout << '\n'
void print() {}
template <typename F, typename... R> void print(F f, R... r) {
out(f), indent(), print(r...);
}
// デバッグ出力
#define debughead(x) cerr << "Line " << __LINE__ << ": " << #x << ": "
#define debugout(x) cerr << (x) << " "
#define debugindent() cerr << '\n'
#define debug(x) debughead(x), debugout(x), debugindent()
// 脳死
#define YN(x) out((x) ? "YES" : "NO"), indent()
#define Yn(x) out((x) ? "Yes" : "No"), indent()
#define yn(x) out((x) ? "yes" : "no"), indent()
// const
int INF = 1e18, MOD = 1e9 + 7;
double EPS = 1e-15, PI = acos(-1);
int dx[] = {0, 0, 1, 0, -1, -1, 1, 1, -1},
dy[] = {0, -1, 0, 1, 0, -1, -1, 1, 1};
// 数学的な
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) { res *= n--, res /= i; }
return res;
}
bool isPrime(int n) {
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
if (!(n % i)) {
return false;
}
}
return true;
}
vector<int> divisor(int n) {
vector<int> ans;
rep(i, 1, sqrt(n) + 1) {
if (!(n % i)) {
ans.pb(i);
if (i * i < n) {
ans.pb(n / i);
}
}
}
return ans;
}
map<int, int> factorization(int n) {
map<int, int> ans;
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
while (!(n % i)) {
ans[i]++, n /= i;
}
}
if (n > 1) {
ans[n]++;
}
return ans;
}
// MOD int
int extgcd(int a, int b, int &x, int &y) {
int g = a;
x = 1, y = 0;
if (b) {
g = extgcd(b, a % b, y, x);
y -= a / b * x;
}
return g;
}
int invmod(int a, int m = MOD) {
int x = 0, y = 0;
extgcd(a, m, x, y);
return (x + m) % m;
}
struct mint {
int _num;
mint(int x = 0) : _num() {
_num = x % MOD;
if (_num < 0) {
_num += MOD;
}
}
inline mint operator=(int x) {
_num = x % MOD;
if (_num < 0) {
_num += MOD;
}
return *this;
}
inline mint operator=(mint x) {
_num = x._num;
return *this;
}
inline mint operator+(int x) { return mint(_num + x); }
inline mint operator+(mint x) {
int a = _num + x._num;
if (a >= MOD) {
a -= MOD;
}
return mint{a};
}
inline mint operator+=(int x) {
_num += x;
_num %= MOD;
if (_num < 0) {
_num += MOD;
}
return *this;
}
inline mint operator+=(mint x) {
_num += x._num;
if (_num >= MOD) {
_num -= MOD;
}
return *this;
}
inline mint operator++() {
_num++;
if (_num == MOD) {
_num = 0;
}
return *this;
}
inline mint operator-(int x) { return mint(_num - x); }
inline mint operator-(mint x) {
int a = _num - x._num;
if (a < 0) {
a += MOD;
}
return mint{a};
}
inline mint operator-=(int x) {
_num -= x;
_num %= MOD;
if (_num < 0) {
_num += MOD;
}
return *this;
}
inline mint operator-=(mint x) {
_num -= x._num;
if (_num < 0) {
_num += MOD;
}
return *this;
}
inline mint operator--() {
_num--;
if (_num == -1) {
_num = MOD - 1;
}
return *this;
}
inline mint operator*(int x) { return mint(_num * (x % MOD)); }
inline mint operator*(mint x) { return mint{_num * x._num % MOD}; }
inline mint operator*=(int x) {
_num *= mint(x);
_num %= MOD;
return *this;
}
inline mint operator*=(mint x) {
_num *= x._num;
_num %= MOD;
return *this;
}
inline mint operator/(int x) { return mint(_num * invmod(mint(x), MOD)); }
inline mint operator/(mint x) {
return mint{_num * invmod(x._num, MOD) % MOD};
}
inline mint operator/=(int x) {
_num *= invmod(mint(x), MOD);
_num %= MOD;
return *this;
}
inline mint operator/=(mint x) {
_num *= invmod(x._num, MOD);
_num %= MOD;
return *this;
}
inline mint pow(int x) {
mint ans = 1, cnt = *this;
for (int i = 1; i < x + 1; i *= 2) {
if (x & i) {
ans *= cnt;
x ^= i;
}
cnt *= cnt;
}
return ans;
}
inline operator int() { return _num; }
};
vector<mint> fac(1, 1), inv(1, 1);
void reserve(int a) {
if (fac.size() >= a)
return;
if (a < fac.size() * 2)
a = fac.size() * 2;
if (a >= MOD)
a = MOD;
while (fac.size() < a)
fac.push_back(fac.back() * (int)(fac.size()));
inv.resize(fac.size());
inv.back() = mint(1) / fac.back();
for (int i = inv.size() - 1; !inv[i - 1]; i--)
inv[i - 1] = inv[i] * i;
}
mint fact(int n) {
if (n < 0)
return 0;
reserve(n + 1);
return fac[n];
}
mint perm(int n, int r) {
if (r < 0 || n < r)
return 0;
reserve(n + 1);
return fac[n] * inv[n - r];
}
mint comb(int n, int r) {
if (r < 0 || n < r)
return 0;
reserve(n + 1);
return fac[n] * inv[r] * inv[n - r];
}
mint mcomb(int n, int r) {
return comb(n + r - 1, n - 1);
} // r個をn部屋に分ける
// UnionFind
struct UF {
vector<int> t;
UF(int size) : t(size, -1) {}
int root(int x) { return t[x] < 0 ? x : t[x] = root(t[x]); }
int size(int x) { return -t[root(x)]; }
bool isSame(int x, int y) { return root(x) == root(y); }
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x != y) {
if (t[y] < t[x]) {
swap(x, y);
}
t[x] += t[y], t[y] = x;
}
return x != y;
}
};
// main
main() {
INCANT;
int n, res = 0;
int a, b;
in(a, b);
rep(i, b - a + 1, b + a - 2) { out(i), space(); }
print(b + a - 1);
}
|
#include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// alias
#define gcd __gcd
#define pb push_back
#define all(x) (x).begin(), (x).end()
template <typename T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <typename T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
template <class T> int lb(vector<T> &x, T n) {
return lower_bound(all(x), n) - x.begin();
}
template <class T> int ub(vector<T> &x, T n) {
return upper_bound(all(x), n) - x.begin();
}
// for
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
// 入力
void in() {}
template <typename F, typename... R> bool in(F &f, R &...r) {
if (cin >> f) {
in(r...);
return true;
} else
return false;
}
// 出力
#define out(x) cout << (x)
#define space() cout << " "
#define indent() cout << '\n'
void print() {}
template <typename F, typename... R> void print(F f, R... r) {
out(f), indent(), print(r...);
}
// デバッグ出力
#define debughead(x) cerr << "Line " << __LINE__ << ": " << #x << ": "
#define debugout(x) cerr << (x) << " "
#define debugindent() cerr << '\n'
#define debug(x) debughead(x), debugout(x), debugindent()
// 脳死
#define YN(x) out((x) ? "YES" : "NO"), indent()
#define Yn(x) out((x) ? "Yes" : "No"), indent()
#define yn(x) out((x) ? "yes" : "no"), indent()
// const
int INF = 1e18, MOD = 1e9 + 7;
double EPS = 1e-15, PI = acos(-1);
int dx[] = {0, 0, 1, 0, -1, -1, 1, 1, -1},
dy[] = {0, -1, 0, 1, 0, -1, -1, 1, 1};
// 数学的な
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) { res *= n--, res /= i; }
return res;
}
bool isPrime(int n) {
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
if (!(n % i)) {
return false;
}
}
return true;
}
vector<int> divisor(int n) {
vector<int> ans;
rep(i, 1, sqrt(n) + 1) {
if (!(n % i)) {
ans.pb(i);
if (i * i < n) {
ans.pb(n / i);
}
}
}
return ans;
}
map<int, int> factorization(int n) {
map<int, int> ans;
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
while (!(n % i)) {
ans[i]++, n /= i;
}
}
if (n > 1) {
ans[n]++;
}
return ans;
}
// MOD int
int extgcd(int a, int b, int &x, int &y) {
int g = a;
x = 1, y = 0;
if (b) {
g = extgcd(b, a % b, y, x);
y -= a / b * x;
}
return g;
}
int invmod(int a, int m = MOD) {
int x = 0, y = 0;
extgcd(a, m, x, y);
return (x + m) % m;
}
struct mint {
int _num;
mint(int x = 0) : _num() {
_num = x % MOD;
if (_num < 0) {
_num += MOD;
}
}
inline mint operator=(int x) {
_num = x % MOD;
if (_num < 0) {
_num += MOD;
}
return *this;
}
inline mint operator=(mint x) {
_num = x._num;
return *this;
}
inline mint operator+(int x) { return mint(_num + x); }
inline mint operator+(mint x) {
int a = _num + x._num;
if (a >= MOD) {
a -= MOD;
}
return mint{a};
}
inline mint operator+=(int x) {
_num += x;
_num %= MOD;
if (_num < 0) {
_num += MOD;
}
return *this;
}
inline mint operator+=(mint x) {
_num += x._num;
if (_num >= MOD) {
_num -= MOD;
}
return *this;
}
inline mint operator++() {
_num++;
if (_num == MOD) {
_num = 0;
}
return *this;
}
inline mint operator-(int x) { return mint(_num - x); }
inline mint operator-(mint x) {
int a = _num - x._num;
if (a < 0) {
a += MOD;
}
return mint{a};
}
inline mint operator-=(int x) {
_num -= x;
_num %= MOD;
if (_num < 0) {
_num += MOD;
}
return *this;
}
inline mint operator-=(mint x) {
_num -= x._num;
if (_num < 0) {
_num += MOD;
}
return *this;
}
inline mint operator--() {
_num--;
if (_num == -1) {
_num = MOD - 1;
}
return *this;
}
inline mint operator*(int x) { return mint(_num * (x % MOD)); }
inline mint operator*(mint x) { return mint{_num * x._num % MOD}; }
inline mint operator*=(int x) {
_num *= mint(x);
_num %= MOD;
return *this;
}
inline mint operator*=(mint x) {
_num *= x._num;
_num %= MOD;
return *this;
}
inline mint operator/(int x) { return mint(_num * invmod(mint(x), MOD)); }
inline mint operator/(mint x) {
return mint{_num * invmod(x._num, MOD) % MOD};
}
inline mint operator/=(int x) {
_num *= invmod(mint(x), MOD);
_num %= MOD;
return *this;
}
inline mint operator/=(mint x) {
_num *= invmod(x._num, MOD);
_num %= MOD;
return *this;
}
inline mint pow(int x) {
mint ans = 1, cnt = *this;
for (int i = 1; i < x + 1; i *= 2) {
if (x & i) {
ans *= cnt;
x ^= i;
}
cnt *= cnt;
}
return ans;
}
inline operator int() { return _num; }
};
vector<mint> fac(1, 1), inv(1, 1);
void reserve(int a) {
if (fac.size() >= a)
return;
if (a < fac.size() * 2)
a = fac.size() * 2;
if (a >= MOD)
a = MOD;
while (fac.size() < a)
fac.push_back(fac.back() * (int)(fac.size()));
inv.resize(fac.size());
inv.back() = mint(1) / fac.back();
for (int i = inv.size() - 1; !inv[i - 1]; i--)
inv[i - 1] = inv[i] * i;
}
mint fact(int n) {
if (n < 0)
return 0;
reserve(n + 1);
return fac[n];
}
mint perm(int n, int r) {
if (r < 0 || n < r)
return 0;
reserve(n + 1);
return fac[n] * inv[n - r];
}
mint comb(int n, int r) {
if (r < 0 || n < r)
return 0;
reserve(n + 1);
return fac[n] * inv[r] * inv[n - r];
}
mint mcomb(int n, int r) {
return comb(n + r - 1, n - 1);
} // r個をn部屋に分ける
// UnionFind
struct UF {
vector<int> t;
UF(int size) : t(size, -1) {}
int root(int x) { return t[x] < 0 ? x : t[x] = root(t[x]); }
int size(int x) { return -t[root(x)]; }
bool isSame(int x, int y) { return root(x) == root(y); }
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x != y) {
if (t[y] < t[x]) {
swap(x, y);
}
t[x] += t[y], t[y] = x;
}
return x != y;
}
};
// main
main() {
INCANT;
int n, res = 0;
int a, b;
in(a, b);
rep(i, b - a + 1, b + a - 1) { out(i), space(); }
print(b + a - 1);
}
|
[
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 745,527
| 745,528
|
u303059352
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k - 1; i++) {
cout << (i == x - k + 1 ? "" : " ") << i;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << (i == x - k + 1 ? "" : " ") << i;
}
cout << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,539
| 745,540
|
u394759653
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int z;
z = x - 1;
for (int i = -z; i <= z; i++) {
cout << (y + i);
}
}
|
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int z;
z = x - 1;
for (int i = -z; i <= z; i++) {
cout << (y + i) << " ";
}
}
|
[
"io.output.change"
] | 745,550
| 745,551
|
u722985380
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int z;
z = x - 1;
if (z > 0) {
for (int i = -z; i <= z; i++) {
cout << (y + i);
}
} else
cout << y;
}
|
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int z;
z = x - 1;
if (z > 0) {
for (int i = -z; i <= z; i++) {
cout << (y + i) << " ";
}
} else
cout << y;
}
|
[
"io.output.change"
] | 745,553
| 745,554
|
u722985380
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
for (int i = a - b + 1; i <= a + b - 1; i++)
printf("%d ", i);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
for (int i = b - a + 1; i <= a + b - 1; i++)
printf("%d ", i);
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 745,559
| 745,560
|
u880379631
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int x, k;
cin >> x >> k;
int lb = max(-1000000, x - k + 1);
int ub = min(1000000, x + k - 1);
int i;
for (i = lb; i <= ub; i++)
cout << i << " ";
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x, k;
cin >> k >> x;
int lb = max(-1000000, x - k + 1);
int ub = min(1000000, x + k - 1);
int i;
for (i = lb; i <= ub; i++)
cout << i << " ";
return 0;
}
|
[
"expression.operation.binary.remove"
] | 745,568
| 745,569
|
u491400073
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int max = A + B - 1;
int min = A + B + 1 - A * 2;
for (int i = 0; i <= max - min; i++) {
cout << min + i;
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int max = A + B - 1;
int min = A + B + 1 - A * 2;
for (int i = 0; i <= max - min; i++) {
cout << min + i << " ";
}
cout << endl;
return 0;
}
|
[
"io.output.change"
] | 745,575
| 745,576
|
u918373199
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int max = A + B - 1;
int min = A + B + 1 - A * 2;
for (int i = 0; i < max - min; i++) {
cout << min + i;
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int max = A + B - 1;
int min = A + B + 1 - A * 2;
for (int i = 0; i <= max - min; i++) {
cout << min + i << " ";
}
cout << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 745,577
| 745,576
|
u918373199
|
cpp
|
p02946
|
#include <stdio.h>
int main(void) {
int k, x, y, z, i;
scanf("%d %d", &k, &x);
y = x - k - 1;
z = x + k - 1;
for (i = y; i <= z; i++) {
printf("%d ", i);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int k, x, y, z, i;
scanf("%d %d", &k, &x);
y = x - k + 1;
z = x + k - 1;
for (i = y; i <= z; i++) {
printf("%d ", i);
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 745,585
| 745,586
|
u075650258
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x, n;
cin >> k >> x;
n = 2 * k - 1;
for (int i = 0; i < n; i++) {
cout << x - k + i << ' ';
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x, n;
cin >> k >> x;
n = 2 * k - 1;
for (int i = 0; i < n; i++) {
cout << x - k + 1 + i << ' ';
}
cout << endl;
}
|
[
"expression.operation.binary.add"
] | 745,589
| 745,590
|
u688825490
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int min = b - a + 1;
int max = b + a - 1;
for (int i = min; i < max; ++i) {
cout << i << " ";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int min = b - a + 1;
int max = b + a - 1;
for (int i = min; i <= max; ++i) {
cout << i << " ";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,603
| 745,604
|
u042967298
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int K, X;
cin >> K;
cin >> X;
for (int i = K - 1; i > -K; i--) {
cout << X - i;
}
cout << endl;
}
|
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int K, X;
cin >> K;
cin >> X;
for (int i = K - 1; i > -K; i--) {
cout << X - i << " ";
}
cout << endl;
}
|
[
"io.output.change"
] | 745,605
| 745,606
|
u236809838
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef long double ld;
//ある値がvector内の要素に含まれているか否か判定する
int vector_finder(std::vector<int> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
struct edge_t {
int dest;
int weight;
};
struct vertex_t {
vector<edge_t> edges;
vector<int> weight;
// for dijkstra
bool done; // confirm or not
int cost; // now cost
int from;
bool operator<(const vertex_t &another) const { // priority --> min
return another.cost < cost; // order(cost)
}
bool operator>(const vertex_t &another) const { // priority --> min
return another.cost > cost; // order(cost)
}
bool operator==(const vertex_t &another) const {
return another.cost == cost; // order(cost)
}
vertex_t() {
cost = INF;
done = false;
}
};
int bellman_ford(vector<vertex_t> &graph, int size, int start) {
int i, j, k, count = 0;
bool flag = false;
graph[start].cost = 0;
REP(i, size) {
REP(j, size) {
vertex_t cur = graph[j];
for (edge_t edge : cur.edges) {
if (cur.cost + edge.weight < graph[edge.dest].cost) {
if (i == size - 1)
flag = true;
graph[edge.dest].cost = cur.cost + edge.weight;
}
}
}
}
if (flag) {
return 1;
} else {
return 0;
}
}
class tree_t {
public:
bool is_leaf;
tree_t *right;
tree_t *left;
tree_t() {
is_leaf = false;
right = NULL;
left = NULL;
}
};
vector<string> splitstr(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
} else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
unsigned getDigitNum(unsigned num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
////////////////////////// let's code! /////////////////////////////
int i, j, k;
///// variables frequent to use /////
int main() {
int K, X;
cin >> K >> X;
int min, max;
if (-1000000 > X - K) {
min = -1000000;
max = X + K - 1;
} else if (1000000 < X + K) {
min = X - K + 1;
max = 1000000;
} else {
min = X - K + 1;
max = X + K - 1;
}
for (i = min; i < max; i++) {
cout << i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef long double ld;
//ある値がvector内の要素に含まれているか否か判定する
int vector_finder(std::vector<int> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
struct edge_t {
int dest;
int weight;
};
struct vertex_t {
vector<edge_t> edges;
vector<int> weight;
// for dijkstra
bool done; // confirm or not
int cost; // now cost
int from;
bool operator<(const vertex_t &another) const { // priority --> min
return another.cost < cost; // order(cost)
}
bool operator>(const vertex_t &another) const { // priority --> min
return another.cost > cost; // order(cost)
}
bool operator==(const vertex_t &another) const {
return another.cost == cost; // order(cost)
}
vertex_t() {
cost = INF;
done = false;
}
};
int bellman_ford(vector<vertex_t> &graph, int size, int start) {
int i, j, k, count = 0;
bool flag = false;
graph[start].cost = 0;
REP(i, size) {
REP(j, size) {
vertex_t cur = graph[j];
for (edge_t edge : cur.edges) {
if (cur.cost + edge.weight < graph[edge.dest].cost) {
if (i == size - 1)
flag = true;
graph[edge.dest].cost = cur.cost + edge.weight;
}
}
}
}
if (flag) {
return 1;
} else {
return 0;
}
}
class tree_t {
public:
bool is_leaf;
tree_t *right;
tree_t *left;
tree_t() {
is_leaf = false;
right = NULL;
left = NULL;
}
};
vector<string> splitstr(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
} else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
unsigned getDigitNum(unsigned num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
////////////////////////// let's code! /////////////////////////////
int i, j, k;
///// variables frequent to use /////
int main() {
int K, X;
cin >> K >> X;
int min, max;
if (-1000000 > X - K) {
min = -1000000;
max = X + K - 1;
} else if (1000000 < X + K) {
min = X - K;
max = 1000000;
} else {
min = X - K + 1;
max = X + K;
}
for (i = min; i < max; i++) {
cout << i << " ";
}
}
|
[
"expression.operation.binary.remove"
] | 745,609
| 745,610
|
u518242261
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int k, x;
cin >> k, x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << i << " ";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << i << " ";
}
return 0;
}
|
[] | 745,623
| 745,624
|
u770567389
|
cpp
|
p02946
|
#include <iostream>
#include <vector>
//#include<math.h>
#include <unordered_map>
using namespace std;
int main() {
int x, k;
cin >> x >> k;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << i << " ";
}
}
|
#include <iostream>
#include <vector>
//#include<math.h>
#include <unordered_map>
using namespace std;
int main() {
int x, k;
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << i << " ";
}
}
|
[
"expression.operation.binary.remove"
] | 745,634
| 745,635
|
u045575753
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i < a * 2 - 1; i++) {
cout << b - a + i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = 1; i <= a * 2 - 1; i++) {
cout << b - a + i << " ";
}
}
|
[
"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"
] | 745,643
| 745,644
|
u438035643
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int k, x, temp;
cin >> k >> x;
temp = x - (k / 2);
for (int i = 0; i < k + (k / 2); i++) {
cout << temp << " ";
++temp;
}
cout << "" << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int k, x, temp;
cin >> k >> x;
temp = x - (k - 1);
for (int i = 0; i < k + (k - 1); i++) {
cout << temp << " ";
++temp;
}
cout << "" << endl;
return 0;
}
|
[
"control_flow.loop.for.condition.change"
] | 745,647
| 745,648
|
u734055973
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long ll;
#define FOR(i, n) for (int i = 0; i < n; i++)
// map<key,value>
int main() {
int k, x;
cin >> k >> x;
for (int i = x - 3 + 1; i <= x + k - 1; i++) {
cout << i << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long ll;
#define FOR(i, n) for (int i = 0; i < n; i++)
// map<key,value>
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << i << " ";
}
return 0;
}
|
[
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 745,651
| 745,652
|
u662665711
|
cpp
|
p02946
|
#include <math.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int K, X;
scanf("%d %d", &K, &X);
for (int i = -K + X + 1; i <= K + X - 1; i++) {
if (-1000000 <= i && i <= 1000000)
printf("%d ", i);
}
if (-1000000 <= K + X - 1 && K + X - 1 <= 1000000)
printf("%d", K + X - 1);
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int K, X;
scanf("%d %d", &K, &X);
for (int i = -K + X + 1; i < K + X - 1; i++) {
if (-1000000 <= i && i <= 1000000)
printf("%d ", i);
}
if (-1000000 <= K + X - 1 && K + X - 1 <= 1000000)
printf("%d", K + X - 1);
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,653
| 745,654
|
u651802048
|
cpp
|
p02946
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int j = k - x + 1; j < x + k; j++)
cout << j << ' ';
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int j = x - k + 1; j < x + k; j++)
cout << j << ' ';
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 745,659
| 745,660
|
u220114950
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int min, max;
min = X - K + 1;
max = X + K - 1;
for (int i = min; i <= max; i++)
cout << i;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int min, max;
min = X - K + 1;
max = X + K - 1;
for (int i = min; i <= max; i++)
cout << i << " ";
}
|
[
"io.output.change"
] | 745,663
| 745,664
|
u288905450
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int min = X - K + 1;
int max = X + K - 1;
for (min; min < max; min++) {
cout << min << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int min = X - K + 1;
int max = X + K - 1;
for (min; min <= max; min++) {
cout << min << " ";
}
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,667
| 745,668
|
u327950489
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int min = X - K + 1;
int max = X + K - 1;
for (min; min < max; min++) {
cout << min;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int min = X - K + 1;
int max = X + K - 1;
for (min; min <= max; min++) {
cout << min << " ";
}
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 745,670
| 745,668
|
u327950489
|
cpp
|
p02946
|
#include <iostream>
#include <vector>
int main() {
int a, b;
std::cin >> a >> b;
for (int i = b - a + 1; i < b + a; i++) {
std::cout << i;
}
}
|
#include <iostream>
#include <vector>
int main() {
int a, b;
std::cin >> a >> b;
for (int i = b - a + 1; i < b + a; i++) {
std::cout << i << " ";
}
}
|
[
"expression.operation.binary.add"
] | 745,681
| 745,682
|
u184115330
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
if (k == 1) {
cout << x << endl;
} else {
int ans = x - k + 1;
for (int i = 0; i < (2 * k - 1); i++) {
cout << ans;
ans++;
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
if (k == 1) {
cout << x << endl;
} else {
int ans = x - k + 1;
for (int i = 0; i < (2 * k - 1); i++) {
cout << ans << " ";
ans++;
}
cout << endl;
}
}
|
[
"io.output.change"
] | 745,685
| 745,686
|
u745852541
|
cpp
|
p02946
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
int K, X;
cin >> K >> X;
long long int end = X - K + 1;
long long int fin = X + K - 1;
if (end < -1000000)
end = -1000000;
if (fin > 1000000)
fin = 1000000;
for (int i = end; i < fin; i++)
cout << i << " ";
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
int K, X;
cin >> K >> X;
long long int end = X - K + 1;
long long int fin = X + K - 1;
if (end < -1000000)
end = -1000000;
if (fin > 1000000)
fin = 1000000;
for (int i = end; i <= fin; i++)
cout << i << " ";
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,687
| 745,688
|
u557698358
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, k;
cin >> k >> x;
for (int i = x - k; i < x; i++) {
cout << i << ' ';
}
for (int i = x; i <= x + k; i++) {
cout << i << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, k;
cin >> k >> x;
for (int i = x - k + 1; i < x; i++) {
cout << i << ' ';
}
for (int i = x; i < x + k; i++) {
cout << i << " ";
}
return 0;
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,691
| 745,692
|
u225181923
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int main() {
int k, x;
cin >> k >> x;
for (int i = max(-1000000, x - 2); i <= min(1000000, x + 2); i++)
cout << i << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int main() {
int k, x;
cin >> k >> x;
for (int i = max(-1000000, x - k + 1); i <= min(1000000, x + k - 1); i++)
cout << i << ' ';
return 0;
}
|
[
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 745,693
| 745,694
|
u453624560
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int K, X;
int main() {
cin >> K >> X;
int l = X - K;
int r = X + K;
for (int i = r + 1; i < l; i++) {
cout << i << " ";
}
return 0;
}
|
#include <iostream>
using namespace std;
int K, X;
int main() {
cin >> K >> X;
int l = X - K;
int r = X + K;
for (int i = l + 1; i < r; i++) {
cout << i << " ";
}
return 0;
}
|
[
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 745,695
| 745,696
|
u767785562
|
cpp
|
p02946
|
//#pragma GCC optimize("O3", "unroll-loops")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define FIXED cout << fixed << setprecision(12)
#define RANDOM srand(94385)
#define all(a) a.begin(), a.end()
#define shuffle(a) \
for (int i = 0; i < sz(a); ++i) \
swap(a[i], a[rand() % sz(a)]);
#define enter puts("")
#define space putchar(' ')
#define Mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
void debug_out() { cerr << '\n'; }
template <typename T, typename... R> void debug_out(const T &f, const R &...r) {
cerr << f << " ";
debug_out(r...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__);
inline ll read() {
ll x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= (ch == '-'), ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return x = f ? -x : x;
}
inline void write(ll x) {
if (x == 0) {
putchar('0');
return;
}
if (x < 0) {
putchar('-');
x = -x;
}
static char s[23];
int l = 0;
while (x != 0)
s[l++] = x % 10 + 48, x /= 10;
while (l)
putchar(s[--l]);
}
int lowbit(int x) { return x & (-x); }
template <class T> T big(const T &a1, const T &a2) { return a1 > a2 ? a1 : a2; }
template <typename T, typename... R> T big(const T &f, const R &...r) {
return big(f, big(r...));
}
template <class T> T sml(const T &a1, const T &a2) { return a1 < a2 ? a1 : a2; }
template <typename T, typename... R> T sml(const T &f, const R &...r) {
return sml(f, sml(r...));
}
template <class T, class U> inline void checkMin(T &x, U y) {
if (y < x)
x = y;
}
template <class T, class U> inline void checkMax(T &x, U y) {
if (y > x)
x = y;
}
template <class T, class U> inline bool ifMax(T &x, U y) {
if (y > x)
return x = y, true;
return false;
}
template <class T, class U> inline bool ifMin(T &x, U y) {
if (y < x)
return x = y, true;
return false;
}
const int M = 212345; // 2e5+5
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1000000007; // 1e9+7
// HAVE FREE OPEN IN MAIN FUNCTION
void init() {
int k = read(), x = read();
for (int i = big(x - k + 1, -1000000); i < (sml(x + k - 1, 1000000)); i++) {
write(i);
space;
}
enter;
}
void solve() {}
int main() {
init();
solve();
return 0;
}
|
//#pragma GCC optimize("O3", "unroll-loops")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define FIXED cout << fixed << setprecision(12)
#define RANDOM srand(94385)
#define all(a) a.begin(), a.end()
#define shuffle(a) \
for (int i = 0; i < sz(a); ++i) \
swap(a[i], a[rand() % sz(a)]);
#define enter puts("")
#define space putchar(' ')
#define Mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
void debug_out() { cerr << '\n'; }
template <typename T, typename... R> void debug_out(const T &f, const R &...r) {
cerr << f << " ";
debug_out(r...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__);
inline ll read() {
ll x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= (ch == '-'), ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return x = f ? -x : x;
}
inline void write(ll x) {
if (x == 0) {
putchar('0');
return;
}
if (x < 0) {
putchar('-');
x = -x;
}
static char s[23];
int l = 0;
while (x != 0)
s[l++] = x % 10 + 48, x /= 10;
while (l)
putchar(s[--l]);
}
int lowbit(int x) { return x & (-x); }
template <class T> T big(const T &a1, const T &a2) { return a1 > a2 ? a1 : a2; }
template <typename T, typename... R> T big(const T &f, const R &...r) {
return big(f, big(r...));
}
template <class T> T sml(const T &a1, const T &a2) { return a1 < a2 ? a1 : a2; }
template <typename T, typename... R> T sml(const T &f, const R &...r) {
return sml(f, sml(r...));
}
template <class T, class U> inline void checkMin(T &x, U y) {
if (y < x)
x = y;
}
template <class T, class U> inline void checkMax(T &x, U y) {
if (y > x)
x = y;
}
template <class T, class U> inline bool ifMax(T &x, U y) {
if (y > x)
return x = y, true;
return false;
}
template <class T, class U> inline bool ifMin(T &x, U y) {
if (y < x)
return x = y, true;
return false;
}
const int M = 212345; // 2e5+5
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1000000007; // 1e9+7
// HAVE FREE OPEN IN MAIN FUNCTION
void init() {
int k = read(), x = read();
for (int i = big(x - k + 1, -1000000); i <= (sml(x + k - 1, 1000000)); i++) {
write(i);
space;
}
enter;
}
void solve() {}
int main() {
init();
solve();
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,697
| 745,698
|
u276234834
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
const int INF = 0x3f3f3f3f;
int k, x;
int main() {
cin >> k >> x;
for (int i = x - k + 1; i <= k + x - 1; i++)
cout << i;
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
const int INF = 0x3f3f3f3f;
int k, x;
int main() {
cin >> k >> x;
for (int i = x - k + 1; i <= k + x - 1; i++)
cout << i << " ";
cout << endl;
}
|
[
"io.output.change"
] | 745,703
| 745,704
|
u984423918
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x, a, b, i;
cin >> k >> x;
a = x - k + 1;
b = x + k - 1;
for (i = b; i <= a; i++) {
cout << i << " ";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x, a, b, i;
cin >> k >> x;
a = x - k + 1;
b = x + k - 1;
for (i = a; i <= b; i++) {
cout << i << " ";
}
cout << endl;
}
|
[
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 745,707
| 745,708
|
u979163294
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k - 1; i++)
cout << i << " ";
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++)
cout << i << " ";
cout << "\n";
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,709
| 745,710
|
u310690147
|
cpp
|
p02946
|
// clang-format off
#define BADSEED chrono::high_resolution_clock::now().time_since_epoch().count()
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
#define TM_(...) template <class __VA_ARGS__>
#define ENABLE(...) TM_(T) static enable_if_t<__VA_ARGS__>
#define SFINAE(name, ...) \
TM_(, class = void) struct name##_s : false_type {}; \
TM_(T) struct name##_s<T, decltype(void(__VA_ARGS__))> : true_type {}; \
TM_(T) constexpr bool name = name##_s<T>::value;
ostream &operator<<(ostream &os, int8_t c) { return os << static_cast<int>(c); }
namespace narut {
TM_(T) using TupSz = tuple_size<decay_t<T>>;
SFINAE(Iterable, begin(declval<T &>()))
SFINAE(IsTuple, TupSz<T>{})
SFINAE(Coutable, cout << declval<T &>())
SFINAE(Cinable, cin >> declval<T &>())
TM_(T) constexpr char Spc(T &&) { return (Iterable<T> or IsTuple<T>) ? '\n' : ' '; }
template <ostream &os, bool Red> struct Writer {
ENABLE(Coutable<T>) Write(T const &t) { os << t; }
ENABLE(!Coutable<T> and Iterable<T>) Write(T const &t) {
auto it = begin(t), e = end(t);
if (it != e) Write(*it++);
for (; it != e; Write(*it++)) os << Spc(*it);
}
TM_(T, size_t... Is) static void WriteTup(T const &t, index_sequence<Is...>) {
(void)(int[]){0, ((Is == 0) ? 0 : ((os << ' '), 0), Write(get<Is>(t)), 0)...};
}
ENABLE(!Coutable<T> and !Iterable<T> and IsTuple<T>) Write(T const &t) {
WriteTup(t, make_index_sequence<TupSz<T>::value>{});
}
void operator()() const { os << '\n'; }
TM_(F, class... Ts) void operator()(F const &f, Ts const &... ts) {
if (Red) os << "\033[0;31m";
Write(f);
(void)(int[]){0, (os << ' ', Write(ts), 0)...};
if (Red)
os << "\033[0m\n";
else
os << '\n';
}
};
struct Cin {
ENABLE(Cinable<T>) Read(T &t) { cin >> t; }
ENABLE(!Cinable<T> and Iterable<T>) Read(T &t) {
for (auto &&x : t) Read(x);
}
TM_(T, size_t... Is) static void ReadTup(T &t, index_sequence<Is...>) {
(void)(int[]){0, (Read(get<Is>(t)), 0)...};
}
ENABLE(!Cinable<T> and !Iterable<T> and IsTuple<T>) Read(T &t) {
ReadTup(t, make_index_sequence<TupSz<T>::value>{});
}
TM_(T) void operator()(T &t) const { Read(t); }
TM_(T) void operator()(T &t, uint n) const { t.resize(n), Read(t); }
TM_(T) operator T() const {
T t;
return Read(t), t;
}
};
struct Big {
TM_(T) constexpr operator T() const {
return 0x3f3f3f3f3f3f3f3f & numeric_limits<T>::max();
}
};
TM_(T, size_t N, size_t... Ns) struct arr {
using type = array<typename arr<T, Ns...>::type, N>;
};
TM_(T, size_t N) struct arr<T, N> { using type = array<T, N>; };
TM_(T, size_t N, size_t... Ns) using Arr = typename arr<T, N, Ns...>::type;
template <class C, class T> auto Fill(C &c, T const &t) -> decltype(void(*begin(c) = t)) {
fill(begin(c), end(c), t);
}
template <class C, class T> auto Fill(C &c, T const &t) -> decltype(void(begin(*begin(c)))) {
for (auto &x : c) Fill(x, t);
}
} // namespace narut
narut::Cin Cin;
narut::Writer<cout, false> Cout;
narut::Big Big;
using narut::Arr;
using narut::Fill;
using ll = long long;
#define FOR(i, j, n) for (int i = static_cast<int>(j); i < static_cast<int>(n); ++i)
#define ROF(i, j, n) for (int i = static_cast<int>(n) - 1; i >= static_cast<int>(j); --i)
#ifdef NARUT_LOCAL
narut::Writer<cerr, true> Cerr;
#define DBG(...) __VA_ARGS__
#define Debug(...) Cerr(__VA_ARGS__)
#else
#define Debug(...) 0
#define DBG(...)
#endif
#ifndef BADSEED
#define BADSEED random_device{}()
#endif
// clang-format on
// STUCK : READ THE PROBLEM CAREFULLY. LOOK AT ALL THE CONSTRAINTS
auto Run() {
int k, x;
cin >> k >> x;
FOR(i, x - k + 1, x + k - 1) { cout << i << ' '; }
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
#ifdef NARUT_LOCAL
cerr << fixed << setprecision(10);
assert(freopen("./io/test.in", "r", stdin));
// assert(freopen("./io/test.out", "w", stdout));
#endif
Run();
}
|
// clang-format off
#define BADSEED chrono::high_resolution_clock::now().time_since_epoch().count()
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
#define TM_(...) template <class __VA_ARGS__>
#define ENABLE(...) TM_(T) static enable_if_t<__VA_ARGS__>
#define SFINAE(name, ...) \
TM_(, class = void) struct name##_s : false_type {}; \
TM_(T) struct name##_s<T, decltype(void(__VA_ARGS__))> : true_type {}; \
TM_(T) constexpr bool name = name##_s<T>::value;
ostream &operator<<(ostream &os, int8_t c) { return os << static_cast<int>(c); }
namespace narut {
TM_(T) using TupSz = tuple_size<decay_t<T>>;
SFINAE(Iterable, begin(declval<T &>()))
SFINAE(IsTuple, TupSz<T>{})
SFINAE(Coutable, cout << declval<T &>())
SFINAE(Cinable, cin >> declval<T &>())
TM_(T) constexpr char Spc(T &&) { return (Iterable<T> or IsTuple<T>) ? '\n' : ' '; }
template <ostream &os, bool Red> struct Writer {
ENABLE(Coutable<T>) Write(T const &t) { os << t; }
ENABLE(!Coutable<T> and Iterable<T>) Write(T const &t) {
auto it = begin(t), e = end(t);
if (it != e) Write(*it++);
for (; it != e; Write(*it++)) os << Spc(*it);
}
TM_(T, size_t... Is) static void WriteTup(T const &t, index_sequence<Is...>) {
(void)(int[]){0, ((Is == 0) ? 0 : ((os << ' '), 0), Write(get<Is>(t)), 0)...};
}
ENABLE(!Coutable<T> and !Iterable<T> and IsTuple<T>) Write(T const &t) {
WriteTup(t, make_index_sequence<TupSz<T>::value>{});
}
void operator()() const { os << '\n'; }
TM_(F, class... Ts) void operator()(F const &f, Ts const &... ts) {
if (Red) os << "\033[0;31m";
Write(f);
(void)(int[]){0, (os << ' ', Write(ts), 0)...};
if (Red)
os << "\033[0m\n";
else
os << '\n';
}
};
struct Cin {
ENABLE(Cinable<T>) Read(T &t) { cin >> t; }
ENABLE(!Cinable<T> and Iterable<T>) Read(T &t) {
for (auto &&x : t) Read(x);
}
TM_(T, size_t... Is) static void ReadTup(T &t, index_sequence<Is...>) {
(void)(int[]){0, (Read(get<Is>(t)), 0)...};
}
ENABLE(!Cinable<T> and !Iterable<T> and IsTuple<T>) Read(T &t) {
ReadTup(t, make_index_sequence<TupSz<T>::value>{});
}
TM_(T) void operator()(T &t) const { Read(t); }
TM_(T) void operator()(T &t, uint n) const { t.resize(n), Read(t); }
TM_(T) operator T() const {
T t;
return Read(t), t;
}
};
struct Big {
TM_(T) constexpr operator T() const {
return 0x3f3f3f3f3f3f3f3f & numeric_limits<T>::max();
}
};
TM_(T, size_t N, size_t... Ns) struct arr {
using type = array<typename arr<T, Ns...>::type, N>;
};
TM_(T, size_t N) struct arr<T, N> { using type = array<T, N>; };
TM_(T, size_t N, size_t... Ns) using Arr = typename arr<T, N, Ns...>::type;
template <class C, class T> auto Fill(C &c, T const &t) -> decltype(void(*begin(c) = t)) {
fill(begin(c), end(c), t);
}
template <class C, class T> auto Fill(C &c, T const &t) -> decltype(void(begin(*begin(c)))) {
for (auto &x : c) Fill(x, t);
}
} // namespace narut
narut::Cin Cin;
narut::Writer<cout, false> Cout;
narut::Big Big;
using narut::Arr;
using narut::Fill;
using ll = long long;
#define FOR(i, j, n) for (int i = static_cast<int>(j); i < static_cast<int>(n); ++i)
#define ROF(i, j, n) for (int i = static_cast<int>(n) - 1; i >= static_cast<int>(j); --i)
#ifdef NARUT_LOCAL
narut::Writer<cerr, true> Cerr;
#define DBG(...) __VA_ARGS__
#define Debug(...) Cerr(__VA_ARGS__)
#else
#define Debug(...) 0
#define DBG(...)
#endif
#ifndef BADSEED
#define BADSEED random_device{}()
#endif
// clang-format on
// STUCK : READ THE PROBLEM CAREFULLY. LOOK AT ALL THE CONSTRAINTS
auto Run() {
int k, x;
cin >> k >> x;
FOR(i, x - k + 1, x + k) { cout << i << ' '; }
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
#ifdef NARUT_LOCAL
cerr << fixed << setprecision(10);
assert(freopen("./io/test.in", "r", stdin));
// assert(freopen("./io/test.out", "w", stdout));
#endif
Run();
}
|
[
"expression.operation.binary.remove"
] | 745,713
| 745,714
|
u752224227
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = max(-1000000, b - a); i <= min(1000000, b + a); ++i)
cout << i << ' ';
}
|
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = max(-1000000, b - a) + 1; i <= min(1000000, b + a) - 1; ++i)
cout << i << ' ';
}
|
[
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 745,715
| 745,716
|
u779387275
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k, x;
cin >> k >> x;
for (int i = min(k - x + 1, k + x - 1); i <= max(k - x + 1, k + x - 1); i++)
cout << i << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k, x;
cin >> x >> k;
for (int i = min(k - x + 1, k + x - 1); i <= max(k - x + 1, k + x - 1); i++)
cout << i << " ";
}
|
[
"expression.operation.binary.remove"
] | 745,717
| 745,718
|
u506112954
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define DFOR(a, b, c) for (register int a = b, _n = c; a > _n; --a)
#define EREP(a, b) for (register int a = first[b]; a; a = edge[a].nxt)
int k, x;
void _main() {
scanf("%d%d", &k, &x);
REP(i, max(-1000000, x - k - 1), min(1000000, x + k - 1))
printf("%d ", i);
}
int main() {
#ifdef LOCAL
freopen("in.txt", "w", stdout);
#endif
_main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define DFOR(a, b, c) for (register int a = b, _n = c; a > _n; --a)
#define EREP(a, b) for (register int a = first[b]; a; a = edge[a].nxt)
int k, x;
void _main() {
scanf("%d%d", &k, &x);
REP(i, max(-1000000, x - k + 1), min(1000000, x + k - 1))
printf("%d ", i);
}
int main() {
#ifdef LOCAL
freopen("in.txt", "w", stdout);
#endif
_main();
return 0;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 745,719
| 745,720
|
u608862204
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define debug_array(a, n) \
for (ll bccc = (0); bccc < (n); bccc++) \
cout << a[bccc] << " "
#define debug_vector(a) \
for (ll bccc = (0); bccc < (a.size()); bccc++) \
cout << a[bccc] << " "
#define F first
#define S second
#define trace(x) cerr << #x << ": " << x << " " << endl;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
/* ll t = 0;
ordered_multiset me;
...
me.insert({x, t++});
me.erase(me.lower_bound({x, 0}));
cout << me.order_of_key({x, 0}) << "\n";
/////////// t is insertion time
*/
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
typedef long double lld;
lld pi = 3.14159265358;
ll powr(ll a, ll b) {
ll c = 1;
ll i;
for (i = 0; i < b; i++)
c *= a;
return c;
}
// ll hell=1000000007;
ll hell = 998244353;
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
// mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
// after namespace std
// srand(chrono::high_resolution_clock::now().time_since_epoch().count()); after
// ios:base
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll a, b;
cin >> a >> b;
ll i;
for (i = max(-1000000LL, b - a + 1); i < min(1000000LL, b + a - 1); i++)
cout << i << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define debug_array(a, n) \
for (ll bccc = (0); bccc < (n); bccc++) \
cout << a[bccc] << " "
#define debug_vector(a) \
for (ll bccc = (0); bccc < (a.size()); bccc++) \
cout << a[bccc] << " "
#define F first
#define S second
#define trace(x) cerr << #x << ": " << x << " " << endl;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
/* ll t = 0;
ordered_multiset me;
...
me.insert({x, t++});
me.erase(me.lower_bound({x, 0}));
cout << me.order_of_key({x, 0}) << "\n";
/////////// t is insertion time
*/
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
typedef long double lld;
lld pi = 3.14159265358;
ll powr(ll a, ll b) {
ll c = 1;
ll i;
for (i = 0; i < b; i++)
c *= a;
return c;
}
// ll hell=1000000007;
ll hell = 998244353;
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
// mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
// after namespace std
// srand(chrono::high_resolution_clock::now().time_since_epoch().count()); after
// ios:base
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll a, b;
cin >> a >> b;
ll i;
for (i = max(-1000000LL, b - a + 1); i <= min(1000000LL, b + a - 1); i++)
cout << i << " ";
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,721
| 745,722
|
u583811208
|
cpp
|
p02946
|
#include <stdio.h>
int main(void) {
int k, x, i;
scanf("%d %d", &k, &x);
for (i = x - k + 1; i < x + k; i++) {
if (-1000000 <= i && 1000000 >= i) {
printf("%d", i);
if (i < x - k - 1)
printf(" ");
}
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int k, x, i;
scanf("%d %d", &k, &x);
for (i = x - k + 1; i < x + k; i++) {
if (-1000000 <= i && 1000000 >= i) {
printf("%d", i);
if (i < x + k - 1)
printf(" ");
}
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 745,732
| 745,733
|
u422201590
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, X, i;
cin >> K;
cin >> X;
for (i = X - (K - 1); i <= X + (K - 1); i++) {
cout << i;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int K, X, i;
cin >> K;
cin >> X;
for (i = X - (K - 1); i <= X + (K - 1); i++) {
cout << i << " ";
}
return 0;
}
|
[
"io.output.change"
] | 745,744
| 745,745
|
u889991138
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k; i <= x + k; i++)
cout << i << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; i++)
cout << i << " ";
return 0;
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,752
| 745,753
|
u289565681
|
cpp
|
p02946
|
#include <algorithm>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int k, x, tmp;
cin >> k >> x;
for (int i = 0; i < k * 2 - 1; i++) {
if (((x - (k - 1)) + i) < -1000000 || ((x - (k - 1)) + i) > 1000000) {
} else {
cout << x - (k - 1) + i;
}
}
return 0;
}
|
#include <algorithm>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int k, x, tmp;
cin >> k >> x;
for (int i = 0; i < k * 2 - 1; i++) {
if (((x - (k - 1)) + i) < -1000000 || ((x - (k - 1)) + i) > 1000000) {
} else {
cout << x - (k - 1) + i << " ";
}
}
return 0;
}
|
[
"io.output.change"
] | 745,766
| 745,767
|
u031034560
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int min, max;
min = x - (k - 1);
max = x + (k - 1);
if (min < -1000000)
min = -1000000;
if (max > 1000000)
max = 1000000;
// 出力
for (int i = min; i < max; i++) {
cout << i << ' ';
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int min, max;
min = x - (k - 1);
max = x + (k - 1);
if (min < -1000000)
min = -1000000;
if (max > 1000000)
max = 1000000;
// 出力
for (int i = min; i < max + 1; i++) {
cout << i << ' ';
}
cout << endl;
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 745,768
| 745,769
|
u223629820
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main(void) {
int k, x;
cin >> k >> x;
/*
連続 k
黒座標 x
x-(k+1)
から
x+(k-1)
までを出力
*/
for (int i = x - (k - 1); i <= x + (k - 1); i++) {
if (i >= -1000000 && i <= 1000000)
cout << i << flush;
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int k, x;
cin >> k >> x;
for (int i = x - (k - 1); i <= x + (k - 1); i++) {
if (i >= -1000000 && i <= 1000000)
cout << i << " " << flush;
}
cout << endl;
return 0;
}
|
[
"io.output.change"
] | 745,770
| 745,771
|
u190564874
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int N = 2 * (K - 1);
for (int i = 0; i <= N; i++) {
cout << X - (K - 1) + i;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int N = 2 * (K - 1);
for (int i = 0; i <= N; i++) {
cout << X - (K - 1) + i << " ";
}
}
|
[
"io.output.change"
] | 745,772
| 745,773
|
u911623246
|
cpp
|
p02946
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int k, x;
cin >> k >> x;
k--;
for (int i = max(x - k, 0); i <= min(x + k, 1000000); ++i) {
if (i == min(x + k, 1000000)) {
cout << i << endl;
break;
}
cout << i << " ";
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int k, x;
cin >> k >> x;
k--;
for (int i = max(x - k, -1000000); i <= min(x + k, 1000000); ++i) {
if (i == min(x + k, 1000000)) {
cout << i << endl;
break;
}
cout << i << " ";
}
return 0;
}
|
[
"literal.number.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change"
] | 745,788
| 745,789
|
u110336920
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int k;
int x;
int main() {
cin >> k >> x;
int a[k];
for (int i = 0; i < (2 * k - 1); ++i) {
a[i] = x - k + 1 + i;
}
for (int j = 0; j < (2 * k - 1); ++j) {
cout << a[j] << " ";
}
cout << endl;
}
|
#include <iostream>
using namespace std;
int k;
int x;
int main() {
cin >> k >> x;
int a[2 * k - 1];
for (int i = 0; i < (2 * k - 1); ++i) {
a[i] = x - k + 1 + i;
}
for (int j = 0; j < (2 * k - 1); ++j) {
cout << a[j] << " ";
}
cout << endl;
}
|
[
"expression.operation.binary.add",
"variable_declaration.array_dimensions.change"
] | 745,802
| 745,803
|
u326647750
|
cpp
|
p02946
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = X - K; i < K + X; i++) {
cout << i << " ";
}
cout << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = X - K + 1; i < K + X; i++) {
cout << i << " ";
}
cout << endl;
}
|
[
"control_flow.loop.for.initializer.change"
] | 745,806
| 745,807
|
u547754910
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = 1; i < K; i++) {
cout << X - (K - i) << ' ';
}
for (int i = 1; i < K; i++) {
cout << X + i << ' ';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = 1; i <= K; i++) {
cout << X - (K - i) << ' ';
}
for (int i = 1; i < K; i++) {
cout << X + i << ' ';
}
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,815
| 745,816
|
u636011245
|
cpp
|
p02946
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
if (X - K + 1 < -1000000) {
for (int a = -1000000; a < -1000000 + K - 1; a++) {
cout << a << " ";
}
} else if (X + K - 1 > 1000000) {
for (int b = X - K + 1; b < 1000000; b++) {
cout << b << " ";
}
} else {
for (int c = X - K + 1; c < X + K - 1; c++) {
cout << c << " ";
}
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
if (X - K + 1 < -1000000) {
for (int a = -1000000; a <= X + K - 1; a++) {
cout << a << " ";
}
} else if (X + K - 1 > 1000000) {
for (int b = X - K + 1; b <= 1000000; b++) {
cout << b << " ";
}
} else {
for (int c = X - K + 1; c < X + K; c++) {
cout << c << " ";
}
}
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"expression.operation.binary.remove"
] | 745,817
| 745,818
|
u022890424
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
//引いたやつから足したやつまで出力
int ans = x - k + 1;
for (int i = 0; i < 2 * k - 1; i++) {
cout << ans++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
//引いたやつから足したやつまで出力
int ans = x - k + 1;
for (int i = 0; i < 2 * k - 1; i++) {
cout << ans++ << " ";
}
}
|
[
"io.output.change"
] | 745,819
| 745,820
|
u352685145
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int a = X - K + 1;
while ((X - a) < K && (a - X) < K) {
cout << a;
a = a + 1;
}
}
|
#include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int a = X - K + 1;
while ((X - a) < K && (a - X) < K) {
cout << a << ' ';
a = a + 1;
}
}
|
[
"io.output.change"
] | 745,827
| 745,828
|
u779293207
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int i;
for (i = m - n + 1; i <= m + n - 1; i++) {
cout << i;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int i;
for (i = m - n + 1; i <= m + n - 1; i++) {
cout << i << " ";
}
}
|
[
"io.output.change"
] | 745,838
| 745,839
|
u004815298
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) xの絶対値
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) x!
int fib(int x) {
if (x <= 2)
return x;
int a[x];
a[0] = 1;
a[1] = 2;
for (int i = 2; i < x; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[x - 1];
} //(x) フィボナッチ数列のx番目
int div1(ll x) { return x % 1000000007; }
main() {
int k = in(), x = in();
x--;
cout << x - k;
for (int i = x - k + 1; i <= k + x; i++)
cout << ' ' << i;
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) xの絶対値
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) x!
int fib(int x) {
if (x <= 2)
return x;
int a[x];
a[0] = 1;
a[1] = 2;
for (int i = 2; i < x; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[x - 1];
} //(x) フィボナッチ数列のx番目
int div1(ll x) { return x % 1000000007; }
main() {
int k = in(), x = in();
k--;
cout << x - k;
for (int i = x - k + 1; i <= k + x; i++)
cout << ' ' << i;
cout << endl;
}
|
[
"identifier.change"
] | 745,840
| 745,841
|
u160321725
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = max(X - K + 1, -1000000); i < min(X + K + 1, 1000000); i++) {
cout << i << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = max(X - K + 1, -1000000); i < min(X + K, 1000000); i++) {
cout << i << " ";
}
cout << endl;
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 745,844
| 745,845
|
u703472020
|
cpp
|
p02946
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
for (i = b - a + 1; i < b + a - 1; i++) {
cout << i << " ";
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
for (i = b - a + 1; i < b + a; i++) {
cout << i << " ";
}
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 745,854
| 745,855
|
u453235374
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, X, j;
cin >> K;
cin >> X;
j = K - 1;
for (int i = X - j; i <= X + j; i++) {
cout << i;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int K, X, j;
cin >> K;
cin >> X;
j = K - 1;
for (int i = X - j; i <= X + j; i++) {
cout << i << " ";
}
return 0;
}
|
[
"io.output.change"
] | 745,858
| 745,859
|
u705970433
|
cpp
|
p02946
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上 左 下 右
const int N = 100005, M = 1000005, K = 200005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
// int & long long
int k, x;
int main() {
cin >> k >> x;
for (int i = k - x + 1; i <= k + x - 1; i++)
cout << i << ' ';
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上 左 下 右
const int N = 100005, M = 1000005, K = 200005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
// int & long long
int k, x;
int main() {
cin >> x >> k;
for (int i = k - x + 1; i <= k + x - 1; i++)
cout << i << ' ';
return 0;
}
|
[
"expression.operation.binary.remove"
] | 745,863
| 745,864
|
u965118468
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int A;
A = X - K + 1;
for (int i = 0; i < K * 2 - 1; i++) {
cout << A;
A++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int A;
A = X - K + 1;
for (int i = 0; i < K * 2 - 1; i++) {
cout << A << " ";
A++;
}
}
|
[
"io.output.change"
] | 745,867
| 745,868
|
u406634703
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int count = 2 * k;
for (int i = 1; i < count; i++) {
cout << x - k + i;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int count = 2 * k;
for (int i = 1; i < count; i++) {
cout << x - k + i << " ";
}
}
|
[
"io.output.change"
] | 745,877
| 745,878
|
u990037841
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int count = 2 * k - 1;
for (int i = 1; i < count; i++) {
cout << x - k + i << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int count = 2 * k;
for (int i = 1; i < count; i++) {
cout << x - k + i << " ";
}
}
|
[
"expression.operation.binary.remove",
"io.output.change"
] | 745,880
| 745,878
|
u990037841
|
cpp
|
p02946
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int i;
//入力
int k, x;
cin >> k >> x;
//処理
//出力
for (int i = 0; i < 2000001; i++) {
if ((i - 1000000) <= (x - k + 1) && (i - 1000000) >= (x + k - 1))
cout << (i - 1000000) << ' ';
}
}
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int i;
//入力
int k, x;
cin >> k >> x;
//処理
//出力
for (int i = 0; i < 2000001; i++) {
if ((i - 1000000) >= (x - k + 1) && (i - 1000000) <= (x + k - 1))
cout << (i - 1000000) << ' ';
}
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 745,883
| 745,884
|
u958984779
|
cpp
|
p02946
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int i;
//入力
int k, x;
cin >> k >> x;
//処理
//出力
for (int i = 0; i < 2000001; i++) {
if ((i - 1000000) <= (x - k) && (i - 1000000) >= (x + k))
cout << (i - 1000000) << ' ';
}
}
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int i;
//入力
int k, x;
cin >> k >> x;
//処理
//出力
for (int i = 0; i < 2000001; i++) {
if ((i - 1000000) >= (x - k + 1) && (i - 1000000) <= (x + k - 1))
cout << (i - 1000000) << ' ';
}
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 745,885
| 745,884
|
u958984779
|
cpp
|
p02946
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int i;
//入力
int k, x;
cin >> k >> x;
//処理
//出力
for (int i = 0; i < 2000001; i++) {
if ((i - 1000000) >= (x - k) && (i - 1000000) <= (x + k))
cout << (i - 1000000) << ' ';
}
}
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int i;
//入力
int k, x;
cin >> k >> x;
//処理
//出力
for (int i = 0; i < 2000001; i++) {
if ((i - 1000000) >= (x - k + 1) && (i - 1000000) <= (x + k - 1))
cout << (i - 1000000) << ' ';
}
}
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 745,886
| 745,884
|
u958984779
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = X - K + 1; i <= X + K - 1; i++) {
int ans = i;
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = X - K + 1; i <= X + K - 1; i++) {
int ans = i;
cout << ans << " ";
}
return 0;
}
|
[
"io.output.change"
] | 745,889
| 745,890
|
u090084494
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = -(K - 1); i < K; i++) {
std::cout << X + i;
}
std::cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = -(K - 1); i < K; i++) {
std::cout << X + i << " ";
}
std::cout << endl;
return 0;
}
|
[
"expression.operation.binary.add"
] | 745,906
| 745,907
|
u783911129
|
cpp
|
p02946
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int k, x;
int main() {
cin >> k >> x;
int rc = k * 2 - 1;
rep(i, rc) { cout << x - (k - 1) + i; }
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int k, x;
int main() {
cin >> k >> x;
int rc = k * 2 - 1;
rep(i, rc) { cout << x - (k - 1) + i << " "; }
}
|
[
"io.output.change"
] | 745,910
| 745,911
|
u294829559
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
// Define.
int K, X;
//入力
cin >> K >> X;
//出力
for (int i = X - K + 1; i < X + K; i++) {
cout << i;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
// Define.
int K, X;
//入力
cin >> K >> X;
//出力
for (int i = X - K + 1; i < X + K; i++) {
cout << i << ' ';
}
}
|
[
"io.output.change"
] | 745,914
| 745,915
|
u454302028
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << i;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << i << " ";
}
cout << endl;
}
|
[
"io.output.change"
] | 745,920
| 745,921
|
u029953781
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
if (K == 1) {
cout << X << endl;
}
int a, b;
for (int i = 0; i < K; i++) {
if (X - K + 1 + i < -1000000) {
continue;
} else {
a = X - K + 1 + i;
break;
}
}
for (int i = 0; i < K; i--) {
if (X + K - 1 - i > 1000000) {
continue;
} else {
b = X + K - 1 - i;
break;
}
}
for (int i = a; i < b + 1; i++) {
cout << i << ' ';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
if (K == 1) {
cout << X << endl;
} else {
int a, b;
for (int i = 0; i < K; i++) {
if (X - K + 1 + i < -1000000) {
continue;
} else {
a = X - K + 1 + i;
break;
}
}
for (int i = 0; i < K; i--) {
if (X + K - 1 - i > 1000000) {
continue;
} else {
b = X + K - 1 - i;
break;
}
}
for (int i = a; i < b + 1; i++) {
cout << i << ' ';
}
}
}
|
[
"control_flow.branch.else.add"
] | 745,922
| 745,923
|
u408053928
|
cpp
|
p02946
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define REP(i, n) \
for (long long(i) = 0, i_bound = (long long)(n); (i) < i_bound; ++i)
#define FOR(i, a, b) for (long long(i) = (a); (i) < (b); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
const long long MOD = static_cast<long long>(1e9) + 7LL;
const long long INF = 1234567891234567890LL;
signed main() {
ll K, X;
cin >> K >> X;
for (ll i = X - K + 1; i < X + K - 1; i++) {
if (i != X - K + 1)
cout << " ";
cout << i;
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define REP(i, n) \
for (long long(i) = 0, i_bound = (long long)(n); (i) < i_bound; ++i)
#define FOR(i, a, b) for (long long(i) = (a); (i) < (b); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
const long long MOD = static_cast<long long>(1e9) + 7LL;
const long long INF = 1234567891234567890LL;
signed main() {
ll K, X;
cin >> K >> X;
for (ll i = X - K + 1; i <= X + K - 1; i++) {
if (i != X - K + 1)
cout << " ";
cout << i;
}
cout << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,924
| 745,925
|
u166696759
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.