3596842_ac_3625ms_35752k.java

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

import java.util.*;

public class Main {
	private Scanner in;
	private LinkedList <Integer> deck = new LinkedList <Integer> ();
	private LinkedList <Integer> good = new LinkedList <Integer> ();

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

	private void run() {
		in = new Scanner(System.in);
		int n, k, p;

		n = in.nextInt();
		k = in.nextInt();
		p = in.nextInt();
		for (int i = 1; i <= k; i++) {
			deck.addLast(i);
		}
		int num = 0;
		for (int i = 0; i < k; i++) {
			num++;
			if (num == n) {	
				good.add(deck.get(0));
				num = 0;
			}
			deck.removeFirst();
			if (deck.isEmpty()) {
				break;
			}
			for (int j = 0; j < p; j++) {
				int tmp = deck.get(0);
				deck.removeFirst();
				deck.addLast(tmp);
			}
		}
		Collections.sort(good);
		for (Integer i : good) {
			System.out.println(i);
		}
	}
}