Distinct primes factors-Project Euler 47(JAVA)

问题描述:

The first two consecutive numbers to have two distinct prime factors are:

14 = 2 × 7
15 = 3 × 5

The first three consecutive numbers to have three distinct prime factors are:

644 = 2² × 7 × 23
645 = 3 × 5 × 43
646 = 2 × 17 × 19.

Find the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers?

穷举代码如下:

        int i = 1000;
		while(true) {
			if(p(i) && p(i+1) && p(i+2) && p(i+3)) {
				System.out.println(i);
				break;
			}
			i++;
		}


        public static boolean p(int n){
		    int a = 2;
		    HashSet ss = new HashSet<Integer>();
		    while(n > 1) {
			    if(n % a == 0) {
				    if(!ss.contains(a))
					    ss.add(a);
								
				    n /= a;
    				a = 2;
	    		} else {
		    		a++;
			    }
		    }
		
	    	return ss.size() == 4;
	    }

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值