reply urgently
-
Q;the factorial of a number B ia defined recursively as 1!=1 N!=N*(N-1)! Factorials can be represented as the number of times prime number occurs in it ,example 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 readin a number N(2<=N<=100) and write out its factorial in terms of the numbers of the prime it contains. INPUT It will contain a series of lines each containing a single letter N The file will bw terminated by a line consisting of a single 0. OUTPUT It will contain a series of blocks of lines, one block for each line of input. Each block will start with the number N,right justified in a field of width 3 and the characters '!',space, and '='.This will be followed by a list of the number of times each prime numbers occurs in !N. There should be right justified in fields of width 3 and each line (except the last of a block, which may be shorter)should contain 15 numbers.Any lines after the first should be indented .Follow the layout of the example shown below exactly. SAMPLE INPUT 5 53 0 SAMPLE OUTPUT !5= 3 1 1 53!= 49 23 12 8 4 4 3 2 2 1 1 1 1 1 1 1 Lov u all