https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=UglyNumbers%2F%EB%AC%B8%EB%B3%B4%EC%B0%BD 2026-05-14T17:09:06Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=UglyNumbers/%EB%AC%B8%EB%B3%B4%EC%B0%BD&diff=39930&oldid=prev 2021-02-07T05:28:20Z

<p></p> <p><b>New page</b></p><div>==== 소감 ====<br /> 2005/02/18 Accepted 0:00.006 64<br /> 접근 방법을 바꾼후 쉽게 풀린 문제. 지수의 조합을 이용.<br /> ==== Ugly Number ====<br /> // no136 - Ugly Numbers(a)<br /> #include &amp;lt;iostream&amp;gt; <br /> #include &amp;lt;cstdlib&amp;gt;<br /> #include &amp;lt;cmath&amp;gt;<br /> using namespace std; <br /> <br /> const int MAX = 2000;<br /> inline int comp(const void *i,const void *j) { return *(int *)i-*(int *)j; };<br /> <br /> int main() <br /> { <br /> int num[MAX];<br /> int count = 0;<br /> int expo2, expo3, expo5;<br /> int MAX_INT = pow(2,31) - 1;<br /> <br /> for (expo5=0; expo5&amp;lt;13; expo5++)<br /> {<br /> for (expo3=0; expo3&amp;lt;19; expo3++)<br /> {<br /> for (expo2=0; expo2&amp;lt;30; expo2++)<br /> {<br /> if (expo5 + expo3 + expo2 &amp;gt; 29)<br /> break;<br /> if (pow(2,expo2) * pow(3,expo3) * pow(5,expo5) &amp;gt; MAX_INT<br /> || pow(2,expo2) * pow(3,expo3) * pow(5,expo5) &amp;lt; 0)<br /> break;<br /> num[count++] = pow(2,expo2) * pow(3,expo3) * pow(5,expo5);<br /> }<br /> }<br /> }<br /> qsort(num, count, sizeof(int), comp);<br /> cout &amp;lt;&amp;lt; &quot;The 1500&#039;th ugly number is &quot; &amp;lt;&amp;lt; num[1499] &amp;lt;&amp;lt; &quot;.\n&quot;;<br /> return 0; <br /> } <br /> ----<br /> [[UglyNumbers]] [[문보창]]<br /> </div>

imported>Unknown