[백준/java] 15651 - N과 M (3)

문제

15651번: N과 M (3)

코드

	//https://github.com/SiwonLim/Algorithm_PS_2022/blob/master/src/Java/prac_20220316.java
	import java.io.*;
	import java.util.*;
	//BOJ_15651_N과 M (3)
	public class Main {
	static int N,M;
	static int[] selected;
	static StringBuilder sb = new StringBuilder();
	//input은 외워주자!
	static void input(){
	FastReader fr = new FastReader();
	N = fr.nextInt();
	M = fr.nextInt();
	selected = new int[N+1];
	}
	static void rec_func(int k){
	if(k == M+1){//결과를 리턴
	for(int i = 1 ; i <= M ; i++){
	sb.append(selected[i]).append(' ');
	}
	sb.append('\n');
	}else{//재귀를 호출
	for(int cand = 1 ; cand <= N ; cand++){
	selected[k] = cand;
	//K+1 ~ M번 탐색
	rec_func(k+1);
	selected[k] = 0;
	}
	}
	}
	public static void main(String[] args) {
	input();
	for(int i = 0 ; i < M ; i++){
	selected[i]=0;
	}
	rec_func(1);
	System.out.println(sb.toString());
	}
	//인강
	static class FastReader {
	BufferedReader br;
	StringTokenizer st;
	public FastReader() {
	br = new BufferedReader(new InputStreamReader(System.in));
	}
	String next() {
	while (st == null || !st.hasMoreElements()) {
	try {
	st = new StringTokenizer(br.readLine());
	} catch (IOException e) {
	e.printStackTrace();
	}
	}
	return st.nextToken();
	}
	int nextInt() {
	return Integer.parseInt(next());
	}
	long nextLong() {
	return Long.parseLong(next());
	}
	double nextDouble() {
	return Double.parseDouble(next());
	}
	String nextLine() {
	String str = "";
	try {
	str = br.readLine();
	} catch (IOException e) {
	e.printStackTrace();
	}
	return str;
	}
	}
	}

view raw BOJ_15651_N과 M (3).java hosted with ❤ by GitHub