Candidate X and Candidate O receive the same number (n) of votes in an election. Write a function to determine the number of ways the ballots can be counted such that X is never behind O. For example, for n = 3 there are five ways:
XXXOOO
XXOXOO
XXOOXO
XOXXOO
XOXOXO
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers16
Suggested Problems
-
2825 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2071 Solvers
-
Determine if input is a perfect number
267 Solvers
-
Calculate the derivative of a polynomial
241 Solvers
-
Check that number is whole number
5496 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
