int a[N],c[M2-M1+1]={0},i,n=0,x=0;
printf("Please input a sequence of number(%d-%d) which is ended with
-1:\n",M1,M2);
while(x!=-1)
{
scanf("%d",&x);
a[n]=x;
n++;
}
f(a,c,n);
printf("Repeating times of %d-%d in sequence of number is:\n",M1,M2);
for(i=0;i<=M2-M1;i++)
printf(“%d:%d\n”, 【1】);
printf("\n");
}
f(【2】)
{
int i;
for(i=0;i<n;i++)
if(a[i]>=M1 && a[i]<=M2)
【3】;
}
【1】A）M1+i:c[M1+i] B）M1+i+1:c[i]
C）M1+i:c[i] D）i:c[M1+i]
【2】A）f(a[],c[],n) B）f(int a[],int c[],int n)
C）f(a,c,n) D）f(int a[N],c[M2-M1+1],n)
【3】A）c[a[i]]++ B）c[a[i]-M2]++
C）a[c[i]]++ D）c[a[i]-M1]++
二．读程序写结果
1.
fun(int x,int y,int z)
{
z =x*x+y*y;
}
main ( )
{
int a=31;
fun (6,3,a);
printf ("%d", a);
}
2.
int f( )
{