题目
http://codevs.cn/problem/6162/
题解
前缀和优化一下递推,就可以发现答案是2的n-1次方
用无符号长整型unsigned long long 存
特判n=0,输出1
代码:
#include<iostream>
#include<cstdio>
using namespace std;
unsigned long long ans,n,a;
int main(){
//freopen("x.in","r",stdin);
//freopen("x.out","w",stdout);
cin>>n;
if(n==0){
printf("1");
return 0;
}
a=1;
ans=a<<(n-1);
cout<<ans<<endl;
return 0;
}