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
-
Find the numeric mean of the prime numbers in a matrix.
9168 Solvers
-
The Goldbach Conjecture, Part 2
2420 Solvers
-
Sum of diagonal of a square matrix
1645 Solvers
-
Put two time series onto the same time basis
357 Solvers
-
Create a random logical vector of N elements of which M are true.
105 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
