poj1166学习中

#include <iostream>
#include <string.h>
#include <cstdio>
#include <cmath>
using namespace  std;
int clock[10],ans;
int temp[10],step[10];
int turn[9][9]=
{
    {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}
};
void dfs(int value,int deep)
{
   if(deep==9)
    {
        bool ok=true;
       for(int i=0;i<9;i++)
       {
            if(clock[i]%4!=0)
           {
               ok=false;
              break;
            }
       }
       if(ok)
       {
           if(ans>value)
           {
                ans=value;
                memcpy(step,temp,sizeof(step));
           }
       }
        return;
    }
   for(int i=0;i<4;i++)
   {
       temp[deep]=i;
        for(int j=0;j<9;j++)
          clock[j]=(clock[j]+turn[deep][j]*i)%4;
       dfs(i+1,deep+1);
      for(int j=0;j<9;j++)
          clock[j]=(clock[j]-turn[deep][j]*i)%4;
   }
}
int main()
{
    for(int i=0; i<9; i++)
   {
        scanf("%d",&clock[i]);
   }
   ans=100000;
   dfs(0,0);
    bool ok=true;
   for(int i=0;i<9;i++)
   {
       while(step[i]--)
       {
          if(ok)
           {
               printf("%d",i+1);
               ok=false;
           }
           else printf(" %d",i+1);
        }
   }
    printf("\n");
}