Description: Description of laquo:
The positive integer greater than 1 can be broken down to: n=x1*x2 *... * xm.
For example, when n= 12, there are 8 different decomposition types:
12 = 12;
12 * 2 = 6;
12 = 4 * 3;
12 = 3 * 4;
12 = 3 * 2 * 2;
12 = 2 * 6;
12 = 2 * 3 * 2;
12 = 2 * 2 * 3.
« programming tasks:
For a given positive integer n, there are many different types of decomposition of n.
« data input:
Input data is given by input.txt. The first row has 1 positive integer n (1 is less than or equal to 2000000000).
« result output:
Output the calculated different decomposition Numbers to the file output.txt.
An example of the input file example output file
Input. TXT output. TXT
8-12
To Search:
- [caisuzhi] - The guess is you can see four figures in
- [POST] - The problem of location selection of pos
- [PIPE] - The problem of pipeline problem of 2-1 o
- [aknight] - The problem of combat horse was realized
- [1-1count] - A book page from the natural number codi
File list (Check if you may need any files):
Download