zoukankan      html  css  js  c++  java
  • poj 2245 Lotto

    Lotto
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 6806   Accepted: 4298

    Description

    In the German Lotto you have to select 6 numbers from the set {1,2,...,49}. A popular strategy to play Lotto - although it doesn't increase your chance of winning - is to select a subset S containing k (k > 6) of these 49 numbers, and then play several games with choosing numbers only from S. For example, for k=8 and S = {1,2,3,5,8,13,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], [1,2,3,5,13,21], ... [3,5,8,13,21,34]. 

    Your job is to write a program that reads in the number k and the set S and then prints all possible games choosing numbers only from S. 

    Input

    The input will contain one or more test cases. Each test case consists of one line containing several integers separated from each other by spaces. The first integer on the line will be the number k (6 < k < 13). Then k integers, specifying the set S, will follow in ascending order. Input will be terminated by a value of zero (0) for k.

    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 exactly one space. The games themselves have to be sorted lexicographically, that means sorted by the lowest number first, then by the second lowest and so on, as demonstrated in the sample output below. The test cases have to be separated from each other by exactly one blank line. Do not put a blank line after the last test case.

    Sample Input

    7 1 2 3 4 5 6 7
    8 1 2 3 5 8 13 21 34
    0
    

    Sample 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
    
    1 2 3 5 8 13
    1 2 3 5 8 21
    1 2 3 5 8 34
    1 2 3 5 13 21
    1 2 3 5 13 34
    1 2 3 5 21 34
    1 2 3 8 13 21
    1 2 3 8 13 34
    1 2 3 8 21 34
    1 2 3 13 21 34
    1 2 5 8 13 21
    1 2 5 8 13 34
    1 2 5 8 21 34
    1 2 5 13 21 34
    1 2 8 13 21 34
    1 3 5 8 13 21
    1 3 5 8 13 34
    1 3 5 8 21 34
    1 3 5 13 21 34
    1 3 8 13 21 34
    1 5 8 13 21 34
    2 3 5 8 13 21
    2 3 5 8 13 34
    2 3 5 8 21 34
    2 3 5 13 21 34
    2 3 8 13 21 34
    2 5 8 13 21 34
    3 5 8 13 21 34
    

    Source

     
    题意:枚举 排列组合
    #include<cstdio>
    using namespace std;
    int s[13],K;
    int main(){
        while(scanf("%d",&K)==1&&K){
            for(int i=0;i<K;i++) scanf("%d",s+i);
            for(int i=0;i+5<K;i++)
                for(int j=i+1;j+4<K;j++)
                    for(int l=j+1;l+3<K;l++)
                        for(int m=l+1;m+2<K;m++)
                            for(int n=m+1;n+1<K;n++)
                                for(int o=n+1;o+0<K;o++)
                                    printf("%d %d %d %d %d %d
    ",s[i],s[j],s[l],s[m],s[n],s[o]);                
            printf("
    ");
        }    
        return 0;
    }
  • 相关阅读:
    精选微软经典的算法面试100题
    C++高效程序设计
    算法导论第五章:概率分析和随机算法
    算法导论第六章:堆排序
    算法导论第八章:线性时间排序
    算法导论第六章:堆排序
    算法导论第七章:快速排序
    M0n0wall安装及配置教程(上)
    ASP.NET十分有用的页面间传值方法
    PC网络配置切换脚本(IP地址切换脚本)
  • 原文地址:https://www.cnblogs.com/shenben/p/5536163.html
Copyright © 2011-2022 走看看