1111111

#include<stdio.h>
#define N 16
int a[100][100];
int t=1;
void Tromino(int (*a)[N],int dr,int dc,int tr,int tc,int size)
{
    int s;
    if(size==1)
        return;
    if(size>1)
    {
        s=size/2;
        if(dr<=(tr+s-1)&&dc<=(tc+s-1))
        {
            a[tr+s-1][tc+s]=t;
            a[tr+s][tc+s]=t;
            a[tr+s][tc+s-1]=t;
            t++;
            Tromino(a,dr,dc,tr,tc,s);
            Tromino(a,tr+s-1,tc+s,tr,tc+s,s);
            Tromino(a,tr+s,tc+s,tr+s,tc+s,s);
            Tromino(a,tr+s,tc+s-1,tr+s,tc,s);
        }
        if(dr<=(tr+s-1)&&dc>(tc+s-1))
        {
            a[tr+s-1][tc+s-1]=t;
            a[tr+s][tc+s-1]=t;
            a[tr+s][tc+s]=t;
            t++;
            Tromino(a,dr,dc,tr,tc+s,s);
            Tromino(a,tr+s-1,tc+s-1,tr,tc,s);
            Tromino(a,tr+s,tc+s-1,tr+s,tc,s);
            Tromino(a,tr+s,tc+s,tr+s,tc+s,s);
        }
        if(dr>(tr+s-1)&&dc<=(tc+s-1))
        {
            a[tr+s-1][tc+s-1]=t;
            a[tr+s-1][tc+s]=t;
            a[tr+s][tc+s]=t;
            t++;
            Tromino(a,dr,dc,tr+s,tc,s);
            Tromino(a,tr+s-1,tc+s-1,tr,tc,s);
            Tromino(a,tr+s-1,tc+s,tr,tc+s,s);
            Tromino(a,tr+s,tc+s,tr+s,tc+s,s);
        }
        if(dr>(tr+s-1)&&dc>(tc+s-1))
        {
            a[tr+s][tc+s-1]=t;
            a[tr+s-1][tc+s-1]=t;
            a[tr+s-1][tc+s]=t;
            t++;
            Tromino(a,dr,dc,tr+s,tc+s,s);
            Tromino(a,tr+s,tc+s-1,tr+s,tc,s);
            Tromino(a,tr+s-1,tc+s-1,tr,tc,s);
            Tromino(a,tr+s-1,tc+s,tr,tc+s,s);
        }
    }
}
main()
{
    int i,j,dr,dc,a[N][N];
    printf("please input dr(0<dr<%d):",N);
    scanf("%d",&dr);
    printf("please input dc(0<dc<%d):",N);
    scanf("%d",&dc);
    a[dr][dc]=0;
    Tromino(a,dr,dc,0,0,N);
    for(i=0;i<N;i++)
    {
        for(j=0;j<N;j++)
            printf("%-4d",a[i][j]);
        printf("\n");
    }
    system("pause");
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值