輾轉相除法求最大公約數（c++）

#include <iostream>
using namespace std;

int main()
{
    int m, n, r;
    cin >> m >> n;
    r = m % n;
    while( r )
    {
        m = n;
        n = r;
        r = m % n;
    }
    cout << n << endl;
    return 0;
}