“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 …
#include<stdio.h>
int main(void) {
int i = 1;
char ch1[11], ch2[11], ch3[11];
do {
if (i == 2)
scanf("%s", &ch1);
else {
if (i == 14)
scanf("%s", &ch2);
else
scanf("%s", &ch3);
}
; if (ch3[0] == '.'||ch2[0]=='.'||ch1[0]=='.')
break;
i++;
} while (ch3[0] != '.' || ch2[0] != '.' || ch1[0] != '.');
if (i < 3)
printf("Momo... No one is for you ...");
if (i >= 3 && i < 15)
printf("%s is the only one for you...", ch1);
if (i >= 15)
printf("%s and %s are inviting you to dinner...", ch1, ch2);
return 0;
}