HDU1164：Eddy's research I

最新推荐文章于 2019-08-02 18:01:31 发布

原创最新推荐文章于 2019-08-02 18:01:31 发布 · 780 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#ACM #解题报告 #HDU

水专栏收录该内容

330 篇文章

订阅专栏

本文介绍了一个用于将整数分解为其素数因子的程序。该程序首先生成一个素数列表，然后利用这些素数来分解输入的整数。输入为一个整数，输出则是该整数的素数因子分解形式。

Problem Description

Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't write program, so Eddy has to ask intelligent you to help him, he asks you to write a program which can do the number to divided into the multiply of prime number factor .

Input

The input will contain a number 1 < x<= 65535 per line representing the number of elements of the set.

Output

You have to print a line in the output for each entry with the answer to the previous question.

Sample Input

11
9412

Sample Output

11
2*2*13*181

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

int prime[70000];

void sushu(void)
{
    int i,j;
    memset(prime,1,sizeof(prime));
    for(i = 2; i<70000; i++)
    {
        if(prime[i])
        {
            for(j = i+i; j<70000; j+=i)
            {
                prime[j] = 0;
            }
        }
    }
}

int main()
{
    int n,i;
    sushu();
    while(~scanf("%d",&n))
    {
        if(prime[n])
        {
            printf("%d\n",n);
            continue;
        }
        int flag = 1;
        for(i = 2; i<=n; i++)
        {
            while(n%i == 0)
            {
                if(flag)
                {
                    printf("%d",i);
                    flag = 0;
                }
                else
                    printf("*%d",i);
                n = n/i;
            }
        }
        printf("\n");
    }

    return 0;
}