[백준-BOJ] 2014

www.acmicpc.net/problem/2014

2014번: 소수의 곱

 

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) throws FileNotFoundException {
		Main s = new Main();
		s.doit();
	}
	
	
	int [] p = new int[100];
	int [] idx = new int[100];
	int [] r = new int[100001];
	int [] nxt = new int[100];
	int K = 0;
	int N = 0;
	public void doit() throws FileNotFoundException{
		//System.setIn(new FileInputStream("input2.txt"));
		Scanner sc = new Scanner(System.in);
		
		
//		int T = sc.nextInt();
//		for(int count = 0; count < T; count++){
			K = sc.nextInt();
			N = sc.nextInt();
			for(int i = 0; i < K; i++){
				p[i] = sc.nextInt();
				nxt[i] = p[i];
			}
			r[0] = 1;
			for(int i = 1; i <= N; i++){
				int mini = getMin();
				r[i] = mini;
				for(int j = 0; j < K; j++){
					if(nxt[j] == mini){
						nxt[j] = p[j] * r[++idx[j]];
					}
				}
			}
			System.out.println(r[N]);
//			Arrays.fill(p, 0);
//			Arrays.fill(nxt, 0);
//			Arrays.fill(idx, 0);
//			Arrays.fill(r, 0);
//			print();
//		}
		sc.close();
		
	}
	public int getMin(){
		int ret = Integer.MAX_VALUE;
		for(int i = 0; i < K; i++){
			if(ret > nxt[i]){
				ret = nxt[i];
			}
		}
		return ret;
	}
	public void print(){
//		System.out.println(Arrays.toString(p));
//		System.out.println(Arrays.toString(nxt));
//		System.out.println(Arrays.toString(r));
	}
	
}