Soumettre la recherche
Mettre en ligne
M
•
Télécharger en tant que PPTX, PDF
•
0 j'aime
•
5,457 vues
G
Gimun Eom
Suivre
2016 Sogang Programming Contest Solution Problem M
Lire moins
Lire la suite
Formation
Signaler
Partager
Signaler
Partager
1 sur 5
Télécharger maintenant
Recommandé
Baekjoon Online Judge 1492번 풀이
Baekjoon Online Judge 1492번 풀이
Hongjun Jang
E
E
Gimun Eom
4. dynamic programming(1)
4. dynamic programming(1)
Hongjun Jang
G
G
Gimun Eom
COCI 2006/2007 contest #1 solution
COCI 2006/2007 contest #1 solution
Hongjun Jang
H
H
Gimun Eom
2016 FunctionCup 풀이
2016 FunctionCup 풀이
geunwoo bae
M
M
Gimun Eom
Recommandé
Baekjoon Online Judge 1492번 풀이
Baekjoon Online Judge 1492번 풀이
Hongjun Jang
E
E
Gimun Eom
4. dynamic programming(1)
4. dynamic programming(1)
Hongjun Jang
G
G
Gimun Eom
COCI 2006/2007 contest #1 solution
COCI 2006/2007 contest #1 solution
Hongjun Jang
H
H
Gimun Eom
2016 FunctionCup 풀이
2016 FunctionCup 풀이
geunwoo bae
M
M
Gimun Eom
H
H
Gimun Eom
G
G
Gimun Eom
E
E
Gimun Eom
Capstonetech1 v.0.03
Capstonetech1 v.0.03
Gimun Eom
Capstonetech1 v002
Capstonetech1 v002
Gimun Eom
Capstone tech 1
Capstone tech 1
Gimun Eom
Contenu connexe
Plus de Gimun Eom
H
H
Gimun Eom
G
G
Gimun Eom
E
E
Gimun Eom
Capstonetech1 v.0.03
Capstonetech1 v.0.03
Gimun Eom
Capstonetech1 v002
Capstonetech1 v002
Gimun Eom
Capstone tech 1
Capstone tech 1
Gimun Eom
Plus de Gimun Eom
(6)
H
H
G
G
E
E
Capstonetech1 v.0.03
Capstonetech1 v.0.03
Capstonetech1 v002
Capstonetech1 v002
Capstone tech 1
Capstone tech 1
M
1.
M. 외계 생물
2.
Solution • 포화 이진
트리
3.
Solution • 깊이가 i인
포화 이진 트리 2i+1-1개 2i-1개
4.
Solution • D(i) :
깊이 i인 포화 이진 트리에 번호를 붙이는 경우의 수 • D(i) = {D(i – 1)}2 x 2 𝑖+1−2 2 𝑖−1 , if 0 < i • D(0) = 1 파스칼의 삼각형으로 계산
5.
구현 • 시간복잡도 : DP부분
: O(h) 파스칼삼각형 : O(4h) O(4h)
Télécharger maintenant