EcologicalBinPacking/문보창: Difference between revisions

Latest revision as of 00:16, 27 March 2026

소감

2005/02/18 Accepted 0:00.293 436 모든 경우의 수를 일일이 세지 않고 풀수 있는 방법은 없을까?

코드

// no 102 - Ecological Bin Packing
#include <iostream> 
using namespace std; 

void main() 
{ 
	int bottle[9];                 // 입력되는 병 
	 int nMove[6];                  // 이동 수 
	 int i; 
	char * bin[6] = {"BCG", "BGC", "CBG", "CGB", "GBC", "GCB"}; 
	int min; 
	int index; 
	bool isRight; 
	while (true) 
	{        
		isRight = true;
		for (i=0; i<9; i++) 
		{ 
			if (!(cin >> bottle[i])) 
			{ 
				isRight = false; 
				break; 
			}                        
		} 
		if (!isRight) 
			break; 
		
		nMove[1] = bottle[3]+bottle[6]+bottle[1]+bottle[7]+bottle[2]+bottle[5]; 
		nMove[0] = bottle[3]+bottle[6]+bottle[2]+bottle[8]+bottle[1]+bottle[4]; 
		nMove[4] = bottle[4]+bottle[7]+bottle[0]+bottle[6]+bottle[2]+bottle[5]; 
		nMove[5] = bottle[4]+bottle[7]+bottle[2]+bottle[8]+bottle[0]+bottle[3]; 
		nMove[2] = bottle[5]+bottle[8]+bottle[0]+bottle[6]+bottle[1]+bottle[4]; 
		nMove[3] = bottle[5]+bottle[8]+bottle[1]+bottle[7]+bottle[0]+bottle[3]; 
		
		min = nMove[0]; 
		index = 0; 
		for (i=1; i<6; i++) 
		{ 
			if (min > nMove[i]) 
			{ 
				min = nMove[i]; 
				index = i; 
			} 
		} 
		cout << bin[index] << " " << nMove[index] << endl; 
	} 
}

EcologicalBinPacking 문보창

@@ Line 10: / Line 10: @@
   void main()
   {
-  	int bottle[9];                 // 입력되는 병
+  	int bottle&#91;9&#93;;                 // 입력되는 병
-  	 int nMove[6];                  // 이동 수
+  	 int nMove&#91;6&#93;;                  // 이동 수
   	 int i;
-  	char * bin[6] = {"BCG", "BGC", "CBG", "CGB", "GBC", "GCB"};
+  	char * bin&#91;6&#93; = {"BCG", "BGC", "CBG", "CGB", "GBC", "GCB"};
   	int min;
   	int index;
@@ Line 22: / Line 22: @@
   		for (i=0; i&lt;9; i++)
   		{
-  			if (!(cin &gt;&gt; bottle[i]))
+  			if (!(cin &gt;&gt; bottle&#91;i&#93;))
   			{
   				isRight = false;
@@ Line 31: / Line 31: @@
   			break;
-  		nMove[1] = bottle[3]+bottle[6]+bottle[1]+bottle[7]+bottle[2]+bottle[5];
+  		nMove&#91;1&#93; = bottle&#91;3&#93;+bottle&#91;6&#93;+bottle&#91;1&#93;+bottle&#91;7&#93;+bottle&#91;2&#93;+bottle&#91;5&#93;;
-  		nMove[0] = bottle[3]+bottle[6]+bottle[2]+bottle[8]+bottle[1]+bottle[4];
+  		nMove&#91;0&#93; = bottle&#91;3&#93;+bottle&#91;6&#93;+bottle&#91;2&#93;+bottle&#91;8&#93;+bottle&#91;1&#93;+bottle&#91;4&#93;;
-  		nMove[4] = bottle[4]+bottle[7]+bottle[0]+bottle[6]+bottle[2]+bottle[5];
+  		nMove&#91;4&#93; = bottle&#91;4&#93;+bottle&#91;7&#93;+bottle&#91;0&#93;+bottle&#91;6&#93;+bottle&#91;2&#93;+bottle&#91;5&#93;;
-  		nMove[5] = bottle[4]+bottle[7]+bottle[2]+bottle[8]+bottle[0]+bottle[3];
+  		nMove&#91;5&#93; = bottle&#91;4&#93;+bottle&#91;7&#93;+bottle&#91;2&#93;+bottle&#91;8&#93;+bottle&#91;0&#93;+bottle&#91;3&#93;;
-  		nMove[2] = bottle[5]+bottle[8]+bottle[0]+bottle[6]+bottle[1]+bottle[4];
+  		nMove&#91;2&#93; = bottle&#91;5&#93;+bottle&#91;8&#93;+bottle&#91;0&#93;+bottle&#91;6&#93;+bottle&#91;1&#93;+bottle&#91;4&#93;;
-  		nMove[3] = bottle[5]+bottle[8]+bottle[1]+bottle[7]+bottle[0]+bottle[3];
+  		nMove&#91;3&#93; = bottle&#91;5&#93;+bottle&#91;8&#93;+bottle&#91;1&#93;+bottle&#91;7&#93;+bottle&#91;0&#93;+bottle&#91;3&#93;;
-  		min = nMove[0];
+  		min = nMove&#91;0&#93;;
   		index = 0;
   		for (i=1; i&lt;6; i++)
   		{
-  			if (min &gt; nMove[i])
+  			if (min &gt; nMove&#91;i&#93;)
   			{
-  				min = nMove[i];
+  				min = nMove&#91;i&#93;;
   				index = i;
   			}
   		}
-  		cout &lt;&lt; bin[index] &lt;&lt; " " &lt;&lt; nMove[index] &lt;&lt; endl;
+  		cout &lt;&lt; bin&#91;index&#93; &lt;&lt; " " &lt;&lt; nMove&#91;index&#93; &lt;&lt; endl;
   	}
   }
 ----
-[[EcologicalBinPacking]] [[문보창]]
+EcologicalBinPacking [[문보창]]