题解 | 2的n次方计算
2的n次方计算
https://www.nowcoder.com/practice/35a1e8b18658411388bc1672439de1d9
#include <iostream>
#include<cmath>
using namespace std;
int main() {
int n;
cin>>n;
int num=pow(2,n);
cout<<num<<endl;
}
2的n次方计算
https://www.nowcoder.com/practice/35a1e8b18658411388bc1672439de1d9
#include <iostream>
#include<cmath>
using namespace std;
int main() {
int n;
cin>>n;
int num=pow(2,n);
cout<<num<<endl;
}
相关推荐