算法 第二周作业

2.1

import java.util.Scanner;

public class suanfa {
	public static void main(String args[]) {
		long k1;
		Scanner scan = new Scanner(System.in);
		System.out.println("Enter one number:");

		k1 = scan.nextInt();

		isPrime(k1);
	}

	public static int isPrime(long a) {
		boolean e = true;
		for (long i = a - 1; i > 1; i--) {
			if (a % i == 0) {
				e = false;
			}
		}

		if (e) {
			System.out.println(1);

		} else
			System.out.println(0);

		return 0;
	}

}

2.2

import java.util.Random;
import java.util.Scanner;

public class suanfa {
	public static void main(String args[]) {
		int k1;
		Scanner scan = new Scanner(System.