3475671_ce.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;

public class p1591 {
	private Scanner in;

	public static void main(String [] args) {
		new p1591().run();
	}

	private void run() {
		int n, x, tot, cas = 1;
		int [] p;
		int [] cards = new int [20];
		in = new Scanner(System.in);

		while (in.hasNext()) {
			n = in.nextInt();
			p = new int [n + 1];
			x = in.nextInt();
			for (int i = 0; i < 20; i++) {
				cards[i] = in.nextInt();
			}
			for (int i = 1; i <= n; i++) {
				p[i] = i;
			}
			tot = n;
			x = n - x;
			for (int i = 0; x != 0 && i < 20; i++) {
				for (int j = cards[i]; x != 0 && j <= tot; j += cards[i]) {
					p[j] = 0;
					x--;
				}
				tot = modify(p, tot);
			}
			System.out.println("Selection #" + cas);
			cas++;
			for (int i = 1; i <= tot; i++) {
				System.out.print(p[i] + " ");
			}
			System.out.println("\n");
		}
	}

	private int modify(int [] p, int length) {
		int ret = 1;

		for (int i = 1; i <= length; i++) {
			if (p[i] != 0) {
				p[ret++] = p[i];
			}
		}
		return ret - 1;
	}
}