Hdu1058 humble numbers

Source: Internet
Author: User

Humble numbers

Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)
Total submission (s): 13158 accepted submission (s): 5715

Problem descriptiona 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.

Write a program to find and print the nth element in this sequence

Inputthe input consists of one or more test cases. each test case consists of one integer N with 1 <=n <= 5842. input is terminated by a value of zero (0) for N.

Outputfor each test case, print one line saying "the nth humble number is number. ". depending on the value of N, the correct suffix "St", "nd", "RD ", or "th" for the ordinal number nth has to be used like it is shown in the sample output.

Sample Input

1234111213212223100100058420
 

Sample output

The 1st humble number is 1.The 2nd humble number is 2.The 3rd humble number is 3.The 4th humble number is 4.The 11th humble number is 12.The 12th humble number is 14.The 13th humble number is 15.The 21st humble number is 28.The 22nd humble number is 30.The 23rd humble number is 32.The 100th humble number is 450.The 1000th humble number is 385875.The 5842nd humble number is 2000000000.
 

Sourceuniversity of Ulm Local contest 1996

Recommendjgshining

#include<stdio.h>int min(int a,int b,int c,int d){    a=a<b?a:b;    c=c<d?c:d;    a=a<c?a:c;    return a;}int main(){    int m=5848;    int hum[5850];    int i2,i3,i5,i7;    i2=i3=i5=i7=1;    int i;    hum[1]=1;    for(i=2;i<=m;i++)    {        hum[i]=min(hum[i2]*2,hum[i3]*3,hum[i5]*5,hum[i7]*7);        if(hum[i]==hum[i2]*2)i2++;        if(hum[i]==hum[i3]*3)i3++;        if(hum[i]==hum[i5]*5)i5++;        if(hum[i]==hum[i7]*7)i7++;       /* switch(hum[i])        {            case hum[i2]*2:++i2;break;            case hum[i3]*3:i3++;break;            case hum[i5]*5:i5++;break;            case hum[i7]*7:i7++;        }*/    }    int n;    while(scanf("%d",&n)&&n)    {        printf("The %d",n);        if(n%10==1&&n%100!=11)            printf("st");        else if(n%10==2&&n%100!=12)            printf("nd");        else if(n%10==3&&n%100!=13)            printf("rd");        else            printf("th");        printf(" humble number is %d.\n",hum[n]);    }    return 0;}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.