{ int a=3,b=4,c=5,t=99; if (b

void fun(int a,int b) { int t; t=a;a=b;b=t; } main()void fun(int a,int b){ int t; t=a;a=b;b=t; } main() { int c[10]={1,2,3,4,5,6,7,8,9,0}.i; for(i=0;i #include void fun(int a, int b) { int t; t=a; a=b; b=t;main() { int c[10]={1,2,3,4,5,6,7,8,9,0), i; for (i=0; i #include void fun(int a,int b) {int t; t=a;a=b;b=t; } main() {int c[6]={1,2,3,4,5,6},i;for(i=0;i #include stdio.h void fun(int a,int b) { int t; t=a,a=b,b=t; } main() { int c[10]={1,2,3,4,5,6,7#include stdio.hvoid fun(int a,int b){int t;t=a,a=b,b=t;}main(){int c[10]={1,2,3,4,5,6,7,8,9,0},i;for(i=0;i { int a=3,b=4,c=5,t=99; if (b c语言这段程序看不懂int fun(int a,int b,int c){ int t; t=(a>b)?(b>c?b:(a>c?c:a)):((a>c)?a:((b>c)?c:b)); return t; } #include int a=3,b=5; max (int a,int b) {int c; c=a>b?a:b; return (c); } void main() {int int a=4,b=3,c=5,t=0;if(a #include int f1(int a,int b)15,9 { int c; c=b%2; return a+c; }int f2(int a,int b){ int c;a+=a;b+=b;c=f1(a+b=14,++b9);return c;}void main(){ int a=3,b=4;cout void main() { int a=3,b=4,c=5,t=99; if(b #include void main( ) { int a=3,b=5; int *p,*q; void f1(int x,int y);void f2(int *x,int *y);p=&a; q=&b;f1(*p,*q) ;printf(a=%d ,b=%d ,a,b);f2(p,q);printf(a=%d ,b=%d ,a,b);}void f1(int x,int y) { int t;t=x; x=y; y=t;}void f2(int *x,int *y) { int 矩阵相加（C++）#include using namespace std; const int rows=3;const int cols=3;void matrixadd(int *,int *,int *,int,int);int main(){int a[rows][cols]={{1,3,5},{7,8,11},{13,15,17}};int b[rows][cols]={{9,8,7},{6,5,4},{3,2,1}};int c[rows][cols]={0 void swap1(int c0[],int c1[]) { int t; t=c0[0];c0[0]=c1[0];c1[0]=t; } void swap2(int *c0,int *c1) {void swap1(int c0[],int c1[]){ int t;t=c0[0];c0[0]=c1[0];c1[0]=t;}void swap2(int *c0,int *c1){int t;t=*c0;*c0=*c1;*c1=t;}void main(){int a[2]={3,5},b[ 以下程序运行时的输出结果第一行至第四行分别为void swap1(int c[ ]){ int t;t=c[0];c[0]=c[1];c[1]=t;}void swap2(int c0,int c1){ int t;t=c0;c0=c1;c1=t;}main( ){ int a[2]={3,5},b[2]={3,5};swap1(a); swap2(b[0],b[1]);printf(“%d %d % #include 　　int inc(int a) 　　{ 　　　return(++a); 　　} 　　int multi(int*a,int*b,int*c) 　　{ 　　　return(*c=*a**b); 　　} 　　typedef int(FUNC1)(int in); 　　typedef int(FUNC2) (int*,int*,int*); 　　void show(FUNC2 fu #include using namespace std; int main() { int a,b,c; a=3; int f(int x,int y,int z);#include using namespace std; int main() {int a,b,c;a=3;int f(int x,int y,int z); cin>>a>>b>>c;c=f(a,b,c);cout int func(int x,int y ) { return(x+y) } main() {int a=1,b=2,c=3,d=4,e=5;printf(&d ,func((a+b,b+c,c+a),(d+e))); 关于最大公约数的算法int gcd(int a,int b){ int t = 0; int c = 0; if(a==0) return b; if(b==0) return a; if(a < b) { t=a; a=b; b=t; } c = a % b; while(c != 0) { a = b; b = c; c = a % b; } return b; }--