CodeForces 705A Hulk

水题。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-8;
void File()
{
    freopen("D:\in.txt","r",stdin);
    freopen("D:\out.txt","w",stdout);
}
inline int read()
{
    char c = getchar();  while(!isdigit(c)) c = getchar();
    int x = 0;
    while(isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); }
    return x;
}

int main()
{
    int n;scanf("%d",&n);
    if(n==1) { printf("I hate it
"); return 0; }
    if(n==2) { printf("I hate that I love it
"); return 0; }
    for(int i=1;i<=n;i++)
    {
        if(i%2==1) printf("I hate ");
        else printf("I love ");
        if(i<n) printf("that ");
    }
    printf("it
");
    return 0;
}