int gjs(int m,int n) { int p,t; if(m>n) {p=m; m=n; n=p; } while(n!=0) { t=m%n; m=n; n=t; } return nint gjs(int m,int n){int p,t;if(m>n){p=m;m=n;n=p;}while(n!=0){t=m%n;m=n;n=t;}return n;}#include #include int main(){int a;int b;scanf("%d%d",&a,&b);pri

int gjs(int m,int n) { int p,t; if(m>n) {p=m; m=n; n=p; } while(n!=0) { t=m%n; m=n; n=t; } return nint gjs(int m,int n){int p,t;if(m>n){p=m;m=n;n=p;}while(n!=0){t=m%n;m=n;n=t;}return n;}#include #include int main(){int a;int b;scanf(%d%d,&a,&b);pri int int LB(int *a,int n) int **m, f(int b[ ],int m,int n) {int i,s=0; for (i=m;i #include sub(int *a,int n,int k) { if(k int max(int a,int int f(int m,int n) {if(m==0||n==0)return 1; return_____________; } 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);} int f; if (m # include # include int mian () { int m,n,i,s=0; int a[10000]; while(scanf(%d, int fun (int n) {int m=0,f=1,i; for(i=0;i #includeint a(int x);int b(int y);int main(){int m,n;n=6;m=a(n);printf(%d ,m);return 0;}int a(int x){x=b(x+3);return x;}int b(int y){return y+1;} c语言 m*n阶矩阵转置#include#define N 30int convert(int array[N][N],int m,int n){ int t,i,j;if(m>n){ for(i=0;i int 还有int *f(); 关于下面这个矩阵相加的问题,请帮我看看少了什么public class and {public static void add(int a[][], int b[][],int c[][],int m,int n){for (int i=0;i #include int gcd(int m,int n) { if(m%n==0) printf(%d ,n); else gcd(n,m%n); } main() { i#includeint gcd(int m,int n){if(m%n==0) printf(%d ,n);elsegcd(n,m%n);} main(){int m,n;scanf(%d%d,&m,&n);printf(%d,gcd(n,m%n));}求m整除n