You are given a string S, you have to find all the ‘amazing’ substrings of S.

amazing_substr.py

'''
You are given a string S, you have to find all the ‘amazing’ substrings of S.
‘Amazing’ substring is one that starts with a vowel (a,e,i,o,u,A,E,I,O,U)
Example:
Input: ABEC
Output: 6
Explanation: Amazing substrings of given string are :
1. A
2. AB
3. ABE
4. ABEC
5. E
6. EC
here number of substrings are 6
'''

def no_of_substrings(s):
    """returns number of amazing substrings of a given string
    Assumption made: No repeated substrings to count"""
    
    vowels = ('a','e','i','o','u','A','I','E','O','U')
    num = 0
    substrings = []
    for i in range(len(s)-1,-1,-1):
        if s[i] in vowels:
            for k in range(0,len(s[i:])):
                substrings.append(s[i:i+k+1])
    #print(set(substrings))
    num = len(set(substrings))

    return num
                    
s = input('Enter input string\n')
print(no_of_substrings(s))