hdu 5428 The Factor（数论）

最新推荐文章于 2021-07-28 09:18:23 发布

原创最新推荐文章于 2021-07-28 09:18:23 发布 · 632 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#hdu

algorithm_数论同时被 2 个专栏收录

81 篇文章

订阅专栏

java

11 篇文章

订阅专栏

本文探讨了一道数论问题，即在给定一组正整数的情况下，寻找它们乘积的最小因子（至少包含四个因子）。通过解析输入数据并应用数论原理，我们提供了一个简洁高效的解决方案，旨在帮助读者理解数论在解决实际问题中的应用。

题目：http://acm.hdu.edu.cn/showproblem.php?pid=5428

The Factor

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1707 Accepted Submission(s): 527

Problem Description

There is a sequence of

n positive integers. Fancycoder is addicted to learn their product, but this product may be extremely huge! However, it is lucky that FancyCoder only needs to find out one factor of this huge product: the smallest factor that contains more than 2 factors（including itself; i.e. 4 has 3 factors so that it is a qualified factor）. You need to find it out and print it. As we know, there may be none of such factors; in this occasion, please print -1 instead.

Input

The first line contains one integer

T (1≤T≤15) , which represents the number of testcases.

For each testcase, there are two lines:

1. The first line contains one integer denoting the value of

n (1≤n≤100) .

2. The second line contains

n integers

a1,…,an (1≤a1,…,an≤2×109) , which denote these

n positive integers.

Output

T answers in

T lines.

Sample Input

Sample Output

6
4

分析：最近刚学java，所以来做道题，图论，数据结构啥的代码量太大，所以挑数论来做。这题的大意是，求出若干个数字的乘积的最小因子（不小于4）。
弄清问题的本质，写代码就轻松不少。。

import java.util.*;
public class Main {
    static final int maxn=(int)(2e5);
    static long[] fac=new long [maxn],sum=new long [maxn]; //数组长度只能用int？
    public static int cnt;
    static void resolve(long x){
        for(long i=2;i*i<=x;i++){
            while(x%i==0){
                x/=i;
                   fac[cnt++]=i;
               }
        }
        if(x>1){
            fac[cnt++]=x;
        }
    }
    public static void main(String[] args) {
        long t,n,a;
        Scanner sc=new Scanner(System.in);
        t=sc.nextLong();
        for(int k=0;k<t;k++){
            n=sc.nextLong();
            cnt=0;
            for(int i=0;i<n;i++){
                a=sc.nextLong();
                resolve(a);
            }
            Arrays.sort(fac,0,cnt); //和C++的sort类似
            if(cnt<2)System.out.println(-1);
            else System.out.println(fac[0]*fac[1]);
        }
    }

}