Zzuli:1071 decomposing prime factor

Title Description

Divide a positive integer into prime factors , for example , Input 90, Output 2 3 3 5.

Input

Enter a positive integer n（2<=n<=2000）.

Output

From small to large output n All the qualitative factors of , There is a space between every two numbers .

The sample input  Copy

20

Sample output  Copy

2 2 5

#include <stdio.h>
int main()
{
    int n,i,k;
    scanf("%d",&n);
    i=2;
    do
    {
        if(n%i==0)
        {
            if(n==i)
                printf("%d",i);
            else
                printf("%d ",i);
            n=n/i;
        }
        else
            i++;
        
    } while(n/i!=0);
    return 0;
}