hdu5241 Friends

题意：一个错综复杂的关系

思路：看样例，猜一发规律是32^n，然后上个大整数就可以了，用心体会

/*#include<bits/stdc++.h>
using namespace std;

const int base=1e4;
void trans(char *x,int *a)		//将正序的字符串x转为10^4进制逆序大整数a
{
	int lx=strlen(x);
	int &la=a[0]=1;
	for(int i=lx-1;i>=0;)
	{
		int t=0,k=i-min(3,i);
		for(int j=k;j<=i;j++) t=t*10+x[j]-'0';
		i=k-1;
		a[la++]=t;
	}
}
void print(int *a)		//输出大整数a
{
	int n=a[0];
	printf("%d",a[--n]);
	for(--n;n;n--) printf("%04d",a[n]);
	printf("\n");
}
void largemul(int *a,int *b,int *ans)
{
	memset(ans,0,sizeof(int)*ans[0]);
	for(int i=1;i<a[0];i++)
	{
		for(int j=1;j<b[0];j++) 
		{
			ans[i+j-1]+=a[i]*b[j]%base;
			ans[i+j]+=a[i]*b[j]/base;
		}
	}
	ans[0]=a[0]+b[0];
	for(int i=1;i<ans[0];i++)
	{
		ans[i+1]+=ans[i]/base;
		ans[i]%=base;
	}
	while(ans[0]>1&&!ans[ans[0]]) ans[0]--;
	ans[0]++;
}
int a[50000],b[50000],ans[50000];
void quick_pow(int *a,int n,int *ans)
{
	ans[0]=2;ans[1]=1;
	while(n)
	{
		if(n&1) 
		{ 
			largemul(a,ans,b);
			memcpy(ans,b,sizeof(int)*b[0]);
		}
		largemul(a,a,b);
		memcpy(a,b,sizeof(int)*b[0]);
		n>>=1;
	}
}
int main()
{
	int T,cas=1;
	scanf("%d",&T);
	while (T--)
	{
		int n;
		scanf("%d",&n);
		a[0]=2;a[1]=32;
		quick_pow(a,n,ans);
		printf("Case #%d: ",cas++);
		print(ans);
	}
}*/



#include<bits/stdc++.h>
using namespace std;
const int maxn = 50050;
const int mod = 100;
int num[maxn];
int len;

int main()
{
	int T,cas=1;
	scanf("%d",&T);
	while (T--)
	{
		int n;
		scanf("%d",&n);
		memset(num,0,sizeof(num));
		num[1]=1;
		len = 1;
		for (int i = 1;i<=n;i++)
		{
			int c = 0;
			for (int j = 1;j<=len;j++)
			{
				num[j]*=32;
				num[j]+=c;
				c = num[j] / mod;
				num[j]%=mod;
			}
			while (c)
			{
				num[++len]=c%mod;
				c/=mod;
			}
		}
		printf("Case #%d: ",cas++);
		for (int i = len;i>0;i--)
		{
			if (i!=len)
				printf("%02d",num[i]);
			else
				printf("%d",num[i]);
		}
		printf("\n");
	}
}

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