<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0%2F%EC%9D%B4%EA%B7%9C%EC%99%84%EC%98%A4%EC%8A%B9%ED%98%81</id>
	<title>미로찾기/이규완오승혁 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0%2F%EC%9D%B4%EA%B7%9C%EC%99%84%EC%98%A4%EC%8A%B9%ED%98%81"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0/%EC%9D%B4%EA%B7%9C%EC%99%84%EC%98%A4%EC%8A%B9%ED%98%81&amp;action=history"/>
	<updated>2026-05-15T11:39:50Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.8</generator>
	<entry>
		<id>https://mediawiki.zeropage.org/index.php?title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0/%EC%9D%B4%EA%B7%9C%EC%99%84%EC%98%A4%EC%8A%B9%ED%98%81&amp;diff=50526&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:29, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0/%EC%9D%B4%EA%B7%9C%EC%99%84%EC%98%A4%EC%8A%B9%ED%98%81&amp;diff=50526&amp;oldid=prev"/>
		<updated>2021-02-07T05:29:31Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt; #include &amp;amp;lt;iostream&amp;amp;gt;&lt;br /&gt;
 #include &amp;amp;lt;ctime&amp;amp;gt;           using namespace std;&lt;br /&gt;
 &lt;br /&gt;
 int main()&lt;br /&gt;
 {&lt;br /&gt;
 	int walk = 0;     &lt;br /&gt;
 	int movement = 0;             	&lt;br /&gt;
 	int row, colum; &lt;br /&gt;
 &lt;br /&gt;
 	&lt;br /&gt;
 	cout &amp;amp;lt;&amp;amp;lt; &amp;quot;미로배열의 행입력(2&amp;amp;lt; n &amp;amp;lt; 40) :&amp;quot;;&lt;br /&gt;
 	cin &amp;amp;gt;&amp;amp;gt; row;&lt;br /&gt;
 	&lt;br /&gt;
 	while(row &amp;amp;lt; 2 || row &amp;amp;gt; 40) 	{&lt;br /&gt;
 		cout &amp;amp;lt;&amp;amp;lt; &amp;quot;\n잘못입력하셨습니다. 다시 입력해 주세요: &amp;quot;;&lt;br /&gt;
 		cin &amp;amp;gt;&amp;amp;gt; row;&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 	cout &amp;amp;lt;&amp;amp;lt; &amp;quot;\n미로배열의 열입력(2 &amp;amp;lt; m &amp;amp;lt; 20) :&amp;quot;;&lt;br /&gt;
 	cin &amp;amp;gt;&amp;amp;gt; colum;&lt;br /&gt;
 	&lt;br /&gt;
 	while(colum &amp;amp;lt; 2 || colum &amp;amp;gt; 20)  	{&lt;br /&gt;
 		cout &amp;amp;lt;&amp;amp;lt; &amp;quot;\n잘못입력하셨습니다. 다시 입력해 주세요: &amp;quot;;&lt;br /&gt;
 		cin &amp;amp;gt;&amp;amp;gt; colum;&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 	cout &amp;amp;lt;&amp;amp;lt; &amp;quot;\n&amp;quot;;&lt;br /&gt;
 &lt;br /&gt;
 	int **tile;&lt;br /&gt;
 	tile = new int *[row+2];&lt;br /&gt;
 &lt;br /&gt;
 	int crs, avn;&lt;br /&gt;
 	for(crs=0;crs&amp;amp;lt;row+2;crs++)&lt;br /&gt;
 	{&lt;br /&gt;
 		tile[crs] = new int [colum+2];&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 	for(crs=0; crs&amp;amp;lt;=row+1; crs++) &lt;br /&gt;
 	{	tile[0][crs] = 1;&lt;br /&gt;
 		tile[row+1][crs] = 1;&lt;br /&gt;
 	}&lt;br /&gt;
 	for(avn=0; avn&amp;amp;lt;=colum+1; avn++)&lt;br /&gt;
 	{&lt;br /&gt;
 		tile[avn][0] = 1;&lt;br /&gt;
 		tile[avn][colum+1] = 1;&lt;br /&gt;
 	}&lt;br /&gt;
 	&lt;br /&gt;
 	&lt;br /&gt;
 	int path;&lt;br /&gt;
 	cout &amp;amp;lt;&amp;amp;lt; &amp;quot;미로의 길을 입력하시오.&amp;quot;;&lt;br /&gt;
 	for(avn=1; avn&amp;amp;lt;=row; avn++)   &lt;br /&gt;
 		for(crs=1; crs&amp;amp;lt;=colum; crs++)&lt;br /&gt;
 		{&lt;br /&gt;
 			cin &amp;amp;gt;&amp;amp;gt; path;&lt;br /&gt;
 			tile[avn][crs] = path;&lt;br /&gt;
 		}&lt;br /&gt;
 &lt;br /&gt;
 	cout &amp;amp;lt;&amp;amp;lt; &amp;quot;\n 미로를 완성했습니다. 시작해 볼까요?\n&amp;quot;;&lt;br /&gt;
 &lt;br /&gt;
 	 &lt;br /&gt;
 	int i = 1;   &lt;br /&gt;
 	int j = 1;&lt;br /&gt;
 	cout &amp;amp;lt;&amp;amp;lt; &amp;quot;현재 위치는 (&amp;quot; &amp;amp;lt;&amp;amp;lt; i &amp;amp;lt;&amp;amp;lt; &amp;quot;, &amp;quot; &amp;amp;lt;&amp;amp;lt; j &amp;amp;lt;&amp;amp;lt; &amp;quot;) 이다.\n&amp;quot;; &lt;br /&gt;
 	&lt;br /&gt;
 	int imove[8] = {-1, 0, 1, 1, 1, 0, -1, -1}; &lt;br /&gt;
 	int jmove[8] = {-1, -1, -1, 0, 1, 1, 1, 0};&lt;br /&gt;
 	srand(time(0));&lt;br /&gt;
 &lt;br /&gt;
 	while(true)&lt;br /&gt;
 	{&lt;br /&gt;
 		movement = rand() % 8;  &lt;br /&gt;
 		switch(movement)&lt;br /&gt;
 		{&lt;br /&gt;
 		case 0: &lt;br /&gt;
 			if(tile[i + imove[0]][j + jmove[0]]  == 0)   &lt;br /&gt;
             {                                            &lt;br /&gt;
 			    i = i + imove[0];  &lt;br /&gt;
 				j = j + jmove[0];&lt;br /&gt;
 				cout &amp;amp;lt;&amp;amp;lt; &amp;quot;현재 위치는 (&amp;quot; &amp;amp;lt;&amp;amp;lt; i &amp;amp;lt;&amp;amp;lt; &amp;quot;, &amp;quot; &amp;amp;lt;&amp;amp;lt; j &amp;amp;lt;&amp;amp;lt; &amp;quot;) 이다.\n&amp;quot;; &lt;br /&gt;
 				walk++;&lt;br /&gt;
 			}&lt;br /&gt;
 			break;&lt;br /&gt;
 &lt;br /&gt;
 		case 1: &lt;br /&gt;
 			if(tile[i + imove[1]][j + jmove[1]] == 0)  &lt;br /&gt;
 			{&lt;br /&gt;
 				i = i + imove[1];&lt;br /&gt;
 				j = j + jmove[1];&lt;br /&gt;
 				cout &amp;amp;lt;&amp;amp;lt; &amp;quot;현재 위치는 (&amp;quot; &amp;amp;lt;&amp;amp;lt; i &amp;amp;lt;&amp;amp;lt; &amp;quot;, &amp;quot; &amp;amp;lt;&amp;amp;lt; j &amp;amp;lt;&amp;amp;lt; &amp;quot;) 이다.\n&amp;quot;; &lt;br /&gt;
 				walk++;&lt;br /&gt;
 			}&lt;br /&gt;
 			break;&lt;br /&gt;
 &lt;br /&gt;
 		case 2: &lt;br /&gt;
 			if(tile[i + imove[2]][j + jmove[2]] == 0)  &lt;br /&gt;
 			{&lt;br /&gt;
 				i = i + imove[2];&lt;br /&gt;
 				j = j + jmove[2];&lt;br /&gt;
 				cout &amp;amp;lt;&amp;amp;lt; &amp;quot;현재 위치는 (&amp;quot; &amp;amp;lt;&amp;amp;lt; i &amp;amp;lt;&amp;amp;lt; &amp;quot;, &amp;quot; &amp;amp;lt;&amp;amp;lt; j &amp;amp;lt;&amp;amp;lt; &amp;quot;) 이다.\n&amp;quot;; &lt;br /&gt;
 				walk++;&lt;br /&gt;
 			}&lt;br /&gt;
 			break;&lt;br /&gt;
 &lt;br /&gt;
 		case 3: &lt;br /&gt;
 			if(tile[i + imove[3]][j + jmove[3]] == 0)  &lt;br /&gt;
 			{&lt;br /&gt;
 				i = i + imove[3];&lt;br /&gt;
 				j = j + jmove[3];&lt;br /&gt;
 				cout &amp;amp;lt;&amp;amp;lt; &amp;quot;현재 위치는 (&amp;quot; &amp;amp;lt;&amp;amp;lt; i &amp;amp;lt;&amp;amp;lt; &amp;quot;, &amp;quot; &amp;amp;lt;&amp;amp;lt; j &amp;amp;lt;&amp;amp;lt; &amp;quot;) 이다.\n&amp;quot;; &lt;br /&gt;
 				walk++;&lt;br /&gt;
 			}&lt;br /&gt;
 			break;&lt;br /&gt;
 &lt;br /&gt;
 		case 4: &lt;br /&gt;
 			if(tile[i + imove[4]][j + jmove[4]] == 0)  &lt;br /&gt;
 			{&lt;br /&gt;
 				i = i + imove[4];&lt;br /&gt;
 				j = j + jmove[4];&lt;br /&gt;
 				cout &amp;amp;lt;&amp;amp;lt; &amp;quot;현재 위치는 (&amp;quot; &amp;amp;lt;&amp;amp;lt; i &amp;amp;lt;&amp;amp;lt; &amp;quot;, &amp;quot; &amp;amp;lt;&amp;amp;lt; j &amp;amp;lt;&amp;amp;lt; &amp;quot;) 이다.\n&amp;quot;; &lt;br /&gt;
 				walk++;&lt;br /&gt;
 			}&lt;br /&gt;
 			break;&lt;br /&gt;
 &lt;br /&gt;
 		case 5: &lt;br /&gt;
 			if(tile[i + imove[5]][j + jmove[5]] == 0)  &lt;br /&gt;
 			{&lt;br /&gt;
 				i = i + imove[5];&lt;br /&gt;
 				j = j + jmove[5];&lt;br /&gt;
 				cout &amp;amp;lt;&amp;amp;lt; &amp;quot;현재 위치는 (&amp;quot; &amp;amp;lt;&amp;amp;lt; i &amp;amp;lt;&amp;amp;lt; &amp;quot;, &amp;quot; &amp;amp;lt;&amp;amp;lt; j &amp;amp;lt;&amp;amp;lt; &amp;quot;) 이다.\n&amp;quot;; &lt;br /&gt;
 				walk++;&lt;br /&gt;
 			}&lt;br /&gt;
 			break;&lt;br /&gt;
 &lt;br /&gt;
 		case 6: &lt;br /&gt;
 			if(tile[i + imove[6]][j + jmove[6]] == 0)  &lt;br /&gt;
 			{&lt;br /&gt;
 				i = i + imove[6];&lt;br /&gt;
 				j = j + jmove[6];&lt;br /&gt;
 				cout &amp;amp;lt;&amp;amp;lt; &amp;quot;현재 위치는 (&amp;quot; &amp;amp;lt;&amp;amp;lt; i &amp;amp;lt;&amp;amp;lt; &amp;quot;, &amp;quot; &amp;amp;lt;&amp;amp;lt; j &amp;amp;lt;&amp;amp;lt; &amp;quot;) 이다.\n&amp;quot;; &lt;br /&gt;
 				walk++;&lt;br /&gt;
 			}&lt;br /&gt;
 			break;&lt;br /&gt;
 &lt;br /&gt;
 		case 7: &lt;br /&gt;
 			if(tile[i + imove[7]][j + jmove[7]] == 0)  &lt;br /&gt;
 			{&lt;br /&gt;
 				i = i + imove[7];&lt;br /&gt;
 				j = j + jmove[7];&lt;br /&gt;
 				cout &amp;amp;lt;&amp;amp;lt; &amp;quot;현재 위치는 (&amp;quot; &amp;amp;lt;&amp;amp;lt; i &amp;amp;lt;&amp;amp;lt; &amp;quot;, &amp;quot; &amp;amp;lt;&amp;amp;lt; j &amp;amp;lt;&amp;amp;lt; &amp;quot;) 이다.\n&amp;quot;; &lt;br /&gt;
 				walk++;&lt;br /&gt;
 			}&lt;br /&gt;
 			break;&lt;br /&gt;
 		}&lt;br /&gt;
 &lt;br /&gt;
 		if( i == colum &amp;amp;amp;&amp;amp;amp; j == row)&lt;br /&gt;
 			break;&lt;br /&gt;
 &lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 	cout &amp;amp;lt;&amp;amp;lt; &amp;quot;바퀴벌레가 이동한 횟수는 &amp;quot; &amp;amp;lt;&amp;amp;lt; walk &amp;amp;lt;&amp;amp;lt; &amp;quot;번 입니다.\n\n&amp;quot;;&lt;br /&gt;
 	&lt;br /&gt;
 	cout &amp;amp;lt;&amp;amp;lt; &amp;quot;\n&amp;quot;;&lt;br /&gt;
 	return 0;&lt;br /&gt;
 }&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>