joj 1551:Factorial Frequencies

 1551: Factorial Frequencies

---

Status	In/Out	TIME Limit	MEMORY Limit	Submit Times	Solved Users	JUDGE TYPE
	stdin/stdout	3s	8192K	564	211	Standard

In an attempt to bolster her sagging palm-reading business, Madam Phoenix has decided to offer several numerological treats to her customers. She has been able to convince them that the frequency of occurrence of the digits in the decimal representation of factorials bear witness to their futures. Unlike palm-reading, however, she can't just conjure up these frequencies, so she has employed you to detemine these values.

 

Recall that the definition of n! (that is, n factorial) is just . As she expects to use either the day of the week, the day of the month, or the day of the year as the value of n, you must be able to determine the number of occurrences of each decimal digit in numbers as large as 366 factorial (366!), which has 781 digits.

Input and Output

The input data for the program is simply a list of integers for which the digit counts are desired. All of these input values will be less than or equal to 366 and greater than 0, except for the last integer, which will be zero. Don't bother to process this zero value; just stop your program at that point. The output format isn't too critical, but you should make your program produce results that look similar to those shown below.

 

Madam Phoenix will be forever (or longer) in your debt; she might even give you a trip if you do your job well!

Sample Input

 

3
8
100
0

Sample Output

 

3! --
   (0)    0    (1)    0    (2)    0    (3)    0    (4)    0
   (5)    0    (6)    1    (7)    0    (8)    0    (9)    0
8! --
   (0)    2    (1)    0    (2)    1    (3)    1    (4)    1
   (5)    0    (6)    0    (7)    0    (8)    0    (9)    0
100! --
   (0)   30    (1)   15    (2)   19    (3)   10    (4)   10
   (5)   14    (6)   19    (7)    7    (8)   14    (9)   20

#include<stdio.h>
const int max=1000;
int main()
{
 int i,j,k,n;
 while(scanf("%d",&n)&&n)
 {
  int a[max+1]={0};
  a[max]=1;
  for(i=2;i<=n;i++)
  {
   for(j=max;j>=0;j--)
    a[j]*=i;
   for(j=max;j>=0;j--)
   {
    if(a[j]>=10)
    {
     a[j-1]+=a[j]/10;
     a[j]%=10;
    }
   }
  }//(0)   2
  int s[10]={0};
  int flag=0;
  for(i=0;i<max+1;i++)
  {
   if(a[i]) flag=1;
   if(flag) s[a[i]]++;
  }
  printf("%d! --/n",n);
  printf("   (0)%5d    (1)%5d    (2)%5d    (3)%5d    (4)%5d/n",s[0],s[1],s[2],s[3],s[4]);
  printf("   (5)%5d    (6)%5d    (7)%5d    (8)%5d    (9)%5d/n",s[5],s[6],s[7],s[8],s[9]);
 }
 return 0;
}