[SWEA] 테네스의 특별한 소수

 

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWRuoqCKkE0DFAXt

SW Expert Academy

 

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Solution {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		boolean[] isPrime = new boolean[1000001];
		isPrime[0] = isPrime[1] = true;
		for(int i=2;i*i<=1000000;i++) {
			for(int j=i*i;j<=1000000;j+=i) {
				if(!isPrime[j]) {
					isPrime[j] = true;
				}
			}
		}
		int T = Integer.parseInt(br.readLine());
		for(int tc=1;tc<=T;tc++) {
			st = new StringTokenizer(br.readLine());
			String d = st.nextToken(); 
			int a = Integer.parseInt(st.nextToken());
			int b = Integer.parseInt(st.nextToken());
			int result = 0;
			for(int i=a;i<=b;i++) {
				if(!isPrime[i] && String.valueOf(i).contains(d)) {
					result++;
				}
			}
			System.out.println("#"+tc+" "+result);
		}
	}
}