miscProeasy
Золотая середина
hackerlab
Task: Guess a number from 0 to 10^24 with only 80 attempts. Solution: Binary search algorithm - log₂(10^24) ≈ 80, making it the only viable approach.
$ ls tags/ techniques/
Binary Search algorithm for optimal guessingLogarithmic complexity calculationNetwork automation with pwntools
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Sign in with GitHub to continue. No email required.
$sign in$ grep --similar
Similar writeups
- [misc][Pro]Кодировщик— hackerlab
- [misc][Pro]Уцуцуга (Utsutuga)— hackerlab
- [pwn][Pro]Birdy— spbctf
- [pwn][Pro]HackerLab: Экзамен?? — Buffer Overflow via scanf(\"%lX\")— hackerlab
- [crypto][Pro]Напиши мне— hackerlab