489 - Hangman Judge

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/HackQ_sxj/article/details/88555290
#include <stdio.h>
#include <string.h>
#define maxn 100
int left, chance;
char s[maxn], s2[maxn];
int win, lose;

void guess(char ch)
{
    int bad = 1;
    for(int i = 0; i < strlen(s); i++)
        if(s[i] == ch)
    {
        left--;
        s[i] = ' ';
        bad = 0;
    }
    if(bad) --chance;
    if(!chance) lose = 1;
    if(!left) win = 1;
}

int main()
{
    int rnd;
    while(scanf("%d", &rnd) != EOF)
    {
        if(rnd == -1) break;
        scanf("%s%s", s, s2);
        printf("Round %d\n", rnd);
        win = lose = 0;
        left = strlen(s);
        chance = 7;
        for(int i = 0; i < strlen(s2); i++)
        {
            guess(s2[i]);
            if(win||lose) break;
        }
        if(win) printf("You win.\n");
        else if(lose) printf("You lose.\n");
        else printf("You chickened out.\n");
    }
    return 0;
}

猜你喜欢

转载自blog.csdn.net/HackQ_sxj/article/details/88555290