[JAVA] 백준 15650번 - N과 M (2)

 

 

<코드>

import java.util.*;
public class Main {
	static int N, M;
	static int arr[];
	static boolean check[];
	
	private static void Backtraking(int x, int cnt) {

		if(cnt == M) {
			for (int i = 0; i < M; i++) {
				System.out.print(arr[i]+" ");
			}
			System.out.println();
			return;
		}else {
			for (int i = 1; i <= N; i++) {
				if(!check[i] & x <= i) {
					check[i] = true;
					arr[cnt] = i;
					Backtraking(i,cnt+1);
					check[i] = false;
				}
			}
		}
	}
	
	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		
		N = sc.nextInt();
		M = sc.nextInt();
		arr = new int[M+1];
		check = new boolean[N+1];

		Backtraking(1,0);
	}
}

 

 

 

https://www.acmicpc.net/problem/15650

15650번: N과 M (2)