问题 CC: 丑数

题目描述

如果一个数的素因子只包含2,3,5或7,那么我们把这种数叫做丑数。序列1,2,3,4,5,6,7,8,9,10,12,14,15,16,18,20,21,24,25,27…展示了前20个丑数。
请你编程寻找这个序列中的第n个元素。

输入

输入包含多组测试数据。每组输入为一个整数n(1<=n<=5842),当n=0时,输入结束。

输出

对于每组输入,输出一行“The nth humble number is number.”。里面的n由输入中的n值替换,“st”,“nd”,“rd”和“th”这些序数结尾的用法参照输出样例。

样例输入 Copy

1
2
3
4
11
12
13
21
22
23
100
1000
5842
0

样例输出 Copy

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<string.h>
#include<algorithm>
using namespace std;
int num[6000];
int main()
{
	num[1]=1;
	int a=1,b=1,c=1,d=1;
	for(int i=2;i<=5845;i++){
		num[i]=min(num[a]*2,min(num[b]*3,min(num[c]*5,num[d]*7)));
		if(num[i]==num[a]*2)	a++;
		if(num[i]==num[b]*3)	b++;
		if(num[i]==num[c]*5)	c++;
		if(num[i]==num[d]*7)	d++;	
	}
	int n;
	while(~scanf("%d",&n)){
		if(n==0)	break;
		if(n%10==1 && n%100!=11)	printf("The %dst humble number is %d.\n",n,num[n]);
        else if(n%10==2&& n%100!=12)        printf("The %dnd humble number is %d.\n",n,num[n]);
        else if(n%10==3&& n%100!=13)        printf("The %drd humble number is %d.\n",n,num[n]);
        else           printf("The %dth humble number is %d.\n",n,num[n]);
	}	
	return 0;
}
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int num[6000];
int main()
{
	num[1]=1;
	int a=1,b=1,c=1,d=1;
	for(int i=2;i<=5845;i++){
		num[i]=min(num[a]*2,min(num[b]*3,min(num[c]*5,num[d]*7)));
		if(num[i]==num[a]*2)	a++;
		if(num[i]==num[b]*3)	b++;
		if(num[i]==num[c]*5)	c++;
		if(num[i]==num[d]*7)	d++;	
	}
	int n;
	while(~scanf("%d",&n)){
		if(n==0)	break;
		if(n%10==1 && n%100!=11)	printf("The %dst humble number is %d.\n",n,num[n]);
        else if(n%10==2&& n%100!=12)        printf("The %dnd humble number is %d.\n",n,num[n]);
        else if(n%10==3&& n%100!=13)        printf("The %drd humble number is %d.\n",n,num[n]);
        else           printf("The %dth humble number is %d.\n",n,num[n]);
	}	
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值