BestCoder Round #54 (div.2) HDOJ5428 The Factor(脑洞)
来源:互联网 发布:no surprises知乎 编辑:程序博客网 时间:2024/06/04 19:19
The Factor
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 495 Accepted Submission(s): 154
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
每个数有用的是自己的质因子,求出质因子并保存,最小的两个乘积即为答案。
AC代码:
#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MAXN = 110;typedef long long ll;int n;ll a[MAXN], ans[MAXN << 2];int main(int argc, char const *argv[]){int t;scanf("%d", &t);while(t--) {int cnt = 0;scanf("%d", &n);for(int i = 1; i <= n; ++i) {scanf("%lld", &a[i]);for(int j = 2; (ll)j * j <= a[i]; ++j)while(a[i] % j == 0) {ans[cnt++] = j;a[i] /= j;}if(a[i] != 1) ans[cnt++] = a[i];}if(cnt < 2) printf("-1\n");else {sort(ans, ans + cnt);printf("%lld\n", ans[0] * ans[1]);}}return 0;}</span>
1 0
- 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)
- BestCoder Round #54 (div.2) HDU5428 The Factor
- HDU 5428 The Factor——BestCoder Round #54(div.1 div.2)
- hdoj5428 The Factor
- bestcoder#54 The Factor
- BestCoder Round #54 (div.2)
- 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
- BestCoder Round #59 (div.2) HDU5500 Reorder the Books
- BestCoder Round #59 (div.2)B.Reorder the Books
- BestCoder Round #54 (div.1)
- BestCoder Round #11 (Div. 2)
- BestCoder Round #11 (Div. 2)
- BestCoder Round #54 (div.2)
- 笔试题:判断一个树是不是平衡二叉树
- ssh比较全的一个网站
- 阳光充沛的一天
- log4j配置详解
- BestCoder Round #54 (div.2) HDOJ5428 The Factor(脑洞)
- hiho一下 第六十二周 题目1 : Browser Caching stl 应用
- 关于Json的一些东西
- c语言预编译以及static,extern的使用
- uva 12545 - Bits Equalizer
- JSONObject与JSONArray的使用
- openwrt下编译mt7628的uboot
- sizeof为什么不能计算被动态分配的数组
- 黑马程序员————java基础————面向对象