HDU Humble Numbers
来源:互联网 发布:xampp mac使用教程 编辑:程序博客网 时间:2024/06/16 19:50
Humble Numbers
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.
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<cstdio>
#include<algorithm>
using namespace std;
long long dp[5850];
int main()
{
int pr[4]={2,3,5,7};
dp[1]=1;
int i,j,k;
for(i=2;i<5850;i++)
dp[i]=10000000000;
for(i=2;i<=5850;i++)
{
for(j=0;j<4;j++)
{
for(k=i-1;k>0;k--)
{
if(dp[k]*pr[j]<=dp[i-1])
break;
if(dp[k]*pr[j]<dp[i])
dp[i]=dp[k]*pr[j];
}
}
}
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 %lld.\n",dp[n]);
}
}
- HDU 1058 Humble Numbers
- hdu 1058 Humble Numbers
- hdu 1058 Humble Numbers
- HDU Humble Numbers
- HDU 1058 Humble Numbers
- hdu 1058 Humble Numbers
- HDU 1058 Humble Numbers
- hdu 1058 humble numbers
- hdu 1058 Humble Numbers
- hdu 1058 Humble Numbers
- HDU 1058 Humble Numbers
- HDU 1058 Humble Numbers
- HDU 1058 Humble Numbers
- hdu 1058 Humble Numbers
- HDU-1058 Humble Numbers
- hdu 1058 Humble Numbers
- HDU 1058 Humble Numbers
- HDU 1058 Humble Numbers
- MFC——5.菜单
- (正权最短路)Dijkstra+优先队列模板---持续更新
- cocapods 更新第三方库遇到的问题
- MFC中char*,string和CString之间的转换
- 蓝桥杯 猜算式
- HDU Humble Numbers
- a和&a的区别
- shared_ptr and "<"
- java中ArrayList和class简介
- C++获取随机数的办法
- 工作感悟
- 蓝桥杯 — 基础练习 特殊回文数(思路+详解)
- 使用CocoaPods过程中的几个问题
- 【BZOJ2243】【SDOI2011】染色(树链剖分+线段树)