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

<p></p> <p><b>New page</b></p><div>==== 소감 ====<br /> 2005/02/19 Accepted 0:00.025 64 <br /> 입력받는 수가 12까지가 아니라면, 더 최적화된 알고리즘을 찾아야 한다.<br /> ==== 코드 ====<br /> // no10105 - Polynomial Coefficients<br /> #include &amp;lt;iostream&amp;gt;<br /> using namespace std;<br /> <br /> void main()<br /> {<br /> int n, k, i, j, temp1, temp2, coeffi;<br /> while (cin &amp;gt;&amp;gt; n &amp;gt;&amp;gt; k)<br /> {<br /> temp1 = temp2 = 1;<br /> for (i=0; i&amp;lt;k; i++)<br /> {<br /> cin &amp;gt;&amp;gt; coeffi;<br /> if (coeffi)<br /> {<br /> for (j=1; j&amp;lt;=coeffi; j++)<br /> temp2 *= j;<br /> }<br /> }<br /> for (i=1; i&amp;lt;=n; i++)<br /> temp1 *= i;<br /> cout &amp;lt;&amp;lt; temp1/temp2 &amp;lt;&amp;lt; endl;<br /> }<br /> }<br /> ----<br /> [[PolynomialCoefficients]] [[문보창]]<br /> </div>

imported>Unknown