有n盏灯,编号为1~n。1号将灯全部打开,2将按下所有为2的倍数的开关,(这些灯将被关掉)第3个人按下所有编号为3的倍数的开关(该灯如为打开的, 则将它关闭;如关闭的,则将它打开)。以此类推,一共有k个人,最后有哪些灯开着?

k<=n<=1000


import java.util.Scanner;

public class ssss {
	public static void main(String[] args) {
		ssss s = new ssss();
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int k = scanner.nextInt();
		int[] a = s.inputN(n);
		boolean[] bs = s.inputB(n + 1);
		// 遍历,开关灯
		for (int ni = 1; ni <= k; ni++) {
			for (int kj = 1; kj <= n; kj++) {
				if (kj % ni == 0) {
					bs[kj] = s.light(bs[kj]);
				}
			}
		}
		// 最后开着的灯
		for (int i = 1; i <= n; i++) {
			if (bs[i] == true) {
				System.out.println(i + \" \");
			}
		}
	}

	/**
	 * 填充N盏灯
	 * 
	 * @param n
	 * @return
	 */
	public int[] inputN(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n - 1; i++) {
			a[i] = i;
		}
		return a;
	}

	/**
	 * 初始化灯
	 * 
	 * @param n
	 * @return
	 */
	public boolean[] inputB(int n) {
		boolean[] b = new boolean[n];
		for (int i = 0; i < n - 1; i++) {
			b[i] = false;
		}
		return b;
	}

	/**
	 * 灯的开关(取反),是k倍数的则取反
	 * 
	 * @param l
	 * @return
	 */
	public boolean light(boolean l) {
		if (l == true) {
			return false;
		} else {
			return true;
		}
	}
}

收藏 打印