7 人解决，10 人已尝试。
8 份提交通过，共有 22 份提交。
6.6 EMB 奖励。
1560. Factors and Factorials
单点时限: 2.0 sec
内存限制: 256 MB
The factorial of a number N (written N!) is defined as the product of all the integers from 1 to N. It is often defined recursively as follows:
Factorials grow very rapidly–5! = 120, 10! = 3,628,800. One way of specifying such large numbers is by specifying the number of times each prime number occurs in it, thus 825 could be specified as (0 1 2 0 1) meaning no twos, 1 three, 2 fives, no sevens and 1 eleven.
Write a program that will read in a number N ( 2<=N<=100 ) and write out its factorial in terms of the numbers of the primes it contains.
输入格式
Input will consist of a series of lines, each line containing a single integer N. The file will be terminated by a line consisting of a single 0.
输出格式
Output will consist of a series of blocks of lines, one block for each line of the input. Each block will start with the number N, right justified in a field of width 3, and the chracters !', space, and=’. This will be followed by a list of the number of times each prime number occurs in N!.
These should be right justified in fields of width 3 and each line (except the last of a block, which may be shorter) should contain fifteen numbers. Any lines after the first should be indented. Follow the layout of the example shown below exactly.
题目标签