blob: 436e9c91fe2984b4064f5e6ff311dd2df296e6a1 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
#include <stdio.h>
void solve(int t){
int a, i, j , k, n;
int matrix[101][101];
a=0;
if (!(t%2))
n = t/2;
else
n = t/2 + 1;
for (k = 0; k<n; ++k){
for (i = a; i < t-a; ++i){
for (j = a; j < t-a; ++j){
matrix[i][j]=a+1;
}
}
++a;
}
for (i = 0; i < t; ++i){
for (j = 0; j < t; ++j){
printf("%d ", matrix[i][j]);
}
printf("\n");
}
printf("\n");
}
int main(){
int t;
do{
scanf("%d", &t);
solve(t);
}while(t!=0);
return 0;
}
|