2000 LSU Computer Science High School Programming Contest
Veteran Problem 3: Student Grants (Judge Copy)

• Problem Statement
• Test Data 0
• Output for Test Data 0
• Test Data 1
• Output for Test Data 1
• Test Data 2
• Output for Test Data 2
• Test Data 3
• Output for Test Data 3

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.

Veteran Problem 3: Student Grants (Judge Copy)

The Government of Impecunia has decided to discourage tertiary students by making the payments of tertiary grants a long and time-consuming process. Each student is issued a student ID card which has a magnetically encoded strip on the back which records the payment of the student grant. This is initially set to zero. The grant has been set at $40 per year and is paid to the student on the working day nearest to his birthday. (Impecunian society is still somewhat medieval and only males continue with tertiary education.) Thus on any given working day up to 25 students will appear at the nearest office of the Department of Student Subsidies to collect their grant.

The grant is paid by an Automatic Teller Machine which is driven by a reprogrammed pentium chip (you remember the ones with the floating point bug) originally designed to run the state slot machine. The ATM was built in the State Workshops and is designed to be difficult to rob. It consists of an interior vault where it holds a large stock of $1 coins and an output store from which these coins are dispensed. To limit possible losses it will only move coins from the vault to the output store when that is empty. When the machine is switched on in the morning, with an empty output store, it immediately moves 1 coin into the output store. When that has been dispensed it will then move 2 coins, then 3, and so on until it reaches some preset limit k. It then recycles back to 1, then 2 and so on.

The students form a queue at this machine and, in turn, each student inserts his card. The machine dispenses what it has in its output store and updates the amount paid to that student by writing the new total on the card. If the student has not received his full grant, he removes his card and rejoins the queue at the end. If the amount in the store plus what the student has already received comes to more than $40, the machine only pays out enough to make the total up to $40. Since this fact is recorded on the card, it is pointless for the student to continue queuing and he leaves. The amount remaining in the store is then available for the next student.

Write a program that will read in values of N (the number of students, between 1 and 25, inclusive) and k (the limit for that machine, between 1 and 40, inclusive). and calculate the order in which the students leave the queue.

Input and Output

Input will consist of a series of lines each containing a value for N and k as integers. The list will be terminated by two zeroes (0 0).

Output will consist of a line for each line of input and will contain the list of students in the order in which they leave the queue. Students are ordered according to their position in the queue at the start of the day. All numbers must be separated by at least one space

Sample input

5 3
0 0

Sample output

  1  3  5  2  4

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.

Test Data 0

5 3
0 0

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.

Output for Test Data 0

  1  3  5  2  4

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.

Test Data 1

0 0

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.

Output for Test Data 1

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.

Test Data 2

25 1
1 1
25 40
0 0

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.

Output for Test Data 2

  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
  1
  8 10 12 14 16 18 20 21 22 23  5  7 17 24  1  3  4  6 13 15 19 25  2 11  9

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.

Test Data 3

24 39
5 15
3 39
24 5
24 30
0 0

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.

Output for Test Data 3

  8  9 11 13 15 17 19 21 22  5  6  7 18 20  1  3  4 12 16 23 24  2 14 10
  4  5  2  1  3
  2  3  1
  1  5  8 10 14 15 19 20  2  4  6  9 11 13 18 21 22 24  7 16 23  3 12 17
 23 24  2  4  5  6 11 12 14 16 17 19 20 21 22  3  8  9 10  7 13 18  1 15

Return to the Top of Page, 2000 Index Page, Novice Problem Set, or Veteran Problem Set.