benchmarks.wiki / Public workspace

MBPP / 843 / Write a function to find the nth super ugly number from a given prime list of…

Problem

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

test list

  • assert nth_super_ugly_number(12,[2,7,13,19])==32
  • assert nth_super_ugly_number(10,[2,7,13,19])==26
  • assert nth_super_ugly_number(100,[2,7,13,19])==5408

text

Write a function to find the nth super ugly number from a given prime list of size k using heap queue algorithm.

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