PAT 天梯赛 L1-035. 情人节 【水】

题目链接

https://www.patest.cn/contests/gplt/L1-035

AC代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#include <ctype.h>
#include <numeric>
#include <sstream>
using namespace std;
typedef long long LL;
const double PI = 3.14159265358979323846264338327;
const double E = 2.718281828459;
const double eps = 1e-6;
const int MAXN = 0x3f3f3f3f;
const int MINN = 0xc0c0c0c0;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;
int main()
{
    string s, l = "#", r = "#";
    int i;
    for (i = 1; ; i++)
    {
        cin >> s;
        if (s == ".")
            break;
        if (i == 2)
            l = s;
        if (i == 14)
            r = s;
    }
    if (i > 14)
        cout << l << " and " << r << " are inviting you to dinner...\n";
    else if (i > 2)
        cout << l << " is the only one for you...\n";
    else
        cout << "Momo... No one is for you ...\n";
}