numbers.java

检测数字是不是Lazy Caterer s Sequence Palindromic Numbers Harmonic Numbers Prime Numbers

/**
 * @(#)Numbers.java
 *
 *
 * @author 
 * @version 1.00 2008/9/20
 */


import java.util.Scanner;

public class Numbers {
	public static void main(String[] args)
	{	Scanner keyboard = new Scanner(System.in);
		System.out.print("Enter number:");
		long cut = keyboard.nextLong();
		long totalPieces = 1;
		for (long count=0; count <= cut; count++ )
		{
			totalPieces = totalPieces + count;
		}	
		System.out.println("Maximum Number of Pieces after " + cut + " cuts:" + totalPieces);
		
		
		long parlin = cut;
		long reParlin = 0;
	 	boolean flag = false;
	  	do
	  		{
			long diParlin = parlin;		
			for(reParlin = 0; diParlin >0; diParlin = diParlin/10)
				{
					long mod = diParlin%10;
					reParlin = reParlin*10 + mod;
				
				}
			
			if (reParlin == parlin)
				flag = true;
			else
			{
				parlin = reParlin + parlin;
			}	
			}while(!flag);
	
		
	System.out.println("Palindrome number:" + parlin);
	
	
    
   
    double sum = 0.0;
	double temp = 1.0;
	if (cut >= 1)
		{
			for(double n = 1.0; n <= cut; n++)
				{	
					temp = (1/n);
    				sum = sum + temp  ;
    			}
    		System.out.println("Harmonic number:" + sum);
    	}
    else 
    	{
    		System.out.println("Harmonic number:" + 0);
    	}
    	
    
    
    
    long i = 2;
    
    
    if (cut == 1)
  	{
  		System.out.print("Is " + cut + " Prime number: false");
  	}
    
    
    else	
    	{
    		do
    		 	{
    				long m = cut%i;
    				if((m == 0)&& (i != cut ))
    					{
    						System.out.println("Is " + cut + " Prime number: false");
    						break;
    					}
    			 
    				
    				
    				else 
    					{
    						i = i + 1;
    						if (i >= (cut/2))
    							System.out.println("Is " + cut + " Prime number: true");     						    				
    					}
    		 	}while(i<(cut/2));			 
    						  		
    	}
	}
}