8000 Merge pull request #156 from yongjunleeme/master · unluckyjung/basic-algo-lecture@8230604 · GitHub
[go: up one dir, main page]

Skip to content

Commit 8230604

Browse filesBrowse files
Merge pull request encrypted-def#156 from yongjunleeme/master
Update 15656.cpp
2 parents b3e7515 + 81619f8 commit 8230604

File tree

1 file changed

+27
-5
lines changed

1 file changed

+27
-5
lines changed

0x0C/solutions/15656.cpp

Lines changed: 27 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,33 @@
1-
// Authored by : BaaaaaaaaaaarkingDog
2-
// Co-authored by : -
3-
// http://boj.kr/****************
1+
// Authored by : yongjunleeme
2+
// Co-authored by : BaaaaaaaaaaarkingDog
3+
// http://boj.kr/8b9c11f721a44186bb4da3bff5e72f88
44
#include <bits/stdc++.h>
55
using namespace std;
66

7+
int n, m;
8+
int arr[10];
9+
int num[10];
10+
11+
void func(int k){ // 현재 k개까지 수를 택했음.
12+
if(k == m){ // m개를 모두 택했으면
13+
for(int i = 0; i < m; i++)
14+
cout << num[arr[i]] << ' '; // arr에 기록해둔 인덱스를 참고해 값을 출력
15+
cout << '\n';
16+
return;
17+
}
18+
for(int i = 0; i < n; i++){
19+
arr[k] = i; // k번째 수를 i로 정함
20+
func(k+1); // 다음 수를 정하러 한 단계 더 들어감
21+
}
22+
}
23+
724
int main(void){
825
ios::sync_with_stdio(0);
926
cin.tie(0);
10-
11-
}
27+
cin >> n >> m;
28+
for(int i = 0; i < n; i++){
29+
cin >> num[i];
30+
}
31+
sort(num, num+n);
32+
func(0);
33+
}

0 commit comments

Comments
 (0)
0