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
简单的水题:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
char s1[]={"I hate that"};
char s2[]={"I love that"};
char s3[]={"I hate it"};
char s4[]={"I love it"};
int n,m,i,j,k,l;
while(scanf("%d",&n)!=EOF)
{
m=n%2;
k=n/2;
if(m==1)
{
for(i=0;i<k;i++)
printf("%s %s ",s1,s2);
printf("%s",s3);
printf("\n");
}
else if(m==0)
{
for(i=0;i<k-1;i++)
printf("%s %s ",s1,s2);
printf("%s %s",s1,s4);
printf("\n");
}
}
return 0;
}