acm 3 1004
来源:互联网 发布:软件资格考试怎么报名? 编辑:程序博客网 时间:2024/05/16 17:49
1.1004
2.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
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
University of Ulm Local Contest 1996
Recommend
JGShining
3.每个数分解成2 3 5 7 的乘积,对于 dp[i]=f[i]=min(f[a]*2,min(f[b]*3,min(f[c]*5,f[d]*7)))
找到比f[i-1]大且最小的数
4.
a表示f[]数组中,下标为a的数*2 可能得到当前的 f[i];若是则++
b表示f[]数组中,下标为b的数* 3 可能得到当前的f[i];若是则++
c表示f[]数组中,下标为b的数* 5 可能得到当前的f[i];若是则++
d表示f[]数组中,下标为b的数* 7 可能得到当前的f[i];若是则++
求出他们中的min,则为f[i];
5.#include<iostream>
#include<cmath>
#include<string.h>
#include<stdio.h>
using namespace std;
int main()
{
// freopen("r.txt","r",stdin);
long long int arr[6666];
arr[1]=1;
int a,b,c,d;
a=b=c=d=1;
int i;
for(i=2;i<5844;i++)
{
arr[i]=min(arr[a]*2,min(arr[b]*3,min(arr[c]*5,arr[d]*7)));
//cout<<arr[i]<<endl;
if(arr[i]==arr[a]*2)
a++;
if(arr[i]==arr[b]*3)
b++;
if(arr[i]==arr[c]*5)
c++;
if(arr[i]==arr[d]*7)
d++;
}
//cout<<arr[5200]<<endl;
int n;
while(~scanf("%d",&n))
{
if(n==0) break;
cout<<"The "<<n;
if(n%10==1&&n%100!=11)
cout<<"st humble number is ";
else if(n%10==2&&n%100!=12)
cout<<"nd humble number is ";
else if(n%10==3&&n%100!=13)
cout<<"rd humble number is ";
else
cout<<"th humble number is ";
cout<<arr[n]<<"."<<endl;
}
}
- acm 3 1004
- acm 3
- ZJU ACM 1004
- ACM 1004--Financial Management
- ACM HDU 1004
- PKU ACM 1004
- 杭电 ACM 1004
- 杭电ACM 1004
- ACM 1004 四子连棋(BFS)
- 杭电ACM 1004
- BJFU-ACM-1004 Sudoku
- 北大ACM试题1004
- 杭电acm 1004
- HDU-ACM-1004
- ACM第一次练习-1004
- acm 1004 节目-时间
- 1004贪心算法acm
- acm 2 1004 Toxophily
- 删去小于阈值的连通区域
- unity 计算两点的距离
- Compose YAML 模板文件
- 公司面试题目 打印矩阵,先往右打印,到头然后向左下打印,到头然后向左打印,最后向上打印
- Spark入门实战系列--6.SparkSQL(下)--Spark实战应用
- acm 3 1004
- ExpandListView--二级列表事例
- iOS开发——静态库的导入和头文件路径的设置
- PHP设计模式:观察者模式
- Spark入门实战系列--7.Spark Streaming(上)--实时流计算Spark Streaming原理介绍
- 有感
- <<web>>3d 相册
- 【LeetCode】330. Patching Array
- js解析json数据