Problem 46551. Solve a ballot counting problem

ChrisR

15 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

25 Solutions

Last Solution submitted on Jul 10, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers15

Suggested Problems

Implement a ROT13 cipher

1717 Solvers
Least common multiple of many numbers

256 Solvers
Determine if input is a Narcissistic number

219 Solvers
Generate a random matrix A of (1,-1)

431 Solvers
How many days does the cat take to climb out of the hole?

83 Solvers

More from this Author328

Complete a geometric sequence

12 Solvers
Find the smallest number leading to a maximal product of two numbers that concatenate to another number

6 Solvers
Solve an ODE: separable equation

6 Solvers
Compute a row of the Kimberling shuffle

14 Solvers
List the first of three consecutive square-free numbers

7 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!