学步园

<pre class="cpp" name="code">#include <stdio.h> #define M 50 void main() { int i,j,n,count; int dada[M][M] = {0}; printf("Input n(0~%d):",M); scanf("%d",&n); count = 1; for(i=0;i<(n+1)/2;i++) { for (j=i;j<n-i;j++) { dada[i][j] = count++; } for (j=i+1;j<n-i;j++) { dada[j][n-i-1] = count++; } for (j=n-i-2;j>=i;j--) { dada[n-i-1][j] = count++; } for (j=n-i-2;j>i;j--) { dada[j][i] = count++; } } for (i=0;i<n;i++) { for (j=0;j<n;j++) { printf("%5d",dada[i][j]); } printf("\n\n"); } }</pre> <p>   
#include <stdio.h>int main(){ int a[10][10]; int i,j,k,n,b=0; scanf("%d",&n); for ( i=0; i<n/2; i++) { for ( j=i; j<n-i; j++) /*四个循环按不同的方向进行*/ a[i][j] = ++b; for ( k=i+1,j--; k<n-i; k++ ) a[k][j] = ++b; for ( j=--k,j--; j>=i; j-- ) a[k][j] = ++b; for ( k--;
k>i; k-- ) a[k][i] = ++b; } if ( n%2 ) /*如果是单数的话，要加上最大的那个数放在中间*/ a[i][i] = ++b; for ( i=0; i<n; i++) { for ( j=0; j<n; j++) printf("%3d",a[i][j]); printf("\n"); } fflush(stdin); getchar(); return 0;}

方法一：

 

方法2：

#include <stdio.h></p> <p>#define MAX 100<br /> #define RIGHT 0<br /> #define LEFT 1<br /> #define UP 2<br /> #define DOWN 3</p> <p>typedef struct Position<br /> {<br /> int x;<br /> int y;<br /> }Pos;</p> <p>int guid[MAX][MAX] = {0};<br /> int map[MAX][MAX];<br /> Pos CurPos;<br /> int LastDirection;<br /> int n;</p> <p>int GetDirection();<br /> void GetNextPos(int Direction);<br /> void Show();</p> <p>int main()<br /> {<br /> scanf("%d", &n);</p> <p> CurPos.x = CurPos.y = 0;<br /> map[0][0] = 1;<br /> guid[0][0] = 1;<br /> LastDirection = RIGHT;</p> <p> for(int k = 0; k < n * n - 1; k++)<br /> {<br /> int Direction = GetDirection();<br /> GetNextPos(Direction);<br /> map[CurPos.x][CurPos.y] = k + 2;<br /> guid[CurPos.x][CurPos.y] = 1;<br /> LastDirection = Direction;<br /> }<br /> Show();</p> <p> fflush(stdin);<br /> getchar();<br /> return 0;<br /> }</p> <p>int GetDirection()<br /> {<br /> if(LastDirection == RIGHT)<br /> {<br /> if(CurPos.y == n - 1 || guid[CurPos.x][CurPos.y + 1] == 1)<br /> return DOWN;<br /> else<br /> return RIGHT;<br /> }<br /> else<br /> if(LastDirection == DOWN)<br /> {<br /> if(CurPos.x == n - 1 || guid[CurPos.x + 1][CurPos.y] == 1)<br /> return LEFT;<br /> else<br /> return DOWN;<br /> }<br /> else<br /> if(LastDirection == LEFT)<br /> {<br /> if(CurPos.y == 0 || guid[CurPos.x][CurPos.y - 1] == 1)<br /> return UP;<br /> else<br /> return LEFT;<br /> }<br /> else<br /> if(LastDirection == UP)<br /> {<br /> if(CurPos.x == 0 || guid[CurPos.x - 1][CurPos.y] == 1)<br /> return RIGHT;<br /> else<br /> return UP;<br /> }<br /> }</p> <p>void GetNextPos(int Direction)<br /> {<br /> switch(Direction)<br /> {<br /> case RIGHT:<br /> CurPos.y++;<br /> break;</p> <p> case DOWN:<br /> CurPos.x++;<br /> break;</p> <p> case LEFT:<br /> CurPos.y--;<br /> break;</p> <p> case UP:<br /> CurPos.x--;<br /> break;<br /> }</p> <p>}</p> <p>void Show()<br /> {<br /> for(int m = 0; m < n; m++)<br /> {<br /> for(int k = 0; k < n; k++)<br /> {<br /> printf("%4d", map[m][k]);<br /> }<br /> printf("\n");<br /> }<br /> }