横竖折对称方阵

时间:2014-02-07 16:18:40   收藏:0   阅读:314
bubuko.com,布布扣
bubuko.com,布布扣
#include <stdio.h>
#include <math.h>
int main()
{
    int i,j,n;
    int m;
    int a[30][30];

    printf("please input n:");
    scanf("%d",&n);

    

    m = (n + 1) / 2;
    for( i = 1;i <= n;i++)
        for(j = 1;j <= n;j++){
            if( i + j <= n+1 && i <= j || i + j >= n+1 && i >= j){
                a[i][j] = m - abs(m - j);
            }
            if( i + j < n+1 && i > j || i + j > n+1 && i < j){
                a[i][j] = m - abs(m - i);
            }
        }


        for( i = 1;i <= n;i++){
        for(j = 1;j <= n;j++){
            printf("%3d",a[i][j]);
        }
        printf("\n");
        }
  return 1;        
}
bubuko.com,布布扣

原文:http://www.cnblogs.com/suixinwuji/p/3539434.html

评论(0
© 2014 bubuko.com 版权所有 - 联系我们:wmxa8@hotmail.com
打开技术之扣,分享程序人生!