Both players have to make substrings using the letters of the string S. Stuart has to make words starting with consonants. Kevin has to make words starting with vowels. The game ends when both players have made all possible substrings. Scoring A player gets +1 point for each occurrence of the substring in the string S. For Example String S = BANANA Kevin's vowel beginning word ANA Here. ANA occurs twice in BANANA. Hence, Kevin will get 2 Points. For better understanding see the image below. BANANA STUART KEVIN

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Computer science  Cs 102

Both players are given the same string. S.
Both players have to make substrings using the letters of the string S.
Stuart has to make words starting with consonants.
Kevin has to make words starting with vowels.
The game ends when both players have made all possible substrings.
Scoring
A player gets +1 point for each occurrence of the substring in the string S.
For Example:
String S = BANANA
Kevin's vowel beginning word = ANA
Here, ANA occurs twice in BANANA. Hence, Kevin will get 2 Points.
For better understanding, see the image below:
BANANA
STUART
KEVIN
WORDS
SCORE
WORDS
SCORE
2.
AN
2
BA
ANA
2
NA
ANAN
BAN
ANANA
NAN
BANA
NANA
BANAN
BANANA
ТОTAL
12
TOTAL
Your task is to determine the winner of the game and their score.
Function Description
Complete the minion game in the editor below.
minion_game has the following parameters:
• sring string the string to analyze
Prints
• tring: the winner's name and score, separated by a space on one line, or Dr aw if there is no winner
Input Format
A single line of input containing the string S.
Note: The string S will contain only uppercase letters: [A – Z].
Constraints
O len(S) < 10
Sample Input
BANANA
Sample Output
Stuart 12
Transcribed Image Text:Both players are given the same string. S. Both players have to make substrings using the letters of the string S. Stuart has to make words starting with consonants. Kevin has to make words starting with vowels. The game ends when both players have made all possible substrings. Scoring A player gets +1 point for each occurrence of the substring in the string S. For Example: String S = BANANA Kevin's vowel beginning word = ANA Here, ANA occurs twice in BANANA. Hence, Kevin will get 2 Points. For better understanding, see the image below: BANANA STUART KEVIN WORDS SCORE WORDS SCORE 2. AN 2 BA ANA 2 NA ANAN BAN ANANA NAN BANA NANA BANAN BANANA ТОTAL 12 TOTAL Your task is to determine the winner of the game and their score. Function Description Complete the minion game in the editor below. minion_game has the following parameters: • sring string the string to analyze Prints • tring: the winner's name and score, separated by a space on one line, or Dr aw if there is no winner Input Format A single line of input containing the string S. Note: The string S will contain only uppercase letters: [A – Z]. Constraints O len(S) < 10 Sample Input BANANA Sample Output Stuart 12
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Introduction to computer system
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education