yaworsw/euler-manager

View on GitHub
data/problems/355.yml

Summary

Maintainability
Test Coverage
---
:id: 355
:name: Maximal coprime subset
:url: https://projecteuler.net/problem=355
:content: "Define Co(<var>n</var>) to be the maximal possible sum of a set of mutually
  co-prime elements from {1,&nbsp;2,&nbsp;...,&nbsp;<var>n</var>}.  \n For example
  Co(10) is 30 and hits that maximum on the subset {1,&nbsp;5,&nbsp;7,&nbsp;8,&nbsp;9}.\n\nYou
  are given that Co(30) = 193 and Co(100) = 1356.\n\nFind Co(200000).\n\n"