Problem 46551. Solve a ballot counting problem
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 commentsProblem Recent Solvers13
Suggested Problems
-
Check to see if a Sudoku Puzzle is Solved
329 Solvers
-
2223 Solvers
-
Return the first and last characters of a character array
10909 Solvers
-
Find a subset that divides the vector into equal halves
391 Solvers
-
Implement simple rotation cypher
1085 Solvers
More from this Author301
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!