旋转矩阵
来源:互联网 发布:知柏地黄丸治尿路感染 编辑:程序博客网 时间: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");
}
- 旋转矩阵
- 矩阵旋转
- 旋转矩阵
- 旋转矩阵
- 旋转矩阵
- 旋转矩阵
- 矩阵旋转
- 旋转矩阵
- 旋转矩阵
- 矩阵旋转
- 矩阵 旋转
- 矩阵旋转
- 旋转矩阵
- 旋转矩阵
- 矩阵旋转
- 旋转矩阵
- 旋转矩阵
- 旋转矩阵
- 我在西安的家,朝鲜族爱之教会 基督教教会 ~~
- 伟大的日本数学家伊藤清去世
- 第一讲 数组
- 将ASP生成的内容写入响应流中最有效的方法
- Css选择器!
- 旋转矩阵
- VS.NET2003项目转换到VS.NET2005项目出现的两个常见问题
- 常用经典SQL语句(收藏) 实用SQL语句
- 文件安全系统应用解析
- 某人对系统分析的一些看法
- [转]追MM与Java的23种设计模式
- Phases of Testing
- 2008新劳动法网址
- Struts 分页显示