{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-26T00:16:20.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-05-26T00: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":43969,"title":"Sleeping Queens 1","description":"My youngest daughter received a card game named Sleeping Queens for Christmas this year, and has been playing it nearly non-stop since opening it.\r\n\r\nYou are dealt five cards, most of which have numbers 1-10 on them.  There are other cards, but for now we will just deal with the numbers.  You can discard cards in any of three different methods and draw that many new cards:\r\n\r\n* Individual cards, one at a time\r\n* Pairs of cards, but not three or four of a kind\r\n* Cards that make up an addition problem.\r\n\r\nWrite a MATLAB script that will tell you how how many different ways you can discard cards in your hand.\r\n\r\nFor example, if your hand had the cards [1 2 2 4 9], you could discard\r\n\r\n* Any of the cards individually  (5)\r\n* The pair of 2s  (1)\r\n* [2 2 4] because 2+2=4  (1)\r\n* [1 2 2 4 9] because 1+2+2+4=9  (1)\r\n\r\nso your script would output 8.  Likewise, a hand of [1 2 2 2 6] would allow you discard cards 9 different ways:\r\n\r\n* Any of the cards individually  (5)\r\n* Any of the three different pairs of 2s  (3)\r\n* [2 2 2 6] because 2+2+2=6  (1)\r\n\r\nSo the output of your script for [1 2 2 2 6] should be 9.  We don't need to know what the possible combinations are to discard just yet; we just need to know how many there are.  Good luck, and happy hunting!","description_html":"\u003cp\u003eMy youngest daughter received a card game named Sleeping Queens for Christmas this year, and has been playing it nearly non-stop since opening it.\u003c/p\u003e\u003cp\u003eYou are dealt five cards, most of which have numbers 1-10 on them.  There are other cards, but for now we will just deal with the numbers.  You can discard cards in any of three different methods and draw that many new cards:\u003c/p\u003e\u003cul\u003e\u003cli\u003eIndividual cards, one at a time\u003c/li\u003e\u003cli\u003ePairs of cards, but not three or four of a kind\u003c/li\u003e\u003cli\u003eCards that make up an addition problem.\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eWrite a MATLAB script that will tell you how how many different ways you can discard cards in your hand.\u003c/p\u003e\u003cp\u003eFor example, if your hand had the cards [1 2 2 4 9], you could discard\u003c/p\u003e\u003cul\u003e\u003cli\u003eAny of the cards individually  (5)\u003c/li\u003e\u003cli\u003eThe pair of 2s  (1)\u003c/li\u003e\u003cli\u003e[2 2 4] because 2+2=4  (1)\u003c/li\u003e\u003cli\u003e[1 2 2 4 9] because 1+2+2+4=9  (1)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eso your script would output 8.  Likewise, a hand of [1 2 2 2 6] would allow you discard cards 9 different ways:\u003c/p\u003e\u003cul\u003e\u003cli\u003eAny of the cards individually  (5)\u003c/li\u003e\u003cli\u003eAny of the three different pairs of 2s  (3)\u003c/li\u003e\u003cli\u003e[2 2 2 6] because 2+2+2=6  (1)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eSo the output of your script for [1 2 2 2 6] should be 9.  We don't need to know what the possible combinations are to discard just yet; we just need to know how many there are.  Good luck, and happy hunting!\u003c/p\u003e","function_template":"function y = Sleeping(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nx = [5 6 7 8 9];y_correct = 5;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nx = [1 5 3 2 4];y_correct = 9;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nx = [2 4 8 4 2];y_correct = 12;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nx = [1 1 1 2 1];y_correct = 17;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nx = [3 6 5 1 8];y_correct = 7;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nassert(isequal(Sleeping([1 6 1 7 8]),11))\r\n%%\r\nassert(isequal(Sleeping([2 3 3 1 5]),10))","published":true,"deleted":false,"likes_count":4,"comments_count":2,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":42,"test_suite_updated_at":"2016-12-27T20:04:57.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2016-12-27T19:51:49.000Z","updated_at":"2026-05-24T16:42:10.000Z","published_at":"2016-12-27T20:04:57.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eMy youngest daughter received a card game named Sleeping Queens for Christmas this year, and has been playing it nearly non-stop since opening it.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou are dealt five cards, most of which have numbers 1-10 on them. There are other cards, but for now we will just deal with the numbers. You can discard cards in any of three different methods and draw that many new cards:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eIndividual cards, one at a time\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ePairs of cards, but not three or four of a kind\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eCards that make up an addition problem.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eWrite a MATLAB script that will tell you how how many different ways you can discard cards in your hand.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor example, if your hand had the cards [1 2 2 4 9], you could discard\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAny of the cards individually (5)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe pair of 2s (1)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e[2 2 4] because 2+2=4 (1)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e[1 2 2 4 9] because 1+2+2+4=9 (1)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eso your script would output 8. Likewise, a hand of [1 2 2 2 6] would allow you discard cards 9 different ways:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAny of the cards individually (5)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAny of the three different pairs of 2s (3)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e[2 2 2 6] because 2+2+2=6 (1)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eSo the output of your script for [1 2 2 2 6] should be 9. We don't need to know what the possible combinations are to discard just yet; we just need to know how many there are. Good luck, and happy hunting!\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"problems":[{"id":43969,"title":"Sleeping Queens 1","description":"My youngest daughter received a card game named Sleeping Queens for Christmas this year, and has been playing it nearly non-stop since opening it.\r\n\r\nYou are dealt five cards, most of which have numbers 1-10 on them.  There are other cards, but for now we will just deal with the numbers.  You can discard cards in any of three different methods and draw that many new cards:\r\n\r\n* Individual cards, one at a time\r\n* Pairs of cards, but not three or four of a kind\r\n* Cards that make up an addition problem.\r\n\r\nWrite a MATLAB script that will tell you how how many different ways you can discard cards in your hand.\r\n\r\nFor example, if your hand had the cards [1 2 2 4 9], you could discard\r\n\r\n* Any of the cards individually  (5)\r\n* The pair of 2s  (1)\r\n* [2 2 4] because 2+2=4  (1)\r\n* [1 2 2 4 9] because 1+2+2+4=9  (1)\r\n\r\nso your script would output 8.  Likewise, a hand of [1 2 2 2 6] would allow you discard cards 9 different ways:\r\n\r\n* Any of the cards individually  (5)\r\n* Any of the three different pairs of 2s  (3)\r\n* [2 2 2 6] because 2+2+2=6  (1)\r\n\r\nSo the output of your script for [1 2 2 2 6] should be 9.  We don't need to know what the possible combinations are to discard just yet; we just need to know how many there are.  Good luck, and happy hunting!","description_html":"\u003cp\u003eMy youngest daughter received a card game named Sleeping Queens for Christmas this year, and has been playing it nearly non-stop since opening it.\u003c/p\u003e\u003cp\u003eYou are dealt five cards, most of which have numbers 1-10 on them.  There are other cards, but for now we will just deal with the numbers.  You can discard cards in any of three different methods and draw that many new cards:\u003c/p\u003e\u003cul\u003e\u003cli\u003eIndividual cards, one at a time\u003c/li\u003e\u003cli\u003ePairs of cards, but not three or four of a kind\u003c/li\u003e\u003cli\u003eCards that make up an addition problem.\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eWrite a MATLAB script that will tell you how how many different ways you can discard cards in your hand.\u003c/p\u003e\u003cp\u003eFor example, if your hand had the cards [1 2 2 4 9], you could discard\u003c/p\u003e\u003cul\u003e\u003cli\u003eAny of the cards individually  (5)\u003c/li\u003e\u003cli\u003eThe pair of 2s  (1)\u003c/li\u003e\u003cli\u003e[2 2 4] because 2+2=4  (1)\u003c/li\u003e\u003cli\u003e[1 2 2 4 9] because 1+2+2+4=9  (1)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eso your script would output 8.  Likewise, a hand of [1 2 2 2 6] would allow you discard cards 9 different ways:\u003c/p\u003e\u003cul\u003e\u003cli\u003eAny of the cards individually  (5)\u003c/li\u003e\u003cli\u003eAny of the three different pairs of 2s  (3)\u003c/li\u003e\u003cli\u003e[2 2 2 6] because 2+2+2=6  (1)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eSo the output of your script for [1 2 2 2 6] should be 9.  We don't need to know what the possible combinations are to discard just yet; we just need to know how many there are.  Good luck, and happy hunting!\u003c/p\u003e","function_template":"function y = Sleeping(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nx = [5 6 7 8 9];y_correct = 5;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nx = [1 5 3 2 4];y_correct = 9;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nx = [2 4 8 4 2];y_correct = 12;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nx = [1 1 1 2 1];y_correct = 17;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nx = [3 6 5 1 8];y_correct = 7;\r\nassert(isequal(Sleeping(x),y_correct))\r\n%%\r\nassert(isequal(Sleeping([1 6 1 7 8]),11))\r\n%%\r\nassert(isequal(Sleeping([2 3 3 1 5]),10))","published":true,"deleted":false,"likes_count":4,"comments_count":2,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":42,"test_suite_updated_at":"2016-12-27T20:04:57.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2016-12-27T19:51:49.000Z","updated_at":"2026-05-24T16:42:10.000Z","published_at":"2016-12-27T20:04:57.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eMy youngest daughter received a card game named Sleeping Queens for Christmas this year, and has been playing it nearly non-stop since opening it.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou are dealt five cards, most of which have numbers 1-10 on them. There are other cards, but for now we will just deal with the numbers. You can discard cards in any of three different methods and draw that many new cards:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eIndividual cards, one at a time\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ePairs of cards, but not three or four of a kind\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eCards that make up an addition problem.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eWrite a MATLAB script that will tell you how how many different ways you can discard cards in your hand.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor example, if your hand had the cards [1 2 2 4 9], you could discard\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAny of the cards individually (5)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe pair of 2s (1)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e[2 2 4] because 2+2=4 (1)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e[1 2 2 4 9] because 1+2+2+4=9 (1)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eso your script would output 8. Likewise, a hand of [1 2 2 2 6] would allow you discard cards 9 different ways:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAny of the cards individually (5)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAny of the three different pairs of 2s (3)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e[2 2 2 6] because 2+2+2=6 (1)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eSo the output of your script for [1 2 2 2 6] should be 9. We don't need to know what the possible combinations are to discard just yet; we just need to know how many there are. Good luck, and happy hunting!\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"errors":[],"facets":[[{"value":"Advent of Code","count":1,"selected":false},{"value":"Combinatorics III","count":1,"selected":false}],[{"value":"medium","count":1,"selected":false}]],"term":"tag:\"kids stuff\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}