- Category:
- File Formats
- Tags:
-
[WORD]
- File Size:
- 3kb
- Update:
- 2013-01-17
- Downloads:
- 0 Times
- Uploaded by:
- 郭子
Description: 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.
To Search:
File list (Check if you may need any files):
example14.doc
Download