[백준/JAVA] 1978번 : 소수 찾기

https://www.acmicpc.net/problem/1978

1978번: 소수 찾기

 

 

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int num = sc.nextInt();
		int primeNum = 0;
		
		for(int i = 0; i < num; i++) {
			int inputNum = sc.nextInt();
			int count = 0;
			for(int j = 1; j <= inputNum; j++) {
				if(inputNum % j == 0) {
					count++;
				}
			}
			if(count == 2) {
				primeNum++;
			}
		}
		System.out.println(primeNum);
	}
}