1164b eddy's research i.cpp

威士忌的HDU题解.大概有260多题的源码。对于学习非常有好处。

/*
1164b Eddy's research I
Time Limit : 1000 ms  Memory Limit : 32768 K  Output Limit : 5120 K

GUN C++
*/
#include <iostream>
using namespace std;

const int Max=100;

/**************寻找因子************/
int findFactor(int savenum[],int n)
{
    int total,temp,i;
    i=2;total=0;
    while(n>=2)
    {
        if(n%i==0)
        {
            savenum[total]=i;
            total++;
            n/=i;
        }
        else
            i++;
    }
    return total-1;
}

int main()
{
    int fac[Max],n,ca,t;
    while(cin>>n)
    {
        t=findFactor(fac,n);
        for(ca=0;ca<=t;ca++)
        {
            cout<<fac[ca];
            if(ca<t)
                cout<<'*'<<flush;
            else
                cout<<endl;
        }
    }
    return 0;
}