The Last Practice

Problem Description

Tomorrow is contest day, Are you all ready?
We have
been training for 45 days, and all guys must be tired.But , you are so lucky
comparing with many excellent boys who have no chance to attend the
Province-Final.

Now, your task is relaxing yourself and making the last
practice. I guess that at least there are 2 problems which are easier than this
problem.
what does this problem describe?
Give you a positive integer,
please split it to some prime numbers, and you can got it through sample input
and sample output.

 

Input

Input file contains multiple test case, each case
consists of a positive integer n(1<n<65536), one per line. a negative
terminates the input, and it should not to be processed.

 

Output

For each test case you should output its factor as
sample output (prime factor must come forth ascending ), there is a blank line
between outputs.

 

Sample Input

60

12

-1

 

Sample Output

Case 1.

2 2 3 1 5 1

 

 

Case 2.

2 2 3 1

 

Hint

60=2^2*3^1*5^1

 

 

 #include <stdio.h>
 #include <string.h>

 int main(){
     int number;
     int i;
     int amount[];
     int temp;
     int time;

     time=;

     while(){
         scanf("%d",&number);

         if(number<)
             break;

         if(time!=)
             printf("\n");

         memset(amount,,*sizeof(int));
         temp=number;

         while(){
             for(i=;i<=temp;i++){
                 if(temp%i==){
                     amount[i]++;
                     temp/=i;
                     break;
                 }

             }

             if(temp==)
                 break;
         }

         printf("Case %d.\n",time);
         time++;

         for(i=;i<=number;i++){
             if(amount[i]!=){
                 printf("%d %d ",i,amount[i]);
             }
         }

         printf("\n");
     }

     return ;
 }