#include<stdio.h>
int gcd(int da,int xiao)
{
int t=1;
while(t!=0)
{
t=da%xiao;
if(t)
{
da=xiao;
xiao=t;
}
}
return xiao;
}
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)!=EOF)
{
int da=a>b? a:b;int xiao=a<b? a:b;
printf("%d\n",(da*xiao)/gcd(da,xiao));
}
Total Submission(s): 34173 Accepted Submission(s): 19113
int gcd(int da,int xiao)
{
int t=1;
while(t!=0)
{
t=da%xiao;
if(t)
{
da=xiao;
xiao=t;
}
}
return xiao;
}
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)!=EOF)
{
int da=a>b? a:b;int xiao=a<b? a:b;
printf("%d\n",(da*xiao)/gcd(da,xiao));
}
}
最小公倍数
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34173 Accepted Submission(s): 19113
Problem Description
给定两个正整数,计算这两个数的最小公倍数。
Input
输入包含多组测试数据,每组只有一行,包括两个不大于1000的正整数.
Output
对于每个测试用例,给出这两个数的最小公倍数,每个实例输出一行。
Sample Input
10 14
Sample Output
70
Source