잠토의 잠망경

필요 알고리즘 순열 DFS 중복 순열 아래와 같이 각 자리수에 나오는 모든 경우를 만드는 알고리즘은 원하는 형태는 5개의 숫자가 4자리에서 나오므로 5_5_5*5이다. 0 0 0 0 0 0 0 1 0 0 0 2 0 0 0 3 0 0 0 4 0 0 1 0 0 0 1 1 0 0 1 2 0 0 1 3 0 0 1 4 0 0 2 0 0 0 2 1 0 0 2 2 0 0 2 3 0 0 2 4 0 0 3 0 0 0 3 1 ... 0 0 4 2 0 0 4 3 0 0 4 4 0 1 0 0 0 1 0 1 .... 4 4 3 3 4 4 3 4 4 4 4 0 4 4 4 1 4 4 4 2 4 4 4 3 4 4 4 4 for문으로 구현할 경우 #define MAXN 4 #define MAXI 5 int score[MAXN]; vo..

https://github.com/yiwonjae/Project_NewAlgorithm/tree/main/Project_NewAlgorithm/%EC%9D%B8%ED%98%95%20%EC%A0%95%EB%A6%AC(BASIC)_20210208_01 사용한 알고리즘 구간합 DFS ( 순열 구현 위하여 사용 )

https://github.com/yiwonjae/Project_Algorithm/tree/master/Project_20200912_02

https://github.com/yiwonjae/Project_Algorithm/tree/master/Project_20200912_01

https://github.com/yiwonjae/Project_Algorithm/tree/master/ProStudy27_01

https://github.com/yiwonjae/Project_Algorithm/tree/master/ProStudy25_01

https://github.com/yiwonjae/Project_Algorithm/tree/master/ProStudy24_01