50道算法程序题（50 algorithm program questions）.docVIP

50道算法程序题（50 algorithm program questions） [1] - program Topic: the classical problem: a pair of rabbits, from birth to third months after each month of birth to a pair of rabbits, a small rabbit to third months after the month gave birth to a pair of rabbits, if the rabbit will die, asked the rabbit is the total number of each month? 1. program analysis: the number of rabbits. 1,1,2,3,5,8,13,21... [2] program Topic: determine the number of primes between 101-200, and the output of all prime numbers. 1. program analysis: methods to determine the prime numbers: were removed 2 to sqrt with a number (the number), if divisible, It indicates that this number is not prime, and is a prime number. [3] - program Title: print out all of the narcissus number, the so-called daffodils refers to a three digit, the all digital cube and equal to the number itself. For example: 153 is a daffodils, because three times three times three times 5 + 3 153=1. 1. program analysis: using for cycle to control the number of 100-999, each decomposition of a single digit number, ten, 100. [4] program Title: a positive integer decomposition of the quality factor. For example: input 90, print 90=2*3*3*5. Program analysis: the N decomposition of the quality factor, should first find a minimal prime number k, then complete the following steps: (1) if the prime exactly equal to N, then the prime factor decomposition process has ended, you can print out. (2) if nk, but n is divisible by K, the value of K should be printed, and divided by N K, a positive integer as a new n you repeat the first step. (3) if n is not divisible by K, with k+1 as the value of K, repeat the first step. [5] - program Topic: the use of nested conditional operator to complete this question: the achievement of =90 students A, 60-89 points with B said, 60 points below the C. 1. program analysis: (ab) a:b? This is a basic example of the conditional operator. [6] program Enter two positive integers m and N, find the greatest common