L1-012 计算指数
时间: 2023-08-14 11:15:16 浏览: 66
根据提供的引用内容,有三种方法可以计算指数。
方法一:
```c
#include<stdio.h>
int main() {
int n = 0,sum=1;
scanf("%d", &n);
for (int i = 1;i <= n;i++) {
sum *= 2;
}
printf("2^%d = %d",n, sum);
return 0;
}
```
方法二:
```c
#include<stdio.h>
#include<math.h>
int main() {
int n = 0,sum=1;
scanf("%d", &n);
sum=pow(2,n);
printf("2^%d = %d",n, sum);
return 0;
}
```
方法三:
```c
#include<stdio.h>
#include<math.h>
int main() {
int n = 0,sum=1;
scanf("%d", &n);
sum=pow(2,n);
printf("2^%d = %d",n, sum);
return 0;
}
```
这些方法都可以计算2的n次方,其中n是用户输入的指数。\[1\]\[2\]\[3\]
#### 引用[.reference_title]
- *1* *3* [L1-012 计算指数 (5 分](https://blog.csdn.net/zoroly/article/details/119956314)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^insert_down1,239^v3^insert_chatgpt"}} ] [.reference_item]
- *2* [C语言:L1-012 计算指数 (5 分)](https://blog.csdn.net/WZRbeliever/article/details/122400602)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^insert_down1,239^v3^insert_chatgpt"}} ] [.reference_item]
[ .reference_list ]