ÇÔ¼ö·Î ÃÖ¼Ò°ø¹è¼ö ¸®ÅÏÇϱâ [1881 / 0759] Time Limit(Test case) : (ms) Number of users who solved : 0 Total Tried : 0 The Champion of this Problem (C++) : N/A My Best Submission (C++) : N/A [koistudy.net (T. HS Jeon 2017)] Background *ÁÖÀÇ»çÇ× : ÀÌ (ÇÔ¼ö Á¦ÃâÇü) ¹®Á¦´Â ÇÔ¼ö ºÎºÐ¸¸ ÀÛ¼ºÇؼ­ Á¦ÃâÇØ¾ß ¿À·ù ¾øÀÌ Ã¤Á¡ÀÌ µË´Ï´Ù. ¹Ì¸® ÀÛ¼ºµÇ¾îÀÖ´Â Äڵ带 Àаí ÇØ¼®Çؼ­, ÇÔ¼ö ºÎºÐ¸¸ ÀÛ¼ºÇؼ­ Á¦ÃâÇÏ¸é µË´Ï´Ù. ÀÛ¼ºÇÑ ÇÔ¼öÀÇ Å×½ºÆ®¸¦ À§Çؼ­´Â Á¦½ÃµÈ Äڵ带 º¹»çÇØ »ç¿ëÇÏ¸é µÇ°í, Á¦ÃâÀº ÇÔ¼ö ºÎºÐ¸¸ Çϼ¼¿ä. ------ int Çü ÀÚ¿¬¼ö µÎ °³¸¦ ÀÔ·Â¹Þ¾Æ ÃÖ¼Ò°ø¹è¼ö(LCD, Least Common Multiple)¸¦ Ãâ·ÂÇϽÿÀ. ´Ü, ÇÔ¼öÇü ¹®Á¦À̹ǷΠÇÔ¼ö lcd()¸¸ ÀÛ¼ºÇÏ¿© Á¦ÃâÇϽÿÀ. Âü°í ÃÖ¼Ò°ø¹è¼ö´Â µÎ ¼öÀÇ °øÅë ¹è¼öµé Áß¿¡¼­ °¡Àå ÀÛÀº °øÅë ¹è¼ö¸¦ ÀǹÌÇÑ´Ù. ¿¹¸¦ µé¾î 72¿Í 192ÀÇ ÃÖ¼Ò °ø¹è¼ö´Â 576ÀÌ´Ù. [ÇÔ¼öÇü ¹®Á¦¶õ??] ÇÔ¼öÇü ¹®Á¦´Â ±âº»ÀûÀÎ main() µîÀº ¹Ì¸® ÀÛ¼ºµÇ¾î ÀÖ½À´Ï´Ù. ¹Ì¸® ÀÛ¼ºµÇ¾î ÀÖ´Â ÇÁ·Î±×·¥Àº ´ÙÀ½°ú °°½À´Ï´Ù. ¹Ì¸® ÀÛ¼ºµÈ ÇÁ·Î±×·¥À» º¹»çÇØ ºÙ¿© ³ÖÀº ÈÄ ÇÔ¼ö ºÎºÐÀ» ¼³°èÇÏ¿© ÀÛ¼ºÇØ ³Ö°í, Å×½ºÆ® ÇÑ ÈÄ, ÇÔ¼ö ºÎºÐ¸¸ Á¦ÃâÇϼ¼¿ä. [¹Ì¸® ÀÛ¼ºµÇ¾îÀÖ´Â ÇÁ·Î±×·¥] #include int a, b; int gcd(int p, int q){ if(p==0) return q; return gcd(q%p, p);} long long int lcd(int, int); int main() { scanf("%d%d", &a, &b); printf("%lld\n", lcd(a, b)); } Input µÎ °³ÀÇ ÀÚ¿¬¼ö(a, b)°¡ °ø¹éÀ» µÎ°í ÀԷµȴÙ. (1 <= a,b <= 2147483647) Output µÎ ¼öÀÇ ÃÖ¼Ò°ø¹è¼ö¸¦ Ãâ·ÂÇÑ´Ù. IO Example ÀÔ·Â 192 72 Ãâ·Â 576