#includeunsigned long pow(unsigned long n){//递归求二的N次方 unsigned long res=0; if(n==0) res=1; else res=2*pow(n-1); return res;}void main(){ unsigned long n,sum=0; scanf("%ld",&n); sum=pow(n); prin...