hdu 2013 蟠桃记(简单的地推)
View Code
1 #include<iostream>
2 #include<cstdio>
3 using namespace std;
4 int main()
5 {
6 int n;
7 __int64 arr[40];
8 while(scanf("%d",&n)!=EOF)
9 {
10 arr[n]=1;
11 for(int i=n-1;i>=1;i--)
12 arr[i]=2*arr[i+1]+2;
13 printf("%I64d\n",arr[1]);
14 }
15 system("pause");
16 return 0;
17
2 #include<cstdio>
3 using namespace std;
4 int main()
5 {
6 int n;
7 __int64 arr[40];
8 while(scanf("%d",&n)!=EOF)
9 {
10 arr[n]=1;
11 for(int i=n-1;i>=1;i--)
12 arr[i]=2*arr[i+1]+2;
13 printf("%I64d\n",arr[1]);
14 }
15 system("pause");
16 return 0;
17