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
-
Check to see if a Sudoku Puzzle is Solved
341 Solvers
-
452 Solvers
-
117 Solvers
-
Getting the indices from a matrix
735 Solvers
-
Create Volcano (or Atoll) martix. It is an extension of Bullseye matrix problem.
164 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!
