2020牛客暑期多校训练营（第三场）L、Problem L is the Only Lovely Problem （签到题）

题目链接

题面：

题意：
判断一个字符串是不是以 $lovely$ 开头，忽略大小写。

题解：
签到题。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#define ui unsigned int
#define ll long long
#define llu unsigned ll
#define ld long double
#define pr make_pair
#define pb push_back
#define lc (cnt<<1)
#define rc (cnt<<1|1)
#define tmid ((l+r)>>1)
using namespace std;

const int inf=0x3f3f3f3f;
const ll lnf=0x3f3f3f3f3f3f3f3f;
const double dnf=1e18;
const int mod=998244353;
const double eps=1e-8;
const double pi=acos(-1.0);
const int hp=13331;
const int maxn=100100;
const int maxp=1100;
const int maxm=100100;
const int up=100000;

char str[maxn];

int main(void)
{
    scanf("%s",str+1);
    if((str[1]=='l'||str[1]=='L')&&(str[2]=='o'||str[2]=='O')&&(str[3]=='v'||str[3]=='V')&&(str[4]=='e'||str[4]=='E')&&(str[5]=='l'||str[5]=='L')&&(str[6]=='y'||str[6]=='Y'))
        printf("lovely\n");
    else printf("ugly\n");
    return 0;
}