Cody

Problem 46551. Solve a ballot counting problem

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

60.87% Correct | 39.13% Incorrect
Last Solution submitted on Apr 01, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers13

Suggested Problems

More from this Author231

Problem Tags

combinatorics

Community Treasure Hunt

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

Start Hunting!