HDU 1997 hanio

汉诺塔大家都懂的。。。

#include <stdio.h>
#include <string.h>

int h[3][64], tail[3], head[3];
bool hanio(int floor, int from, int to, int mid)
{
    if(floor == 0)
        return true;
    int at=-1;
    for(int i=0; i<3; i++)
        if(h[i][ head[i] ] == floor)
        {
            at = i;
            break;
        }
    if(at == -1 || at == mid)
        return false;
    head[ at ] ++;
    if(at == from)
        hanio(floor-1, from, mid, to);
    else if(at == to)
        hanio(floor-1, mid, to, from);
}

int main()
{
    int t, n;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        memset(tail, 0, sizeof(tail));
        memset(head, 0, sizeof(head));
        for(int i=0; i<3; i++)
        {
            scanf("%d", &tail[i]);
            for(int j=0; j<tail[i]; j++)
                scanf("%d", &h[i][j]);
        }
        printf(hanio(n, 0, 2, 1)?"true\n":"false\n");
    }
    return 0;
}