Advertisement
If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)
Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie
Hi there,
There is an issue with role permissions that is being worked on at the moment.
If you are having trouble with access or permissions on regional forums please post here to get access: https://www.boards.ie/discussion/2058365403/you-do-not-have-permission-for-that#latest

Project Euler Question

  • 18-01-2017 8: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 Posts: 16,202 ✭✭✭✭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