http://acm.hdu.edu.cn/showproblem.php?pid=1108
这个是作为GCD的入门水题。。。。。
| Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
| 4283930 | 2011-07-29 09:49:36 | Accepted | 1108 | 0MS | 340K | 518 B | G++ | GongZi |
//HDOJ 1108 Code By NetBeans 6.9.1
#include <iostream>
using namespace std;
int gcd( int x, int y );
int main( )
{
int x, y;
while( cin >> x >> y )
{
if( x < y )
{
x ^= y;
y ^= x;
x ^= y;
}
cout << x * y / gcd( x, y ) << endl;
}
return 0;
}
int gcd( int x, int y )
{
return( y == 0 ? x : gcd( y, x % y ) );
}
#if gongzi
#endif