akoj-1229-An Easy Problem

An Easy Problem

Time Limit:1000MS  Memory Limit:65536K
Total Submit:15 Accepted:9

Description

n mathematics, a prime number (or a prime) is a natural number which has exactly two distinct natural number divisors: 1 and itself. In many cases, it is not enough to know whether a number is prime; sometimes, you need to know its factors.
Every positive integer greater than 1 can be expressed as a product of prime numbers. This factorization is unique and is called the prime factorization. For example, the number 60 can be decomposed into factors 2×2×3×5, each of which is prime. Note that the same prime can appear more than once in the factorization. Note that the same prime can appear more than once in the factorization.
Write a program to display the prime factorization of a number n.

Input

There are multiple test cases. Each case takes one line and contains exact one integer n(2≤n≤2^31-1).
n=0 indicates the end of the input and should not be processed by your program.

Output

For each case, output the prime factorization of a number n.

Sample Input

2
60
0

Sample Output

2
2*2*3*5

Source

[Submit]   [Go Back]   [Status]   [Discuss]

                 思路：分解因子

#include<iostream>
#include<string>
using namespace std;
const int D = 10000;
int primeF[D];
int main()
{
    int n;
    while(cin>>n)
    {
        if(n==0)
            break;
        int k = 0;
        for(int i=2; i<=n; ++i)
        {
            while(n%i==0)
            {
                primeF[k++] = i;
                n /= i;
            }
        }
        cout<<primeF[0];
        for(int i=1; i<k; ++i)
            cout<<"*"<<primeF[i];
        cout<<endl;
    }
    return 0;
}