[백준/java] 15649 - N과 M (1)

문제

15649번: N과 M (1)

코드() *가 아니라면 알려주세요. 감사합니다(--)(__)*

	import java.util.Scanner;
	//알고리즘 인강 복습
	public class Main {
	static StringBuilder sb = new StringBuilder();
	static int N,M;//N개중에 M개
	static int[] selected;
	private static void input(){
	Scanner scanner = new Scanner(System.in);
	N = scanner.nextInt();
	M = scanner.nextInt();
	selected = new int[M+1];
	}
	private static void solution(int k){
	if(k == M+1){
	//숫자를 다 골랐을때
	for(int i = 1 ; i <= M ; i++){
	sb.append(selected[i]).append(' ');
	}
	sb.append('\n');
	}else{
	for(int i = 1 ; i <= N ; i++){
	boolean check = false;
	for(int j = 1 ; j < k ; j++){
	if(i == selected[j]){
	check = true;
	}
	}
	if(check == false){
	selected[k] = i;
	solution(k + 1);
	selected[k] = 0;
	}
	}
	}
	}
	public static void main(String[] args){
	input();
	solution(1);
	System.out.println(sb.toString());
	}
	}

view raw 백준_15649.java hosted with ❤ by GitHub