Uname : Linux premium36.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Soft : LiteSpeed
Ip : 198.54.115.237
Port : 443
~
/
proc
/
thread-self
/
root
/
opt
/
alt
/
python313
/
lib
/
python3.13
/
site-packages
/
pip
/
_vendor
/
idna
/
__pycache__
[ HOME ]
Exec
Submit
File Name : intranges.cpython-313.pyc
� �ZLgY � � � S r SSKrSSKJrJr S\\ S\\S4 4S jrS\S \S\4S jrS\S\\\4 4S jrS \S\\S4 S\ 4S jr g)a Given a list of integers, made up of (hopefully) a small number of long runs of consecutive integers, compute a representation of the form ((start1, end1), (start2, end2) ...). Then answer the question "was x present in the original list?" in time O(log(# runs)). � N)�List�Tuple�list_�return.c � � [ U 5 n/ nSn[ [ U5 5 HW nUS- [ U5 : a X XS- S- :X a M'