404

[ Avaa Bypassed ]




Upload:

Command:

elspacio@3.143.254.28: ~ $
ELF>@`T@8	@�%�% -- - �� -- - 888$$�%�%�%  S�td�%�%�%  P�tdH!H!H!||Q�tdR�td-- - GNU�t<��o��ߴ'��@��q�@ �BE�������|�qX� �\�'�Lf� :�l
{����U, F"��L �  R��L ��L __gmon_start___ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalizePyObject_HasAttrPyObject_RichCompareBoolPyString_FromStringPyExc_IndexErrorPyErr_SetStringPyArg_ParseTuplePyObject_GetIterPyList_NewPyList_AppendPyIter_NextPyErr_OccurredPyList_Sort__stack_chk_failPyExc_RuntimeErrorPyArg_UnpackTuplePyExc_TypeErrorPyList_SetSlicePyList_Reverse_Py_NoneStructinit_heapqPy_InitModule4_64PyModule_AddObjectlibpython2.7.so.1.0libpthread.so.0libc.so.6_edata__bss_start_endGLIBC_2.2.5GLIBC_2.4�ui	ii
- �- �- - �K � �K `�K �K L � L `L �H  L 
!(L 8L  K @L � HL �XL `I `L !hL �xL @H �L � �L �L �G �L � �L ��L �G �/ �/ �/ 	�/ 
�/ �/ �/ �/ 0/ 8/ @/ H/ P/ X/ `/ 
h/ p/ x/ �/ �/ �/ �/ �/ �/ �/ �/ ��H��H�)# H��t��H����5Z" �%[" ��h�������h��������h�������h�������h�������h�������h�������h��q������h��a������h	��Q������h
��A������h��1������h��!������h
��������h��������h������h�������h���������%5! D���%-! D���%%! D���%! D���%! D���%
! D���%! D���%�  D���%�  D���%�  D���%�  D���%�  D���%�  D���%�  D���%�  D���%�  D���%�  D���%�  DH�=�= H��= H9�tH��  H��t	�����H�=�= H�5�= H)�H��H��H��?H�H�tH��  H��t��fD�����=U= u+UH�=b  H��tH�=n �Y����d����-= ]������w����UH��SH��H��H�5= H��t8H��������u\�H��H���L������t2�H��)�[]����H�=a�D���H��H��< H��u�H�������[]�f�H��H��H��1�[]���ff.�f�AWAVAUATUSH��8H�GH�t$H�D$H9��(H�T$H�GI��H��L�,�H�D$(H�H�D$H��H��?H�H��H�H�D$H9���I���Ef�H�EI�D$N�4�J�4�H�.uI�D$J�<�H�G�P0I�D$I��J�,0H;\$��K�?H�XL�pI�D$L�,�H�,�L9t$~�N��H��I�L��H�EL�\$ �l���L�\$ I�+uI�s�D$ L��V0�D$ H�muH�u�D$ H��V0�D$ �����I�T$��tJ�,*�+���J�,�N�,�L������H�\$�I�D$J�(H�*�EI�D$H�|$(J�<(I9\$��I�D$J�(H�D$H�H9\$|U��fDL�,�����I�I�D$H��H�*uI�D$J�<(H�G�P0I�D$H��N�<(H9l$��I�D$H�k�H�t$H�L�<�L�4�I�L���5���I�/uI�W�D$L���R0�D$����l����D$H�D$H�H�Q�H�L$H�H����H��8�����[]A\A]A^A_��M��I�D$J�(H�*t>I�D$H�|$J�<(H��81�[]A\A]A^A_��I�D$J�<(H�G�P0���I�D$J�<(H�G�P0�fDH�|$(H�H�Q�H�L$H�H���`���H�|$(�D$H�W�R0�D$H��8[]A\A]A^A_�H�PH��R0�D$H��8[]A\A]A^A_�H�$ H�5�H�8�m����������AUH��H�5�ATUSH��(dH�%(H�D$1�H�L$H�T$�������H�|$���I��H����1����I��H����H�|$��1��A�H��L��������H���H��H�u
H�CH��P0H��H9l$��L������H��H��u����H���AI�mu
I�EL��P0I�,$uI�D$L��P0E1�H�T$dH3%(L���%H��([]A\A]ÐI�mu�I�EL��P0��H�f.�H��H�u�H�CH��P0�I�D$H�D$H����H��H��?H�H�H��xMf�H��L����������C���H��H���u��+I�D$H�8H�H�/uH�G�P01�L�������������I�D$H�(L���e���H��H�����H��H���������8�����u�H�+u�H�CH��P0���L�������������I�m�����������f�AWAVAUATUSH��(H�GH�t$H�D$H9��
H�GI��I��H��H;T$F��H�T$I9W������I�GJ��I�I�MI�]I�GJ��L9d$}wI�GM��M�f�H��I�J�,�H�N�,�H�EH���	���H�muH�M�D$H��Q0�D$H�+uH�K�D$H��Q0�D$����_���H��([]A\A]A^A_�H��(1�[]A\A]A^A_��H�� H�5�	H�8����H��(�����[]A\A]A^A_�H�� H�5/	H�8���������뒐AWAVAUATUSH��(H�oH�t$H9���H��L�|$I��H��?H�H�H�$I9�|'�DJ��H�I�D$N�4�M��L;,$��K�?L�hH�XI�D$J��L�1H9�~�H��I�L��H�H��H�T$����I�.H�T$uI�N�D$L���Q0�D$H�T$H�*uH�J�D$H��Q0�D$���t\��LD�I9l$ufI�D$J��L�1�M���L�l$H�t$H��(L��L��[]A\A]A^A_���H�S H�5�H�8��������H��([]A\A]A^A_��H� H�5RH�8�j���H��(�����[]A\A]A^A_�fD��SH����H�5�H�� dH�%(H�D$1�L�L$L�D$�T������|H�D$H�P�����H�x~gH�@1�H�H�D$H�H�D$H�T$H�@H�H�|$�����tH�L$dH3%(H��u\H�� [�@H�+u
H�CH��P01���@H�) H�5�1�H�8�p��fDH�� H�5�1�H�8�P���9�f���AUATUSH��H�F�����H�nH��H��tUH�F1�H�u�H��H��L�d�I�$M�����H��tH�C1�H��L�(L� �	������tdH��L��[]A\A]�fDH�a H�5E1�H�8��H��L��[]A\A]�f�H� H�5�E1�H�8�w��DI�muI�EL��E1�P0�f.�E1��t������AUH��H�5�ATUSH��(dH�%(H�D$1�H�L$H�T$�����H�|$��I��H����1���I��H����H�D$H����1��BfDH��L�������H���H��H�u
H�CH��P0H�D$H��H9���L���\�H��H��u���H���NI�mu
I�EL��P0I�,$uI�D$L��P0E1�H�T$dH3%(L���CH��([]A\A]�fDI�mu�I�EL��P0��H�f�H��H�u�H�CH��P0����I�|$��H��H��?H�H�H��H��xYfDH��L����������>���H��H���u��3�I�D$H�8H�H�/uH�G�P01�L�������������I�D$H�(L���5�H��H������H��H��������0�����u�H�+u�H�CH��P0���L�����������L���_��������I�m��������������UH����SH�5jH��(dH�%(H�D$1�L�L$L�D$������H�D$H�P�����H�x��H�@H�H�H�t$H�����H�+��u
H�CH��P0���t[��t_H�D$H�x��H�@1�H�H�D$H�H�D$H�T$H�@H�H�|$�:������u+H�+uH�CH��P0D1��@H�D$H�H�\$H�L$dH3%(H��uAH��([]�H�I H�5-1�H�8����fDH�A H�5�1�H�8����q����USH��H�F���taH�FH��H��H��?H�H�H��y�-DH��H���tH��H���c������u�1�H��[]�DH�� H�H��[]�fDH�� H�5uH�8���1���ff.���H��(H����dH�%(H�D$1�L�L$L�D$H�5Z�����twH�|$H�G���tOH�t$�����tVH�|$1�H�GH�P��L������t=H� H�H�L$dH3%(u&H��(��H�� H�5�H�8�*�1��������S1�A��H�L" H�5�+ H�=���H��t$H�=� H����H��H�5�[H���r�f�[���H��H���__lt__index out of rangenO:nsmallestheapreplaceheap argument must be a listnO:nlargestheappushpopheappush_heapq__about__heappopheapifylist changed size during iteration;|x��������(������(���h�������������T����x�����������zRx�$��0FJw�?:*3$"D�� <\���A�D�G v
CAJ_
FAJDIA���hB�B�B �B(�A0�A8�Dpc
8F0A(B BBBHd
8C0A(B BBBHe
8A0A(B BBBAR
8A0A(B BBBA84��>F�L�A �A(�DP
(A ABBBxp��OB�B�B �B(�A0�A8�D`�
8A0A(B BBBAD
8C0A(B BBBHZ
8F0A(B BBBAt���zB�B�B �B(�A0�A8�D`�
8G0A(B BBBE_
8A0A(B BBBIZ8F0A(B BBB d��E�X0�
AEL������F�B�A �A(�D0b
(D ABBG]
(D ABBJ8�\���_F�L�A �A(�DP
(A ABBG(����_E�N�K@�
AAA4@�����E�A�D N
AAFO
AAGx����H0�
H�����RE�A
JAGNU���- ����
t - - ���o`h�
/ ��
�	���o���o����o�o~���o- ���

 
0
@
P
`
p
�
�
�
�
�
�
�
Heap queues

[explanation by Fran�ois Pinard]

Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
all k, counting elements from 0.  For the sake of comparison,
non-existing elements are considered to be infinite.  The interesting
property of a heap is that a[0] is always its smallest element.

The strange invariant above is meant to be an efficient memory
representation for a tournament.  The numbers below are `k', not a[k]:

                                   0

                  1                                 2

          3               4                5               6

      7       8       9       10      11      12      13      14

    15 16   17 18   19 20   21 22   23 24   25 26   27 28   29 30


In the tree above, each cell `k' is topping `2*k+1' and `2*k+2'.  In
a usual binary tournament we see in sports, each cell is the winner
over the two cells it tops, and we can trace the winner down the tree
to see all opponents s/he had.  However, in many computer applications
of such tournaments, we do not need to trace the history of a winner.
To be more memory efficient, when a winner is promoted, we try to
replace it by something else at a lower level, and the rule becomes
that a cell and the two cells it tops contain three different items,
but the top cell "wins" over the two topped cells.

If this heap invariant is protected at all time, index 0 is clearly
the overall winner.  The simplest algorithmic way to remove it and
find the "next" winner is to move some loser (let's say cell 30 in the
diagram above) into the 0 position, and then percolate this new 0 down
the tree, exchanging values, until the invariant is re-established.
This is clearly logarithmic on the total number of items in the tree.
By iterating over all items, you get an O(n ln n) sort.

A nice feature of this sort is that you can efficiently insert new
items while the sort is going on, provided that the inserted items are
not "better" than the last 0'th element you extracted.  This is
especially useful in simulation contexts, where the tree holds all
incoming events, and the "win" condition means the smallest scheduled
time.  When an event schedule other events for execution, they are
scheduled into the future, so they can easily go into the heap.  So, a
heap is a good structure for implementing schedulers (this is what I
used for my MIDI sequencer :-).

Various structures for implementing schedulers have been extensively
studied, and heaps are good for this, as they are reasonably speedy,
the speed is almost constant, and the worst case is not much different
than the average case.  However, there are other representations which
are more efficient overall, yet the worst cases might be terrible.

Heaps are also very useful in big disk sorts.  You most probably all
know that a big sort implies producing "runs" (which are pre-sorted
sequences, which size is usually related to the amount of CPU memory),
followed by a merging passes for these runs, which merging is often
very cleverly organised[1].  It is very important that the initial
sort produces the longest runs possible.  Tournaments are a good way
to that.  If, using all the memory available to hold a tournament, you
replace and percolate items that happen to fit the current run, you'll
produce runs which are twice the size of the memory for random input,
and much better for input fuzzily ordered.

Moreover, if you output the 0'th item on disk and get an input which
may not fit in the current tournament (because the value "wins" over
the last output value), it cannot fit in the heap, so the size of the
heap decreases.  The freed memory could be cleverly reused immediately
for progressively building a second heap, which grows at exactly the
same rate the first heap is melting.  When the first heap completely
vanishes, you switch heaps and start a new run.  Clever and quite
effective!

In a word, heaps are useful memory structures to know.  I use them in
a few applications, and I think it is good to keep a `heap' module
around. :-)

--------------------
[1] The disk balancing algorithms which are current, nowadays, are
more annoying than clever, and this is a consequence of the seeking
capabilities of the disks.  On devices which cannot seek, like big
tape drives, the story was quite different, and one had to be very
clever to ensure (far in advance) that each tape movement will be the
most effective possible (that is, will best participate at
"progressing" the merge).  Some tapes were even able to read
backwards, and this was also used to avoid the rewinding time.
Believe me, real good tape sorts were quite spectacular to watch!
From all times, sorting has always been a Great Art! :-)
Heap queue algorithm (a.k.a. priority queue).

Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
all k, counting elements from 0.  For the sake of comparison,
non-existing elements are considered to be infinite.  The interesting
property of a heap is that a[0] is always its smallest element.

Usage:

heap = []            # creates an empty heap
heappush(heap, item) # pushes a new item on the heap
item = heappop(heap) # pops the smallest item from the heap
item = heap[0]       # smallest item on the heap without popping it
heapify(x)           # transforms list into a heap, in-place, in linear time
item = heapreplace(heap, item) # pops and returns smallest item, and adds
                               # new item; the heap size is unchanged

Our API differs from textbook heap algorithms as follows:

- We use 0-based indexing.  This makes the relationship between the
  index for a node and the indexes for its children slightly less
  obvious, but is more suitable since Python uses 0-based indexing.

- Our heappop() method returns the smallest item, not the largest.

These two make it possible to view the heap as a regular Python list
without surprises: heap[0] is the smallest item, and heap.sort()
maintains the heap invariant!
Find the n smallest elements in a dataset.

Equivalent to:  sorted(iterable)[:n]
Find the n largest elements in a dataset.

Equivalent to:  sorted(iterable, reverse=True)[:n]
Transform list into a heap, in-place, in O(len(heap)) time.heappushpop(heap, item) -> value. Push item on the heap, then pop and return the smallest item
from the heap. The combined action runs more efficiently than
heappush() followed by a separate call to heappop().heapreplace(heap, item) -> value. Pop and return the current smallest value, and add the new item.

This is more efficient than heappop() followed by heappush(), and can be
more appropriate when using a fixed-size heap.  Note that the value
returned may be larger than item!  That constrains reasonable uses of
this routine unless written as part of a conditional replacement:

    if item > heap[0]:
        item = heapreplace(heap, item)
Pop the smallest item off the heap, maintaining the heap invariant.heappush(heap, item) -> None. Push item onto heap, maintaining the heap invariant.� `�K � `�H 
! K � �`I !�@H � �G � ��G GA$3a1�� GA$3p1113�r GA*GA$annobin gcc 8.5.0 20210514GA$plugin name: gcc-annobinGA$running gcc 8.5.0 20210514GA*GA*GA!
GA*FORTIFYGA+GLIBCXX_ASSERTIONSGA*GOW*�GA*cf_protectionGA+omit_frame_pointerGA+stack_clashGA!stack_realign
GA*FORTIFY�cGA+GLIBCXX_ASSERTIONS_heapq.so-2.7.18-17.module_el8.10.0+3783+2756348e.alma.x86_64.debug`�>��7zXZ�ִF!t/���]?�E�h=��ڊ�2N����1ۄY���(N���I�ȼ�ҽ����^�g�PU����|�諅P�=�g��(�n��h�a�n�Ca���X�؝v5"����R�5�5�Y��@�Ĵ�/7k�A��H.	���R_��O�� �夲�f�}�#�A�!}�&0в�]zN��ƜoE��G����:ʃ޶ۤZW���+1����y�Vb���"��:!��)��zZdҘ�,�`DL��ʢ�}e�V�0�B�,0��g$}��E�����p�ʓ��BCm�	9-g���p�'�J���&$�����罳.��
::G����Ht�U�%?�8©�3+�G�/%akݡB�v=�/0��w{���Hn)r�bT�;������v�m����z������ݸAW7���eL#Ȫ
��̍'JL
��J�8���RYj��+��qe~��¶W8�J�	� +�A��T·�2�㭁�;{+*��E{���~?A6�L���wp�p�*r�g����&e�t2���5�����s�m���z���泝�N0!@1مa�RW�j!��G�����e�{�`�3�Wu6i��_�OG�x�j���re��D��D�7	�(\�;1
�/"*�$j��o��]�2H˭�N�d@~*���f�)\r��"�x~8�ƥ|J�3�j�uu�3�jU�}I	��wc[�m�c.�æ�0�'HV��1f?��K͌*�1���k��\�Ѓ��eR��p9ujeX��@�n�p�M��[���0]0^i,|k���sca�}�&uc�ci�vA�n�|1{�ǽ{�}-E���Rn�es_�M#����"'Ծ�/��+Sw���Xߑt�z�*�r��;r�.���ԓ���C	�	��g�YZ.shstrtab.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.plt.sec.text.fini.rodata.eh_frame_hdr.eh_frame.note.gnu.property.init_array.fini_array.data.rel.ro.dynamic.got.data.bss.gnu.build.attributes.gnu_debuglink.gnu_debugdata88$���o``4(���0hh8���o~~<E���o��0T��^B�
�
�h��c��0n�
�
 wb}t t 
�2� � ��H!H!|��!�!���%�% �- -�- -�- -�- -�/ /��0 0� ��L �L��L`�LH
(OHpO�8S(

Filemanager

Name Type Size Permission Actions
File 0 B 0
File 0 B 0
File 0 B 0
2f7aab2340958643f0385965a8fc221aac5def File 7.37 KB 0755
File 0 B 0
File 0 B 0
48e43b89e9a558f23f049391ad448a6f6803ce File 19.51 KB 0755
4e23fc5955c8e181c09c283208f74885469b7d File 117.77 KB 0755
710035e41fa84afac9d0800be05bc832295359 File 12.41 KB 0755
776185ee54878cb2750ed669948bd90fd1e724 File 15.7 KB 0755
7dd41f162839268dd30ee2ff12b26af8292db5 File 37.41 KB 0755
85f368dd58f024d93dce4bd1d3b6b2791afb48 File 35.49 KB 0755
9bea001f407fd12713b42fbc7c86f796761d23 File 123.55 KB 0755
a1aa130e458f1532b5d5d733df1750389328c2 File 11.77 KB 0755
a6743cc5c66f8aabdfb42785eb8e40d3fff071 File 22.91 KB 0755
ac950a44fbdb2f5bbda57655d6c31020a9ce12 File 70.7 KB 0755
ad488486e6a1527e064476e9f2ee8b9e99fc84 File 64.35 KB 0755
b4ed46053a968325c33ae5d2625f2674df3dd3 File 919.12 KB 0755
b4ed46053a968325c33ae5d2625f2674df3dd3.1 File 919.12 KB 0755
b58f1689d73c271f07bbff7b95181958904ec1 File 11.48 KB 0755
bcaa5ce8b1233a5b15d6da0df6ca871ff7f394 File 24.74 KB 0755
bf35d246b61c72c53a4248152daeda99f67dd5 File 109.8 KB 0755
c3603510aa01e5a80f3e7766b8aa057e3cdd50 File 27.52 KB 0755
c5f2b6876e647be98cee1b7965bb084d8a68c9 File 27.87 KB 0755
File 0 B 0