Given an English word of length at most 20 characters. Calculate the number of ways to arrange the word such that no vowels occur together.
Note : If the total number of vowels in the given word is one then the result should be 0.
Input : allahabad Output : 7200 Input : geeksforgeeks Output : 32205600 Input : abcd Output : 0
Since the word contains vowels and consonants. Calculate the total number of ways to arrange the given word and subtract the number of ways having all vowels together. To calculate the total number of ways we’ll use the following formula-
No of ways = (n!) / (r1! * r2! * ... * rk!)
Where n is the number of different characters in the word and r1, r2 … rk, are the frequency of same type character.
In order to calculate the number of ways such that all vowels occur together, we consider the group of all vowels as a single character and using the above formula we’ll calculate the total number of ways having all vowel together. Now subtract it from the total number of ways to get the result.
Below is the C++ implementation of the above approach:
7200 32205600 0
- Number of ways to arrange a word such that all vowels occur together
- Calculate Stirling numbers which represents the number of ways to arrange r objects around n different circles
- Arrange consonants and vowels nodes in a linked list
- Number of ways to arrange K different objects taking N objects at a time
- Arrangement of the characters of a word such that all vowels are at odd places
- Ways to arrange Balls such that adjacent balls are of different types
- Arrange given numbers to form the smallest number
- Count the number of vowels occurring in all the substrings of given string
- Encrypt string with product of number of vowels and consonants in substring of size k
- Find the number of ways to divide number into four parts such that a = c and b = d
- Count number of ways to divide a number in 4 parts
- Number of ways to choose a pair containing an even and an odd number from 1 to N
- Number of ways to get a given sum with n number of m-faced dices
- Ways to represent a number as a sum of 1's and 2's
- Number of ways to get even sum by choosing three numbers from 1 to N
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.