方法一:欧基里德算法:
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int, int);
int main(int agrc, char*agvc[])
{
int m, n;
ifstream cin("a.txt");
while (cin >>m >>n)
{
cout << gcd(m, n) << endl;
}
system("pause");
return 0;
}
int gcd(int a, int b)
{
while (a != b)
{
if (a > b) a -= b;
else b -= a;
}
return a;
}
方法二更快:化归思想