Advertisement
Help Keep Boards Alive. Support us by going ad free today. See here: https://subscriptions.boards.ie/.
If we do not hit our goal we will be forced to close the site.

Current status: https://keepboardsalive.com/

Annual subs are best for most impact. If you are still undecided on going Ad Free - you can also donate using the Paypal Donate option. All contribution helps. Thank you.
https://www.boards.ie/group/1878-subscribers-forum

Private Group for paid up members of Boards.ie. Join the club.

Project Euler Question

  • 18-01-2017 09:45PM
    #1
    Ada Lovelace
    Registered Users, Registered Users 2 Posts: 11 ✭


    Hi,

    I'm starting to attempt some of the problems on www. projecteuler .net.

    Currently I'm looking at the following.
    We define the Matrix Sum of a matrix as the maximum sum of matrix elements with each element being the only one in his row and column. For example, the Matrix Sum of the matrix below equals 3315 ( = 863 + 383 + 343 + 959 + 767):
    7  53 183 439 863
497 383 563  79 973
287  63 343 169 583
627 343 773 959 943
767 473 103 699 303

    I don't get how this works. I can see that the last digit on each of the numbers in each column is the same. But I can't spot the sequence/pattern here.

    Can someone please explain it to me?


Comments

  • #2
    Pherekydes
    Registered Users, Registered Users 2, Paid Member Posts: 16,275 ✭✭✭✭Pherekydes


    You must pick one element from each row and add them up. Each column can also only have one element. You must then maximise this sum.


Advertisement