Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

  • Count vowels

    Given a string s, you would like to calculate the number of substrings that have an odd number of vowels (a, e, i, o, u, and y).
    Definition of a substring
    Any contiguous sequence of characters in the string s is considered a substring of s. For instance, the string abc has substrings a, b, c, ab, bc, abc.

    Input

    The input contains a single string s (1 ≤ |s| ≤ 100) of lowercase Latin letters.

    Output

    The program should print the number of substrings that have an odd number of vowels.

    Examples

    Input
    Output
    abc
    3
    hello
    9
    xyz
    4

    Explanation

    1. abc → a, ab, abc
    1. hello → he, hel, hell, e, el, ell, llo, lo, o
    1. xyz → xy, xyz, y, yz
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue