https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=%EB%AA%AC%ED%85%8C%EC%B9%B4%EB%A5%BC%EB%A1%9C%EB%B2%95%2Fpi%EA%B5%AC%ED%95%98%EA%B8%B0 2026-05-15T10:29:40Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=%EB%AA%AC%ED%85%8C%EC%B9%B4%EB%A5%BC%EB%A1%9C%EB%B2%95/pi%EA%B5%AC%ED%95%98%EA%B8%B0&diff=50463&oldid=prev 2013-11-16T11:14:05Z

<p></p> <p><b>New page</b></p><div>== 몬테카를로 법을 이용하여 pi 구하기 ==<br /> #include &amp;lt;stdio.h&amp;gt;<br /> #include &amp;lt;stdlib.h&amp;gt;<br /> #include &amp;lt;time.h&amp;gt;<br /> #include &amp;lt;limits.h&amp;gt;<br /> <br /> #define TestCase_Num 1000000<br /> <br /> int main()<br /> {<br /> double x, y, pi;<br /> int i, inner, Sum_Of_Inner=0; <br /> <br /> srand(time(NULL)); <br /> <br /> for(i=1; i&amp;lt;=TestCase_Num; i++){<br /> x=1.0*rand()/RAND_MAX;<br /> y=1.0*rand()/RAND_MAX;<br /> <br /> if(x*x+y*y&amp;lt;=1)<br /> inner=1;<br /> else<br /> inner=0;<br /> Sum_Of_Inner=Sum_Of_Inner+inner;<br /> }<br /> <br /> pi=1.0*Sum_Of_Inner/TestCase_Num*4; <br /> printf(&quot;pi = %f\n&quot;, pi);<br /> return(0);<br /> }<br /> </div>

imported>qa22ahj