zoukankan      html  css  js  c++  java
  • [C++]猜词游戏简版

    #include "pch.h"
    #include <iostream>
    #include <string>
    #include <cstdlib>
    #include <ctime>
    using namespace std;
    const  int NUM = 26;
    const string wordlist[NUM] = { "apiary","beetle","cereal",
    "danger","ensign","florid","garage","health","insult",
    "jackal","keeper","loaner","manage","nonce","onset",
    "plaid","quilt","remote","stolid","train","useful",
    "valid","whence","xenon","yearn","zippy" };
    int main(void) {
        srand(time(0));
        char play;
        cout << "Will you play a word game? <y/n> ";
        cin >> play;
        while (play=='y')
        {
            string target = wordlist[rand() % NUM];
            int length = target.length();
            string attempt(length, '-');
            string badchars;
            int guesses = 6;
            cout << "Guess my secret word. It has " << length << " letters, and you guess
    " << "one letter at a time. You get " << guesses << " wrong guesses.
    ";
            cout << "Your word: " << attempt << endl;
            while (guesses>0&&attempt!=target)
            {
                char letter;
                cout << "Guess a letter: ";
                cin >> letter;
                if (badchars.find(letter) != string::npos || attempt.find(letter) != string::npos) {
                    cout << "You already guessed that. Try again.
    ";
                    continue;
                }
                int loc = target.find(letter);
                if (loc == string::npos) {
                    cout << "Oh, bad guess!
    ";
                    --guesses;
                    badchars += letter;
                }
                else {
                    cout << "Good guess!
    ";
                    attempt[loc] = letter;
                    loc = target.find(letter, loc + 1);
                    while (loc!=string::npos)
                    {
                        attempt[loc] = letter;
                        loc = target.find(letter, loc + 1);
                    }
                }
                cout << "Your word: " << attempt << endl;
                if (attempt != target) {
                    if (badchars.length() > 0)
                        cout << "Bad choices: " << badchars << endl;
                    cout << guesses << " bad guesses left
    ";
                }
            }
            if (guesses > 0)
                cout << "That's right!
    ";
            else
                cout << "Sorry, the word is " << target << ".
    ";
            cout << "Will you play another? <y/n> ";
            cin >> play;
            play = tolower(play);
        }
        cout << "Bye!
    ";
        return 0;
    }
  • 相关阅读:
    [转] MathType的灵活运用
    [zz] 模式识别,计算机视觉领域,期刊
    SQL语句 合并列值 将一列的多个值合并成一行
    目标板识别为U盘
    android 事件传递机制
    linux有关文件权限的命令
    linux中的jiffies变量
    分析Android 根文件系统启动过程(init守护进程分析)
    2010年暂订读书目录
    Android Power Management
  • 原文地址:https://www.cnblogs.com/lightmonster/p/10467365.html
Copyright © 2011-2022 走看看