Problems
 
 
# Name    
A
standard input/output
1 s, 256 MB
Submit  x26918
B
standard input/output
1 s, 256 MB
Submit  x17726
C1
standard input/output
2 s, 256 MB
Submit  x11719
C2
standard input/output
2 s, 256 MB
Submit  x8849
C3
standard input/output
2 s, 256 MB
Submit  x3277
D
standard input/output
2 s, 512 MB
Submit  x5798
E
standard input/output
2 s, 256 MB
Submit  x1829
F
standard input/output
3 s, 512 MB
Submit  x283
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2025-05-17 18:25:16
Announcement
Problem C3. Hacking Numbers (Hard Version)
*****
Let $f(n)$ be the minimum integer such that there is a sequence of $f(n)$ commands that transforms $x$ into $n$ for all $x(1 \le x \le 10^9)$. You do not know the value of $x$ in advance. Find $f(n)$ such that, no matter what $x$ is, you can always transform it into $n$ using at most $f(n)$ commands.