Hulk（cf705A）（水）

A. Hulk
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Dr. Bruce Banner hates his enemies (like others don’t). As we all know, he can barely talk when he turns into the incredible Hulk. That’s why he asked you to help him to express his feelings.

Hulk likes the Inception so much, and like that his feelings are complicated. They have n layers. The first layer is hate, second one is love, third one is hate and so on…

For example if n = 1, then his feeling is “I hate it” or if n = 2 it’s “I hate that I love it”, and if n = 3 it’s “I hate that I love that I hate it” and so on.

Please help Dr. Banner.

Input
The only line of the input contains a single integer n (1 ≤ n ≤ 100) — the number of layers of love and hate.

Output
Print Dr.Banner’s feeling in one line.

Examples
input
1
output
I hate it
input
2
output
I hate that I love it
input
3
output
I hate that I love that I hate it

题意：if n = 1, 他的心情就是 “I hate it” ， if n = 2 就是 “I hate that I love it”, if n = 3 就是 “I hate that I love that I hate it” 以此类推.

题解：这道题比较水，直接看代码吧。需要注意的一点是，除了最后一个是it，其他中间的连接词都是that

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
using namespace std;
string s[4] = {"I hate ", "it", "I love ", "that "};

int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        if (i % 2) {
            cout << s[0];
        } else {
            cout << s[2];
        }
        if (i != n) {
            cout << s[3];
        } else {
            cout << s[1];
        }
    }
    return 0;
}