zoukankan      html  css  js  c++  java
  • Humble Numbers

    Time Limit: 
    1000ms
     
    Memory Limit: 
    65536kB
    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. 

    Write a program to find and print the nth element in this sequence.
    Input
    The 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.
    Output
    For 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
    1
    2
    3
    4
    11
    12
    13
    21
    22
    23
    100
    1000
    5842
    0
    
    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.
    
    Source
      Ulm Local 1996
    题意:类似找“丑数”,找到能够不被2,3,5,7整除的第K个数,输出超级坑爹
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstdlib>
     4 #include<cmath>
     5 #include<algorithm>
     6 #include<cstring>
     7 #include<queue>
     8 #include<vector>
     9 #include<set>
    10 using namespace std;
    11 typedef long long LL;
    12 LL N;
    13 const LL coeff[10]={0,2,3,5,7};
    14 LL ugly_num[50000];
    15 inline void find_ugly(){
    16     priority_queue<LL,vector<LL>,greater<LL> >pq; 
    17     set<LL> s;
    18     pq.push(1); s.insert(1);
    19     for(LL i=1; ;i++){
    20         LL x=pq.top(); pq.pop();
    21         ugly_num[i]=x;
    22         if(i==10001) goto end;
    23         for(LL j=1;j<=4;j++){
    24             LL x2=x*coeff[j];
    25             if(s.count(x2)==false){
    26                 s.insert(x2);
    27                 pq.push(x2);
    28             }
    29         }
    30     }
    31     end:return ;
    32 }
    33 int main(){
    34     find_ugly();
    35     for(;;){
    36         scanf("%lld",&N);
    37         if(N==0) break;
    38         if (N%10==1&&N%100!=11) cout<<"The "<<N<<"st humble number is "<<ugly_num[N]<<'.'<<endl;
    39         if (N%10==2&&N%100!=12) cout<<"The "<<N<<"nd humble number is "<<ugly_num[N]<<'.'<<endl;
    40         if (N%10==3&&N%100!=13) cout<<"The "<<N<<"rd humble number is "<<ugly_num[N]<<'.'<<endl;
    41         if (N%10>3||N%10==0||N%100==11||N%100==12||N%100==13) 
    42             cout<<"The "<<N<<"th humble number is "<<ugly_num[N]<<'.'<<endl;
    43     }
    44     return 0;
    45 }
  • 相关阅读:
    登录功能通用测试用例
    sql中的 where 、group by 和 having 用法解析(摘抄)
    PL/SQL链接数据库
    Ubuntu 14.04下搭建SVN服务器(SVN Server),摘抄过来,以防万一
    VMware® Workstation 12 Pro Linux Ubuntu 中subversion的服务器搭建
    到底EJB是什么
    xml操作-Nested exception: org.xml.sax.SAXParseException: White spaces are required between publicId and systemId. 异常处理
    Hibernate 延迟加载剖析与代理模式应用
    CommandBehavior.CloseConnection使用
    hibernate 级联删除报更新失败的问题(org.hibernate.exception.GenericJDBCException: Could not execute JDBC batch update)
  • 原文地址:https://www.cnblogs.com/CXCXCXC/p/4924405.html
Copyright © 2011-2022 走看看