自己做题的简单的算法

 1 package example;
 2 
 3 public class Test {
 4 
 5     /**
 6      * @param args
 7      */
 8     public static void main(String[] args) {
 9         int count =0;
10         for(int i=101;i<=201;i++){
11         if(issushu(i)==true){
12             count++;
13             System.out.print(i+" ");
14         }
15         }
16         System.out.println(count+"个素数");
17     }
18     
19 
20     private static boolean issushu(int i) {
21         for(int j=2;j<i;j++)
22         {
23             if(i%j==0)
24                 return false;        
25         }
26         return true;
27     }    
28 }

 1 package example;
 2 
 3 public class Test {
 4 
 5     /**
 6      * @param args
 7      */
 8     public static void main(String[] args) {
 9         
10         for(int i=100;i<=999;i++){
11         if(ishua(i)==true)
12             System.out.print(i+" ");
13         
14         }
15     }
16     
17 
18     private static boolean ishua(int i) {
19         int j=i/100;
20         int q=(i-100*j)/10;
21         int p=i-100*j-10*q;
22         if(j*j*j+q*q*q+p*p*p==i)
23             return true;
24         else 
25             return false;
26     }    
27 }

package example;

public class Test {

    /**
     * @param args
     */
    public static void main(String[] args) {
        fenjie(90);
            
    }
    public static void fenjie(int n) {
        for (int i = 2; i <= n; i++)
        {
            if (n % i == 0) 
            {
                System.out.print(i);
                if(n!=i)
                {
                    System.out.print("*");
                }
                fenjie(n/i);
            }
        }
        System.exit(0); 
    }
        
}