benchmarks.wiki

benchmarks.wiki / Public workspace

MBPP / 515 / Write a function to check if there is a subset with sum divisible by m.

Problem

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

test list

  • assert modular_sum([3, 1, 7, 5], 4, 6) == True
  • assert modular_sum([1, 7], 2, 5) == False
  • assert modular_sum([1, 6], 2, 5) == False

text

Write a function to check if there is a subset with sum divisible by m.

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

upstream_id / Original problem ID
515
task_id
36706a0d-7658-5178-9a68-22dea596d8ae
task_key
full--validation--515
task_revision_id
1
config / split
full / validation

Official source

initial import