sgu125 分类： sgu 2015-02-...

---

搜索+可行性剪枝

---

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
#define MAXN 5

int n;
int b[MAXN][MAXN]={0};
int a[MAXN][MAXN]={0}; 
int flag=0; 

bool check(int px,int py)
{
    if(px>=1 && px<=n && py>=1 && py<=n)
    {
        int tmp=0;

        tmp+=(a[px-1][py]>a[px][py]);
        tmp+=(a[px+1][py]>a[px][py]);
        tmp+=(a[px][py-1]>a[px][py]);
        tmp+=(a[px][py+1]>a[px][py]);

        if(b[px][py]==tmp)
          return true;
        else
          return false;  
    }
    else return true;
}

void dfs(int x,int y)
{
    int i;

    if(x==n+1)
    {
        if(check(n,n)==false)return;

        flag=1;
    }

    for(i=1;i<=9 && !flag;i++)
    {
      a[x][y]=i;

      if(x!=1 && check(x-1,y)==false)continue;
      if(x==n && check(x,y-1)==false)continue;

      if(y==n)dfs(x+1,1);
      else    dfs(x,y+1);
    }
}

int main()
{
    int i,j;

    #ifndef ONLINE_JUDGE
    freopen("sgu125.in","r",stdin);
    freopen("sgu125.out","w",stdout);
    #endif

    scanf("%d",&n);

    for(i=1;i<=n;i++)
      for(j=1;j<=n;j++)
      {
        scanf("%d",&b[i][j]);
      }

    dfs(1,1);

    if(flag)
    {
    for(i=1;i<=n;i++)
    {
      for(j=1;j<=n;j++)
      {
        printf("%d ",a[i][j]);
      }
       printf("\n");
    }
    }
    else
       printf("NO SOLUTION");

    #ifndef ONLINE_JUDGE
    fclose(stdin);
    fclose(stdout);
    #endif
    return 0; 
}

版权声明：本文为博主原创文章，未经博主允许不得转载。

转载于:https://www.cnblogs.com/dashgua/p/4723106.html