zoukankan      html  css  js  c++  java
  • Alex and broken contest CodeForces

    /*
        Name:
        Copyright:
        Author:
        Date: 2018/5/2 10:45:16
        Description:
        要求出现一个朋友的名字,仅一次 
    */
    #include <iostream>
    #include <cstdio>
    #include <string> 
    using namespace std;
    int main()
    {
    //    freopen("in.txt", "r", stdin);
        string fname1 = "Danil";
        string fname2 = "Olya";
        string fname3 = "Slava";
        string fname4 = "Nikita";
        string fname5 = "Ann";
        string str;
        while (cin>>str) {
            int flag = 0;
            if (str.find(fname1) != -1) {
                int pos = 0;
                string tmp = str;
                while ((pos = tmp.find(fname1)) != -1) {
                    flag ++;
                    tmp = tmp.substr(pos + 1);
                    if (flag >= 2) break;
                }
            } 
            if (str.find(fname2) != -1) {
                int pos = 0;
                string tmp = str;
                while ((pos = tmp.find(fname2)) != -1) {
                    flag ++;
                    tmp = tmp.substr(pos + 1);
                    if (flag >= 2) break;
                }
            } 
            if (str.find(fname3) != -1) {
                int pos = 0;
                string tmp = str;
                while ((pos = tmp.find(fname3)) != -1) {
                    flag ++;
                    tmp = tmp.substr(pos + 1);
                    if (flag >= 2) break;
                }
            } 
            if (str.find(fname4) != -1) {
                int pos = 0;
                string tmp = str;
                while ((pos = tmp.find(fname4)) != -1) {
                    flag ++;
                    tmp = tmp.substr(pos + 1);
                    if (flag >= 2) break;
                }
            } 
            if (str.find(fname5) != -1) {
                int pos = 0;
                string tmp = str;
                while ((pos = tmp.find(fname5)) != -1) {
                    flag ++;
                    tmp = tmp.substr(pos + 1);
                    if (flag >= 2) break;
                }
            } 
            if (flag == 1) {
                cout<<"YES"<<endl;
            } else {
                cout<<"NO"<<endl;
            }
        }
        return 0;
    }
  • 相关阅读:
    第二阶段个人冲刺总结01
    软件工程学习进度表13
    软件工程学习进度表12
    个人博客(09)
    个人博客(07)
    个人博客(08)
    poj1562 DFS入门
    poj3278 BFS入门
    数组单步运算
    十天冲刺
  • 原文地址:https://www.cnblogs.com/slothrbk/p/8979271.html
Copyright © 2011-2022 走看看