zoukankan      html  css  js  c++  java
  • C# 猜数字

    int number = new Random().Next(1, 101);
    Console.WriteLine("请输入一个1到100的数字!答案是:" + number.ToString());            
    int InputNumber = int.Parse(Console.ReadLine());
    int min = 1; int max = 100;
    while(number != InputNumber)
    {
        if (InputNumber <min || InputNumber > max)
        {
            Console.WriteLine(string.Format("输入不正确!请输入{0}到{1}", min.ToString(), max.ToString()));
            InputNumber = int.Parse(Console.ReadLine());
        }
        else if (InputNumber > number)
        {
            if (InputNumber > max)
            {
                Console.WriteLine(string.Format("输入不正确!请输入{0}到{1}", min.ToString(), max.ToString()));
                InputNumber = int.Parse(Console.ReadLine());
            }
            else
            {
                max = InputNumber;
                Console.WriteLine(string.Format("请输入{0}到{1}", min.ToString(), max.ToString()));
                InputNumber = int.Parse(Console.ReadLine());
            }
        }
        else if (InputNumber < number)
        {
            if (InputNumber < min)
            {
                Console.WriteLine(string.Format("输入不正确!请输入{0}到{1}", min.ToString(), max.ToString()));
                InputNumber = int.Parse(Console.ReadLine());
            }
            else
            {
                min = InputNumber;
                Console.WriteLine(string.Format("请输入{0}到{1}", min.ToString(), max.ToString()));
                InputNumber = int.Parse(Console.ReadLine());
            }
        }
        else
        {
            Console.WriteLine("你猜对了");
            break;
        }
    }
    
  • 相关阅读:
    BZOJ1556 墓地秘密
    [NOI2006]网络收费
    UVA11401 Triangle Counting
    UVA11538 Chess Queen
    BZOJ2560 串珠子
    BZOJ4057 [Cerc2012]Kingdoms
    [HNOI2012] 集合选数
    [Haoi2016]字符合并
    [Snoi2013]Quare
    洛谷平衡树模板总结
  • 原文地址:https://www.cnblogs.com/geass/p/2048683.html
Copyright © 2011-2022 走看看