zoukankan      html  css  js  c++  java
  • HDU 1164 Eddy's research I【素数筛选法】

    思路:将输入的这个数分成n个素数的相乘的结果,用一个数组存储起来。之后再输出就能够了

    Eddy's research I

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 6633    Accepted Submission(s): 3971


    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
     

    Author
    eddy
     


    #include<stdio.h>
    #include<string.h>
    int a[55];
    int getprime(int x)
    {
        memset(a,0,sizeof(a));
        int i,cnt=0;
        for(i=2; i<=x; i++)
        {
            while(x%i==0)
            {
                a[cnt++]=i;
                x=x/i;
            }
        }
        return cnt;
    }
    int main()
    {
        int n;
        while(~scanf("%d",&n))
        {
            int k,i;
            k=getprime(n);
            for(i=0; i<k-1; i++)
                printf("%d*",a[i]);
            printf("%d
    ",a[k-1]);
            
        }
        return 0;
    } 





  • 相关阅读:
    Windows Driver Mode 1
    一个程序员的奋斗经历 2
    JavaScript判断文件是否存在
    流程图个图标详解
    wget for windows
    软件的开发周期
    Firefox支持activex的插件
    第二次作业
    C/C++字符串使用整理
    c#学习小记录(1)
  • 原文地址:https://www.cnblogs.com/blfshiye/p/4374374.html
Copyright © 2011-2022 走看看