No.1721 [Cherry 3rd Tune N] Beautiful Number
Problem Statement
An integer $x$ is called a "beautiful integer" if the decimal representation of $x$ contains both $4,6$.
Given an integer $N$, determine whether this integer $N$ is a "beautiful integer".
Constraints
- $1 \leq N \leq 10^9$
- The input is an integer.
Input
The input is given from standard input in the following format.$N$
Output
If the integer $N$ is a "beautiful integer", print Beautiful; otherwise, print .... Do not forget the newline.
Sample
Sample 1
Input
46
Output
Beautiful
The integer $46$ contains both $4,6$, so it is a beautiful integer. Note that $46$ is the smallest beautiful integer.
Sample 2
Input
12345
Output
...
The integer $12345$ contains $4$ but does not contain $6$, so it is not a beautiful integer.
Sample 3
Input
669840
Output
Beautiful
The integer $669840$ contains both $4,6$, so it is a beautiful integer. Note that it is a beautiful integer even though $6$ appears to the left of $4$ and there are $2$ occurrences of $6$.
Sample 4
Input
7777777
Output
...
It contains neither $4$ nor $6$, so it is not a beautiful integer.
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。
Kazun
tatyam
magsta