旋转矩阵

来源:互联网 发布:知柏地黄丸治尿路感染 编辑:程序博客网 时间:2024/04/28 04:47
#include <stdio.h>
#define MAX_CLUME_NUMBER (100)
int Counter_cnt = 1;
void main()
{
int iD_counter = 0;
int index_counter = 0;
int iput_num = 0;
int Loop = 0;
int Circle_Array[MAX_CLUME_NUMBER][MAX_CLUME_NUMBER] = {0};
printf("Please Input Your Number!:/n");
scanf("%d",&iput_num);
printf("%d/n",iput_num/2);
for (iD_counter = 0; iD_counter <= iput_num/2; iD_counter++)
{
/*For Loops Fill the table*/
/*a[i][i]~a[i][n-i-1]*/
Loop = iput_num-2*iD_counter-1;
for (index_counter = 0; index_counter < Loop; index_counter++)
{
Circle_Array[iD_counter][iD_counter+index_counter] = Counter_cnt;
Counter_cnt++;
}
/*a[i][n-i]*~a[n-i-1][n-i]*/
for (index_counter = 0; index_counter < Loop; index_counter++)
{
Circle_Array[iD_counter+index_counter][iput_num-iD_counter-1] = Counter_cnt;
Counter_cnt++;
}

/*a[n-i][n-i]~a[n-i][i+1]*/
for (index_counter = 0; index_counter < Loop;index_counter++)
{
Circle_Array[iput_num-iD_counter-1][iput_num-iD_counter-1-index_counter] = Counter_cnt;
Counter_cnt++;
}

/*a[n-i][i]~a[i+1][i]*/
for (index_counter = 0; index_counter <Loop; index_counter++)
{
Circle_Array[iput_num- iD_counter -1- index_counter][iD_counter] = Counter_cnt;
Counter_cnt++;
}

}
if (iput_num%2!=0)
{
Circle_Array[iput_num/2][iput_num/2] = iput_num*iput_num;
}
for (index_counter = 0; index_counter < iput_num; index_counter++)
{
for (iD_counter = 0; iD_counter < iput_num; iD_counter++)
{
printf("%6d",Circle_Array[index_counter][iD_counter]);
}
printf("/n");
}
printf("End/n");
}
原创粉丝点击