#AT1073. A - Shiritori
A - Shiritori
当前没有测试数据。
A - Shiritori
Score : $100$ points
Problem Statement
You are given three strings $A$, $B$ and $C$. Check whether they form a word chain.
More formally, determine whether both of the following are true:
- The last character in $A$ and the initial character in $B$ are the same.
- The last character in $B$ and the initial character in $C$ are the same.
If both are true, print YES
. Otherwise, print NO
.
Constraints
- $A$, $B$ and $C$ are all composed of lowercase English letters (
a
-z
). - $1 ≤ |A|, |B|, |C| ≤ 10$, where $|A|$, $|B|$ and $|C|$ are the lengths of $A$, $B$ and $C$, respectively.
Input
Input is given from Standard Input in the following format:
Output
Print YES
or NO
.
rng gorilla apple
YES
They form a word chain.
yakiniku unagi sushi
NO
$A$ and $B$ form a word chain, but $B$ and $C$ do not.
a a a
YES
aaaaaaaaab aaaaaaaaaa aaaaaaaaab
NO