bianchengzhimei21(国外英文资料).docVIP

bianchengzhimei21 Dont be intimidated by factorial . Factorial (Factorial) is an interesting function, but a lot of people are afraid of it. Lets look at the two and order Multiplicative correlation problem: 1. given an integer N, then the factorial N of N! How many 0 are there at the end? For example: N = 10, N! = 3628800, N! There are two 0 at the end. 2. seek N! The lowest 1 position in a binary representation. Two point two Analysis and solution Some people hit such a topic and wonder, do you want to compute the N completely?! Value? What if overflow? In fact， The problem becomes easy if we consider from the angle that which number is multiplied to get 10. Consider first, if N! = K * 10M, and K cannot be divisible by 10, then N! There are M 0 at the end. Reconsider Yes, N! Perform factorization, N! = (2x) * (3Y) * (5Z)... Since = 2 x 5, so M only follows X and Z In contrast, each pair 2 and 5 multiplies to get a 10, and then M = min (X, Z). It is easy to see that X is greater than or equal to Z, Because the number that can be divisible by 2 is much higher than the number divisible by 5, so the formula is simplified to M = Z. According to the above analysis, as long as the value of Z is calculated, N can be obtained! The number of 0 at the end. [solution to problem 1] The most direct way to calculate Z is to compute I (I, =1, 2),... (N) factorization in which 5 of the exponents are then sought And: Code listing 2-6 RET = 0; For (I = 1; I N; i++) { J = i; While (J% 5 ==0) { Ret++; J / = 5; } } [solution to problem 1 two] Formula: Z = [N/5], +[N/52], +[N/53] +... (dont worry, its an infinite operation, because theres always one A K that makes 5K N, [N/5K]=0.) In the formula, [N/5] means a multiple of 5 in the number no larger than N, a [N/52] of 5, and 52 in the number not greater than N A multiple contribution of 5,...... The code reads as follows: RET = 0; While (N) { RET = N / 5; N / = 5; } Question 2 requires N! The lowest 1 position in a binary representatio