编写一个递归函数,实现将任意的十进制正整数转化为八进制数．

intmystrcmp(constchar*si,constchar*sd){intk;while((k=*si-*sd)==0&&*si++&&*sd++)returnk;;}k>0说明si大；k

intfunction(intn){if(n==0)return0;elseif(n==1)return1;elsereturnfunction(n-1)+function(n-2);}

帮你写好了.unsigned int fib(unsigned int n) {\x09if (n == 1 

longpower(intm,intn){doublep=1;if(n>0){p=m*power(m,(n-1));returnp;}}voidmain(){intm,n;longk;scanf("%

intprime(intn){intt;for(t=2;tn/2)return1;elsereturn0;}

swap(int&i,int&j){inttemp;temp=i;i=j;j=temp;}main(){inta,b,cscanf("%d,%d,%d",a,b,c);if(a

cludestdio.hvoidmain(){intmax_4(inta,intb,intc,intd);inta,b,c,d,max;printf("Pleaseenterintergernumbe

#includeusingnamespacestd;doublepnx(int,double);intmain(){doublen,x;coutx;cout再问：谢谢能加个好友吗给个q也行以后请多指教

如果需要n是变量,则使用指针,以下是原地转置voidTrans(int*a,intn){inttemp,i,j;for(i=0;ifor(j=0;j{temp=a[i*n+j];a[i*n+j]=a[

#includelongfac(intn){inti;longx=1;for(i=2;i再问：谢谢咯！可是我说的是递归法哦！再答：#includelongfac(intn){if(n==0)retur

#include <stdio.h>char* dg(char* instr, char* outstr, char* 

#includelongfib(intn){inta;if(n==1)a=1;elseif(n==2)a=1;elsea=fib(n-1)+fib(n-2);returna;}voidmain(){\

functiongqj=erfen(p,a,b,e)ifabs(b-a)

intSumNums(intnum){if(num

1.#include"stdio.h"//#defineRECURSION1#ifdefRECURSIONlongfact(intn){if(n

#includeusingnamespacestd:intfuntion(intn){if(n==0){return0;}if(n==1){return0;}returnn&funtion(n-1);

intgetpower(intx,inty){if(y==1)returnx;elsereturnx*getpower(x,y-1);}doublegetpower(doublex,inty){if(

n阶乘的函数factorial(n)再问：要过程，谢谢再答：NN=1whilen>0NN=NN*n;n=n-1;endNN

用递归法计算n!用递归法计算n!可用下述公式表示：n!=1(n=0,1)n×(n-1)!(n>1)按公式可编程如下：longff(intn){longf;if(n

#includeintGcd(intM,intN){intRem;while(N>0){Rem=M%N;M=N;N=Rem;}returnM;}voidmain(){inta,b