递归gcd()

#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;
}