HDU 5241 Friends

Friends

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)

Total Submission(s): 515    Accepted Submission(s): 258

Problem Description

Mike has many friends. Here are nine of them: Alice, Bob, Carol, Dave, Eve, Frank, Gloria, Henry and Irene. 

Mike is so skillful that he can master  n  languages (aka. programming languages).

His nine friends are all weaker than he. The sets they can master are all subsets of Mike's languages.

But the relations between the nine friends is very complex. Here are some clues.

1. Alice is a nice girl, so her subset is a superset of Bob's.
2. Bob is a naughty boy, so his subset is a superset of Carol's.
3. Dave is a handsome boy, so his subset is a superset of Eve's.
4. Eve is an evil girl, so her subset is a superset of Frank's.
5. Gloria is a cute girl, so her subset is a superset of Henry's.
6. Henry is a tall boy, so his subset is a superset of Irene's.
7. Alice is a nice girl, so her subset is a superset of Eve's.
8. Eve is an evil girl, so her subset is a superset of Carol's.
9. Dave is a handsome boy, so his subset is a superset of Gloria's.
10. Gloria is a cute girl, so her subset is a superset of Frank's.
11. Gloria is a cute girl, so her subset is a superset of Bob's.

Now Mike wants to know, how many situations there might be.

 

Input

The first line contains an integer  T ( T≤20 ) denoting the number of test cases.

For each test case, the first line contains an integer  n ( 0≤n≤3000 ), denoting the number of languages.

 

Output

For each test case, output ''Case #t:'' to represent this is the t-th case. And then output the answer.

 

Sample Input

  
  

   
   2
0
2
  
  

 

Sample Output

  
  

   
   Case #1: 1
Case #2: 1024
  
  

 

Source

The 2015 ACM-ICPC China Shanghai Metropolitan Programming Contest

分析：每一种语言具有相互对立性，就能清楚答案其实是语言数量的若干次方，然后就能根据样例f(0)=1,f(2)=1024轻易推出这道题的答案就是32^n。

  大数乘法，用java方便。

CODE：

import java.io.*;
import java.math.*;
import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner read=new Scanner(System.in);
        int T;
        T=read.nextInt();
        for(int Case=1;Case<=T;Case++)
        {
            int n=read.nextInt();
            System.out.printf("Case #%d: ",Case);
            System.out.println(BigInteger.valueOf(32).pow(n));
        }
    }
}