java 杭电1058Humble Numbers

Humble Numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22859    Accepted Submission(s): 10003

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   |   We have carefully selected several similar problems for you:   1069  1176  1024  1025  1505 

号外号外，java版的出来啦：

package hdu;
import java.util.*;
import java.text.*;
import java.math.*;
public class Main {

	public static void main(String[] args) {
		// TODO 自动生成的方法存根
		Scanner cin=new Scanner(System.in);
		long a[]=new long [110000];
		long vis[]=new long [110000];
		int cnt=0;
		for(int i=0;i<32;i++)//对结果进行打表
		{
			if(Math.pow(2, i)>2000000000)
			break;
			long help1=(long)Math.pow(2, i);
			for(int j=0;j<21;j++)
			{
				long help2=(long)Math.pow(3, j);
				help2*=help1;
				if(help2>2000000000)
				break;
				for(int k=0;k<15;k++)
				{
					long help3=(long)Math.pow(5, k);
					help3*=help2;
					if(help3>2000000000)
					break;
					for(int l=0;l<13;l++)
					{
						long help4=(long)Math.pow(7, l);
						help4*=help3;
						if(help4>2000000000)
						break;
						a[cnt++]=help4;
//						if(help4==4)
//						{
//							System.out.println(i);
//							System.out.println(j);
//							System.out.println(k);
//							System.out.println(l);
//							System.out.println(cnt);
//						}
					}
				}
			}
		}
		//System.out.println(cnt);
		Arrays.sort(a,0,cnt);
		//for(int i=0;i<20;i++)
			//System.out.println(a[i]);
		while(cin.hasNext())
		{
			int n=cin.nextInt();
			if(n==0)
			break;
			if(n%10==1&&n%100!=11)//表示java输出好愁人
			{
				System.out.print("The ");
				System.out.print(n);
				System.out.print("st humble number is ");
				System.out.print(a[n-1]);
				System.out.println(".");
			}
			else if(n%10==2&&n%100!=12)
			{
				System.out.print("The ");
				System.out.print(n);
				System.out.print("nd humble number is ");
				System.out.print(a[n-1]);
				System.out.println(".");
			}
			else if(n%10==3&&n%100!=13)
			{
				System.out.print("The ");
				System.out.print(n);
				System.out.print("rd humble number is ");
				System.out.print(a[n-1]);
				System.out.println(".");
			}
			else
			{
				System.out.print("The ");
				System.out.print(n);
				System.out.print("th humble number is ");
				System.out.print(a[n-1]);
				System.out.println(".");
			}
				
		}
	}
}