C语言中用函数表示m的n次方 在C语言中怎样表示一个数的 “n” 次方
C\u8bed\u8a00\u4e2dM\u7684N\u6b21\u65b9\u5728C\u8bed\u8a00\u4e2d\uff0c M\u7684N\u6b21\u65b9\uff0c\u53ef\u4ee5\u6709\u5982\u4e0b\u51e0\u79cd\u8868\u793a\u65b9\u6cd5\uff1a
1\u3001\u4f7f\u7528\u6807\u51c6\u5e93\u51fd\u6570\u7684pow\u3002\u5f62\u5f0f\u4e3a
pow(M,N);
\u4f7f\u7528pow\u51fd\u6570\u9700\u8981\u5f15\u7528\u5934\u6587\u4ef6math.h\uff0c pow\u7684\u53c2\u6570\u548c\u8fd4\u56de\u503c\u7c7b\u578b\u90fd\u662fdouble\u7684\uff0c\u6240\u4ee5\u5f97\u5230\u7684\u662f\u8fd1\u4f3c\u503c\u3002
2\u3001\u5bf9\u4e8e\u8981\u5f97\u5230\u7cbe\u786e\u503c\u7684\uff0c\u5728C\u8bed\u8a00\u4e2d\u5e76\u6ca1\u6709\u7cfb\u7edf\u51fd\u6570\u4f9b\u4f7f\u7528\uff0c\u53ea\u80fd\u81ea\u5df1\u5199\u51fd\u6570\u6765\u5b9e\u73b0\uff0c\u53c2\u8003\u4ee3\u7801\u5982\u4e0b\uff1a
int pow_int(int m, int n){ int r=1,i; for(i = 0; i < n; i ++)//\u5faa\u73af\u6267\u884cn\u6b21\u3002 r*=m;//\u6bcf\u6b21\u4e58\u4e00\u6b21m\uff0c\u7ed3\u679c\u5373m\u7684n\u6b21\u65b9\u3002 return r;//\u8fd4\u56de\u7ed3\u679c\u3002}\u4f7f\u7528\u8fd9\u79cd\u65b9\u5f0f\uff0c\u8981\u6ce8\u610f\u6ea2\u51fa\uff0c\u5c24\u5176\u662f\u5f53n\u6bd4\u8f83\u5927\u7684\u65f6\u5019\uff0c\u5f88\u5bb9\u6613\u51fa\u73b0\u8d85\u51fa\u53d8\u91cf\u8868\u793a\u8303\u56f4\uff0c\u5bfc\u81f4\u6ea2\u51fa\u51fa\u73b0\u3002
C\u8bed\u8a00\u4e2d\u8ba1\u7b97\u4e00\u4e2a\u6570\u7684N\u6b21\u65b9\u53ef\u4ee5\u7528\u5e93\u51fd\u6570pow\u6765\u5b9e\u73b0\u3002\u51fd\u6570\u539f\u578b\uff1adouble pow(double x, double y)\u3002
\u4e3e\u4f8b\u5982\u4e0b\uff1a
double a = pow(3.14, 2); // \u8ba1\u7b973.14\u7684\u5e73\u65b9\u3002
\u6ce8\uff1a\u4f7f\u7528pow\u51fd\u6570\u65f6\uff0c\u9700\u8981\u5c06\u5934\u6587\u4ef6#include\u5305\u542b\u8fdb\u6e90\u6587\u4ef6\u4e2d\u3002
\u62d3\u5c55\u8d44\u6599\uff1a
\u6b21\u65b9\u8fd0\u7b97\u662f\u6570\u5b66\u8fd0\u7b97\uff0c\u6211\u4eec\u53ef\u80fd\u5728\u5176\u4ed6\u8bed\u8a00\u4e2d\u6bd4\u5982VB\u4e2d\u89c1\u8fc7\u5e42\u8fd0\u7b97\u7b26\uff0c\u5728VB\u4e2d\u8ba1\u7b972\u76843\u6b21\u65b9\uff0c\u53ef\u4ee5\u76f4\u63a5\u4f7f\u75282^3\u5c31\u53ef\u4ee5\u7b97\u51fa\u7ed3\u679c\u3002C\u6807\u51c6\u5e93\u4e2d\u6709\u4e24\u4e2a\u53ef\u4ee5\u89e3\u51b3\u89e3\u51b3\u6211\u4eec\u7684\u5e42\u8fd0\u7b97\u95ee\u9898\uff0c\u5206\u522b\u662fmath.h\u548ctgmath.h\u3002
代码如下：
#include <stdio.h>
float cm(float x,int n)
{
if(n==1)
return x;
else
return x*cm(x,n-1);
}
void main()
{
int n;
float x;
scanf("%d",&n);//n;
scanf("%f",&x);//x;
printf("x的%d次方是:%f",n,cm(x,n));
}
#include<stdio.h>
double My_pow(double m, int n)
{
int i;
double result = 1;
for(i = 1; i <= n; i++)
{
result *= m;
}
return result;
}
void My_printf(double result)
{
printf("结果是：%.2lf
", result);
}
int main()
{
double m;
double result;
int n;
scanf("%lf %d", &m, &n); // m 和 n用空格分开
result = My_pow(m, n);
My_printf(result);
return 0;
}
希望可以帮到你~
pow函数，是库函数计算次方，你要自己写
double cifang(double x,int n)
{
double result=1;
for(int i=1;i<=n;i++)
{
result*=x;
}
result double;
}
以下转自网络
#include<math.h>
函数原型是：
1.double pow(double _X,double _Y);
2.double pow(double _X,int _Y);
3.long double pow(long double _X,long double _Y);
4.long double pow(long double _X,int _Y);
5.float pow(float _X,float _Y);
6.float pow(float _X,int _Y);
绛旓細printf("x鐨%d娆℃柟鏄:%f",n,cm(x,n));}
绛旓細鍦–璇█涓紝 M鐨凬娆℃柟锛屽彲浠ユ湁濡備笅鍑犵琛ㄧず鏂规硶锛1銆佷娇鐢ㄦ爣鍑嗗簱鍑芥暟鐨刾ow銆傚舰寮忎负 pow(M,N);浣跨敤pow鍑芥暟闇瑕佸紩鐢ㄥご鏂囦欢math.h锛 pow鐨勫弬鏁板拰杩斿洖鍊肩被鍨嬮兘鏄痙ouble鐨勶紝鎵浠ュ緱鍒扮殑鏄繎浼煎笺2銆佸浜庤寰楀埌绮剧‘鍊肩殑锛屽湪C璇█涓苟娌℃湁绯荤粺鍑芥暟渚涗娇鐢紝鍙兘鑷繁鍐欏嚱鏁版潵瀹炵幇锛屽弬鑰冧唬鐮佸涓嬶細int pow_in...
绛旓細棣栧厛scanf("%d%d", a, n);鐒跺悗鍙互浣跨敤搴鍑芥暟pow result = pow(a, n); //杩欎釜灏辨槸a鐨刵娆℃柟 闇瑕#include <math.h> 鎴栬 result = 1;for (int i = 0; i < n; i++) {result *= a;}
绛旓細鍦–璇█涓紝 M鐨凬娆℃柟锛屽彲浠ユ湁濡備笅鍑犵琛ㄧず鏂规硶锛1銆佷娇鐢ㄦ爣鍑嗗簱鍑芥暟鐨刾ow銆傚舰寮忎负 pow(M,N);浣跨敤pow鍑芥暟闇瑕佸紩鐢ㄥご鏂囦欢math.h锛 pow鐨勫弬鏁板拰杩斿洖鍊肩被鍨嬮兘鏄痙ouble鐨勶紝鎵浠ュ緱鍒扮殑鏄繎浼煎笺2銆佸浜庤寰楀埌绮剧‘鍊肩殑锛屽湪C璇█涓苟娌℃湁绯荤粺鍑芥暟渚涗娇鐢紝鍙兘鑷繁鍐欏嚱鏁版潵瀹炵幇锛屽弬鑰冧唬鐮佸涓嬶細int pow_in...
绛旓細float f(int m,int n){ float count; //count鐢ㄦ潵璁板綍姣忎竴姝ョ殑缁撴灉,浠ヨ嚦鏈缁堢粨鏋.if(n>1) count=f(m,n-1)*m; //涓姝ヤ竴姝ョ殑鎶妋涔樹笂鍘;姣忎箻涓姝ラ兘n-1.鐩村埌n鍊间负1鏃朵负姝 if(n==1) count=m; //濡傛灉鍒濆鏃秐鍊间负1,鐩存帴杈撳嚭m鍊 return count;} ...
绛旓細pow锛坸锛宯锛夛紱x鐨刵娆℃柟
绛旓細杩欐槸涓涓疄渚嬶紝鍑芥暟cm灏辨槸琛ㄧずx鐨刵娆℃柟銆備唬鐮佸涓嬶細include float cm(float x,int n){ if(n==1)return x;else return x*cm(x,n-1);} void main(){ int n;float x;scanf("%d",&n);//n;scanf("%f",&x);//x;printf("x鐨%d娆℃柟鏄:%f",n,cm(x,n));} ...
绛旓細鏈鍓嶉潰杩樺緱鍔犱釜#include <math.h> 鐒跺悗灏 m=power(m,2);鏀规垚 n=pow(m,2);
绛旓細1銆佷娇鐢╒B缂栫▼锛岀▼搴忓涓嬶細Private Sub Command1_Click()Dim n As Integer,i As Integer,s As Single,m As Integer n = Val(Text1.Text)For m = 1 To n i = 3 ^ (m - 1)s = s + i Exit For Next m Text2.Text = s End Sub 2銆浣跨敤C璇█缂栧啓锛岀▼搴忓涓嬶細int mn(int m,...
绛旓細鏈枃浠C璇█涓轰緥锛屼笉鐢ㄩ掑綊鏂瑰紡缂栫爜濡備笅锛歩nclude<stdio.h> long fun1(int n){ if(n<=1) return 1;return fun1(n-1)*n;} long fun2(int n){ int i;long m=1;for(i=1; i<=n; ++i)m*=i;return m;} int main(){ printf("%ld\n",fun1(9));printf("%ld\n",fun2(9)...
