text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 9;
int main() {
long long i, j, m, n, t, l, r, fir, sec;
scanf("%lld", &t);
while (t--) {
scanf("%lld %lld %lld", &n, &l, &r);
long long pos = 0;
for (i = 1; i <= n; i++) {
if (i == n) {
pos = -1;
break;
}
pos += (n - i) * 2;
if (pos >= l) {
pos -= (n - i) * 2 - 1;
fir = i;
break;
}
}
if (pos == -1) {
cout << 1 << endl;
continue;
}
long long dis = l - pos + 1;
sec = (dis + 1) / 2 + i;
while (l <= r) {
if (fir == n)
printf("%lld", 1ll);
else if (l % 2 == 1)
printf("%lld", fir);
else {
printf("%lld", sec++);
if (sec > n) {
fir++;
sec = fir + 1;
}
}
printf("%c", l == r ? '\n' : ' ');
l++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
const int inf1 = 1e9;
const long long int inf2 = 1e18;
const int N = 100000;
using namespace std;
int dirs[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int solve() {
long long int n, l, r;
cin >> n >> l >> r;
if (l == n * (n - 1) + 1) {
cout << 1 << "\n";
return 0;
}
long long int bl = 1;
bool f = false;
if (r == (n * (n - 1) + 1)) {
r--;
f = true;
}
long long int lo = 1;
long long int hi = n - 1;
while (lo <= hi) {
long long int m = (lo + hi) / 2;
long long int ch = 2 * n * m - m * (m + 1);
if (ch >= l) {
bl = m;
hi = m - 1;
} else
lo = m + 1;
}
long long int val = 2 * n * (bl - 1) - bl * (bl - 1);
for (long long int i = l; i <= r; i++) {
if (i % 2 == 0) {
cout << bl + (i - val) / 2 << " ";
} else {
cout << bl << " ";
}
if ((2 * n * bl - (bl + 1) * bl) == i) {
val = i;
bl++;
}
}
if (f) cout << 1 << " ";
cout << "\n";
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 200001;
const long long MOD = 1000000007;
const long long INF = LLONG_MAX;
vector<long long> v;
void pre() {
v.push_back(1LL);
for (long long i = 1; i <= 1e5; i++) v.push_back(i * 2);
for (long long i = 1; i < v.size(); i++) v[i] += v[i - 1];
}
long long Getfirst(long long n, long long x) {
long long id = upper_bound(v.begin(), v.end(), x) - v.begin();
return (n - id);
}
long long Getlast(long long n, long long x) {
long long id = upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
long long dif = x - v[id] + 1;
return (n - dif / 2);
}
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
pre();
int tc = 1, cs = 0;
cin >> tc;
while (tc--) {
long long n, l, r, i, limit;
cin >> n >> l >> r;
limit = n * (n - 1) + 1;
vector<long long> ans;
for (i = l; i <= r; i++) {
if (i == limit) {
ans.push_back(1);
break;
}
if (i & 1)
ans.push_back(Getfirst(n, limit - i));
else
ans.push_back(Getlast(n, limit - i));
}
for (auto it : ans) cout << it << ' ';
cout << '\n';
;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long t, n, l, r, q;
int main() {
scanf("%lld", &t);
while (t--) {
scanf("%lld%lld%lld", &n, &l, &r);
long long now = 0;
q = n - 1;
bool flag = 0;
for (int i = 1; i < n - 1; i++) {
if (now + (n - i) * 2 >= l) {
q = i;
break;
}
now += 2 * (n - i);
}
for (int i = q; i <= n - 1; i++) {
for (int j = i + 1; j <= n; j++) {
now++;
if (now > r) break;
if (now >= l) printf("%d ", i);
now++;
if (now > r) break;
if (now >= l) printf("%d ", j);
}
if (now > r) break;
}
now++;
if (l <= now && now <= r) printf("%d ", 1);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long cnt[100006];
vector<int> ans;
int main() {
int tests = 1;
int n;
long long l, r;
scanf("%d", &tests);
while (tests--) {
ans.clear();
scanf("%d%lld%lld", &n, &l, &r);
for (int i = 1; i < n; ++i) cnt[i] = 1ll * (2 * n - i - 1) * i;
int s = 0, t = 0, f = 0;
if (r == 1ll * n * (n - 1) + 1) f = 1;
for (int i = 1; i < n; ++i) {
if (cnt[i] < l) s = i;
if (cnt[i] <= r) t = i;
}
s++;
t++;
for (int i = s; i <= t; ++i) {
for (int j = i + 1; j <= n; ++j) ans.push_back(i), ans.push_back(j);
}
r -= cnt[s - 1] + 1, l -= cnt[s - 1] + 1;
for (int i = 0; i < (int)ans.size(); ++i) {
if (i >= l && i <= r) printf("%d ", ans[i]);
}
if (f) printf("1");
puts("");
}
}
|
#include <bits/stdc++.h>
#pragma gcc optimize("O3")
#pragma gcc optimize("Ofast")
using namespace std;
long long n, l, r;
long long i, j, t;
void nx() {
j++;
if (j == n + 1) {
i++;
j = i + 1;
}
}
void print() {
if (!t) {
cout << i << " ";
} else {
cout << j << " ";
nx();
}
t ^= 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int k = 0;
cin >> n >> l >> r;
if (r == n * (n - 1) + 1) {
r--;
k = 1;
}
long long cnt = 1;
for (i = 1; i <= n && cnt + (n - i) * 2 < l; i++) {
cnt += (n - i) * 2;
}
j = i + 1;
while (cnt + 2 <= l) {
cnt += 2;
j++;
}
t = (l - cnt) % 2;
for (int z = 1; z <= r - l + 1; z++) {
print();
}
if (k)
cout << 1 << '\n';
else
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n, lgrp = 0, rgrp = 0;
long long int l, r;
cin >> n >> l >> r;
for (int k = 1; k <= n - 1; ++k) {
if (l <= 2 * (n - k) * 1LL) {
lgrp = k;
break;
} else {
l -= 2 * (n - k) * 1LL;
}
}
for (int k = 1; k <= n - 1; ++k) {
if (r <= 2 * (n - k) * 1LL) {
rgrp = k;
break;
} else {
r -= 2 * (n - k) * 1LL;
}
}
int start = 0;
if (lgrp == 0) lgrp = n;
if (rgrp == 0) rgrp = n;
if (lgrp == n && rgrp == n) {
cout << 1;
} else if (lgrp != rgrp) {
if (l % 2 == 1) {
++l;
cout << lgrp << " ";
}
start = l / 2;
cout << lgrp + start << " ";
++l;
for (int i = l; i <= 2 * (n - lgrp); ++i) {
if (i % 2 == 0) {
++start;
cout << lgrp + start << " ";
} else {
cout << lgrp << " ";
}
}
for (int i = lgrp + 1; i < rgrp; ++i) {
start = 0;
for (int j = 1; j <= 2 * (n - i); ++j) {
if (j % 2 == 0) {
++start;
cout << i + start << " ";
} else {
cout << i << " ";
}
}
}
if (rgrp == n) {
cout << 1 << " ";
} else {
start = 0;
for (int i = 1; i <= r; ++i) {
if (i % 2 == 0) {
++start;
cout << rgrp + start << " ";
} else {
cout << rgrp << " ";
}
}
}
} else {
if (l == r) {
if (l % 2 == 1) {
cout << lgrp << " ";
++l;
} else {
start = l / 2;
cout << lgrp + start << " ";
++l;
}
} else if (l % 2 == 1) {
++l;
cout << lgrp << " ";
}
if (l <= r) {
start = l / 2;
cout << lgrp + start << " ";
++l;
}
for (int i = l; i <= r; ++i) {
if (i % 2 == 0) {
++start;
cout << lgrp + start << " ";
} else {
cout << lgrp << " ";
}
}
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin >> t;
while (t--) {
ll n, l, r;
cin >> n >> l >> r;
ll sm = 0;
ll iters = 0;
ll add = n - 1;
if (l == n * (n - 1) + 1) {
cout << 1 << endl;
continue;
}
while (2 * sm < l) {
sm += add;
add--;
iters++;
}
sm -= (add + 1);
sm *= 2;
sm++;
ll currnext = iters + 1;
bool startonone = true;
while (sm < l) {
if (sm + 1 < l) {
sm += 2;
currnext++;
} else {
startonone = false;
sm++;
}
}
for (ll i = l; i <= min(r, n * (n - 1)); i++) {
ll toprint;
if (startonone) {
if ((i - l) % 2 == 0)
toprint = iters;
else {
toprint = currnext;
currnext++;
}
} else {
if ((i - l) % 2 == 0) {
toprint = currnext;
currnext++;
} else {
toprint = iters;
}
}
if (toprint == n) {
iters++;
currnext = iters + 1;
}
cout << toprint << ' ';
}
if (r == n * (n - 1) + 1) {
cout << 1 << ' ';
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long v[100010];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
for (int i = 1; i < n; ++i) v[i] = 2 * (n - i);
v[n] = 1;
for (int i = 1; i <= n; ++i) v[i] += v[i - 1];
int a = 0, b = n + 1;
while (b - a > 1) {
int mid = (a + b) / 2;
if (v[mid] >= l)
b = mid;
else
a = mid;
}
long long current = v[a];
long long pos = a + 1;
while (current < l) {
current += 2;
pos++;
}
bool flag = current != l;
long long lim = 1ll * n * (n - 1) + 1;
for (long long i = l; i <= min(lim - 1, r); ++i) {
if (flag)
cout << a + 1 << " ";
else
cout << pos++ << " ";
if (pos > n) {
a++;
pos = a + 2;
}
flag ^= 1;
}
if (lim == r) cout << "1";
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, l, r;
cin >> n >> l >> r;
long long printed = 0;
long long num = 0;
while (printed < l) {
num++;
printed += (2 * (n - num));
if (num == n - 1) {
break;
}
}
printed -= 2 * (n - num);
num--;
vector<int> nums;
while (nums.size() < r - printed) {
for (int q = num + 2; q <= n; q++) {
nums.push_back(num + 1);
nums.push_back(q);
}
num++;
if (num == n - 1) {
nums.push_back(1);
}
}
for (int q = l - printed - 1; q <= r - printed - 1; q++) {
cout << nums[q] << " ";
}
cout << "\n";
}
int main() {
int t;
cin >> t;
for (int q = 0; q < t; q++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long long q, n, i, j, sum, sum2, l, r, pos;
cin >> q;
while (q--) {
cin >> n >> l >> r;
sum = 1;
for (i = 1; i <= n; i++) {
sum2 = max((n - 1 - i), 0 * 1LL) + (n - i) + 1;
if (sum + sum2 >= l) {
pos = i;
while (sum <= r && pos < n) {
for (j = pos + 1; j <= n - 1; j++) {
if (sum >= l && sum <= r) cout << pos << " ";
sum++;
if (sum >= l && sum <= r) cout << j << " ";
sum++;
}
if (sum >= l && sum <= r) cout << pos << " ";
sum++;
if (sum >= l && sum <= r) cout << n << " ";
sum++;
pos++;
}
if (sum <= r) cout << 1 << " ";
break;
} else
sum += sum2;
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 2e5 + 100;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
long long q, n, l, r, s, t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> q;
while (q--) {
cin >> n >> l >> r;
s = 0;
t = 1;
for (long long i = 1; i <= n; i++) {
s += 2 * (n - i);
if (s >= l) {
s -= 2 * (n - i);
t = i;
break;
}
}
bool f = 0;
if (r == n * (n - 1) + 1) f = 1, r--;
while (s < r) {
for (long long i = t + 1; i <= n; i++) {
if (++s >= l) cout << t << " ";
if (s == r) break;
if (++s >= l) cout << i << " ";
if (s == r) break;
}
t++;
}
if (f) cout << 1;
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
size_t T;
cin >> T;
while (T--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int t = 1;
long long int k = 1;
while (k < l && t != n) {
k += 2 * (n - t++);
}
if (k > l) {
k -= 2 * (n - --t);
}
if (t == n) {
cout << 1 << endl;
continue;
}
long long int difference = l - k;
long long int c = difference / 2 + t + 1;
if (difference % 2) {
cout << c << " ";
++l;
difference = l - k;
c = difference / 2 + t + 1;
if (c > n) {
c = ++t + 1;
if (t == n) {
cout << 1 << endl;
break;
}
}
}
if (difference % 2 == 0) {
long long int current = l;
while (current <= r) {
cout << t << " ";
++current;
if (current <= r) {
cout << c++ << " ";
++current;
if (c > n) {
c = ++t + 1;
if (t == n) {
if (current <= r) cout << 1;
break;
}
}
}
}
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
using ll = long long;
long long arr[N];
ll n;
int solve(ll x) {
if (x == n * (n - 1) + 1) {
return 1;
}
auto p = lower_bound(arr + 1, arr + n + 1, x) - arr - 1;
x -= arr[p];
if (x & 1) {
return p + 1;
}
return (p + 1 + x / 2);
}
int main() {
int T;
cin >> T;
while (T--) {
ll l, r;
cin >> n >> l >> r;
for (int i = 1; i <= n; i++) {
arr[i] = arr[i - 1] + 2 * (n - i);
}
for (ll i = l; i <= r; i++) {
cout << solve(i) << " ";
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
for (int i = (0); i < (t); i += 1) {
long long n, l, r;
cin >> n >> l >> r;
bool z = false;
if (r == n * (n - 1) + 1) {
r--;
z = true;
}
vector<int> arr;
long long cnt = 0;
bool stop = false;
for (int j = (1); j < (n + 1); j += 1) {
if (cnt + (2 * (n - j)) < l) {
cnt += (2 * (n - j));
continue;
} else {
for (int a = (j); a < (n + 1); a += 1) {
if (stop) break;
for (int k = (a + 1); k < (n + 1); k += 1) {
cnt++;
if (cnt > r) {
stop = true;
break;
}
if (cnt >= l) {
arr.push_back(a);
}
cnt++;
if (cnt > r) {
stop = true;
break;
}
if (cnt >= l) {
arr.push_back(k);
}
}
}
break;
}
}
if (z) arr.push_back(1);
for (int j = (0); j < (arr.size()); j += 1) cout << arr[j] << " ";
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int t;
ll n, st, dr;
cin >> t;
while (t--) {
cin >> n >> st >> dr;
int deAfisat = 0;
if (dr == n * (n - 1) + 1) {
deAfisat = 1;
dr--;
}
if (st == 1 && dr == 1) {
cout << 1 << '\n';
continue;
}
if (dr < st) {
cout << 1 << '\n';
continue;
}
ll i;
for (i = 1;; i++) {
if (2 * (n - i) >= st) break;
st -= 2 * (n - i);
dr -= 2 * (n - i);
}
ll j = i + (st - 1) / 2 + 1;
if (st % 2 == 0) {
cout << j << ' ';
dr--;
} else {
cout << i << ' ' << j << ' ';
dr -= 2;
}
j++;
if (j == n + 1) {
i++;
j = i + 1;
}
while (dr >= st) {
if (dr == st) {
cout << i << ' ';
break;
}
cout << i << ' ' << j << ' ';
dr -= 2;
j++;
if (j == n + 1) {
i++;
j = i + 1;
}
}
if (deAfisat) cout << 1;
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const ll N = 2e5 + 5, mod = 1e9 + 7;
const ll inf = 1e18;
struct cmp {
bool operator()(pair<int, int> a, pair<int, int> b) {
if (a.first == b.first) return a.second < b.second;
return a.first > b.first;
}
};
ll power(ll x, ll p) {
ll r = 1ll;
x = x % mod;
while (p > 0) {
if (p & 1) r = (r * x) % mod;
p = p >> 1;
x = (x * x) % mod;
}
return r;
}
void solve() {
ll n, l, r;
cin >> n >> l >> r;
ll firstrow = n + (n - 2);
ll ele = 0, i = 0;
bool edge = 0;
while (ele < l) {
if (firstrow - 2ll * i > 0)
ele += firstrow - 2ll * i;
else {
ele++;
edge = 1;
}
i++;
}
if (!edge) ele -= firstrow - 2ll * (i - 1);
bool flag = 0;
ll j = 1;
if (!edge) ele++;
while (ele <= r) {
ll ans;
if (flag == 0)
ans = i;
else {
ans = i + j;
j++;
}
flag = 1 - flag;
if (ele >= l && !edge) cout << ans << " ";
if (edge) {
cout << 1 << endl;
return;
}
if (i + j - 1 >= n) {
i++;
j = 1;
flag = 0;
if (i >= n) i = 1;
}
ele++;
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1, p;
cin >> t;
for (p = 1; p <= t; p++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e13 + 5;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
long long n, l, r, s[maxn];
int calc(long long x) {
if (x > s[n - 1]) return 1;
long long a = lower_bound(s + 1, s + n, x) - s;
long long b = x - s[a - 1];
if (b % 2)
return a;
else
return b / 2 + a;
}
int main() {
int T;
cin >> T;
while (T--) {
cin >> n >> l >> r;
for (int i = 1; i <= n; i++) s[i] = s[i - 1] + 2 * (n - i);
for (long long i = l; i <= r; i++) {
cout << calc(i) << " ";
}
puts("");
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[1000006];
long long n;
map<long long, long long> mp;
int main() {
long long Q;
cin >> Q;
while (Q--) {
cin >> n;
long long l, r;
cin >> l >> r;
a[0] = (n - 1) * 2;
long long k = a[0] - 2;
long long po = 0;
for (int i = 1; i < 1000006; i++) {
a[i] = a[i - 1] + k;
k -= 2;
if (k == 0) {
po = i + 1;
break;
}
}
long long qq, q = lower_bound(a, a + po, l) - a;
if (q == 0)
qq = 0;
else
qq = a[q - 1] + 1;
long long qqq = a[q] + 1;
q++;
while (l <= r) {
if (l == n * (n - 1) + 1) {
cout << 1;
break;
}
if (l == qqq) {
q = lower_bound(a, a + po, l) - a;
qq = a[q - 1] + 1;
qqq = a[q] + 1;
q++;
cout << q << ' ';
l++;
continue;
}
if (l % 2 == 1)
cout << q << ' ';
else
cout << (l - qq + 1) / 2 + q << ' ';
l++;
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long f(long long N, long long x) { return (2 * N - 1 - x) * x; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
long long N;
cin >> N;
long long l, r;
cin >> l >> r;
long long ng = 0, ok = N;
while (ok - ng > 1) {
long long mid = (ok + ng) / 2;
if (f(N, mid) >= l)
ok = mid;
else
ng = mid;
}
long long p = ok;
long long stage = N - p;
p--;
long long cnt = (l - f(N, p) - 1) / 2,
s = ((l - f(N, p) - 1) % 2 == 0 ? N - stage
: N - stage + cnt + 1);
for (int i = 0; i <= (r - l); i++) {
if (i == r - l && r == N * (N - 1) + 1)
cout << 1;
else
cout << s << " ";
if (s == N - stage) {
s = N - stage + cnt + 1;
} else {
if (cnt == stage - 1) {
stage--;
cnt = 0;
} else
cnt++;
s = N - stage;
}
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-all-loops")
using namespace std;
ifstream in;
ofstream out;
const long long kk = 1000;
const long long ml = kk * kk;
const long long mod = ml * kk + 7;
const long long inf = ml * ml * ml + 7;
long long n, l, r;
bool viv = false;
vector<long long> v;
void solve() {
cin >> n >> l >> r;
l--, r--;
vector<pair<long long, long long> > v;
for (int i = 0; i < n; i++) {
v.push_back({i, 2 * (n - 1 - i)});
}
long long sl = 0;
vector<long long> ans;
for (int i = 0; i < n; i++) {
long long sr = sl + v[i].second - 1;
if (max(l, sl) <= min(r, sr)) {
vector<long long> loc;
for (int j = 0; j < v[i].second / 2; j++) {
loc.push_back(i);
loc.push_back(i + j + 1);
}
for (int j = 0; j < loc.size(); j++)
if (sl + j >= l && sl + j <= r) ans.push_back(loc[j]);
}
sl = sr + 1;
}
if (r == sl) ans.push_back(0);
for (auto i : ans) cout << i + 1 << ' ';
cout << '\n';
}
int main() {
viv = true;
srand(time(0));
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const double PI = acos(-1);
long long gcd() { return 0ll; }
template <typename T, typename... Args>
T gcd(T a, Args... args) {
return __gcd(a, (__typeof(a))gcd(args...));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T;
cin >> T;
while (T--) {
long long n, l, r;
cin >> n >> l >> r;
l--;
r--;
long long a[2 * n - 3];
for (__typeof(2 * n - 3) i = (0) - ((0) > (2 * n - 3));
i != (2 * n - 3) - ((0) > (2 * n - 3));
i += 1 - 2 * ((0) > (2 * n - 3))) {
if (i & 1)
a[i] = 1 + ((i + 1) / 2);
else
a[i] = 1;
}
while (l < (2 * n - 3) && l <= r) cout << a[l++] << " ";
long long st[n - 1], x = 2;
st[n - 2] = n * (n - 1) - 1;
for (__typeof(0) i = (n - 2) - ((n - 2) > (0)); i != (0) - ((n - 2) > (0));
i += 1 - 2 * ((n - 2) > (0))) {
st[i] = st[i + 1] - x;
x += 2;
}
long long j = -1;
while (st[j + 1] < l) j++;
while (l <= r) {
if (l == (n * (n - 1))) {
cout << "1";
break;
}
if (st[j + 1] == l) {
j++;
l++;
cout << n << " ";
continue;
}
if (!(l & 1))
cout << (j + 2) << " ";
else
cout << (j + 2) + (l - st[j]) / 2 << " ";
l++;
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long T;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> T;
while (T--) {
long long n, l, r;
cin >> n >> l >> r;
long long g = n * (n - 1) + 1;
if (l == g - 1) {
if (r == g)
cout << n << " 1" << '\n';
else
cout << "1" << '\n';
continue;
}
if (l == g) {
cout << "1" << '\n';
continue;
}
long long k = (l + 1) / 2, ls = 2, ln, p = 0;
while (p + (n - ls + 1) < k) p += (n - ls + 1), ls++;
ln = ls;
while (p + 1 < k) ln++, p++;
long long lo, los = 1, loo;
p = 0;
k = l / 2 + 1;
while (p + (n - los) < k) p += (n - los), los++;
loo = los;
lo = n - los;
while (p + 1 < k) p++, lo--;
for (long long i = l; i <= r; i++) {
if (i & 1) {
cout << loo << " ";
lo--;
if (!lo) loo++, lo = n - loo;
if (loo == n) loo = 1;
} else {
cout << ln << " ";
if (ln == n) {
ln = (++ls);
} else
ln++;
}
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T InvMod(T a, T b, T &x, T &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
T x1, y1;
T g = InvMod(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return g;
}
long long fact(long long n) {
if (n == 1) return 1;
return (n % 1000000007 * fact(n - 1) % 1000000007) % 1000000007;
}
void sieve(vector<int> &v) {
bool arr[1000004];
memset(arr, true, sizeof arr);
for (int i = 2; i * i <= 1000002; i++) {
if (arr[i] == true) {
v.push_back(i);
for (int j = i * i; j <= 1000002; j += i) {
arr[j] = false;
}
}
}
}
bool cmp(pair<int, int> a, pair<int, int> b) { return a.first > b.first; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
int i = 1;
long long tmp = l;
for (long long j = l; j <= r; j++) {
while (2 * (n - i) < tmp && i <= n) {
tmp -= 2 * (n - i);
i++;
}
if (i > n) {
cout << 1 << " ";
continue;
}
long long rem = tmp;
if (rem % 2 == 1) {
cout << i << " ";
} else {
cout << i + (rem / 2) << " ";
}
tmp++;
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
const long long int maxn = 1e10;
const long long mod = 1e9 + 7;
using namespace std;
long long int power(long long int a, long long int b) {
long long int res = 1;
while (b > 0) {
if (b % 2 == 1) res = res * a;
a = a * a;
b = b / 2;
}
return res;
}
long long po(long long x, long long y) {
long long res = 1;
x = x % mod;
while (y > 0) {
if (y & 1) res = ((res % mod) * (x % mod)) % mod;
y = y >> 1;
x = ((x % mod) * (x % mod)) % mod;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int count = 0;
int i = 1;
long long int ini = 2 * (n - 1);
while (1) {
if (count + ini >= l || i == n) break;
count += ini;
ini -= 2;
i++;
}
count++;
vector<pair<long long int, long long int> > p;
while (count <= r) {
if (count == n * (n - 1) + 1) {
p.push_back({1, count});
count++;
continue;
}
int it = i + 1, flag = 1;
for (int j = 0; j < ini; j++) {
if (flag) {
p.push_back({i, count});
count++;
flag = 0;
} else {
p.push_back({it, count});
count++;
it++;
flag = 1;
}
}
ini -= 2;
i++;
}
for (int j = 0; j < p.size(); j++) {
if (p[j].second <= r && p[j].second >= l) cout << p[j].first << " ";
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int mn = 1 * (int)(1e5) + 10;
const int mod = 1 * (int)(1e9) + 7;
const int mm = 1 * (int)(1e3) + 10;
const int base = 1 * (int)(1e9);
const bool aNs = 0;
int tt, ntest = 1;
void docfile() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
if (ifstream("test.inp")) {
freopen("test.inp", "r", stdin);
if (!aNs)
freopen("test.out", "w", stdout);
else
freopen("test.ans", "w", stdout);
} else if (ifstream("1334d.inp")) {
freopen("1334d.inp", "r", stdin);
freopen("1334d.out", "w", stdout);
}
}
template <typename T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) f = ch == '-' ? -f : f, ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
x *= f;
}
template <typename T>
void write(T a) {
if (a < 0) {
putchar('-');
write(-a);
return;
}
if (a < 10) {
putchar('0' + a);
return;
}
write(a / 10);
putchar((char)('0' + (a % 10)));
}
void enter() {
int n;
long long l, r;
cin >> n >> l >> r;
long long s = 0;
for (int i = 1; i < n; ++i) {
if (s + 2 * (n - i) >= l) {
vector<int> v;
for (int j = i + 1; j <= n; ++j) {
v.emplace_back(i);
v.emplace_back(j);
}
for (int k = max(l - 1 - s, 0ll); k < min(r - s, 2ll * (n - i)); ++k)
cout << v[k] << " ";
}
if (s + 2 * (n - i) >= r) {
break;
}
s += 2 * (n - i);
}
if (r == 1ll * n * (n - 1) + 1) cout << 1;
}
void solve() { cout << "\n"; }
void print_result() {}
int main() {
docfile();
cin >> ntest;
for (tt = 1; tt <= ntest; ++tt) {
enter();
solve();
print_result();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
;
long long int p;
cin >> p;
while (p--) {
long long int a, b, c, d, e, l, r, f, cnt = 1;
vector<long long int> Ans;
cin >> a >> l >> r;
f = l;
long long int fuck = a - 1;
while (f - (2 * fuck) >= 0 && fuck > 0) {
f -= (2 * fuck);
fuck--;
cnt++;
}
if (f == 0) Ans.push_back(a), f++, l++;
f = (f - 1) / 2;
f++;
f += cnt;
for (c = l; c <= r; c++) {
if (c % 2 == 1)
Ans.push_back(cnt);
else
Ans.push_back(f), f++;
if (f == a + 1) cnt++, f = cnt + 1;
}
if (r == (a * (a - 1)) + 1) Ans[Ans.size() - 1] = 1;
for (c = 0; c < Ans.size(); c++) cout << Ans[c] << " ";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, l, r;
long long num;
vector<long long> ans;
bool intersect(long long l1, long long r1, long long l2, long long r2) {
return min(r1, r2) >= max(l1, l2);
}
void cal(long long left) {
if (left == n) return;
if (intersect(l, r, num + 1, num + 2 * (n - left))) {
for (long long i = left + 1; i <= n; ++i) {
num++;
if (num >= l && num <= r) ans.push_back(left);
num++;
if (num >= l && num <= r) ans.push_back(i);
}
} else
num += 2 * (n - left);
cal(left + 1);
}
int main(void) {
int t;
cin >> t;
while (t--) {
ans.clear();
num = 0;
cin >> n >> l >> r;
cal(1);
for (auto x : ans) cout << x << " ";
if (r == n * (n - 1) + 1) cout << 1 << " ";
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
for (int t = 0; t < T; ++t) {
long long n, l, r;
cin >> n;
cin >> l;
cin >> r;
long long curr_position = 0;
for (long long i1 = 1; i1 < n; ++i1) {
long long x = curr_position + 1;
long long y = curr_position + 2 * (n - i1);
curr_position += 2 * (n - i1);
if (r < x || y < l) {
continue;
}
for (long long i2 = 1; i2 <= y - x + 1; ++i2) {
if (i2 + x - 1 < l || i2 + x - 1 > r) {
continue;
}
if (i2 & 1)
cout << i1 << " ";
else
cout << i2 / 2 + i1 << " ";
}
}
if (r >= n * (n - 1) + 1) cout << 1 << " ";
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
int T;
int n, L;
long long l, r;
vector<int> v = {1, 2, 1};
long long cyc(int x) {
if (x == n - 1) return 3;
long long res = 2 * (n - x);
return res;
}
void printcyc(int nr, long long start, int len) {
if (nr == n - 1) {
int step = 1;
int x = n - 1;
while (len > 0) {
if (start > 0)
start--;
else {
printf("%d ", x);
len--;
}
if (step == 1) x = n;
if (step == 2) x = 1;
step++;
}
return;
}
int loops = start / 2;
int c = nr + 1 + loops;
int x = c;
if (start % 2 == 0) x = nr;
while (len > 0) {
printf("%d ", x);
len--;
if (x != nr) {
if (c == n) {
printcyc(nr + 1, 0, len);
break;
} else {
c++;
x = nr;
}
} else {
x = c;
}
}
}
void solve() {
long long t = 1;
for (int i = 1; i <= n - 1; i++) {
if (t + cyc(i) < l)
t += cyc(i);
else {
printcyc(i, l - t, L);
break;
}
}
printf("\n");
}
int main() {
scanf("%d", &T);
for (int test = 1; test <= T; test++) {
scanf("%d%lld%lld", &n, &l, &r);
if (n == 2) {
for (int i = l - 1; i < r; i++) printf("%d ", v[i]);
printf("\n");
continue;
}
L = r - l + 1;
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
void solve() {
long long n, l, r;
cin >> n >> l >> r;
long long rngIdx = 0;
long long begin = 0, end = n;
while (begin < end) {
long long mid = begin + (end - begin) / 2;
if (2 * n * mid - mid * (mid + 1) >= l) {
end = mid;
} else {
begin = mid + 1;
}
}
rngIdx = end - 1;
long long totalRng = 2 * n * rngIdx - rngIdx * (rngIdx + 1);
for (long long i = l; i <= r; i++) {
if (2 * n * (rngIdx + 1) - (rngIdx + 1) * (rngIdx + 2) < i) {
rngIdx++;
totalRng = 2 * n * rngIdx - rngIdx * (rngIdx + 1);
}
if (i == n * (n - 1) + 1) {
cout << 1 << " ";
} else if (i % 2 == 1) {
cout << rngIdx + 1 << " ";
} else {
cout << (i - totalRng) / 2 + rngIdx + 1 << " ";
}
}
cout << endl;
}
};
int main(int argc, const char* argv[]) {
int t;
Solution sol;
cin >> t;
while (t--) {
sol.solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pr = pair<int, int>;
template <typename T>
void _read(T *arr, int n) {
for (int i = 0; i < n; i++) cin >> arr[i];
}
template <typename T>
void _write(T *arr, int n) {
for (int i = 0; i < n; i++) cout << arr[i] << " ";
cout << endl;
}
const int MAXN = 100033;
ll n;
ll l, r;
int start;
void __Main__() {
cin >> n >> l >> r;
ll sum = 0;
ll now = 2 * n - 2;
if (l == r && l == n * (n - 1) + 1) {
cout << 1 << endl;
return;
}
ll st = 0;
for (int i = 1; i < n; i++) {
if (sum + now >= l) {
st = sum;
start = i;
break;
}
sum += now;
now -= 2;
}
ll res = now;
ll i;
for (i = sum + 1;; i++) {
res--;
ll output;
if ((i - st) & 1) {
output = start;
} else {
output = start + (i - st) / 2;
}
if (res == 0) {
now -= 2;
res = now;
start++;
st = i;
}
if (i < l) {
continue;
}
if (i > r) break;
cout << output << " ";
if (i >= n * (n - 1)) break;
}
if (i < r) cout << 1;
cout << endl;
}
signed main() {
ios ::sync_with_stdio(false);
cin.tie(nullptr);
{
int _Test_cases;
cin >> _Test_cases;
for (int case_num = 1; case_num <= _Test_cases; case_num++) {
__Main__();
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, l, r;
void solve(long long l, long long r) {
long long s = 1;
while (s <= n && l > 2 * (n - s)) {
l -= 2 * (n - s);
r -= 2 * (n - s);
s++;
}
long long cnt = l / 2 + l % 2;
cnt += s;
while (s <= n && l <= r) {
while (cnt <= n) {
if (l % 2)
cout << s << " ";
else
cout << cnt++ << " ";
l++;
if (l > r) break;
}
s++;
cnt = s + 1;
}
if (l <= r) cout << 1;
cout << "\n";
}
signed main() {
long long t;
cin >> t;
while (t--) {
cin >> n >> l >> r;
solve(l, r);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie();
int T;
cin >> T;
while (T--) {
long long n, l, r;
cin >> n >> l >> r;
long long e = 0, s = -1, f = -1;
for (long long i = 1; i < n; i++) {
e += 2 * (n - i);
if (e >= l) {
s = i;
f = 2 * (n - i) - e + l;
break;
}
}
if (s == -1) {
cout << 1 << '\n';
continue;
}
for (long long i = l; i <= r; i++) {
if (s == n)
cout << 1 << ' ';
else {
if (f & 1)
cout << s << ' ';
else
cout << s + f / 2 << ' ';
}
if (f == 2 * (n - s)) {
s++;
f = 1;
} else
f++;
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
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 (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
long long l, r;
cin >> l >> r;
int idx = 0;
long long sum = 0;
int lg = -1, rg = -1;
int ls = -1, rs = -1;
while ((lg == -1 || rg == -1) && idx < n - 1) {
long long lsum = sum;
sum += (long long)(n - 1 - idx) * 2;
if (lg == -1 && l <= sum) lg = idx, ls = l - lsum;
if (rg == -1 && r <= sum) rg = idx, rs = r - lsum;
idx++;
}
if (lg == -1) lg = n - 1;
if (rg == -1) rg = n - 1;
lg++;
rg++;
for (int i = (int)(lg); i <= (int)(rg); i++) {
if (i == n) {
cout << "1 ";
break;
}
long long from = 1, to = (long long)(n - i) * 2;
if (i == lg) from = ls;
if (i == rg) to = rs;
for (int j = (int)(from); j <= (int)(to); j++) {
if (j % 2 == 1) {
cout << i << " ";
} else {
cout << i + j / 2 << " ";
}
}
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t, n, s, lc;
long long l, r, k;
inline long long read() {
long long ans = 0;
char c = getchar();
while (c < 48 || c > 57) c = getchar();
while (c >= 48 && c <= 57)
ans = (ans << 3) + (ans << 1) + (c ^ 48), c = getchar();
return ans;
}
inline void write(int x) {
if (x > 9) write(x / 10);
putchar(x % 10 + 48);
}
int main() {
t = read();
while (t--) {
n = read(), l = read(), r = read(), k = 0;
for (register int i = 1; i < n; ++i) {
s = (n - i) << 1;
if (k + s < l) {
k += s;
continue;
}
if (k < l)
lc = l - k - 1, k = l - 1;
else
lc = 0;
for (register int j = lc; j < s - 1; ++j) {
++k;
if (k > r) break;
if (!(j & 1))
write(i);
else
write((j >> 1) + i + 1);
putchar(' ');
}
if (k > r) break;
++k;
if (k > r) break;
write(n), putchar(' ');
}
if (k < r) putchar(49);
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
long long t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
vector<long long> lol = {0};
for (long long i = n - 1; i >= 1; i--) {
lol.push_back(lol.back() + 2 * i);
}
for (long long x = l; x <= r; x++) {
if (x == n * (n - 1) + 1) {
cout << 1 << ' ';
} else {
long long block =
(long long)(lower_bound(lol.begin(), lol.end(), x) - lol.begin());
if (x % 2 == 1) {
cout << block << ' ';
} else {
long long h = x - lol[block - 1];
cout << h / 2 + block << ' ';
}
}
}
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int cas, z, x, w, h, a[500000];
long long n, m;
int main() {
scanf("%d", &cas);
while (cas--) {
scanf("%d%lld%lld", &z, &n, &m);
x = 1;
while (n > (z - x) * 2) {
if (x == z) {
m = 0;
printf("1");
break;
}
n -= (z - x) * 2;
m -= (z - x) * 2;
x++;
}
for (int i = 1; i <= z - x; i++) a[i * 2 - 1] = x, a[i * 2] = x + i;
if (m <= (z - x) * 2) {
for (int i = n; i <= m; i++) printf("%d ", a[i]);
} else {
for (int i = n; i <= (z - x) * 2; i++) printf("%d ", a[i]);
m -= (z - x) * 2;
x++;
while (m && (z != x)) {
for (int i = 1; i <= z - x; i++) a[i * 2 - 1] = x, a[i * 2] = x + i;
if (m <= (z - x) * 2) {
for (int i = 1; i <= m; i++) printf("%d ", a[i]);
m = 0;
} else {
for (int i = 1; i <= (z - x) * 2; i++) printf("%d ", a[i]);
m -= (z - x) * 2;
x++;
}
}
if (m) printf("1");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace ::std;
const long double PI = acos(-1);
const long long MOD = 1000000000 + 7;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long add(long long a, long long b, long long m = MOD) {
if (a >= m) a %= m;
if (b >= m) b %= m;
if (a < 0) a += m;
if (b < 0) b += m;
long long res = a + b;
if (res >= m or res <= -m) res %= m;
if (res < 0) res += m;
return res;
}
long long mul(long long a, long long b, long long m = MOD) {
if (a >= m) a %= m;
if (b >= m) b %= m;
if (a < 0) a += m;
if (b < 0) b += m;
long long res = a * b;
if (res >= m or res <= -m) res %= m;
if (res < 0) res += m;
return res;
}
long long pow_mod(long long a, long long b, long long m = MOD) {
long long res = 1LL;
a = a % m;
while (b) {
if (b & 1) res = mul(res, a, m);
b >>= 1;
a = mul(a, a, m);
}
return res;
}
long long fastexp(long long a, long long b) {
long long res = 1LL;
while (b) {
if (b & 1) res = res * a;
b >>= 1;
a *= a;
}
return res;
}
int gcdExtendido(int a, int b, int *x, int *y) {
if (a == 0) {
*x = 0;
*y = 1;
return b;
}
int x1, y1;
int gcd = gcdExtendido(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modInverso(int a, int m) {
int x, y;
int g = gcdExtendido(a, m, &x, &y);
if (g != 1)
return -1;
else
return (x % m + m) % m;
}
const int N = 100000 + 5;
int n;
long long l, r;
int ans[N];
long long f(int x) { return 2LL * n * x - 1LL * x * (x + 1); }
int main() {
int t;
scanf("%d", &(t));
while (t--) {
scanf("%d", &(n));
scanf("%lld %lld", &(l), &(r));
int len = r - l + 1;
if (r == 1LL * n * (n - 1) + 1) {
ans[r - l] = 1;
r -= 1;
}
int lo = 1, hi = n;
while (lo < hi) {
int mi = lo + (hi - lo) / 2;
if (f(mi) < l)
lo = mi + 1;
else
hi = mi;
}
l -= f(lo - 1);
r -= f(lo - 1);
int pos = 0;
int x = lo;
int y = lo + (l + 1) / 2;
bool goX = l & 1;
for (int i = l; i <= r; i++) {
if (goX) {
ans[pos++] = x;
} else {
ans[pos++] = y;
y += 1;
}
if (y == n + 1) {
x += 1;
y = x + 1;
}
goX = !goX;
}
for (int i = 0; i < len; i++) {
printf("%d%c", ans[i], " \n"[i + 1 == len]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
long long cur = 0;
while (t--) {
cur = 0;
long long n, l, r;
cin >> n >> l >> r;
for (int i = 1; i <= n; i++) {
if (cur + 2 * (n - i) < l)
cur += 2 * (n - i);
else {
while (l <= r && i <= n && l <= cur + 2 * (n - i)) {
if (l % 2)
cout << i << " ";
else
cout << (l - cur) / 2 + i << " ";
l++;
}
cur += 2 * (n - i);
}
}
if (r - l == 0) cout << "1";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int T;
int n;
long long l, r;
void out(long long sum, int now, int num, long long i) {
if (now == n) {
if (i != l) printf(" ");
printf("1");
return;
}
for (i; i <= min(sum + num - 1, r); i++) {
int N;
if ((i - sum + 1) % 2)
N = now;
else
N = now + (i - sum + 1) / 2;
if (i == l) {
printf("%d", N);
} else
printf(" %d", N);
}
}
int main() {
scanf("%d", &T);
while (T--) {
long long sum = 1;
scanf("%d%lld%lld", &n, &l, &r);
long long now = 1, num = (n - now) * 2;
for (now = 1; now <= n; now++) {
num = num = (n - now) * 2;
num = max(num, 1 * 1ll);
if (sum <= l && l <= sum + num) {
out(sum, now, num, l);
} else if (l <= sum && sum + num <= r) {
out(sum, now, num, sum);
} else if (sum <= r && r <= sum + num) {
out(sum, now, num, sum);
break;
}
sum += num;
}
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int sum = 0;
long long int start = 1;
int done = 0;
while (sum < l) {
sum += 2 * (n - start);
start++;
if (start > n) {
cout << 1 << " " << endl;
done = 1;
break;
}
}
if (done) continue;
start--;
sum -= 2 * (n - start);
long long int next = start + 1;
long long int cur = 0;
for (long long int i = sum + 1; i <= r; i++) {
if (i < l) {
if (i % 2 == 0) next++;
} else {
if (i % 2 == 1)
cout << start << " ";
else {
cout << next << " ";
next++;
}
}
cur++;
if (cur == 2 * (n - start)) {
cur = 0;
start = start + 1;
next = start + 1;
if (start == n) start = 1;
}
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
size_t T;
cin >> T;
while (T--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int t = 1;
long long int k = 1;
while (k < l && t != n) {
k += 2 * (n - t++);
}
if (k > l) {
k -= 2 * (n - --t);
}
if (t == n) {
cout << 1 << endl;
continue;
}
long long int difference = l - k;
long long int c = difference / 2 + t + 1;
if (difference % 2 == 0) {
long long int current = l;
while (current <= r) {
cout << t << " ";
++current;
if (current <= r) {
cout << c++ << " ";
++current;
if (c > n) {
c = ++t + 1;
if (t == n) {
if (current <= r) cout << 1;
break;
}
}
}
}
} else {
cout << c << " ";
++l;
difference = l - k;
c = difference / 2 + t + 1;
if (c > n) {
c = ++t + 1;
if (t == n) {
cout << 1 << endl;
break;
}
}
long long int current = l;
while (current <= r) {
cout << t << " ";
++current;
if (current <= r) {
cout << c++ << " ";
++current;
if (c > n) {
++t;
c = t + 1;
if (t == n) {
if (current <= r) cout << 1;
break;
}
}
}
}
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void yes() { cout << "YES" << endl; }
void no() { cout << "NO" << endl; }
void solve(int qq) {
long long n;
cin >> n;
long long l, r;
cin >> l >> r;
long long cnt = 0;
long long odd = 0;
long long start = 0;
if (l == n * (n - 1) + 1) {
cout << 1 << endl;
return;
}
for (long long i = 1; i < n; i++) {
cnt += (n - i) * 2;
if (l <= cnt) {
odd = i;
start = cnt - (n - i) * 2 + 1;
break;
}
}
long long even = odd + ((l - start) / 2 + 1);
for (long long i = l; i <= r; i++) {
if (i % 2 == 0) {
cout << even << " ";
even++;
if (even > n) {
odd++;
even = odd + 1;
if (odd == n) {
odd = 1;
}
}
} else {
cout << odd << " ";
}
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for (int i = 1; i <= t; i++) {
solve(i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
for (int tc = 0; tc < (t); tc += 1) {
long long n, l, r;
cin >> n >> l >> r;
l--;
bool last1 = false;
if (r == n * (n - 1) + 1) {
last1 = true;
r--;
if (r == l) {
cout << "1\n";
continue;
}
}
long long i = 1;
long long ptr = 0;
while (ptr + (n - i) * 2 <= l) {
ptr += (n - i) * 2;
i++;
}
long long j = i;
j += (l - ptr) / 2;
if (l % 2 == 1) {
cout << j + 1 << " ";
j++;
l++;
}
if (j != n) {
j++;
} else {
i++;
j = i + 1;
}
while (r > l) {
if (r - l == 1) {
cout << i << " ";
break;
}
cout << i << " " << j << " ";
if (j != n) {
j++;
} else {
i++;
j = i + 1;
}
r -= 2;
}
if (last1) cout << "1";
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long T, t, n, N, l, L, R;
vector<int> v;
pair<int, int> calcL() {
for (n = l = 0; n < N; n++) {
if ((l + (N - (n + 1))) > (L / 2)) break;
l += (N - (n + 1));
}
return pair<int, int>(n, 1 + n + (int)((L / 2) - l));
}
void fill() {
v.clear();
pair<int, int> curr = calcL();
for (n = L; n <= R; n++) {
if (curr.first >= (N - 1)) {
curr.first = 0;
}
if (curr.second >= N) {
curr.second = 0;
}
if (n & 1) {
v.push_back(curr.second);
if (curr.second == (N - 1)) {
curr = pair<int, int>((curr.first + 1), (curr.first + 2));
} else
curr.second++;
} else
v.push_back(curr.first);
}
}
int main() {
cin >> T;
for (t = 0; t < T; t++) {
cin >> N >> L >> R;
L--;
R--;
fill();
for (n = 0; n <= (R - L); n++) {
printf("%d ", 1 + v[n]);
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, l, r;
int Go() {
scanf("%lld %lld %lld", &n, &l, &r);
long long len = r - l + 1;
long long x = n;
long long y = 0;
long long start = 0;
while (1) {
y += 2 * (x - 1);
x--;
start++;
if (x <= 0 || y >= l) break;
}
long long k = y - 2 * x;
long long d = (l - k + 1) / 2;
long long add = start + d;
vector<long long> Ans;
long long count = 0;
if (l % 2 == 0) {
Ans.push_back(add++);
count++;
}
while (count < len) {
if (add == n + 1) {
start++;
add = start + 1;
}
Ans.push_back(start);
count++;
if (count == len) break;
Ans.push_back(add);
count++;
add++;
}
if (r == n * (n - 1) + 1) {
Ans.pop_back();
Ans.push_back(1);
}
for (int i = 0; i < Ans.size(); ++i) printf("%lld ", Ans[i]);
puts("");
return 0;
}
int main() {
int t;
if (1)
scanf("%d", &t);
else
t = 1;
while (t--) Go();
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, l, r;
cin >> n >> l >> r;
if (n == 2) {
for (long long i = l - 1; i < r; i++) {
if (i & 1)
cout << 2 << " ";
else
cout << 1 << " ";
}
return;
}
if ((r - 1) / 2 + 1 < n) {
vector<long long> ans;
long long vl = l - 1;
vl /= 2;
l -= vl * 2;
r -= vl * 2;
vl += 2;
while (ans.size() < r - l + 1) {
ans.push_back(1);
ans.push_back(vl);
vl++;
}
for (long long i = l - 1; i < r; i++) {
cout << ans[i] << " ";
}
return;
}
long long lb = -1, rb = n - 1;
while (rb - lb != 1) {
long long mid = lb + rb >> 1;
if ((n - 1) * 2 + (n - 2) * (n - 1) - (n - 1 - mid) * (n - 2 - mid) >= l)
rb = mid;
else
lb = mid;
}
long long from = rb;
lb = -1, rb = n - 1;
while (rb - lb != 1) {
long long mid = rb + lb >> 1;
if ((n - 1) * 2 + (n - 2) * (n - 1) - (n - 1 - mid) * (n - 2 - mid) >= r)
rb = mid;
else
lb = mid;
}
vector<long long> ans;
long long to = rb;
long long rto = from;
if (from == 0) {
for (long long i = 2; i <= n; i++) {
ans.push_back(1);
ans.push_back(i);
}
from++;
}
while (from <= min(to, n - 2)) {
ans.push_back(from + 1);
for (long long i = from + 2; i < n; i++) {
ans.push_back(i);
ans.push_back(from + 1);
}
ans.push_back(n);
from++;
}
ans.push_back(1);
rto--;
long long val = 0;
if (rto != -1)
val = (n - 1) * 2 + (n - 2) * (n - 1) - (n - 1 - rto) * (n - 2 - rto);
r -= val;
l -= val;
for (long long i = l - 1; i < r; i++) cout << ans[i] << " ";
}
signed main() {
long long t;
cin >> t;
while (t--) {
solve();
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 10;
long long n;
long long pre[N];
long long cal(long long x) {
if (x == n * (n - 1) + 1) return 1;
long long p = lower_bound(pre + 1, pre + n + 1, x) - pre;
long long b = x - pre[p - 1];
if (b & 1)
return p;
else
return p + b / 2;
}
signed main() {
long long t;
cin >> t;
while (t--) {
long long l, r;
cin >> n >> l >> r;
for (long long i = 1; i <= n; i++) pre[i] = pre[i - 1] + 2 * (n - i);
for (long long i = l; i <= r; i++) cout << cal(i) << " ";
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
ll l, r;
cin >> n >> l >> r;
ll pre = 1;
VI ans;
for (int s = 1; s < n; s++) {
ll len = 2 * (n - s);
if (l < pre + len && r >= pre) {
for (int i = s + 1; i <= n; i++) {
if (pre >= l && pre <= r) {
ans.push_back(s);
}
pre++;
if (pre >= l && pre <= r) {
ans.push_back(i);
}
pre++;
}
} else {
pre += len;
}
}
if (r == n * 1ll * (n - 1) + 1) ans.push_back(1);
for (int u : ans) cout << u << ' ';
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
inline long long int gcd(long long int a, long long int b) {
return (b == 0) ? a : gcd(b, a % b);
}
inline long long int lcm(long long int a, long long int b) {
return (a * b) / gcd(a, b);
}
inline long long int mymod(long long int A, long long int M) {
return ((A % M) + M) % M;
}
template <class type>
type power(type x, long long int n) {
type temp;
long long int y = n;
if (y == 0) return 1;
temp = power(x, y / 2);
return ((y % 2) ? ((y > 0) ? x * temp * temp : (temp * temp) / x)
: temp * temp);
}
template <typename Arg, typename... Args>
void db(Arg&& arg, Args&&... args) {
cout << std::forward<Arg>(arg);
using expander = long long int[];
(void)expander{0, (void(cout << ',' << std::forward<Args>(args)), 0)...};
cout << "\n";
}
void IO_FILE() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
inline void solve() {
long long int n, l, r;
cin >> n >> l >> r;
if (l == n * (n - 1) + 1) {
cout << 1 << " ";
return;
}
long long int st = 1;
long long int cnt = 0;
while (cnt < l) {
cnt += 2 * (n - st);
if (st == n) {
cnt++;
break;
}
st++;
}
st--;
cnt -= 2 * (n - st);
long long int w, f = 1, j = st + 1;
while (cnt < l) {
f ? w = st : w = j++;
f = 1 - f;
cnt++;
}
if (w != st) {
cout << w << " ";
l++;
}
f = 1;
while (j <= n and l <= r) {
f ? cout << st << " " : cout << j++ << " ";
f = 1 - f;
l++;
}
st++;
while (l <= r) {
f = 1;
j = st + 1;
if (st == n) {
break;
}
while (j <= n and l <= r) {
f ? cout << st << " " : cout << j++ << " ";
f = 1 - f;
l++;
}
st++;
}
if (r == n * (n - 1) + 1) {
cout << 1 << " ";
}
cout << "\n";
}
int32_t main() {
IO_FILE();
long long int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
const double pi = acos(-1.0);
const long long int inf = 0x3f3f3f3f3f3f3f3f;
const long long int mod = 998244353;
bool isPowerOfTwo(int x) { return x && (!(x & (x - 1))); }
void fast() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long int modInverse(long long int n, long long int p) {
return power(n, p - 2, p);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int k1 = 0, k2 = 0, i1, i2;
for (i2 = 1; i2 < n; i2++) {
k2 += 2 * (n - i2);
if (k2 >= r) break;
}
for (i1 = 1; i1 < n; i1++) {
k1 += 2 * (n - i1);
if (k1 >= l) break;
}
i2++;
vector<long long int> v, a;
k1 -= (n - i1) * 2;
for (int i = i1; i < i2; i++) {
for (int j = i + 1; j < n + 1; j++) {
a.emplace_back(i);
a.emplace_back(j);
}
}
for (long long int i = l; i <= r; i++) {
if (i == (n * (n - 1) + 1))
cout << "1 ";
else
cout << a[i - k1 - 1] << " ";
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int I_INF = 2e9;
long long int L_INF = 1e18;
void solve() {
long long int n, i, j, l, r, index, ctr, num;
cin >> n >> l >> r;
vector<long long int> vect(n, 0);
vect[0] = 2 * (n - 1);
for (i = 1; i < n; i++) {
vect[i] = 2 * (n - 1 - i);
vect[i] += vect[i - 1];
}
vect[n - 1]++;
index =
(long long int)(lower_bound(vect.begin(), vect.end(), l) - vect.begin());
ctr = (index > 0) ? vect[index - 1] : 0;
while (ctr < r) {
if (index == (n - 1)) {
ctr++;
if (ctr >= l && ctr <= r) cout << 1 << " ";
} else {
for (i = index + 1; i < n; i++) {
ctr++;
num = index + 1;
if (ctr >= l && ctr <= r) cout << num << " ";
ctr++;
num = i + 1;
if (ctr >= l && ctr <= r) cout << num << " ";
}
}
index++;
}
cout << endl;
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long n, long long m) {
return n % m == 0 ? m : gcd(m, n % m);
}
long long getNum(long long x, long long n, long long pre, long long k) {
if (k >= n) return 1;
if ((x - pre) & 1)
return k;
else
return k + (x - pre) / 2;
}
int main() {
ios::sync_with_stdio(false);
int T;
cin >> T;
while (T--) {
long long n, l, r;
cin >> n >> l >> r;
long long pre = 0;
long long Next = 2 * (n - 1);
long long k = 1;
for (long long i = l; i <= r; i++) {
while (i > Next && k != n) {
pre = Next;
Next += 2 * (n - k - 1);
k++;
}
cout << getNum(i, n, pre, k) << " ";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int gcdExtended(long long int a, long long int b, long long int *x,
long long int *y) {
if (a == 0) {
*x = 0;
*y = 1;
return b;
}
long long int x1, y1;
long long int gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
long long int mod = 1000000007;
long long int binpower(long long int a, long long int b) {
long long int ans = 1;
while (b > 0) {
if (b & 1) ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
bool isPrime(int n) {
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) return false;
}
return true;
}
long long int fact[1005];
void factcalc() {
fact[0] = 1;
fact[1] = 1;
for (long long int i = 2; i < 1005; ++i) {
fact[i] = (fact[i - 1] * i) % mod;
}
}
long long int C(int u, int v) {
long long int c = (fact[v] * fact[u - v]) % mod;
long long int in = binpower(c, mod - 2);
long long int res = (in * fact[u]) % mod;
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int test = 1;
cin >> test;
while (test--) {
int n;
long long int l, r;
cin >> n >> l >> r;
long long int curr = 0;
bool fl = false;
for (int i = 0; i < n - 1; ++i) {
long long int adder = 0;
if (i == 0)
adder = 2 * (n - 1);
else
adder = 2 * (n - i - 1);
if (curr + adder >= l) {
fl = true;
long long int surplus = (l - curr);
long long int beg = surplus / 2;
int f = i + 1, s = beg + i + 2;
if (surplus % 2 == 0) {
cout << i + 1 + beg << " ";
if (surplus == adder) {
f++;
s = f + 1;
}
l++;
}
int turn = 0;
while (l <= r) {
if (turn == 0) {
if (f == n) {
cout << 1;
break;
}
cout << f << " ";
turn = 1;
l++;
continue;
} else {
cout << s << " ";
s++;
turn = 0;
if (s == n + 1) {
f++;
s = f + 1;
}
l++;
continue;
}
}
break;
}
curr += adder;
}
if (!fl) cout << 1;
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
long long l, r;
cin >> l >> r;
if (l == r && l == (n * (n - 1) + 1)) {
cout << 1 << '\n';
return;
}
long long grp = n - 1;
long long sum = 0;
long long idx = 1;
long long extra = 0;
for (long long i = 1; i <= n - 1; i++) {
sum += (grp * 2);
if (sum >= l) {
idx = i;
sum -= (grp * 2);
break;
}
grp--;
}
long long rem = l - sum;
long long x = idx;
long long y = idx + (rem + 1) / 2;
for (long long i = l; i <= r; i++) {
if (i == (n * (n - 1) + 1)) {
cout << 1 << ' ';
} else {
if (i % 2) {
cout << x << ' ';
} else {
cout << y << ' ';
y++;
if (y == n + 1) {
x++;
y = 1 + x;
}
}
}
}
cout << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ar[200002];
int main() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
;
long long t, n, l, r;
cin >> t;
while (t--) {
cin >> n >> l >> r;
if (l == n * (n - 1) + 1) {
cout << "1\n";
continue;
}
long long s = 0, j = 1;
while (s + 2 * (n - j) < l) {
s += 2 * (n - j);
j++;
}
long long skipped = (l - s - 1) / 2;
long long start = j, x = j + skipped + 1;
;
long long end = n * (n - 1) + 1;
for (long long a = l; a <= min(r, end - 1); a++) {
if (a % 2) {
cout << start << " ";
} else {
cout << x++ << " ";
}
if (x > n) {
start++;
x = start + 1;
}
}
if (r == end) {
cout << 1;
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
solve();
}
}
const long long N = 1e5 + 5;
std::vector<long long> cnt(N, 0);
void solve() {
long long n, l, r;
cin >> n >> l >> r;
for (long long i = 1; i < n + 1; ++i) {
cnt[i] = 2 * (n - i);
}
for (long long i = 2; i < n + 1; ++i) {
cnt[i] += cnt[i - 1];
}
long long p = 0;
for (long long i = l; i <= r; ++i) {
while (p + 1 <= n and cnt[p + 1] < i) {
p++;
}
long long temp = i - cnt[p];
if (i == ((n * (n - 1)) + 1)) {
cout << 1 << " ";
} else if (i % 2) {
cout << p + 1 << " ";
continue;
} else {
cout << p + 1 + (temp / 2) << " ";
}
}
cout << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
std::cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T, typename U>
static inline void amin(T& x, U y) {
if (y < x) x = y;
}
template <typename T, typename U>
static inline void amax(T& x, U y) {
if (x < y) x = y;
}
long long max(long long a, long long b) { return (a > b) ? a : b; }
long long min(long long a, long long b) { return (a < b) ? a : b; }
long long solve() {
long long n, l, r;
cin >> n >> l >> r;
if (n == 2) {
long long a[] = {1, 2, 1};
for (long long i = l - 1; i < r; i++) cout << a[i] << " ";
cout << '\n';
return 0;
}
long long z = 0;
for (long long i = 1; i < n; i++) {
long long cnt = 2 * (n - i);
if (z + cnt + 1 < l) {
z += cnt;
continue;
}
if (l > r) break;
if (l == z + 1 && l <= r) {
cout << i << " ";
l++;
}
z++;
for (long long j = i + 1; j < n; j++) {
if (l == z + 1 && l <= r) {
cout << j << " ";
l++;
}
z++;
if (l == z + 1 && l <= r) {
cout << i << " ";
l++;
}
z++;
}
if (l == z + 1 && l <= r) {
cout << n << " ";
l++;
}
z++;
}
if (l <= r && l == z + 1) cout << 1 << " ";
return 0;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
x = 0;
bool f = 0;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') f = 1;
for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
if (f) x = -x;
}
template <typename T>
inline void Mx(T &x, T y) {
x < y && (x = y);
}
template <typename T>
inline void Mn(T &x, T y) {
x > y && (x = y);
}
long long T, n, l, r;
int main() {
read(T);
while (T--) {
read(n), read(l), read(r);
if (n == 2) {
}
long long sum = 0, pre = 0;
for (int i = 1; i < n; i++) {
sum += (n - i) * 2;
if (l < sum) {
long long t = l - pre;
long long x = (t & 1) ? i : (t / 2) + i, y = (t / 2) + i;
while (l < sum && l <= r) {
printf("%lld ", x);
x == i ? y++, x = y : x = i;
l++;
}
}
if (l == sum && l <= r) printf("%lld ", n), l++;
pre = sum;
if (l > r) break;
}
if (l <= r) printf("1");
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int oo = numeric_limits<long long int>::max();
long long int MOD = 1e9 + 7;
long long int comp(long long int n, long long int i) {
return 2 * 1LL * (n - i);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int t;
cin >> t;
while (t--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int i = 1;
long long int sm = comp(n, i);
while (i <= n && sm < l) {
i++;
sm += comp(n, i);
}
long long int idx = sm - comp(n, i);
for (; i <= n; i++) {
for (long long int j = 0; j < comp(n, i); j++) {
long long int nm;
if (j % 2 == 0) {
nm = i;
} else {
nm = (j / 2) + i + 1LL;
}
idx++;
if (idx >= l && idx <= r) {
cout << nm << " ";
} else if (idx > r) {
goto end;
}
}
}
idx++;
if (idx <= r) cout << 1;
end:
cout << endl;
continue;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long l, r;
long long curlen;
void add(int u) {
curlen++;
if (l <= curlen && curlen <= r) printf("%d ", u);
return;
}
void Add(int u) {
int cnt = (n - u) * 2;
if (curlen + cnt >= l && curlen < r) {
for (int i = u + 1; i <= n; i++) {
add(u);
add(i);
}
} else
curlen += cnt;
return;
}
void solve() {
scanf("%d %I64d %I64d", &n, &l, &r);
curlen = 0;
for (int i = 1; i < n; i++) Add(i);
add(1);
printf("\n");
return;
}
int main() {
int t;
scanf("%d", &t);
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
t = 1;
cin >> t;
for (int i1 = 0; i1 < t; ++i1) {
long long n, l, r;
cin >> n >> l >> r;
vector<long long> v;
long long c = (n - 1) * 2;
long long s = c;
vector<long long> v1;
for (int i = 0; i < n - 1; ++i) {
v.push_back(s);
v1.push_back(c / 2);
c -= 2;
s += c;
}
long long x = lower_bound(v.begin(), v.end(), l) - v.begin();
long long y = lower_bound(v.begin(), v.end(), r) - v.begin();
if (x == v.size()) {
cout << 1 << "\n";
continue;
}
long long res1 = v[x] - l + 1;
if (res1 % 2) {
res1 /= 2;
cout << n - res1 << " ";
l++;
} else
res1 /= 2;
if (x == y) {
long long dif = r - l + 1;
while (dif > 1) {
res1--;
cout << x + 1 << " " << n - res1 << " ";
dif -= 2;
}
if (dif == 1) cout << x + 1 << "\n";
continue;
}
for (int i = 0; i < res1; ++i) {
cout << x + 1 << " " << n - res1 + 1 + i << " ";
}
x++;
while (x < y) {
for (int i = 0; i < v1[x]; ++i) {
cout << x + 1 << " " << x + i + 2 << " ";
}
x++;
}
if (y == v.size()) {
cout << 1 << "\n";
continue;
}
long long res2 = r - v[y - 1];
res1 = res2;
res2 /= 2;
for (int i = 0; i < res2; ++i) {
cout << y + 1 << " " << y + 2 + i << " ";
}
if (res1 % 2) cout << y + 1;
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 2e9;
const long long INFLL = 1e18;
const int MAX_N = 1;
int T;
long long N, L, R;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%lld", &N);
scanf("%lld%lld", &L, &R);
long long n = 1;
while (L <= R) {
while (n != N && L > (N - n) * 2LL) {
L -= (N - n) * 2LL;
R -= (N - n) * 2LL;
n++;
}
if (n == N) {
printf("1");
break;
}
if (L % 2 == 1) {
printf("%lld ", n);
} else {
printf("%lld ", (L / 2) + n);
}
L++;
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void display(int lvl, int lt, int rt) {
for (int i = lt; i <= rt; i++)
printf("%d ", ((i & 1) ? lvl : lvl + (i >> 1)));
}
int main() {
int t, n, i, j, k;
cin >> t;
while (t--) {
long long l, r, lvl, sz, sc, mx;
scanf("%d %lld %lld", &n, &l, &r);
mx = n * (n - 1ll) + 1;
if (l == mx) {
printf("1\n");
continue;
}
for (lvl = 1, sz = 0; lvl < n; lvl++) {
sc = 2 * (n - lvl);
if (sz >= l) {
display(lvl, 1, min(sc, r - sz));
} else if (sz + sc >= l) {
display(lvl, l - sz, min(sc, r - sz));
}
sz += sc;
if (sz >= r) {
puts("");
break;
}
}
if (r == mx) {
printf("1\n");
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long ind[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int t;
cin >> t;
for (int z = 1; z <= t; z++) {
long long n;
long long l, r;
cin >> n >> l >> r;
vector<int> res;
ind[0] = 0;
for (int i = 1; i < n; i++) {
ind[i] = ind[i - 1] + 2 * (n - i);
}
ind[n] = ind[n - 1] + 1;
bool isLast = 0;
long long last = n * (n - 1) + 1;
if (r == last) {
r--;
isLast = 1;
}
int groupL = 0;
for (int i = 1; i <= n; i++) {
if (ind[i] >= l) {
groupL = i;
break;
}
}
int groupR = 0;
for (int i = 1; i <= n; i++) {
if (ind[i] >= r) {
groupR = i;
break;
}
}
long long a = max(ind[groupL - 1] + 1, l);
a -= ind[groupL - 1];
long long b = min(ind[groupL], r);
b -= ind[groupL - 1];
for (long long i = a; i <= b; i++) {
if (i % 2 == 1) {
res.push_back(groupL);
} else {
long long k = i / 2;
k += groupL;
res.push_back(k);
}
}
if (groupR > groupL) {
int group = groupL;
for (long long i = ind[groupL] + 1; i <= ind[groupR - 1]; i++) {
long long k = i - ind[group];
if (k % 2 == 1) {
res.push_back(group + 1);
} else {
long long p = k / 2;
p += group + 1;
res.push_back(p);
if (p == n) {
group++;
}
}
}
long long c = max(ind[groupR - 1] + 1, l);
c -= ind[groupR - 1];
long long d = min(ind[groupR], r);
d -= ind[groupR - 1];
for (long long i = c; i <= d; i++) {
if (i % 2 == 1) {
res.push_back(groupR);
} else {
long long k = i / 2;
k += groupR;
res.push_back(k);
}
}
}
if (isLast == 1) {
res.push_back(1);
}
for (int i = 0; i < res.size(); i++) {
cout << res[i] << " ";
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int M = 1e5 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
long long n, l, r, f = 0;
cin >> n >> l >> r;
l--;
if (r == n * (n - 1) + 1) r--, f = 1;
long long nl = (n - 1) * 2, nr = (n - 1) * 2;
while (l >= nl && nl) l -= nl, nl -= 2;
while (r >= nr && nr) r -= nr, nr -= 2;
while (nl >= nr && nl) {
long long tp = n - (nl / 2);
long long nm = 0;
vector<long long> v;
for (long long i = tp + 1; i <= n; i++) v.push_back(tp), v.push_back(i);
if (nl == nr)
for (int i = l; i < r; i++) cout << v[i] << " ";
else {
for (int i = l; i < v.size(); i++) cout << v[i] << " ";
l = 0;
}
nl -= 2;
}
if (f) cout << 1;
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 200010;
void solve(long long case_no) {
long long n, l, r, st = 0;
cin >> n >> l >> r;
vector<long long> res;
bool flag = false;
for (long long i = 1; i <= n; i++) {
if (st + res.size() >= r) break;
if (!flag and st + 2 * (n - i) < l) {
st += 2 * (n - i);
continue;
}
flag = true;
for (long long j = i + 1; j <= n; j++) res.push_back(i), res.push_back(j);
}
if (st + res.size() < r) res.push_back(1);
l -= st + 1;
r -= st + 1;
for (long long i = l; i <= r; i++) cout << res[i] << " ";
cout << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long test_cnt = 1, case_no = 1;
cin >> test_cnt;
while (case_no <= test_cnt) solve(case_no++);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long l, r;
int n;
vector<long long> a;
int main() {
int tt;
scanf("%d", &tt);
while (tt--) {
a.clear();
scanf("%d%lld%lld", &n, &l, &r);
long long sum = 0, pos1 = 0;
for (int i = 1; i <= n; i++) {
if (1 + sum <= l && 1ll * (n - i) * 2 + sum >= l) {
pos1 = i;
break;
} else
sum = sum + 1ll * (n - i) * 2;
}
if (l == 1ll * n * (n - 1) + 1)
a.push_back(1);
else {
while (l <= r) {
if (l % 2)
a.push_back(pos1);
else {
long long t = l - sum - 1;
t = pos1 + (t + 1) / 2;
a.push_back(t);
}
l++;
if (l > r) break;
if (l > (1ll * n - pos1) * 2 + sum) {
sum = sum + (1ll * n - pos1) * 2;
pos1++;
}
if (l == 1ll * n * (n - 1) + 1) {
a.push_back(1);
break;
}
}
}
int cnt = a.size();
for (int i = 0; i < cnt - 1; i++) printf("%lld ", a[i]);
printf("%lld\n", a[cnt - 1]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int N = 100005;
void solve() {
long long int i, j, k, n, m, ans = 0, cnt = 0, sum = 0;
long long int l, r;
cin >> n >> l >> r;
vector<long long int> temp;
for (i = 1; i < n; i++) {
temp.push_back(2 * (n - i));
}
temp.push_back(1);
m = temp.size();
cnt = 1;
for (i = 0; i < m; i++) {
if (cnt + temp[i] > l) {
break;
} else {
cnt += temp[i];
}
}
i++;
if (i > n) {
i = 1;
}
j = i + 1;
ans = 0;
long long int cur = i;
while (cnt <= r) {
if (cnt == n * (n - 1) + 1) {
cout << 1;
break;
}
if (cnt >= l) {
cout << cur << " ";
}
if (ans == 0) {
cur = j;
j++;
} else {
if (j == n + 1) {
i++;
j = i + 1;
}
cur = i;
}
ans ^= 1;
cnt++;
}
cout << '\n';
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
const int N = 100005;
void solve() {
long long n, s, e;
cin >> n >> s >> e;
if (s == n * n - n + 1) {
cout << 1 << '\n';
return;
} else {
long long a = n * 2 - 2;
long long sq = sqrt((a + 1) * (a + 1) - 4 * s);
long long st = (a + 1 - sq) / 2;
if (sq * sq < (a + 1) * (a + 1) - 4 * s) st++;
long long prev = (st - 1) * (a - (st - 2));
if (prev >= s) {
st--;
prev = (st - 1) * (a - (st - 2));
}
long long l = st, r = (s - prev + 1) / 2 + st;
if ((s % 2) == 0) {
cout << r << " ";
r++;
s++;
}
while (s <= min(e, n * n - n)) {
if (r > n) {
l++;
r = l + 1;
}
cout << l << " ";
s++;
if (s <= e)
cout << r << " ";
else
break;
r++;
s++;
}
if (e == n * n - n + 1) {
cout << 1 << '\n';
} else
cout << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
istream &operator>>(istream &in, pair<T, U> &rhs) {
in >> rhs.first;
in >> rhs.second;
return in;
}
template <class T, class U>
ostream &operator>>(ostream &out, const pair<T, U> &rhs) {
out << rhs.first;
out << " ";
out << rhs.second;
return out;
}
template <class T, class U>
pair<T, U> operator+(pair<T, U> &a, pair<T, U> &b) {
return pair<T, U>(a.first + b.first, a.second + b.second);
}
template <class T, class U>
pair<T, U> operator-(pair<T, U> &a, pair<T, U> &b) {
return pair<T, U>(a.first - b.first, a.second - b.second);
}
template <class T>
istream &operator>>(istream &in, vector<T> &a) {
for (auto &i : a) cin >> i;
return in;
}
template <class T>
ostream &operator<<(ostream &out, const vector<T> &a) {
for (auto &i : a) cout << i << " ";
return out;
}
template <class T>
ostream &operator<<(ostream &out, const set<T> &a) {
for (auto &i : a) cout << i << " ";
return out;
}
template <class T>
ostream &operator<<(ostream &out, const unordered_set<T> &a) {
for (auto &i : a) cout << i << " ";
return out;
}
template <class T>
ostream &operator<<(ostream &out, const multiset<T> &a) {
for (auto &i : a) cout << i << " ";
return out;
}
template <class T, class U>
ostream &operator<<(ostream &out, const map<T, U> &a) {
for (auto &i : a) cout << "(" << i.first << ", " << i.second << ")\n";
return out;
}
template <class T, class U>
ostream &operator<<(ostream &out, const unordered_map<T, U> &a) {
for (auto &i : a) cout << "(" << i.first << ", " << i.second << ")\n";
return out;
}
const long long int N = 1e5 + 100;
const long long int inf = 1e9;
const double pi = acos(-1);
void solve(int test_case) {
long long int n, j = 0, l, r;
cin >> n >> l >> r;
long long int cur = 1, done = 0;
if (l == n * (n - 1) + 1) {
cout << 1 << "\n";
return;
}
while (done + 2 * (n - cur) < l) {
done += 2 * (n - cur);
cur++;
}
long long int nxt = cur + 1;
vector<long long int> ans;
l -= done;
while (done <= r) {
ans.emplace_back(cur);
done++;
if (done > r) break;
ans.emplace_back(nxt);
nxt++;
done++;
if (nxt == n + 1) {
cur++;
nxt = cur + 1;
if (cur == n && done <= r) {
done++;
ans.emplace_back(1);
}
}
}
for (int i = l - 1; i + 1 < ans.size(); ++i) cout << ans[i] << " ";
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie();
cout.tie();
int t = 1;
cin >> t;
for (int i = 1; i < t + 1; i++) solve(i);
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
const int maxn = 3e5 + 100;
const int maxm = 2e6 + 100;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
int t;
long long n;
long long l, r;
long long f(long long x) { return (2ll * n - x - 1) * x / 2ll; }
void pt(long long x) { printf("%lld ", x); }
int main() {
scanf("%d", &t);
while (t--) {
scanf("%lld %lld %lld", &n, &l, &r);
long long id = (l + 1) / 2;
int ok = 0;
if (r > n * (n - 1)) {
ok = 1;
r--;
}
if (l <= r) {
long long L = 1, R = n - 1;
long long res;
while (L <= R) {
long long mid = L + R >> 1;
if (f(mid) >= id) {
res = mid;
R = mid - 1;
} else
L = mid + 1;
}
long long j = id - f(res - 1);
while (l <= r) {
if (l % 2 == 0) {
pt(j + res);
j++;
l++;
} else {
pt(res);
l++;
}
if (j > n - res) {
j = 1;
res++;
}
}
}
if (ok) printf("1");
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 300005;
int main() {
long long test = 1;
scanf("%d", &test);
while (test--) {
long long n;
long long l, r;
scanf("%lld %lld %lld", &n, &l, &r);
if (l == 1LL * n * (n - 1) + 1) {
printf("1\n");
continue;
}
long long start = 1;
long long curr = 0;
while ((n - start) && curr + 2 * (n - start) < l) {
curr += 2 * (n - start);
start++;
}
long long idx = start + (l - curr + 1) / 2;
long long tot = r - l + 1;
vector<long long> v;
if ((l - curr) % 2 == 0) {
v.push_back(idx);
idx++;
}
for (long long j = idx; j <= n && v.size() < tot; j++) {
v.push_back(start);
if (v.size() < tot) {
v.push_back(j);
}
}
for (long long i = start + 1; i <= n && v.size() < tot; i++) {
for (long long j = i + 1; j <= n && v.size() < tot; j++) {
v.push_back(i);
if (v.size() < tot) {
v.push_back(j);
}
}
}
if (v.size() < tot) {
v.push_back(1);
}
for (long long i = 0; i < v.size(); i++) {
printf("%lld ", v[i]);
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
long long len = n * (n - 1) + 1;
long long i = l;
for (; i <= r && i <= 2 * (n - 2) + 1; i++) {
if (i % 2)
cout << 1 << " ";
else
cout << 1 + i / 2 << " ";
}
if (i > r) {
cout << "\n";
continue;
}
map<long long, tuple<long long, long long, long long>> seen;
long long si = 2 * (n - 2) + 2;
for (long long k = 2; k <= n - 1; k++) {
long long len = 2 * (n - k);
seen[si] = make_tuple(k, len, si + len - 1);
si += len;
}
long long idx = i;
while (!(seen.count(idx) > 0) && seen.size() != 0) {
idx--;
}
while (i <= r && i <= len - 2) {
for (; i <= r && i <= get<2>(seen[idx]); i++) {
long long j = i - idx;
if (j == 0)
cout << n << " ";
else if (j % 2 == 0)
cout << get<0>(seen[idx]) + (j / 2) << " ";
else
cout << get<0>(seen[idx]) << " ";
}
idx = i;
}
if (i <= r && r <= len) {
if (i == len - 1 && i <= r) {
cout << n << " ";
i++;
}
if (i == len && i <= r) cout << 1 << " ";
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
void insert(long long start, long long n) {
long long lim = start + 1;
while (lim <= n) {
v.push_back(start);
v.push_back(lim);
lim++;
}
}
void solve() {
long long n, l, r;
cin >> n >> l >> r;
long long len = r - l + 1;
long long start = 1;
while (start < n && l > 2 * (n - start)) {
l -= 2 * (n - start);
start++;
}
if (start == n) {
cout << "1\n";
return;
}
v.clear();
while (start < n && v.size() < len + l - 1) {
insert(start, n);
start++;
}
if (start == n) {
v.push_back(1);
}
long long i = l - 1;
while (len--) {
cout << v[i] << " ";
i++;
}
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long test = 1;
cin >> test;
while (test--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long l, r, curr = 1, n;
vector<long long> ans;
void rec(long long x) {
if (x == n) {
if (l <= curr && r >= curr) ans.push_back(1);
return;
}
if (curr > r) return;
if (curr + 2 * (n - x) - 1 < l) {
curr += 2 * (n - x);
rec(x + 1);
return;
}
long long ptr = x + 1;
for (int i = 0; i < 2 * (n - x); i++) {
if (l <= curr && r >= curr) {
if (i % 2 == 0)
ans.push_back(x);
else
ans.push_back(ptr);
}
if (i % 2 == 1) ++ptr;
++curr;
}
rec(x + 1);
}
void solve() {
cin >> n >> l >> r;
curr = 1;
ans.clear();
rec(1);
for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false);
;
cin.tie(NULL);
int zz;
cin >> zz;
for (int zzz = 1; zzz <= zz; zzz++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
long long cur = 0, num = 1, rest = n - 1;
while (cur < l) {
cur += (rest * 2);
if (cur >= l) {
cur -= (rest * 2);
break;
}
num++;
rest--;
if (rest < 0) {
break;
}
}
if (cur == (n * (n - 1))) {
cout << 1 << endl;
continue;
}
long long num2 = num, ye = 0;
while (cur < l) {
cur++;
if (ye != num) {
ye = num;
num2++;
} else {
if (num2 < n) {
ye = num2;
} else {
ye = num2;
if (num == n - 1) {
num = 1;
} else {
num++;
num2 = num;
}
}
}
}
for (long long i = l; i <= r; i++) {
cout << ye << " ";
if (ye != num) {
ye = num;
num2++;
} else {
if (num2 < n) {
ye = num2;
} else {
ye = num2;
if (num == n - 1) {
num = 1;
} else {
num++;
num2 = num;
}
}
}
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll MOD = 998244353;
const ll MAX = 2e5 + 1;
inline ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
inline ll sub(ll a, ll b) { return ((a % mod) - (b % mod) + mod) % mod; }
inline ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll pwr(ll x, ll n) {
if (!n) return 1;
if (n & 1)
return mul(x, pwr(mul(x, x), (n - 1) / 2));
else
return pwr(mul(x, x), n / 2);
}
ll modinv(ll n) { return pwr(n, mod - 2); }
void pattern(ll x, ll y, ll n) {
ll tot = 0, idx = n;
for (ll i = 1; i < n; i++) {
if (tot + 2 * (n - i) >= x) {
idx = i;
break;
}
tot += 2 * (n - i);
}
ll l = idx, r = idx + 1;
bool ok = false;
while (tot < x) {
if (r == n + 1) {
r = (++l) + 1;
}
if (tot + 1 == x) {
ok = true;
l = idx;
tot++;
break;
} else {
tot += 2;
if (tot == x) {
break;
}
r++;
}
}
while (tot <= y) {
if (tot == (n * n - n + 1)) {
cout << 1;
return;
}
if (ok) {
cout << l << " ";
} else {
cout << r << " ";
r++;
if (r == n + 1) {
r = (++l) + 1;
}
}
tot++;
ok = !ok;
}
}
void speed_solve() {
ll n, l, r;
cin >> n >> l >> r;
if (l == r and l == (n * n - n + 1)) {
cout << 1 << "\n";
return;
}
ll x = l;
ll y = r;
pattern(l, r, n);
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll test_cases = 1;
cin >> test_cases;
for (ll i = 0; i < test_cases; i++) {
speed_solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
void solve() {
long long n, l, r;
cin >> n >> l >> r;
vector<long long> pre(n + 1, 0);
for (int i = 1; i <= n; i++) {
pre[i] = pre[i - 1] + 2 * (n - i);
}
pre[n]++;
int i = lower_bound(pre.begin(), pre.end(), l) - pre.begin();
long long lc = pre[i - 1] + 1;
int j = i + 1;
if (i == n) {
cout << "1\n";
return;
}
bool ok = 0;
if (r == pre[n]) {
ok = 1;
r--;
}
while (lc <= r) {
if (lc % 2) {
if (lc >= l && lc <= r) {
cout << i << " ";
}
} else {
if (lc >= l && lc <= r) {
cout << j << " ";
}
j++;
}
if (j > n) {
i++;
j = i + 1;
}
lc++;
}
if (ok) {
cout << "1 ";
}
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int l1 = 0, r1 = n - 1, mid, pos = -1;
while (l1 <= r1) {
mid = l1 + (r1 - l1) / 2;
if (2 * mid * n - mid * (mid + 1) < l) {
l1 = mid + 1;
pos = mid;
} else
r1 = mid - 1;
}
long long int t = r - l + 1;
l = l - (2 * pos * n - pos * (pos + 1));
if (pos == n - 1) {
cout << 1 << "\n";
continue;
}
pos++;
int i = 0;
long long int count1, c;
while (t > 0) {
if (pos == n) {
cout << 1;
break;
}
if (i == 0) {
if (l % 2 == 0) {
cout << pos + l / 2 << " ";
t--;
l++;
}
count1 = 2 * (n - pos) - (l - 1);
c = l / 2 + 1;
i++;
} else {
count1 = 2 * (n - pos);
c = 1;
}
while (count1 > 0 && t > 0) {
if (t <= 0) break;
cout << pos << " ";
t--;
if (t <= 0) break;
cout << pos + c << " ";
t--;
c++;
count1 -= 2;
}
pos++;
if (t <= 0) break;
}
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using ll = int64_t;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll T, n, l, r;
cin >> T;
for (int _ = 0, _Len = (T); _ < _Len; ++_) {
cin >> n >> l >> r;
ll index = 1;
for (int i = 1, iLen = (n + 1); i < iLen; ++i) {
if (index + (n - i) * 2 < l) {
index += (n - i) * 2;
continue;
}
for (int j = i + 1, jLen = (n + 1); j < jLen; ++j) {
if (l <= index && index <= r) cout << i << (index < r ? " " : "\n");
index++;
if (l <= index && index <= r) cout << j << (index < r ? " " : "\n");
index++;
if (r < index) break;
}
if (r < index) break;
}
if (index == r) cout << 1 << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios_base::sync_with_stdio(0);
int T;
long long int i, j, p, q;
cin >> T;
long long int cnt2, N, L, R, cnt;
for (int t = 0; t < T; t++) {
cin >> N >> L >> R;
cnt = 0;
for (i = 1; i < N; i++) {
if (L <= cnt + 2 * (N - i)) {
for (j = L; j <= R - 1; j++) {
if ((j - cnt) % 2 == 0)
cnt2 = (j - cnt) / 2 + i;
else
cnt2 = i;
cout << cnt2 << " ";
if (cnt + 2 * (N - i) == j) cnt += 2 * (N - i), i++;
}
if (R <= N * (N - 1)) {
if ((j - cnt) % 2 == 0)
cnt2 = (j - cnt) / 2 + i;
else
cnt2 = i;
cout << cnt2 << " ";
}
break;
}
cnt += 2 * (N - i);
if (R < L) break;
}
if (R == N * (N - 1) + 1) {
cout << 1;
}
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
long long l, r;
cin >> l >> r;
long long h = 1;
int i = 1;
while (i < n && h + (n - i) * 2 <= l) {
h += (n - i) * 2;
i++;
}
while (i < n && h <= r) {
for (int j = i + 1; j <= n; j++) {
if (l <= h && h <= r) cout << i << ' ';
h++;
if (l <= h && h <= r) cout << j << ' ';
h++;
}
i++;
}
if (h <= r) cout << 1;
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long Min(long long a, long long b) { return (a < b) ? a : b; }
long long Max(long long a, long long b) { return (a < b) ? b : a; }
long long gcd(long long m, long long n) {
if (n == 0) return m;
return gcd(n, m % n);
}
long long lcm(long long m, long long n) { return m * n / gcd(m, n); }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long tc;
cin >> tc;
while (tc--) {
long long n, l, r;
cin >> n >> l >> r;
long long ff = l, cnt = r - l + 1, ai = -1;
if (l > n * (n - 1)) {
cout << "1\n";
continue;
}
for (int i = 1; i < n; i++) {
if (ff - 2 * (n - i) <= 0) {
ai = i;
break;
}
ff -= 2 * (n - i);
}
if (ai == -1) {
ai = n - 1;
}
long long aj = ai + ff / 2 + (l & 1);
l %= 2;
while (cnt--) {
if (l & 1) {
cout << ai << ' ';
} else {
cout << aj << ' ';
aj++;
if (aj > n) {
ai++;
aj = ai + 1;
}
if (ai == n) {
ai = 1;
}
}
l = 1 - l;
}
cout << '\n';
}
exit(0);
}
|
#include <bits/stdc++.h>
using namespace std;
void work() {
long long n, l, r;
cin >> n >> l >> r;
long long cnt = 0;
long long sum = 0;
long long f = 0;
for (long long i = n - 1; i > 0; i--) {
sum += i * 2;
cnt++;
if (sum >= l) {
sum -= i * 2;
f = 1;
break;
}
}
if (f == 0) {
if (l == sum + 1) cout << 1 << endl;
return;
}
vector<long long> ans;
long long fl = l % 2;
long long now = cnt + fl + (l - sum) / 2;
for (long long i = l; i <= r; i++) {
if (fl == 1) {
if (cnt == n) {
ans.push_back(1);
break;
}
ans.push_back(cnt);
fl = 0;
} else {
fl = 1;
ans.push_back(now);
if (now == n) {
cnt++;
now = cnt + 1;
} else
now++;
}
}
for (long long i = 0; i < ans.size(); i++) {
cout << ans[i] << ' ';
}
cout << endl;
}
signed main() {
long long t = 1;
cin >> t;
while (t--) {
work();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
long long l, r, len;
cin >> n >> l >> r;
l--, r--;
len = (r - l + 1);
int i = 0;
for (; i < n; i++) {
if ((n - i - 1) * 2 <= l) {
l -= (n - i - 1) * 2;
r -= (n - i - 1) * 2;
} else {
break;
}
}
vector<int> ans;
for (int j = l / 2 + i + 1; j < n; j++) {
ans.push_back(i);
ans.push_back(j);
}
r -= l / 2 * 2;
l -= l / 2 * 2;
for (i++; i < n && ans.size() <= r; i++) {
for (int j = i + 1; j < n && ans.size() <= r; j++) {
ans.push_back(i);
ans.push_back(j);
}
}
ans.push_back(0);
for (int i = l; i <= r; i++) {
cout << ans[i] + 1 << " ";
}
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin.sync_with_stdio(0);
cout.tie(0);
cout.sync_with_stdio(0);
cout.precision(9);
int q;
cin >> q;
while (q--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
scanf("%lld", &t);
while (t--) {
long long n, l, r;
scanf("%lld%lld%lld", &n, &l, &r);
long long suml = 0, sumr = 0;
long long headl = 1, headr = -1;
long long flag1 = 0;
for (long long i = 1; i < n; ++i) {
if (!flag1) {
suml += 2 * (n - i);
}
sumr += 2 * (n - i);
if (suml >= l && !flag1) {
suml -= 2 * (n - i);
flag1 = 1;
headl = i;
} else if (sumr >= r) {
headr = i;
break;
}
}
long long vv = 0;
if (headr == -1) {
vv = 1;
}
long long flag = 1;
long long now = headl + 1;
for (long long i = suml + 1; i <= sumr; ++i) {
if (flag == 1) {
if (l <= i && i <= r) {
printf("%lld ", headl);
}
flag = 2;
} else if (flag == 2) {
if (l <= i && i <= r) {
printf("%lld ", now);
}
now++;
if (now > n) {
headl++;
now = headl + 1;
}
flag = 1;
}
}
if (vv == 1) {
printf("1 ");
}
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
void proc() {
int n;
long long l, r;
std::cin >> n >> l >> r;
if (l == 1LL * n * (n - 1) + 1) {
std::cout << 1 << std::endl;
return;
}
int i = 0;
long long t = 0;
while (t + 2 * (n - 1 - i) < l) {
t += 2 * (n - 1 - i);
i++;
}
std::clog << i << std::endl;
int j = i + 1 + (l - t - 1) / 2;
std::clog << j << std::endl;
for (; l <= r; l++) {
std::cout << (l % 2 ? i + 1 : j + 1) << ' ';
if (l % 2 == 0) j++;
if (j == n) {
i = (i + 1) % (n - 1);
j = i + 1;
}
}
std::cout << std::endl;
}
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
int t = 1;
std::cin >> t;
while (t--) proc();
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native,avx,avx2,fma")
using namespace std;
vector<long long> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long a = 0, b = 0, c, d, e, f = 0, l, g, m, n, k, i, j, t, p, q, r, lo,
hi, mid;
cin >> t;
while (t--) {
cin >> n >> l >> r;
if (l == n * (n - 1) + 1) {
cout << 1 << '\n';
continue;
}
lo = 1;
hi = n;
while (lo <= hi) {
mid = (lo + hi) / 2;
q = n - mid;
p = q * (q + 1) + 1;
p = n * (n - 1) + 1 - p;
if (p >= l) {
hi = mid - 1;
} else {
k = mid;
lo = mid + 1;
}
}
g = r - l + 1;
q = n - k;
p = q * (q + 1) + 1;
p = n * (n - 1) + 1 - p;
d = l - p;
d = ceil(1.0 * d / 2.0);
d += k;
if (l % 2 == 0) {
cout << d << ' ';
if (d == n) {
k++;
d = k + 1;
} else {
d++;
}
l++;
}
for (i = l; i <= r; i++) {
if (i % 2) {
if (k == n) {
cout << 1 << ' ';
} else
cout << k << ' ';
} else {
cout << d << ' ';
if (d == n) {
k++;
d = k + 1;
} else {
d++;
}
}
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> p[105];
const int N = 1e5 + 10;
long long d[N];
bool cmp(int a, int b) { return a > b; }
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
long long ans = 0;
for (long long i = 1; i < n; i++) {
d[i] = ans + (n - i) * 2;
ans = d[i];
}
d[n] = ans + 1;
for (long long i = l; i <= r; i++) {
long long p = lower_bound(d + 1, d + n + 1, i) - d;
if (i == d[n]) {
cout << 1 << ' ';
break;
}
if (i & 1)
cout << p << ' ';
else {
long long t = i - d[p - 1];
cout << t / 2 + p << ' ';
}
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
int T;
int seq[maxn * 10 + 5];
long long sum, n, l, r;
void mak(int p) {
long long len = 0;
for (int i = p; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
seq[++len] = i;
seq[++len] = j;
}
if (len + sum >= r) break;
}
}
int main() {
scanf("%d", &T);
while (T--) {
scanf("%lld %lld %lld", &n, &l, &r);
bool fl = 0;
if (r == n * (n - 1ll) + 1) fl = 1;
sum = 0;
int pos;
for (int i = 1; i <= n; i++) {
if (sum + 2 * (n - i) >= l) {
mak(i);
break;
}
sum += 2 * (n - i);
}
l -= sum;
r -= sum;
if (fl) seq[r] = 1;
for (int i = l; i <= r; i++) printf("%d ", seq[i]);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int inf = 1000 * 1000 * 1000;
const int mod = 998244353;
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
int t;
int n;
long long l, r;
int main() {
cin >> t;
while (t--) {
scanf("%d%lld%lld", &n, &l, &r);
vector<pair<long long, long long> > mas;
vector<int> start;
long long st = 1;
for (int i = n - 1; i >= 1; i--) {
mas.push_back(make_pair(st, st + 2 * i - 1));
start.push_back(n - i);
st += 2 * i;
}
mas.push_back(make_pair(st, st));
for (int i = 0; i < (int)mas.size(); i++) {
if (l > mas[i].second) continue;
if (r < mas[i].first) continue;
if (i == (int)mas.size() - 1) {
printf("1");
continue;
}
int ll = max(l, mas[i].first) - mas[i].first + 1;
int rr = min(r, mas[i].second) - mas[i].first + 1;
int s = start[i];
for (int j = ll; j <= rr; j++) {
if (j % 2) {
printf("%d ", s);
} else {
printf("%d ", s + j / 2);
}
}
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
int q;
void solve() {
long long n, l, r, cnt = 0, cur = 0;
cin >> n >> l >> r;
for (long long i = 1; i <= n; i++) {
bool ok = 1;
if (cur + (n - i) + (n - i) < l) {
cur += (n - i) + (n - i);
continue;
}
for (long long j = i + 1; j <= n; j++) {
if (l <= cur + 1 && cur + 1 <= r) cout << i << " ", ++cnt;
cur++;
if (l <= cur + 1 && cur + 1 <= r) cout << j << " ", ++cnt;
cur++;
if (cur > r) {
ok = 0;
break;
}
}
if (!ok) break;
}
if (cnt != r - l + 1) cout << 1;
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cout.precision(30);
cerr.precision(7);
;
cin >> q;
while (q--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void brute_force(long long n) {
set<int> graph[n + 1];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j) continue;
graph[i].insert(j);
}
}
int node = 1;
vector<int> ans = {node};
long long edges = n * (n - 1);
while (edges != 0) {
bool has_bridge = false;
int bridge_neighbor = -1;
int goto_neighbor = -1;
for (auto neighbor : graph[node]) {
if (graph[neighbor].size() < 1) {
has_bridge = true;
bridge_neighbor = neighbor;
} else {
goto_neighbor = neighbor;
break;
}
}
if (goto_neighbor == -1) {
goto_neighbor = bridge_neighbor;
}
ans.push_back(goto_neighbor);
graph[node].erase(goto_neighbor);
node = goto_neighbor;
edges--;
}
for (auto x : ans) {
cout << x << " ";
}
cout << endl;
}
vector<int> ans;
void go(long long level, long long l, long long r, long long offset) {
if (level == 0) return;
long long prefix = (level - 1) * 2;
if (l <= prefix) {
long long idx = 1;
for (int i = 2; i <= level; i++) {
if (l <= idx && idx <= r) ans.push_back(1 + offset);
idx++;
if (l <= idx && idx <= r) ans.push_back(i + offset);
idx++;
}
}
if (r - prefix >= 1) {
go(level - 1, l - prefix, r - prefix, offset + 1);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T;
cin >> T;
while (T--) {
long long n, l, r;
cin >> n >> l >> r;
ans.clear();
go(n, l, r, 0);
if (r == n * (n - 1) + 1) ans.push_back(1);
for (int i = 0; i < ans.size(); i++) {
if (i) cout << " ";
cout << ans[i];
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e6 + 5, MOD = 1e9 + 7, MAXLG = log2(MAX) + 1;
const long long inf = 1e18 + 5;
int arr[MAX];
vector<long long> v;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
;
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
int len = r - l + 1;
long long L = 0, R = 0;
bool lt = false, rt = false;
int lid = 0, rid = 0;
for (int i = 1; i < n; i++) {
long long val = 2ll * (n - i);
if (!lt && L + val < l)
L += val, lid = i;
else
lt = true;
if (!rt && R + val < r)
R += val, rid = i;
else
rt = true;
}
l -= (L + 1);
lid++, rid++;
deque<int> ans;
for (int i = lid; i <= rid; i++) {
for (int j = i + 1; j <= n; j++) {
ans.push_back(i);
ans.push_back(j);
}
}
while (l--) ans.pop_front();
while ((int)ans.size() > len) ans.pop_back();
if ((int)ans.size() < len) ans.push_back(1);
for (int x : ans) cout << x << " ";
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
long long t, n, l, r, now;
vector<int> q;
int main() {
cin >> t;
while (t--) {
while (q.size()) q.pop_back();
cin >> n >> l >> r;
now = 1;
for (long long i = (1); i <= (n - 1); i++) {
if (now > r) break;
if (now + 2 * (n - i) - 1 < l) {
now = now + 2 * (n - i);
continue;
}
if (now >= l && now + 2 * (n - i) - 1 <= r) {
for (long long j = (i + 1); j <= (n); j++)
q.push_back(i), q.push_back(j);
} else if (now >= l) {
long long cnt = now;
for (long long j = (i + 1); j <= (n); j++) {
q.push_back(i);
cnt++;
if (cnt > r) break;
q.push_back(j);
cnt++;
if (cnt > r) break;
}
} else if (now + 2 * (n - i) - 1 <= r) {
long long cnt = now + 2 * (n - i) - 1;
for (long long j = (n); j >= (i + 1); j--) {
q.push_back(j);
cnt--;
if (cnt < l) break;
q.push_back(i);
cnt--;
if (cnt < l) break;
}
reverse(q.begin(), q.end());
} else {
long long cnt = now;
for (long long j = (i + 1); j <= (n); j++) {
if (cnt >= l && cnt <= r) q.push_back(i);
cnt++;
if (cnt >= l && cnt <= r) q.push_back(j);
cnt++;
}
break;
}
now = now + 2 * (n - i);
}
if (r == n * (n - 1) + 1) q.push_back(1);
for (vector<int>::iterator it = q.begin(); it != q.end(); it++) {
printf("%d ", *it);
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long q, n, l, r, sum[100005];
signed main() {
cin >> q;
while (q--) {
cin >> n >> l >> r;
long long s = n * (n - 1), p = 0;
if (l == s + 1) {
puts("1");
continue;
}
sum[0] = 0;
for (long long i = 1; i < n; i++) sum[i] = sum[i - 1] + 2 * (n - i);
for (p = 1; p < n; p++)
if (sum[p] >= l) break;
if (r < s + 1)
for (long long i = l; i <= r; i++) {
if (i % 2 == 1)
cout << p << ' ';
else
cout << p + (i - sum[p - 1]) / 2 << ' ';
if (i == sum[p]) p++;
}
else {
for (long long i = l; i < r; i++) {
if (i % 2 == 1)
cout << p << ' ';
else
cout << p + (i - sum[p - 1]) / 2 << ' ';
if (i == sum[p]) p++;
}
cout << 1;
}
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
long long T;
cin >> T;
while (T-- > 0) {
long long l, r;
cin >> n >> l >> r;
long long cnt = 0;
for (int i = 1; i <= n - 1; ++i) {
long long p = max(l, cnt + 1), q = min(cnt + 2 * (n - i), r);
p -= cnt, q -= cnt;
cnt += 2 * (n - i);
if (q < p) continue;
if (p % 2 == 0) cout << i + p / 2 << ' ', ++p;
for (int j = i + (p + 1) / 2; j <= i + q / 2; ++j)
cout << i << ' ' << j << ' ';
if (q & 1) cout << i << ' ';
}
if (r == n * (n - 1) + 1) cout << 1;
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long test;
scanf("%lld", &test);
while (test--) {
long long i, j, k, l, r, n, m;
scanf("%lld", &n);
scanf("%lld", &l);
scanf("%lld", &r);
long long pre = 1, cub = 0, num;
for (i = 1; i < n; i++) {
if (l <= cub + 2 * (n - i)) {
pre = i;
break;
} else
cub += 2 * (n - i);
}
num = pre + 1;
vector<long long> ans;
for (i = cub + 1; i <= r && i <= n * (n - 1); i++) {
if (i & 1)
k = pre;
else
k = num++;
if (i >= l) ans.push_back(k);
if (num > n) {
pre++;
num = pre + 1;
}
}
if (r == n * (n - 1) + 1) ans.push_back(1LL);
for (long long bn : ans) {
printf("%lld", bn);
printf(" ");
}
printf("\n");
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.