自拟函數，獲取兩數的最小公倍數和最小公約數。
#include <stdio.h>
#include <stdlib.h>
int GetGreatestCommonDivison(int a,int b)
{
int i;
for(i=a;i>=0;i--)
{
if(a%i==0&&b%i==0)
{
return i;
break;
}
}
}
int GetLowestCommonMultiple(int a,int b)
{
int i;
for(i=a;i<a*b 1;i )
{
if(i%a==0&&i%b==0)
{
return i;
break;
}
}
}
int main()
{
int a,b;
int max,min;
scanf("%d %d",&a,&b);
max=GetGreatestCommonDivison(a,b);
min=GetLowestCommonMultiple(a,b);
printf("GreatestCommonDivison=%d\n",max);
printf("LowestCommonMultiple=%d\n",min);
return 0;
}
C語言每日一練26——金子裝載最優值
C語言每日一練25——求最大連續遞增數字串
,更多精彩资讯请关注tft每日頭條，我们将持续为您更新最新资讯!
zpostcode 
Recruit 
weather 
mreligion 
Yellowpages 
sport 
constellation 
shopping 
name 
game 
directory 
literature 
Word 
tour 
furnish 
Lottery 
tftnews 
lyrics 
News 
digital 
car 
dir 
Edu 
Finance 
