【HDU 5207】Greatest Greatest Common Divisor —— 最大公因子

最新推荐文章于 2019-06-15 23:07:30 发布

treasuresss

最新推荐文章于 2019-06-15 23:07:30 发布

阅读量550

点赞数

分类专栏： hdu ACM 文章标签： ACM hdu

本文链接：https://blog.csdn.net/treasuresss/article/details/45191365

版权

ACM 同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

hdu

14 篇文章 0 订阅

订阅专栏

原题链接

Greatest Greatest Common Divisor

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 665 Accepted Submission(s): 298

Problem Description

Pick two numbers

ai,aj(i≠j) from a sequence to maximize the value of their greatest common divisor.

Input

Multiple test cases. In the first line there is an integer

T , indicating the number of test cases. For each test cases, the first line contains an integer

n , the size of the sequence. Next line contains

n numbers, from

a1 to

an .

1≤T≤100,2≤n≤105,1≤ai≤105 . The case for

n≥104 is no more than

10 .

Output

For each test case, output one line. The output format is Case #

x :

ans ,

x is the case number, starting from

1 ,

ans is the maximum value of greatest common divisor.

Sample Input

Sample Output

  
  
   
   Case #1: 2
Case #2: 3

解题报告：

很水的一道题，竟然做了一天！摔！想的太多了，直接遍历就够了喂！当然遍历的时候要借用朴素筛法的思想，遍历到根号界就可以了，要不然肯定超时.......

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int MAX=100000;
int a[MAX+10];
int main()
{
    int T,n,cnt=0,tmp,ans;
    cin>>T;
    while(T--)
    {
        memset( a,0,sizeof(a) );
        cin>>n;
        for(int i=0;i<n;++i){
            scanf("%d",&tmp);
            for(int j=1;tmp>=j*j;++j){
                if(tmp%j==0){++a[j]; if(j*j!=tmp) ++a[tmp/j];}
            }
        }
        for(ans=100000; ans>1 && a[ans]<2;--ans);
        printf("Case #%d: %d\n",++cnt,ans);
    }
    return 0;
}