The annual snake festival is upon us and all the snakes of the kingdom have gathered to participate in the parade. The chef was tasked with reporting on the parade, so he decided to watch all the snakes first. When he sees the snake first, it will be his head, so he marks the "H". Snakes are long, and when they see the snake finally scurry away, they mark its tail with a "T". In the interim, when the snake is moving around it, or in the time between one snake and the next snake, it marks a '.'.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Note: C++ Programming Answer Required
The annual snake festival is upon us and all the snakes of the kingdom have
gathered to participate in the parade. The chef was tasked with reporting on the
parade, so he decided to watch all the snakes first. When he sees the snake first, it
will be his head, so he marks the "H". Snakes are long, and when they see the
snake finally scurry away, they mark its tail with a "T". In the interim, when the
snake is moving around it, or in the time between one snake and the next snake, it
marks a '.'.
Since the snakes come in a procession and one by one, a valid message would be
something like "..H..T...HTH....T.", or "...", or "HT", while "T ...H..H.T", "H..T..H",
"H..H..T..T" would be invalid messages (see explanation below).
Formally, a snake is represented by an 'H' followed by some (possibly null) '.' and
then 'T'. A valid message is one that begins with the (probably zero-length) string
'.' and then some (possibly zero) snakes, with some '.'s in between, and finally
some (possibly zero) '.'s.
The chef was devouring the festival food and was very sleepy. So his message
may be invalid. You have to help him find out if his message is valid or not.
Possible input
1
18
..H..T...HTH....T.
Required Output
Valid
Transcribed Image Text:Note: C++ Programming Answer Required The annual snake festival is upon us and all the snakes of the kingdom have gathered to participate in the parade. The chef was tasked with reporting on the parade, so he decided to watch all the snakes first. When he sees the snake first, it will be his head, so he marks the "H". Snakes are long, and when they see the snake finally scurry away, they mark its tail with a "T". In the interim, when the snake is moving around it, or in the time between one snake and the next snake, it marks a '.'. Since the snakes come in a procession and one by one, a valid message would be something like "..H..T...HTH....T.", or "...", or "HT", while "T ...H..H.T", "H..T..H", "H..H..T..T" would be invalid messages (see explanation below). Formally, a snake is represented by an 'H' followed by some (possibly null) '.' and then 'T'. A valid message is one that begins with the (probably zero-length) string '.' and then some (possibly zero) snakes, with some '.'s in between, and finally some (possibly zero) '.'s. The chef was devouring the festival food and was very sleepy. So his message may be invalid. You have to help him find out if his message is valid or not. Possible input 1 18 ..H..T...HTH....T. Required Output Valid
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY