hdoj5428The Factor【分解质因数】

The Factor

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

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

Print  T  answers in  T  lines.

 

Sample Input

  
  

   
   2
3
1 2 3
5
6 6 6 6 6
  
  

 

Sample Output

  
  

   
   6
4
  
  

 

Source

BestCoder Round #54 (div.2)

求出每个数的所有质因数中最小的两个相乘即为答案如果小于两个则无解

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define inf 0x7fffffff
using namespace std;
const int maxn=110;
long long num[maxn];
long long ans[5];
int main()
{
	int t,i,k,n;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		ans[0]=ans[1]=inf;
		for(i=0;i<n;++i){
			scanf("%lld",&num[i]);
			long long j=2;
			while(j*j<=num[i]){
				while(num[i]%j==0){
					if(j<ans[1]){
						if(j<ans[0]){
							ans[1]=ans[0];
							ans[0]=j;
						}
						else ans[1]=j;
					}
					num[i]/=j;
				}
				j++;
			}
			if(num[i]>1){
				if(num[i]<ans[1]){
					if(num[i]<ans[0]){
						ans[1]=ans[0];
						ans[0]=num[i];
					}
					else ans[1]=num[i];
				}
			}
		}
		if(ans[1]!=inf){
			printf("%lld\n",ans[0]*ans[1]);
		}
		else {
			printf("-1\n");
		}
	}
	return 0;
}