-
Notifications
You must be signed in to change notification settings - Fork 1
/
Elite Day-1 Program-1.txt
44 lines (35 loc) · 1.08 KB
/
Elite Day-1 Program-1.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/*
Ramesh and Suresh are best friends. They decided to play a word game.
The game rules are as follows:
- The game board shows a word W consist of two characters only A and B.
- You are allowed to replace a pair of neighbour letters AA with BB in W.
- Finally, The one who failed to replace the letters will lose the game.
Your task is to find all the possible ways of W, after one valid replacement.
You have to perform the replacement of the pair from left to right in the word.
and print the result in the same order of replacement.
Input Format:
-------------
A string W, word.
Output Format:
--------------
Print the list of possible replacements of W.
Sample Input-1:
---------------
AAABAA
Sample Output-1:
----------------
[BBABAA, ABBBAA, AAABBB]
Sample Input-2:
---------------
AAAAA
Sample Output-2:
----------------
[BBAAA, ABBAA, AABBA, AAABB]
*/
word = input()
l=[]
for i in range(len(word)-1):
if(word[i]==word[i+1]=="A"):
word1=word[0:i]+"BB"+word[i+2:len(word)]
l.append(word1)
print(*l)