int f(int m,int n) {if(m==0||n==0)return 1; return_____________; }

f(int b[ ],int m,int n) {int i,s=0; for (i=m;i int f; if (m int 还有int *f(); int int f(int m,int n) {if(m==0||n==0)return 1; return_____________; } int LB(int *a,int n) int **m, int fun (int n) {int m=0,f=1,i; for(i=0;i int f(int m,int n) { if(m==0) return 1; if(n==0 || n==m) return 1; return____________________; } #include void f(int *p,int*q); main() {int m=1,n=2,*r=&m; f(r,&n);printf(%d,%d,m,n);}#include void f(int *p,int*q);main(){int m=1,n=2,*r=&m;f(r,&n);printf(%d,%d,m,n);}void f(int *p,int *q){p=p+1;*q=*q+1;}运行后的结果是A 1,3 B 1,2 说说为 C++进制转换问题#include using namespace std;int F(int,int);int main(){int num;int n;coutnum>>n;int z;z=F(num,n);cout C++中关于求两个数的最大公约数与最小公倍数#includeusing namespace std;int f(int a,int b);int g(int c,int d);void main(){ int x,y,m,n;couty;m=f(a,b);n=g(c,d);cout #include sub(int *a,int n,int k) { if(k int f(int m,int n) { if(m < n) return 0; if(n==0) return 1; return f(m-1,n) + f(m,n-1); jiedu}int f(int m,int n){if(m < n) return 0;if(n==0) return 1;return f(m-1,n) + f(m,n-1);}公交车票价为5角.假设每位乘客只持有两种币值的货币 int max(int a,int int(sqrt(n))是什么意思 #include stdio.hint fun (int k,int *m){if (k%3) *m=k*k;else *m=k/3;}main(){int (*p) (int,int *),m;p=fun;(*P) (78,&m);printf ( %d ,m);} 我想搞个X的Y次方的 算法 #include stdafx.hint main(int argc,char* argv[]){int pow(int x,int y);int a,b,c;scanf(%f,%f,&a,&b);c=pow(a,b);printf(%f ,c);return 0;}int pow(int x,int y){int i,z;i=1;z=x;while(i