1111111

最新推荐文章于 2025-05-10 18:09:08 发布

王文婷778

最新推荐文章于 2025-05-10 18:09:08 发布

阅读量87

点赞数

文章标签：算法

本文链接：https://blog.youkuaiyun.com/m0_71640832/article/details/134183484

版权

文章详细描述了一个名为Tromino的函数，用于在二维数组中使用递归策略填充特定元素。该函数接受数组、行、列坐标和大小作为参数，展示了如何在给定范围内进行填充。程序还包含一个主函数，用于输入初始坐标并显示填充后的数组。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#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");
}