题目描述:
以上是朋友圈中一奇葩贴:“2月14情人节了,我决定造福大家。第2个赞和第14个赞的,我介绍你俩认识…………咱三吃饭…你俩请…”。现给出此贴下点赞的朋友名单,请你找出那两位要请客的倒霉蛋。
输入格式:
输入按照点赞的先后顺序给出不知道多少个点赞的人名,每个人名占一行,为不超过10个英文字母的非空单词,以回车结束。一个英文句点“.”标志输入的结束,这个符号不算在点赞名单里。
输出格式:
根据点赞情况在一行中输出结论:若存在第2个人A和第14个人B,则输出“A and B are inviting you to dinner...”;若只有A没有B,则输出“A is the only one for you...”;若连A都没有,则输出“Momo... No one is for you ...”。
输入样例1:
GaoXZh
Magi
Einst
Quark
LaoLao
FatMouse
ZhaShen
fantacy
latesum
SenSen
QuanQuan
whatever
whenever
Potaty
hahaha
.
输出样例1:
Magi and Potaty are inviting you to dinner...
输入样例2:
LaoLao
FatMouse
whoever
.
输出样例2:
FatMouse is the only one for you...
输入样例3:
LaoLao
.
输出样例3:
Momo... No one is for you ...
两个string 第一个保存第二个点赞 第二个保存第十四个点赞的,然后根据情况输出相应的结果
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
string s;
cin>>s;
int gs=0;
int flag1=0;
int flag2=0;
string name1;
string name2;
while(s!="."){
gs++;
if(gs==2){
flag1=1;
name1=s;
}
if(gs==14){
flag2=1;
name2=s;
}
cin>>s;
}
if(flag1&&flag2)
cout<<name1<<" and "<<name2<<" are inviting you to dinner..."<<endl;
else if(flag1&&!flag2)
cout<<name1<<" is the only one for you..."<<endl;
else if(!flag1)
cout<<"Momo... No one is for you ..."<<endl;
return 0;
}