练习一下,容器vector和string类的用法;
题意:字符串匹配,且只出现一次;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<string> s;
int main()
{
s.push_back("Danil");
s.push_back("Olya");
s.push_back("Slava");
s.push_back("Ann");
s.push_back("Nikita");
string a;
cin>>a;
int ans=0;
for(int i=0;i<5;i++)
{
if(a.find(s[i])!=a.npos)
{
ans++;
if(a.rfind(s[i])!=a.find(s[i]))
ans++;
}
}
if(ans==1)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}