POJ3629 :Card Stacking

时间限制:1000MS    内存限制:65536KByte   64位IO格式:%I64d & %I64u
描述

Bessie is playing a card game with her N-1 (2 ≤ N ≤ 100) cow friends using a deck with K (NK ≤ 100,000; K is a multiple of N) cards. The deck contains M = K/N "good" cards and K-M "bad" cards. Bessie is the dealer and, naturally, wants to deal herself all of the "good" cards. She loves winning.

Her friends suspect that she will cheat, though, so they devise a dealing system in an attempt to prevent Bessie from cheating. They tell her to deal as follows:

1. Start by dealing the card on the top of the deck to the cow to her right

2. Every time she deals a card, she must place the next P (1 ≤ P ≤ 10) cards on the bottom of the deck; and

3. Continue dealing in this manner to each player sequentially in a counterclockwise manner

Bessie, desperate to win, asks you to help her figure out where she should put the "good" cards so that she gets all of them. Notationally, the top card is card #1, next card is #2, and so on.

输入

* Line 1: Three space-separated integers: N, K, and P

输出

* Lines 1..M: Positions from top in ascending order in which Bessie should place "good" cards, such that when dealt, Bessie will obtain all good cards.

样例输入
3 9 2
样例输出
3
7
8
题目来源
USACO 2007 December Bronze
[提交] [状态]

|返回 |   | 转到页头|
Copyright © 2008-2026 (浙ICP备2022001332号), TZOJ. All Rights Reserved.
2017-2026 台州市非普软件技术有限公司,浙江省台州市君悦大厦B幢1603室