SP27561 GDCOFTI - Greatest Common Divisor Of Three Integers

    • 743通过
    • 1K提交
  • 题目来源 SPOJ 27561
  • 评测方式 RemoteJudge
  • 标签 最大公约数,gcd 枚举,暴力
  • 难度 入门难度
  • 时空限制 1000ms / 1536MB

题解

  • 提示:收藏到任务计划后,可在首页查看。
  • 体验新版界面

    最新讨论 显示

    推荐的相关题目 显示

    题意翻译

    求三个数的最大公约数 Translated by @Dr.九命猫

    题目描述

    It is said that the greatest common divisor (GCD) of two or more whole integers, is the largest integer that divides them without leaving residue. Euclid's algorithm is famous for allowing to find the GCD between two integers. This challenge asks you, you find the GCD between three integers.

    Challenge

    The entry consists of 3 whole nonnegative integers (< 2 $ ^{64} $ ), one per line and the output will be the GCD of the 3 integers.

    Example of input

    
    426
    132
    120

    Example of output for this input

    6Example of input:

    
    100
    60
    120

    Example of output for this input

    20Example of input:

    4
    8
    12

    Example of output for this input

    4

    输入输出格式

    输入格式:

    输出格式:

    输入输出样例

    暂无测试点
    提示
    标程仅供做题后或实在无思路时参考。
    请自觉、自律地使用该功能并请对自己的学习负责。
    如果发现恶意抄袭标程,将按照I类违反进行处理。