# include<iostream> using namespace std; //gcd->greatest common divisor最大公约数 int main(){ int a,b,gcd; cin>>a>>b; gcd=min(a,b);//求a,b中的小值,大值的函数max while(gcd>=1){ if(a%gcd==0&&b%gcd==0) break; gcd--; } cout<<gcd<<endl; return 0; }