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

How to find the position of an element in a vector without using the find function

2823 Solvers
Differential equations I

211 Solvers
Doubling elements in a vector

10951 Solvers
Replace multiples of 5 with NaN

472 Solvers
Create an index-powered vector

968 Solvers

More from this Author329

Determine the minimum number of swaps to sort a vector

6 Solvers
Compute the unitary totient of a number

8 Solvers
Collect a set of candy wrappers

8 Solvers
Set the Euler-Mascheroni constant with an identity using available MATLAB functions

21 Solvers
Gather primes

8 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!