No.1155 Nada Picnic
Problem Statement
Every year in November (month $11$), Nada School goes on a school excursion.
Given an integer $N$, output the place that Nada School's $75$th class visited on the excursion when they were in year $N$ of junior high school.
Here, assume that each excursion went to a single place (in reality, multiple places were visited on one excursion).
Input
$N $
$N$ is an integer.
$1 \leq N \leq 3$
Output
Output the answer on $1$ line.
Print a newline at the end.
Sample
Sample 1
Input
1
Output
Shiitakerando
At the buffet lunch, some people were playing around by burning disposable chopsticks.
That's dangerous.
Sample 2
Input
2
Output
Otsukakokusaibijutsukan
This excursion was the first time the problem writer went to the Shikoku region.
Sample 3
Input
3
Output
Spring-8
It was surprising to see researchers getting around by bicycle in what looked like a big circular lab.
Source
Nada School 75th Class Junior High Graduation Commemorative Contest: Nada Picnic
writer: Mitsubachi
tester: Mitarushi
Ported in accordance with HackerRank's terms. Some parts have been modified.
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。
蜜蜂