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

<p></p> <p><b>New page</b></p><div>== 소감 ==<br /> {| class=&quot;wikitable&quot;<br /> |-<br /> | 2006-01-08 Accepted 0.012 Minimum<br /> |}<br /> A, B 라는 입력이 들어왔을 때, n = B - A 로 본다면, n = 1 ~ 20 {1,2,3,3,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,8}. 간단한 일차 방정식 작성으로 풀 수 있다. <br /> == 코드 ==<br /> // 846 - Steps<br /> #include &amp;lt;iostream&amp;gt;<br /> using namespace std;<br /> #include &amp;lt;cmath&amp;gt;<br /> <br /> inline void process(int n)<br /> {<br /> int i = floor(sqrt(n));<br /> for (; i * (i + 1) &amp;lt;= n; i++) ;<br /> if (n == i * (i - 1)) <br /> cout &amp;lt;&amp;lt; 2 * (i - 1) &amp;lt;&amp;lt; endl;<br /> else if (n &amp;lt;= i * i) <br /> cout &amp;lt;&amp;lt; 2 * i - 1 &amp;lt;&amp;lt; endl;<br /> else <br /> cout &amp;lt;&amp;lt; 2 * i &amp;lt;&amp;lt; endl; <br /> }<br /> <br /> int main()<br /> {<br /> int nCase, x, y;<br /> cin &amp;gt;&amp;gt; nCase;<br /> for (int i = 0; i &amp;lt; nCase; i++)<br /> {<br /> cin &amp;gt;&amp;gt; x &amp;gt;&amp;gt; y;<br /> process(y - x);<br /> }<br /> return 0;<br /> }<br /> ----<br /> [[Steps]]</div>

imported>Unknown