机试题目1（Machine test title 1）.docVIP

机试题目1（Machine test title 1） 2: write function fun, function is: find 1 to 100 within the north 7 or 11 divisible, but can not simultaneously north 7 and 11 divisible all certificates, and put them in the a refers to the array, through the n to return the number of these. 3: void fun (int x write function, int, pp[], int, *n) function is calculated to each integer divisible by 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. 4: writes a function called void fun (char, *tt, int, pp[]), counting the number of times each letter appears in the TT character from a to Z 26, and placing it in an array of PP. 5: writes a function void fun (int, m, int, K, int, xx[]), the function of the function is: will be greater than the integer m and close to the M K, each prime number stored in the XX refers to the array. 6: writes a function called void fun (char, a[], char[], int, n). The function is to delete characters that are specified in each string. Where a points to the original string, the deleted string is stored in the array referred to by B, and the specified subscript is stored in the n. 7: writes a function called int fun (int, *s, t, int, *k) that is used to find the maximum element in the array except the index of the array and is stored in the storage cell referred to in the K. 8: write function fun, function is: according to the following offensive calculation s, the results of the calculation as a function value to return; N through the parameters of the incoming. S=1+1/ (1+2) +1/ (1+2+3) +...... .+1/ (1+2+3+4+...... +n) 9: function fun function is: the following formula for the value of P, the result is brought back by the function value. M and N are two positive integers and require mn. P=m! /n! (m-n)! The 10: function fun uses the following simple iterative method to find a real root of the equation cos (x) -x=0. The iterative steps are as follows: (1) take the initial