challenge-141/abigail/java/ch-1.java


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

//
// See ../README.md
//

//
// Run as: ln ch-1.java ch1.java; javac ch1.java; java ch1 < input-file
//

import java.util.*;

public class ch1 {
    public static void main (String [] args) {
        int count          = 10;
        int nr_of_divisors =  8;
        for (int n = 1; count > 0; n ++) {
            int s = (int) Math . sqrt (n);
            if (n == s * s) {
                continue;
            }
            int c = 0;
            for (int d = 1; d <= s && c <= nr_of_divisors; d ++) {
                if (n % d == 0) {
                    c += 2;
                }
            }
            if (c == nr_of_divisors) {
                System . out . println (n);
                count --;
            }
        }
    }
}