zoukankan      html  css  js  c++  java
  • Poj2245--Lotto(DFS)

    Lotto

    Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)
    Total Submission(s) : 16   Accepted Submission(s) : 8
    Problem 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
    PKU
    RE:搞一发。 
     1 #include <cstdio>
     2 #include <cstring>
     3 using namespace std;
     4 int n, dis[15], vis[15], pre[15];
     5 void Dfs(int a, int b)
     6 {
     7     int i;
     8     if(a == 6)
     9     {
    10         for(i = 0; i < 6; i++)
    11         {
    12             if(i > 0)
    13                 printf(" "); 
    14             printf("%d", pre[i]); 
    15         } 
    16         printf("
    ");
    17         return;
    18     } 
    19     else
    20     {
    21         for(i=b; i<n; i++)
    22         {
    23             if(vis[i]) continue;
    24             vis[i] = 1;
    25             pre[a] = dis[i];
    26             Dfs(a + 1, i + 1);
    27             vis[i] = 0; 
    28         } 
    29     } 
    30 }
    31 
    32 int main()
    33 {
    34     int j = 0;
    35     while(~scanf("%d", &n), n)
    36     {
    37         for(int i = 0; i < n; i++)
    38             scanf("%d", &dis[i]);
    39         memset(vis, 0, sizeof(vis));
    40         if(j != 0)
    41             printf("
    ");
    42         Dfs(0, 0);
    43     //    printf("
    ");
    44         
    45         j++;
    46     }
    47     return 0;
    48 }
  • 相关阅读:
    手动安装pydev
    pyqt5猜数小程序
    python IDE之sublime真是个好东东
    python根据字典自动生成一组省和市名
    ubuntu编译安装postgresql
    python生成随机日期字符串
    chrome浏览器视频插件
    python @的用法
    PyQt5调入数据库数据在表格中显示
    计算机视觉2D几何基元及其变换介绍和OpenCV WarpPerspective源码分析
  • 原文地址:https://www.cnblogs.com/soTired/p/4703227.html
Copyright © 2011-2022 走看看