BestCoder Round #54 (div.2) HDU5428 The Factor
来源:互联网 发布:杜兰特2017总决赛数据 编辑:程序博客网 时间:2024/05/22 15:02
The Factor
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1833 Accepted Submission(s): 554
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 contains n integersa1,…,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 n integers
Output
Print T answers in T lines.
Sample Input
231 2 356 6 6 6 6
Sample Output
64
Source
BestCoder Round #54 (div.2)
出题人:对于每一个数字,它有用的部分其实只有它的所有质因子
(包括相等的)。求出所有数的所有质因子中最小的两个,
相乘就是答案。如果所有数字的质因子个数不到两个,那么就是无解。
时间复杂度O(n∗sqrt(a))。
0 0
- BestCoder Round #54 (div.2) HDU5428 The Factor
- hdu5428(BestCoder Round #54 (div.2)1002题)
- BestCoder Round #54 (div.2)(hdu5427,hdu5428,hdu5429,hdu5430)
- BestCoder Round #54 (div.2) HDOJ5428 The Factor(脑洞)
- The Factor-----(BestCoder Round #54 (div.2))
- BestCoder Round #54 (div.2) HDU 5428 The Factor(1002)
- HDU 5428 The Factor——BestCoder Round #54(div.1 div.2)
- HDU5428------The Factor
- The Factor(hdu5428)
- bestcoder#54 The Factor
- HDU5428 - The Factor (因式分解)
- BestCoder Round #54 (div.2)
- HDU5428 The Factor【分解质因子】
- BestCoder Round #54 (div.2) 题解
- BestCoder Round #50 (div.2) & HDOJ5366 The mook jong(dp)
- BestCoder Round #50 (div.2)-----C The mook jong
- BestCoder Round #50 (div.2)HDU5366 The mook jong
- BestCoder Round #59 (div.2) 1002 Reorder the Books
- 论坛自动发帖原理介绍
- PTA数据结构 5-5 堆中的路径
- 关于docker包存储结构说明
- 【work】输出连续最多的字符
- Python编程中常用的12种基础知识总结
- BestCoder Round #54 (div.2) HDU5428 The Factor
- 字节流转换成字符流
- 3D变换中矩阵各个部分代表的意思
- 自动控制中的泛函分析(一)
- Java 重写 equals 与 hashCode 的注意事项
- POJ 2923 Relocation(状压DP+01背包问题)
- oracle数据库学习笔记(二)
- BestCoder Round #54 (div.2) HDU5329 Geometric Progression
- oracle数据库学习笔记(三)