https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=FactorialFactors%2F%EB%AC%B8%EB%B3%B4%EC%B0%BD 2026-05-15T01:40:24Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=FactorialFactors/%EB%AC%B8%EB%B3%B4%EC%B0%BD&diff=31753&oldid=prev 2021-02-07T05:23:15Z

<p></p> <p><b>New page</b></p><div>== 소감 ==<br /> {| class=&quot;wikitable&quot;<br /> |-<br /> | 2006-01-19 Accepted 1.434 4344<br /> |}<br /> 현태한테 설명 듣고 완성.<br /> == 코드 ==<br /> // 884 - Factorial Factors<br /> #include &amp;lt;iostream&amp;gt;<br /> using namespace std;<br /> <br /> #define MAXN 1000000<br /> <br /> static int fact[MAXN+1];<br /> <br /> void findFact()<br /> {<br /> int i, j;<br /> for (i = 2; i &amp;lt;= MAXN; i++)<br /> {<br /> if (fact[i] == 0) // 소수<br /> {<br /> fact[i] = 1;<br /> for (j = i + i; j &amp;lt;= MAXN; j+=i)<br /> fact[j] = i;<br /> }<br /> else // 합성수<br /> fact[i] = fact[i/fact[i]] + fact[fact[i]];<br /> }<br /> for (i = 2; i &amp;lt; MAXN; i++)<br /> fact[i+1] += fact[i];<br /> }<br /> <br /> int main()<br /> {<br /> int n;<br /> findFact();<br /> while (cin &amp;gt;&amp;gt; n)<br /> cout &amp;lt;&amp;lt; fact[n] &amp;lt;&amp;lt; endl;<br /> return 0;<br /> }<br /> ----<br /> [[FactorialFactors]] [[AOI]]<br /> </div>

imported>Unknown