poj1166

爆搜就可以过，不过我用了迭代加深。

注意每个操作最多进行4次

#include <cstdio>
#include <cstdlib>
using namespace std;

#define MAX_ANS 100

int clock[];
char move[][] = {"ABDE", "ABC", "BCEF", "ADG", "BDEFH", "CFI", "DEGH", "GHI", "EFHI"};
int ans[MAX_ANS], ans_num;

void input()
{
    for (int i = ; i < ; i++)
        scanf("%d", &clock[i]);
}

void output()
{
    printf("%d", ans[]);
    for (int i = ; i < ans_num; i++)
        printf(" %d", ans[i]);
    putchar('\n');
}

bool ok()
{
    for (int i = ; i < ; i++)
        if (clock[i])
            return false;
    return true;
}

void make(char* move, int value)
{
    for (int i = ; move[i]; i++)
    {
        int index = move[i] - 'A';
        clock[index] = (clock[index] + value + ) % ;
    }
}

void dfs(int step, int limit, int move_index)
{
    if (step > limit)
        return;
    if (ok())
    {
        output();
        exit();
    }
    for (int i = move_index; i < ; i++)
    {
        for (int j = ; j < ; j++)
        {
            make(move[i], );
            ans[ans_num++] = i + ;
            dfs(step + , limit, i + );
        }
        ans_num -= ;
        make(move[i], -);
    }
}

int main()
{
    input();
    for (int i = ; i < ; i++)
    {
        ans_num = ;
        dfs(, i, );
    }
    return ;
}