UVA - 489 Hangman Judge 【模拟】

最新推荐文章于 2020-09-04 00:22:42 发布

牧心.

最新推荐文章于 2020-09-04 00:22:42 发布

阅读量3.3w

点赞数 3

分类专栏： ACM练习

本文链接：https://blog.csdn.net/Aibiabcheng/article/details/105479768

版权

ACM练习专栏收录该内容

219 篇文章 22 订阅

订阅专栏

Description

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int main() {
    char str[100],s[100];
    int t;
    int lenstr, lens;
    while (scanf("%d", &t) != EOF && t != -1) {
        scanf("%s %s", str, s);
        lenstr = strlen(str);
        lens = strlen(s);

        int n = 0, j, i, m = lenstr-1;
        int flag = 0;

        for (i = 0; i < lens; i++) {
            flag = 1;
            for (j = 0; j < lenstr; j++) {
                if (s[i] == str[j]) {
                    flag = 0;
                    str[j] = '#';
                    m--;
                }
            }
            if (1 == flag && j >= lenstr)
                n++;
            if (n > 6 || m < 0)
                break;
        }

        printf("Round %d\n", t);
        if (n <= 6 && m < 0)
            printf("You win.\n");
        else if (n > 6)
            printf("You lose.\n");
        else
            printf("You chickened out.\n");
    }

    return 0;
}