网上搜了一下 枚举出所有情况就可以了
首先要知道 每一个钟拨4次和没有拨是一样的 所以枚举出 4的9次方中情况就可以了,于是尝试用了9重循环 题目中的测试数据是对了 但oj给的数据不能全通过 ,不知道是哪出错了
贴一下9重循环的代码
#include <iostream>
#include <cstdio>
using namespace std;
int action[9][9] =
{
// {a,b,c,d,e,f,g,h,i},
{1,1,0,1,1,0,0,0,0},
{1,1,1,0,0,0,0,0,0},
{0,1,1,0,1,1,0,0,0},
{1,0,0,1,0,0,1,0,0},
{0,1,0,1,1,1,0,1,0},
{0,0,1,0,0,1,0,0,1},
{0,0,0,1,1,0,1,1,0},
{0,0,0,0,0,0,1,1,1},
{0,0,0,0,1,1,0,1,1}
};
int input[9];
int step[9];
bool IsDone()
{
for(int i = 0; i < 9; ++i)
{
int tem = input[i];
for(int j = 0; j < 9; ++j)
{
for(int k = 0; k < step[j]; ++k)
tem = (tem + action[j][i]) % 4;
}
if(tem) return false;
}
return true;
}
void output()
{
for(int i = 0; i < 9; ++i)
for(int j = 0; j < step[i]; ++j)
printf("%d ",i + 1);
printf("\n");
}
int main()
{
for(int i = 0; i < 9; ++i)
scanf("%d",&input[i]);
for(int i1 = 0; i1 < 4; ++i1)
{
step[1] = i1;
for(int i2 = 0; i2 < 4; ++i2)
{
step[2] = i2;
for(int i3 = 0; i3 < 4; ++i3)
{
step[3] = i3;
for(int i4 = 0; i4 < 4; ++i4)
{
step[4] = i4;
for(int i5 = 0; i5 < 4; ++i5)
{
step[5] = i5;
for(int i6 = 0; i6 < 4; ++i6)
{
step[6] = i6;
for(int i7 = 0; i7 < 4; ++i7)
{
step[7] = i7;
for(int i8 = 0; i8 < 4; ++i8)
{
step[8] = i8;
for(int i9 = 0; i9 < 4; ++i9)
{
step[9] = i9;
if(IsDone())
{
output();
return 0;
}
}
}
}
}
}
}
}
}
}
return 0;
}
不知道是哪错了。。
参照其他人的博客 用递归的方法(dfs)ac了
我想这个递归的过程和9重循环挺像的 但是不知道为什么9重循环不能得到正确结果。。
下面是ac的代码
#include <iostream>
#include <cstdio>
using namespace std;
int action[9][9] =
{
// {a,b,c,d,e,f,g,h,i},
{1,1,0,1,1,0,0,0,0},
{1,1,1,0,0,0,0,0,0},
{0,1,1,0,1,1,0,0,0},
{1,0,0,1,0,0,1,0,0},
{0,1,0,1,1,1,0,1,0},
{0,0,1,0,0,1,0,0,1},
{0,0,0,1,1,0,1,1,0},
{0,0,0,0,0,0,1,1,1},
{0,0,0,0,1,1,0,1,1}
};
int input[9];
int step[9];
bool IsDone()
{
for(int i = 0; i < 9; ++i)
{
int tem = input[i];
for(int j = 0; j < 9; ++j)
{
for(int k = 0; k < step[j]; ++k)
tem = (tem + action[j][i]) % 4;
}
if(tem) return false;
}
return true;
}
void output()
{
for(int i = 0; i < 9; ++i)
for(int j = 0; j < step[i]; ++j)
printf("%d ",i + 1);
printf("\n");
}
void dfs(int x)
{
if(x > 9) return ;
if(IsDone())
{
output();
return;
}
else
{
for(int i = 0 ;i < 4;++i)
{
step[x] = i;
dfs(x+1);
}
}
}
int main()
{
for(int i = 0; i < 9; ++i)
scanf("%d",&input[i]);
dfs(0);
return 0;
}