https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0%2F%EA%B3%BD%EC%84%B8%ED%99%98 2026-05-16T17:28:16Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0/%EA%B3%BD%EC%84%B8%ED%99%98&diff=50520&oldid=prev 2013-11-27T09:37:19Z

<p></p> <p><b>New page</b></p><div> #include &amp;lt;iostream&amp;gt;<br /> #include &amp;lt;fstream&amp;gt;<br /> <br /> using namespace std;<br /> <br /> const int Max_x = 30;<br /> const int Max_y = 20;<br /> <br /> int array[Max_y][Max_x];<br /> /* = <br /> {<br /> /*{0,0,1,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1},<br /> {1,0,0,0,0,1,1,0,1,1,1,1,1,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1},<br /> {1,1,1,1,0,0,0,0,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,1,1,1,1},<br /> {1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1},<br /> {1,1,0,0,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},<br /> {1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,1},<br /> {0,0,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,0,1,1,1},<br /> {0,1,1,1,1,1,1,1,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1},<br /> {0,1,1,1,0,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,0,1,1,1,1,1,1},<br /> {0,0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1},<br /> {0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1},<br /> {0,1,1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,1,1,1,1},<br /> {0,0,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,1,1},<br /> {1,0,1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,1,1,1,1,1,1,1},<br /> {0,0,1,1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1},<br /> {1,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1},<br /> {1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},<br /> {1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},<br /> {1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,0,0,0,0,1,1,1},<br /> {1,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,2}<br /> <br /> {0,0,1,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1},<br /> {1,0,0,0,0,1,1,0,1,1,1,1,1,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1},<br /> {1,1,1,1,0,0,0,0,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,1,1,1,1},<br /> {1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1},<br /> {1,1,0,0,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},<br /> {1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,1},<br /> {0,0,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,0,1,1,1},<br /> {0,1,1,1,1,1,1,1,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1},<br /> {0,1,1,1,0,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,0,1,1,0,1,1,1},<br /> {0,0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1},<br /> {0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1},<br /> {0,1,1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1},<br /> {0,0,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1},<br /> {1,0,1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,1,1,1,0,1,1,1},<br /> {0,0,1,1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,0,1,1,1},<br /> {1,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,1,1,1,0,1,1,1},<br /> {1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1},<br /> {1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,1,1,1},<br /> {1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,0,0,0,0,1,1,1},<br /> {1,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,2}<br /> };*/<br /> <br /> void find(int cur, int x, int y);<br /> void show();<br /> <br /> //0 길<br /> //1 벽<br /> //2 끝<br /> //3 밟은곳<br /> <br /> void main()<br /> {<br /> int temp[Max_y][Max_x];<br /> int i, j, k;<br /> <br /> ifstream fin(&quot;maze.txt&quot;);<br /> <br /> for (i = 0; i &amp;lt; Max_y; i++)<br /> {<br /> for (j = 0; j &amp;lt; Max_x; j++)<br /> array[i][j] = fin.get() - &#039;0&#039;;<br /> while (fin.get() != &#039;\n&#039;);<br /> }<br /> <br /> for (i = 0; i &amp;lt; 4; i++)<br /> {<br /> for (j = 0; j &amp;lt; Max_y; j++)<br /> for (k = 0; k &amp;lt; Max_x; k++)<br /> temp[j][k] = array[j][k];<br /> array[0][0] = 3;<br /> find(i, 0, 0); // 처음 위치<br /> for (j = 0; j &amp;lt; Max_y; j++)<br /> for (k = 0; k &amp;lt; Max_x; k++)<br /> array[j][k] = temp[j][k];<br /> }<br /> }<br /> <br /> //0 위<br /> //1 오른<br /> //2 아래<br /> //3 왼<br /> <br /> void find(int cur, int x, int y)<br /> {<br /> int temp[Max_y][Max_x];<br /> switch (cur)<br /> {<br /> case 0 :<br /> y--;<br /> break;<br /> case 1 :<br /> x++;<br /> break;<br /> case 2 :<br /> y++;<br /> break;<br /> case 3 :<br /> x--;<br /> break;<br /> }<br /> if (x == -1 || x == Max_x || y == -1 || y == Max_y || array[y][x] == 1 || array[y][x] == 3)<br /> return ;<br /> <br /> if (array[y][x] == 2)<br /> {<br /> show();<br /> return ;<br /> }<br /> <br /> array[y][x] = 3;<br /> int i, j, k;<br /> for (i = 0; i &amp;lt; 4; i++)<br /> {<br /> for (j = 0; j &amp;lt; Max_y; j++)<br /> for (k = 0; k &amp;lt; Max_x; k++)<br /> temp[j][k] = array[j][k];<br /> find(i, x, y);<br /> for (j = 0; j &amp;lt; Max_y; j++)<br /> for (k = 0; k &amp;lt; Max_x; k++)<br /> array[j][k] = temp[j][k];<br /> }<br /> }<br /> <br /> void show()<br /> {<br /> for(int i = 0; i &amp;lt; Max_y; i++)<br /> {<br /> for (int j = 0; j &amp;lt; Max_x; j++)<br /> if (array[i][j] == 3)<br /> cout &amp;lt;&amp;lt; &quot;*&quot;;<br /> else<br /> cout &amp;lt;&amp;lt; array[i][j];<br /> cout &amp;lt;&amp;lt; endl;<br /> }<br /> cin.get();<br /> }<br /> </div>

imported>qa22ahj