Project Euler #186: Connectedness of a network.

  • + 2 comments

    Can anyone who has finished this problem explain how they avoided overflowing their numbers when calculating for large k. I'm stuck on this.