a[M-i-1]=a[i];
for(i=0;i
1、#include
/************found************/
for ( i=0; i<3; i++) 此处将1改为0,并且去掉等号
for ( j=0; j<3; j++) if (max < arr[i][j]) {
max = arr[i][j]; } return (max); }
void main()
{ int a[3][3]={4,4,34,7,3,12,5,6,5},i,j; /************found************/
printf(\max is: %d\\n\将arrmax(a[0][0])改为arrmax(a)
3、#include
/***********begin***********/ int a1,a2,a3,s; a1=m/100; a2=m0/10; a3=m; s=a1+a2+a3; return(s);
/************end************/ }
void main() { int m,s; //clrscr();
printf(\ scanf(\ s=fun(m);
printf(\
4、#include
2、#define M 10 #include
for(i=0;i
/**************found************/ -----scanf(\ /**************found************/ for(i=0;----i
main()
{ int a[10]={10,4,2,7,3,12,5,34,5,9},i,s; clrscr(); s = 0;
/************found************/
for ( i=0; i<10; i++) 去掉等号
if (a[i] % 2 == 0)
/************found************/
s = s + a[i]; 将i改为
a[i]
printf(\ }
j--; }
printf(\ }