hdu 5428 The Factor(数论)
来源:互联网 发布:苹果mac壁纸百度网盘 编辑:程序博客网 时间:2024/05/22 00:48
题目: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 ofn (1≤n≤100) .
2. The second line containsn integers a1,…,an (1≤a1,…,an≤2×109) , which denote these n positive integers.
For each testcase, there are two lines:
1. The first line contains one integer denoting the value of
2. The second line contains
Output
Print T answers in T lines.
Sample Input
231 2 356 6 6 6 6
Sample Output
64
分析:最近刚学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]); } }}
0 0
- hdu 5428 The Factor(数论)
- hdu 5428 The Factor(数论)
- HDU 5428 The Factor
- HDU 5428 The Factor
- hdu 5428 The Factor
- HDU 5428 The Factor
- HDU 5428:The Factor
- hdu 5428 The Factor
- HDU 5428 The Factor
- hdu 5428 The Factor
- HDU 2136 Largest prime factor(数论)
- Hdu 5428 The Factor【思维】
- hdu 5428 The Factor(分解质因子)
- hdu(5428)——The Factor(质因数分解)
- HDU 5428 The Factor(分解质因子)
- HDU 5428 The Factor(分解质因子)
- The Factor(数论规律题+求质因子)
- hdu 2136 Largest prime factor(数论:打表)
- 2013腾讯面经(技术类-后台开发)
- 类对象的赋值和复制
- 【Python】正则表达式的威力
- 抽象基类、访问控制与继承和继承中的类作用域
- css样式布局
- hdu 5428 The Factor(数论)
- 欢迎使用CSDN-markdown编辑器
- Android SDK Manager的更新服务更新SDK组件
- 在物理 Data Guard 中对异构主备系统的支持
- Windows Server 2012 R2在桌面上显示计算机/网络图标
- 【Python】切割字符串
- hdu2845二分图 Hopcroft-Karp Algorithm
- 关于websocket断开连接的一些猜想
- 关于逻辑回归(Logistic regression)模型的简单思考