zoukankan      html  css  js  c++  java
  • HDU1342 Lotto 【深搜】

    Lotto

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 1411    Accepted Submission(s): 697


    Problem Description
    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 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 file 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

    简单的深搜,话说这题的输出格式真的好奇葩啊。。

    #include <stdio.h>
    int arr[14], vis[14], n, store[6], id, blank;
    
    void DFS(int k){
    	if(id == 6){
    		for(int i = 0; i < 6; ++i)
    			if(i == 0) printf("%d", store[i]);
    			else printf(" %d", store[i]);
    		printf("
    "); return;		
    	}
    	for(int i = k; i < n; ++i){
    		if(!vis[i]){
    			store[id++] = arr[i];
    			vis[i] = 1; DFS(i + 1);
    			vis[i] = 0; --id;
    		}
    	}
    }
    
    int main(){
    	while(scanf("%d", &n), n){
    		for(int i = 0; i < n; ++i){
    			scanf("%d", arr + i);
    			vis[i] = 0;
    		}
    		if(blank) printf("
    ");
    		id = 0; DFS(0);
    		++blank;
    	}
    	return 0;
    }


  • 相关阅读:
    项目中用到的ext及js细节
    《软件调试艺术》读后感六
    同步数据
    数组首地址取地址
    Storm简述及集群安装
    html5之canvas画图 1.写字板功能
    Memcached安装与配置
    WIP完工入库及完工退回的几个重要问题
    赵雅智:service_bindService生命周期
    【Android开发经验】Cannot generate texture from bitmap异常的解决方式
  • 原文地址:https://www.cnblogs.com/mengfanrong/p/4302572.html
Copyright © 2011-2022 走看看