https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=AnEasyProblem%2F%EA%B0%95%EC%84%B1%ED%98%84
AnEasyProblem/강성현 - Revision history
2026-05-15T12:42:36Z
Revision history for this page on the wiki
MediaWiki 1.39.8
https://mediawiki.zeropage.org/index.php?title=AnEasyProblem/%EA%B0%95%EC%84%B1%ED%98%84&diff=27972&oldid=prev
imported>공간도형 at 07:25, 26 June 2011
2011-06-26T07:25:48Z
<p></p>
<p><b>New page</b></p><div>== Status ==<br />
{| class="wikitable"<br />
|-<br />
| Problem<br />
| 2453<br />
| User<br />
| anoymity<br />
|-<br />
| Memory<br />
| 736K<br />
| Time<br />
| 16MS<br />
|-<br />
| Language<br />
| G++<br />
| Result<br />
| Accepted<br />
|}<br />
== Idea ==<br />
** 1의 갯수를 구한뒤에 i를 하나씩 늘려가면서 1의 갯구를 비교<br />
<br />
== Source Code ==<br />
#include &lt;iostream&gt;<br />
using namespace std;<br />
<br />
int main(void) {<br />
<br />
while (1) {<br />
int i, c = 0;<br />
cin &gt;&gt; i;<br />
if (i == 0) break;<br />
<br />
int temp = i;<br />
while (temp&gt;0) { c+=temp%2; temp&gt;&gt;=1;}<br />
<br />
while (1) {<br />
int temp = ++i, cc = 0;<br />
while (temp&gt;0) { cc+=temp%2; temp&gt;&gt;=1;}<br />
if (cc == c) break;<br />
}<br />
<br />
cout &lt;&lt; i &lt;&lt; endl;<br />
}<br />
return 0;<br />
}<br />
== Trial and error ==<br />
** 처음엔 배열로 하려고 했다가 복잡한거같아서 걍 포기. 그냥 편하게 한것 같네요. 바로 accept 돼서 좀 놀람<br />
----<br />
[[ACM_ICPC/2011년스터디]]<br />
</div>
imported>공간도형