加载中…
个人资料
  • 博客等级:
  • 博客积分:
  • 博客访问:
  • 关注人气:
  • 获赠金笔:0支
  • 赠出金笔:0支
  • 荣誉徽章:
正文 字体大小:

Java 求一个数的质因数

(2010-05-09 22:29:32)
标签:

求质因数

杂谈

输出n的所有质数因子 n=13860 则输出 2  2  3  3  5  7  11

 

public class Problem_8

{

         public static void main(String[] args)

         {

                   int n = 13860;

                   int temp = n;

                   for (int i = 2; i <= n; i++)

                   {

                            if (!isPrime(i))

                            {

                                     continue;

                            }

 

                            while (true)

                            {

                                     if (temp%i == 0)

                                     {

                                               temp = temp/i;

                                               System.out.println(i);

                                     }

 

                                     else {

                                               break;

                                     }

                            }

                   }

 

         }

 

         public static boolean isPrime(int n)

         {

                   int i;

                   for (i = 2; i <= n; i++)

                   {

                            if (n%i == 0)

                            {

                                     break;

                            }

                   }

 

                   if (i >= n)

                   {

                            return true;

                   }

 

                   else {

                            return false;

                   }

         }

 

}

 

 

0

阅读 收藏 喜欢 打印举报/Report
  

新浪BLOG意见反馈留言板 欢迎批评指正

新浪简介 | About Sina | 广告服务 | 联系我们 | 招聘信息 | 网站律师 | SINA English | 产品答疑

新浪公司 版权所有