zoukankan      html  css  js  c++  java
  • Greatest Greatest Common Divisor HD5207

    Greatest Greatest Common Divisor

     
     Accepts: 271
     
     Submissions: 1138
     Time Limit: 4000/2000 MS (Java/Others)
     
     Memory Limit: 65536/65536 K (Java/Others)
    Problem Description

    Pick two numbers ai,aj(ij) 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 an1T100,2n105,1ai105. The case for n104 is no more than 10.

    Output

    For each test case, output one line. The output format is Case #xansx is the case number, starting from 1ans is the maximum value of greatest common divisor.

    Sample Input
    2
    4
    1 2 3 4
    3
    3 6 9
    
    Sample Output
    Case #1: 2
    Case #2: 3

    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    五子棋
    纯ASP实现的“无刷新”聊天室
    砸砖块
    ASP.NET中批量插入数据
    判断一个dataset的数据是否包含另一个dataset的数据
    使用DB2时的一些问题
    RTOS,什么是硬实时和软实时
    异或运算^的一个作用
    vc 重启和关机
    About DLL
  • 原文地址:https://www.cnblogs.com/Tobyuyu/p/4965472.html
Copyright © 2011-2022 走看看