> /******************************************
> POJ 1166
> Main Solution:
> list all the 9 moves to cycle
> then let the clock turn according to the move
> check if the clock has already set to 12 
> ******************************************/
> # include <iostream.h>
> 
> int move[9][9]={
>    //A,B,C,D,E,F,G,H,I
> 	{1,1,0,1,1,0,0,0,0},//move1
> 	{1,1,1,0,0,0,0,0,0},//move2
> 	{0,1,1,0,1,1,0,0,0},//move3
> 	{1,0,0,1,0,0,1,0,0},//move4
> 	{0,1,0,1,1,1,0,1,0},//move5
> 	{0,0,1,0,0,1,0,0,1},//move6
> 	{0,0,0,1,1,0,1,1,0},//move7
> 	{0,0,0,0,0,0,1,1,1},//move8
> 	{0,0,0,0,1,1,0,1,1} //move9
> };
> int clock[9];//original
> int temp[9];//for try
> int m[9];//record the times of each move
> 
> void LoadClock();
> void Move();
> bool Check();
> void Output();
> 
> void main(){
> 	
> 	LoadClock();
> 
> 	for (m[0]=0;m[0]<=3;m[0]++)
> 	for (m[1]=0;m[1]<=3;m[1]++)
> 	for (m[2]=0;m[2]<=3;m[2]++)
> 	for (m[3]=0;m[3]<=3;m[3]++)
> 	for (m[4]=0;m[4]<=3;m[4]++)
> 	for (m[5]=0;m[5]<=3;m[5]++)
> 	for (m[6]=0;m[6]<=3;m[6]++)
> 	for (m[7]=0;m[7]<=3;m[7]++)
> 	for (m[8]=0;m[8]<=3;m[8]++)
> 	{
> 		
> 		Move();
> 		if (Check()==true){
> 			Output();
> 			break;
> 		}		
> 	}
> }
> 
> void LoadClock(){
> 	int i;
> 	for (i=0;i<9;i++)
> 		cin>>clock[i];
> }
> 
> void Move(){
> 	int i,j;
> 	for (i=0;i<9;i++){
> 		temp[i]=clock[i];
> 		for (j=0;j<9;j++)
> 			temp[i] += m[j]*move[j][i];
> 		temp[i] %= 4;
> 	}
> }
> 
> bool Check(){
> 	int i;
> 	for (i=0;i<9;i++)	if (temp[i]!=0)	return false;
> 	return true;
> }
> 
> void Output(){
> 	int i,j;
> 	for (i=0;i<9;i++){
> 		if (m[i]>0)
> 			for (j=0;j<m[i];j++)
> 				cout<<i+1<<' ';
> 	}
> 	cout<<endl;
> }
> 
> 	

• 算算复杂度就知道即使过也会用几百毫秒 (22) number 2006-03-23 00:21:52
  • 你看,我这个就过了:) (1687) number 2006-03-23 00:23:51
    • 不就改了一点，为什么就能过？算了，看来rp不够好，不过算了，ac万岁，谢了。 (1886) testjoan 2006-03-23 17:25:16
      • Re:不就改了一点，为什么就能过？算了，看来rp不够好，不过算了，ac万岁，谢了。 (85) number 2006-03-23 17:33:24
        • 知道了，老师是让我们枚举的。不过我有空会试试搜索的。 (91) testjoan 2006-03-23 17:47:20
    • ls只要把break改成return 0可以时间更少 (12) zjut020 2009-03-03 16:39:45