insert( int *q, int n)
{ int *k;
k=q;
while (*q!=32767) q++;
*(q+1)=*q;
while(q>k)
{ if (n>*(q-1)) { *q=n; break; }
else {q--; *(q+1)=*q; } } }
【9-32】
main()
{int n,a[16]={0},*p;
printf(\
scanf(\
p=a;
change(a,n,p);
printf(\
while(p<=a+15)
printf(\ }
change(x,n,p)
int x[16],n,*p; {
p=x+15; *p=0;
if(n==0) return(0);
while(n!=0)
{*p=n%2;
p--;
n/=2; } }
【9-33】
#include
main()
{int a[15],*p,i;
p=a;
frandm(a);
printf(\
for(i=0;i<15;i++)
printf(\ }
frandm( a[]);
{int k=0,i,x,*q;
for (i=0;i<15;i++) a[i]=20;
while(k<15)
{x=rand() ;
for (i=0;i<15;i++)
if (a[i]==x ) continue;
else a[k++]=x; } }
【9-34】
#define N 20
main()
{int a[N][N],x[N]={0},y[N]={0},i,j,m,sum=0;
printf(\
scanf(\
printf(\
for(i=0;i for(j=0;j { scanf(\ x[i]+=a[i][j]; y[j]+=a[i][j]; if (i==j ) sum+=a[i][i]; } printf(\ for (i=0;i { for (j=0;j printf(\ printf(\ } for (i=0;i printf(\ printf(\ getch(); } 【9-35】 #define N 20 main() {int a[N][N],b[N][N],c[N][N],m,n,i,j; printf(\ scanf(\ printf(\ for(i=0;i for(j=0;j { scanf(\ } printf(\ for(i=0;i for(j=0;j { scanf(\ } printf(\ for (i=0;i { for (j=0;j printf(\ printf(\ } getch(); } 【9-36】 main() {int i,j,k; printf(\ ** A MULTIPLICATION printf(\ \ for(i=1;i<10;i++) printf(\ TABLE **\\n\