UVa 489: Hangman Judge

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define DIGITNUM 26
#define WIN 0
#define LOSE 1
#define CHICHKENED 2

typedef struct 
{
    int ans_map[26];
    int unguess_num;
}ANS_MAP;

void mapAnswer2Array(char *answer, ANS_MAP *ans)
{
    char *tmp = answer;
    while ( *tmp != '\0')
    {
        if (ans->ans_map[*tmp - 'a'] != 1)
        {
            ans->unguess_num++;
            ans->ans_map[*tmp - 'a'] = 1;
        }
        tmp++;
    }
    printf("sum of un-guess is %d\n", ans->unguess_num);
}

int guessProcedure(ANS_MAP *ans, char *guess)
{
    char *tmp = guess;
    int wrong_num = 0;
    while(*tmp != '\0')
    {
        ans->ans_map[*tmp - 'a']--;
        if(ans->ans_map[*tmp - 'a'] == 0)
            ans->unguess_num--;
        else
            wrong_num++;
        printf("char is %c and wrong number is %d, ans unguess is %d \n", *tmp, wrong_num, ans->unguess_num);
        tmp++;
        if (wrong_num > 6)
            return LOSE;
        if(! ans->unguess_num)
            return WIN;
    }    
    return CHICHKENED;
}

int guessAnswer(char *answer, char *guess)
{
    ANS_MAP ans;
    int result = 0;
    memset(&ans.ans_map, 0, DIGITNUM * sizeof(int));
    ans.unguess_num = 0;
    // map the answer to the pre-defined struct
    mapAnswer2Array(answer, &ans);
    // guess procedure.
    result = guessProcedure(&ans, guess);
    return result;
}

int main()
{
    int rnd = 0;
    char answer[100];
    char guess[100];
    while (scanf("%d", &rnd) != EOF)
    {
        if (rnd == -1)
        {
            return 0;
        }
        int resul = 0;
        scanf("%s%s", answer, guess);
        printf("%s%s", answer, guess);
        resul = guessAnswer(answer, guess);
        printf("Round %d\n", rnd);
        if (resul == WIN)
        {
            printf("You win.\n");
        }
        else if (resul == CHICHKENED)
        {
            printf("You chickened out.\n");
        }
        else
        {
            printf("You lose.\n");
        }
    }
    return 0;
}