[BAEKJOON] 15665. N과 M (11)

 

문제링크

www.acmicpc.net/problem/15665

15665번: N과 M (11)

 

package acmicpc.Silver3;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class N과_M11 {
	
	static int n;
	static int m;
	static int[] numbers;
	static int[] tmp_numbers;
	static int[] input;
	static StringBuilder sb;
	
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine(), " ");
		
		n = Integer.parseInt(st.nextToken());
		m = Integer.parseInt(st.nextToken());
		numbers = new int[m];
		tmp_numbers = new int[m];
		input = new int[n];
		
		st = new StringTokenizer(br.readLine(), " ");
		for(int i = 0 ; i < n ; i++) {
			input[i] = Integer.parseInt(st.nextToken());
		}
		Arrays.sort(input);
		sb = new StringBuilder();
		func(0);
		System.out.println(sb);
	}
	
	public static boolean check(int[] a, int[] b) {
		for(int i = 0 ; i < m ; i++) {
			if(a[i] != b[i]) return false;
		}
		return true;
	}
	
	public static void func(int cnt) {
		
		if (cnt == m) {
			if(check(tmp_numbers,numbers)) {
				return;
			}
			else {
				for(int i : numbers) {
					sb.append(i + " ");
				}
				sb.setLength(sb.length() - 1);
				sb.append("\n");
				for(int i = 0 ; i < m ; i++) {
					tmp_numbers[i] = numbers[i];
				}
				return;
			}
		}
		int tmp_num = -1;
		for(int i = 0 ; i < n ; i++) {
			if(tmp_num == input[i]) continue;
			tmp_num = input[i];
			numbers[cnt] = input[i];
			func(cnt + 1);
		}
	}
}

실행결과