Run ID:96691

提交时间:2024-11-09 11:53:08

#include<bits/stdc++.h> using namespace std; int main(){ int a,b,yushu; cin>>a>>b; //辗转相处法-求最大公约数 yushu = a%b; while(yushu != 0){ a = b; b = yushu; } cout<<b; return 0; }