Advertisement
Dimaush

HSE olymp min (dynamic)

Jan 25th, 2024 (edited)
606
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.23 KB | None | 0 0
  1. m = [10 ** 9] * 30
  2. m[0] = 0
  3. m[1] = 0
  4. for i in range(2, 30):
  5.     m[i] = m[i - 1] + 1
  6.     for j in range(1, i // 2 + 1):
  7.         if i % j == 0:
  8.             m[i] = min(m[i], m[j] + m[i // j])
  9. for i in range(30):
  10.     print(i, m[i])
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement