2020-09-15 22시 개발자 글 모음 | "패캠 스프링부트" 외 9개 이야기

자바스크립트로 알고리즘 정리하기 #11 다이나믹 프로그래밍 문제풀이 2 by 서진규 about Javascript,Algorithm

let solution = ( input ) => { const n = + input [ 0 ] ; let d = new Array ( n + 1 )
fill ( 0 ) ) ; let answer = '' ; d [ 1 ] [ 1 ] = 1 ; d [ 1 ] [ 2 ] = 0 ; d [ 1 ] [ 3 ] = 0 ; d [ 2 ] [ 1 ] = 0 ; d [ 2 ] [ 2 ] = 1 ; d [ 2 ] [ 3 ] = 0 ; d [ 3 ] [ 1 ] = 1 ; d [ 3 ] [ 2 ] = 1 ; d [ 3 ] [ 3 ] = 1 ; for ( let i = 4 ; i <= n ; i ++ ) { for ( let j = 1 ; j <= 3 ; j ++ ) { for ( let k = 1 ; k <= 3 ; k ++ ) { if ( i - ( i - j ) === k ) continue ; d [ i ] [ j ] += d [ i - j ] [ k ] % 1000000009 ; } } } input
fill ( 0 ) ) ; let mod = 1000000000 ; for ( let i = 1 ; i < 10 ; i ++ ) { d [ 0 ] [ i ] = 1 ; } for ( let i = 1 ; i < n ; i ++ ) { for ( let j = 0 ; j < 10 ; j ++ ) { d [ i ] [ j ] = ( ( d [ i - 1 ] [ j - 1 ] || 0 ) % mod ) + ( ( d [ i - 1 ] [ j + 1 ] || 0 ) % mod ) ; } } return d [ n - 1 ]

int b = - 1 ){ sz [ v ] = 1 ; for ( auto i : g [ v ]) if ( i
get_sz ( v )); use [ cent ] = 1 ; vector < Info > ret ( 1 ); if ( cnt [ cent ]) ret [ 0 ]
1 ); } cin >> m ; for ( int i = 1 ; i <= m ; i ++ ){ int t ; cin >> t ; cnt [ t ] = 1 ; } cin >> k ; for ( int i = 1 ; i <= k ; i ++ ){ int t ; cin >> t ; chk [ t ] = 1 ; } make_binary (); n = pv ; solve (); cout << ans ; }

vector < vector < int >> v ) { n = N ; m = M ; k = K ; for ( int i = 0 ; i < m ; i ++ ) for ( auto j : v [ i ]) color [ j ]
push_back ( i ); for ( int i = 0 ; i < n ; i ++ ){ if ( i - 2 >= 0 ) for ( auto j : color [ wall [ i - 2 ]]) dp [ i & 1 ][ j ] = 0 ; for ( auto j : color [ wall [ i ]]){ dp [ i & 1 ][ j ] = dp [ i - 1 & 1 ][ Mod ( j - 1
m )] + 1 ; if ( dp [ i & 1 ][ j ] >= m ) able [ i ] = 1 ; } } int ret = 0