[알고리즘] 백준1759 - 암호만들기 java

package a0221;
import java.util.*;

public class 백준1759암호만들기 {

	static int psize;
	static int numsize;
	static char[] nums;
	
	static char[] result;
	
	static void print() {						//result 출력
		for(int i=0; i<psize; i++) {
			System.out.print(result[i]);
		}
		System.out.println();
	}
	
	static boolean check() {
		int mocnt = 0;
		int jacnt = 0;
		
		for(int i=0; i<psize; i++) {
			if(result[i]=='a' || result[i]=='e' || result[i]=='i' ||result[i]=='o' || result[i]=='u')mocnt++;
			else jacnt++;
		}
		if(mocnt>=1 && jacnt>=2)return true;
		return false;
	}
	
	static void find(int cnt, int idx) {
		
		if(cnt==psize) {
			if(check())print();
			return;
		}
		
		for(int i=idx; i<numsize; i++) {
			result[cnt] = nums[i];
			find(cnt+1, i+1);
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		psize = sc.nextInt();
		numsize = sc.nextInt();
		nums = new char[numsize];
		result = new char[psize];
		
		for(int i=0; i<numsize; i++) {
			nums[i] = sc.next().charAt(0);
		}
		
		Arrays.sort(nums);
		find(0, 0);
		
	}
}