欧几里得算法求最大公因数

#include<iostream>using namespace std;unsigned int Gcd(unsigned int x, unsigned int y){unsigned int temp;while (y > 0){temp = x%y;x = y;y = temp;}return x;}int main(){unsigned int x, y;cin >> x >> y;cout<<Gcd(x, y)<<endl;return 0;}