游客 Signup | Login
中文 | En

2904 - Games

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:'宋体';">&nbsp;-&nbsp;is&nbsp;to&nbsp;select&nbsp;a&nbsp;subset&nbsp;S&nbsp;containing&nbsp;</span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;(</span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">&gt;6)&nbsp;of&nbsp;these&nbsp;49&nbsp;numbers,&nbsp;and&nbsp;then&nbsp;play&nbsp;sever</span> 


<span style="font-size:12.0000pt;font-family:'宋体';">al&nbsp;games&nbsp;with&nbsp;choosing&nbsp;numbers&nbsp;only&nbsp;from&nbsp;S.&nbsp;For&nbsp;example,&nbsp;for&nbsp;</span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">=8&nbsp;and&nbsp;S&nbsp;=&nbsp;{1,2,3,5,8,13</span> 


<span style="font-size:12.0000pt;font-family:'宋体';">,21,34}&nbsp;there&nbsp;are&nbsp;28&nbsp;possible&nbsp;games:&nbsp;[1,2,3,5,8,13],&nbsp;[1,2,3,5,8,21],&nbsp;[1,2,3,5,8,34], <br />


<span style="font-size:12.0000pt;font-family:'宋体';">[1,2,3,5,13,21],&nbsp;...&nbsp;[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&nbsp;job&nbsp;is&nbsp;to&nbsp;write&nbsp;a&nbsp;program&nbsp;that&nbsp;reads&nbsp;in&nbsp;the&nbsp;number&nbsp;</span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;and&nbsp;the&nbsp;set&nbsp;S&nbsp;and&nbsp;then <br />


<span style="font-size:12.0000pt;font-family:'宋体';">prints&nbsp;all&nbsp;possible&nbsp;games&nbsp;choosing&nbsp;numbers&nbsp;only&nbsp;from&nbsp;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&nbsp;containing&nbsp;several&nbsp;integers&nbsp;separated&nbsp;from&nbsp;each&nbsp;other&nbsp;by&nbsp;spaces.&nbsp;The&nbsp;first <br />


<span style="font-size:12.0000pt;font-family:'宋体';">integer&nbsp;on&nbsp;the&nbsp;line&nbsp;will&nbsp;be&nbsp;the&nbsp;number&nbsp;</span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;(6&nbsp;&lt;&nbsp;</span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;&lt;&nbsp;13).&nbsp;Then&nbsp;</span><span style="font-style:italic;font-size:12.0000pt;font-family:'宋体';">k</span><span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;integers,&nbsp;specifying <br />


<span style="font-size:12.0000pt;font-family:'宋体';">the&nbsp;set&nbsp;S,&nbsp;will&nbsp;follow&nbsp;in&nbsp;ascending&nbsp;order.&nbsp;Input&nbsp;will&nbsp;be&nbsp;terminated&nbsp;by&nbsp;a&nbsp;value&nbsp;of</span> 


<span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;zero&nbsp;(0)&nbsp;for&nbsp;</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&nbsp;one&nbsp;space.&nbsp;The&nbsp;games&nbsp;themselves&nbsp;have&nbsp;to&nbsp;be&nbsp;sorted&nbsp;lexicographically,&nbsp;that <br />


<span style="font-size:12.0000pt;font-family:'宋体';">means&nbsp;sorted&nbsp;by&nbsp;the&nbsp;lowest&nbsp;number&nbsp;first,&nbsp;then&nbsp;by&nbsp;the&nbsp;second&nbsp;lowest&nbsp;and&nbsp;so&nbsp;on,&nbsp;as <br />


<span style="font-size:12.0000pt;font-family:'宋体';">demonstrated&nbsp;in&nbsp;the&nbsp;sample&nbsp;output&nbsp;below.&nbsp;The&nbsp;test&nbsp;cases&nbsp;have&nbsp;to&nbsp;be&nbsp;separated&nbsp;from <br />


<span style="font-size:12.0000pt;font-family:'宋体';">each&nbsp;other&nbsp;by&nbsp;exactly&nbsp;one&nbsp;blank&nbsp;line.&nbsp;Do&nbsp;not&nbsp;put&nbsp;a&nbsp;blank&nbsp;line&nbsp;after&nbsp;the&nbsp;last&nbsp;test <br />


<span style="font-size:12.0000pt;font-family:'宋体';">case.</span>

Examples

Input

7 1 2 3 4 5 6 7
0

Output

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

Hint

出题人：李雪峰

Solution C++

#include <iostream>
#include <memory>
using namespace std;

int isSelect[14];
int num[14];
int ans[6];
int n;

void DFS(int i)
{
    for ( int j = 0; j < n; j++ )
    {
        if ( isSelect[j] == 0 )
        {
            ans[i] = num[j];
            isSelect[j] = 1;
            
            if ( i == 5 )
            {
                bool ok = true;
                for ( int k = 0; k < 5; k++ )
                {
                    if ( ans[k] > ans[k+1] )
                    {
                        ok = false;
                        break;
                    }
                }
                if ( ok )
                {
                    cout << ans[0];
                    for ( int k = 1; k < 6; k++ )
                    {
                        cout << " " << ans[k];
                    }
                    cout << endl;
                }
            }
            else
            {
                DFS(i+1);
            }

            isSelect[j] = 0;
        }
    }
}

int main()
{
    int flag = 1;
    
    cin >> n;
    while ( n != 0 )
    {
        if ( flag == 0 )
        {
            cout << endl;
        }
        else
        {
            flag = 0;
        }
        
        for ( int i = 0; i < n; i++ )
        {
            cin >> num[i];
        }
        
       
        for(int i=0;i<14;i++)
			isSelect[i] = 0;
        DFS(0);
        
        cin >> n;
    }
    
    return 0;
}

Hint

出题人：李雪峰

Time Limit 1 second
Memory Limit 128 MB
Discuss Stats
上一题 下一题