Algorithm & SQL/BAEKJOON
백준 JAVA 15650 N과 M(2)
YoonJong
2022. 7. 27. 13:39
728x90
반응형
package BAEKJOON.Silver.Ⅲ;
import java.util.Scanner;
public class NO15650_2 {
static int n;
static int m;
static int[] arr;
public static void DFS(int a, int depth) {
if (depth == m) {
for (int i = 0; i < m; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
} else {
for (int i = a; i <= n; i++) {
arr[depth] = i;
DFS(i + 1, depth + 1);
}
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
m = sc.nextInt();
arr = new int[m];
DFS(1, 0);
}
}
728x90
반응형