首页 > 专题系列 > Java解POJ > POJ 2245 Lotto [解题报告] Java
2013
11-11

POJ 2245 Lotto [解题报告] Java

Lotto

问题描述 :

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.

输入:

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.

输出:

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.

样例输入:

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

样例输出:

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

解题代码:

//* @author: [email protected]
import java.util.Scanner;
public class Main
{
 public static void main(String[] args)
 {
  Scanner in=new Scanner(System.in);
  int count=0;
  while(true)
  {
   count++;
   if(count!=1) System.out.println();	
   int a=in.nextInt();
   if(a==0) break;
   int[] b=new int[a];
   for(int i=0;i< a;i++)
    b[i]=in.nextInt();
   for(int a1=0;a1< a-5;a1++)
    for(int a2=a1+1;a2< a-4;a2++)
     for(int a3=a2+1;a3< a-3;a3++)
      for(int a4=a3+1;a4< a-2;a4++)
       for(int a5=a4+1;a5< a-1;a5++)
	for(int a6=a5+1; a6< a; a6++){
	 System.out.println(b[a1]+" "+b[a2]+" "+b[a3]+" "+b[a4]+" "+b[a5]+" "+b[a6]);
	}
    }					
 }
}

  1. 很高兴你会喜欢这个网站。目前还没有一个开发团队,网站是我一个人在维护,都是用的开源系统,也没有太多需要开发的部分,主要是内容整理。非常感谢你的关注。