題目：輸入兩個正整數m和n，求其最大公約數和最小公倍數。
1.程序分析：利用輾除法。
2.程序源代碼：
#include<stdio.h> void main() { int a,b,num1,num2,temp; printf("please input two numbers:\n"); scanf("%d,%d",&num1,&num2); if(num1<num2) { temp=num1; num1=num2; num2=temp; } a=num1;b=num2; while(b!=0)/*利用輾除法，直到b為0為止*/ { temp=a%b; a=b; b=temp; } printf("gongyueshu:%d\n",a); printf("gongbeishu:%d\n",num1*num2/a); }
更多精彩资讯请关注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 
