真题50（50.）.docVIP

真题50（50.） First questions, m personal results stored in the score array, please write the function fun, its function is: lower than the average person as a function value returned, will be less than the average score placed in the below specified function. Answer： Int fun (int, score[], int, m, int, below[]) { Int, I, k=0, aver=0; For (i=0; I m; i++) Aver+=score[i]; Aver/=m; For (i=0; I m; i++) If (score[i] aver) { Below[k]=score[i]; K++; } Return k; } 2: second questions please write the function fun, its function is: 1 to 100 can be obtained 7 North or divisible by 11, but all the certificate is not divisible by 11 and 7 at the north, and put them in the array pointed to by a, returns the number of these numbers by n. Answer： Void fun (int, *a, int, *n) { Int, I, j=0; For (i=2; I 1000; i++) (if (i%7==0 || i%11==0) i%77! =0) A[j++]=i; *n=j; } Please write the function void 3: third fun (int x, int pp[], int *n), its function is to calculate the integers: X and is not even, and the array on the PP referred to the order from small to large, the divisor of the number returned through the parameter n. Answer： Void, fun (int, x, int, pp[], int, *n) { Int, i=1, j=0, k=0, *t=pp; For (i=0; I =x; i++) If (i%2, =0) { T[j]=I; J++; } For (i=0; I J; i++) If (x%t[i]==0) { Pp[k]=t[i]; K++; } *n=k; } 4: fourth questions, please write a function void fun (char *tt, int pp[]), statistics in the TT characters, a to Z 26 letters appear in the number of times, and in turn placed in the PP refers to the array. Answer： Void fun (char, *tt, int, pp[]) { Int i; For (i=0; I 26; i++) Pp[i]=0; While (*tt) { Switch (*tt) { Case a: pp[0]++; break; Case B: pp[1]++; break; Case C: pp[2]++; break; Case d: pp[3]++; break; Case e: pp[4]++; break; Case f: pp[5]++; break; Case g: pp[6]++; break; Case H: pp[7]++; break; Case I: pp[8]++; break; Case J: pp[9]++; break; Case k: pp[10]++; break; Case l: pp[11]++; break; Case m: pp[12]++; break; Case n: pp[12]++; break; Case o: pp[14]++; break; Cas