L. Problem L is the Only Lovely Problem (子串判断) 2020牛客暑期多校训练营（第三场）

传送门

思路：

• 题意：只要S的开头是 “lovely”(不区分大小写)， 那么这个字符串就是lovely，否则就是ugly。
• 自己遍历开头6个字符判断是否是lovely即可。

代码实现：

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9 + 7;
const int  N = 2e5 + 5;

string s, a = "LOVELY", b = "lovely";

signed main()
{
    IOS;

    cin >> s;
    int cnt = 0;
    for(int i = 0; i < 6; i ++)
        if(s[i] == a[i] || s[i] == b[i]) cnt ++;
    if(cnt == 6) cout << "lovely" << endl;
    else cout << "ugly" << endl;

    return 0;
}