AcWing 872. 最大公约数,奶酪宝宝来啦!
原题链接
简单
作者:
奶酪宝宝
,
2025-03-26 19:51:56
·山东
,
所有人可见
,
阅读 1
#include <iostream>
using namespace std;
int gcd(int leftNumber, int rightNumber){
return rightNumber ? gcd(rightNumber, leftNumber % rightNumber) : leftNumber;
}
int queryCounter;
void declaration(){
scanf("%d", &queryCounter);
}
int leftNumber, rightNumber;
void inputACase(){
scanf("%d%d", &leftNumber, &rightNumber);
}
void outputAResult(){
printf("%d\n", gcd(leftNumber, rightNumber));
}
void queries(){
while(queryCounter --){
inputACase();
outputAResult();
}
}
int main(){
declaration();
queries();
return 0;
}