problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
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... | #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... | [
"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; ... | #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; ... | [
"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(), ::tolo... | #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(), ::tolo... | [
"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... | #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... | [
"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;
}
... | #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;
... | [
"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 fir... | #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 fir... | [
"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 pu... | #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 pu... | [
"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 it... | #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 it... | [
"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);
retur... | #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... | [
"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;
fo... | #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;
fo... | [
"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); ... | //#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); ... | [
"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, ...) ... | // 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, ...) ... | [
"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... | #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... | [
"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)
... | #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)
... | [
"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); b... | #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); b... | [
"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... | #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... | [
"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;
retur... | #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;
r... | [
"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 ... | #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 ... | [
"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 <... | #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 << " "... | [
"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;
r... | #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;
r... | [
"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 <ve... | #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 <ve... | [
"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... | #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;
}
}
... | [
"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 st... | #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 st... | [
"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.