Re: [問題] 求gcd和lcm
For GCD:
int x,y,z,max,gcd;
cin>>x;
cin>>y;
cin>>z;
if(x-y>=0 && x-z>=0)
max=x;
else if (y-x>=0 && y-z>=0)
max=y;
else if (z-x>=0 && z-y>=0)
max=z;
for(int i=0;i<max;i++)
{
if ( (x%i==0) && (y%i==0) && (z%i==0))
gcd=i;
}
return gcd;
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 24.16.140.163
→
11/08 13:00, , 1F
11/08 13:00, 1F
推
11/08 22:09, , 2F
11/08 22:09, 2F
→
11/08 22:52, , 3F
11/08 22:52, 3F
→
11/08 22:54, , 4F
11/08 22:54, 4F
推
11/09 11:24, , 5F
11/09 11:24, 5F
※ chikao:轉錄至看板 NTUCH-101HW 11/11 13:23
討論串 (同標題文章)