- Category:
- Data structs
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2014-03-19
- Downloads:
- 0 Times
- Uploaded by:
- 郭同学
Description: The prime factorization of a positive integer. For example: Enter 90, print out 90 = 2* 3* 3* 5. Program analysis: the decomposition n prime factors, you should first find a smallest prime number k, then complete the following steps: (1) if the prime exactly equal to n, then the prime factor decomposition process has been completed, you can print out . (2) If n < > k, k but can be divisible by n, the value of k should be printed, and the quotient k divided by n, a positive integer as a new you repeat the first step. (3) If n is not divisible by k, the value of k is used as k+1 Repeat the first step.
To Search:
File list (Check if you may need any files):
zhishu fenjie.txt
Download