123456789101112131415161718192021222324252627282930313233343536373839404142 |
- package contest1400;
- import java.util.Arrays;
- import java.util.Scanner;
- public class H {
- static int N = 1000000;
- static boolean prime[] = new boolean[N + 1];
- static void fill() {
- Arrays.fill(prime, true);
- int c;
- for (int j = 1; j <= N; j++) {
- int a = j;
- while (a != 0) {
- c = a % 10;
- a = a / 10;
- if (c == 0)
- prime[j] = false;
- }
- }
- }
- public static void main(String[] args) {
- Scanner cin = new Scanner(System.in);
- fill();
- while (cin.hasNext()) {
- int c = 0;
- int a = cin.nextInt();
- if (prime[a] == false)
- System.out.println("Unlucky");
- else {
- for (int i = 1; i <= a; i++)
- if (prime[i] == true)
- c++;
- System.out.println(c);
- }
- }
- cin.close();
- }
- }
|