PLEASE HELP ME SOLVE THIS IN PYTHON: REQUIREMENTS: Must have the application of OOP Principles (Inheritance, Polymorphism, Encapsulation, Abstration)   Scenario: Mating Game is a relationship calculating algorithm famous between the youngsters. At the time of graduation everyone might heard about this and just as the same as you, there were many of them tried out this secretly. Some took this so seriously. It uses the keyword FLAMES and described as follows: F - Friendship L - Love A - Affection M - Marriage E - Enemy S - Sister (Sibling) How we can calculate the FLAMES? It is very easy to explain with some example: Your name : Mart Baste Partner name : Cortana Get the flames count 1. Take the two names (‘Mart Baste' and 'Cortana') 2. Remove the common characters (three common characters 'a', 'r', 't') 3. Get the count of the characters that are left on each name a. Your name : m,b,s,e Count/Remaining : 4 b. Partner name : c,o,n Count/Remaining : 3 4. Get the sum of your name and partner name. So, the result is 7. Get the flames result 1. We take FLAMES letters ('F', 'L', 'A', 'M', 'E', 'S'). 2. Circularly, start counting each letter using the sum result from leftmost to rightmost. It means that you go back to the first letter of the keyword when you reach the rightmost letter of the keyword until finish counting. 3. And the letter which last the process after the counting is the result. 4. Congratulations on your mating. Be happy of the result no matter what. In our example we got your name count = 4 and partner name =3. Sum them up and it yields to 7. Then we take FLAMES keyword and start counting from left up to right in a circular manner. Continue counting going through each letter until sum is used up. So, the result is 'Friend'. NOTE : If the result of sum is 0, print “Not compatible! Single forever 3”

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

PLEASE HELP ME SOLVE THIS IN PYTHON:

REQUIREMENTS: Must have the application of OOP Principles (Inheritance,
Polymorphism, Encapsulation, Abstration)

 

Scenario:

Mating Game is a relationship calculating algorithm famous between the youngsters. At the
time of graduation everyone might heard about this and just as the same as you, there were
many of them tried out this secretly. Some took this so seriously. It uses the keyword FLAMES
and described as follows:


F - Friendship
L - Love
A - Affection
M - Marriage
E - Enemy
S - Sister (Sibling)

How we can calculate the FLAMES?
It is very easy to explain with some example:


Your name : Mart Baste
Partner name : Cortana


Get the flames count
1. Take the two names (‘Mart Baste' and 'Cortana')
2. Remove the common characters (three common characters 'a', 'r', 't')
3. Get the count of the characters that are left on each name
a. Your name : m,b,s,e Count/Remaining : 4
b. Partner name : c,o,n Count/Remaining : 3
4. Get the sum of your name and partner name. So, the result is 7.
Get the flames result
1. We take FLAMES letters ('F', 'L', 'A', 'M', 'E', 'S').
2. Circularly, start counting each letter using the sum result from leftmost to
rightmost. It means that you go back to the first letter of the keyword when you
reach the rightmost letter of the keyword until finish counting.
3. And the letter which last the process after the counting is the result.
4. Congratulations on your mating. Be happy of the result no matter what.
In our example we got your name count = 4 and partner name =3. Sum them
up and it yields to 7. Then we take FLAMES keyword and start counting from
left up to right in a circular manner. Continue counting going through each letter
until sum is used up.
So, the result is 'Friend'.
NOTE : If the result of sum is 0, print “Not compatible! Single forever </3”

Sample #3:
Your name
Jeston
: Josten
Your name remaining
Crush name
Crush name remaining
Count remaining [your name]
: 0
Count remaining [crush]
: 0
Sum
: 0
Relationship
: Not Compatible
Transcribed Image Text:Sample #3: Your name Jeston : Josten Your name remaining Crush name Crush name remaining Count remaining [your name] : 0 Count remaining [crush] : 0 Sum : 0 Relationship : Not Compatible
Programmer's Task:
Develop an android application that does the specifications as prescribe above:
Sample #1:
Your name
Crush name
Your name remaining
Crush name remaining
Count remaining [your name]
Count remaining [crush]
: Martzel Baste
: Cortana
: mzelbse
con
: 7
: 3
Sum
: 10
Relationship
: Marriage
Sample #2:
Your name
Ann
: Кyle
Your name remaining
Crush name remaining
Crush name
: ann
: kyle
Count remaining [your name]
Count remaining [crush]
Sum
Relationship
: 3
: 4
: 7
: Friendship
Sample #3:
Transcribed Image Text:Programmer's Task: Develop an android application that does the specifications as prescribe above: Sample #1: Your name Crush name Your name remaining Crush name remaining Count remaining [your name] Count remaining [crush] : Martzel Baste : Cortana : mzelbse con : 7 : 3 Sum : 10 Relationship : Marriage Sample #2: Your name Ann : Кyle Your name remaining Crush name remaining Crush name : ann : kyle Count remaining [your name] Count remaining [crush] Sum Relationship : 3 : 4 : 7 : Friendship Sample #3:
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
Class
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.
Similar questions
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