/*
【基础】:方阵填数(easy)
Time Limit:1000MS Memory Limit:65536K
Total Submit:226 Accepted:109
Description
在一个N*N的方阵中,填入1、2、…、N*N个数,并要求构成如下的格式
例:
N=5
13 14 15 16 1
12 23 24 17 2
11 22 25 18 3
10 21 20 19 4
9 8 7 6 5
N=6
16 17 18 19 20 1
15 30 31 32 21 2
14 29 36 33 22 3
13 28 35 34 23 4
12 27 26 25 24 5
11 10 9 8 7 6
Input
(a.in)输入n(n≤25)
Output
(a.out)满足要求的矩阵(数字之间用空格分开)
Sample Input
5
Sample Output
13 14 15 16 1
12 23 24 17 2
11 22 25 18 3
10 21 20 19 4
9 8 7 6 5
*/
/*
print n*n text
*/
#include < stdio.h >
#define MAX 50
int main( void )
{
int a[MAX][MAX] = {{ 0 , 0 }} ;
int i,j,k,n,h,l,ht,lt,total = 0 ,flag = 0 ;
scanf( " %d " , & n) ;
h = 1 ;
ht = n ;
l = n ;
lt = 1 ;
k = n * n ;
while (total < k )
{
if ( flag == 0 ) /* 向下,向右填数 */
{
for (i = h,j = l; i <= ht ; i ++ )
{
++ total ;
a[i][j] = total ;
}
-- l ;
for (i = l,j = ht; i >= lt ; i -- )
{
++ total ;
a[j][i] = total ;
}
-- ht ;
flag = 1 ;
}
else /* 向上,向左填数 */
{
for (i = ht,j = lt; i >= h ; i -- )
{
++ total ;
a[i][j] = total ;
}
++ lt ;
for (i = lt,j = h ; i <= l ; i ++ )
{
++ total ;
a[j][i] = total ;
}
++ h ;
flag = 0 ;
}
}
for (i = 1 ; i <= n; i ++ )
{
for (j = 1 ; j <= n; j ++ )
printf( " %d " ,a[i][j]);
printf( " " );
}
system( " pause " );
return 0 ;
}
【基础】:方阵填数(easy)
Time Limit:1000MS Memory Limit:65536K
Total Submit:226 Accepted:109
Description
在一个N*N的方阵中,填入1、2、…、N*N个数,并要求构成如下的格式
例:
N=5
13 14 15 16 1
12 23 24 17 2
11 22 25 18 3
10 21 20 19 4
9 8 7 6 5
N=6
16 17 18 19 20 1
15 30 31 32 21 2
14 29 36 33 22 3
13 28 35 34 23 4
12 27 26 25 24 5
11 10 9 8 7 6
Input
(a.in)输入n(n≤25)
Output
(a.out)满足要求的矩阵(数字之间用空格分开)
Sample Input
5
Sample Output
13 14 15 16 1
12 23 24 17 2
11 22 25 18 3
10 21 20 19 4
9 8 7 6 5
*/
/*
print n*n text
*/
#include < stdio.h >
#define MAX 50
int main( void )
{
int a[MAX][MAX] = {{ 0 , 0 }} ;
int i,j,k,n,h,l,ht,lt,total = 0 ,flag = 0 ;
scanf( " %d " , & n) ;
h = 1 ;
ht = n ;
l = n ;
lt = 1 ;
k = n * n ;
while (total < k )
{
if ( flag == 0 ) /* 向下,向右填数 */
{
for (i = h,j = l; i <= ht ; i ++ )
{
++ total ;
a[i][j] = total ;
}
-- l ;
for (i = l,j = ht; i >= lt ; i -- )
{
++ total ;
a[j][i] = total ;
}
-- ht ;
flag = 1 ;
}
else /* 向上,向左填数 */
{
for (i = ht,j = lt; i >= h ; i -- )
{
++ total ;
a[i][j] = total ;
}
++ lt ;
for (i = lt,j = h ; i <= l ; i ++ )
{
++ total ;
a[j][i] = total ;
}
++ h ;
flag = 0 ;
}
}
for (i = 1 ; i <= n; i ++ )
{
for (j = 1 ; j <= n; j ++ )
printf( " %d " ,a[i][j]);
printf( " " );
}
system( " pause " );
return 0 ;
}