solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
for i in range(int(input())):
n, l, r = map(int, input().split())
l -= 1
r -= 1
c = 0
for j in range(n):
if (c + (n - j - 1) * 2 < l or c > r):
c += (n - j - 1) * 2
continue
for k in range(j + 1, n):
if (l <= c <= r):
print(j + 1, end = ' ')
c += 1
if (l <= c <= r):
print(k + 1, end = ' ')
c += 1
if (l <= c <= r):
print(1)
else:
print('') | 10 | PYTHON3 |
from sys import stdin
def allWays(start, verts, done, stack, n):
global valid
if not valid:
return
stack.append(start)
if len(done) == len(verts):
print(stack)
stack.pop()
valid = False
return
for x in range(1,n+1):
if start != x and not (start,x) in done:
done.add((start,x))
allWays(x,verts,done,stack,n)
done.remove((start,x))
stack.pop()
'''
for y in range(1,10):
verts = set([((x//y) + 1, (x%y)+1) for x in range(y**2)])
for x in range(1,y+1):
verts.remove((x,x))
valid = True
print(y, end=' ')
allWays(1, verts, set(), [], y)
'''
def order(n,x):
out = []
for y in range(x+1,n+1):
out.append(x)
out.append(y)
return out
for case in range(int(stdin.readline())):
n,l,r = [int(x) for x in stdin.readline().split()]
end1 = False
if r == n*(n-1) + 1:
end1 = True
r -= 1
if l == n*(n-1) + 1:
print(1)
else:
x = 1
while l > 2*(n-x):
l -= 2*(n-x)
r -= 2*(n-x)
x += 1
out = order(n,x)
r -= 2*(n-x)
x += 1
while r > 0:
out += order(n,x)
r -= 2*(n-x)
x += 1
if end1:
out += [1]
if r != 0:
realOut = out[l-1:r]
else:
realOut = out[l-1:]
print(' '.join([str(b) for b in realOut]))
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
# -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10 ** 9 + 7
def gen_arr(v):
if N - v == 0:
return [1]
n = (N-v) * 2
res = [0] * n
x = v + 1
for i in range(n):
if i % 2 == 0:
res[i] = v
else:
res[i] = x
x += 1
return res
for _ in range(INT()):
N, l, r = MAP()
l -= 1
ans = []
cur = 0
v = 1
incr = (N-1) * 2
while cur + incr < l:
cur += incr
v += 1
incr -= 2
ans = gen_arr(v)
ans = ans[l-cur:]
ln = r - l
v += 1
while len(ans) < ln:
ans += gen_arr(v)
v += 1
ans = ans[:ln]
print(*ans)
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
import io
import os
from collections import Counter, defaultdict, deque
def solve(N, L, R):
M = R - L + 1
ans = []
count = 0
done = False
for i in range(N - 1, -1, -1):
if count + 2 * i < L:
count += 2 * i
else:
curr = N - i
for j in range(curr + 1, N + 1):
if count + 1 >= L:
ans.append(str(curr))
if len(ans) == M:
done = True
break
count += 1
if count + 1 >= L:
ans.append(str(j))
if len(ans) == M:
done = True
break
count += 1
if done:
break
if len(ans) < M:
ans.append("1")
return " ".join(ans)
if __name__ == "__main__":
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
T = int(input())
for t in range(T):
N, L, R = [int(x) for x in input().split()]
ans = solve(N, L, R)
print(ans)
| 10 | PYTHON3 |
from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop
import math
from collections import *
from functools import reduce,cmp_to_key
import sys
input = sys.stdin.readline
M = mod = 998244353
def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))
def inv_mod(n):return pow(n, mod - 2, mod)
def li():return [int(i) for i in input().rstrip('\n').split()]
def st():return input().rstrip('\n')
def val():return int(input().rstrip('\n'))
def li2():return [i for i in input().rstrip('\n')]
def li3():return [int(i) for i in input().rstrip('\n')]
for _ in range(val()):
n,l,r = li()
orig = r
l -= 1
r -= l
currleft = 0
curs = n - 1
while curs and currleft + 2*curs <= l:
currleft += 2*curs
curs -= 1
start = n - curs
ans = []
head = start
l -= currleft
last = head + 1
half = 0
while l:
half = 1
start = last
last += 1
l -= 1
if not l:break
half = 0
start = head
l -= 1
if half:
ans.append(start)
if last == n + 1:
head += 1
last = head + 1
start = head
r -= 1
while r:
ans.append(start)
r -= 1
if not r:break
start = last
ans.append(start)
last += 1
if last == n + 1:
head += 1
last = head + 1
r -= 1
start = head
if orig == n*(n-1) + 1:
ans[-1] = 1
print(*ans)
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
# HEY STALKER
for _ in range(int(input())):
n, l, r = map(int, input().split())
z = 0
idx = 0
sd = (n-1)*2
lst = (n*(n-1))+1
while z < l:
if sd <= 0:
z += 1
break
idx += 1
z += sd
sd -= 2
m = idx-1
c = (n-1)*2
sm = 0
for t in range(m):
sm += c
c -= 2
sm += 1
nikal = l-sm
p = []
if idx == 1:
for t in range(2, n+1):
p.append(1)
p.append(t)
else:
ii = idx
for t in range(ii+1, n+1):
p.append(ii)
p.append(t)
p.reverse()
for tg in range(nikal):
p.pop()
p.reverse()
idx += 1
i1 = idx
while len(p) < (r-l+1):
if i1 == n:
p.append(1)
for t in range(i1+1, n+1):
p.append(i1)
p.append(t)
i1 += 1
print(*p[:(r-l+1)]) | 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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';
}
| 10 | CPP |
t = int(input())
for case_num in range(t):
n, l, r = map(int, input().split(' '))
if l == n * (n-1) + 1:
print(1)
continue
total = 0
unvisited = n - 1
while total < l:
total += unvisited * 2
unvisited -= 1
unvisited += 1
total -= unvisited * 2
current = n - unvisited
nxt = current + 1
ans = []
while total < r:
total += 1
now = current if total % 2 == 1 else nxt
if now == nxt:
nxt += 1
if nxt > n:
current += 1
nxt = current + 1
if current == n:
current = 1
if total >= l:
ans.append(now)
print(' '.join(map(str, ans)))
| 10 | PYTHON3 |
import sys
input = sys.stdin.readline
T=int(input())
for tests in range(T):
n,l,r=map(int,input().split())
begin=1
while l>(n-begin)*2+1:
if begin==n:
break
l-=(n-begin)*2
r-=(n-begin)*2
begin+=1
#print(begin,l,r)
if begin==n:
ANS=[n,1]
else:
ANS=[]
while len(ANS)<=r:
if begin==n:
ANS.append(1)
break
for j in range(begin+1,n+1):
ANS.append(begin)
ANS.append(j)
begin+=1
#print(ANS)
print(*ANS[l-1:r])
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
# coding: utf-8
# Your code here!
def solve():
n, l, r = map(int, input().split())
def where(x):
if x == n*(n-1) + 1:
return 1
else:
l = 0
r = n + 1
while r - l > 1:
m = (l + r)//2
if (2*n-1-m)*(m) < x:
l = m
else:
r = m
v = x - (2*n-1-l)*(l)
if v % 2 != 0:
return r
else:
return r + v//2
res = [where(p) for p in range(l, r+1)]
print(*res)
return
def main():
t = int(input())
for i in range(t):
solve()
if __name__ == "__main__":
main()
| 10 | PYTHON3 |
# region fastio # from https://codeforces.com/contest/1333/submission/75948789
import sys, io, os
BUFSIZE = 8192
class FastIO(io.IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = io.BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(io.IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
"""Prints the values to a stream, or to sys.stdout by default."""
sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
at_start = True
for x in args:
if not at_start:
file.write(sep)
file.write(str(x))
at_start = False
file.write(kwargs.pop("end", "\n"))
if kwargs.pop("flush", False):
file.flush()
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
T = int(input())
for idx_testcase in range(T):
N, L, R = map(int, input().split())
f = False
if R==N*(N-1)+1:
if L==R:
print(1)
continue
f = True
R -= 1
s = 0
d = 2*N
i = 0
Ans = [0] * (R-L+1)
while s < L:
d -= 2
s += d
i += 1
s -= d
numer = L-s
for idx_ans in range(R-L+1):
if numer%2:
Ans[idx_ans] = i
else:
Ans[idx_ans] = numer//2 + i
numer += 1
if Ans[idx_ans] == N:
numer = 1
i += 1
if f:
Ans.append(1)
print(*Ans)
| 10 | PYTHON3 |
import sys
input = sys.stdin.readline
from collections import *
def binary_search1():
l, r = 1, n-1
while l<=r:
m = (l+r)//2
if acc[m]-acc[1]+1<=left:
l = m+1
else:
r = m-1
return r
def binary_search2():
l, r = 1, n-1
while l<=r:
m = (l+r)//2
if acc[m+1]-acc[1]>=right:
r = m-1
else:
l = m+1
return l
T = int(input())
for _ in range(T):
n, left, right = map(int, input().split())
l = [0, 2*n-2]
for _ in range(n-2):
l.append(l[-1]-2)
l[-1] += 1
#print(l)
acc = [0]
for li in l:
acc.append(acc[-1]+li)
left_n = binary_search1()
right_n = binary_search2()
#print(left_n)
#print(right_n)
ans = []
for i in range(left_n, right_n+1):
li = []
for j in range(l[i]-1):
if j%2==0:
li.append(i)
else:
if j==1:
li.append(i+1)
else:
li.append(li[-2]+1)
if i==n-1:
li.append(1)
else:
li.append(n)
ans += li
#print(ans)
sta = left-(acc[left_n]-acc[1])-1
#print(sta)
print(*ans[sta:sta+right-left+1]) | 10 | PYTHON3 |
import sys
input = sys.stdin.readline
def li():return [int(i) for i in input().rstrip('\n').split()]
def val():return int(input().rstrip('\n'))
for _ in range(val()):
n,l,r = li()
orig = r
l -= 1
r -= l
currleft = 0
curs = n - 1
while curs and currleft + 2*curs <= l:
currleft += 2*curs
curs -= 1
start = n - curs
ans = []
head = start
l -= currleft
last = head + 1
half = 0
while l:
half = 1
start = last
last += 1
l -= 1
if not l:break
half = 0
start = head
l -= 1
if half:
ans.append(start)
if last == n + 1:
head += 1
last = head + 1
start = head
r -= 1
while r:
ans.append(start)
r -= 1
if not r:break
start = last
ans.append(start)
last += 1
if last == n + 1:
head += 1
last = head + 1
r -= 1
start = head
if orig == n*(n-1) + 1:
ans[-1] = 1
print(*ans) | 10 | PYTHON3 |
#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;
}
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
import math
# решена
def task_1343_c():
b = int(input())
array = [int(num) for num in input().split()]
maxPositive = 0
minNegative = -10000000000
res = 0
for i in range(b):
if array[i] < 0:
if i != 0 and array[i - 1] >= 0:
res += maxPositive
maxPositive = 0
minNegative = max(minNegative, array[i])
else:
if i != 0 and array[i - 1] < 0:
res += minNegative
minNegative = -10000000000
maxPositive = max(maxPositive, array[i])
if minNegative == -10000000000:
res += maxPositive
else:
res += maxPositive + minNegative
print(res)
# не работает от слова совсем
def task_1341_b():
heightLen, doorSize = map(int, input().split())
heights = [int(num) for num in input().split()]
perf = [0 for i in range(heightLen)]
a = 0
for i in range(heightLen - 1):
if i == 0:
perf[i] = 0
else:
if heights[i - 1] < heights[i] and heights[i] > heights[i + 1]:
a += 1
perf[i] = a
perf[heightLen - 1] = a
max_global = 0
left_global = 0
for i in range(heightLen - doorSize):
max_local = perf[i + doorSize - 1] - perf[i]
if max_local > max_global:
max_global = max_local
left_global = i
print(max_global + 1, left_global + 1)
# решил, чтоб её
def task_1340_a():
n = int(input())
array = [int(i) for i in input().split()]
for i in range(n - 1):
if array[i] < array[i + 1]:
if array[i] + 1 != array[i + 1]:
print("No")
return
print("Yes")
#решил
def task_1339_b():
n = int(input())
array = [int(num) for num in input().split()]
array.sort()
output = [0 for i in range(0, n)]
i = 0
h = 0
j = n - 1
while i <= j:
output[h] = array[i]
h += 1
i += 1
if h < n:
output[h] = array[j]
h += 1
j -= 1
for val in reversed(output):
print(val, end=' ')
# решена
def task_1338_a():
n = int(input())
inputArr = [int(num) for num in input().split()]
max_sec = 0
for i in range(1, n):
local_sec = 0
a = inputArr[i - 1] - inputArr[i]
if a <= 0:
continue
else:
b = math.floor(math.log2(a))
local_sec = b + 1
for j in range(b, -1, -1):
if a < pow(2, j):
continue
inputArr[i] += pow(2, j)
a -= pow(2, j)
if local_sec > max_sec:
max_sec = local_sec
print(max_sec)
def task_1334_d():
n, l ,r = map(int, input().split())
if l == 9998900031:
print(1)
return
res = []
count = 0
start_pos = l
for i in range(1, n + 1):
count += (n - i) * 2
if count >= l:
for j in range(n - i):
res.append(i)
res.append(j + i + 1)
else:
start_pos -= (n - i) * 2
if count >= r:
break
res.append(1)
for i in range(start_pos - 1, start_pos + (r - l)):
print(res[i], end=" ")
print()
a = int(input())
for i in range(a):
task_1334_d() | 10 | PYTHON3 |
#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;
}
| 10 | CPP |
def slv(n,l, r):
l-=1
r-=1
c = 0
ans = []
for i in range(1, n):
nl,nr = c, c + 2*(n-i)-1
c = nr+1
if l > nr:
continue
for j in range(max(l, nl), min(r, nr)+1):
if j %2 == 0:
ans.append(i)
else:
ans.append(i + (j-nl+1)//2)
if r == n*(n-1):
ans.append(1)
print(' '.join([str(i) for i in ans]))
t = int(input())
for _ in range(t):
n,l,r = map(int, input().split())
slv(n,l,r)
| 10 | PYTHON3 |
#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");
}
}
}
| 10 | CPP |
import os, sys, bisect, copy
from collections import defaultdict, Counter, deque
from functools import lru_cache #use @lru_cache(None)
if os.path.exists('in.txt'): sys.stdin=open('in.txt','r')
if os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')
#
def input(): return sys.stdin.readline()
def mapi(arg=0): return map(int if arg==0 else str,input().split())
#------------------------------------------------------------------
for _ in range(int(input())):
n,l,r = mapi()
low = 1
high = n-1
pst = 0
def check(pst,n,l):
val = 2*n*pst-(pst*pst)-pst
if val < l:
return True
return False
while low <= high:
mid = (low+high)//2
if check(mid,n,l):
pst = mid
low = mid+1
else:
high = mid-1
val = 2*n*pst-(pst*pst)-pst
rem = l-val
#print(pst)
temp = True
prev = True
for i in range(rem-1):
if prev:
if temp:
pst += 1
nxt = pst
else:
nxt += 1
temp = False
if nxt == n:
temp = True
prev = not prev
#print(pst,nxt)
#print(temp,prev,nxt)
res = []
for i in range(r-l+1):
if prev:
if temp:
pst += 1
nxt = pst
if pst == n:
pst = 1
res.append(pst)
else:
temp = False
nxt += 1
res.append(nxt)
if nxt == n:
temp = True
prev = not prev
print(*res)
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
def genGroup(lo, n):
if lo == n:
return [1]
s = []
for i in range(lo+1, n+1):
s.append(lo)
s.append(i)
return s
for tc in range(int(input())):
n, beg, end = map(int, input().split())
if beg == n*(n-1)+1:
print(1)
else:
past = 0
i = 1
while past + 2*(n-i) < beg:
past += 2*(n-i)
i += 1
#print(i, past)
group = i
s = genGroup(group, n)
pos = beg - past - 1
res = []
for i in range(end-beg+1):
res.append(s[pos])
pos += 1
if pos == len(s):
pos = 0
group += 1
s = genGroup(group, n)
print(*res)
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#code
import sys
import math as mt
#input=sys.stdin.buffer.readline
t=int(input())
#tot=0
for __ in range(t):
#n=int(input())
#l=list(map(int,input().split()))
n,l,r=map(int,input().split())
j=1
k=2*n-2
mul=1
k=2*n-2
r1=k
l1=1
for i in range(n-2):
if l>=l1 and l<=r1:
#print(111,l1,r1,mul)
break
k-=2
l1=r1+1
r1=l1+k-1
mul+=1
#print(111,l1,r1,mul,k)
nex=mul
ch=0
#print(999,ch)
for i in range(l1,min(r1+1,r+1)):
if i>=l:
if ch%2!=0:
nex+=1
print(nex,end=" ")
else:
print(mul,end=" ")
else:
if ch%2!=0:
nex+=1
ch+=1
if i>r1:
break
i=r1+1
mul+=1
ch=0
nex=mul
k-=1
while i<=min(r,n*(n-1)):
if ch%2==0:
print(mul,end=" ")
else:
nex+=1
print(nex,end=" ")
i+=1
ch+=1
if ch==2*(n-mul):
mul+=1
ch=0
nex=mul
if r==n*(n-1)+1:
print(1,end=" ")
print()
| 10 | PYTHON3 |
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
from math import factorial
from collections import Counter, defaultdict
from heapq import heapify, heappop, heappush
def RL(): return map(int, sys.stdin.readline().rstrip().split())
def N(): return int(input())
def comb(n, m): return factorial(n) / (factorial(m) * factorial(n - m)) if n >= m else 0
def perm(n, m): return factorial(n) // (factorial(n - m)) if n >= m else 0
def mdis(x1, y1, x2, y2): return abs(x1 - x2) + abs(y1 - y2)
mod = 1000000007
INF = float('inf')
# ------------------------------
def main():
def c(sm, a1):
sm = n*a1+(n-1)*n
for _ in range(N()):
n, l, r = RL()
i = n-1
sm = 0
while sm+i*2+1<l:
sm+=i*2 if i>0 else 1
i-=1
dif = l-sm
res = []
for j in range(n-i, n):
now = []
for k in range(j+1, n+1):
now.append(j)
now.append(k)
res+=now
# print(now)
if len(res)>(r-l+1)+dif: break
res = res[dif-1:]
if r==(n-1)*n+1: res.append(1)
# print(res)
print(*res[:r-l+1])
if __name__ == "__main__":
main()
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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();
}
}
| 10 | CPP |
# -*- coding: utf-8 -*-
import os
import sys
from io import BytesIO, IOBase
INF = 2**62-1
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input():
return sys.stdin.readline().rstrip("\r\n")
# ------------------------------
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def slv(N, L, R):
k = 1
ans = []
for i in range(N-1):
c = (N-1-i)*2
if k + c >= L:
for j in range(c//2):
if L <= k <= R:
ans.append(i+1)
k += 1
if L <= k <= R:
ans.append(i+1+j+1)
k += 1
if k > R:
return ans
else:
k += c
if L <= k <= R:
ans.append(1)
return ans
def main():
T = read_int()
for _ in range(T):
N, L, R = read_int_n()
print(*slv(N, L, R))
if __name__ == '__main__':
main()
| 10 | PYTHON3 |
#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);
}
| 10 | CPP |
import sys
readline = sys.stdin.readline
def overlap(a, b, c, d):
if b <= c or d <= a:
return False
return True
T = int(readline())
Ans = [None]*T
for qu in range(T):
N, l, r = map(int, readline().split())
l -= 1
ans = []
num =[0] + [2*(N-i-1) for i in range(N-1)] + [1]
for i in range(1, N+1):
num[i] += num[i-1]
started = False
ended = False
for j in range(N):
xp = num[j]
xn = num[j+1]
if overlap(xp, xn, l, r):
started = True
if started:
cnt = j+2
for k in range(2*(N-j-1)):
if xp + k + 1 <= l:
if k & 1:
cnt += 1
continue
if xp + k + 1 <= r:
if k % 2 == 0:
ans.append(j+1)
else:
ans.append(cnt)
cnt += 1
else:
ended = True
break
if ended:
break
if r == N*(N-1)+1:
ans.append(1)
Ans[qu] = ' '.join(map(str, ans))
print('\n'.join(map(str, Ans))) | 10 | PYTHON3 |
from sys import stdin, stdout
import collections
for _ in range(int(input())):
n, l, r = map(int, input().split())
loop = r-l+1
if r==n*(n-1)+1:
loop-=1
ans = ""
t_l = 2*(n-1)
t_r = 2*(n-1)
i = 1
while l>t_l:
i += 1
if i!=n:
t_l+=2*(n-(i))
else:
t_l+=1
t_l-=2*(n-(i))
l-=t_l
for m in range(loop):
if l % 2 == 0:
print(i+l//2,end =" ")
if i + l // 2 == n:
i += 1
l = 1
else:
l += 1
else:
print(i, end = " ")
l+=1
if r == n * (n - 1) + 1:
print("1", end = " ")
print()
#print(ans)
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
for t in range(int(input())):
n,l,r=map(int,input().split())
b=1
for i in range(1,n):
a=b
b+=2*(n-i)
if l<b:
break
x,y=i,(l-a)//2+i+1
b=(l-a)%2
for _ in range(r-l):
if b:
print(y,end=" ")
y+=1
if y==n+1:
x+=1
y=x+1
else:
print(x,end=" ")
b^=1
if r==n*(n-1)+1:
print(1)
else:
print(y if b else x)
#HC
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
"""
NTC here
"""
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
def iin(): return int(input())
def lin(): return list(map(int, input().split()))
def main():
T = iin()
while T:
T-=1
n, l, r= lin()
l-=1
r-=1
ch, ch1 = n-1, 1
sm = 0
while l>sm+ch*2:
sm+=ch*2
ch-=1
ch1+=1
ans = []
ch3 = ch*2 - (l-sm)
while l<=r:
if ch3==0:
sm+=ch*2
ch-=1
ch1+=1
ch3= ch*2
ch3-=1
if l%2==0:
ans.append(ch1)
else:
ans.append((l-sm)//2+ch1+1)
l+=1
if ch1==n:
ans[-1]=1
print(*ans)
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main() | 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
def oracle(n, start, end):
nod = 0
t = n - 1
ii = 0
while start - ii > t*2:
if t == 0:
nod += 1
break
nod += 1
ii += t*2
t -= 1
if t < -10:
import sys
sys.exit()
R = []
for cur in range(nod, n):
for v in range(cur+1, n):
ii += 1
if start <= ii <= end:
R.append(cur + 1)
ii += 1
if start <= ii <= end:
R.append(v + 1)
if ii > end:
return R
ii += 1
if start <= ii <= end:
R.append(1)
return R
t = int(input())
for _ in range(t):
a,b,c = map(int,input().split())
x = oracle(a, b, c)
print(*x)
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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";
}
}
| 10 | CPP |
import itertools as it
import os
def items(k, n):
return 2 * k * n - k * (k + 1)
def b(l, n):
if l > n * (n - 1):
return n
low = 1
high = n - 1
while low < high:
mid = (high + low) // 2
if items(mid, n) < l:
low = mid + 1
else:
high = mid
return low
def row_gen(r, n):
while r <= n:
if r == n:
yield 1
else:
x = r
a = False
while x < n:
a = not a
if a:
yield r
else:
x += 1
yield x
r += 1
"""
1 2 | 2
1 2 1 3 | 4
2 3 | 6
1 2 1 3 1 4 | 6
2 3 2 4 | 10
3 4 | 12
last = n * (n - 1)
"""
def get_seg(l, r, n):
start_row = b(l, n)
count_r = l - items(start_row - 1, n)
g = row_gen(start_row, n)
return it.islice(g, count_r - 1, count_r + r - l )
def pp(input):
T = int(input())
for i in range(T):
n, l, r = map(int, input().split())
print(" ".join(map(str, get_seg(l, r, n))))
if "paalto" in os.getcwd():
from string_source import string_source
pp(
string_source(
"""3
2 1 3
3 3 6
99995 9998900031 9998900031
"""
)
)
else:
pp(input)
| 10 | PYTHON3 |
#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";
}
}
| 10 | CPP |
#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";
}
}
| 10 | CPP |
from bisect import bisect_left, bisect_right
class Result:
def __init__(self, index, value):
self.index = index
self.value = value
class BinarySearch:
def __init__(self):
pass
@staticmethod
def greater_than(num: int, func, size: int = 1):
"""Searches for smallest element greater than num!"""
if isinstance(func, list):
index = bisect_right(func, num)
if index == len(func):
return Result(None, None)
else:
return Result(index, func[index])
else:
alpha, omega = 0, size - 1
if func(omega) <= num:
return Result(None, None)
while alpha < omega:
if func(alpha) > num:
return Result(alpha, func(alpha))
if omega == alpha + 1:
return Result(omega, func(omega))
mid = (alpha + omega) // 2
if func(mid) > num:
omega = mid
else:
alpha = mid
@staticmethod
def less_than(num: int, func, size: int = 1):
"""Searches for largest element less than num!"""
if isinstance(func, list):
index = bisect_left(func, num) - 1
if index == -1:
return Result(None, None)
else:
return Result(index, func[index])
else:
alpha, omega = 0, size - 1
if func(alpha) >= num:
return Result(None, None)
while alpha < omega:
if func(omega) < num:
return Result(omega, func(omega))
if omega == alpha + 1:
return Result(alpha, func(alpha))
mid = (alpha + omega) // 2
if func(mid) < num:
alpha = mid
else:
omega = mid
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------- fast io --------------------
from math import gcd, ceil
def pre(s):
n = len(s)
pi = [0] * n
for i in range(1, n):
j = pi[i - 1]
while j and s[i] != s[j]:
j = pi[j - 1]
if s[i] == s[j]:
j += 1
pi[i] = j
return pi
def prod(a):
ans = 1
for each in a:
ans = (ans * each)
return ans
def lcm(a, b): return a * b // gcd(a, b)
def binary(x, length=16):
y = bin(x)[2:]
return y if len(y) >= length else "0" * (length - len(y)) + y
bs = BinarySearch()
for _ in range(int(input()) if True else 1):
n, l, r = map(int, input().split())
#a, b = map(int, input().split())
#c, d = map(int, input().split())
#a = list(map(int, input().split()))
#b = list(map(int, input().split()))
#s = input()
#print("YES" if s else "NO")
a = [0]
total = 0
for i in range(n-1, 0, -1):
total += 2*i
a += [total]
ans = []
for i in range(l, r+1):
if i == n ** 2 - n + 1:
ans += [1]
else:
index = bs.less_than(i, a).index
position = (i - a[index]) // 2
if i % 2:
ans += [index+1]
else:
ans += [index + 1 + position]
print(*ans) | 10 | PYTHON3 |
from math import floor
T = int(input())
for _ in range(T):
n, l, r = map(int, input().split())
o_r = r
ans = []
if l == n * (n - 1) + 1:
print(1)
continue
i = 1
while l > 0:
if l <= 2 * (n - i):
for j in range(i + 1, n + 1):
l -= 1
r -= 1
if l <= 0 and r >= 0:
ans.append(i)
l -= 1
r -= 1
if l <= 0 and r >= 0:
ans.append(j)
else:
l -= 2 * (n - i)
r -= 2 * (n - i)
i += 1
while r > 0 and i < n:
for j in range(i + 1, n + 1):
r -= 1
if r >= 0:
ans.append(i)
r -= 1
if r >= 0:
ans.append(j)
i += 1
if r > 0:
ans.append(1)
print(' '.join(list(map(str, ans))))
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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);
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
import io,os
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
import sys
def query(n,l,r):
begin=1
while l>(n-begin)*2+1:
if begin==n:
break
l-=(n-begin)*2
r-=(n-begin)*2
begin+=1
Ans=[]
ans_l=0
while ans_l<=r:
if begin==n:
Ans.append(1)
break
for j in range(begin+1,n+1):
Ans.append(begin)
Ans.append(j)
ans_l+=(n-begin)*2
begin+=1
return Ans[l-1:r]
def main():
t=int(input())
for _ in range(t):
n,l,r=map(int,input().split())
Ans=query(n,l,r)
sys.stdout.write(' '.join(map(str,Ans))+'\n')
if __name__=='__main__':
main() | 10 | PYTHON3 |
# from debug import debug
t = int(input())
for ii in range(t):
n, l, r = map(int, input().split())
s = []
count = 1
ans = count*(2*(n-1) + 1- count)
while ((n-count)>0 and ans<l):
count+=1
ans = count*(2*(n-1) + 1- count)
count-=1
remain = l-count*(2*(n-1) + 1- count)-1
val = 0
b = 0
for i in range(count, n):
for j in range(i+1, n):
s.append(i+1)
s.append(j+1)
val+=2
if val>r-l+remain+1:
b = 1
break
if b:
break
s.append(1)
q = s[remain:r-l+1+remain]
for i in range(len(q)-1):
print(q[i], end=" ")
print(q[-1])
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
import math
import sys
from collections import defaultdict,Counter,deque,OrderedDict
import bisect
#sys.setrecursionlimit(1000000)
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: map(int,input().split())
alele = lambda: list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
#def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
#INF = 10 ** 18
#MOD = 1000000000 + 7
from itertools import accumulate,groupby
for _ in range(int(input())):
n,l,r = ilele()
z = n*(n-1)+ 1
if (l==r and l == z) or (r==1) :
print(1)
continue
k = n-1;tot = 0;f=0
while tot < l and k>0:
f+=1
tot += 2*k
k-=1
#print(f,tot)
tot -= 2*(k+1)
tot += 1
Ans = []
g=0;C=[];m=0;h = f+1;i=tot
while i<r+1 and i<z :
if g==0:
if i==l:
g=1
if m%2==0:
C.append(f)
else:
if h<n:
C.append(h)
h+=1
else:
C.append(h)
f+=1
h = f+1
if g==1:
Ans.append(C[-1])
elif g==1:
if m%2==0:
Ans.append(f)
else:
if h<n:
Ans.append(h)
h+=1
else:
Ans.append(h)
f+=1
h = f+1
m+=1
i+=1
if r==z:
Ans.append(1)
#print(C,Ans)
print(*Ans)
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
def f(n, k):
return n * k - k + n * k - k * k
def af(n, p):
if p == n * (n - 1):
return 1
l = 0
r = n + 1
while r - l > 1:
m = (l + r) // 2
if f(n, m) <= p:
l = m
else:
r = m
if (p - f(n, l)) % 2 == 0:
return r
return (p - f(n, l) + 1) // 2 + r
t = int(input())
for i in range(t):
n, l, r = map(int, input().split())
z = []
for j in range(l - 1, r):
z.append(af(n, j))
print(*z)
| 10 | PYTHON3 |
#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;
}
| 10 | CPP |
def ss(a,d,n):
return n*(2*a+(n-1)*d)//2
T = int(input())
for loop in range(T):
n,l,r = map(int,input().split())
ans = []
lb = 0
rb = n-1
while rb - lb != 1:
m = (lb+rb) // 2
if ss(2*n-2,-2,m) >= l:
rb = m
else:
lb = m
BB = rb
ind = ss(2*n-2,-2,rb-1) + 1
inind = BB+1
state = 0
while ind <= r:
#print (ind,BB,inind)
now = 0
if state == 0:
now = BB
state = 1
else:
now = inind
inind += 1
state = 0
if inind == n+1:
BB += 1
inind = BB+1
if ind == ss(2*n-2,-2,n-1) + 1:
ans.append(1)
break
if ind >= l:
ans.append(now)
ind += 1
print (*ans)
| 10 | PYTHON3 |
import sys
import io, os
def main():
input=sys.stdin.readline
t=int(input())
for i in range(t):
n,l,r=map(int,input().split())
end=[]
start=(n-1)*2
copy=0
count,ok=0,True
for i in range(1,n+1):
if (count+start)<l:
count+=start
copy+=start
start-=2
else:
pq=count
for j in range(i+1,n+1):
end.append(i)
end.append(j)
pq+=2
count=pq
if pq>=r:
ok=False
break
if ok==False:
break
if r==n*(n-1)+1:
end.append(1)
#print(end,copy)
ans=' '.join(map(str,end[l-copy-1:r-copy]))
sys.stdout.write(ans+'\n')
if __name__ == "__main__":
main()
| 10 | PYTHON3 |
def calcStartIndex(vertex,n):
i=vertex
return 1+2*(i-1)*n-i*i+i
def main():
t=int(input())
allans=[]
for _ in range(t):
n,l,r=readIntArr()
startVertex=1
b=n
while b>0:
while startVertex+b<=n and calcStartIndex(startVertex+b,n)<=l:
startVertex+=b
b//=2
sv=startVertex
idx=calcStartIndex(sv,n)
ans=[]
adder=1
addTurn=False
while idx<=r:
#sv,sv+1,sv,sv+2,...sv,n. then sv+=1. if sv==n, then put 1 instead of sv
if addTurn:
curr=sv+adder
adder+=1
else:
curr=sv
if idx>=l:
if sv<n:
ans.append(curr)
else:
ans.append(1)
addTurn=not addTurn
idx+=1
if curr==n:
sv+=1
adder=1
addTurn=False
allans.append(ans)
multiLineArrayOfArraysPrint(allans)
return
#import sys
#input=sys.stdin.buffer.readline #FOR READING PURE INTEGER INPUTS (space separation ok)
import sys
input=lambda: sys.stdin.readline().rstrip("\r\n") #FOR READING STRING/TEXT INPUTS.
def oneLineArrayPrint(arr):
print(' '.join([str(x) for x in arr]))
def multiLineArrayPrint(arr):
print('\n'.join([str(x) for x in arr]))
def multiLineArrayOfArraysPrint(arr):
print('\n'.join([' '.join([str(x) for x in y]) for y in arr]))
def readIntArr():
return [int(x) for x in input().split()]
inf=float('inf')
MOD=10**9+7
main() | 10 | PYTHON3 |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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";
}
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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;
}
| 10 | CPP |
#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");
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
long long size = (r - l) + 1;
l--;
r--;
long long curr = 0;
long long startVer = 1;
while (curr - 1 < l) {
if (startVer == n)
curr++;
else
curr += (n - startVer) * 2;
startVer++;
}
startVer--;
long long start = startVer - 1;
long long sub = 0;
for (int i = 0; i < start; i++) {
sub += (n - (i + 1)) * 2;
}
vector<long long> v;
long long ver = startVer;
long long con = ver + 1;
for (int i = 0; i <= r - sub + 1; i++) {
if (ver == n) {
v.push_back(1);
break;
}
if (i % 2 == 0) {
v.push_back(ver);
} else {
v.push_back(con);
con++;
if (con == n + 1) {
ver++;
con = ver + 1;
}
}
}
l -= sub;
r -= sub;
for (int i = 0; i < v.size(); i++) {
if (i >= l && i <= r) cout << v[i] << " ";
}
cout << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, l, r, curr;
void solve(long long depth = 0) {
if (depth == n) {
if ((curr <= r)) cout << 1 << " ";
return;
}
if ((curr + 2 * (n - depth - 1) - 1) < l) {
curr += 2 * (n - depth - 1);
solve(depth + 1);
return;
} else if ((curr > r)) {
return;
} else {
for (int i = 1; i <= 2 * (n - depth - 1); i++) {
if ((curr >= l) && (curr <= r)) {
if (curr % 2) {
cout << (1 + depth) << " ";
} else {
cout << (i / 2) + depth + 1 << " ";
}
}
curr++;
}
solve(depth + 1);
return;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
curr = 1;
cin >> n >> l >> r;
solve();
cout << endl;
}
return 0;
}
| 10 | CPP |
for _ in range(int(input())):
n, l, r = map(int, input().split())
x = 0
off = 0
for i in range(1, n+1):
if x + 2 * (n-i) >= l:
off = l-x-1
break
x += 2 * (n-i)
series = []
while len(series) < (r-l+1) + off:
for j in range(i+1, n+1):
series.append(i)
series.append(j)
i += 1
if i >= n:
series.append(1)
break
print (' '.join(list(map(str, series[off:off+r-l+1]))))
| 10 | PYTHON3 |
import sys
input = sys.stdin.buffer.readline
def prog():
for _ in range(int(input())):
n,l,r = map(int,input().split())
l -= 1
r -= 1
a = 1
new = 2*(n-a)
while new < l:
l -= new
r -= new
a += 1
new = 2*(n-a)
total = new - l - (2*(n-a))
if l == 0 and a == 1:
segment = [1]
l += 1
r += 1
else:
segment = []
while total < r and a <= n:
segment_a = []
for i in range(1+a,n):
segment_a.extend([i,a])
if n > 1+a:
segment_a.extend([n,1+a])
segment.extend(segment_a)
total += 2*(n-a)
a += 1
if a == n+1 or n == 2:
segment.extend([n,1])
sys.stdout.write(' '.join(map(str,segment[l-1:r])) + '\n')
prog()
| 10 | PYTHON3 |
import sys
input = sys.stdin.readline
for t in range(int(input())):
n, l, r = map(int, input().split(" "))
startSection = 2*(n-1)
startCount = 1
while(l>startSection):
startCount = startCount + 1
if(startCount<n):
startSection = startSection+2*(n-startCount)
else:
startSection = startSection + 1
#print(startSection)
endCount = startCount
endSection = startSection
while(r>endSection):
endCount = endCount + 1
if(endCount<n):
endSection = endSection+2*(n-endCount)
else:
endSection = endSection + 1
l = l - startSection+2*(n-startCount)-1
r = r - startSection+2*(n-startCount)
if(r==0):
r = r+1
string = []
#print(startCount)
#print(endCount)
for go in range(startCount, endCount+1):
for k in range(n-go):
string.append(go)
string.append(k+1+go)
string.append(1)
ans = list(map(str, string[l:r]))
print(' '.join(ans))
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long md = 1e9 + 7;
const int xn = -20 + 10;
const int xm = 2e1 + 10;
const int SQ = 450;
const int sq = 1e3 + 10;
const int inf = 1e9 + 10;
const long long INF = 1e18 + 10;
long long power(long long a, long long b) {
return (!b ? 1
: (b & 1 ? a * power(a * a % md, b / 2) % md
: power(a * a % md, b / 2) % md));
}
long long zarb(long long a, long long b) { return (a * b + 10 * md) % md; }
long long jaam(long long a, long long b) { return (a + b + 10 * md) % md; }
long long qq, n, l, r;
vector<int> vec;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> qq;
while (qq--) {
cin >> n >> l >> r;
vec.clear();
long long ptr = 2 * n - 2, sum = 0;
for (long long i = 1; i <= n; i++) {
if (l <= sum + n + n - i - i) {
ptr = i;
break;
}
sum += n + n - i - i;
}
long long gir = 0;
long long L = l;
gir = (l - sum + 1) / 2 + ptr;
long long last = sum;
for (long long i = l; i <= r; i++) {
if (i > n * (n - 1)) {
vec.push_back(1);
break;
}
if ((i - last) % 2 == 1) vec.push_back(ptr);
if ((i - last) % 2 == 0) vec.push_back(gir++);
if (gir > n) {
gir = ptr + 2;
sum += n + n - ptr - ptr - 2;
ptr++;
last = sum;
}
}
for (int x : vec) cout << x << ' ';
cout << '\n';
}
return 0;
}
| 10 | CPP |
t = int(input())
for i in range(t):
n, l, r = map(int, input().split())
if (l == n * (n - 1) + 1):
print(1)
continue
left, right, summ = 0, n, 0
while (left != right - 1):
mid = (left + right) // 2;
tmp = n * mid - (mid * (mid + 1) // 2)
if (2 * tmp < l):
left = mid
summ = 2 * tmp
else:
right = mid
#print(left, right)
beg = summ
count = left + 1
ans = []
ind = False
for i in range(count, n):
for j in range(i + 1, n + 1):
ans.append(i)
ans.append(j)
summ += 2
if (summ > r):
ind = True
break
if (ind):
break
ans.append(1);
for i in range(l - 1, r):
print(ans[i - beg], end = " ")
print() | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::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 idx = 1;
bool p = false;
bool end = false;
for (long long i = 1; i <= n - 1; i++) {
if (idx + 2 * (n - i) < l) {
idx += 2 * (n - i);
continue;
}
long long start = 0;
if (!p) {
start = l - idx;
idx += start;
p = true;
}
for (long long j = start; j < 2 * (n - i); j++) {
if (idx <= r) {
if (j % 2 == 0)
cout << i << " ";
else
cout << i + j / 2 + 1 << " ";
cout << endl;
} else {
end = true;
break;
}
idx++;
}
if (end) break;
}
if (r == n * (n - 1) + 1) cout << "1";
cout << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double PI = 4 * atan(1);
const long long INF = 1e18;
const int MX = 100001;
int T, n;
long long l, r;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> T;
while (T--) {
cin >> n >> l >> r;
long long first_elt = 1;
long long num_visited = 0;
long long length = 2 * (n - 1);
while (num_visited + length < l) {
num_visited += length;
length -= 2;
first_elt++;
if (first_elt == n) {
length = 1;
}
}
vector<int> ans;
int remaining = r - num_visited;
while (ans.size() < remaining) {
if (first_elt == n) {
ans.push_back(1);
break;
}
for (int i = first_elt + 1; i <= n; i++) {
ans.push_back(first_elt);
ans.push_back(i);
}
first_elt++;
}
for (long long i = 0; i < (long long)ans.size(); i++) {
long long perm_index = num_visited + i + 1;
if (perm_index >= l && perm_index < r) {
cout << ans[i] << " ";
}
if (perm_index == r) {
cout << ans[i] << "\n";
}
}
}
}
| 10 | CPP |
import sys
input=sys.stdin.readline
t=int(input())
for _ in range(t):
n,l,r=map(int,input().split())
begin=1
while l>(n-begin)*2+1:
if begin==n:
break
l-=(n-begin)*2
r-=(n-begin)*2
begin+=1
if begin==n:
ans=[n,1]
else:
ans=[]
while len(ans)<=r:
if begin==n:
ans.append(1)
break
for j in range(begin+1,n+1):
ans.append(begin)
ans.append(j)
begin+=1
print(*ans[l-1:r]) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template <typename T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <typename T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
ll S(ll n, ll k) { return 2 * (n - k); }
void solve() {
int T;
cin >> T;
for (ll(q) = (1); (q) <= (T); (q)++) {
ll n, l, r;
cin >> n >> l >> r;
ll length = r - l + 1;
ll lk;
for (ll(k) = (1); (k) <= (n - 1); (k)++) {
if (l - S(n, k) > 0)
l -= S(n, k), r -= S(n, k);
else {
lk = k;
break;
}
}
vector<ll> res;
{
res.push_back(0);
ll i = 0;
for (ll(k) = (lk); (k) <= (n - 1); (k)++) {
for (ll(j) = (k + 1); (j) <= (n); (j)++) {
res.push_back(k);
i++;
if (i == r) goto hoge;
res.push_back(j);
i++;
if (i == r) goto hoge;
}
}
if (i < r) res.push_back(1), i++;
hoge:
assert(i == r);
}
for (ll(i) = (l); (i) <= (r); (i)++) {
cout << res[i] << (i < r ? " " : "\n");
}
}
return;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
return 0;
}
| 10 | CPP |
for f in range(int(input())):
n,l,r=map(int,input().split())
s=[0]*(r-l+1)
i=1
p=1
t=2*n-((2*n)**2-4*l)**0.5
t=t/2
t=int(t)
t-=1
if t>0:
p=2*(t*n-(t*(t+1))//2)
p+=1
i+=t
while p+2*(n-i)<=l and i<n:
p+=2*(n-i)
i+=1
j=i+1
while p+2<=l:
p+=2
j+=1
sm=1
if p<l:
sm=0
for foo in range(r-l+1):
if sm==1:
s[foo]=i
sm=0
else:
s[foo]=j
j+=1
sm=1
if j==n+1:
i+=1
j=i+1
if r==n*(n-1)+1:
s[r-l]=1
print(*s) | 10 | PYTHON3 |
import sys
input = sys.stdin.buffer.readline
from bisect import bisect_left
T = int(input())
for _ in range(T):
n, l, r = map(int, input().split())
ls = [ (n-u)*2 for u in range(n+1) ]
ls[0] = 1
for i in range(1, n+1):
ls[i] += ls[i-1]
p = bisect_left(ls, l)
sp = []
if p == 0:
sp = [0, 0, 0]
else:
d = l - ls[p-1]
sp = [p, p+(d+1)//2, 0 if d%2 else 1]
def getp(ls):
if ls[0] == 0 or ls == [n-1, n, 1]: return 1
elif ls[2] == 0: return ls[1]
elif ls[1] == n: return ls[0]+1
else: return ls[0]
def nextp(ls):
a, b, c = ls
if a == 0: return [1, 2, 0]
elif c == 0: return [a, b, 1]
elif b < n: return [a, b+1, 0]
else: return [a+1, a+2, 0]
res = []
for _ in range(r-l+1):
#print(sp)
res.append(getp(sp))
sp = nextp(sp)
print(' '.join(map(str, res))) | 10 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.