2.11英文题面翻译

描述

Bessie is playing a card game with her N-1 (2 <= N <= 100) cow friends using a deck with K (N <= K <= 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:

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.

OpenJudge - 2406:Card Stacking

翻译

描述

贝西正在和她的N-1 (2 <= N <= 100)奶牛朋友玩纸牌游戏，使用K (N <= K <= 100,000;K是N的倍数)。牌组包含M = K/N“好”牌和K-M“坏”牌。贝西是发牌人，自然想把所有的“好”牌都发给自己。她喜欢赢。

她的朋友们怀疑她会作弊，所以他们设计了一个交易系统，试图阻止贝茜作弊。他们告诉她如下处理:

贝茜非常想赢，她让你帮她想清楚她应该把“好”牌放在哪里，这样她就能得到所有的牌。上面的牌是#1，下一张是#2，依此类推。

输入

一行：三个用空格分隔的整数：N，K，P

输出

第1到M行：从上到下的位置，贝西应该放置“好”牌，这样当贝西发牌时，将得到所有的好牌。