C - Extended Lights Out

// wa一次    PUZZLE #1  中间小了个空格     

注意: 眼看到的不一定为真

 

 #include <stdio.h>
#include <string.h>
void change(int x,int ca[][9],int i,int j)
{
    if(x == 1)
    {
        ca[i][j] = (ca[i][j]+1)%2;
        ca[i-1][j] = (ca[i-1][j] + 1) % 2;
        ca[i][j-1] = (ca[i][j-1] + 1) % 2;
        ca[i][j+1] = (ca[i][j+1] + 1) % 2;
        ca[i+1][j] = (ca[i+1][j] + 1) % 2;
    }
}
int Fun(int a[][7],int b[][7])
{
    int ca[7][9];                                    //  开始为ca[6][7]  在change中越界    花费大量时间调试出现莫名奇妙错误
    int j,i,i1,i2,i3,i4,i5;
    for(i1=0;i1<2;i1++)
     for(i2=0;i2<2;i2++)
      for(i3=0;i3<2;i3++)
       for(i4=0;i4<2;i4++)
        for(i5=0;i5<2;i5++)
        {

            for(i = 1;i <= 5;i++)
                for(j = 1;j <= 6;j++){
                   ca[i][j] = a[i][j];
                   b[i][j] = 0;
                }
            b[1][1] = i1;b[2][1] = i2;b[3][1] = i3;b[4][1] = i4;b[5][1] = i5;
            change(b[1][1],ca,1,1);
            change(b[2][1],ca,2,1);
            change(b[3][1],ca,3,1);
            change(b[4][1],ca,4,1);
            change(b[5][1],ca,5,1);
         for(i = 1;i <=5;i++)  b[i][2] = ca[i][1];
            change(b[1][2],ca,1,2);
            change(b[2][2],ca,2,2);
            change(b[3][2],ca,3,2);
            change(b[4][2],ca,4,2);
            change(b[5][2],ca,5,2);
         for(i = 1;i <=5;i++)  b[i][3] = ca[i][2];
            change(b[1][3],ca,1,3);
            change(b[2][3],ca,2,3);
            change(b[3][3],ca,3,3);
            change(b[4][3],ca,4,3);
            change(b[5][3],ca,5,3);
          for(i = 1;i <=5;i++)  b[i][4] = ca[i][3];
            change(b[1][4],ca,1,4);
            change(b[2][4],ca,2,4);
            change(b[3][4],ca,3,4);
            change(b[4][4],ca,4,4);
            change(b[5][4],ca,5,4);
          for(i = 1;i <=5;i++)  b[i][5] = ca[i][4];
            change(b[1][5],ca,1,5);
            change(b[2][5],ca,2,5);
            change(b[3][5],ca,3,5);
            change(b[4][5],ca,4,5);
            change(b[5][5],ca,5,5);
          for(i = 1;i <=5;i++)  b[i][6] = ca[i][5];
            change(b[1][6],ca,1,6);
            change(b[2][6],ca,2,6);
            change(b[3][6],ca,3,6);
            change(b[4][6],ca,4,6);
            change(b[5][6],ca,5,6);
            int flage = 1;
            for(i = 1;i<=5;i++){
                if(ca[i][6] != 0){
                    flage = 0;
                    break;
                }
            }
            if(flage)  return;
        }

}
int main()
{
    int a[6][7];
    int b[6][7];
    int n,k,i,j,count = 0;
    scanf("%d",&n);
        count = 0;
        for(k = 0; k< n;k++){

            for(i = 1;i <= 5;i++)
                for(j = 1;j <= 6;j++)
                scanf("%d",&a[i][j]);
            memset(b,0,sizeof(b));
            Fun(a,b);
            printf("PUZZLE #%d/n",++count);
            for(i = 1;i <= 5;i++)
                 for(j = 1;j <= 6;j++)
                   if(j != 6)
                     printf("%d ",b[i][j]);
                   else
                     printf("%d/n",b[i][j]);
        }
    return 0;
}

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值