Codeforces #366(Div.2)A.Hulk【水题】
2016-08-08 08:19
459 查看
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
output
input
output
input
output
题目大意:给你一个数n,输出其循环语句。
Ac代码:
#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
{
printf("I ");
if(i%2==0)
printf("hate ");
else printf("love ");
if(i==n-1)
{
continue;
}
printf("that ");
}
printf("it\n");
}
}
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
题目大意:给你一个数n,输出其循环语句。
Ac代码:
#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
{
printf("I ");
if(i%2==0)
printf("hate ");
else printf("love ");
if(i==n-1)
{
continue;
}
printf("that ");
}
printf("it\n");
}
}
相关文章推荐
- Codeforces #366(Div.2)B.Spider Man【水题】
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) B. Verse Pattern 水题
- Codeforces #363 (Div.2) A. Launch of Collider【水题】
- codeforces #362(div.2)A.Pineapple Incident【水题】
- Codeforces #366(Div.2) C. Thor【思维】
- Codeforces Round #433 (Div.2 ) B. Maxim Buys an Apartment(水题)
- Codeforces #370(Div.2) A.Memory and Crow【水题】
- Codeforces #369(Div.2)A. Bus to Udayland【水题】
- Codeforces #364(Div.2)A.Card【贪心】【水题】
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- B. Verse Pattern(水题)
- Codeforces #380(Div.2)A.Interview with Oleg【模拟】水题
- HDU 5422 Rikka with Graph(水题)——BestCoder Round #53(div.2)
- Codeforces AIM Tech Round 3 (Div.2)A.Juicer【模拟】水题
- Codeforces #337 (Div.2)B.Vika and Squares【思维】水题
- Codeforces #374(Div.2)A. One-dimensional Japanese Crossword【模拟】水题
- 水题-Codeforces Round #369 Div.2-A
- Codeforces Aim Tech Round 3 (Div.2 )C.Letters Cyclic Shift 【贪心】水题
- Codeforces #375(Div.2)B.Text Document Analysis【模拟】水题
- Codeforces #368 (Div.2)A.Brain's Photos【水题】
- Codeforces 365(Div.2)A.Mishka and Game【水题】