Topic: the prime factors of a positive integer factorization. For example: Enter 90 to print out 90 = 2* 3* 3* 5. The program Analysis: the decomposition of the prime factors of n, we should first find the smallest prime number k, and then press the following steps: (1) If the prime numbers exactly equal to n, the decomposition of the prime factors has ended, print out can be . (2) If n < > k, n can be k divisible should print out the value of k, and n is divided by the quotient of k, as a new positive integer N, the first step executed repeatedly. (3) If n is not divisible by k, then use k+1 as the value of k is repeatedly performed the first step.

example14.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．