https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=3N%2B1Problem%2F%EC%8B%A0%EC%9E%AC%EB%8F%99 2026-05-15T03:07:37Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=3N%2B1Problem/%EC%8B%A0%EC%9E%AC%EB%8F%99&diff=26789&oldid=prev 2021-02-07T05:22:16Z

<p></p> <p><b>New page</b></p><div>=== 3N+1Problem/신재동 ===<br /> #include &amp;lt;iostream&amp;gt;<br /> using namespace std;<br /> <br /> int getCount(int aNumber)<br /> {<br /> int count = 0;<br /> while(true)<br /> {<br /> count++;<br /> if(aNumber == 1)<br /> break;<br /> else<br /> {<br /> if(aNumber % 2 == 1)<br /> aNumber = 3 * aNumber + 1;<br /> else<br /> aNumber = aNumber / 2;<br /> }<br /> }<br /> return count;<br /> }<br /> <br /> int getMaxCount(int aStart, int aFinish)<br /> {<br /> int maxCount = 0;<br /> for(int i =aStart; i &amp;lt; aFinish; i++)<br /> {<br /> int count = getCount(i);<br /> <br /> if(maxCount &amp;lt; count)<br /> maxCount = count;<br /> }<br /> return maxCount;<br /> }<br /> <br /> int main()<br /> {<br /> int start, finish;<br /> cin &amp;gt;&amp;gt; start &amp;gt;&amp;gt; finish;<br /> <br /> int maxCount = getMaxCount(start, finish);<br /> <br /> cout &amp;lt;&amp;lt; maxCount &amp;lt;&amp;lt; endl;<br /> return 0;<br /> }<br /> ----<br /> 심심해서... 오랫만에 C++하니까 어리버리하다. --재동<br /> 시간초과. 다시 푸세요.ㅋㅋ --[[Leonardong]]<br /> ----<br /> [[AOI]][[3N+1Problem]]<br /> </div>

imported>Unknown