Problem 46551. Solve a ballot counting problem

• Created by ChrisR
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Cody5:Hard

• 24 Problems
• 32 Finishers

Computer Games II

• 12 Problems
• 2 Finishers

Like (2)

Difficulty:

(21)

Rate

• Solve Later   
• Add To GroupÂ

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

• 23 Solutions
• 13 Solvers

Last Solution submitted on Apr 01, 2023

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Who Deserves Your Praise? Discover the New Contribution Widget!

We are excited to announce another update to our Discussions area: the...

Problem Recent Solvers13

Suggested Problems

• Swap the first and last columns

  21037 Solvers

• Remove the vowels

  6312 Solvers

• All capital?

  651 Solvers

• So many choices

  457 Solvers

• Implement full adder circuit

  52 Solvers

More from this Author292

• List the Fermi-Dirac primes

  11 Solvers

• Count the unitary divisors of a number

  11 Solvers

• Solve an ODE: precocious pair’s porcine pursuit

  4 Solvers

• Test approximations of the prime counting function

  15 Solvers

• List Ormiston prime pairs

  5 Solvers