{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-07-05T00:54:32.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-07-05T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":61423,"title":"Solve Geozee","description":"Geozee is a new daily puzzle game where you have to assign 9 countries to 9 categories. Categories are such things as \"Human Development\", \"Many Languages\", or \"Long Borders\", and any given country will score between 0 and 100 points in any given category. Your mission in the game is to assign each country to a different category such that the total score is maximized.\r\nFor the purpose of this problem, let M be a 9x9 matrix such M(i, j) is the score of country j in category i. Write a function to compute the score-maximizing assignment (this should be a row vector that is a permutation of 1:9) and the maximized score.\r\nAs always, no cheating, please. (And no regexp hacking to get score 10. You know who you are!)","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(33, 33, 33); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none; white-space: normal; \"\u003e\u003cdiv style=\"baseline-shift: 0px; block-size: 144px; display: block; min-width: 0px; padding-block-start: 0px; padding-inline-start: 2px; padding-left: 2px; padding-top: 0px; perspective-origin: 469px 72px; transform-origin: 469px 72px; \"\u003e\u003cdiv style=\"block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; padding-inline-start: 0px; padding-left: 0px; perspective-origin: 445px 31.5px; text-align: left; transform-origin: 445px 31.5px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; \"\u003e\u003ca target='_blank' href = \"https://geozee.earth/\"\u003e\u003cspan style=\"border-block-end-color: rgb(0, 91, 130); border-block-start-color: rgb(0, 91, 130); border-bottom-color: rgb(0, 91, 130); border-inline-end-color: rgb(0, 91, 130); border-inline-start-color: rgb(0, 91, 130); border-left-color: rgb(0, 91, 130); border-right-color: rgb(0, 91, 130); border-top-color: rgb(0, 91, 130); caret-color: rgb(0, 91, 130); color: rgb(0, 91, 130); column-rule-color: rgb(0, 91, 130); outline-color: rgb(0, 91, 130); text-decoration-color: rgb(0, 91, 130); text-emphasis-color: rgb(0, 91, 130); \"\u003e\u003cspan style=\"\"\u003eGeozee\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 376.3px 7.66667px; transform-origin: 376.3px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e is a new daily puzzle game where you have to assign 9 countries to 9 categories. Categories are such things as \"Human Development\", \"Many Languages\", or \"Long Borders\", and any given country will score between 0 and 100 points in any given category. Your mission in the game is to assign each country to a different category such that the total score is maximized.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; padding-inline-start: 0px; padding-left: 0px; perspective-origin: 445px 21px; text-align: left; transform-origin: 445px 21px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 437.8px 7.66667px; transform-origin: 437.8px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFor the purpose of this problem, let M be a 9x9 matrix such M(i, j) is the score of country j in category i. Write a function to compute the score-maximizing assignment (this should be a row vector that is a permutation of 1:9) and the maximized score.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; padding-inline-start: 0px; padding-left: 0px; perspective-origin: 445px 10.5px; text-align: left; transform-origin: 445px 10.5px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 300.425px 7.66667px; transform-origin: 300.425px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eAs always, no cheating, please. (And no regexp hacking to get score 10. You know who you are!)\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function [b, k] = geozee_solver(M)\r\n\r\nend","test_suite":"%% \r\n% Puzzle 1\r\nM = [ \r\n        3 50 0 38 25 0 16 29 37 \r\n        0 0 0 100 0 0 0 0 0\r\n        0 0 0 0 0 100 0 0 0\r\n        100 100 0 100 100 100 100 100 0\r\n        30 46 14 100 68 8 100 100 100\r\n        2 100 1 86 49 0 31 53 20\r\n        0 0 0 0 0 0 0 100 0\r\n        21 0 26 19 21 0 44 21 34\r\n        0 50 0 50 100 0 50 0 0\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 763))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%%\r\n% Puzzle 2\r\nM = [ \r\n        0 0 0 100 0 0 0 0 0 \r\n        0 0 0 0 50 50 0 0 50\r\n        0 0 5 3 0 100 1 0 3\r\n        1 32 18 1 31 100 21 71 0\r\n        15 6 10 0 15 15 0 0 23\r\n        17 0 5 0 5 5 0 0 9\r\n        0 0 0 0 100 100 0 0 0\r\n        0 0 0 93 0 0 96 100 0\r\n        0 0 0 100 0 0 0 0 100\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 594))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%% \r\n% Puzzle 3\r\nM = [\r\n        0 0 100 0 100 100 100 0 100\r\n        0 100 0 0 0 0 0 0 0\r\n        78 6 97 88 85 63 86 98 27\r\n        80 20 20 50 60 30 50 40 100\r\n        60 97 95 79 49 71 83 52 80\r\n        1 90 100 10 0 4 21 1 14\r\n        3 4 6 38 2 26 0 0 100\r\n        0 17 0 11 13 4 0 0 60\r\n        0 0 0 0 0 100 100 0 0\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 772))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%% \r\n% Puzzle 4\r\nM = [\r\n        0 0 30 21 26 1 13 0 11\r\n        0 0 0 0 0 0 100 0 0\r\n        0 0 37 97 31 0 15 0 9\r\n        0 0 0 100 0 0 0 100 0\r\n        0 50 50 50 0 0 50 0 0\r\n        0 100 100 0 100 0 0 0 100\r\n        100 100 0 100 100 100 100 100 100\r\n        0 100 0 0 0 100 0 0 0\r\n        81 81 88 79 41 84 91 89 56\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 761))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%% \r\n% Puzzle 5\r\nM = [\r\n        11 60 5 0 7 0 10 0 15\r\n        74 100 100 10 28 8 76 80 100\r\n        0 0 0 0 0 0 100 0 0\r\n        100 0 0 0 0 100 0 100 0\r\n        52 100 0 0 2 0 0 7 1\r\n        96 94 92 76 86 90 79 82 58\r\n        0 100 100 100 100 100 100 100 0\r\n        0 100 0 0 0 0 0 100 0\r\n        22 100 1 0 8 0 4 0 16\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 753))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%% \r\n% Puzzle 6\r\nM = [\r\n        71 47 47 75 91 73 71 85 59\r\n        0 0 0 0 0 0 100 0 0\r\n        90 89 93 54 70 77 91 95 87\r\n        75 97 99 70 42 71 91 0 96\r\n        100 100 100 100 0 100 100 0 0\r\n        89 37 45 91 67 67 59 45 55\r\n        100 100 100 0 0 100 100 100 100\r\n        80 60 60 60 60 60 100 100 60\r\n        52 1 35 14 19 27 27 73 43\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 825))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":332395,"edited_by":332395,"edited_at":"2026-07-14T06:18:47.000Z","deleted_by":null,"deleted_at":null,"solvers_count":4,"test_suite_updated_at":"2026-07-14T06:18:47.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2026-07-13T20:54:02.000Z","updated_at":"2026-07-14T06:53:06.000Z","published_at":"2026-07-13T20:54:02.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:hyperlink w:docLocation=\\\"https://geozee.earth/\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGeozee\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e is a new daily puzzle game where you have to assign 9 countries to 9 categories. Categories are such things as \\\"Human Development\\\", \\\"Many Languages\\\", or \\\"Long Borders\\\", and any given country will score between 0 and 100 points in any given category. Your mission in the game is to assign each country to a different category such that the total score is maximized.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor the purpose of this problem, let M be a 9x9 matrix such M(i, j) is the score of country j in category i. Write a function to compute the score-maximizing assignment (this should be a row vector that is a permutation of 1:9) and the maximized score.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAs always, no cheating, please. (And no regexp hacking to get score 10. You know who you are!)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"problem_search":{"problems":[{"id":61423,"title":"Solve Geozee","description":"Geozee is a new daily puzzle game where you have to assign 9 countries to 9 categories. Categories are such things as \"Human Development\", \"Many Languages\", or \"Long Borders\", and any given country will score between 0 and 100 points in any given category. Your mission in the game is to assign each country to a different category such that the total score is maximized.\r\nFor the purpose of this problem, let M be a 9x9 matrix such M(i, j) is the score of country j in category i. Write a function to compute the score-maximizing assignment (this should be a row vector that is a permutation of 1:9) and the maximized score.\r\nAs always, no cheating, please. (And no regexp hacking to get score 10. You know who you are!)","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(33, 33, 33); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none; white-space: normal; \"\u003e\u003cdiv style=\"baseline-shift: 0px; block-size: 144px; display: block; min-width: 0px; padding-block-start: 0px; padding-inline-start: 2px; padding-left: 2px; padding-top: 0px; perspective-origin: 469px 72px; transform-origin: 469px 72px; \"\u003e\u003cdiv style=\"block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; padding-inline-start: 0px; padding-left: 0px; perspective-origin: 445px 31.5px; text-align: left; transform-origin: 445px 31.5px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; \"\u003e\u003ca target='_blank' href = \"https://geozee.earth/\"\u003e\u003cspan style=\"border-block-end-color: rgb(0, 91, 130); border-block-start-color: rgb(0, 91, 130); border-bottom-color: rgb(0, 91, 130); border-inline-end-color: rgb(0, 91, 130); border-inline-start-color: rgb(0, 91, 130); border-left-color: rgb(0, 91, 130); border-right-color: rgb(0, 91, 130); border-top-color: rgb(0, 91, 130); caret-color: rgb(0, 91, 130); color: rgb(0, 91, 130); column-rule-color: rgb(0, 91, 130); outline-color: rgb(0, 91, 130); text-decoration-color: rgb(0, 91, 130); text-emphasis-color: rgb(0, 91, 130); \"\u003e\u003cspan style=\"\"\u003eGeozee\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 376.3px 7.66667px; transform-origin: 376.3px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e is a new daily puzzle game where you have to assign 9 countries to 9 categories. Categories are such things as \"Human Development\", \"Many Languages\", or \"Long Borders\", and any given country will score between 0 and 100 points in any given category. Your mission in the game is to assign each country to a different category such that the total score is maximized.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; padding-inline-start: 0px; padding-left: 0px; perspective-origin: 445px 21px; text-align: left; transform-origin: 445px 21px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 437.8px 7.66667px; transform-origin: 437.8px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFor the purpose of this problem, let M be a 9x9 matrix such M(i, j) is the score of country j in category i. Write a function to compute the score-maximizing assignment (this should be a row vector that is a permutation of 1:9) and the maximized score.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; padding-inline-start: 0px; padding-left: 0px; perspective-origin: 445px 10.5px; text-align: left; transform-origin: 445px 10.5px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 300.425px 7.66667px; transform-origin: 300.425px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eAs always, no cheating, please. (And no regexp hacking to get score 10. You know who you are!)\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function [b, k] = geozee_solver(M)\r\n\r\nend","test_suite":"%% \r\n% Puzzle 1\r\nM = [ \r\n        3 50 0 38 25 0 16 29 37 \r\n        0 0 0 100 0 0 0 0 0\r\n        0 0 0 0 0 100 0 0 0\r\n        100 100 0 100 100 100 100 100 0\r\n        30 46 14 100 68 8 100 100 100\r\n        2 100 1 86 49 0 31 53 20\r\n        0 0 0 0 0 0 0 100 0\r\n        21 0 26 19 21 0 44 21 34\r\n        0 50 0 50 100 0 50 0 0\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 763))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%%\r\n% Puzzle 2\r\nM = [ \r\n        0 0 0 100 0 0 0 0 0 \r\n        0 0 0 0 50 50 0 0 50\r\n        0 0 5 3 0 100 1 0 3\r\n        1 32 18 1 31 100 21 71 0\r\n        15 6 10 0 15 15 0 0 23\r\n        17 0 5 0 5 5 0 0 9\r\n        0 0 0 0 100 100 0 0 0\r\n        0 0 0 93 0 0 96 100 0\r\n        0 0 0 100 0 0 0 0 100\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 594))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%% \r\n% Puzzle 3\r\nM = [\r\n        0 0 100 0 100 100 100 0 100\r\n        0 100 0 0 0 0 0 0 0\r\n        78 6 97 88 85 63 86 98 27\r\n        80 20 20 50 60 30 50 40 100\r\n        60 97 95 79 49 71 83 52 80\r\n        1 90 100 10 0 4 21 1 14\r\n        3 4 6 38 2 26 0 0 100\r\n        0 17 0 11 13 4 0 0 60\r\n        0 0 0 0 0 100 100 0 0\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 772))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%% \r\n% Puzzle 4\r\nM = [\r\n        0 0 30 21 26 1 13 0 11\r\n        0 0 0 0 0 0 100 0 0\r\n        0 0 37 97 31 0 15 0 9\r\n        0 0 0 100 0 0 0 100 0\r\n        0 50 50 50 0 0 50 0 0\r\n        0 100 100 0 100 0 0 0 100\r\n        100 100 0 100 100 100 100 100 100\r\n        0 100 0 0 0 100 0 0 0\r\n        81 81 88 79 41 84 91 89 56\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 761))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%% \r\n% Puzzle 5\r\nM = [\r\n        11 60 5 0 7 0 10 0 15\r\n        74 100 100 10 28 8 76 80 100\r\n        0 0 0 0 0 0 100 0 0\r\n        100 0 0 0 0 100 0 100 0\r\n        52 100 0 0 2 0 0 7 1\r\n        96 94 92 76 86 90 79 82 58\r\n        0 100 100 100 100 100 100 100 0\r\n        0 100 0 0 0 0 0 100 0\r\n        22 100 1 0 8 0 4 0 16\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 753))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n\r\n%% \r\n% Puzzle 6\r\nM = [\r\n        71 47 47 75 91 73 71 85 59\r\n        0 0 0 0 0 0 100 0 0\r\n        90 89 93 54 70 77 91 95 87\r\n        75 97 99 70 42 71 91 0 96\r\n        100 100 100 100 0 100 100 0 0\r\n        89 37 45 91 67 67 59 45 55\r\n        100 100 100 0 0 100 100 100 100\r\n        80 60 60 60 60 60 100 100 60\r\n        52 1 35 14 19 27 27 73 43\r\n    ];\r\n[b, k] = geozee_solver(M);\r\nassert(isequal(k, 825))\r\nassert(isequal(sort(b), 1:9))\r\nassert(isequal(sum(arrayfun(@(i) M(b(i), i), 1:9)), k))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":332395,"edited_by":332395,"edited_at":"2026-07-14T06:18:47.000Z","deleted_by":null,"deleted_at":null,"solvers_count":4,"test_suite_updated_at":"2026-07-14T06:18:47.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2026-07-13T20:54:02.000Z","updated_at":"2026-07-14T06:53:06.000Z","published_at":"2026-07-13T20:54:02.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:hyperlink w:docLocation=\\\"https://geozee.earth/\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGeozee\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e is a new daily puzzle game where you have to assign 9 countries to 9 categories. Categories are such things as \\\"Human Development\\\", \\\"Many Languages\\\", or \\\"Long Borders\\\", and any given country will score between 0 and 100 points in any given category. Your mission in the game is to assign each country to a different category such that the total score is maximized.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor the purpose of this problem, let M be a 9x9 matrix such M(i, j) is the score of country j in category i. Write a function to compute the score-maximizing assignment (this should be a row vector that is a permutation of 1:9) and the maximized score.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAs always, no cheating, please. (And no regexp hacking to get score 10. You know who you are!)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"errors":[],"facets":[[],[{"value":"medium","count":1,"selected":false}]],"term":"tag:\"geozee\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}