solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
for nt in range(int(input())):
n,a,b=map(int,input().split())
if n==2:
l=[1,2,1]
print (*l[a-1:b])
continue
k=n
prev=0
for j in range(a,b+1):
i=j-prev
while k>1:
if i<=2*(k-1):
if i%2:
print (n-k+1,end=" ")
else:
print (i//2+(n-k+1),end=" ")
break
else:
i-=2*(k-1)
prev+=2*(k-1)
k-=1
if k==1:
print (1,end=" ")
print () | 10 | PYTHON3 |
import sys
input = sys.stdin.buffer.readline
from bisect import bisect_left
Q = int(input())
Query = [list(map(int, input().split())) for _ in range(Q)]
B = [0]
for i in range(1, 2*10**5):
B.append(i*(i+1)//2)
def solve(n, N):
M = N*(N-1)
n %= M
if n%2 == 0:
rem = (M - n)//2
ind = bisect_left(B, rem)
return N-ind
else:
rem = (M - (n-1))//2
ind = bisect_left(B, rem)
seq = rem - ind*(ind-1)//2
return N - seq + 1
for N, L, R in Query:
ans = []
for n in range(L-1, R):
ans.append(str(solve(n, N)))
print(" ".join(ans)) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
vector<long long> pre(n + 1);
for (int i = 1; i <= n; i++) {
pre[i] = pre[i - 1] + 2 * (n - i);
}
pre[n]++;
for (long long i = l; i <= r; i++) {
int pos = lower_bound(pre.begin(), pre.end(), i) - pre.begin();
if (pos == n)
cout << "1"
<< " ";
else {
long long j = i - pre[pos - 1];
if (j % 2 == 1)
cout << pos << " ";
else
cout << (j / 2 + pos) << " ";
}
}
cout << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
long long s = 0;
long long i;
for (i = 1; i <= n - 1; i++) {
s += 2 * (n - i);
if (l <= s) {
s = s - 2 * (n - i);
break;
}
}
long long j, x = i;
if (x == n) x = 1;
if ((l - s) % 2 == 1) {
j = i + (l + 1 - s) / 2;
int f = 0;
for (long long v = l; v <= r; v++) {
if (f == 0) {
cout << x << " ";
f = 1;
} else {
cout << j << " ";
j++;
f = 0;
if (j == n + 1) {
x++;
if (x == n) x = 1;
j = x + 1;
}
}
}
} else {
j = i + (l - s) / 2;
int f = 1;
for (long long v = l; v <= r; v++) {
if (f == 0) {
cout << x << " ";
f = 1;
} else {
cout << j << " ";
j++;
f = 0;
if (j == n + 1) {
x++;
if (x == n) x = 1;
j = x + 1;
}
}
}
}
cout << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, l, r;
cin >> n >> l >> r;
if (l == n * (n - 1LL) + 1LL) {
cout << 1 << '\n';
return;
}
long long suma = 0LL;
long long trenutni = (long long)n - 1LL;
while (trenutni > 0) {
if (suma + 2 * trenutni >= l) break;
suma += 2 * trenutni;
--trenutni;
}
trenutni = (n - trenutni);
long long sledeci = trenutni;
for (long long i = suma + 1; i <= r; ++i) {
if (i == n * (n - 1) + 1) {
cout << 1 << ' ';
cout << '\n';
return;
}
if (i % 2 == 1) {
++sledeci;
}
if (i >= l) {
if (i % 2)
cout << trenutni << ' ';
else
cout << sledeci << ' ';
}
if (sledeci == n && i % 2 == 0) sledeci = ++trenutni;
}
cout << '\n';
}
int main() {
int t;
cin >> t;
while (t--) solve();
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007, N = 1e5 + 5, M = 1e5 + 5, INF = 0x3f3f3f3f;
long long powmod(long long a, long long b) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
long long n, l, r;
cin >> n >> l >> r;
if (l == r && l == n * (n - 1) + 1) {
cout << 1 << endl;
continue;
}
int nowx = 1, nowy = 2;
long long sum = 0;
while (sum < l) {
sum += 2 * (n - nowx);
++nowx;
}
--nowx;
sum -= 2 * (n - nowx);
++sum;
vector<int> ans;
nowy = nowx + 1;
int di = 1;
int cnt = sum;
while (sum <= r) {
if (di)
ans.push_back(nowx);
else {
ans.push_back(nowy);
++nowy;
if (nowy > n) {
nowx++;
nowy = nowx + 1;
if (nowx > n) nowx = 1;
}
}
++sum;
di ^= 1;
}
if (r == n * (n - 1) + 1) ans[ans.size() - 1] = 1;
cout << ans[l - cnt];
for (long long i = l - cnt + 1; i <= r - cnt; ++i) cout << ' ' << ans[i];
cout << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxc = 1e5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
long long k = 0;
long long n, l, r;
cin >> n >> l >> r;
for (long long i = 2 * (n - 1); i; k += i, i -= 2) {
for (long long j = max(l, k + 1); j <= min(r, k + i); j++) {
if (j % 2)
cout << n - i / 2 << " ";
else
cout << n - i / 2 + (j - k) / 2 << " ";
}
}
if (k + 1 == r) cout << 1;
cout << endl;
}
return 0;
}
| 10 | CPP |
import math
import sys
# input = sys.stdin.readline
T=int(input())
for _ in range(T):
n,l,r=map(int,input().split())
size=r-l+1
run=0
ans=[]
for i in range(1,n):
run+=2*(n-i)
# print(run)
if l<=run:
prev=run-2*(n-i)
gone=l-prev-1
size+=gone
# print(gone)
cur=0
now=i
nex=i+1
flag=True
while cur<size:
if flag:
if gone>0:
gone-=1
else:
ans.append(now)
flag=False
else:
if gone>0:
gone-=1
else:
ans.append(nex)
nex+=1
if nex>n:
now+=1
nex=now+1
flag=True
cur+=1
break
if len(ans)==0:
ans.append(1)
if r==n*(n-1)+1:
ans[-1]=1
print(*ans) | 10 | PYTHON3 |
from sys import stdin, stdout
import math
def expandList(i,n):
if i!=n:
out = []
for j in range(n-i):
out.append(i)
out.append(i+j+1)
return out
else:
return [1]
T = int(stdin.readline().rstrip())
for iTest in range(T):
n,l,r = list(map(int,stdin.readline().rstrip().split(' ')))
listSizes = [2*i for i in range(n-1,-1,-1)]
listSizes[n-1] = 1
found = False
a = 0
i=1
while l>a+listSizes[i-1]:
a+=listSizes[i-1]
i+=1
listi = expandList(i,n)
ind = l-a-1
startList = listi[ind:]
while r>a+listSizes[i-1]:
a+=listSizes[i-1]
i+=1
startList+=expandList(i,n)
endList = expandList(i+1,n)
startList += endList
startList = startList[:r-l+1]
print(' '.join([str(x) for x in startList])) | 10 | PYTHON3 |
# import sys
# _INPUT_LINES = sys.stdin.read().splitlines()
# input = iter(_INPUT_LINES).__next__
def go():
# n=int(input())
n,l,r = map(int, input().split())
# a = sorted(map(int, input().split()),reverse=True)
tot = n*(n-1)+1
add=[]
if r==tot:
add=['1']
r-=1
res=[]
if l<=r:
cur=0
nextg=n-1
while cur+2*nextg<l:
cur+=2*nextg
nextg-=1
g=n-nextg
shift=l-cur-1
pair,par = divmod(shift,2)
pair+=g+1
while l<=r:
if par==0:
res.append(g)
par+=1
else:
res.append(pair)
par=0
if pair<n:
pair+=1
else:
g+=1
pair=g+1
l+=1
res = res+add
return ' '.join(map(str,res))
# x,s = map(int,input().split())
t = int(input())
# t = 1
ans = []
for _ in range(t):
# print(go())
ans.append(str(go()))
#
print('\n'.join(ans))
| 10 | PYTHON3 |
import sys
def data(): return sys.stdin.buffer.readline().strip()
out=sys.stdout.write
def mdata(): return map(int, data().split())
for t in range(int(data())):
n,l,r=mdata()
a=l
for i in range(1,n+1):
if 2*(n-i)<=a:
a-=2*(n-i)
else:
break
cnt=l
ans=[]
if l%2==0:
if a==0:
ans.append(str(n))
else:
ans.append(str(i+a//2))
cnt+=1
k=i+a//2+1
for j in range(i,n):
while cnt<=r:
ans.append(str(j))
cnt+=1
if cnt>r:
break
ans.append(str(k))
k+=1
cnt+=1
if k==n+1:
k=j+2
break
if r==n*(n-1)+1:
ans.append(str(1))
out(' '.join(ans)+'\n')
| 10 | PYTHON3 |
T = int(input().strip())
for t in range(T):
n, l, r = map(int, input().strip().split())
if l == n*(n-1)+1:
print(1)
continue
k = int((2*n-1-((2*n-1)**2-4*l)**0.5)/2)
if l <= 2*k*n- k*(k+1): k -= 1
if l > 2*(k+1)*n - (k+1)*(k+2): k += 1
m = 2*k*n - k*(k+1)
s = []
k += 1
j = (l-m-1)//2 + k
while l<=r:
if l%2 == 1:
if k==n: s.append(1)
else: s.append(k)
else:
j += 1
s.append(j)
if j == n:
k += 1
j = k
l += 1
print(" ".join(map(str, s)))
| 10 | PYTHON3 |
from sys import *
t = int(stdin.readline())
import math
for _ in range(t):
n,l,r = list(map(int,stdin.readline().split(' ')))
if(l == n*n-n+1):
print('1')
continue
k = math.ceil(((2*n-1) - math.sqrt((2*n-1)**2 - 4*l))/2)
s = k*(2*n-1 -k)
sl = 2*(n-k)
lb = k
eb = k+1+math.ceil((l-s+sl)/2)-1
while(l <= r):
if(l == n*n-n+1):
break
if(l%2 == 0):
stdout.write(str(eb)+' ')
eb = eb+1
if(eb > n):
lb = lb+1
eb = lb+1
else:
stdout.write(str(lb)+' ')
l = l+1
if(r == n*n-n+1):
stdout.write('1')
stdout.write('\n') | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct R {
long long int nd, i;
};
int main() {
long long int n, l, r, st;
scanf("%*d");
while (~scanf("%lld %lld %lld", &n, &l, &r)) {
long long int p, i, j, nd;
vector<R> v;
v.push_back({1, 1});
for (p = 1, i = 2, j = n - 1; i < n; i++, j--) v.push_back({i, p += j + j});
long long int st = 0, en = v.size() - 1, md, pos = -1;
while (st <= en) {
md = (st + en) / 2;
if (v[md].i > l)
en = md - 1;
else {
pos = max(pos, md);
st = md + 1;
}
}
vector<R> pet;
for (nd = v[pos].nd, i = v[pos].i; i <= r && nd < n; nd++) {
for (j = nd + 1; j <= n && i <= r; j++)
pet.push_back({nd, i++}), pet.push_back({j, i++});
}
if (nd == n) pet.push_back({1, i++});
for (auto it : pet)
if (it.i >= l && it.i <= r) printf("%lld ", it.nd);
puts("");
}
return 0;
}
| 10 | CPP |
# |
# _` | __ \ _` | __| _ \ __ \ _` | _` |
# ( | | | ( | ( ( | | | ( | ( |
# \__,_| _| _| \__,_| \___| \___/ _| _| \__,_| \__,_|
import sys
import collections
def read_line():
return sys.stdin.readline()[:-1]
def read_int():
return int(sys.stdin.readline())
def read_int_line():
return [int(v) for v in sys.stdin.readline().split()]
t = read_int()
for i in range(t):
n,l,r = read_int_line()
u = r-l+1
lt = l
k = n
while lt>0 and k>0:
k-=1
lt -= 2*(k)
lt += 2*(k)
k = n-k
j= max(k,1)
s = 0
for i in range(1,j):
s += 2*(n-i)
lt = l
lt -= s
lt += 1
i = j + lt//2
ans = []
if l%2==0:
ans.append(i)
i+=1
while j<=n and len(ans)<=u:
if j!=k:
i = j+1
while i<=n and len(ans)<=u:
ans.append(j)
ans.append(i)
i+=1
j+=1
ans.append(1)
print(*ans[:u]) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 300010;
long long t, n, a[N], b[N], x[N];
int main() {
scanf("%lld", &t);
while (t--) {
long long l, r;
scanf("%lld", &n);
scanf("%lld%lld", &l, &r);
long long tot = r - l + 1;
long long high = n - 1, low = 1, mid, s = -1;
while (high >= low) {
mid = (high + low) / 2;
long long c = (2 * ((mid * n) - (mid * (mid + 1)) / 2));
if (c >= l) {
s = mid;
high = mid - 1;
} else {
low = mid + 1;
}
}
if (s == -1) {
printf("1\n");
continue;
}
long long ps = s - 1, pre = (2 * ((ps * n) - (ps * (ps + 1)) / 2));
long long pos = l - pre;
while (tot > 0 && s < n) {
long long len = (2 * (n - s));
while (tot > 0 && pos <= len) {
if (pos % 2)
printf("%lld ", s);
else {
printf("%lld ", s + (pos / 2));
}
pos++;
tot--;
}
if (tot > 0) {
pos = 1;
s++;
}
}
if (tot) printf("1 ");
printf("\n");
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> func(int n, long long l, long long r) {
long long start = 1;
long long end = 2 * 1ll * (n - 1);
vector<int> ans;
if (start <= l && l <= end) {
while (l <= r && l <= end) {
if (l % 2 == 1) {
ans.push_back(1);
} else {
ans.push_back(l / 2 + 1);
}
l++;
}
}
for (int i = 2; i < n; ++i) {
if (i == n - 1) {
start = end + 1;
end = start + 1;
if (start <= l && l <= end) {
while (l <= r && l <= end) {
if (start == l) {
ans.push_back(n - 1);
} else {
ans.push_back(n);
}
l++;
}
}
} else {
long long tmp_start = end;
start = end + 1;
end = start + 2 + (n - i - 1) * 1ll * 2;
end = end - 1;
if (start <= l && l <= end) {
while (l <= r && l <= end) {
int ref_value = l - tmp_start;
if (ref_value == 1) {
ans.push_back(i);
} else if (l != end) {
if (ref_value % 2 == 0) {
ans.push_back(i + ref_value / 2);
} else {
ans.push_back(i);
}
} else {
ans.push_back(n);
}
l++;
}
}
}
}
start = end + 1;
end = end + 1;
if (start <= l && l <= end) {
while (l <= r && l <= end) {
ans.push_back(1);
l++;
}
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int tt;
cin >> tt;
while (tt--) {
int n;
long long l, r;
cin >> n >> l >> r;
vector<int> v = func(n, l, r);
for (int x : v) {
cout << x << " ";
}
cout << endl;
}
return 0;
}
| 10 | CPP |
# problem 2
def calc(N, index):
# find the number when given (N,index)
if index == 1 or index == N*(N-1)+1:
return 1
else:
wave_l = 1
wave_r = N
while wave_r-wave_l > 1:
M = (wave_l+wave_r)//2
if (2*N-M)*(M-1) < index:
wave_l = M
else:
wave_r = M
wave = wave_l
Left = index-(2*N-wave)*(wave-1)
if Left % 2 != 0:
return wave
else:
return wave+Left//2
# maximum value := cnt
Left = index-(cnt-1)*(cnt-2)
if Left % 2 == 0:
return cnt
else:
if cnt != Left//2+1:
return Left//2+1
else:
return 1
def solve():
n, l, r = map(int, input().split())
A = []
for i in range(l, r+1):
A.append(calc(n, i))
print(*A)
def main():
T = int(input())
for i in range(T):
solve()
if __name__ == "__main__":
main() | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int N = 2e5 + 2;
int main() {
int t;
scanf("%d", &t);
while (t--) {
long long n, l, r;
scanf("%lld", &n);
scanf("%lld", &l);
scanf("%lld", &r);
long long cur = 0, val = 2 * (n - 1), ind = 1;
while (cur + val < l) {
cur += val;
val /= 2;
val--;
val *= 2;
ind++;
if (ind == n) val = 1;
}
long long total = n * (n - 1) + 1;
long long ptr = cur + 1;
long long x = ind, y = x + 1;
vector<pair<long long, long long> > v;
while (ptr <= r) {
if (ptr == total) {
v.push_back({1, ptr});
break;
}
v.push_back({x, ptr});
v.push_back({y, ptr + 1});
ptr += 2;
y++;
if (y > n) {
x++;
y = x + 1;
if (x == n) {
v.push_back({1, ptr});
break;
}
}
}
for (auto i : v)
if (i.second >= l && i.second <= r) printf("%d ", (int)i.first);
printf("\n");
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, t, l, r, o, e, pos;
long long Find(long long k) {
long long t = k;
if (t % 2 == 1)
t = (t + 1) / 2;
else
t /= 2;
for (long long i = 0; i <= n - 1; i++) {
if (n * i - i * (i + 1) / 2 < t && t <= n * (i + 1) - (i + 1) * (i + 2) / 2)
return i + 1;
}
}
int main() {
scanf("%lld", &t);
while (t--) {
scanf("%lld%lld%lld", &n, &l, &r);
if (l % 2 == 0) {
o = l + 1;
e = l + 2;
pos = Find(l);
} else {
o = l;
e = l + 1;
}
long long s1 = Find(o);
long long cnt = Find(e);
long long s2 = e / 2 - ((cnt - 1) * n - (cnt - 1) * cnt / 2) + cnt;
if (l % 2 == 0) {
printf("%lld ", l / 2 - ((pos - 1) * n - (pos - 1) * pos / 2) + pos);
}
for (long long i = o; i <= r; i++) {
if (i == n * (n - 1) + 1) {
printf("1");
break;
}
if (i % 2) {
printf("%lld ", s1);
if (s2 == n) s1++;
} else {
printf("%lld ", s2);
s2++;
if (s2 > n) s2 = s1 + 1;
}
}
puts("");
}
return 0;
}
| 10 | CPP |
import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
n, l, r = map(int, input().split())
s = 1
while l > (n-s)*2:
if s == n:
break
l -= (n-s)*2
r -= (n-s)*2
s += 1
#print(s, l, r)
ans = []
while len(ans) <= r:
if s == n:
ans.append(1)
break
for j in range(s+1, n+1):
ans.append(s)
ans.append(j)
s += 1
print(*ans[l-1:r])
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename S, typename T>
ostream& operator<<(ostream& out, pair<S, T> const& p) {
out << '(' << p.first << ", " << p.second << ')';
return out;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T> const& v) {
long long l = v.size();
for (long long i = 0; i < l - 1; i++) out << v[i] << ' ';
if (l > 0) out << v[l - 1];
return out;
}
template <typename T>
void trace(const char* name, T&& arg1) {
cout << name << " : " << arg1 << '\n';
}
template <typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
trace(comma + 1, args...);
}
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const double EPS = 1e-9;
const long long N = 500005;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long r) {
uniform_int_distribution<long long> uid(l, r);
return uid(rng);
}
long long n, l, r;
void solve(long long x) {
cin >> n >> l >> r;
long long num = 0;
long long toadd = n - 1;
long long vert = 1;
long long to = 2;
vector<long long> ans;
for (long long i = 0; i < n - 1; i++) {
if (2 * (num + toadd) >= l) {
long long left = 2 * num + 1;
long long i = 0;
to = vert + 1;
while (left <= r and left <= n * (n - 1)) {
if (i % 2 == 0) {
if (left >= l) {
ans.push_back(vert);
}
} else {
if (left >= l) {
ans.push_back(to);
}
to++;
if (to > n) {
vert++;
to = vert + 1;
}
}
left++;
i++;
}
break;
}
num += toadd;
toadd--;
vert++;
}
long long last = (n * (n - 1)) + 1;
if (r == last) {
ans.push_back(1);
}
for (long long i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout.precision(12);
long long t;
cin >> t;
long long i = 0;
while (i < t) {
solve(i + 1);
i++;
}
}
| 10 | CPP |
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")
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 Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10**9+7
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
for _ in range(int(ri())):
n,l,r = Ri()
l-=1;r-=1
cnt = (r-l+1)
i = 0;flag = False
for i in range(n):
if l > 2*(n-i-1) : l-=(n-i-1)*2
else : flag = True; break
if flag :
ans = []
sta = -1;nex = -1
if l%2 == 1:
ans.append(i + l//2+1)
cnt-=1
sta = i
nex = i + l//2+2
else:
sta = i
nex = i + l//2 + 1
if nex >= n: sta+=1; nex = sta+1
if sta >= n-1: ans.append(0);cnt =0
while cnt > 0:
ans.append(sta);cnt-=1
if cnt > 0: ans.append(nex); cnt-=1
if cnt == 0:
break
nex+=1
if nex >= n: sta+=1; nex = sta+1
if sta >= n-1: ans.append(0);cnt =0
ans = [i+1 for i in ans]
print(*ans)
| 10 | PYTHON3 |
import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
n, l, r = map(int, input().split())
s = 1
while l > (n-s)*2+1:
if s == n:
break
l -= (n-s)*2
r -= (n-s)*2
s += 1
#print(s, l, r)
if s == n:
ans = [n, 1]
else:
ans = []
while len(ans) <= r:
if s == n:
ans.append(1)
break
for j in range(s+1, n+1):
ans.append(s)
ans.append(j)
s += 1
print(*ans[l-1:r])
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int i, j, n, m, k;
long long int l, r;
cin >> n >> l >> r;
bool var1 = 0;
long long int var2 = 0, var = 0;
if (r == (n * (n - 1LL)) + 1LL) {
var1 = 1;
r--;
} else {
long long int o = 0;
while (o < 2) o++;
}
long long int o = 0;
for (i = 1; i <= n; i++) {
var2 += (n - i) * 2LL;
if (o == 1) {
o = 0;
} else if (var2 >= l) {
var2 -= (n - i) * 2LL;
var = i;
break;
} else {
o = 0;
}
}
var2 = l - var2;
long long int p = var2;
long long int var3 = 1;
var2 = (var + var2 / 2 + var2 % 2);
if (l <= r && (p % 2LL == 0)) {
cout << var2 << " ";
l++;
var2++;
} else {
o = 0;
}
o = 0;
while (l <= r && o == 0) {
if (var2 > n) {
var++;
var2 = var + 1;
}
if (o == 1)
o = 0;
else
o = 0;
if ((var3 % 2) == 1)
cout << var << " ";
else {
cout << var2 << " ";
var2++;
}
l++;
var3 = 1 - var3;
}
o = 1;
if (var1) cout << o << " ";
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int i, j, n, m, k;
long long int t;
cin >> t;
while (t--) {
solve();
}
}
| 10 | CPP |
def main():
t=int(input())
for _ in range(t):
n,l,r=map(int,input().split())
if l==n*n-n+1:
print(1)
continue
if r==n*n-n+1:
r_g=n
for i in range(n-1):
if l>2*n-2-2*i:
l-=2*n-2-2*i
else:
l_g=i+1
break
for i in range(n-1):
if r>2*n-2-2*i:
r-=2*n-2-2*i
else:
r_g=i+1
break
ans=[]
for i in range(l_g,min(r_g+1,n)):
for j in range(i+1,n+1):
ans.append(i)
ans.append(j)
if r_g==n:
ans.append(1)
if r_g==n or r==2*n-2*r_g:
print(*ans[l-1:])
else:
print(*ans[l-1:r+2*r_g-2*n])
if __name__ == '__main__':
main() | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 9;
int main() {
long long i, j, m, n, t, l, r, fir, sec;
scanf("%lld", &t);
while (t--) {
scanf("%lld %lld %lld", &n, &l, &r);
long long pos = 0;
for (i = 1; i <= n; i++) {
if (i == n) {
pos = -1;
break;
}
pos += (n - i) * 2;
if (pos >= l) {
pos -= (n - i) * 2 - 1;
fir = i;
break;
}
}
if (pos == -1) {
cout << 1 << endl;
continue;
}
long long dis = l - pos + 1;
sec = (dis + 1) / 2 + i;
while (l <= r) {
if (fir == n)
printf("%lld", 1ll);
else if (l % 2 == 1)
printf("%lld", fir);
else {
printf("%lld", sec++);
if (sec > n) {
fir++;
sec = fir + 1;
}
}
printf("%c", l == r ? '\n' : ' ');
l++;
}
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
const int inf1 = 1e9;
const long long int inf2 = 1e18;
const int N = 100000;
using namespace std;
int dirs[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int solve() {
long long int n, l, r;
cin >> n >> l >> r;
if (l == n * (n - 1) + 1) {
cout << 1 << "\n";
return 0;
}
long long int bl = 1;
bool f = false;
if (r == (n * (n - 1) + 1)) {
r--;
f = true;
}
long long int lo = 1;
long long int hi = n - 1;
while (lo <= hi) {
long long int m = (lo + hi) / 2;
long long int ch = 2 * n * m - m * (m + 1);
if (ch >= l) {
bl = m;
hi = m - 1;
} else
lo = m + 1;
}
long long int val = 2 * n * (bl - 1) - bl * (bl - 1);
for (long long int i = l; i <= r; i++) {
if (i % 2 == 0) {
cout << bl + (i - val) / 2 << " ";
} else {
cout << bl << " ";
}
if ((2 * n * bl - (bl + 1) * bl) == i) {
val = i;
bl++;
}
}
if (f) cout << 1 << " ";
cout << "\n";
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 200001;
const long long MOD = 1000000007;
const long long INF = LLONG_MAX;
vector<long long> v;
void pre() {
v.push_back(1LL);
for (long long i = 1; i <= 1e5; i++) v.push_back(i * 2);
for (long long i = 1; i < v.size(); i++) v[i] += v[i - 1];
}
long long Getfirst(long long n, long long x) {
long long id = upper_bound(v.begin(), v.end(), x) - v.begin();
return (n - id);
}
long long Getlast(long long n, long long x) {
long long id = upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
long long dif = x - v[id] + 1;
return (n - dif / 2);
}
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
pre();
int tc = 1, cs = 0;
cin >> tc;
while (tc--) {
long long n, l, r, i, limit;
cin >> n >> l >> r;
limit = n * (n - 1) + 1;
vector<long long> ans;
for (i = l; i <= r; i++) {
if (i == limit) {
ans.push_back(1);
break;
}
if (i & 1)
ans.push_back(Getfirst(n, limit - i));
else
ans.push_back(Getlast(n, limit - i));
}
for (auto it : ans) cout << it << ' ';
cout << '\n';
;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long t, n, l, r, q;
int main() {
scanf("%lld", &t);
while (t--) {
scanf("%lld%lld%lld", &n, &l, &r);
long long now = 0;
q = n - 1;
bool flag = 0;
for (int i = 1; i < n - 1; i++) {
if (now + (n - i) * 2 >= l) {
q = i;
break;
}
now += 2 * (n - i);
}
for (int i = q; i <= n - 1; i++) {
for (int j = i + 1; j <= n; j++) {
now++;
if (now > r) break;
if (now >= l) printf("%d ", i);
now++;
if (now > r) break;
if (now >= l) printf("%d ", j);
}
if (now > r) break;
}
now++;
if (l <= now && now <= r) printf("%d ", 1);
printf("\n");
}
return 0;
}
| 10 | CPP |
import sys
input = sys.stdin.readline
T = int(input())
for _ in range(T):
n, l, r = map(int, input().split())
lb, ub = 0, n
while ub - lb > 1:
m = (lb + ub) // 2
if m * (2*n-m-1) < l:
lb = m
else:
ub = m
i = ub
s = lb * (2*n-lb-1) + 1
j = (l - s + 1) // 2 + i
ans = []
for k in range(l, r+1):
if i == n:
i = 1
if (k - s) % 2 == 0:
ans.append(i)
j += 1
else:
ans.append(j)
if j == n:
s = k + 1
i += 1
j = i
print(*ans)
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long cnt[100006];
vector<int> ans;
int main() {
int tests = 1;
int n;
long long l, r;
scanf("%d", &tests);
while (tests--) {
ans.clear();
scanf("%d%lld%lld", &n, &l, &r);
for (int i = 1; i < n; ++i) cnt[i] = 1ll * (2 * n - i - 1) * i;
int s = 0, t = 0, f = 0;
if (r == 1ll * n * (n - 1) + 1) f = 1;
for (int i = 1; i < n; ++i) {
if (cnt[i] < l) s = i;
if (cnt[i] <= r) t = i;
}
s++;
t++;
for (int i = s; i <= t; ++i) {
for (int j = i + 1; j <= n; ++j) ans.push_back(i), ans.push_back(j);
}
r -= cnt[s - 1] + 1, l -= cnt[s - 1] + 1;
for (int i = 0; i < (int)ans.size(); ++i) {
if (i >= l && i <= r) printf("%d ", ans[i]);
}
if (f) printf("1");
puts("");
}
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma gcc optimize("O3")
#pragma gcc optimize("Ofast")
using namespace std;
long long n, l, r;
long long i, j, t;
void nx() {
j++;
if (j == n + 1) {
i++;
j = i + 1;
}
}
void print() {
if (!t) {
cout << i << " ";
} else {
cout << j << " ";
nx();
}
t ^= 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int k = 0;
cin >> n >> l >> r;
if (r == n * (n - 1) + 1) {
r--;
k = 1;
}
long long cnt = 1;
for (i = 1; i <= n && cnt + (n - i) * 2 < l; i++) {
cnt += (n - i) * 2;
}
j = i + 1;
while (cnt + 2 <= l) {
cnt += 2;
j++;
}
t = (l - cnt) % 2;
for (int z = 1; z <= r - l + 1; z++) {
print();
}
if (k)
cout << 1 << '\n';
else
cout << '\n';
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n, lgrp = 0, rgrp = 0;
long long int l, r;
cin >> n >> l >> r;
for (int k = 1; k <= n - 1; ++k) {
if (l <= 2 * (n - k) * 1LL) {
lgrp = k;
break;
} else {
l -= 2 * (n - k) * 1LL;
}
}
for (int k = 1; k <= n - 1; ++k) {
if (r <= 2 * (n - k) * 1LL) {
rgrp = k;
break;
} else {
r -= 2 * (n - k) * 1LL;
}
}
int start = 0;
if (lgrp == 0) lgrp = n;
if (rgrp == 0) rgrp = n;
if (lgrp == n && rgrp == n) {
cout << 1;
} else if (lgrp != rgrp) {
if (l % 2 == 1) {
++l;
cout << lgrp << " ";
}
start = l / 2;
cout << lgrp + start << " ";
++l;
for (int i = l; i <= 2 * (n - lgrp); ++i) {
if (i % 2 == 0) {
++start;
cout << lgrp + start << " ";
} else {
cout << lgrp << " ";
}
}
for (int i = lgrp + 1; i < rgrp; ++i) {
start = 0;
for (int j = 1; j <= 2 * (n - i); ++j) {
if (j % 2 == 0) {
++start;
cout << i + start << " ";
} else {
cout << i << " ";
}
}
}
if (rgrp == n) {
cout << 1 << " ";
} else {
start = 0;
for (int i = 1; i <= r; ++i) {
if (i % 2 == 0) {
++start;
cout << rgrp + start << " ";
} else {
cout << rgrp << " ";
}
}
}
} else {
if (l == r) {
if (l % 2 == 1) {
cout << lgrp << " ";
++l;
} else {
start = l / 2;
cout << lgrp + start << " ";
++l;
}
} else if (l % 2 == 1) {
++l;
cout << lgrp << " ";
}
if (l <= r) {
start = l / 2;
cout << lgrp + start << " ";
++l;
}
for (int i = l; i <= r; ++i) {
if (i % 2 == 0) {
++start;
cout << lgrp + start << " ";
} else {
cout << lgrp << " ";
}
}
}
cout << "\n";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin >> t;
while (t--) {
ll n, l, r;
cin >> n >> l >> r;
ll sm = 0;
ll iters = 0;
ll add = n - 1;
if (l == n * (n - 1) + 1) {
cout << 1 << endl;
continue;
}
while (2 * sm < l) {
sm += add;
add--;
iters++;
}
sm -= (add + 1);
sm *= 2;
sm++;
ll currnext = iters + 1;
bool startonone = true;
while (sm < l) {
if (sm + 1 < l) {
sm += 2;
currnext++;
} else {
startonone = false;
sm++;
}
}
for (ll i = l; i <= min(r, n * (n - 1)); i++) {
ll toprint;
if (startonone) {
if ((i - l) % 2 == 0)
toprint = iters;
else {
toprint = currnext;
currnext++;
}
} else {
if ((i - l) % 2 == 0) {
toprint = currnext;
currnext++;
} else {
toprint = iters;
}
}
if (toprint == n) {
iters++;
currnext = iters + 1;
}
cout << toprint << ' ';
}
if (r == n * (n - 1) + 1) {
cout << 1 << ' ';
}
cout << endl;
}
}
| 10 | CPP |
# ------------------- 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 --------------------
import bisect
for j in range(int(input())):
n,l,r=map(int,input().split())
vals=[2*(n-1)]
for s in range(1,n):
vals.append(vals[-1]-2)
vals[-1]=1;prefsum=[vals[0]]
for s in range(1,len(vals)):
prefsum.append(prefsum[-1]+vals[s])
ans=[]
ind0=bisect.bisect_left(prefsum,l);ind1=bisect.bisect_left(prefsum,r)
for s in range(ind0,ind1+1):
for i in range(s+1,n):
ans.append(s+1);ans.append(i+1)
if s+1==n:
ans.append(1)
lbound=l
if ind0>0:
lbound-=prefsum[ind0-1]
if len(ans)>0:
print(*ans[lbound-1:(r-l)+lbound])
else:
print(1) | 10 | PYTHON3 |
for nt in range(int(input())):
w,a,b=map(int,input().split())
if w==2:
l=[1,2,1]
print (*l[a-1:b])
continue
k=w
prev=0
for j in range(a,b+1):
i=j-prev
while k>1:
if i<=2*(k-1):
if i%2:
print (w-k+1,end=" ")
else:
print (i//2+(w-k+1),end=" ")
break
else:
i-=2*(k-1)
prev+=2*(k-1)
k-=1
if k==1:
print (1,end=" ")
print ()
| 10 | PYTHON3 |
from sys import stdin
input = stdin.readline
q = int(input())
for _ in range(q):
n,l,r = map(int,input().split())
tab = [-1,1]
cyk = 0
for i in range(n):
cyk += 2*(n-i-1)
tab.append(cyk + 1)
tab.append(1012809128301279797787789798789798798)
i = 0
start = i
while True:
if tab[i + 1] > l:
start = i
break
else:
i += 1
#zaczynamy od i X i (x+1) ...
ind = l
dlug = 0
koniec = 0
while True:
if koniec:
break
target = tab[start+1]
while ind < target:
if koniec:
break
if ind == (n*(n-1) + 1):
print(1, end = " ")
dlug += 1
else:
dlug += 1
if ind%2==1:
print(i, end = " ")
else:
print(n-((target-ind)-1)//2, end = " ")
ind += 1
if dlug >= (r-l+1):
koniec = 1
start += 1
i += 1
print() | 10 | PYTHON3 |
t=int(input())
for _ in range(t):
n,l,r=map(int,input().split())
L=[0]
tt=2*(n-1)
for i in range(n):
L.append(tt)
tt-=2
L[-1]=1
temp=0
ct=r-l+1
c=0
tot=0
for i in range(1,len(L)):
if(tot+L[i]<l):
tot+=L[i]
else:
rem=l-tot
p1=i
p2=rem//2
if(rem%2!=0):
p2+=1
temp=1
p2+=i
break
if(temp==0):
print(p2,end=" ")
p2+=1
if(p2==n+1):
p1+=1
if(p1==n):
p1=1
p2=p1+1
c+=1
if(p1==n):
p1=1
while(c<ct):
print(p1,end=" ")
c+=1
if(c==ct):
break
print(p2,end=" ")
c+=1
p2+=1
if(p2==n+1):
p1+=1
if(p1==n):
p1=1
p2=p1+1
print(" ")
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long v[100010];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
for (int i = 1; i < n; ++i) v[i] = 2 * (n - i);
v[n] = 1;
for (int i = 1; i <= n; ++i) v[i] += v[i - 1];
int a = 0, b = n + 1;
while (b - a > 1) {
int mid = (a + b) / 2;
if (v[mid] >= l)
b = mid;
else
a = mid;
}
long long current = v[a];
long long pos = a + 1;
while (current < l) {
current += 2;
pos++;
}
bool flag = current != l;
long long lim = 1ll * n * (n - 1) + 1;
for (long long i = l; i <= min(lim - 1, r); ++i) {
if (flag)
cout << a + 1 << " ";
else
cout << pos++ << " ";
if (pos > n) {
a++;
pos = a + 2;
}
flag ^= 1;
}
if (lim == r) cout << "1";
cout << "\n";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, l, r;
cin >> n >> l >> r;
long long printed = 0;
long long num = 0;
while (printed < l) {
num++;
printed += (2 * (n - num));
if (num == n - 1) {
break;
}
}
printed -= 2 * (n - num);
num--;
vector<int> nums;
while (nums.size() < r - printed) {
for (int q = num + 2; q <= n; q++) {
nums.push_back(num + 1);
nums.push_back(q);
}
num++;
if (num == n - 1) {
nums.push_back(1);
}
}
for (int q = l - printed - 1; q <= r - printed - 1; q++) {
cout << nums[q] << " ";
}
cout << "\n";
}
int main() {
int t;
cin >> t;
for (int q = 0; q < t; q++) {
solve();
}
return 0;
}
| 10 | CPP |
import bisect
t=int(input())
for _ in range(t):
n,l,r=map(int,input().split())
ans=[]
sums=[]
tmp=0
for i in range(n-1,0,-1):
tmp+=i
sums.append(tmp)
for i in range(l-1,r):
if i%2==0:
k=i//2
g=bisect.bisect_right(sums,k)
tmp=0
if g==n-1:
ans.append(1)
else:
ans.append(g+1)
else:
k=(i-1)//2
g=bisect.bisect_right(sums,k)
tmp=(g*(2*(n-1)-(g-1)))//2
ans.append(2+g+k-tmp)
print(*ans) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long long q, n, i, j, sum, sum2, l, r, pos;
cin >> q;
while (q--) {
cin >> n >> l >> r;
sum = 1;
for (i = 1; i <= n; i++) {
sum2 = max((n - 1 - i), 0 * 1LL) + (n - i) + 1;
if (sum + sum2 >= l) {
pos = i;
while (sum <= r && pos < n) {
for (j = pos + 1; j <= n - 1; j++) {
if (sum >= l && sum <= r) cout << pos << " ";
sum++;
if (sum >= l && sum <= r) cout << j << " ";
sum++;
}
if (sum >= l && sum <= r) cout << pos << " ";
sum++;
if (sum >= l && sum <= r) cout << n << " ";
sum++;
pos++;
}
if (sum <= r) cout << 1 << " ";
break;
} else
sum += sum2;
}
cout << '\n';
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 2e5 + 100;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
long long q, n, l, r, s, t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> q;
while (q--) {
cin >> n >> l >> r;
s = 0;
t = 1;
for (long long i = 1; i <= n; i++) {
s += 2 * (n - i);
if (s >= l) {
s -= 2 * (n - i);
t = i;
break;
}
}
bool f = 0;
if (r == n * (n - 1) + 1) f = 1, r--;
while (s < r) {
for (long long i = t + 1; i <= n; i++) {
if (++s >= l) cout << t << " ";
if (s == r) break;
if (++s >= l) cout << i << " ";
if (s == r) break;
}
t++;
}
if (f) cout << 1;
cout << '\n';
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
size_t T;
cin >> T;
while (T--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int t = 1;
long long int k = 1;
while (k < l && t != n) {
k += 2 * (n - t++);
}
if (k > l) {
k -= 2 * (n - --t);
}
if (t == n) {
cout << 1 << endl;
continue;
}
long long int difference = l - k;
long long int c = difference / 2 + t + 1;
if (difference % 2) {
cout << c << " ";
++l;
difference = l - k;
c = difference / 2 + t + 1;
if (c > n) {
c = ++t + 1;
if (t == n) {
cout << 1 << endl;
break;
}
}
}
if (difference % 2 == 0) {
long long int current = l;
while (current <= r) {
cout << t << " ";
++current;
if (current <= r) {
cout << c++ << " ";
++current;
if (c > n) {
c = ++t + 1;
if (t == n) {
if (current <= r) cout << 1;
break;
}
}
}
}
}
cout << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
using ll = long long;
long long arr[N];
ll n;
int solve(ll x) {
if (x == n * (n - 1) + 1) {
return 1;
}
auto p = lower_bound(arr + 1, arr + n + 1, x) - arr - 1;
x -= arr[p];
if (x & 1) {
return p + 1;
}
return (p + 1 + x / 2);
}
int main() {
int T;
cin >> T;
while (T--) {
ll l, r;
cin >> n >> l >> r;
for (int i = 1; i <= n; i++) {
arr[i] = arr[i - 1] + 2 * (n - i);
}
for (ll i = l; i <= r; i++) {
cout << solve(i) << " ";
}
cout << "\n";
}
return 0;
}
| 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;
for (int i = (0); i < (t); i += 1) {
long long n, l, r;
cin >> n >> l >> r;
bool z = false;
if (r == n * (n - 1) + 1) {
r--;
z = true;
}
vector<int> arr;
long long cnt = 0;
bool stop = false;
for (int j = (1); j < (n + 1); j += 1) {
if (cnt + (2 * (n - j)) < l) {
cnt += (2 * (n - j));
continue;
} else {
for (int a = (j); a < (n + 1); a += 1) {
if (stop) break;
for (int k = (a + 1); k < (n + 1); k += 1) {
cnt++;
if (cnt > r) {
stop = true;
break;
}
if (cnt >= l) {
arr.push_back(a);
}
cnt++;
if (cnt > r) {
stop = true;
break;
}
if (cnt >= l) {
arr.push_back(k);
}
}
}
break;
}
}
if (z) arr.push_back(1);
for (int j = (0); j < (arr.size()); j += 1) cout << arr[j] << " ";
cout << "\n";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int t;
ll n, st, dr;
cin >> t;
while (t--) {
cin >> n >> st >> dr;
int deAfisat = 0;
if (dr == n * (n - 1) + 1) {
deAfisat = 1;
dr--;
}
if (st == 1 && dr == 1) {
cout << 1 << '\n';
continue;
}
if (dr < st) {
cout << 1 << '\n';
continue;
}
ll i;
for (i = 1;; i++) {
if (2 * (n - i) >= st) break;
st -= 2 * (n - i);
dr -= 2 * (n - i);
}
ll j = i + (st - 1) / 2 + 1;
if (st % 2 == 0) {
cout << j << ' ';
dr--;
} else {
cout << i << ' ' << j << ' ';
dr -= 2;
}
j++;
if (j == n + 1) {
i++;
j = i + 1;
}
while (dr >= st) {
if (dr == st) {
cout << i << ' ';
break;
}
cout << i << ' ' << j << ' ';
dr -= 2;
j++;
if (j == n + 1) {
i++;
j = i + 1;
}
}
if (deAfisat) cout << 1;
cout << '\n';
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const ll N = 2e5 + 5, mod = 1e9 + 7;
const ll inf = 1e18;
struct cmp {
bool operator()(pair<int, int> a, pair<int, int> b) {
if (a.first == b.first) return a.second < b.second;
return a.first > b.first;
}
};
ll power(ll x, ll p) {
ll r = 1ll;
x = x % mod;
while (p > 0) {
if (p & 1) r = (r * x) % mod;
p = p >> 1;
x = (x * x) % mod;
}
return r;
}
void solve() {
ll n, l, r;
cin >> n >> l >> r;
ll firstrow = n + (n - 2);
ll ele = 0, i = 0;
bool edge = 0;
while (ele < l) {
if (firstrow - 2ll * i > 0)
ele += firstrow - 2ll * i;
else {
ele++;
edge = 1;
}
i++;
}
if (!edge) ele -= firstrow - 2ll * (i - 1);
bool flag = 0;
ll j = 1;
if (!edge) ele++;
while (ele <= r) {
ll ans;
if (flag == 0)
ans = i;
else {
ans = i + j;
j++;
}
flag = 1 - flag;
if (ele >= l && !edge) cout << ans << " ";
if (edge) {
cout << 1 << endl;
return;
}
if (i + j - 1 >= n) {
i++;
j = 1;
flag = 0;
if (i >= n) i = 1;
}
ele++;
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1, p;
cin >> t;
for (p = 1; p <= t; p++) {
solve();
}
return 0;
}
| 10 | CPP |
import sys;input=sys.stdin.readline
t, = map(int, input().split())
def gen(k):
return [k+(i+1)//2 if i%2 else k for i in range(2*(n-k))]
for _ in range(t):
n, s, e = map(int, input().split())
k, sm = 0, 0
while sm < s and k < n-1:
k += 1
sm += 2*(n-k)
if sm < s:
k+=1
k2, sm2 = 0, 0
while sm2 < e and k2 < n-1:
k2 += 1
sm2 += 2*(n-k2)
if sm2 < e:
k2+=1
if k == n:
print(1)
elif k == k2:
L = gen(k)
tt, tt2 = sm-2*(n-k), sm2-2*(n-k2)
print(*L[s-tt-1:e-tt2])
else:
tt, tt2 = sm-2*(n-k), sm2-2*(n-k2)
L = gen(k)[s-tt-1:]
L2 = gen(k2)[:e-tt2]
for l in range(k+1, k2):
L += gen(l)
L += L2
if k2 == n:
L.append(1)
print(*L)
| 10 | PYTHON3 |
from collections import *
import sys
try: inp = raw_input
except: inp = input
def err(s):
sys.stderr.write('{}\n'.format(s))
def ni():
return int(inp())
def nl():
return [int(_) for _ in inp().split()]
def solve():
n, L, R = nl()
L -= 1
R -= 1
SM = 0
out = []
for i in range(1, n):
no = (n - i)*2
if no + SM <= L:
SM += no
continue
if SM > R: continue
ARR = [i if j%2 == 0 else i + j//2 + 1 for j in range(no)]
start = max(0, L - SM)
end = R - SM + 1
out.extend(ARR[start:end])
SM += no
if R == SM:
out.append(1)
print(' '.join(map(str, out)))
T = ni()
for _ in range(T):
solve()
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e13 + 5;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
long long n, l, r, s[maxn];
int calc(long long x) {
if (x > s[n - 1]) return 1;
long long a = lower_bound(s + 1, s + n, x) - s;
long long b = x - s[a - 1];
if (b % 2)
return a;
else
return b / 2 + a;
}
int main() {
int T;
cin >> T;
while (T--) {
cin >> n >> l >> r;
for (int i = 1; i <= n; i++) s[i] = s[i - 1] + 2 * (n - i);
for (long long i = l; i <= r; i++) {
cout << calc(i) << " ";
}
puts("");
}
}
| 10 | CPP |
import sys
d = []
def bins(k, n):
l = 0
r = n-2
while l != r:
mid = (l+r+1)//2
if d[mid] <= k:
l = mid
else:
r = mid-1
# print("debug:", l)
ex = k - d[l]
if ex &1:
f = ex//2
return f + l + 2
else:
return l+1
for q in range(int(sys.stdin.readline())):
n, l, r = [int(j) for j in sys.stdin.readline().split()]
mx = n*(n-1)
d = [0]*(n-1)
for i in range(1, n-1):
d[i] = d[i-1] + 2*(n-i)
# print(d[-15:])
ret = []
# print("degug2:",bins(9998900028, n),bins(9998900029, n), bins(9998900030, n), bins(9998900031, n) )
for i in range(l-1, r):
ret.append(str(bins(0 if i == mx else i, n)))
sys.stdout.write(" ".join(ret) + '\n')
| 10 | PYTHON3 |
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)
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[1000006];
long long n;
map<long long, long long> mp;
int main() {
long long Q;
cin >> Q;
while (Q--) {
cin >> n;
long long l, r;
cin >> l >> r;
a[0] = (n - 1) * 2;
long long k = a[0] - 2;
long long po = 0;
for (int i = 1; i < 1000006; i++) {
a[i] = a[i - 1] + k;
k -= 2;
if (k == 0) {
po = i + 1;
break;
}
}
long long qq, q = lower_bound(a, a + po, l) - a;
if (q == 0)
qq = 0;
else
qq = a[q - 1] + 1;
long long qqq = a[q] + 1;
q++;
while (l <= r) {
if (l == n * (n - 1) + 1) {
cout << 1;
break;
}
if (l == qqq) {
q = lower_bound(a, a + po, l) - a;
qq = a[q - 1] + 1;
qqq = a[q] + 1;
q++;
cout << q << ' ';
l++;
continue;
}
if (l % 2 == 1)
cout << q << ' ';
else
cout << (l - qq + 1) / 2 + q << ' ';
l++;
}
cout << endl;
}
return 0;
}
| 10 | CPP |
for _ in range(int(input())):
n, l, r = map(int, input().split())
cursum = 0
curn = n - 1
while curn > 0 and (cursum + (curn << 1)) < l:
cursum += curn << 1
curn -= 1
fix = n - curn
d = False
i = fix
nexti = fix + 1
# print(cursum, l, i, nexti)
for _ in range(cursum + 1, l):
if d:
nexti += 1
if nexti > n:
fix += 1
nexti = fix + 1
i = fix
else:
i = nexti
d ^= True
ans = [i]
for _ in range(l, r):
if d:
nexti += 1
if nexti > n:
fix += 1
nexti = fix + 1
i = fix
else:
i = nexti
ans.append(i)
d ^= True
if r == n * (n - 1) + 1:
ans[-1] = 1
elif nexti > n:
ans[-1] = fix + 1
print(' '.join(map(str, ans)))
| 10 | PYTHON3 |
import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
n, l, r = map(int, input().split())
s = 1
while l > (n-s)*2+1:
#if s == n:
#break
l -= (n-s)*2
r -= (n-s)*2
s += 1
#print(s, l, r)
if s == n:
ans = [n, 1]
else:
ans = []
while len(ans) <= r:
if s == n:
ans.append(1)
break
for j in range(s+1, n+1):
ans.append(s)
ans.append(j)
s += 1
print(*ans[l-1:r])
| 10 | PYTHON3 |
import sys
from collections import defaultdict
from copy import copy
R = lambda t = int: t(input())
RL = lambda t = int: [t(x) for x in input().split()]
RLL = lambda n, t = int: [RL(t) for _ in range(n)]
def solve():
n, l, r = RL()
if l == n*(n-1)+1:
print(1)
return
l -= 1
r -= 1
D = ((2*n-1)**2-4*l)**.5
a = (2*n-1-D)/2
a = int(a)
x = a*((n-1)+(n-a))
l -= x
r -= x
i = 0
s = []
a += 1
b = a + 1
while i <= r and a < n:
s += [str(a),str(b)]
b += 1
if b > n:
a += 1
b = a + 1
i += 2
s += "1"
for c in s[l:r+1]:
print(str(c),end = " ")
print()
T = R()
for _ in range(T):
solve()
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long f(long long N, long long x) { return (2 * N - 1 - x) * x; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
long long N;
cin >> N;
long long l, r;
cin >> l >> r;
long long ng = 0, ok = N;
while (ok - ng > 1) {
long long mid = (ok + ng) / 2;
if (f(N, mid) >= l)
ok = mid;
else
ng = mid;
}
long long p = ok;
long long stage = N - p;
p--;
long long cnt = (l - f(N, p) - 1) / 2,
s = ((l - f(N, p) - 1) % 2 == 0 ? N - stage
: N - stage + cnt + 1);
for (int i = 0; i <= (r - l); i++) {
if (i == r - l && r == N * (N - 1) + 1)
cout << 1;
else
cout << s << " ";
if (s == N - stage) {
s = N - stage + cnt + 1;
} else {
if (cnt == stage - 1) {
stage--;
cnt = 0;
} else
cnt++;
s = N - stage;
}
}
cout << "\n";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-all-loops")
using namespace std;
ifstream in;
ofstream out;
const long long kk = 1000;
const long long ml = kk * kk;
const long long mod = ml * kk + 7;
const long long inf = ml * ml * ml + 7;
long long n, l, r;
bool viv = false;
vector<long long> v;
void solve() {
cin >> n >> l >> r;
l--, r--;
vector<pair<long long, long long> > v;
for (int i = 0; i < n; i++) {
v.push_back({i, 2 * (n - 1 - i)});
}
long long sl = 0;
vector<long long> ans;
for (int i = 0; i < n; i++) {
long long sr = sl + v[i].second - 1;
if (max(l, sl) <= min(r, sr)) {
vector<long long> loc;
for (int j = 0; j < v[i].second / 2; j++) {
loc.push_back(i);
loc.push_back(i + j + 1);
}
for (int j = 0; j < loc.size(); j++)
if (sl + j >= l && sl + j <= r) ans.push_back(loc[j]);
}
sl = sr + 1;
}
if (r == sl) ans.push_back(0);
for (auto i : ans) cout << i + 1 << ' ';
cout << '\n';
}
int main() {
viv = true;
srand(time(0));
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) solve();
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const double PI = acos(-1);
long long gcd() { return 0ll; }
template <typename T, typename... Args>
T gcd(T a, Args... args) {
return __gcd(a, (__typeof(a))gcd(args...));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T;
cin >> T;
while (T--) {
long long n, l, r;
cin >> n >> l >> r;
l--;
r--;
long long a[2 * n - 3];
for (__typeof(2 * n - 3) i = (0) - ((0) > (2 * n - 3));
i != (2 * n - 3) - ((0) > (2 * n - 3));
i += 1 - 2 * ((0) > (2 * n - 3))) {
if (i & 1)
a[i] = 1 + ((i + 1) / 2);
else
a[i] = 1;
}
while (l < (2 * n - 3) && l <= r) cout << a[l++] << " ";
long long st[n - 1], x = 2;
st[n - 2] = n * (n - 1) - 1;
for (__typeof(0) i = (n - 2) - ((n - 2) > (0)); i != (0) - ((n - 2) > (0));
i += 1 - 2 * ((n - 2) > (0))) {
st[i] = st[i + 1] - x;
x += 2;
}
long long j = -1;
while (st[j + 1] < l) j++;
while (l <= r) {
if (l == (n * (n - 1))) {
cout << "1";
break;
}
if (st[j + 1] == l) {
j++;
l++;
cout << n << " ";
continue;
}
if (!(l & 1))
cout << (j + 2) << " ";
else
cout << (j + 2) + (l - st[j]) / 2 << " ";
l++;
}
cout << "\n";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long T;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> T;
while (T--) {
long long n, l, r;
cin >> n >> l >> r;
long long g = n * (n - 1) + 1;
if (l == g - 1) {
if (r == g)
cout << n << " 1" << '\n';
else
cout << "1" << '\n';
continue;
}
if (l == g) {
cout << "1" << '\n';
continue;
}
long long k = (l + 1) / 2, ls = 2, ln, p = 0;
while (p + (n - ls + 1) < k) p += (n - ls + 1), ls++;
ln = ls;
while (p + 1 < k) ln++, p++;
long long lo, los = 1, loo;
p = 0;
k = l / 2 + 1;
while (p + (n - los) < k) p += (n - los), los++;
loo = los;
lo = n - los;
while (p + 1 < k) p++, lo--;
for (long long i = l; i <= r; i++) {
if (i & 1) {
cout << loo << " ";
lo--;
if (!lo) loo++, lo = n - loo;
if (loo == n) loo = 1;
} else {
cout << ln << " ";
if (ln == n) {
ln = (++ls);
} else
ln++;
}
}
cout << '\n';
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T InvMod(T a, T b, T &x, T &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
T x1, y1;
T g = InvMod(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return g;
}
long long fact(long long n) {
if (n == 1) return 1;
return (n % 1000000007 * fact(n - 1) % 1000000007) % 1000000007;
}
void sieve(vector<int> &v) {
bool arr[1000004];
memset(arr, true, sizeof arr);
for (int i = 2; i * i <= 1000002; i++) {
if (arr[i] == true) {
v.push_back(i);
for (int j = i * i; j <= 1000002; j += i) {
arr[j] = false;
}
}
}
}
bool cmp(pair<int, int> a, pair<int, int> b) { return a.first > b.first; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
int i = 1;
long long tmp = l;
for (long long j = l; j <= r; j++) {
while (2 * (n - i) < tmp && i <= n) {
tmp -= 2 * (n - i);
i++;
}
if (i > n) {
cout << 1 << " ";
continue;
}
long long rem = tmp;
if (rem % 2 == 1) {
cout << i << " ";
} else {
cout << i + (rem / 2) << " ";
}
tmp++;
}
cout << endl;
}
}
| 10 | CPP |
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import defaultdict
from collections import deque
import threading
#sys.setrecursionlimit(300000)
#threading.stack_size(10**8)
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")
#-------------------------------------------------------------------------
#mod = 9223372036854775807
class SegmentTree:
def __init__(self, data, default=10**10, func=lambda a, b: min(a,b)):
"""initialize the segment tree with data"""
self._default = default
self._func = func
self._len = len(data)
self._size = _size = 1 << (self._len - 1).bit_length()
self.data = [default] * (2 * _size)
self.data[_size:_size + self._len] = data
for i in reversed(range(_size)):
self.data[i] = func(self.data[i + i], self.data[i + i + 1])
def __delitem__(self, idx):
self[idx] = self._default
def __getitem__(self, idx):
return self.data[idx + self._size]
def __setitem__(self, idx, value):
idx += self._size
self.data[idx] = value
idx >>= 1
while idx:
self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
idx >>= 1
def __len__(self):
return self._len
def query(self, start, stop):
if start == stop:
return self.__getitem__(start)
stop += 1
start += self._size
stop += self._size
res = self._default
while start < stop:
if start & 1:
res = self._func(res, self.data[start])
start += 1
if stop & 1:
stop -= 1
res = self._func(res, self.data[stop])
start >>= 1
stop >>= 1
return res
def __repr__(self):
return "SegmentTree({0})".format(self.data)
class SegmentTree1:
def __init__(self, data, default=10**6, func=lambda a, b: min(a,b)):
"""initialize the segment tree with data"""
self._default = default
self._func = func
self._len = len(data)
self._size = _size = 1 << (self._len - 1).bit_length()
self.data = [default] * (2 * _size)
self.data[_size:_size + self._len] = data
for i in reversed(range(_size)):
self.data[i] = func(self.data[i + i], self.data[i + i + 1])
def __delitem__(self, idx):
self[idx] = self._default
def __getitem__(self, idx):
return self.data[idx + self._size]
def __setitem__(self, idx, value):
idx += self._size
self.data[idx] = value
idx >>= 1
while idx:
self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
idx >>= 1
def __len__(self):
return self._len
def query(self, start, stop):
if start == stop:
return self.__getitem__(start)
stop += 1
start += self._size
stop += self._size
res = self._default
while start < stop:
if start & 1:
res = self._func(res, self.data[start])
start += 1
if stop & 1:
stop -= 1
res = self._func(res, self.data[stop])
start >>= 1
stop >>= 1
return res
def __repr__(self):
return "SegmentTree({0})".format(self.data)
MOD=10**9+7
class Factorial:
def __init__(self, MOD):
self.MOD = MOD
self.factorials = [1, 1]
self.invModulos = [0, 1]
self.invFactorial_ = [1, 1]
def calc(self, n):
if n <= -1:
print("Invalid argument to calculate n!")
print("n must be non-negative value. But the argument was " + str(n))
exit()
if n < len(self.factorials):
return self.factorials[n]
nextArr = [0] * (n + 1 - len(self.factorials))
initialI = len(self.factorials)
prev = self.factorials[-1]
m = self.MOD
for i in range(initialI, n + 1):
prev = nextArr[i - initialI] = prev * i % m
self.factorials += nextArr
return self.factorials[n]
def inv(self, n):
if n <= -1:
print("Invalid argument to calculate n^(-1)")
print("n must be non-negative value. But the argument was " + str(n))
exit()
p = self.MOD
pi = n % p
if pi < len(self.invModulos):
return self.invModulos[pi]
nextArr = [0] * (n + 1 - len(self.invModulos))
initialI = len(self.invModulos)
for i in range(initialI, min(p, n + 1)):
next = -self.invModulos[p % i] * (p // i) % p
self.invModulos.append(next)
return self.invModulos[pi]
def invFactorial(self, n):
if n <= -1:
print("Invalid argument to calculate (n^(-1))!")
print("n must be non-negative value. But the argument was " + str(n))
exit()
if n < len(self.invFactorial_):
return self.invFactorial_[n]
self.inv(n) # To make sure already calculated n^-1
nextArr = [0] * (n + 1 - len(self.invFactorial_))
initialI = len(self.invFactorial_)
prev = self.invFactorial_[-1]
p = self.MOD
for i in range(initialI, n + 1):
prev = nextArr[i - initialI] = (prev * self.invModulos[i % p]) % p
self.invFactorial_ += nextArr
return self.invFactorial_[n]
class Combination:
def __init__(self, MOD):
self.MOD = MOD
self.factorial = Factorial(MOD)
def ncr(self, n, k):
if k < 0 or n < k:
return 0
k = min(k, n - k)
f = self.factorial
return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD
mod=10**9+7
omod=998244353
#-------------------------------------------------------------------------
prime = [True for i in range(200001)]
pp=[]
def SieveOfEratosthenes(n=200000):
p = 2
c=0
while (p * p <= n):
if (prime[p] == True):
c+=1
pp.append(p)
for i in range(p * p, n+1, p):
prime[i] = False
p += 1
#---------------------------------Binary Search------------------------------------------
def binarySearch(arr, n, key):
left = 0
right = n-1
mid = 0
res=0
while (left <= right):
mid = (right + left)//2
if (arr[mid] > key):
right = mid-1
else:
res=mid+1
left = mid + 1
return res
#---------------------------------running code------------------------------------------
for _ in range (int(input())):
n,l,r=map(int,input().split())
a=[0]
start=2*(n-1)
while start>0:
a.append(a[-1]+start)
start-=2
a.append(a[-1]+1)
#print(*a)
if l==1+(n*(n-1)):
print(1)
continue
res=[]
k=0
for i in range (len(a)):
if a[i]>=l:
start=i
k=n-((a[i]-l)//2)
break
#print(start,k)
for i in range (l,r+1):
if k>n:
start+=1
if start==n:
start=1
k=start+1
if i%2:
res.append(start)
else:
res.append(k)
k+=1
print(*res) | 10 | PYTHON3 |
#include <bits/stdc++.h>
const long long int maxn = 1e10;
const long long mod = 1e9 + 7;
using namespace std;
long long int power(long long int a, long long int b) {
long long int res = 1;
while (b > 0) {
if (b % 2 == 1) res = res * a;
a = a * a;
b = b / 2;
}
return res;
}
long long po(long long x, long long y) {
long long res = 1;
x = x % mod;
while (y > 0) {
if (y & 1) res = ((res % mod) * (x % mod)) % mod;
y = y >> 1;
x = ((x % mod) * (x % mod)) % mod;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int count = 0;
int i = 1;
long long int ini = 2 * (n - 1);
while (1) {
if (count + ini >= l || i == n) break;
count += ini;
ini -= 2;
i++;
}
count++;
vector<pair<long long int, long long int> > p;
while (count <= r) {
if (count == n * (n - 1) + 1) {
p.push_back({1, count});
count++;
continue;
}
int it = i + 1, flag = 1;
for (int j = 0; j < ini; j++) {
if (flag) {
p.push_back({i, count});
count++;
flag = 0;
} else {
p.push_back({it, count});
count++;
it++;
flag = 1;
}
}
ini -= 2;
i++;
}
for (int j = 0; j < p.size(); j++) {
if (p[j].second <= r && p[j].second >= l) cout << p[j].first << " ";
}
cout << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mn = 1 * (int)(1e5) + 10;
const int mod = 1 * (int)(1e9) + 7;
const int mm = 1 * (int)(1e3) + 10;
const int base = 1 * (int)(1e9);
const bool aNs = 0;
int tt, ntest = 1;
void docfile() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
if (ifstream("test.inp")) {
freopen("test.inp", "r", stdin);
if (!aNs)
freopen("test.out", "w", stdout);
else
freopen("test.ans", "w", stdout);
} else if (ifstream("1334d.inp")) {
freopen("1334d.inp", "r", stdin);
freopen("1334d.out", "w", stdout);
}
}
template <typename T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) f = ch == '-' ? -f : f, ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
x *= f;
}
template <typename T>
void write(T a) {
if (a < 0) {
putchar('-');
write(-a);
return;
}
if (a < 10) {
putchar('0' + a);
return;
}
write(a / 10);
putchar((char)('0' + (a % 10)));
}
void enter() {
int n;
long long l, r;
cin >> n >> l >> r;
long long s = 0;
for (int i = 1; i < n; ++i) {
if (s + 2 * (n - i) >= l) {
vector<int> v;
for (int j = i + 1; j <= n; ++j) {
v.emplace_back(i);
v.emplace_back(j);
}
for (int k = max(l - 1 - s, 0ll); k < min(r - s, 2ll * (n - i)); ++k)
cout << v[k] << " ";
}
if (s + 2 * (n - i) >= r) {
break;
}
s += 2 * (n - i);
}
if (r == 1ll * n * (n - 1) + 1) cout << 1;
}
void solve() { cout << "\n"; }
void print_result() {}
int main() {
docfile();
cin >> ntest;
for (tt = 1; tt <= ntest; ++tt) {
enter();
solve();
print_result();
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
;
long long int p;
cin >> p;
while (p--) {
long long int a, b, c, d, e, l, r, f, cnt = 1;
vector<long long int> Ans;
cin >> a >> l >> r;
f = l;
long long int fuck = a - 1;
while (f - (2 * fuck) >= 0 && fuck > 0) {
f -= (2 * fuck);
fuck--;
cnt++;
}
if (f == 0) Ans.push_back(a), f++, l++;
f = (f - 1) / 2;
f++;
f += cnt;
for (c = l; c <= r; c++) {
if (c % 2 == 1)
Ans.push_back(cnt);
else
Ans.push_back(f), f++;
if (f == a + 1) cnt++, f = cnt + 1;
}
if (r == (a * (a - 1)) + 1) Ans[Ans.size() - 1] = 1;
for (c = 0; c < Ans.size(); c++) cout << Ans[c] << " ";
cout << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, l, r;
long long num;
vector<long long> ans;
bool intersect(long long l1, long long r1, long long l2, long long r2) {
return min(r1, r2) >= max(l1, l2);
}
void cal(long long left) {
if (left == n) return;
if (intersect(l, r, num + 1, num + 2 * (n - left))) {
for (long long i = left + 1; i <= n; ++i) {
num++;
if (num >= l && num <= r) ans.push_back(left);
num++;
if (num >= l && num <= r) ans.push_back(i);
}
} else
num += 2 * (n - left);
cal(left + 1);
}
int main(void) {
int t;
cin >> t;
while (t--) {
ans.clear();
num = 0;
cin >> n >> l >> r;
cal(1);
for (auto x : ans) cout << x << " ";
if (r == n * (n - 1) + 1) cout << 1 << " ";
cout << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
for (int t = 0; t < T; ++t) {
long long n, l, r;
cin >> n;
cin >> l;
cin >> r;
long long curr_position = 0;
for (long long i1 = 1; i1 < n; ++i1) {
long long x = curr_position + 1;
long long y = curr_position + 2 * (n - i1);
curr_position += 2 * (n - i1);
if (r < x || y < l) {
continue;
}
for (long long i2 = 1; i2 <= y - x + 1; ++i2) {
if (i2 + x - 1 < l || i2 + x - 1 > r) {
continue;
}
if (i2 & 1)
cout << i1 << " ";
else
cout << i2 / 2 + i1 << " ";
}
}
if (r >= n * (n - 1) + 1) cout << 1 << " ";
cout << "\n";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
int T;
int n, L;
long long l, r;
vector<int> v = {1, 2, 1};
long long cyc(int x) {
if (x == n - 1) return 3;
long long res = 2 * (n - x);
return res;
}
void printcyc(int nr, long long start, int len) {
if (nr == n - 1) {
int step = 1;
int x = n - 1;
while (len > 0) {
if (start > 0)
start--;
else {
printf("%d ", x);
len--;
}
if (step == 1) x = n;
if (step == 2) x = 1;
step++;
}
return;
}
int loops = start / 2;
int c = nr + 1 + loops;
int x = c;
if (start % 2 == 0) x = nr;
while (len > 0) {
printf("%d ", x);
len--;
if (x != nr) {
if (c == n) {
printcyc(nr + 1, 0, len);
break;
} else {
c++;
x = nr;
}
} else {
x = c;
}
}
}
void solve() {
long long t = 1;
for (int i = 1; i <= n - 1; i++) {
if (t + cyc(i) < l)
t += cyc(i);
else {
printcyc(i, l - t, L);
break;
}
}
printf("\n");
}
int main() {
scanf("%d", &T);
for (int test = 1; test <= T; test++) {
scanf("%d%lld%lld", &n, &l, &r);
if (n == 2) {
for (int i = l - 1; i < r; i++) printf("%d ", v[i]);
printf("\n");
continue;
}
L = r - l + 1;
solve();
}
}
| 10 | CPP |
CASES = int(input())
answers = []
while (CASES):
CASES -= 1
num, begin, end = [int(x) for x in input().split(" ")]
sequence = []
index = 1
tempB = begin
tempE = end
temp = 2*(num - index)
while (tempB > temp and index < num):
tempB -= temp
tempE -= temp
index += 1
temp = 2*(num - index)
i = 0
while (i < tempE and index <= num):
if index == num:
sequence.append(1)
i += 1
else:
for x in range(index, num):
sequence.append(index)
sequence.append(x + 1)
i += 2
index += 1
tempE = tempE if tempE > tempB else (tempB)
answers.append(" ".join([str(x) for x in sequence[tempB - 1:tempE]]))
for ans in answers:
print(ans)
| 10 | PYTHON3 |
import sys
input = sys.stdin.buffer.readline
for t in range(int(input())):
n,l,r = map(int,input().split())
for i in range(l,min(2*(n-2)+1,r) + 1):
print('1' if i & 1 else i//2 + 1 , end = ' ')
n_set = n
set_idx = 2*(n-2) + 2
while(n_set > 2):
ls = l - set_idx + 1
rs = r - set_idx + 1
set_idx += 2*(n_set - 2)
set_par = n - n_set + 2
if ls < 2 and rs >= 1:print(n , end = ' ')
for i in range(max(2,ls) , min(2*(n_set - 2),rs) + 1):
print(set_par + (i-1)//2 if i & 1 else set_par , end = ' ')
n_set -= 1
l -= set_idx
r -= set_idx
if l <= 0 and r>=0:print(n , end = ' ')
if r == 1: print(1 , end = ' ')
print()
| 10 | PYTHON3 |
def find(a):
global k, tot
if a > n * (n - 1):
return 1
while a > tot + (n - k) * 2:
tot += (n - k) * 2
k += 1
if a & 1:
return k
return (a - tot) // 2 + k
for _ in range(int(input())):
n, l, r = map(int, input().split())
global k, tot
k = 1
tot = 0
li = []
for i in range(l, r + 1):
li.append(find(i))
print(*li)
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
void solve() {
long long n, l, r;
cin >> n >> l >> r;
long long rngIdx = 0;
long long begin = 0, end = n;
while (begin < end) {
long long mid = begin + (end - begin) / 2;
if (2 * n * mid - mid * (mid + 1) >= l) {
end = mid;
} else {
begin = mid + 1;
}
}
rngIdx = end - 1;
long long totalRng = 2 * n * rngIdx - rngIdx * (rngIdx + 1);
for (long long i = l; i <= r; i++) {
if (2 * n * (rngIdx + 1) - (rngIdx + 1) * (rngIdx + 2) < i) {
rngIdx++;
totalRng = 2 * n * rngIdx - rngIdx * (rngIdx + 1);
}
if (i == n * (n - 1) + 1) {
cout << 1 << " ";
} else if (i % 2 == 1) {
cout << rngIdx + 1 << " ";
} else {
cout << (i - totalRng) / 2 + rngIdx + 1 << " ";
}
}
cout << endl;
}
};
int main(int argc, const char* argv[]) {
int t;
Solution sol;
cin >> t;
while (t--) {
sol.solve();
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pr = pair<int, int>;
template <typename T>
void _read(T *arr, int n) {
for (int i = 0; i < n; i++) cin >> arr[i];
}
template <typename T>
void _write(T *arr, int n) {
for (int i = 0; i < n; i++) cout << arr[i] << " ";
cout << endl;
}
const int MAXN = 100033;
ll n;
ll l, r;
int start;
void __Main__() {
cin >> n >> l >> r;
ll sum = 0;
ll now = 2 * n - 2;
if (l == r && l == n * (n - 1) + 1) {
cout << 1 << endl;
return;
}
ll st = 0;
for (int i = 1; i < n; i++) {
if (sum + now >= l) {
st = sum;
start = i;
break;
}
sum += now;
now -= 2;
}
ll res = now;
ll i;
for (i = sum + 1;; i++) {
res--;
ll output;
if ((i - st) & 1) {
output = start;
} else {
output = start + (i - st) / 2;
}
if (res == 0) {
now -= 2;
res = now;
start++;
st = i;
}
if (i < l) {
continue;
}
if (i > r) break;
cout << output << " ";
if (i >= n * (n - 1)) break;
}
if (i < r) cout << 1;
cout << endl;
}
signed main() {
ios ::sync_with_stdio(false);
cin.tie(nullptr);
{
int _Test_cases;
cin >> _Test_cases;
for (int case_num = 1; case_num <= _Test_cases; case_num++) {
__Main__();
}
}
return 0;
}
| 10 | CPP |
from sys import stdin
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def lsi():
x=list(stdin.readline())
x.pop()
return x
def si(): return stdin.readline()
res=['YES', 'NO']
############# CODE STARTS HERE #############
for _ in range(ii()):
n, l, r=mi()
if l==n*(n-1)+1:
print(1)
continue
x, p=1, n*2
while x<=l:
p-=2
x+=p
#print(x, p)
x-=p
p=n*2-p
p//=2
#print(x, p)
a=[]
dl=l-x+1
z=p+((dl+1)//2)
if not dl%2:
a.append(z)
l+=1
z+=1
if z>n:
p+=1
z=p+1
#print(a)
#print(p, z)
while l<=r:
a.append(p)
l+=1
if l<=r:
a.append(z)
l+=1
z+=1
if z>n:
p+=1
z=p+1
if r==n*(n-1)+1:
a[-1]=1
print(*a) | 10 | PYTHON3 |
for _ in range(int(input())):
n,l,r = map(int,input().split())
s=0
ans=[]
for i in range(1,n):
gap2=i
t=i
if s+(n-i)*2 >=l :
for j in range(l,r+1):
gg=(j-s)//2
if j%2==1:
ans.append(gap2)
else:
ans.append(gap2+gg)
if gap2+gg==n:
gap2+=1
s+=(n-t)*2
t+=1
if r==n*(n-1)+1:
ans[-1]=1
break
else:
s+=(n-i)*2
if len(ans)==0:
print(1)
else:
print(*ans)
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, l, r;
void solve(long long l, long long r) {
long long s = 1;
while (s <= n && l > 2 * (n - s)) {
l -= 2 * (n - s);
r -= 2 * (n - s);
s++;
}
long long cnt = l / 2 + l % 2;
cnt += s;
while (s <= n && l <= r) {
while (cnt <= n) {
if (l % 2)
cout << s << " ";
else
cout << cnt++ << " ";
l++;
if (l > r) break;
}
s++;
cnt = s + 1;
}
if (l <= r) cout << 1;
cout << "\n";
}
signed main() {
long long t;
cin >> t;
while (t--) {
cin >> n >> l >> r;
solve(l, r);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie();
int T;
cin >> T;
while (T--) {
long long n, l, r;
cin >> n >> l >> r;
long long e = 0, s = -1, f = -1;
for (long long i = 1; i < n; i++) {
e += 2 * (n - i);
if (e >= l) {
s = i;
f = 2 * (n - i) - e + l;
break;
}
}
if (s == -1) {
cout << 1 << '\n';
continue;
}
for (long long i = l; i <= r; i++) {
if (s == n)
cout << 1 << ' ';
else {
if (f & 1)
cout << s << ' ';
else
cout << s + f / 2 << ' ';
}
if (f == 2 * (n - s)) {
s++;
f = 1;
} else
f++;
}
cout << '\n';
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
long long l, r;
cin >> l >> r;
int idx = 0;
long long sum = 0;
int lg = -1, rg = -1;
int ls = -1, rs = -1;
while ((lg == -1 || rg == -1) && idx < n - 1) {
long long lsum = sum;
sum += (long long)(n - 1 - idx) * 2;
if (lg == -1 && l <= sum) lg = idx, ls = l - lsum;
if (rg == -1 && r <= sum) rg = idx, rs = r - lsum;
idx++;
}
if (lg == -1) lg = n - 1;
if (rg == -1) rg = n - 1;
lg++;
rg++;
for (int i = (int)(lg); i <= (int)(rg); i++) {
if (i == n) {
cout << "1 ";
break;
}
long long from = 1, to = (long long)(n - i) * 2;
if (i == lg) from = ls;
if (i == rg) to = rs;
for (int j = (int)(from); j <= (int)(to); j++) {
if (j % 2 == 1) {
cout << i << " ";
} else {
cout << i + j / 2 << " ";
}
}
}
cout << "\n";
}
return 0;
}
| 10 | CPP |
test = int(input())
for _ in range(test):
n , l , r = [int(x) for x in input().split()]
start = 1
it = 1
if l == n*(n-1) + 1:
print('1')
continue
while start < l:
start += (n-it)*2
it += 1
if start != l:
it -= 1
start -= (n - it)*2
a = it
b = it+1
ok = True
while start < l:
if ok:
ok = False
else:
ok = True
b += 1
start += 1
# print(a , b , ok , '--------------------------')
while start <= r:
if b == n+1:
a += 1
b = a+1
if a == n:
# print('------------------')
print('1' , end=' ')
break
if ok:
print(a , end=' ')
ok = False
else:
print(b , end=' ')
b += 1
ok = True
# ok != ok
start += 1
print()
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int t, n, s, lc;
long long l, r, k;
inline long long read() {
long long ans = 0;
char c = getchar();
while (c < 48 || c > 57) c = getchar();
while (c >= 48 && c <= 57)
ans = (ans << 3) + (ans << 1) + (c ^ 48), c = getchar();
return ans;
}
inline void write(int x) {
if (x > 9) write(x / 10);
putchar(x % 10 + 48);
}
int main() {
t = read();
while (t--) {
n = read(), l = read(), r = read(), k = 0;
for (register int i = 1; i < n; ++i) {
s = (n - i) << 1;
if (k + s < l) {
k += s;
continue;
}
if (k < l)
lc = l - k - 1, k = l - 1;
else
lc = 0;
for (register int j = lc; j < s - 1; ++j) {
++k;
if (k > r) break;
if (!(j & 1))
write(i);
else
write((j >> 1) + i + 1);
putchar(' ');
}
if (k > r) break;
++k;
if (k > r) break;
write(n), putchar(' ');
}
if (k < r) putchar(49);
putchar('\n');
}
return 0;
}
| 10 | CPP |
def main():
for _ in inputt():
n, l, r = inputi()
i = 1
l -= 1
if l == n * (n - 1):
print(1)
continue
while l >= 2 * (n - i):
l -= 2 * (n - i)
r -= 2 * (n - i)
i += 1
j = i + 1 + l // 2
while l < r:
if l % 2:
print(j, end = " ")
j += 1
if j > n:
i += 1
j = i + 1
elif i != n:
print(i, end = " ")
else:
print(1, end = " ")
l += 1
print()
# region M
# region fastio
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):
for x in args:
file.write(str(x))
file.write(kwargs.pop("end", "\n"))
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
# region import
inputt = lambda t = 0: range(t) if t else range(int(input()))
inputi = lambda: map(int, input().split())
inputl = lambda: list(inputi())
from math import *
from heapq import *
from bisect import *
from itertools import *
from functools import reduce, lru_cache
from collections import Counter, defaultdict
import re, copy, operator, cmath
from builtins import *
# endregion
# region main
if __name__ == "__main__":
main()
# endregion
# endregion | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
long long t;
cin >> t;
while (t--) {
long long n, l, r;
cin >> n >> l >> r;
vector<long long> lol = {0};
for (long long i = n - 1; i >= 1; i--) {
lol.push_back(lol.back() + 2 * i);
}
for (long long x = l; x <= r; x++) {
if (x == n * (n - 1) + 1) {
cout << 1 << ' ';
} else {
long long block =
(long long)(lower_bound(lol.begin(), lol.end(), x) - lol.begin());
if (x % 2 == 1) {
cout << block << ' ';
} else {
long long h = x - lol[block - 1];
cout << h / 2 + block << ' ';
}
}
}
cout << '\n';
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int cas, z, x, w, h, a[500000];
long long n, m;
int main() {
scanf("%d", &cas);
while (cas--) {
scanf("%d%lld%lld", &z, &n, &m);
x = 1;
while (n > (z - x) * 2) {
if (x == z) {
m = 0;
printf("1");
break;
}
n -= (z - x) * 2;
m -= (z - x) * 2;
x++;
}
for (int i = 1; i <= z - x; i++) a[i * 2 - 1] = x, a[i * 2] = x + i;
if (m <= (z - x) * 2) {
for (int i = n; i <= m; i++) printf("%d ", a[i]);
} else {
for (int i = n; i <= (z - x) * 2; i++) printf("%d ", a[i]);
m -= (z - x) * 2;
x++;
while (m && (z != x)) {
for (int i = 1; i <= z - x; i++) a[i * 2 - 1] = x, a[i * 2] = x + i;
if (m <= (z - x) * 2) {
for (int i = 1; i <= m; i++) printf("%d ", a[i]);
m = 0;
} else {
for (int i = 1; i <= (z - x) * 2; i++) printf("%d ", a[i]);
m -= (z - x) * 2;
x++;
}
}
if (m) printf("1");
}
printf("\n");
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace ::std;
const long double PI = acos(-1);
const long long MOD = 1000000000 + 7;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long add(long long a, long long b, long long m = MOD) {
if (a >= m) a %= m;
if (b >= m) b %= m;
if (a < 0) a += m;
if (b < 0) b += m;
long long res = a + b;
if (res >= m or res <= -m) res %= m;
if (res < 0) res += m;
return res;
}
long long mul(long long a, long long b, long long m = MOD) {
if (a >= m) a %= m;
if (b >= m) b %= m;
if (a < 0) a += m;
if (b < 0) b += m;
long long res = a * b;
if (res >= m or res <= -m) res %= m;
if (res < 0) res += m;
return res;
}
long long pow_mod(long long a, long long b, long long m = MOD) {
long long res = 1LL;
a = a % m;
while (b) {
if (b & 1) res = mul(res, a, m);
b >>= 1;
a = mul(a, a, m);
}
return res;
}
long long fastexp(long long a, long long b) {
long long res = 1LL;
while (b) {
if (b & 1) res = res * a;
b >>= 1;
a *= a;
}
return res;
}
int gcdExtendido(int a, int b, int *x, int *y) {
if (a == 0) {
*x = 0;
*y = 1;
return b;
}
int x1, y1;
int gcd = gcdExtendido(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modInverso(int a, int m) {
int x, y;
int g = gcdExtendido(a, m, &x, &y);
if (g != 1)
return -1;
else
return (x % m + m) % m;
}
const int N = 100000 + 5;
int n;
long long l, r;
int ans[N];
long long f(int x) { return 2LL * n * x - 1LL * x * (x + 1); }
int main() {
int t;
scanf("%d", &(t));
while (t--) {
scanf("%d", &(n));
scanf("%lld %lld", &(l), &(r));
int len = r - l + 1;
if (r == 1LL * n * (n - 1) + 1) {
ans[r - l] = 1;
r -= 1;
}
int lo = 1, hi = n;
while (lo < hi) {
int mi = lo + (hi - lo) / 2;
if (f(mi) < l)
lo = mi + 1;
else
hi = mi;
}
l -= f(lo - 1);
r -= f(lo - 1);
int pos = 0;
int x = lo;
int y = lo + (l + 1) / 2;
bool goX = l & 1;
for (int i = l; i <= r; i++) {
if (goX) {
ans[pos++] = x;
} else {
ans[pos++] = y;
y += 1;
}
if (y == n + 1) {
x += 1;
y = x + 1;
}
goX = !goX;
}
for (int i = 0; i < len; i++) {
printf("%d%c", ans[i], " \n"[i + 1 == len]);
}
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
long long cur = 0;
while (t--) {
cur = 0;
long long n, l, r;
cin >> n >> l >> r;
for (int i = 1; i <= n; i++) {
if (cur + 2 * (n - i) < l)
cur += 2 * (n - i);
else {
while (l <= r && i <= n && l <= cur + 2 * (n - i)) {
if (l % 2)
cout << i << " ";
else
cout << (l - cur) / 2 + i << " ";
l++;
}
cur += 2 * (n - i);
}
}
if (r - l == 0) cout << "1";
cout << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int T;
int n;
long long l, r;
void out(long long sum, int now, int num, long long i) {
if (now == n) {
if (i != l) printf(" ");
printf("1");
return;
}
for (i; i <= min(sum + num - 1, r); i++) {
int N;
if ((i - sum + 1) % 2)
N = now;
else
N = now + (i - sum + 1) / 2;
if (i == l) {
printf("%d", N);
} else
printf(" %d", N);
}
}
int main() {
scanf("%d", &T);
while (T--) {
long long sum = 1;
scanf("%d%lld%lld", &n, &l, &r);
long long now = 1, num = (n - now) * 2;
for (now = 1; now <= n; now++) {
num = num = (n - now) * 2;
num = max(num, 1 * 1ll);
if (sum <= l && l <= sum + num) {
out(sum, now, num, l);
} else if (l <= sum && sum + num <= r) {
out(sum, now, num, sum);
} else if (sum <= r && r <= sum + num) {
out(sum, now, num, sum);
break;
}
sum += num;
}
printf("\n");
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int sum = 0;
long long int start = 1;
int done = 0;
while (sum < l) {
sum += 2 * (n - start);
start++;
if (start > n) {
cout << 1 << " " << endl;
done = 1;
break;
}
}
if (done) continue;
start--;
sum -= 2 * (n - start);
long long int next = start + 1;
long long int cur = 0;
for (long long int i = sum + 1; i <= r; i++) {
if (i < l) {
if (i % 2 == 0) next++;
} else {
if (i % 2 == 1)
cout << start << " ";
else {
cout << next << " ";
next++;
}
}
cur++;
if (cur == 2 * (n - start)) {
cur = 0;
start = start + 1;
next = start + 1;
if (start == n) start = 1;
}
}
cout << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
size_t T;
cin >> T;
while (T--) {
long long int n, l, r;
cin >> n >> l >> r;
long long int t = 1;
long long int k = 1;
while (k < l && t != n) {
k += 2 * (n - t++);
}
if (k > l) {
k -= 2 * (n - --t);
}
if (t == n) {
cout << 1 << endl;
continue;
}
long long int difference = l - k;
long long int c = difference / 2 + t + 1;
if (difference % 2 == 0) {
long long int current = l;
while (current <= r) {
cout << t << " ";
++current;
if (current <= r) {
cout << c++ << " ";
++current;
if (c > n) {
c = ++t + 1;
if (t == n) {
if (current <= r) cout << 1;
break;
}
}
}
}
} else {
cout << c << " ";
++l;
difference = l - k;
c = difference / 2 + t + 1;
if (c > n) {
c = ++t + 1;
if (t == n) {
cout << 1 << endl;
break;
}
}
long long int current = l;
while (current <= r) {
cout << t << " ";
++current;
if (current <= r) {
cout << c++ << " ";
++current;
if (c > n) {
++t;
c = t + 1;
if (t == n) {
if (current <= r) cout << 1;
break;
}
}
}
}
}
cout << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void yes() { cout << "YES" << endl; }
void no() { cout << "NO" << endl; }
void solve(int qq) {
long long n;
cin >> n;
long long l, r;
cin >> l >> r;
long long cnt = 0;
long long odd = 0;
long long start = 0;
if (l == n * (n - 1) + 1) {
cout << 1 << endl;
return;
}
for (long long i = 1; i < n; i++) {
cnt += (n - i) * 2;
if (l <= cnt) {
odd = i;
start = cnt - (n - i) * 2 + 1;
break;
}
}
long long even = odd + ((l - start) / 2 + 1);
for (long long i = l; i <= r; i++) {
if (i % 2 == 0) {
cout << even << " ";
even++;
if (even > n) {
odd++;
even = odd + 1;
if (odd == n) {
odd = 1;
}
}
} else {
cout << odd << " ";
}
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for (int i = 1; i <= t; i++) {
solve(i);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
for (int tc = 0; tc < (t); tc += 1) {
long long n, l, r;
cin >> n >> l >> r;
l--;
bool last1 = false;
if (r == n * (n - 1) + 1) {
last1 = true;
r--;
if (r == l) {
cout << "1\n";
continue;
}
}
long long i = 1;
long long ptr = 0;
while (ptr + (n - i) * 2 <= l) {
ptr += (n - i) * 2;
i++;
}
long long j = i;
j += (l - ptr) / 2;
if (l % 2 == 1) {
cout << j + 1 << " ";
j++;
l++;
}
if (j != n) {
j++;
} else {
i++;
j = i + 1;
}
while (r > l) {
if (r - l == 1) {
cout << i << " ";
break;
}
cout << i << " " << j << " ";
if (j != n) {
j++;
} else {
i++;
j = i + 1;
}
r -= 2;
}
if (last1) cout << "1";
cout << "\n";
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long T, t, n, N, l, L, R;
vector<int> v;
pair<int, int> calcL() {
for (n = l = 0; n < N; n++) {
if ((l + (N - (n + 1))) > (L / 2)) break;
l += (N - (n + 1));
}
return pair<int, int>(n, 1 + n + (int)((L / 2) - l));
}
void fill() {
v.clear();
pair<int, int> curr = calcL();
for (n = L; n <= R; n++) {
if (curr.first >= (N - 1)) {
curr.first = 0;
}
if (curr.second >= N) {
curr.second = 0;
}
if (n & 1) {
v.push_back(curr.second);
if (curr.second == (N - 1)) {
curr = pair<int, int>((curr.first + 1), (curr.first + 2));
} else
curr.second++;
} else
v.push_back(curr.first);
}
}
int main() {
cin >> T;
for (t = 0; t < T; t++) {
cin >> N >> L >> R;
L--;
R--;
fill();
for (n = 0; n <= (R - L); n++) {
printf("%d ", 1 + v[n]);
}
printf("\n");
}
return 0;
}
| 10 | CPP |
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
def solve(n,l,r):
fir,st = 0,1
while st < n:
x = 2*(n-st)
if fir+x >= l:
break
fir += x
st += 1
if st == n:
return [1]
ans = []
for z in range(st+1,n+1):
ans.append(st)
ans.append(z)
st += 1
while len(ans) < r-fir:
if st == n:
ans.append(1)
else:
for z in range(st+1,n+1):
ans.append(st)
ans.append(z)
st += 1
return ans[l-fir-1:r-fir]
def main():
for _ in range(int(input())):
n,l,r = map(int,input().split())
print(*solve(n,l,r))
# Fast IO Region
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")
if __name__ == "__main__":
main() | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, l, r;
int Go() {
scanf("%lld %lld %lld", &n, &l, &r);
long long len = r - l + 1;
long long x = n;
long long y = 0;
long long start = 0;
while (1) {
y += 2 * (x - 1);
x--;
start++;
if (x <= 0 || y >= l) break;
}
long long k = y - 2 * x;
long long d = (l - k + 1) / 2;
long long add = start + d;
vector<long long> Ans;
long long count = 0;
if (l % 2 == 0) {
Ans.push_back(add++);
count++;
}
while (count < len) {
if (add == n + 1) {
start++;
add = start + 1;
}
Ans.push_back(start);
count++;
if (count == len) break;
Ans.push_back(add);
count++;
add++;
}
if (r == n * (n - 1) + 1) {
Ans.pop_back();
Ans.push_back(1);
}
for (int i = 0; i < Ans.size(); ++i) printf("%lld ", Ans[i]);
puts("");
return 0;
}
int main() {
int t;
if (1)
scanf("%d", &t);
else
t = 1;
while (t--) Go();
}
| 10 | CPP |
import sys
import math
input = sys.stdin.readline
from functools import cmp_to_key;
def pi():
return(int(input()))
def pl():
return(int(input(), 16))
def ti():
return(list(map(int,input().split())))
def ts():
s = input()
return(list(s[:len(s) - 1]))
def invr():
return(map(int,input().split()))
mod = 1000000007;
f = [];
def fact(n,m):
global f;
f = [1 for i in range(n+1)];
f[0] = 1;
for i in range(1,n+1):
f[i] = (f[i-1]*i)%m;
def fast_mod_exp(a,b,m):
res = 1;
while b > 0:
if b & 1:
res = (res*a)%m;
a = (a*a)%m;
b = b >> 1;
return res;
def inverseMod(n,m):
return fast_mod_exp(n,m-2,m);
def ncr(n,r,m):
if r == 0: return 1;
return ((f[n]*inverseMod(f[n-r],m))%m*inverseMod(f[r],m))%m;
def main():
D();
def xdfs(root, v, sub, parent):
st = [root];
while len(st) > 0:
node = st.pop();
for i in range(len(v[node])):
if v[node][i] != node:
st.append(v[node][i]);
def X():
try:
t = pi();
while t:
t -= 1;
n = pi();
v = [[] for i in range(n)];
for i in range(n-1):
[x,y] = ti();
v[x-1].append(y-1);
v[y-1].append(x-1);
m = pi();
p = ti();
e = [0 for i in range(n-1)];
sub = [0 for i in range(n)];
dfs(0,v,sub,-1)
for i in range(1,n):
e[i-1] = (sub[i]*(n-sub[i]));
if len(p) < n-1:
while len(p) < n-1:
p.append(1);
p = sorted(p);
if len(p) > n-1:
x = 1;
for i in range(n-2,len(p)):
x = (x*p[i]);
while len(p) > n-2:
p.pop();
p.append(x);
e = sorted(e);
res = 0;
for i in range(n-1):
res = (res+(p[i]*e[i]))%mod;
print(res);
except:
print(sys.exc_info());
def bfs(v,root):
q = [root,None];
l = 0;
visited = [0 for i in range(len(v))];
dist = [0 for i in range(len(v))];
while len(q) > 0:
node = q.pop(0);
if node is not None:
visited[node] = 1;
dist[node] = l;
for i in range(len(v[node])):
if visited[v[node][i]] == 0:
visited[v[node][i]] = 1;
q.append(v[node][i]);
else:
l += 1;
if len(q) != 0:
q.append(None);
return dist;
def B():
n = pi();
v = [[] for i in range(n)];
for i in range(n-1):
[x,y] = ti();
v[x-1].append(y-1);
v[y-1].append(x-1);
leafs = [];
for i in range(n):
if len(v[i]) == 1:
leafs.append(i);
mn = 1;
d = bfs(v,leafs[0]);
for i in range(1,len(leafs)):
if d[leafs[i]] % 2 != 0:
mn = 3;
break;
count = 0;
for i in range(n):
f = 0;
for j in range(len(v[i])):
if len(v[v[i][j]]) == 1:
f = 1;
break;
if f: count += 1;
mx = n-1-len(leafs)+count;
print(mn,mx)
def D():
t = pi();
while t:
t -= 1;
[n,l,r] = ti();
p = 0;
i = 1;
nxt = 0;
res = [];
st = 0;
while i <= n and p <= l:
if p+2*(n-i) >= l:
d = l-p-1;
if d%2 == 0:
st = i;
nxt = i+1+(d/2);
if d%2 != 0:
st = i+1+((d-1)/2);
p = l;
break;
p += 2*(n-i);
i += 1;
while i <= n and p <= r:
if nxt != 0:
while p <= r and nxt <= n:
if p <= r:
res.append(i);
p += 1;
if p <= r:
res.append(int(nxt));
p += 1;
nxt += 1;
i += 1;
nxt = i+1;
else:
nxt = st+1;
# if nxt == n:
# i += 1;
# nxt = i+1;
res.append(int(st));
p += 1;
while p <= r and nxt <= n:
if p <= r:
res.append(i);
p += 1;
if p <= r:
res.append(int(nxt));
p += 1;
nxt += 1;
i += 1;
nxt = i+1;
if r == (n-1)*(n-1)+n: res.append(1);
print(*res, sep=" ");
main(); | 10 | PYTHON3 |
from sys import stdin
from collections import deque
mod = 10**9 + 7
import sys
import random
# sys.setrecursionlimit(10**6)
from queue import PriorityQueue
# def rl():
# return [int(w) for w in stdin.readline().split()]
from bisect import bisect_right
from bisect import bisect_left
from collections import defaultdict
from math import sqrt,factorial,gcd,log2,inf,ceil
# map(int,input().split())
# # l = list(map(int,input().split()))
# from itertools import permutations
import heapq
# input = lambda: sys.stdin.readline().rstrip()
input = lambda : sys.stdin.readline().rstrip()
from sys import stdin, stdout
from heapq import heapify, heappush, heappop
from itertools import permutations
from math import factorial as f
# def ncr(x, y):
# return f(x) // (f(y) * f(x - y))
def ncr(n, r, p):
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den,
p - 2, p)) % p
def solve(n):
return (n*(n+1))//2
t = int(input())
for _ in range(t):
n,l,r = map(int,input().split())
# print((2*n - 1)**2,4*l)
if 2*(n)*n - (n)*(n+1) + 1 == l:
print(1)
continue
# print(2*(n)*n - (n)*(n+1))
z_1 = (2*n - 1 + sqrt((2*n - 1)**2 - 4*l))
z_2 = (2*n - 1 - sqrt((2*n - 1)**2 - 4*l))
z1 = ceil(min(z_1,z_2) / 2)
# print(2*(n)*n - (n)*(n+1))
# z_1 = 2*n - 1 + sqrt((2*n - 1)**2 + 4*r)
# z_2 = 2*n - 1 - sqrt((2*n - 1)**2 + 4*r)
# z2 = max(-z_1,-z_2) // 2
# print(z1)
# print(z1)
z0 = z1-1
la = l
l-= 2*(z0)*n - (z0)*(z0+1)
# print(z1,l)l
# z0 = z23
# 2 1 3
# 3 3 6
# 99995 9998900031 9998900031
# r-= 2*(z0)*n - (z0)*(z0+1)
# z1+=1
# print(z1)
# if z1 == n:
# print(1)
# continue
# z2+=1
ans = []
if l%2==0:
k1 = l//2
l = la
else:
ans.append(int(z1))
k1 = (l+1)//2
l = la
if r-l +1 == len(ans):
print(*ans)
continue
l+=1
# print(k1)
ha = z1+1 + (k1-1)
ans.append(int(ha))
l+=1
cnt = max(ans)+1
while l!=r+1:
if ans[-1] == n:
z1+=1
cnt = z1+1
if z1 == n+1 or z1 == n:
ans.append(1)
break
else:
ans.append(int(z1))
else:
if l%2 != 0:
ans.append(int(z1))
else:
ans.append(int(cnt))
cnt+=1
l+=1
print(*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)
sys.stdout.write(" ".join(map(str,ANS[l-1:r]))+"\n")
| 10 | PYTHON3 |
from sys import stdin, gettrace
from math import sqrt
if not gettrace():
def input():
return next(stdin)[:-1]
# def input():
# return stdin.buffer.readline()
def main():
def solve():
n,l,r = map(int, input().split())
lv = int((2*n+1 - sqrt((2*n-1)**2 -4*(l-1)))/2)
lvs = -2*n+2*n*lv-lv*lv+lv
lrd = l - lvs - 1
res = []
i = lv
j = lv+lrd//2 + 1
if l%2 == 0:
res = [j]
if j < n:
j+=1
else:
i+=1
j = i+1
for _ in range(l-1, r, 2):
res += [i,j]
if j < n:
j += 1
else:
i +=1
j = i+1
if r == n*(n-1)+1:
res[r-l] = 1
print(*res[:r-l+1])
q = int(input())
for _ in range(q):
solve()
if __name__ == "__main__":
main() | 10 | PYTHON3 |
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
import threading
from bisect import bisect_right
from heapq import heapify,heappush,heappop
def main():
for _ in range(int(input())):
n,l,r=map(int,input().split())
l-=1
ptrn=[]
for i in range(2,10**5+2):
ptrn.append(1)
ptrn.append(i)
# print(ptrn[:10])
lth=2*(n-1)
ans=[]
sf=0
ps=0
while lth>0:
# print(lth,sf,lth,max(ps,l),min(r,ps+lth))
for i in range(max(ps,l),min(r,ps+lth)):
ans.append(ptrn[i-ps]+sf)
ps+=lth
lth-=2
sf+=1
if r==n*(n-1)+1:
ans.append(1)
print(*ans)
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.