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;
using ll = long long int;
using pii = pair<int, int>;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k - 1; i++) {
if (-1000000 <= i && i <= 1000000) {
cout << i << " ";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; i++) {
if (-1000000 <= i && i <= 1000000) {
cout << i << " ";
}
}
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 744,668
| 744,669
|
u007463213
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
int k, x;
cin >> k >> x;
//////
int a = k - x + 1;
int b = k + x - 1;
for (int i = a; i <= b; i++) {
cout << i << " ";
}
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
int k, x;
cin >> x >> k;
//////
int a = k - x + 1;
int b = k + x - 1;
for (int i = a; i <= b; i++) {
cout << i << " ";
}
}
|
[
"expression.operation.binary.remove"
] | 744,672
| 744,673
|
u531461815
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define MAXN 200100
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x < n and y >= 0 and y < n)
using namespace std;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int ini = max(-1000000, k - n + 1);
for (int i = ini; i <= ini + n + n - 1; i++) {
if (i - ini)
cout << " ";
cout << i;
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define MAXN 200100
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x < n and y >= 0 and y < n)
using namespace std;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int ini = max(-1000000, k - n + 1);
for (int i = ini; i <= ini + n + n - 2; i++) {
if (i - ini)
cout << " ";
cout << i;
}
cout << "\n";
return 0;
}
|
[
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 744,694
| 744,695
|
u009937643
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (int)(n); i++)
#define RREP(i, n) for (ll i = (int)(n)-1; i > -1; i--)
#define IN(T, x) \
T x; \
cin >> x;
#define AIN(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; }
#define A2IN(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; }
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
SORT(a); \
reverse(ALL(a))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define OUT(x) cout << x << endl
#define BOUT(b) \
if (b) { \
OUT("Yes"); \
} else { \
OUT("No"); \
}
const ll MOD = 100000007;
const ll INF = 10e9;
int main() {
IN(ll, K);
IN(ll, X);
for (ll i = X - K + 1; i < X + K - 1; i++)
cout << i << " ";
cout << K + X << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (int)(n); i++)
#define RREP(i, n) for (ll i = (int)(n)-1; i > -1; i--)
#define IN(T, x) \
T x; \
cin >> x;
#define AIN(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; }
#define A2IN(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; }
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
SORT(a); \
reverse(ALL(a))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define OUT(x) cout << x << endl
#define BOUT(b) \
if (b) { \
OUT("Yes"); \
} else { \
OUT("No"); \
}
const ll MOD = 100000007;
const ll INF = 10e9;
int main() {
IN(ll, K);
IN(ll, X);
for (ll i = X - K + 1; i < X + K - 1; i++)
cout << i << " ";
cout << K + X - 1 << endl;
}
|
[
"expression.operation.binary.add"
] | 744,698
| 744,699
|
u265273596
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (size_t i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int K, X;
cin >> K >> X;
for (int i = K - X + 1; i <= K + X - 1; i++) {
cout << i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (size_t i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int K, X;
cin >> X >> K;
for (int i = K - X + 1; i <= K + X - 1; i++) {
cout << i << " ";
}
}
|
[
"expression.operation.binary.remove"
] | 744,700
| 744,701
|
u342075214
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int k, x;
scanf("%d%d", &k, &x);
for (int i = x - k + 1; i < x + k; i++) {
printf("%-2d", i);
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int k, x;
scanf("%d%d", &k, &x);
for (int i = x - k + 1; i < x + k; i++) {
printf("%-5d", i);
}
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 744,724
| 744,723
|
u018372223
|
cpp
|
p02946
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
auto left = x - (k - 1);
auto right = x + (k + 1);
for (int i = left; i <= right; i++)
printf("%d%c", i, (i == right ? '\n' : ' '));
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
auto left = x - (k - 1);
auto right = x + (k - 1);
for (int i = left; i <= right; i++)
printf("%d%c", i, (i == right ? '\n' : ' '));
return 0;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 744,727
| 744,728
|
u723394740
|
cpp
|
p02946
|
// author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
int k, x;
cin >> k >> x;
vector<int> A;
for (int i = x - k; x + k >= i; i++) {
if (-1000000 <= i && i <= 1000000) {
A.push_back(i);
}
}
for (int i = 0; A.size() > i; i++) {
cout << A[i];
if (i + 1 != A.size())
cout << " ";
}
cout << endl;
}
|
// author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
int k, x;
cin >> k >> x;
vector<int> A;
for (int i = x - k + 1; x + k - 1 >= i; i++) {
if (-1000000 <= i && i <= 1000000) {
A.push_back(i);
}
}
for (int i = 0; A.size() > i; i++) {
cout << A[i];
if (i + 1 != A.size())
cout << " ";
}
cout << endl;
}
|
[
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 744,729
| 744,730
|
u466161487
|
cpp
|
p02946
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int k, x;
cin >> k >> x;
for (int i = k - x + 1; i < k + x; i++) {
printf("%d ", i);
}
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < k + x; i++) {
printf("%d ", i);
}
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 744,734
| 744,735
|
u880221923
|
cpp
|
p02946
|
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = -(K - 1); i < (K - 1); ++i) {
cout << X + i << " ";
}
}
|
#include <iomanip>
#include <iostream>
#include <string>
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.condition.change"
] | 744,736
| 744,737
|
u323542775
|
cpp
|
p02946
|
#include <stdio.h>
int main() {
int k, x;
scanf("%d%d", &k, &x);
for (int i = k - 1; i >= 0; i--) {
printf("%d", x - i);
}
for (int i = 1; i < k; i++) {
printf("%d", x + i);
}
}
|
#include <stdio.h>
int main() {
int k, x;
scanf("%d%d", &k, &x);
for (int i = k - 1; i >= 0; i--) {
printf("%d ", x - i);
}
for (int i = 1; i < k; i++) {
printf("%d ", x + i);
}
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 744,740
| 744,741
|
u469783285
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
int k, x;
cin >> k >> x;
for (int i = max(-1000000, x - k); i < min(1000000, x + k); i++) {
cout << i << " ";
}
cout << endl;
return 0;
}
ll power(ll n, ll k) {
ll res = 1;
while (k > 0) {
if (k & 1)
res = res * n % MOD;
n = n * n % MOD;
k >>= 1;
}
return res;
}
ll genfact(ll n, ll k) {
ll res = 1;
while (k >= 0) {
res = (res * (n - k)) % MOD;
k--;
}
return res;
}
ll inv(ll n) { return power(n, MOD - 2); }
ll fact(ll n) { return genfact(n, n - 1); }
ll nck(ll n, ll k) {
if (k == 0)
return 1;
if (n <= 0)
return 0;
return ((genfact(n, k) % MOD) * inv(fact(k))) % MOD;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
int k, x;
cin >> k >> x;
for (int i = max(-1000000, x - k + 1); i < min(1000000, x + k); i++) {
cout << i << " ";
}
cout << endl;
return 0;
}
ll power(ll n, ll k) {
ll res = 1;
while (k > 0) {
if (k & 1)
res = res * n % MOD;
n = n * n % MOD;
k >>= 1;
}
return res;
}
ll genfact(ll n, ll k) {
ll res = 1;
while (k >= 0) {
res = (res * (n - k)) % MOD;
k--;
}
return res;
}
ll inv(ll n) { return power(n, MOD - 2); }
ll fact(ll n) { return genfact(n, n - 1); }
ll nck(ll n, ll k) {
if (k == 0)
return 1;
if (n <= 0)
return 0;
return ((genfact(n, k) % MOD) * inv(fact(k))) % MOD;
}
|
[
"control_flow.loop.for.initializer.change"
] | 744,756
| 744,757
|
u755121033
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(), (X).end()
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 0};
int dy[] = {0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
int K, X;
void input() {
fast_io();
#ifdef __LOCAL
fs::path p = __FILE__;
fs::path input, output;
input = output = p.parent_path();
input += string("/input/") + string(p.stem()) + string(".txt");
output += string("/output/") + string(p.stem()) + string(".txt");
freopen(input.c_str(), "r", stdin);
freopen(output.c_str(), "w", stdout);
#endif
cin >> K >> X;
}
void solve() {
vector<int> ans;
ans.push_back(X);
for (int i = 1; i < K; i++) {
ans.push_back(X + K);
ans.push_back(X - K);
}
VSORT(ans)
cout << ans << endl;
}
int main() {
input();
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(), (X).end()
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 0};
int dy[] = {0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
int K, X;
void input() {
fast_io();
#ifdef __LOCAL
fs::path p = __FILE__;
fs::path input, output;
input = output = p.parent_path();
input += string("/input/") + string(p.stem()) + string(".txt");
output += string("/output/") + string(p.stem()) + string(".txt");
freopen(input.c_str(), "r", stdin);
freopen(output.c_str(), "w", stdout);
#endif
cin >> K >> X;
}
void solve() {
vector<int> ans;
ans.push_back(X);
for (int i = 1; i < K; i++) {
ans.push_back(X + i);
ans.push_back(X - i);
}
VSORT(ans)
cout << ans << endl;
}
int main() {
input();
solve();
return 0;
}
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 744,758
| 744,759
|
u858670323
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = k - x + 1; i <= k + x - 1; i++)
cout << i << " ";
cout << "\n";
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i <= k + x - 1; i++)
cout << i << " ";
cout << "\n";
return 0;
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 744,760
| 744,761
|
u773406543
|
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;
}
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++) {
cout << i << " ";
}
return 0;
}
|
[
"io.output.change"
] | 744,764
| 744,765
|
u372319000
|
cpp
|
p02946
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = 0; i < 2 * K - 1; i++) {
cout << X - (K - 1) + i;
}
cout << endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = 0; i < 2 * K - 1; i++) {
cout << X - (K - 1) + i << " ";
}
cout << endl;
}
|
[
"io.output.change"
] | 744,768
| 744,769
|
u627415027
|
cpp
|
p02946
|
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int cnt;
int main(void) {
int K, X;
cin >> K >> X;
int min = X - (K - 1);
int max = X + (K - 1);
for (int i = min; i <= max; i++) {
if (i == max)
cout << 4i << endl;
else
cout << i << " ";
}
}
|
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int cnt;
int main(void) {
int K, X;
cin >> K >> X;
int min = X - (K - 1);
int max = X + (K - 1);
for (int i = min; i <= max; i++) {
if (i == max)
cout << i << endl;
else
cout << i << " ";
}
}
|
[] | 744,782
| 744,783
|
u082930937
|
cpp
|
p02946
|
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int cnt;
int main(void) {
int K, X;
cin >> K >> X;
int min = X - (K - 1);
int max = X + (K - 1);
for (int i = min; i <= max; i++) {
if (i == max)
cout << 4i << endl;
else
cout << i << " ";
}
cout << endl;
}
|
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int cnt;
int main(void) {
int K, X;
cin >> K >> X;
int min = X - (K - 1);
int max = X + (K - 1);
for (int i = min; i <= max; i++) {
if (i == max)
cout << i << endl;
else
cout << i << " ";
}
}
|
[] | 744,784
| 744,783
|
u082930937
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int t = X - K + 1; t < X + K; t++) {
cout << t;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int t = X - K + 1; t < X + K; t++) {
cout << t << " ";
}
return 0;
}
|
[
"io.output.change"
] | 744,791
| 744,792
|
u006783139
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int a = X - K + 1;
for (int i = 0; i < 2 * K - 1; i++) {
cout << a + i;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int a = X - K + 1;
for (int i = 0; i < 2 * K - 1; i++) {
cout << a + i << " ";
}
cout << endl;
}
|
[
"io.output.change"
] | 744,795
| 744,796
|
u896053584
|
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 << x + k - 1 << 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 << x + k - 1 << endl;
}
|
[
"io.output.change"
] | 744,797
| 744,798
|
u107406081
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X, i;
cin >> K >> X;
for (i = max(-1000000, X - K + 1); i < min(1000000, X + K - 1); i++)
cout << i << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X, i;
cin >> K >> X;
for (i = max(-1000000, X - K + 1); i < min(1000000, X + K); i++)
cout << i << " ";
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 744,803
| 744,804
|
u983681697
|
cpp
|
p02946
|
#include <iostream>
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;
}
|
#include <iostream>
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;
}
|
[
"literal.string.change",
"io.output.change"
] | 744,811
| 744,812
|
u731665172
|
cpp
|
p02946
|
#include <iostream>
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;
}
|
#include <iostream>
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;
}
|
[
"literal.string.change",
"io.output.change"
] | 744,813
| 744,812
|
u731665172
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = K - X + 1; i < K + X; i++)
cout << i << "";
cout << endl;
}
|
#include <iostream>
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",
"expression.operation.binary.remove",
"literal.string.change",
"io.output.change"
] | 744,814
| 744,812
|
u731665172
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, k;
cin >> x >> k;
for (int i = k - x + 1; i < k + x; i++)
cout << i;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, k;
cin >> x >> k;
for (int i = k - x + 1; i < k + x; i++)
cout << i << " ";
return 0;
}
|
[
"io.output.change"
] | 744,819
| 744,820
|
u313970998
|
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 << " ";
cout << endl;
return 0;
}
|
#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 << " ";
cout << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 744,822
| 744,823
|
u236540805
|
cpp
|
p02946
|
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = -k; i < k; i++) {
if ((x + i >= -1000000) && (x + i <= 1000000)) {
// printf("%d",i);
cout << x + i << ' ';
}
}
cout << endl;
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = -k + 1; i < k; i++) {
if ((x + i >= -1000000) && (x + i <= 1000000)) {
cout << x + i << ' ';
}
}
cout << endl;
}
|
[
"control_flow.loop.for.initializer.change"
] | 744,828
| 744,829
|
u549383771
|
cpp
|
p02946
|
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = -k; i < k; i++) {
if ((x + i >= -1000000) && (x + i <= 1000000)) {
// printf("%d",i);
if (i == k - 1) {
cout << x + i << endl;
} else {
cout << x + i << ' ';
}
}
}
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = -k + 1; i < k; i++) {
if ((x + i >= -1000000) && (x + i <= 1000000)) {
// printf("%d",i);
if (i == k - 1) {
cout << x + i << endl;
} else {
cout << x + i << ' ';
}
}
}
}
|
[
"control_flow.loop.for.initializer.change"
] | 744,831
| 744,832
|
u549383771
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int k, x;
cin >> k >> x;
rep(i, 2 * k - 1) { cout << max(-1000000, x - k - 1 + i) << " "; }
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int k, x;
cin >> k >> x;
rep(i, 2 * k - 1) { cout << max(-1000000, x - k + 1 + i) << " "; }
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 744,833
| 744,834
|
u941313907
|
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;
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 << " ";
}
cout << endl;
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 744,851
| 744,852
|
u233383925
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, x, m, n = 0;
cin >> x >> m;
x = x - 1;
int j = m;
int s = (2 * x) - 1;
int h[s];
for (i = 0; i < x; i++) {
j--;
h[n] = j;
n++;
}
j = m;
h[n] = j;
n++;
for (i = 0; i < x; i++) {
j++;
h[n] = j;
n++;
}
int k = n + 1;
sort(h, h + k);
for (i = 0; i < n; i++)
cout << h[i + 1] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, x, m, n = 0;
cin >> x >> m;
x = x - 1;
int j = m;
int s = (2 * x) - 1;
int h[s];
for (i = 0; i < x; i++) {
j--;
h[n] = j;
n++;
}
j = m;
h[n] = j;
n++;
for (i = 0; i < x; i++) {
j++;
h[n] = j;
n++;
}
int k = n;
sort(h, h + k);
for (i = 0; i < n; i++)
cout << h[i] << " ";
return 0;
}
|
[
"expression.operation.binary.remove"
] | 744,859
| 744,860
|
u353919145
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, x, m, n = 0;
cin >> x >> m;
x = x - 1;
int j = m;
int s = (2 * x) - 1;
int h[s];
for (i = 0; i < x; i++) {
j--;
h[n] = j;
n++;
}
j = m;
h[n] = j;
n++;
for (i = 0; i < x; i++) {
j++;
h[n] = j;
n++;
}
int k = n + 1;
sort(h, h + k);
for (i = 0; i < n; i++)
cout << h[i + 1] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, x, m, n = 0;
cin >> x >> m;
x = x - 1;
int j = m;
int s = (2 * x) - 1;
int h[s];
for (i = 0; i < x; i++) {
j--;
h[n] = j;
n++;
}
j = m;
h[n] = j;
n++;
for (i = 0; i < x; i++) {
j++;
h[n] = j;
n++;
}
int k = n;
sort(h, h + k);
for (i = 0; i < n; i++)
cout << h[i] << " ";
return 0;
}
|
[
"expression.operation.binary.remove"
] | 744,859
| 744,861
|
u353919145
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// const ll INF = 1LL << 60;
// const int INF = 1001001001;
int main(void) {
int k, x;
cin >> k >> x;
for (int i = k - (x - 1); i <= k + (x - 1); i++)
printf("%d ", i);
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// const ll INF = 1LL << 60;
// const int INF = 1001001001;
int main(void) {
int k, x;
cin >> k >> x;
for (int i = x - (k - 1); i <= x + (k - 1); i++)
printf("%d ", i);
return 0;
}
|
[
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 744,862
| 744,863
|
u725680599
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int k, x;
cin >> k >> x;
if (k == 1) {
cout << x << endl;
return 0;
}
rep(i, 2 * k - 2) cout << x + i - k + 1 << " ";
return 0;
}
|
#include <bits/stdc++.h>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int k, x;
cin >> k >> x;
if (k == 1) {
cout << x << endl;
return 0;
}
rep(i, 2 * k - 1) { cout << x + i - k + 1 << " "; }
return 0;
}
|
[
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 744,866
| 744,865
|
u742494009
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = 0; i < 2 * k; ++i) {
cout << x - k + 1 + i << " ";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = 0; i < 2 * k - 1; ++i) {
cout << x - k + 1 + i << " ";
}
cout << endl;
}
|
[
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 744,867
| 744,868
|
u782700818
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long K, X;
cin >> K >> X;
int a = X - K + 1;
int b = X + K - 1;
for (int i = a; i <= b; i++) {
cout << a;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long K, X;
cin >> K >> X;
int a = X - K + 1;
int b = X + K - 1;
for (int i = a; i <= b; i++) {
cout << i << " ";
}
}
|
[
"identifier.change",
"io.output.change"
] | 744,883
| 744,884
|
u187772564
|
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;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 744,891
| 744,892
|
u882098164
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
if (K + X > 100000) {
for (int i = K - X + 1; i < 100000; i++) {
cout << i << " ";
}
cout << 100000;
}
if (K - X < -100000) {
for (int i = -100000; i < K + X - 1; i++) {
cout << i << " ";
}
cout << K + X - 1;
}
if (K + X - 1 <= 100000 && K - X + 1 >= -100000) {
for (int i = K - X + 1; i < K + X - 1; i++) {
cout << i << " ";
}
cout << K + X - 1;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> X >> K;
if (K + X > 100000) {
for (int i = K - X + 1; i < 100000; i++) {
cout << i << " ";
}
cout << 100000;
}
if (K - X < -100000) {
for (int i = -100000; i < K + X - 1; i++) {
cout << i << " ";
}
cout << K + X - 1;
}
if (K + X - 1 <= 100000 && K - X + 1 >= -100000) {
for (int i = K - X + 1; i < K + X - 1; i++) {
cout << i << " ";
}
cout << K + X - 1;
}
cout << endl;
}
|
[
"expression.operation.binary.remove"
] | 744,909
| 744,910
|
u578563928
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, X, i;
cin >> K >> X;
for (i = X - K; i <= X + K; i++) {
cout << i << " ";
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int K, X, i;
cin >> K >> X;
for (i = X - K + 1; i < X + K; i++) {
cout << i << " ";
}
cout << endl;
return 0;
}
|
[
"control_flow.loop.for.initializer.change",
"assignment.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 744,911
| 744,912
|
u067481442
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
for (int i = N - K + 1; i <= K - 1; i++) {
cout << i << " ";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
for (int i = N - K + 1; i <= N + K - 1; i++) {
cout << i << " ";
}
return 0;
}
|
[
"control_flow.loop.for.condition.change"
] | 744,915
| 744,916
|
u016119075
|
cpp
|
p02946
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
int main() {
int k, x;
std::cin >> k >> x;
for (int i = (k * -1); i < 0; ++i) {
std::cout << x + i << " ";
}
for (int i = 0; i < k; ++i) {
std::cout << x + i << " ";
}
std::cout << std::endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
int main() {
int k, x;
std::cin >> k >> x;
for (int i = (k * -1); i < -1; ++i) {
std::cout << x + i + 1 << " ";
}
for (int i = 0; i < k; ++i) {
std::cout << x + i << " ";
}
std::cout << std::endl;
return 0;
}
|
[
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 744,922
| 744,923
|
u581385507
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int i;
for (i = x - (k - 1); i <= x + (k - 1); i++) {
cout << i;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int i;
for (i = x - (k - 1); i <= x + (k - 1); i++) {
cout << i << " ";
}
return 0;
}
|
[
"io.output.change"
] | 744,926
| 744,927
|
u641500793
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
for (int i = -n + 1 + x; i <= n - 1 + x; i++)
cout << i;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
for (int i = -n + 1 + x; i <= n - 1 + x; i++)
cout << i << " ";
return 0;
}
|
[
"io.output.change"
] | 744,930
| 744,931
|
u236966848
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X, m;
cin >> K >> X;
m = X - K + 1;
while (m < X + K) {
cout << m;
m++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X, m;
cin >> K >> X;
m = X - K + 1;
while (m < X + K) {
cout << m << " ";
m++;
}
}
|
[
"io.output.change"
] | 744,943
| 744,944
|
u313124728
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
for (int i = N - K + 1; i < N + K; i++) {
if (i == N + K - 2) {
cout << i;
break;
}
cout << i << ' ';
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
for (int i = N - K + 1; i < N + K; i++) {
if (i == N + K - 1) {
cout << i;
break;
}
cout << i << ' ';
}
cout << endl;
return 0;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 744,949
| 744,950
|
u868205915
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int maxXMax = x + k - 1;
int minXMin = x - k;
for (int i = minXMin; i <= maxXMax; i++) {
if (i == maxXMax) {
cout << i << endl;
} else {
cout << i << " ";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int maxXMax = x + k - 1;
int minXMin = x - k + 1;
for (int i = minXMin; i <= maxXMax; i++) {
if (i == maxXMax) {
cout << i << endl;
} else {
cout << i << " ";
}
}
return 0;
}
|
[
"assignment.change"
] | 744,962
| 744,963
|
u334553376
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
for (int i = K - N + 1; i < K + N; i++) {
if (i = K + N - 1) {
cout << i << endl;
return 0;
}
cout << i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
for (int i = K - N + 1; i < K + N; i++) {
if (i == K + N - 1) {
cout << i << endl;
return 0;
}
cout << i << " ";
}
}
|
[
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 744,972
| 744,973
|
u429665788
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int x = 0; x < (a * 2) - 1; ++x) {
cout << b - (a - 1) + x;
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int x = 0; x < (a * 2) - 1; ++x) {
cout << b - (a - 1) + x << " ";
}
cout << endl;
return 0;
}
|
[
"io.output.change"
] | 744,974
| 744,975
|
u163185262
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int N = 1e5;
const int MOD = 1e9 + 7;
const double PI = acos(-1);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int k, x;
cin >> k >> x;
for (int ans = x; ans < x + k; ans++)
cout << ans << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int N = 1e5;
const int MOD = 1e9 + 7;
const double PI = acos(-1);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int k, x;
cin >> k >> x;
for (int ans = x - k + 1; ans < x + k; ans++)
cout << ans << ' ';
}
|
[
"control_flow.loop.for.initializer.change"
] | 744,991
| 744,992
|
u645588943
|
cpp
|
p02946
|
#define _USE_MATH_DEFINES
#include <iostream>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define fore(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define fr(i, a, b) for (int i = (int)a - 1; i >= (int)b; i--)
#define inf INT32_MAX
#define N 200005
#define mod 1000000000 + 7
using namespace std;
typedef long long ll;
typedef pair<int, int> pr;
inline void solve() {
int x, k;
cin >> k >> x;
fore(i, max(-1000000, x - k), min(x + k, 1000001)) { cout << i << ' '; }
}
int main() {
fast;
solve();
return 0;
}
|
#define _USE_MATH_DEFINES
#include <iostream>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define fore(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define fr(i, a, b) for (int i = (int)a - 1; i >= (int)b; i--)
#define inf INT32_MAX
#define N 200005
#define mod 1000000000 + 7
using namespace std;
typedef long long ll;
typedef pair<int, int> pr;
inline void solve() {
int x, k;
cin >> k >> x;
fore(i, max(-1000000, x - k + 1), min(x + k, 1000001)) { cout << i << ' '; }
}
int main() {
fast;
solve();
return 0;
}
|
[
"expression.operation.binary.add"
] | 745,007
| 745,008
|
u542486952
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
vector<int> vec(2 * k - 1);
for (int i = 0; i < (2 * k - 1); i++) {
vec.at(i) = x - k + 1 + i;
}
for (int i = 0; i < (2 * k - 1); i++) {
cout << vec.at(i);
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
vector<int> vec(2 * k - 1);
for (int i = 0; i < (2 * k - 1); i++) {
vec.at(i) = x - k + 1 + i;
}
for (int i = 0; i < (2 * k - 1); i++) {
cout << vec.at(i) << ' ';
}
cout << endl;
}
|
[
"io.output.change"
] | 745,013
| 745,014
|
u955282280
|
cpp
|
p02946
|
//
// Created by 伊東麻沙美 on 2019/10/22.
//
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int i;
for (i = X - K + 1; i <= X + K - 1; i++) {
cout << i;
}
}
|
//
// Created by 伊東麻沙美 on 2019/10/22.
//
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int i;
for (i = X - K + 1; i <= X + K - 1; i++) {
cout << i << " ";
}
}
|
[
"io.output.change"
] | 745,017
| 745,018
|
u640466057
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int m = min(-1000000, x - k + 1);
int M = max(1000000, x + k - 1);
for (int i = m; i < M; i++) {
cout << i << " ";
}
cout << M << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int m = max(-1000000, x - k + 1);
int M = min(1000000, x + k - 1);
for (int i = m; i < M; i++) {
cout << i << " ";
}
cout << M << endl;
}
|
[
"misc.opposites",
"identifier.change",
"call.function.change"
] | 745,021
| 745,022
|
u882039496
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int m = min(-1000000, x - k + 1);
int M = max(1000000, x + k - 1);
for (int i = m; i <= M; i++) {
cout << i << " ";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int m = max(-1000000, x - k + 1);
int M = min(1000000, x + k - 1);
for (int i = m; i < M; i++) {
cout << i << " ";
}
cout << M << endl;
}
|
[
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 745,023
| 745,022
|
u882039496
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = 0; i < 2 * k - i; i++) {
cout << x - k + 1 + i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = 0; i < ((2 * k) - 1); i++) {
cout << x - k + 1 + i << " ";
}
}
|
[
"control_flow.loop.for.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 745,032
| 745,033
|
u298620933
|
cpp
|
p02946
|
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = b - a + 1; i < b + a; i++)
cout << i;
cout << endl;
}
|
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = b - a + 1; i < b + a; i++)
cout << i << " ";
cout << endl;
}
|
[
"io.output.change"
] | 745,039
| 745,040
|
u530329977
|
cpp
|
p02946
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> b;
for (int i = 0; i < 2 * a - 1; i++) {
cout << b - a + 1 << " ";
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> b;
for (int i = 0; i < 2 * a - 1; i++) {
cout << b - a + 1 + i << " ";
}
cout << endl;
return 0;
}
|
[
"expression.operation.binary.add"
] | 745,041
| 745,042
|
u871941262
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int a = x - k;
int b = x + k;
for (int i = a + 1; i < b; i++) {
cout << i;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
int a = x - k;
int b = x + k;
for (int i = a + 1; i < b; i++) {
cout << i << " ";
}
}
|
[
"io.output.change"
] | 745,045
| 745,046
|
u975604467
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
for (int i = s - a; i <= s + a; i++) {
if (i != s + a) {
cout << i << " ";
} else {
cout << i << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
for (int i = s - a + 1; i < s + a; i++) {
if (i != s + a) {
cout << i << " ";
} else {
cout << i << endl;
}
}
}
|
[
"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,054
| 745,055
|
u103850114
|
cpp
|
p02946
|
#include <iostream>
int main(void) {
int k, x;
scanf("%d", &k);
scanf("%d", &x);
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d/n", i);
}
}
|
#include <iostream>
int main(void) {
int k, x;
scanf("%d", &k);
scanf("%d", &x);
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d ", i);
}
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 745,056
| 745,057
|
u442754977
|
cpp
|
p02946
|
#include <iostream>
int main(void) {
int k, x;
scanf("%d", &k);
scanf("%d", &x);
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d", i);
}
}
|
#include <iostream>
int main(void) {
int k, x;
scanf("%d", &k);
scanf("%d", &x);
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d ", i);
}
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 745,058
| 745,057
|
u442754977
|
cpp
|
p02946
|
#include <iostream>
int main(void) {
int k, x;
scanf("%d", &k);
scanf("%d", &x);
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d", &i);
}
}
|
#include <iostream>
int main(void) {
int k, x;
scanf("%d", &k);
scanf("%d", &x);
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d ", i);
}
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 745,059
| 745,057
|
u442754977
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int k, x;
std::cin >> k >> x;
int start = x - k + 1;
int end = x + k - 1;
if (start < -1000000)
start = -1000000;
if (end > 1000000)
end = 1000000;
int i;
for (i = start; i <= end; i++)
std::cout << i;
}
|
#include <iostream>
using namespace std;
int main() {
int k, x;
std::cin >> k >> x;
int start = x - k + 1;
int end = x + k - 1;
if (start < -1000000)
start = -1000000;
if (end > 1000000)
end = 1000000;
int i;
for (i = start; i <= end; i++)
std::cout << i << " ";
}
|
[
"expression.operation.binary.add"
] | 745,062
| 745,063
|
u063873990
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X, min, max;
cin >> K >> X;
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 <bits/stdc++.h>
using namespace std;
int main() {
int K, X, min, max;
cin >> K >> X;
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;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 745,064
| 745,065
|
u980909653
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b, c, d;
cin >> a >> b;
c = b - a;
for (int i = 0; i < a; i++) {
cout << c << " ";
c++;
}
cout << b << " ";
for (int i = 0; i < a - 1; i++) {
b += 1;
cout << b;
if (i != a - 1) {
cout << " ";
}
}
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b, c, d;
cin >> a >> b;
c = b - a + 1;
for (int i = 0; i < a - 1; i++) {
cout << c << " ";
c++;
}
cout << b << " ";
for (int i = 0; i < a - 1; i++) {
b += 1;
cout << b;
if (i != a - 1) {
cout << " ";
}
}
cout << "\n";
}
|
[
"assignment.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 745,074
| 745,075
|
u652908807
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b, c, d;
cin >> a >> b;
c = b - a;
for (int i = 0; i < a - 1; i++) {
cout << c << " ";
c++;
}
cout << b << " ";
for (int i = 0; i < a - 1; i++) {
b += 1;
cout << b;
if (i != a - 1) {
cout << " ";
}
}
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b, c, d;
cin >> a >> b;
c = b - a + 1;
for (int i = 0; i < a - 1; i++) {
cout << c << " ";
c++;
}
cout << b << " ";
for (int i = 0; i < a - 1; i++) {
b += 1;
cout << b;
if (i != a - 1) {
cout << " ";
}
}
cout << "\n";
}
|
[
"assignment.change"
] | 745,076
| 745,075
|
u652908807
|
cpp
|
p02946
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int min = x - (k - 1);
int max = x + (k - 1);
for (int i = min; i <= max; i++) {
cout << i;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int min = x - (k - 1);
int max = x + (k - 1);
for (int i = min; i <= max; i++) {
cout << i << " ";
}
return 0;
}
|
[
"io.output.change"
] | 745,104
| 745,105
|
u640834132
|
cpp
|
p02946
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int min = x - (k - 1);
int max = x + (k - 1);
for (int i = min; i <= max; i++) {
cout << i + " ";
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int min = x - (k - 1);
int max = x + (k - 1);
for (int i = min; i <= max; i++) {
cout << i << " ";
}
return 0;
}
|
[
"io.output.change"
] | 745,106
| 745,105
|
u640834132
|
cpp
|
p02946
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int min = x - (k - 1);
int max = x + (k - 1);
for (int i = min; i <= max; i++) {
cout << i + "";
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int min = x - (k - 1);
int max = x + (k - 1);
for (int i = min; i <= max; i++) {
cout << i << " ";
}
return 0;
}
|
[
"io.output.change",
"literal.string.change"
] | 745,107
| 745,105
|
u640834132
|
cpp
|
p02946
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int min = x - (k - 1);
int max = x + (k - 1);
for (int i = min; i <= max; i++) {
cout << i;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int k, x;
cin >> k;
cin >> x;
int min = x - (k - 1);
int max = x + (k - 1);
for (int i = min; i <= max; i++) {
cout << i << " ";
}
return 0;
}
|
[
"io.output.change"
] | 745,108
| 745,105
|
u640834132
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int k, x;
cin >> k, x;
for (int i = 1; i <= 2 * k - 1; i++) {
if (i > 1)
cout << " ";
cout << x - k + i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int k, x;
cin >> k >> x;
for (int i = 1; i <= 2 * k - 1; i++) {
if (i > 1)
cout << " ";
cout << x - k + i;
}
return 0;
}
|
[] | 745,109
| 745,110
|
u720447689
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long k, x, a, b;
cin >> k >> x;
if (k == 1) {
cout << k;
return 0;
}
a = (x - k) + 1;
b = (x + k) - 1;
if (a < -1000000) {
a = -1000000;
} else if (b > 1000000) {
b = 1000000;
}
for (int i = a; i <= b; i++) {
cout << i << ' ';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long k, x, a, b;
cin >> k >> x;
if (k == 1) {
cout << x;
return 0;
}
a = (x - k) + 1;
b = (x + k) - 1;
if (a < -1000000) {
a = -1000000;
} else if (b > 1000000) {
b = 1000000;
}
for (int i = a; i <= b; i++) {
cout << i << ' ';
}
}
|
[
"identifier.change",
"io.output.change"
] | 745,115
| 745,116
|
u053363329
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; i++) {
cout << i;
}
}
|
#include <iostream>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; i++) {
cout << i << " ";
}
}
|
[
"io.output.change"
] | 745,117
| 745,118
|
u228475480
|
cpp
|
p02946
|
#include <iostream>
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 <iostream>
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"
] | 745,121
| 745,122
|
u060012684
|
cpp
|
p02946
|
#include <iostream>
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 <iostream>
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;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 745,123
| 745,122
|
u060012684
|
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;
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) {
cout << i << " ";
}
cout << endl;
return 0;
}
|
[
"io.output.change"
] | 745,132
| 745,133
|
u364124935
|
cpp
|
p02946
|
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int x, k;
int main() {
cin >> x >> k;
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d ", i);
}
}
|
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int x, k;
int main() {
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
printf("%d ", i);
}
}
|
[
"expression.operation.binary.remove"
] | 745,140
| 745,141
|
u760628894
|
cpp
|
p02946
|
#include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define out(str) cout << str << endl
#define ALL(a) (a).begin(), (a).end()
#define INF (1 << 29)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, K;
int main() {
cin >> N >> K;
repi(i, K - N - 1, K + N) { cout << i << " "; }
out(" ");
}
|
#include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define out(str) cout << str << endl
#define ALL(a) (a).begin(), (a).end()
#define INF (1 << 29)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, K;
int main() {
cin >> N >> K;
repi(i, K - N + 1, K + N) { cout << i << " "; }
out(" ");
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 745,142
| 745,143
|
u190907730
|
cpp
|
p02946
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
const long long INF = 1LL << 60;
int main() {
int k, x;
cin >> k >> x;
for (int i = k - x + 1; i < k + x; i++) {
cout << i << ' ';
}
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
const long long INF = 1LL << 60;
int main() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < k + x; i++) {
cout << i << ' ';
}
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 745,154
| 745,155
|
u883323885
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, X;
int counter = 0;
cin >> K, X;
for (int i = -300; i < 300; ++i) {
if (X - K < i && X + K > i)
cout << i << " ";
}
}
|
#include <iostream>
using namespace std;
int main() {
int K, X;
int counter = 0;
cin >> K >> X;
for (int i = -300; i < 300; ++i) {
if (X - K < i && X + K > i)
cout << i << " ";
}
}
|
[] | 745,158
| 745,159
|
u419501474
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int min = X - (K - 1);
int max = X + (K + 1);
if (min < -1000000)
min = -1000000;
if (max > 100000)
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 = X - (K - 1);
int max = X + (K - 1);
if (min < -1000000)
min = -1000000;
if (max > 100000)
max = 1000000;
for (int i = min; i <= max; i++)
cout << i << " ";
cout << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 745,160
| 745,161
|
u204523044
|
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;
cout << ' ';
}
cout << endl;
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;
cout << ' ';
}
cout << endl;
return 0;
}
|
[
"control_flow.loop.for.initializer.change"
] | 745,164
| 745,165
|
u600947414
|
cpp
|
p02946
|
#include <iostream>
using namespace std;
int main(void) {
int a, b, c = 0, i;
cin >> a >> b;
for (i = b - a + 1; c < a * 2 - 1; i++) {
cout << i;
c++;
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int a, b, c = 0, i;
cin >> a >> b;
for (i = b - a + 1; c < a * 2 - 1; i++) {
cout << i << " ";
c++;
}
cout << endl;
return 0;
}
|
[
"io.output.change"
] | 745,168
| 745,169
|
u856874613
|
cpp
|
p02946
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using sl = signed long;
using sll = signed long long;
using ll = long long;
// -exec call dup2(open("input.txt", 0), 0)
int main() {
int a, b;
std::cin >> a >> b;
for (int i = b - a + 1; i < b + a; i++) {
std::cout << i;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using sl = signed long;
using sll = signed long long;
using ll = long long;
// -exec call dup2(open("input.txt", 0), 0)
int main() {
int a, b;
std::cin >> a >> b;
for (int i = b - a + 1; i < b + a; i++) {
std::cout << i << " ";
}
return 0;
}
|
[
"expression.operation.binary.add"
] | 745,172
| 745,173
|
u515047101
|
cpp
|
p02946
|
#include <cstdio>
int main() {
int k, x;
scanf("%d%d", &k, &x);
int i;
for (i = k - x; i < (k + x + 1); i++) {
printf("%d ", i);
}
return 0;
}
|
#include <cstdio>
int main() {
int k, x;
scanf("%d%d", &x, &k);
int i;
for (i = k - x + 1; i < (k + x); i++) {
printf("%d ", i);
}
return 0;
}
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"assignment.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 745,176
| 745,177
|
u470481460
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
int X;
cin >> K >> X;
if (X + K >= 1000000) {
for (int i = X - K - 1; i <= 1000000; i++) {
cout << i << " ";
}
}
else if (X - K <= -1000000) {
for (int i = X + K - 1; i >= -1000000; i--) {
cout << i << " ";
}
}
else {
for (int i = X - K - 1; i <= X + K - 1; i++) {
cout << i << " ";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
int X;
cin >> K >> X;
if (X + K - 1 >= 1000000) {
for (int i = X - K + 1; i <= 1000000; i++) {
cout << i << " ";
}
}
else if (X - K + 1 <= -1000000) {
for (int i = X + K - 1; i >= -1000000; i--) {
cout << i << " ";
}
}
else {
for (int i = X - K + 1; i <= X + K - 1; i++) {
cout << i << " ";
}
}
}
|
[
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 745,180
| 745,181
|
u707810208
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = a; i > 0; i--)
cout << b - i << " ";
for (int i = 0; i < a; i++)
cout << b + i << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = a - 1; i > 0; i--)
cout << b - i << " ";
for (int i = 0; i < a; i++)
cout << b + i << " ";
}
|
[
"control_flow.loop.for.initializer.change"
] | 745,193
| 745,194
|
u628494808
|
cpp
|
p02946
|
#include <iostream>
int main(int argc, char **argv) {
int K, X;
std::cin >> K;
std::cin >> X;
for (int i = X - K + 1; i <= X + K - 1; i++) {
std::cout << i;
}
std::cout << std::endl;
return 0;
}
|
#include <iostream>
int main(int argc, char **argv) {
int K, X;
std::cin >> K;
std::cin >> X;
for (int i = X - K + 1; i <= X + K - 1; i++) {
std::cout << i << " ";
}
std::cout << std::endl;
return 0;
}
|
[
"expression.operation.binary.add"
] | 745,198
| 745,199
|
u922974720
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int K, X;
cin >> K >> X;
for (int i = -K + 1; i <= K - 1; i++) {
cout << X + i;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int K, X;
cin >> K >> X;
for (int i = -K + 1; i <= K - 1; i++) {
cout << X + i << ' ';
}
}
|
[
"io.output.change"
] | 745,215
| 745,216
|
u591779169
|
cpp
|
p02946
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
for (size_t i = m - n + 1; i < m + n; i++) {
std::cout << i;
if (i != m + n - 1) {
std::cout << " ";
}
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
for (int i = m - n + 1; i < m + n; i++) {
std::cout << i;
if (i != m + n - 1) {
std::cout << " ";
}
}
return 0;
}
|
[
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 745,237
| 745,238
|
u914739916
|
cpp
|
p02946
|
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = k * (-1); i <= k - 2; i++) {
cout << x + i + 1;
}
cout << endl;
return 0;
}
|
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int k, x;
cin >> k >> x;
for (int i = k * (-1); i <= k - 2; i++) {
cout << x + i + 1 << " ";
}
cout << endl;
return 0;
}
|
[
"io.output.change"
] | 745,243
| 745,244
|
u870074807
|
cpp
|
p02946
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
int K, X;
cin >> K >> X;
for (int i = X - K + 1; i <= X + K - 1; ++i) {
cout << i;
}
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
int K, X;
cin >> K >> X;
for (int i = X - K + 1; i <= X + K - 1; ++i) {
cout << i << " ";
}
}
|
[
"io.output.change"
] | 745,245
| 745,246
|
u102131583
|
cpp
|
p02946
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define all(x) (x).begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// bool debug=false;
/*---------------------------------------------------*/
int main() {
int K, X;
cin >> K >> X;
for (int i = max(-1000000, X - K + 1); i < min(1000000, X + K - 1); i++) {
if (i == max(-1000000, X - K + 1))
cout << i;
else
cout << " " << i;
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define all(x) (x).begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// bool debug=false;
/*---------------------------------------------------*/
int main() {
int K, X;
cin >> K >> X;
for (int i = max(-1000000, X - K + 1); i <= min(1000000, X + K - 1); i++) {
if (i == max(-1000000, X - K + 1))
cout << i;
else
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,255
| 745,256
|
u587248350
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = K - X + 1; i < K + X - 1; i++) {
cout << i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> X >> K;
for (int i = K - X + 1; i <= K + X - 1; i++) {
cout << i << " ";
}
}
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 745,257
| 745,258
|
u111600809
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, M;
cin >> K >> M;
for (int i = K - M + 1; i < K + M - 1; i++) {
cout << i << " ";
}
cout << K + M - 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, M;
cin >> K >> M;
for (int i = M - K + 1; i < K + M - 1; i++) {
cout << i << " ";
}
cout << K + M - 1;
}
|
[
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 745,266
| 745,267
|
u454081619
|
cpp
|
p02946
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int K, X;
int min_num, max_num;
cin >> K >> X;
min_num = max({-1000000, X - K + 1});
max_num = min({1000000, X + K - 1});
for (int i = 0; i < max_num - min_num; i++) {
cout << min_num + i << " ";
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int K, X;
int min_num, max_num;
cin >> K >> X;
min_num = max({-1000000, X - K + 1});
max_num = min({1000000, X + K - 1});
for (int i = 0; i < max_num - min_num + 1; i++) {
cout << min_num + i << " ";
}
cout << endl;
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 745,277
| 745,278
|
u443975466
|
cpp
|
p02946
|
#include <iostream>
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;
return 0;
}
|
#include <iostream>
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;
return 0;
}
|
[
"io.output.change"
] | 745,279
| 745,280
|
u470566982
|
cpp
|
p02946
|
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define minX -1000000
#define maxX 1000000
int main() {
int N, X;
cin >> N >> X;
for (int i = max(X - N, minX); i <= min(X + N, maxX); i++) {
cout << i << (i == min(X + N, maxX) ? "" : " ");
}
return 0;
}
/* 注意すべき点
グローバル以外の配列は初期化すべし
*/
|
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define minX -1000000
#define maxX 1000000
int main() {
int N, X;
cin >> N >> X;
for (int i = max(X - N + 1, minX); i <= min(X + N - 1, maxX); i++) {
cout << i << (i == min(X + N, maxX) ? "" : " ");
}
return 0;
}
/* 注意すべき点
グローバル以外の配列は初期化すべし
*/
|
[
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 745,299
| 745,300
|
u992432716
|
cpp
|
p02946
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int min = X - (K - 1);
for (int i = 0; i < 2 * K - 1; i++) {
cout << min + i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int min = X - (K - 1);
for (int i = 0; i < 2 * K - 1; i++) {
cout << min + i << ' ';
}
return 0;
}
|
[
"io.output.change"
] | 745,314
| 745,315
|
u726060136
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.