AtCoder Grand Contest 044 A Pay to Win

題意: 有4種操做,你須要用最少的操做使得0變成n.html × 2 \times2 ×2 × 3 \times3 ×3 × 5 \times5 ×5 ± 1 \pm 1 ±1. 反過來考慮這個問題,git 2 ∣ n , n / = 2 2|n,n/=2 2∣n,n/=2 3 ∣ n , n / = 3 3|n,n/=3 3∣n,n/=3 5 ∣ n , n / = 5 5|n,n/=5 5∣n

>>阅读原文<<