The code should be written in C++

Task ones Given a binary string i.e., a string containing only characters 0 and 1, write program ones that computes how many substrings of this string contains only 1s. Input: The given string Output: One integer, equals to the found count of substrings. Constraint: The length of the given string is less than 1 000 000. Example Input: 0111010111 Example Output: 13 Explanation. The 13 substrings are denoted by underlining: 0111010111, 0111010111, 0111010111, 0111010111, 0111010111, 0111010111, 0111010111 0111010111, 0111010111, 0111010111, 0111010111 0111010111, 0111010111