Humble Numbers
来源:互联网 发布:sql创建两个主键约束 编辑:程序博客网 时间:2024/06/05 23:51
M - Humble Numbers
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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
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
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.
#include<stdio.h>#include<set>#include<math.h>using namespace std;int main(){set<long long >s;//直接暴力,枚举2,3,5,7的幂,然后乘,存到set里,自动排序。 set<long long >::iterator it;long long a[6000],t,t2,t3,t4,t5;int n,i,j,k,d;s.insert(1);for(i=0;pow(2,i)<=2e9;i++)for(j=0;pow(3,j)<=2e9;j++){if(pow(3,j)*pow(2,i)>2e9)break;for(k=0;pow(5,k)<=2e9;k++){if(pow(2,i)*pow(3,j)*pow(5,k)>2e9)break;for(d=0;pow(7,d)<=2e9;d++){t=pow(2,i)*pow(3,j)*pow(5,k)*pow(7,d);if(t>2e9)break;s.insert(t);}}}a[0]=0;for(i=1,it=s.begin();it!=s.end();i++,it++)a[i]=*it;while(~scanf("%d",&n)&&n!=0){if(n%100!=11&&n%10==1)printf("The %dst humble number is %lld.\n",n,a[n]);//巨坑啊,英语序数词末尾是11,12,13也是th ,坑不坑!!! else if(n%100!=12&&n%10==2)printf("The %dnd humble number is %lld.\n",n,a[n]);else if(n%100!=13&&n%10==3)printf("The %drd humble number is %lld.\n",n,a[n]);else printf("The %dth humble number is %lld.\n",n,a[n]);}}
阅读全文
0 0
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- python pandas 基础知识
- 文字省略样式
- HBase数据快速导入之ImportTsv&Bulkload
- C++ 堆内存管理
- VEC-C滑窗
- Humble Numbers
- Mac下安装opencv-python
- numpy array append or concatenate
- halcon手册——匹配matching
- chattr 命令
- android textview小技巧
- Python
- SSH ftp 上传下载
- 生命周期