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

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

  • 相关阅读:
    设计模式——装饰模式(Decorator Pattern)
    设计模式——策略模式(Strategy Pattern)
    设计模式——简单工厂模式(SimpleFactory Pattern)
    入博客园三周年记
    android+Service
    surfaceView+canvas+paint+bitmap
    Enable Sublime text 2 to support GBK in Mac
    androidstudio+opencv
    mac下的环境变量PATH
    Curl命令
  • 原文地址:https://www.cnblogs.com/Tobyuyu/p/4965473.html
Copyright © 2011-2022 走看看