dp训练 1004

发布时间:2016-12-7 20:29:25 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"dp训练 1004",主要涉及到dp训练 1004方面的内容,对于dp训练 1004感兴趣的同学可以参考一下。

Humble Numbers Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 21   Accepted Submission(s) : 15 Font: Times New Roman | Verdana | Georgia Font Size: ← → 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. 解题报告:就是求一个数,要求是2,3,5,7的倍数,并且求出他们的顺序,状态方程:dp[i]=Min(dp[x2]*2,dp[x3]*3,dp[x5]*5,dp[x7]*7);找到比dp[i-1]相离最近的且比dp[i-1]大的值,并让i1,i2,i3,i4其中一个加1。 #include<stdio.h> int min(int a,int b) {     if(b>a) return a;     else return b; } int main() {     int a[6000];     int i1,i2,i3,i4,i,n;    i=i1=i2=i3=i4=1;     a[1]=1;     while(i<=5842)     {         i++;         a[i]=min(a[i1]*2,min(a[i2]*3,min(a[i3]*5,a[i4]*7)));//求出最小的进行赋值 //求一个数,求是2,3,5,7的倍数         if(a[i]==a[i1]*2)             i1++;         if(a[i]==a[i2]*3)             i2++;         if(a[i]==a[i3]*5)             i3++;         if(a[i]==a[i4]*7)             i4++;     }     while(scanf("%d",&n),n)     {         if(n==1&&n0!=11)             printf("The %dst humble number is %d.\n",n,a[n]);         else if(n==2&&n0!=12)             printf("The %dnd humble number is %d.\n",n,a[n]);         else if(n==3&&n0!=13)             printf("The %drd humble number is %d.\n",n,a[n]);         else             printf("The %dth humble number is %d.\n",n,a[n]);     }     return 0; }

上一篇:《C Primer Plus(第五版)中文版》第十章第8题答案
下一篇:内部比赛&nbsp;A&nbsp;&nbsp;Alfredo\&#039;s&nbsp;Pizza&nbsp;Res…

相关文章

关键词: dp训练&nbsp;1004

相关评论