Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Bitnami MediaWiki
Search
Search
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
3693 – Binary Tree
(section)
Page
Discussion
English
Read
Edit
Edit source
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
Edit source
View history
General
What links here
Related changes
Special pages
Page information
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Rezolvare == <syntaxhighlight lang="python3" line="1"> def verificare_restrictii(Q, u, v): if not (1 <= Q <= 100000) or not (1 <= u <= 2000000000) or not (1 <= v <= 2000000000) or u < 0 or v < 0: print("Datele nu corespund restrictiilor impuse") exit() def gaseste_distanta(u, v): # Funcție pentru a găsi distanța dintre două noduri în arborele binar complet distanta = 0 while u != v: # Asigurăm că u este întotdeauna mai mic sau egal decât v if u > v: u, v = v, u v //= 2 # Urmează căutarea pe nivelul anterior pentru v distanta += 1 return distanta # Citim numărul de perechi Q = int(input("Introdu numărul de perechi (Q): ")) # Verificăm restricțiile pentru Q verificare_restrictii(Q, Q, Q) valori_u = [] valori_v = [] # Citim și procesăm fiecare pereche for _ in range(Q): u, v = map(int, input("Introdu perechea u v: ").split()) valori_u.append(u) valori_v.append(v) # Verificăm restricțiile pentru u și v verificare_restrictii(Q, max(valori_u), max(valori_v)) # Afișăm rezultatele la final print("\nRezultate:") for u, v in zip(valori_u, valori_v): distanta = gaseste_distanta(u, v) print(f"{distanta}") </syntaxhighlight>
Summary:
Please note that all contributions to Bitnami MediaWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Bitnami MediaWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Toggle limited content width