Problem 46551. Solve a ballot counting problem

ChrisR

13 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

23 Solutions

Last Solution submitted on Apr 01, 2023

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers13

Suggested Problems

Find the numeric mean of the prime numbers in a matrix.

9136 Solvers
Create a cell array out of a struct

2421 Solvers
Which quadrant?

366 Solvers
Back to basics 7 - Equal NaNs

430 Solvers
Check if number exists in vector

13837 Solvers

More from this Author321

List the first of three consecutive square-free numbers

5 Solvers
Integrate a power tower

7 Solvers
Determine aquifer properties: unsteady pump test in a confined aquifer

4 Solvers
Compute the number of squares a knight can reach after n moves

7 Solvers
Compute the largest number possible with the Brussels choice

13 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!