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

Differential equations I

209 Solvers
Flag largest magnitude swings as they occur

693 Solvers
Return a list sorted by number of consecutive occurrences

439 Solvers
Generate a vector like 1,2,2,3,3,3,4,4,4,4

14360 Solvers
Count up then down

401 Solvers

More from this Author329

Find the closest e-abundant numbers

7 Solvers
Determine aquifer properties: slug test

6 Solvers
Sum the unitary divisors of a number

14 Solvers
Determine whether a number is prome

10 Solvers
Classify product/digit-sum sequences

14 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!