Problem 46551. Solve a ballot counting problem

ChrisR

16 solvers

2 likes

Solve

Solve Later

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
 Optional: Identify the connection between this problem and Cody Problem 42821. 

Solve

Solution Stats

26 Solutions

Last Solution submitted on Jul 14, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers16

Suggested Problems

Find the longest sequence of 1's in a binary sequence.

6817 Solvers
Return the largest number that is adjacent to a zero

5527 Solvers
Check to see if a Sudoku Puzzle is Solved

341 Solvers
Back to basics 8 - Matrix Diagonals

971 Solvers
Find the maximum number of decimal places in a set of numbers

3560 Solvers

More from this Author328

List the nth term of Rozhenko’s inventory sequence

13 Solvers
List the nth prime quartet prefix

10 Solvers
Evaluate the zeta function for real arguments > 1

18 Solvers
Solve the arithmetic differential equation D(n) = n

13 Solvers
Count paths between corners of a grid that remain on or below the diagonal

4 Solvers

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!