fork download
copy 
  1. import math
  2. def find(u, par):
  3.  
  4.     if par[u] != u:
  5.         par[u] = find(par[u], par)
  6.     return par[u]
  7.  
  8. def union(u, v, par, size):
  9.     u_root = find(u, par)
  10.     v_root = find(v, par)
  11.  
  12.     if u_root == v_root:
  13.         return 
  14.  
  15.  
  16.     if size[u_root] < size[v_root]:
  17.         par[u_root] = v_root
  18.         size[v_root] += size[u_root]
  19.     else:
  20.         par[v_root] = u_root
  21.         size[u_root] += size[v_root]
  22.  
  23. def ip():
  24.     return map(int,input().split())
  25.  
  26. def f(k):
  27.     # print()
  28.     curr=0
  29.     rem=-1
  30.     for i in range(n):
  31.         # print(i,curr,rem)
  32.  
  33.         if curr==0 and b[i]>=k-1:
  34.             curr=1
  35.             continue
  36.         if curr<=a[i] and b[i]>=k-(curr+1):
  37.             curr+=1
  38.     # print(i,curr,rem)
  39.     if curr>=k:
  40.         return True
  41.     return False
  42.  
  43.  
  44.  
  45.  
  46.  
  47. T=1
  48. T=int(input())
  49. for __ in range(T):
  50.     n=int(input())
  51.     if n==1:
  52.         print(3)
  53.         continue
  54.  
  55.     curr=1
  56.     ct=1
  57.  
  58.     while curr<n:
  59.         nxt=2*curr+1
  60.  
  61.         curr=nxt
  62.         ct+=2
  63.  
  64.     ct+=2
  65.     print(ct)
  66.  
  67.  
  68.  
  69.  
Success #stdin #stdout 0.07s 14128KB
comments (?)
stdin
copy 
7
1
5
14
2025
31415
536870910
1000000000
stdout
copy 
3
7
9
23
31
59
61
https://ideone.com/8e5CFV
language:
Python 3 (python  3.12)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!