AC

没人用do-while，哈哈哈

直接上代码！ #include<bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n>>m; int sum=1; if(n>m){ int a=n; n=m; m=a; } for(int i=2; i<=n; i++) { if(n%i0&&m%i0){ sum=i; } } cout<<sum; return 0; }

#include<iostream> using namespace std; void gcd(int m,int n){ /* while (n!=0){ int s = n; n = m%n; m = s; } */ if (n!=0) gcd(n,m%n); else cout << m << endl; } int main(){ int m,n; cin >> m >> n; gcd(m,n); return 0; }

#include<cstdio> int gcd(int a,int b){ return b>0?gcd(b,a%b):a; } int main(){ int n,m; scanf("%d %d",&n,&m); printf("%d",gcd(n,m)); }

#include<iostream> using namespace std; void gcd(int m,int n){ while (n!=0){ int s = n; n = m%n; m = s; } cout << m << endl; } int main(){ int m,n; cin >> m >> n; gcd(m,n); return 0; }

#include<iostream> using namespace std; int main(){ int n,m; cin >> n >> m; for(int i = n;i >= 1;i--){ if(n%i0 && m%i0){ cout << i; return 0; } } return 0; } 题解如下 请各位给老师一个关注（求求了）

就没人用杠杠gcd吗?

#include<bits/stdc++.h> using namespace std; int main(){ int n,m; cin>>n>>m; if(n<m){ for(int i=n-1;i>=1;i--){ if(n%i0 and m%i0){ cout<<i; break; } } }else{ for(int i=m-1;i>=1;i--){ if(n%i0 and m%i0){ cout<<i; break; } } } }

#include<bits/stdc++.h> using namespace std; int main(){ int n , m; cin >> n >> m; int h = min(n,m); for(int i = h;i >= 1;i--){ if(n % i == 0 && m % i == 0){ cout << i; return 0; } } return 0; }