zoukankan      html  css  js  c++  java
  • The number of divisors(约数) about Humble Numbers[HDU1492]

    The number of divisors(约数) about Humble Numbers

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 2044    Accepted Submission(s): 1006


    Problem Description
    A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers.

     

    Now given a humble number, please write a program to calculate the number of divisors about this humble number.For examle, 4 is a humble,and it have 3 divisors(1,2,4);12 have 6 divisors.

     


     

     

    Input
    The input consists of multiple test cases. Each test case consists of one humble number n,and n is in the range of 64-bits signed integer. Input is terminated by a value of zero for n.

     

     

     

    Output
    For each test case, output its divisor number, one line per case.

     

     

     

    Sample Input
    4
    12
    0
     

     

    Sample Output
    3
    6
     

     

    Author
    lcy
     

     

    Source
    “2006校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛
     

     

    Recommend
    LL

    #include<stdio.h>
    int main()
    {
        __int64 n,p1,p2,p3,p4;
        while (scanf("%I64d",&n)!=EOF)
        {
            if (n==0) return 0;
            p1=p2=p3=p4=1;
            while (n && n%2==0)
            {
                p1++;
                n/=2;
            }
            while (n && n%3==0)
            {
                p2++;
                n/=3;
            }
            while (n && n%5==0)
            {
                p3++;
                n/=5;
            }
            while (n && n%7==0)
            {
                p4++;
                n/=7;
            }
            printf("%I64d
    ",p1*p2*p3*p4);
        }
        return 0;
    }

     

     

  • 相关阅读:
    THUWC 2019 第二轮 纯口胡题解
    Codeforces Round #607 (Div. 1) Solution
    Codeforces Round #606 (Div. 1) Solution
    CSP-S 2019 简要题解
    NOIP 2018 简要题解
    luogu P5605 小 A 与两位神仙
    luogu P5606 小 K 与毕业旅行
    AtCoder Grand Contest 040 简要题解
    AtCoder Grand Contest 035 简要题解
    AtCoder Grand Contest 036 简要题解
  • 原文地址:https://www.cnblogs.com/dramstadt/p/3245309.html
Copyright © 2011-2022 走看看