Question

Problem Description Constraints 1 one -> o, e 2 -> two -> o 3 -> three -> e, e 4 -> four -> o, u 5 -> five - > i, e Thus, count of vowels in textual representation of numbers in input = {2 + 1 + 2 + 2 + 2} = 9. Number 9 is the digit D referred to in section above. Now from given list of number {1,2,3,4,5} -> find all pairs that sum up to 9. Upon processing this we know that only a single unordered pair {4, 5} sum up to 9. Hence the answer is 1. However, output specification requires you to print textual representation of number 1 which is one. Hence output is one. Note: - Pairs {4, 5} or {5, 4} both sum up to 9. But since we are asking to count only unordered pair, the number of unordered pair is this combination is only one. Example 2 Input 3 7 4 2 Output zero Explanation 7 -> seven -> e, e 4 -> four -> o, u 2 -> two -> o Thus, count of vowels in textual representation of numbers in input = {2 + 2 + 1} = 5. Number 5 is the digit D referred to in section above. Since no pairs add up to 5, the answer is 0. Textual representation of 0 is zero. Hence output is zero.

Answer 1

Answer:

I want to help you so I am telling you

Search it on Google You will get best answer with explanations. Please mark Me brainliast