最大公约数 Posted on 2020-11-25 Edited on 2021-04-14 In 算法笔记 Views: 题目描述:输入两个正整数,求其最大公约数。 输入格式:测试数据有多组,每组输入两个正整数。 输出格式:对于每组输入,请输出其最大公约数。 输入样例:49 14 输出样例:7 train of thought: code: 123456789101112131415#include <cstdio>int gcd(int x, int y){ if (y == 0) return x; else return gcd(y, x % y);}int main(){ int a, b; scanf("%d%d", &a, &b); printf("%d", gcd(a, b)); return 0;} Post author: SRP05 Post link: https://srp05.github.io/2020/11/25/最大公约数/ Copyright Notice: All articles in this blog are licensed under BY-NC-SA unless stating additionally.