Problem 58946. Count block fountains

• Created by ChrisR
• Appears in Date & Time II

×

Like (1)

Difficulty:

(1020)

Rate

• Solve Later   
• Add To GroupÂ

A block fountain consists of rows of circles in which each row is a continuous block of circles (i.e., adjacent circles are tangent) and each circle in a row above the first touches exactly two circles on the previous row.

Write a function to compute the number of block fountains with n circles on the first row. For example, there are five block fountains with three circles on the first row.

Solve

Solution Stats

53.33% Correct | 46.67% Incorrect

• 15 Solutions
• 6 Solvers

Last Solution submitted on Jul 16, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers6

Suggested Problems

• Implement a ROT13 cipher

  1680 Solvers

• Space Saver

  483 Solvers

• Is the paranthesis sequence balanced ?

  179 Solvers

• Is this triangle right-angled?

  6004 Solvers

• Replace pattern 0 1 0 and 1 0 1

  147 Solvers

More from this Author291

• Solve a Weird Calculator puzzle

  12 Solvers

• Compute an improper integral of a ratio of algebraic functions

  14 Solvers

• Solve an ODE: equation C

  5 Solvers

• Solve the Challenger puzzle

  15 Solvers

• List Proth primes

  11 Solvers