DLU-1033 找到你了！M-I-K-U！

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
 
 
bool FindYourMiku(char **board,char *MIKU,int cur_x,int cur_y,int sizeRow,int sizeCol,int MikuStart)
{
    if(MikuStart == 4)
        return true;
    else if(cur_x<0 || cur_x>=sizeRow || cur_y<0 || cur_y>=sizeCol
        ||  board[cur_x][cur_y] != MIKU[MikuStart])
        return false;
 
    board[cur_x][cur_y] ^= 255;//mark to avoid endless loop
    bool result = ( FindYourMiku(board,MIKU,cur_x-1,cur_y,sizeRow,sizeCol,MikuStart+1)
                ||  FindYourMiku(board,MIKU,cur_x,cur_y-1,sizeRow,sizeCol,MikuStart+1)
                ||  FindYourMiku(board,MIKU,cur_x+1,cur_y,sizeRow,sizeCol,MikuStart+1)
                ||  FindYourMiku(board,MIKU,cur_x,cur_y+1,sizeRow,sizeCol,MikuStart+1) );
    board[cur_x][cur_y] ^= 255;
    return result;
}
 
bool exist(char **board,char *MIKU,int sizeRow,int sizeCol)
{
    if(sizeRow<=0)
        return false;
 
    int i,j;
    for(i = 0;i < sizeRow;i ++)
    {
        for(j = 0;j < sizeCol;j ++)
        {
            if(board[i][j] == 'M')
            {
                bool isFind = FindYourMiku(board,MIKU,i,j,sizeRow,sizeCol,0);
                //printf("GOOD
");
                if(isFind==true)
                    return true;
            }
        }
    }
    return false;
}
 
int main()
{
    int m,n;
    int i,j;
    while(~scanf("%d %d",&m,&n))
    {
        char **board = (char**)malloc(m*sizeof(char*));
        for(i = 0;i < m;i ++)
        {
            board[i] = (char*)malloc(n*sizeof(char));
        }
        getchar();
        for(i = 0;i < m;i ++)
        {
            for(j = 0;j < n;j ++)
            {
                scanf("%c",&board[i][j]);
                getchar();
            }
        }
        char MIKU[4] = {'M','I','K','U'};
        bool result = exist(board,MIKU,m,n);
        if(result==true)
            printf("mitsuketa!
");
        else
            printf("zannen
");
    }
    return 0;
}