benchmarks.wiki / Public workspace

MBPP / 239 / Write a function that takes in positive integers m and n and finds the number of…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

prompt

Write a function that takes in positive integers m and n and finds the number of possible sequences of length n, such that each element is a positive integer and is greater than or equal to twice the previous element but less than or equal to m.

test list

  • assert get_total_number_of_sequences(10, 4) == 4
  • assert get_total_number_of_sequences(5, 2) == 6
  • assert get_total_number_of_sequences(16, 3) == 84

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import