FLAMES Game

FLAMES Game  

Problem:

FLAMES game is a relationship calculating game. Letters in FLAMES stand for, 

F - FRIENDS 

L - LOVER 

A - AFFECTION 

M - MARRIAGE 

E - ENEMY 

S - SIBLING 

Calculation Logic - FLAMES: 

1. Get two names S1 and S2. 

2. Remove the common characters in both the names. 

3. Find the count of the characters that are left, the count is called FLAMES count FC. 

4. Consider FLAMES letters ('F', 'L', 'A', 'M', 'E', 'S') and start removing the letters in a circular manner using the FC. 

5. The letter which is finally left desides the output, 

If it's F - FRIENDS L - LOVER A - AFFECTION M - MARRIAGE E - ENEMY S - SIBLING 

Input Format: 

First line contains S1 Second line contains S2 

Output Format: 

First line contains FLAMES relationship in uppercase. 

Boundary Conditions: 

2 <= S1, S2 <= 100 

Example Input/Output 1: 

Input: 

raja 

rani 

Output: 

ENEMY 

Example Input/Output 2: 

Input: 

waffles 

bright 

Output: 

AFFECTION

Program:

s = input().strip().lower()

t = input().strip().lower()

a = list(s)

b = list(t)

for i in s: 

    if i in t:

        if i in a and i in b:

            a.remove(i)

            b.remove(i) 

leng = len(a) + len(b) 

flames = list("FLAMES")

while len(flames) > 1:

    pos = leng%len(flames)

    if pos == 0: 

        pos = len(flames)

    flames = flames[pos:] + flames[:pos-1] 

l = ["FRIENDS","LOVER","AFFECTION","MARRIAGE","ENEMY","SIBLING"] 

for i in l:

    if i[0] == flames[0]:

        print(i)

        break

Comments

Post a Comment

Popular posts from this blog

Pronic Integers in N - InfyTQ question

Pronic Integers in N - InfyTQ question Problem:  The program must accept an integer N as the input. The program must print all the pronic integers formed by a series of continuously occurring digits (in the same order) in N as the output. The pronic integers can be represented as n*(n+1). Input:  93042861 Output: 930 30 0 42 2 6 Program: import math  s = input().strip() def check_pronic(num):      sq = math.floor(math.sqrt(num))      return (sq*(sq+1)) == num  l = []   for i in range(len(s)):      for j in range(i,len(s)):          substr = int(s[i:j+1])          if s[i:j+1] == "0":             l.append(substr)         elif s[i:j+1][0]!='0' and check_pronic(substr):             l.append(substr)  print(*l)             Expl...
Read more

Count Strong Points - Accenture

 Count Strong Points - Accenture Problem: The program must accept an integer matrix of size RxC as the input. The program must print the number of strong points in the given matrix as the output. The strong points are located at the element(s) whose all the surrounding elements are smaller than the given element. Input:  3 3  56 92 45  19 41 51  55 31 80 Output: 3  Program: n,m = map(int,input().split()) l = []  for i in range(n):      l.append(list(map(int,input().split()))) count = 0      for i in range(n):      for j in range(m):         c = 0         if i-1 >= 0 and l[i-1][j] >= l[i][j]:             c = 1          if i+1 < n and l[i+1][j] >= l[i][j]:              c = 1          if j-1 >= 0 and l[i][j-1] >= l[i][j]:     ...
Read more

Letters at position of multiples of a number

Letters at position of multiples of a number   Problem: A string of length L consists of characters is passed as input to the program. A given number N is also passed as the input to the program. The program must print the characters at the positions which are multiples of the given number.  Input Format:  The first line will contain the string of length L.  The second line will contain the number N.  Boundary Conditions:  3 <= L <= 50  1 <= N <= 30  Output Format:  The characters at the positions which are multiples of the given number.  Example Input/Output 1:  Input:  abcdef  3  Output:  cf  Explanation:  Multiples of 3 are like 3,6,9,... So the characters at positions 3,6 namely c and f are printed as output.  Example Input/Output 2:  Input:  environment  2  Output:  niomn  Explanation:  As it must be multiples of 2, the characters at even pos...
Read more