成都信息工程大学吧 关注：185,336贴子：5,468,873
- 6回复贴，共1页
#include <stdio.h>
int main(void){ int i = 0, j = 0, k = 0; int data[20][20] = {0}; int count = 1; int N = 0; printf("Input an integer N:\n"); scanf("%d",&N); for(k = 0 ; k < N / 2; k++) { for(i = k; i < N - k; i++) { data[k][i] = count++; } for(i = k + 1; i < N -k; i++) { data[i][N - k - 1] = count++; } for(i = N - k - 2; i > k; i--) { data[N-k-1][i] = count++; } for(i = N - k - 1;i > k; i--) { data[i][k] = count++; } } if(N % 2 != 0) { data[N / 2][N / 2] = N * N; } for(i = 0;i < N;i ++) { for(j = 0;j < N;j ++) { printf("%5d",data[i][j]); } printf("\n"); }
return 0;}
答案在此，仅供大家讨论，这是全矩阵的形式，上三角的话，你懂的.
int main(void){ int i = 0, j = 0, k = 0; int data[20][20] = {0}; int count = 1; int N = 0; printf("Input an integer N:\n"); scanf("%d",&N); for(k = 0 ; k < N / 2; k++) { for(i = k; i < N - k; i++) { data[k][i] = count++; } for(i = k + 1; i < N -k; i++) { data[i][N - k - 1] = count++; } for(i = N - k - 2; i > k; i--) { data[N-k-1][i] = count++; } for(i = N - k - 1;i > k; i--) { data[i][k] = count++; } } if(N % 2 != 0) { data[N / 2][N / 2] = N * N; } for(i = 0;i < N;i ++) { for(j = 0;j < N;j ++) { printf("%5d",data[i][j]); } printf("\n"); }
return 0;}
答案在此，仅供大家讨论，这是全矩阵的形式，上三角的话，你懂的.
#include <stdio.h> int main(void)
{
int n,i,j,k=1,m;
int a[20][20];
int row1=0,row2,col1=0,col2;
printf("请输入方针的阶数:");
scanf("%d",&n);
m = ( 1 + n ) * n / 2;
row2 = n;
col2 = n;
for (i=0;i<n;i++)
for(j=0;j<n;j++)
a[i][j]=0;
while (k<=m)
{
for (j=col1;j<col2;j++)
{
if(a[row1][j]==0)
{
if (k>m)
{
break;
}
a[row1][j]=k;
k++;
}
}
col2=j-1;
for (i=row1+1,j=col2-1;i<row2 && j>=col1;j--,i++)
{
if (a[i][j] == 0)
{
if (k>m)
{
break;
}
a[i][j]=k;
k++;
}
}
row2=i-1;
col1=j+1;
for (i=row2-1;i>row1;i--)
{
if (a[i][col1]==0)
{
if (k>m)
{
break;
}
a[i][col1]=k;
k++;
}
}
row1=i+1;
}
for (i=0;i<n;i++)
{
for (j=0;j<n;j++)
{
if(a[i][j]!=0)
{
if (a[i][j]<10)
{
printf(" %d ",a[i][j]);
}
else
printf("%d ",a[i][j]);
}
}
printf("\n");
}
}
{
int n,i,j,k=1,m;
int a[20][20];
int row1=0,row2,col1=0,col2;
printf("请输入方针的阶数:");
scanf("%d",&n);
m = ( 1 + n ) * n / 2;
row2 = n;
col2 = n;
for (i=0;i<n;i++)
for(j=0;j<n;j++)
a[i][j]=0;
while (k<=m)
{
for (j=col1;j<col2;j++)
{
if(a[row1][j]==0)
{
if (k>m)
{
break;
}
a[row1][j]=k;
k++;
}
}
col2=j-1;
for (i=row1+1,j=col2-1;i<row2 && j>=col1;j--,i++)
{
if (a[i][j] == 0)
{
if (k>m)
{
break;
}
a[i][j]=k;
k++;
}
}
row2=i-1;
col1=j+1;
for (i=row2-1;i>row1;i--)
{
if (a[i][col1]==0)
{
if (k>m)
{
break;
}
a[i][col1]=k;
k++;
}
}
row1=i+1;
}
for (i=0;i<n;i++)
{
for (j=0;j<n;j++)
{
if(a[i][j]!=0)
{
if (a[i][j]<10)
{
printf(" %d ",a[i][j]);
}
else
printf("%d ",a[i][j]);
}
}
printf("\n");
}
}
