๊ด€๋ฆฌ ๋ฉ”๋‰ด

Tech Log ๐Ÿ› ๏ธ

๋ฐฑ์ค€ 1464)1๋กœ ๋งŒ๋“ค๊ธฐ ๋ณธ๋ฌธ

์•Œ๊ณ ๋ฆฌ์ฆ˜/dp

๋ฐฑ์ค€ 1464)1๋กœ ๋งŒ๋“ค๊ธฐ

sehaan 2022. 2. 8. 21:39

์ ‘๊ทผ๋ฐฉ๋ฒ•

-๋ฐ”ํ…€ ์—… ๋ฐฉ์‹์œผ๋กœ ์ง„ํ–‰ํ•˜์˜€๋‹ค.

 2 ,3 ์œผ๋กœ ๋‚˜๋ˆ„์–ด ๋–จ์–ด์ง€๋Š” ์ง€ ํ™•์ธ ํ•œ ํ›„์— ์ด๋ฅผ -1 ์„ ํ•œ ๊ฒฝ์šฐ์™€ ๋น„๊ตํ•ด ๋” ์ž‘์€ ์ˆ˜๋ฅผ ๋ฐฐ์—ด์— ๋„ฃ์–ด์ฃผ์—ˆ๋””.

 

n= int(input())
d= [0] * (n+1)
d[1]=0



for i in range(2,n+1):
    if i%2 ==0 and i%3==0:
        d[i] = min(d[i//2]+1,d[i//3]+1)
    elif i%2 ==0 and i%3 !=0:
        d[i] = d[i//2]+1
    elif i%3 ==0 and i%2 !=0:
        d[i] = d[i//3]+1
    else:
        d[i] = d[i-1]+1
    d[i] = min(d[i-1]+1,d[i])
    print(d[i])
   
       
print(d[n])