[백준]_2023_신기한소수

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	static StringBuilder sb = new StringBuilder();
	static int T;
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		T = Integer.parseInt(br.readLine());
		
		int[] arr = {2,3,5,7};
		for(int i=0;i<4;i++) {
			dfs(1,arr[i]);
		}
		System.out.println(sb);
	}

	private static void dfs(int cnt, int sosu) {
		if(cnt==T) {
			sb.append(sosu).append("\n");
			return;
		}

		// 홀수인 경우만 추가
		for(int i=1;i<10;i+=2) {
			int nnum = sosu*10+i;
			if(!isCut(nnum)) continue;
			dfs(cnt+1,nnum);
		}
	}

	// 소수 여부 판단
	private static boolean isCut(int a) {
		int n = (int) Math.sqrt(a);
		for (int i = 2; i <= n; i++) {
	        if (a % i == 0) {
	            return false;
	        }
	    }
	    return true;
	}
}