PE-CN / pe-cn-comments

2 stars 0 forks source link

Problem 857 | Project Euler | #859

Open sx349 opened 10 months ago

sx349 commented 10 months ago

https://pe-cn.github.io/857/

Problem 857 Beautiful GraphsA graph is made up of vertices and coloured edges. Between every two distinct vertices there must be exactly one of the following: A red directed edge one way, and a blue