// gcd.cpp
//求两个整数的最大公分母.
//思考：两个整数的最小公倍数应该怎么求？
#include
using std::cout;
using std::cin;
using std::endl;
/* write prototype for gcd */
int main()
{
int a;
int b;
// allow the five sets of numbers to be input
for ( int j = 1; j cout cin >> a >> b;
cout
} // end for
system("PAUSE");
return 0;
} // end main
// function gcd definition
/* write header for gcd */
{
int greatest = 1;
for ( int i = 2; i
if ( /* write condition to determine if both x and y are
divisible by i */ )
greatest = i;
/* write a statement to return greatest */
} // end function gcd
