• poj2328简单模拟


    #include<iostream>
    using namespace std;


    int main()
    {
    char str1[10];
    char str2[10];
    char ch;
    int turn;
    int tempint;
    int i;
    int guess[2];//0代表左边那个,1代表右边那个
    while(1)
    {
    guess[0]=0;
    guess[1]=11;
    while(1)
    {
    cin>>tempint;
       if(!tempint)return 0;
    cin>>str1;
    cin>>str2;
    if(strcmp(str1,"too")==0)
    {
    if(strcmp(str2,"high")==0)
    {
    if(tempint<=guess[0])
    {
    guess[1]=tempint;
    continue;
    }
    else
    {
    if(tempint<guess[1])
    guess[1]=tempint;
    continue;
    }


    }


    else//too low
    {
    if(tempint>=guess[1])
    {
    guess[0]=tempint;
    continue;
    }
    else
    {
    if(tempint>guess[0])
    guess[0]=tempint;
    continue;
    }
    }//else//too low
    }//too 


    else//right on
    {
    if(tempint<guess[1]&&tempint>guess[0])
    {
    cout<<"Stan may be honest"<<endl;
       break;
    }
    else
    {
    cout<<"Stan is dishonest"<<endl;
       break;
    }
    }


    // cout<<str1<<" "<<str2<<endl;
    }//while(1)
    }//while(1)
    return 0;
    }
  • 相关阅读:
    优先队列
    BFS和图的最短路径 279,127,126
    opencv常用函数
    图形图像概念
    缓存
    主板
    显卡
    cpu
    vs配置opencv(只需一次)
    附加依赖项、库目录、包含目录
  • 原文地址:https://www.cnblogs.com/bester/p/3255773.html
Copyright © 2020-2023  润新知