四阶数独的方块编号怎样求
  • 板块学术版
  • 楼主__oio__
  • 当前回复0
  • 已保存回复0
  • 发布时间2024/5/5 16:13
  • 上次更新2024/5/5 17:44:22
查看原帖
四阶数独的方块编号怎样求
1112369
__oio__楼主2024/5/5 16:13
#include<bits/stdc++.h>
using namespace std;

int a[95];
int b1[5][5],b2[5][5],b3[5][5];
int n,cnt = 0;

void dfs(int number)
{
	if (number > n)
	{
		cnt++;
		return;
	}
	int pai,lie,kuai;
	pai = (number - 1) / 4 + 1;
	lie = (number - 1) % 4 + 1;
	kuai = 
	for (int i = 1;i <= 4;i++)
	{
		if (b1[pai][i] == 0&&b2[lie][i] == 0&&b3[kuai][i] == 0)
		{
			a[number] = i;
			b1[pai][i] = 1;
			b2[lie][i] = 1;
			b3[kuai][i] = 1;
			dfs(number + 1);
			b1[pai][i] = 0;
			b2[lie][i] = 0;
			b3[kuai][i] = 0;
		}
	} 
	
}
int main()
{
	cin>>n;
	dfs(1);
	cout<<cnt;
    return 0;
}

是在dfs函数中kuai的赋值 求解!!!! 在线等

2024/5/5 16:13
加载中...