https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=EcologicalBinPacking%2F%EA%B3%BD%EC%84%B8%ED%99%98 2026-05-15T10:16:05Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=EcologicalBinPacking/%EA%B3%BD%EC%84%B8%ED%99%98&diff=84328&oldid=prev 2026-03-27T00:16:02Z

<p>Repair batch-0002 pages from live compare</p> <a href="https://mediawiki.zeropage.org/index.php?title=EcologicalBinPacking/%EA%B3%BD%EC%84%B8%ED%99%98&amp;diff=84328&amp;oldid=31447">Show changes</a>

Maintenance script https://mediawiki.zeropage.org/index.php?title=EcologicalBinPacking/%EA%B3%BD%EC%84%B8%ED%99%98&diff=31447&oldid=prev 2021-02-07T05:23:10Z

<p></p> <p><b>New page</b></p><div>== 소감 ==<br /> <br /> == 소스 ==<br /> #include &amp;lt;iostream&amp;gt;<br /> using namespace std;<br /> <br /> #define BROWN 0<br /> #define GREEN 1<br /> #define CLEAR 2<br /> <br /> int main()<br /> {<br /> while (true)<br /> {<br /> int bottle[3][3]; // 병<br /> int bin[3]; // 통<br /> int min_move = 0; // 최소 이동수 = 전체 병 수 - 이동하지 않는 병 수<br /> int total_bottle = 0;<br /> int not_move_bottle = 0;<br /> int i, j;<br /> <br /> for (i = 0; i &amp;lt; 3; i++)<br /> for (j = 0; j &amp;lt; 3; j++)<br /> {<br /> if (!(cin &amp;gt;&amp;gt; bottle[i][j]))<br /> return 0;<br /> total_bottle += bottle[i][j];<br /> }<br /> <br /> bin[0] = BROWN;<br /> bin[1] = CLEAR;<br /> bin[2] = GREEN;<br /> not_move_bottle = bottle[0][BROWN] + bottle[1][CLEAR] + bottle[2][GREEN];<br /> <br /> if ((bottle[0][BROWN] + bottle[1][GREEN] + bottle[2][CLEAR]) &amp;gt; not_move_bottle)<br /> {<br /> bin[0] = BROWN;<br /> bin[1] = GREEN;<br /> bin[2] = CLEAR;<br /> not_move_bottle = bottle[0][BROWN] + bottle[1][GREEN] + bottle[2][CLEAR];<br /> }<br /> if ((bottle[0][CLEAR] + bottle[1][BROWN] + bottle[2][GREEN]) &amp;gt; not_move_bottle)<br /> {<br /> bin[0] = CLEAR;<br /> bin[1] = BROWN;<br /> bin[2] = GREEN;<br /> not_move_bottle = bottle[0][CLEAR] + bottle[1][BROWN] + bottle[2][GREEN];<br /> }<br /> if ((bottle[0][CLEAR] + bottle[1][GREEN] + bottle[2][BROWN]) &amp;gt; not_move_bottle)<br /> {<br /> bin[0] = CLEAR;<br /> bin[1] = GREEN;<br /> bin[2] = BROWN;<br /> not_move_bottle = bottle[0][CLEAR] + bottle[1][GREEN] + bottle[2][BROWN];<br /> }<br /> if ((bottle[0][GREEN] + bottle[1][BROWN] + bottle[2][CLEAR]) &amp;gt; not_move_bottle)<br /> {<br /> bin[0] = GREEN;<br /> bin[1] = BROWN;<br /> bin[2] = CLEAR;<br /> not_move_bottle = bottle[0][GREEN] + bottle[1][BROWN] + bottle[2][CLEAR];<br /> }<br /> if ((bottle[0][GREEN] + bottle[1][CLEAR] + bottle[2][BROWN]) &amp;gt; not_move_bottle)<br /> {<br /> bin[0] = GREEN;<br /> bin[1] = CLEAR;<br /> bin[2] = BROWN;<br /> not_move_bottle = bottle[0][GREEN] + bottle[1][CLEAR] + bottle[2][BROWN];<br /> }<br /> <br /> min_move = total_bottle - not_move_bottle; <br /> <br /> for (i = 0; i &amp;lt; 3; i++)<br /> {<br /> if (bin[i] == BROWN)<br /> cout &amp;lt;&amp;lt; &quot;B&quot;;<br /> else if (bin[i] == CLEAR)<br /> cout &amp;lt;&amp;lt; &quot;C&quot;;<br /> else<br /> cout &amp;lt;&amp;lt; &quot;G&quot;;<br /> }<br /> cout &amp;lt;&amp;lt; &quot; &quot; &amp;lt;&amp;lt; min_move &amp;lt;&amp;lt; endl;<br /> }<br /> }<br /> == 댓글 ==<br /> <br /> ----<br /> [[EcologicalBinPacking]]<br /> </div>

imported>Unknown