码迷,mamicode.com
首页 > 编程语言 > 详细

【打CF,学算法——一星级】Codeforces 705A Hulk

时间:2016-08-08 11:06:30      阅读:520      评论:0      收藏:0      [点我收藏+]

标签:

CF简介

题目链接:705A


题面:

A. Hulk
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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

题意:

     照样例奇偶数输出即可。


解题:

    注意最后一个是it,中间是that。


代码:

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<n;i++)
	{
        if(i%2)
          cout<<"I hate that ";
        else
          cout<<"I love that ";
	}
	if(n%2)
	  cout<<"I hate it";
    else
      cout<<"I love it";
	cout<<endl;
	return 0;
}



【打CF,学算法——一星级】Codeforces 705A Hulk

标签:

原文地址:http://blog.csdn.net/david_jett/article/details/52148900

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!