素数

素数

package com.dehui.Function;

/**
 * 素数，只能被1和本身整除。
 */

public class prime {
    public static void main(String[] args) {

        int x=0;
        for (int i = 2; i <= 100; i++) {
            int count = 0;
            for (int j = 1; j < i; j++) {
                if (i % j == 0) count++;
            }
            if (count > 1) continue;
            else {
                System.out.print(i + " ");
                x++;
            }
        }
        System.out.println();
        System.out.println("100内有" + x + "个素数。");
    }
}