A - Glutton Takahashi
Problem Statement
Takahashi is planning to eat N dishes.
The ii-th dish he plans to eat is sweet if Si= sweet
, and salty if Si= salty
.
If he eats two sweet dishes consecutively, he will feel sick and be unable to eat any more dishes.
Determine whether he can eat all the dishes.
Constraints
- N is an integer between 1 and 100, inclusive.
- Each Si is
sweet
orsalty.
Input
The input is given from Standard Input in the following format:
N S1 S2 ⋮ SN
Output
Print Yes
if Takahashi can eat all the dishes, and No
otherwise.
题目链接:https://atcoder.jp/contests/abc364/tasks/abc364_a
题意讲解:
这道题是说这个人不能连续两次吃到甜品,如果他连续两次吃到甜品的话,他就不能再吃了,需要注意的是,如果他是最后一次吃到甜品的,那么他还是可以将所有的甜品都吃完的
代码实现:
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int main()
{
int N; cin>>N;
vector<string> S(N);
for(int i=0;i<N;i++)
{
cin>>S[i];
}
for(int i=1;i<N-1;i++)
{
if(S[i]=="sweet" && S[i-1]=="sweet")
{
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
}