详细代码如下:
#include <conio.h>
#include <stdio.h>
#define M 10
int a[M][M] = {0} ;
/**************found**************/
void fun(int a[][M], int m) // **a a是一个字符串数组,设置实参时,**a是错误的,
{ int j, k ;
for (j = 0 ; j < m ; j++ )
for (k = 0 ; k < m ; k++ )
/**************found**************/
a[j][k] = (k+1) * (j+1) ; //根据输出结果
}
void main ( )
{ int i, j, n ;
printf ( " Enter n : " ) ; scanf ("%d", &n ) ;
fun ( a, n ) ;
for ( i = 0 ; i < n ; i++)
{ for (j = 0 ; j < n ; j++)
printf ( "%4d", a[i][j] ) ;
printf ( "\n" ) ;
}
}
详细代码如下:
#include <stdio.h>
#define M 3
#define N 5
void fun(int (*a)[N],int k)
{ int i,j,p,temp;
/**********found**********/
for(p=1; p<= k; p++) //外循环p值为数组移动的次数,要求第k列左移,则需要移动的次数为k
for(i=0; i<M; i++)
{ temp=a[i][0];
/**********found**********/
for(j=0; j< N-1 ; j++) a[i][j]=a[i][j+1]; //矩阵有N列
/**********found**********/
a[i][N-1]= temp;
}
}
void main( )
{ int x[M][N]={ {1,2,3,4,5},{1,2,3,4,5},{1,2,3,4,5} },i,j;
printf("The array before moving:\n\n");
for(i=0; i<M; i++)
{ for(j=0; j<N; j++) printf("%3d",x[i][j]);
printf("\n");
}
fun(x,2);
printf("The array after moving:\n\n");
for(i=0; i<M; i++)
{ for(j=0; j<N; j++) printf("%3d",x[i][j]);
printf("\n");
}
}
详细代码如下:
#include <stdio.h>
float fun(int m, int n)
{
/*
analyse:
*/
//up
float up = 1.0;
float down1=1.0,down2=1.0;
float middle =(double)(m -n);
//up *= m--;
while(m != 0)
{
up *= m--;
}
//down1
while(n != 0)
{
down1 *= n--;
}
//down2
while(middle != 0)
{
down2 *= middle--;
}
return up/(down1*down2);
}
void main() /* 主函数 */
{ void NONO ();
printf("P=%f\n", fun (12,8));
NONO();
}