Project Euler #106: Special subset sums: meta-testing

  • + 0 comments

    I lost my confidence because this is marked as easy.

    Hints for those who come later:

    • Your clever DP solution will score 0.00
    • Your O(n) solution will score 0.00
    • I got 100 after looking up some basic modular arithmetic and combining everything