알고리즘 문제 풀이/1DP_과제(~180615)
171212_6603_로또
//https://www.acmicpc.net/problem/6603 #include using namespace std;int lotto[7];int S[14];bool visit[13]={0,};int k;bool chk; void dfs(int n,int cnt){ visit[n]=1; for(int i=1; ;i++) { int nn=n+i; lotto[cnt]=S[nn]; if(cnt==6) { for(int i=0; i k; if(!k) break; for(int i=1; i> S[i]; dfs(0,0); cout
