2904 - Games
Time Limit : 1 秒
Memory Limit : 128 MB
In a Lotto I have ever played, one has to select 6 numbers from the set {1,2,...,49}.
A popular strategy to play Lotto - although it doesn't increase your chance of
<span style="font-size:12.0000pt;font-family:'宋体';">winning</span>
<span style="font-size:12.0000pt;font-family:'宋体';"> - is to select a subset S containing </span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';"> (</span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">>6) of these 49 numbers, and then play sever</span>
<span style="font-size:12.0000pt;font-family:'宋体';">al games with choosing numbers only from S. For example, for </span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">=8 and S = {1,2,3,5,8,13</span>
<span style="font-size:12.0000pt;font-family:'宋体';">,21,34} there are 28 possible games: [1,2,3,5,8,13], [1,2,3,5,8,21], [1,2,3,5,8,34], <br />
<span style="font-size:12.0000pt;font-family:'宋体';">[1,2,3,5,13,21], ... [3,5,8,13,21,34].</span><span style="font-size:12.0000pt;font-family:'宋体';"></span>
<span style="font-size:12.0000pt;font-family:'宋体';">Your job is to write a program that reads in the number </span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';"> and the set S and then <br />
<span style="font-size:12.0000pt;font-family:'宋体';">prints all possible games choosing numbers only from S.</span><span style="font-size:12.0000pt;font-family:'宋体';"></span>
Input
The input file will contain one or more test cases. Each test case consists of one
<span style="font-size:12.0000pt;font-family:'宋体';">line containing several integers separated from each other by spaces. The first <br />
<span style="font-size:12.0000pt;font-family:'宋体';">integer on the line will be the number </span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';"> (6 < </span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';"> < 13). Then </span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';"> integers, specifying <br />
<span style="font-size:12.0000pt;font-family:'宋体';">the set S, will follow in ascending order. Input will be terminated by a value of</span>
<span style="font-size:12.0000pt;font-family:'宋体';"> zero (0) for </span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">.</span>
Output
For each test case, print all possible games, each game on one line. The numbers of
each game have to be sorted in ascending order and separated from each other by
<span style="font-size:12.0000pt;font-family:'宋体';">exactly one space. The games themselves have to be sorted lexicographically, that <br />
<span style="font-size:12.0000pt;font-family:'宋体';">means sorted by the lowest number first, then by the second lowest and so on, as <br />
<span style="font-size:12.0000pt;font-family:'宋体';">demonstrated in the sample output below. The test cases have to be separated from <br />
<span style="font-size:12.0000pt;font-family:'宋体';">each other by exactly one blank line. Do not put a blank line after the last test <br />
<span style="font-size:12.0000pt;font-family:'宋体';">case.</span>
Examples
Input Format
7 1 2 3 4 5 6 7 0
Output Format
1 2 3 4 5 6 1 2 3 4 5 7 1 2 3 4 6 7 1 2 3 5 6 7 1 2 4 5 6 7 1 3 4 5 6 7 2 3 4 5 6 7