题解 | #2的n次方计算#
2的n次方计算
http://www.nowcoder.com/practice/35a1e8b18658411388bc1672439de1d9
#include<stdio.h>
#include<math.h>
int main(){
double n;
while(scanf("%lf",&n)!=EOF){
printf("%ld\n",(long)pow(2,n));
}
return 0;
}
2的n次方计算
http://www.nowcoder.com/practice/35a1e8b18658411388bc1672439de1d9
#include<stdio.h>
#include<math.h>
int main(){
double n;
while(scanf("%lf",&n)!=EOF){
printf("%ld\n",(long)pow(2,n));
}
return 0;
}
相关推荐