Codeforces Round #366 (Div. 2) A. Hulk （简单模拟）

题目链接

给出一个n表示，说n次，说话的规律是第一次I hate ,第二次是 I love
判断奇偶输出

#include<bits/stdc++.h>using namespace std;#define cl(a,b) memset(a,b,sizeof(a))#define LL long long#define pb push_back#define gcd __gcd#define For(i,j,k) for(int i=(j);i<k;i++)#define lowbit(i) (i&(-i))#define _(x) printf("%d\n",x)const int maxn = 1e3+10;const int inf  = 1 << 28;int main(){    int n;    cin>>n;    if(n==1){        cout<<"I hate it"<<endl;return 0;    }    if(n%2==0){        for(int i=0;i<max(n-2,0)/2;i++){            cout<<"I hate that I love that ";        }        cout<<"I hate that I love it"<<endl;    }    else {        for(int i=0;i<n/2;i++){            cout<<"I hate that I love that ";        }        cout<<"I hate it"<<endl;    }    return 0;}