<?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=RandomWalk2%2F%EC%98%81%EB%8F%99</id>
	<title>RandomWalk2/영동 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=RandomWalk2%2F%EC%98%81%EB%8F%99"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=RandomWalk2/%EC%98%81%EB%8F%99&amp;action=history"/>
	<updated>2026-05-14T18:44:58Z</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=RandomWalk2/%EC%98%81%EB%8F%99&amp;diff=38336&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:27, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=RandomWalk2/%EC%98%81%EB%8F%99&amp;diff=38336&amp;oldid=prev"/>
		<updated>2021-02-07T05:27:50Z</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;사실 이제 Random도 아니죠... Scheduled에 가깝겠죠.&lt;br /&gt;
 //RandomWalk2 &lt;br /&gt;
 //Random Walk &lt;br /&gt;
 #include&amp;amp;lt;iostream.h&amp;amp;gt; &lt;br /&gt;
 int main() &lt;br /&gt;
 { &lt;br /&gt;
         //변수선언==================================== &lt;br /&gt;
         char way[20];//이동하는 방향(8방향: 0~7) &lt;br /&gt;
         int input_y, input_x;//좌표의 총개수 &lt;br /&gt;
         int start_y, start_x;//시작점의 좌표&lt;br /&gt;
 		int journey=0;&lt;br /&gt;
         int y, x;//좌표의 현재 위치 &lt;br /&gt;
         int i, j;//for문 돌리는 데 필요한 변수 &lt;br /&gt;
         int count=0;//총 움직인 수 &lt;br /&gt;
         int first_go=0; &lt;br /&gt;
 &lt;br /&gt;
 		for(i=0;i&amp;amp;lt;20;i++)&lt;br /&gt;
 			way[i]=&amp;#039;\0&amp;#039;;&lt;br /&gt;
  &lt;br /&gt;
         //x, y 총좌표수를 입력받고 배열생성, 초기화=== &lt;br /&gt;
         cout&amp;amp;lt;&amp;amp;lt;&amp;quot;\n  x좌표 수를 입력하시오: &amp;quot;; &lt;br /&gt;
         cin&amp;amp;gt;&amp;amp;gt;input_x; &lt;br /&gt;
         cout&amp;amp;lt;&amp;amp;lt;&amp;quot;\n  y좌표 수를 입력하시오: &amp;quot;; &lt;br /&gt;
         cin&amp;amp;gt;&amp;amp;gt;input_y; &lt;br /&gt;
         int **base=new int *[input_y];  &lt;br /&gt;
         for(i=0;i&amp;amp;lt;input_x;i++)  &lt;br /&gt;
 			base[i]=new int [input_x];  &lt;br /&gt;
 		for(i=0;i&amp;amp;lt;input_y;i++){  &lt;br /&gt;
 			for(j=0;j&amp;amp;lt;input_x;j++)  &lt;br /&gt;
 				base[i][j]=0;}  &lt;br /&gt;
  &lt;br /&gt;
         //시작점 입력, 대입=========================== &lt;br /&gt;
         cout&amp;amp;lt;&amp;amp;lt;&amp;quot;\n  시작점의 x좌표를 입력하시오: &amp;quot;; &lt;br /&gt;
         cin&amp;amp;gt;&amp;amp;gt;start_x; &lt;br /&gt;
         cout&amp;amp;lt;&amp;amp;lt;&amp;quot;\n  시작점의 y좌표를 입력하시오: &amp;quot;; &lt;br /&gt;
         cin&amp;amp;gt;&amp;amp;gt;start_y; &lt;br /&gt;
         y=start_y; &lt;br /&gt;
         x=start_x; &lt;br /&gt;
         base[y][x]=1;//시작점은 이미 한 번 왔으므로 1 &lt;br /&gt;
         first_go++; &lt;br /&gt;
  &lt;br /&gt;
 		//방향 입력=================================== &lt;br /&gt;
         cout&amp;amp;lt;&amp;amp;lt;&amp;quot;갈 방향 입력: &amp;quot;; &lt;br /&gt;
         cin&amp;amp;gt;&amp;amp;gt;way; &lt;br /&gt;
         do{ &lt;br /&gt;
         //방향 처리=================================== &lt;br /&gt;
 			switch(way[journey]){ &lt;br /&gt;
 				case &amp;#039;0&amp;#039;://북 &lt;br /&gt;
 					if(y==0) &lt;br /&gt;
 						y=input_y-1;     &lt;br /&gt;
 					else &lt;br /&gt;
 						y--; &lt;br /&gt;
 					if(base[y][x]==0) &lt;br /&gt;
 						first_go++; &lt;br /&gt;
 					base[y][x]++; &lt;br /&gt;
 					count++; &lt;br /&gt;
 					journey++;&lt;br /&gt;
 					break; &lt;br /&gt;
 				case &amp;#039;1&amp;#039;://북동 &lt;br /&gt;
 					if(y==0) &lt;br /&gt;
 						y=input_y-1; &lt;br /&gt;
 					else if(x==input_x-1) &lt;br /&gt;
 						x=0; &lt;br /&gt;
 					else if(y==0 &amp;amp;amp;&amp;amp;amp; x==input_x-1){ &lt;br /&gt;
 						x=0;  &lt;br /&gt;
 						y=input_y-1;} &lt;br /&gt;
 					else{ &lt;br /&gt;
 						y--; &lt;br /&gt;
 						x++;} &lt;br /&gt;
 					if(base[y][x]==0) &lt;br /&gt;
 						first_go++; &lt;br /&gt;
 					base[y][x]++; &lt;br /&gt;
 					count++; &lt;br /&gt;
 					journey++;&lt;br /&gt;
 					break; &lt;br /&gt;
 				case &amp;#039;2&amp;#039;://동 &lt;br /&gt;
 					if(x==input_x-1) &lt;br /&gt;
 						x=0; &lt;br /&gt;
 					else &lt;br /&gt;
 						x++; &lt;br /&gt;
 					if(base[y][x]==0) &lt;br /&gt;
 						first_go++; &lt;br /&gt;
 					base[y][x]++; &lt;br /&gt;
 					count++; &lt;br /&gt;
 					journey++;&lt;br /&gt;
 					break; &lt;br /&gt;
 				case &amp;#039;3&amp;#039;://남동 &lt;br /&gt;
 					if(y==input_y-1) &lt;br /&gt;
 						y=0; &lt;br /&gt;
 					else if(x==input_x-1) &lt;br /&gt;
 						x=0; &lt;br /&gt;
 					else if(y==input_y-1 &amp;amp;amp;&amp;amp;amp; x==input_x-1){ &lt;br /&gt;
 						y=0; &lt;br /&gt;
 						x=0;} &lt;br /&gt;
 					else{ &lt;br /&gt;
 						y++; &lt;br /&gt;
 						x++;} &lt;br /&gt;
 					if(base[y][x]==0) &lt;br /&gt;
 						first_go++; &lt;br /&gt;
 					base[y][x]++; &lt;br /&gt;
 					count++; &lt;br /&gt;
 					journey++;&lt;br /&gt;
 					break; &lt;br /&gt;
 				case &amp;#039;4&amp;#039;://남 &lt;br /&gt;
 					if(y==input_y-1) &lt;br /&gt;
 						y=0; &lt;br /&gt;
 					else &lt;br /&gt;
 						y++; &lt;br /&gt;
 					if(base[y][x]==0) &lt;br /&gt;
 						first_go++; &lt;br /&gt;
 					base[y][x]++; &lt;br /&gt;
 					count++; &lt;br /&gt;
 					journey++;&lt;br /&gt;
 					break; &lt;br /&gt;
 				case &amp;#039;5&amp;#039;://남서 &lt;br /&gt;
 					if(y==input_y-1) &lt;br /&gt;
 						y=0; &lt;br /&gt;
 					else if(x==0) &lt;br /&gt;
 						x=input_x-1; &lt;br /&gt;
 					else if(y==input_y-1 &amp;amp;amp;&amp;amp;amp; x==0){ &lt;br /&gt;
 						y=0; &lt;br /&gt;
 						x=input_x-1;} &lt;br /&gt;
 					else{ &lt;br /&gt;
 						y++; &lt;br /&gt;
 						x--;} &lt;br /&gt;
 					if(base[y][x]==0) &lt;br /&gt;
 						first_go++; &lt;br /&gt;
 					base[y][x]++; &lt;br /&gt;
 					count++; &lt;br /&gt;
 					journey++;&lt;br /&gt;
 					break; &lt;br /&gt;
 				case &amp;#039;6&amp;#039;://서 &lt;br /&gt;
 					if(x==0) &lt;br /&gt;
 						x=input_x-1; &lt;br /&gt;
 					else &lt;br /&gt;
 						x--; &lt;br /&gt;
 					if(base[y][x]==0) &lt;br /&gt;
 						first_go++; &lt;br /&gt;
 					base[y][x]++; &lt;br /&gt;
 					count++; &lt;br /&gt;
 					journey++;&lt;br /&gt;
 					break; &lt;br /&gt;
 				case &amp;#039;7&amp;#039;://북서 &lt;br /&gt;
 					if(y==0) &lt;br /&gt;
 						y=input_y-1; &lt;br /&gt;
 					else if(x==0) &lt;br /&gt;
 						x=input_x-1; &lt;br /&gt;
 					else if(y==0 &amp;amp;amp;&amp;amp;amp; x==0){ &lt;br /&gt;
 						y=input_y-1; &lt;br /&gt;
 						x=input_x-1;} &lt;br /&gt;
 					else{ &lt;br /&gt;
 						y--; &lt;br /&gt;
 						x--;&lt;br /&gt;
 					} &lt;br /&gt;
 					if(base[y][x]==0) &lt;br /&gt;
 						first_go++; &lt;br /&gt;
 					base[y][x]++; &lt;br /&gt;
 					count++; &lt;br /&gt;
 					journey++;&lt;br /&gt;
 					break; &lt;br /&gt;
 				default: &lt;br /&gt;
 					break;&lt;br /&gt;
 					}&lt;br /&gt;
 &lt;br /&gt;
     }while(way[journey]!=&amp;#039;\0&amp;#039;); &lt;br /&gt;
 	cout&amp;amp;lt;&amp;amp;lt;&amp;quot;\n총 이동 횟수는 &amp;quot;&amp;amp;lt;&amp;amp;lt;count&amp;amp;lt;&amp;amp;lt;&amp;quot;회\n&amp;quot;; &lt;br /&gt;
     for(i=0;i&amp;amp;lt;input_y;i++){ &lt;br /&gt;
 		for(j=0;j&amp;amp;lt;input_x;j++) &lt;br /&gt;
 			cout&amp;amp;lt;&amp;amp;lt;base[i][j]&amp;amp;lt;&amp;amp;lt;&amp;quot; &amp;quot;; &lt;br /&gt;
         cout&amp;amp;lt;&amp;amp;lt;&amp;quot;\n&amp;quot;;} &lt;br /&gt;
          &lt;br /&gt;
         //동적할당한 것 지움  &lt;br /&gt;
     for(i=0;i&amp;amp;lt;input_x;i++)  &lt;br /&gt;
 		delete[] base[i];  &lt;br /&gt;
     delete [] base;  &lt;br /&gt;
  &lt;br /&gt;
     return 0; &lt;br /&gt;
 } &lt;br /&gt;
----&lt;br /&gt;
작성자: [[Yggdrasil]]&lt;br /&gt;
----&lt;br /&gt;
[[RandomWalk2]]&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>