{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2025-12-14T01:33:56.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":"2025-12-14T00: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":2313,"title":"Narcissistic problem","description":"How many likes has this problem?","description_html":"\u003cp\u003eHow many likes has this problem?\u003c/p\u003e","function_template":"function y = like_me(x)\r\n  y = x;\r\nend","test_suite":"%%\r\n% this problem will be updated,\r\n% your score/size can change over time\r\n% if you submit a fixed value :-)\r\n%%\r\ny=like_me();\r\nassert(isequal(mod(y,1),0));\r\n%%\r\ny=like_me();\r\nassert(y\u003e0);\r\n%%\r\ny=like_me();\r\nurl='http://www.mathworks.co.uk/matlabcentral/cody/problems/2313'\r\n% the main problem with this problem is that ...\r\n% this problem thinks.\r\n% it thinks about itself most of the time.\r\n% it is convinced, that at least X likes has it.\r\ny_sub_correct=max([10 cellfun(@(S)str2num(cell2mat(S)),regexp(urlread(url),'(\\d*) players\u003c/a\u003e like this problem','tokens'))]); % probably hackable by comments?\r\nt = mtree('like_me.m','-file');\r\nsize = length(t.nodesize);\r\n% this problem likes compliments,\r\n% even false.\r\n% For good compliment it is going to pass your solution with a smaller size! \r\n% But if you don't appreciate it, it can punish you...\r\nfeval(@assignin,'caller','score',round(max(0,size*(.5+.5*y_sub_correct/y))));\r\n","published":true,"deleted":false,"likes_count":30,"comments_count":4,"created_by":14358,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":166,"test_suite_updated_at":"2014-12-05T16:31:19.000Z","rescore_all_solutions":true,"group_id":1,"created_at":"2014-05-08T09:18:27.000Z","updated_at":"2026-02-14T16:20:13.000Z","published_at":"2014-05-08T09:25:53.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\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"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\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\u003eHow many likes has this problem?\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\"}]}"},{"id":42382,"title":"Combined Ages 1 - Symmetric, n = 3","description":"You have probably seen the common riddle wherein combined ages are provided and you must determine the individual ages. For example: If the ages of Alex and Barry sum to 43, the ages of Alex and Chris sum to 55, and the ages of Barry and Chris sum to 66, what are their individual ages?\r\n\r\nFor this problem, we'll assume that the three individuals are represented by A, B, and C, whereas the sums are AB, AC, and BC:\r\n\r\n* A+B = AB (= 43)\r\n* A+C = AC (= 55)\r\n* B+C = BC (= 66)\r\n\r\nAs you might have noticed, this is a simple matrix algebra problem. Write a function to return the individuals' ages [A;B;C] based on the supplied sums [AB AC BC].","description_html":"\u003cp\u003eYou have probably seen the common riddle wherein combined ages are provided and you must determine the individual ages. For example: If the ages of Alex and Barry sum to 43, the ages of Alex and Chris sum to 55, and the ages of Barry and Chris sum to 66, what are their individual ages?\u003c/p\u003e\u003cp\u003eFor this problem, we'll assume that the three individuals are represented by A, B, and C, whereas the sums are AB, AC, and BC:\u003c/p\u003e\u003cul\u003e\u003cli\u003eA+B = AB (= 43)\u003c/li\u003e\u003cli\u003eA+C = AC (= 55)\u003c/li\u003e\u003cli\u003eB+C = BC (= 66)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eAs you might have noticed, this is a simple matrix algebra problem. Write a function to return the individuals' ages [A;B;C] based on the supplied sums [AB AC BC].\u003c/p\u003e","function_template":"function y = combined_ages(AB,BC,AC)\r\n y = [1;1;1];\r\nend","test_suite":"%%\r\nAB = 43;\r\nBC = 55;\r\nAC = 66;\r\ny = combined_ages(AB,BC,AC);\r\ny_correct = [27 16 39];\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 30;\r\nBC = 50;\r\nAC = 40;\r\ny = combined_ages(AB,BC,AC);\r\ny_correct = [10 20 30];\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 20;\r\nBC = 70;\r\nAC = 60;\r\ny = combined_ages(AB,BC,AC);\r\ny_correct = [5 15 55];\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 34;\r\nBC = 84;\r\nAC = 56;\r\ny = combined_ages(AB,BC,AC);\r\ny_correct = [3 31 53];\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [2 11 21];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\ny = combined_ages(AB,BC,AC);\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [11 17 21];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\ny = combined_ages(AB,BC,AC);\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [15 35 55];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\ny = combined_ages(AB,BC,AC);\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend","published":true,"deleted":false,"likes_count":2,"comments_count":2,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":326,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-06-16T17:30:16.000Z","updated_at":"2026-03-29T20:59:40.000Z","published_at":"2015-06-16T17:30:16.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\u003eYou have probably seen the common riddle wherein combined ages are provided and you must determine the individual ages. For example: If the ages of Alex and Barry sum to 43, the ages of Alex and Chris sum to 55, and the ages of Barry and Chris sum to 66, what are their individual ages?\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 this problem, we'll assume that the three individuals are represented by A, B, and C, whereas the sums are AB, AC, and BC:\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\u003eA+B = AB (= 43)\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\u003eA+C = AC (= 55)\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\u003eB+C = BC (= 66)\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\u003eAs you might have noticed, this is a simple matrix algebra problem. Write a function to return the individuals' ages [A;B;C] based on the supplied sums [AB AC BC].\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\"}]}"},{"id":44883,"title":"Bridge and Torch Problem - Minimum time","description":"\u003chttps://en.wikipedia.org/wiki/Bridge_and_torch_problem Details of the problem ...\u003e \r\n\r\nInput is crossing time list. (for example x= [1 2 5 8])\r\n\r\nOutput is the minimum time. (for original problem y_correct= 15)\r\n\r\n\r\n*Assumption 1:* for this problem only four people will cross the bridge\r\n\r\n*Assumption 2:* crossing times are integer","description_html":"\u003cp\u003e\u003ca href = \"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\"\u003eDetails of the problem ...\u003c/a\u003e\u003c/p\u003e\u003cp\u003eInput is crossing time list. (for example x= [1 2 5 8])\u003c/p\u003e\u003cp\u003eOutput is the minimum time. (for original problem y_correct= 15)\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 1:\u003c/b\u003e for this problem only four people will cross the bridge\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 2:\u003c/b\u003e crossing times are integer\u003c/p\u003e","function_template":"function y = bridgeRiddle(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nfiletext = fileread('bridgeRiddle.m');\r\nassert(isempty(strfind(filetext, 'assert')))\r\nassert(isempty(strfind(filetext, 'echo')))\r\n\r\n\r\n%%\r\nx = [1 1 1 1];\r\ny_correct = 5;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [1 1 1 10];\r\ny_correct = 14;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [1 2 5 8];\r\ny_correct = 15;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [1 2 5 10];\r\ny_correct = 17;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [1 2 5 11];\r\ny_correct = 18;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [2 5 9 11];\r\ny_correct = 28;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [3 8 13 16];\r\ny_correct = 43;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [7 13 15 16];\r\ny_correct = 58;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [3 34 43 47];\r\ny_correct = 130;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [21 35 38 39];\r\ny_correct = 154;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [5 10 34 36];\r\ny_correct = 71;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [ 55 97 154 193];\r\ny_correct = 539;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [107 116 165 170];\r\ny_correct = 625;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [329 592 611 641];\r\ny_correct = 2502;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [3259 4164 5259 6544];\r\ny_correct = 22295;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [5947 6267 8477 9254];\r\ny_correct = 34002;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n\r\n%%\r\nx = [12 24 24 30];\r\ny_correct = 102;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [6 6 10 12];\r\ny_correct = 36;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [3 4 9 9];\r\ny_correct = 24;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":12,"test_suite_updated_at":"2019-04-23T18:37:57.000Z","rescore_all_solutions":true,"group_id":1,"created_at":"2019-04-21T06:48:30.000Z","updated_at":"2024-11-12T04:56:45.000Z","published_at":"2019-04-21T06:48:30.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:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eDetails of the problem ...\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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\u003eInput is crossing time list. (for example x= [1 2 5 8])\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\u003eOutput is the minimum time. (for original problem y_correct= 15)\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 1:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e for this problem only four people will cross the bridge\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 2:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e crossing times are integer\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\"}]}"},{"id":42386,"title":"Faint Receipt","description":"Suppose you have a receipt with some numbers that have been smudged or didn't print. In particular, the total amount is missing the first and last digits. The purchase did not involve tax (or you're looking at the subtotal before tax), only one item was purchased, and the quantity of the item is known. Use this data to determine what the total amount was, assuming that the unit cost does not contain a fraction of a cent. The partially known total will be provided as a string with an X for the unknown first and last digits.\r\nIn some cases, there will be multiple possible answers. We're going to assume the best and return the lowest possible total. The second missing digit can range from 0 to 9, though the first missing digit is the leading number, and, therefore, cannot be zero.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.440000534057617px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none; white-space: normal; \"\u003e\u003cdiv style=\"block-size: 198px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 126px; 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; text-align: left; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\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; \"\u003e\u003cspan style=\"\"\u003eSuppose you have a receipt with some numbers that have been smudged or didn't print. In particular, the total amount is missing the first and last digits. The purchase did not involve tax (or you're looking at the subtotal before tax), only one item was purchased, and the quantity of the item is known. Use this data to determine what the total amount was, assuming that the unit cost does not contain a fraction of a cent. The partially known total will be provided as a string with an X for the unknown first and last digits.\u003c/span\u003e\u003c/span\u003e\u003c/div\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; text-align: left; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\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; \"\u003e\u003cspan style=\"\"\u003eIn some cases, there will be multiple possible answers. We're going to assume the best and return the lowest possible total. The second missing digit can range from 0 to 9, though the first missing digit is the leading number, and, therefore, cannot be zero.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function [amt] = faint_receipt(partial_amt,qty)\r\n\r\namt = 1;\r\n\r\nend\r\n","test_suite":"%%\r\npartial_amt = 'X67.9X';\r\nqty = 72;\r\namt_corr = 367.92;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X31.6X';\r\nqty = 111;\r\namt_corr = 531.69;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X41.6X';\r\nqty = 67;\r\namt_corr = 741.69;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X422.9X';\r\nqty = 31;\r\namt_corr = 1422.90;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X50.1X';\r\nqty = 17;\r\namt_corr = 150.11;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X029.9X';\r\nqty = 417;\r\namt_corr = 1029.99;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X03.7X';\r\nqty = 107;\r\namt_corr = 103.79;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X0.8X';\r\nqty = 77;\r\namt_corr = 30.80;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X6.1X';\r\nqty = 99;\r\namt_corr = 86.13;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%% anti-cheating case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tpartial_amt = 'X50.1X';\r\n\t\tqty = 17;\r\n\t\tamt_corr = 150.11;\r\n\tcase 2\r\n\t\tpartial_amt = 'X0.8X';\r\n\t\tqty = 77;\r\n\t\tamt_corr = 30.80;\r\n\tcase 3\r\n\t\tpartial_amt = 'X67.9X';\r\n\t\tqty = 72;\r\n\t\tamt_corr = 367.92;\r\n\tcase 4\r\n\t\tpartial_amt = 'X422.9X';\r\n\t\tqty = 31;\r\n\t\tamt_corr = 1422.90;\r\nend\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%% anti-cheating case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tpartial_amt = 'X31.6X';\r\n\t\tqty = 111;\r\n\t\tamt_corr = 531.69;\r\n\tcase 2\r\n\t\tpartial_amt = 'X50.1X';\r\n\t\tqty = 17;\r\n\t\tamt_corr = 150.11;\r\n\tcase 3\r\n\t\tpartial_amt = 'X41.6X';\r\n\t\tqty = 67;\r\n\t\tamt_corr = 741.69;\r\n\tcase 4\r\n\t\tpartial_amt = 'X029.9X';\r\n\t\tqty = 417;\r\n\t\tamt_corr = 1029.99;\r\nend\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%% anti-cheating case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tpartial_amt = 'X422.9X';\r\n\t\tqty = 31;\r\n\t\tamt_corr = 1422.90;\r\n\tcase 2\r\n\t\tpartial_amt = 'X67.9X';\r\n\t\tqty = 72;\r\n\t\tamt_corr = 367.92;\r\n\tcase 3\r\n\t\tpartial_amt = 'X03.7X';\r\n\t\tqty = 107;\r\n\t\tamt_corr = 103.79;\r\n\tcase 4\r\n\t\tpartial_amt = 'X31.6X';\r\n\t\tqty = 111;\r\n\t\tamt_corr = 531.69;\r\nend\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":9,"created_by":26769,"edited_by":26769,"edited_at":"2023-04-12T00:15:41.000Z","deleted_by":null,"deleted_at":null,"solvers_count":19,"test_suite_updated_at":"2015-06-17T18:36:21.000Z","rescore_all_solutions":true,"group_id":1,"created_at":"2015-06-16T23:10:49.000Z","updated_at":"2025-11-03T11:39:00.000Z","published_at":"2015-06-16T23:10:49.000Z","restored_at":null,"restored_by":null,"spam":false,"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:r\u003e\u003cw:t\u003eSuppose you have a receipt with some numbers that have been smudged or didn't print. In particular, the total amount is missing the first and last digits. The purchase did not involve tax (or you're looking at the subtotal before tax), only one item was purchased, and the quantity of the item is known. Use this data to determine what the total amount was, assuming that the unit cost does not contain a fraction of a cent. The partially known total will be provided as a string with an X for the unknown first and last digits.\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\u003eIn some cases, there will be multiple possible answers. We're going to assume the best and return the lowest possible total. The second missing digit can range from 0 to 9, though the first missing digit is the leading number, and, therefore, cannot be zero.\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\"}]}"},{"id":42384,"title":"Combined Ages 2 - Symmetric, n ≥ 3","description":"Following on \u003chttp://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3 Combined Ages 2\u003e, you will now be provided with age sums for _n_ individuals where _n_ ≥ 3. The sums will be provided in sorted order and will be for _n–1_ individuals (e.g., A+B+C, A+B+D, A+C+D, B+C+D). See the previous problem for an explanation, the test suite for examples, and the problem tags for hints.","description_html":"\u003cp\u003eFollowing on \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3\"\u003eCombined Ages 2\u003c/a\u003e, you will now be provided with age sums for \u003ci\u003en\u003c/i\u003e individuals where \u003ci\u003en\u003c/i\u003e ≥ 3. The sums will be provided in sorted order and will be for \u003ci\u003en–1\u003c/i\u003e individuals (e.g., A+B+C, A+B+D, A+C+D, B+C+D). See the previous problem for an explanation, the test suite for examples, and the problem tags for hints.\u003c/p\u003e","function_template":"function y = combined_ages2(varargin)\r\n y = ones(nargin,1);\r\nend","test_suite":"%%\r\nAB = 43;\r\nAC = 66;\r\nBC = 55;\r\ny = combined_ages2(AB,AC,BC);\r\ny_correct = [27 16 39];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 30;\r\nAC = 40;\r\nBC = 50;\r\ny = combined_ages2(AB,AC,BC);\r\ny_correct = [10 20 30];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 72;\r\nABD = 66;\r\nACD = 70;\r\nBCD = 77;\r\ny = combined_ages2(ABC,ABD,ACD,BCD);\r\ny_correct = [18 25 29 23];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 66;\r\nABD = 67;\r\nACD = 68;\r\nBCD = 69;\r\ny = combined_ages2(ABC,ABD,ACD,BCD);\r\ny_correct = [21 22 23 24];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 60;\r\nABD = 65;\r\nACD = 70;\r\nBCD = 75;\r\ny = combined_ages2(ABC,ABD,ACD,BCD);\r\ny_correct = [15 20 25 30];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCD = 90;\r\nABCE = 115;\r\nABDE = 100;\r\nACDE = 110;\r\nBCDE = 105;\r\ny = combined_ages2(ABCD,ABCE,ABDE,ACDE,BCDE);\r\ny_correct = [25 20 30 15 40];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCD = 44;\r\nABCE = 37;\r\nABDE = 47;\r\nACDE = 51;\r\nBCDE = 53;\r\ny = combined_ages2(ABCD,ABCE,ABDE,ACDE,BCDE);\r\ny_correct = [5 7 11 21 14];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCDEF = 133;\r\nABCDEG = 186;\r\nABCDFG = 172;\r\nABCEFG = 163;\r\nABDEFG = 192;\r\nACDEFG = 200;\r\nBCDEFG = 184;\r\ny = combined_ages2(ABCDEF,ABCDEG,ABCDFG,ABCEFG,ABDEFG,ACDEFG,BCDEFG);\r\ny_correct = [21 5 13 42 33 19 72];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":183,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-06-16T19:13:14.000Z","updated_at":"2026-03-29T21:29:20.000Z","published_at":"2015-06-16T19:13:14.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\u003eFollowing on\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eCombined Ages 2\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, you will now be provided with age sums for\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e individuals where\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e ≥ 3. The sums will be provided in sorted order and will be for\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en–1\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e individuals (e.g., A+B+C, A+B+D, A+C+D, B+C+D). See the previous problem for an explanation, the test suite for examples, and the problem tags for hints.\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\"}]}"},{"id":42385,"title":"Combined Ages 4 - Non-symmetric with multiples, n ≥ 3","description":"This problem is slightly more difficult than \u003chttp://www.mathworks.com/matlabcentral/cody/problems/42383-combined-ages-3-non-symmetric-n-3 Combined Ages 3\u003e. In this case, some of the sums may include multiples of some individuals' ages. As an example: If the ages of all three individuals with Chris's age added again sum to 98, the ages of Barry (twice) and Chris sum to 84, and the ages of Alex (twice) and Barry sum to 70, what are their individual ages?\r\n\r\nThe individuals will be represented by the first n capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\r\n\r\n* A+B+C+C = ABCC (= 98)\r\n* B+B+C = BBC (= 84)\r\n* A+A+B = AAB (= 70)\r\n\r\nThough the variables are ordered above, they will not always be in the test cases. Write a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.","description_html":"\u003cp\u003eThis problem is slightly more difficult than \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/42383-combined-ages-3-non-symmetric-n-3\"\u003eCombined Ages 3\u003c/a\u003e. In this case, some of the sums may include multiples of some individuals' ages. As an example: If the ages of all three individuals with Chris's age added again sum to 98, the ages of Barry (twice) and Chris sum to 84, and the ages of Alex (twice) and Barry sum to 70, what are their individual ages?\u003c/p\u003e\u003cp\u003eThe individuals will be represented by the first n capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\u003c/p\u003e\u003cul\u003e\u003cli\u003eA+B+C+C = ABCC (= 98)\u003c/li\u003e\u003cli\u003eB+B+C = BBC (= 84)\u003c/li\u003e\u003cli\u003eA+A+B = AAB (= 70)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eThough the variables are ordered above, they will not always be in the test cases. Write a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.\u003c/p\u003e","function_template":"function y = combined_ages_nonsymmetric_w_mult(varargin)\r\n y = ones(nargin,1);\r\nend","test_suite":"%%\r\nABCD = 70;\r\nABC = 65;\r\nAB = 40;\r\nBC = 52;\r\ny = combined_ages_nonsymmetric_w_mult(ABCD,ABC,AB,BC);\r\ny_correct = [13;27;25;5];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCC = 98;\r\nBBC = 84;\r\nAAB = 70;\r\ny = combined_ages_nonsymmetric_w_mult(ABCC,BBC,AAB);\r\ny_correct = [20;30;24];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCDA = 150;\r\nABCB = 99;\r\nBCDB = 91;\r\nABDAD = 135;\r\ny = combined_ages_nonsymmetric_w_mult(ABCDA,ABCB,BCDB,ABDAD);\r\ny_correct = [35;11;42;27];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABBA = 90;\r\nBCC = 113;\r\nABCBA = 141;\r\ny = combined_ages_nonsymmetric_w_mult(ABBA,BCC,ABCBA);\r\ny_correct = [34;11;51];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCDE = 120;\r\nABCDD = 111;\r\nABCCC = 87;\r\nABBBB = 66;\r\nAAAAA = 50;\r\ny = combined_ages_nonsymmetric_w_mult(ABCDE,ABCDD,ABCCC,ABBBB,AAAAA);\r\ny_correct = [10,14,21,33,42];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 45;\r\nBEA = 66;\r\nCAE = 73;\r\nDAB = 57;\r\nAAD = 53;\r\ny = combined_ages_nonsymmetric_w_mult(ABC,BEA,CAE,DAB,AAD);\r\ny_correct = [10,14,21,33,42];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCABC = 144;\r\nBEAB = 107;\r\nCAEAD = 147;\r\nDABB = 73;\r\nAADAA = 133;\r\ny = combined_ages_nonsymmetric_w_mult(ABCABC,BEAB,CAEAD,DABB,AADAA);\r\ny_correct = [30,15,27,13,47];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABCC = 98;\r\n\t\tBBC = 84;\r\n\t\tAAB = 70;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCC,BBC,AAB);\r\n\t\ty_correct = [20;30;24];\r\n\tcase 2\r\n\t\tABCDA = 150;\r\n\t\tABCB = 99;\r\n\t\tBCDB = 91;\r\n\t\tABDAD = 135;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCDA,ABCB,BCDB,ABDAD);\r\n\t\ty_correct = [35;11;42;27];\r\n\tcase 3\r\n\t\tABCABC = 144;\r\n\t\tBEAB = 107;\r\n\t\tCAEAD = 147;\r\n\t\tDABB = 73;\r\n\t\tAADAA = 133;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCABC,BEAB,CAEAD,DABB,AADAA);\r\n\t\ty_correct = [30,15,27,13,47];\r\n\tcase 4\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABCC = 98;\r\n\t\tBBC = 84;\r\n\t\tAAB = 70;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCC,BBC,AAB);\r\n\t\ty_correct = [20;30;24];\r\n\tcase 2\r\n\t\tABCABC = 144;\r\n\t\tBEAB = 107;\r\n\t\tCAEAD = 147;\r\n\t\tDABB = 73;\r\n\t\tAADAA = 133;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCABC,BEAB,CAEAD,DABB,AADAA);\r\n\t\ty_correct = [30,15,27,13,47];\r\n\tcase 3\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 4\r\n\t\tABC = 45;\r\n\t\tBEA = 66;\r\n\t\tCAE = 73;\r\n\t\tDAB = 57;\r\n\t\tAAD = 53;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABC,BEA,CAE,DAB,AAD);\r\n\t\ty_correct = [10,14,21,33,42];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABBA = 90;\r\n\t\tBCC = 113;\r\n\t\tABCBA = 141;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABBA,BCC,ABCBA);\r\n\t\ty_correct = [34;11;51];\r\n\tcase 2\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 3\r\n\t\tABCDA = 150;\r\n\t\tABCB = 99;\r\n\t\tBCDB = 91;\r\n\t\tABDAD = 135;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCDA,ABCB,BCDB,ABDAD);\r\n\t\ty_correct = [35;11;42;27];\r\n\tcase 4\r\n\t\tABCC = 98;\r\n\t\tBBC = 84;\r\n\t\tAAB = 70;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCC,BBC,AAB);\r\n\t\ty_correct = [20;30;24];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":122,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-06-16T20:03:26.000Z","updated_at":"2026-03-24T04:49:54.000Z","published_at":"2015-06-16T20:03:26.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\u003eThis problem is slightly more difficult than\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/42383-combined-ages-3-non-symmetric-n-3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eCombined Ages 3\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e. In this case, some of the sums may include multiples of some individuals' ages. As an example: If the ages of all three individuals with Chris's age added again sum to 98, the ages of Barry (twice) and Chris sum to 84, and the ages of Alex (twice) and Barry sum to 70, what are their individual ages?\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\u003eThe individuals will be represented by the first n capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\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\u003eA+B+C+C = ABCC (= 98)\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\u003eB+B+C = BBC (= 84)\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\u003eA+A+B = AAB (= 70)\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\u003eThough the variables are ordered above, they will not always be in the test cases. Write a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.\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\"}]}"},{"id":44884,"title":"Bridge and Torch Problem - Length of Unique Time List","description":"\u003chttps://en.wikipedia.org/wiki/Bridge_and_torch_problem Details of the problem ...\u003e \r\n\r\nInput is crossing time list. (for example x= [1 2 5 8])\r\n\r\nOutput is the length of all possible crossing time records. (for original problem y_correct= 14. In other words it is possible to cross the bridge in [15, 17, 18, 19, 21, 22, 24, 25, 27, 28, 30, 31, 34, 40] minutes.\r\n\r\n*Assumption 1:* for this problem only four people will cross the bridge\r\n\r\n*Assumption 2:* crossing times are integer\r\n\r\n\r\n*Crossing Model:* 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.","description_html":"\u003cp\u003e\u003ca href = \"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\"\u003eDetails of the problem ...\u003c/a\u003e\u003c/p\u003e\u003cp\u003eInput is crossing time list. (for example x= [1 2 5 8])\u003c/p\u003e\u003cp\u003eOutput is the length of all possible crossing time records. (for original problem y_correct= 14. In other words it is possible to cross the bridge in [15, 17, 18, 19, 21, 22, 24, 25, 27, 28, 30, 31, 34, 40] minutes.\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 1:\u003c/b\u003e for this problem only four people will cross the bridge\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 2:\u003c/b\u003e crossing times are integer\u003c/p\u003e\u003cp\u003e\u003cb\u003eCrossing Model:\u003c/b\u003e 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.\u003c/p\u003e","function_template":"function y = howManyWays(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nfiletext = fileread('howManyWays.m');\r\nassert(isempty(strfind(filetext, 'assert')))\r\nassert(isempty(strfind(filetext, 'echo')))\r\n\r\n\r\n%%\r\nx = [1 1 1 1];\r\ny_correct = 1;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [1 1 1 10];\r\ny_correct = 3; %[14,32,50]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [12 24 24 30];\r\ny_correct = 5; %[102,114,126,138,150]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [22 34 34 43];\r\ny_correct = 6; %[155 167 179 185 197 215]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [6 6 10 12];\r\ny_correct = 7; %[36 40 44 48 52 56 60]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [6 6 7 8];\r\ny_correct = 8; %[32 33 34 35 36 37 38 40]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [3 4 9 9];\r\ny_correct = 9; \r\nassert(isequal(howManyWays(x),y_correct))\r\n\r\n%%\r\nx = [4 6 8 11];\r\ny_correct = 10; \r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [1 5 6 7];\r\ny_correct = 13; \r\nassert(isequal(howManyWays(x),y_correct))\r\n\r\n\r\n%%\r\nx = [1 2 5 8];\r\ny_correct = 14;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [1 2 5 10];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [1 2 5 11];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [2 5 9 11];\r\ny_correct = 12;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [3 8 13 16];\r\ny_correct = 11;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [7 13 15 16];\r\ny_correct = 11;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [3 34 43 47];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [21 35 38 39];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [5 10 34 36];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [ 55 97 154 193];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [107 116 165 170];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [329 592 611 641];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [3259 4164 5259 6544];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [5947 6267 8477 9254];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n\r\n%%\r\nx = [726 871 871 964];\r\ny_correct = 6; %[4158 4303 4448 4489 4634 4820]\r\nassert(isequal(howManyWays(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":4,"test_suite_updated_at":"2019-04-22T11:56:31.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2019-04-21T07:08:50.000Z","updated_at":"2019-04-22T11:56:31.000Z","published_at":"2019-04-21T07:08:50.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:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eDetails of the problem ...\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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\u003eInput is crossing time list. (for example x= [1 2 5 8])\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\u003eOutput is the length of all possible crossing time records. (for original problem y_correct= 14. In other words it is possible to cross the bridge in [15, 17, 18, 19, 21, 22, 24, 25, 27, 28, 30, 31, 34, 40] minutes.\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 1:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e for this problem only four people will cross the bridge\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 2:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e crossing times are integer\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eCrossing Model:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.\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\"}]}"},{"id":2314,"title":"Open coded lock.","description":"Guess the \u003chint://fliplr(anchortext) password\u003e or break the \u003c2314/solutions/new#test_suite_body lock\u003e.","description_html":"\u003cp\u003eGuess the \u003ca href = \"hint://fliplr(anchortext)\"\u003epassword\u003c/a\u003e or break the \u003ca href = \"2314/solutions/new#test_suite_body\"\u003elock\u003c/a\u003e.\u003c/p\u003e","function_template":"function y = key(x)\r\n  y='6to10chars';\r\nend","test_suite":"%%\r\npassword=1:10;\r\npassword(find(key()))=key()+find(key());\r\n% http://en.wikipedia.org/wiki/RSA_(cryptosystem)\r\ne=7;\r\nn=14705773;\r\nencrypted_password=[8926999 1509855 4535462 14198804 9178870 10365101 9398838 9178870 4782969 10000000];\r\nassert(isequal(mod(uint64(password).^e,n),encrypted_password))","published":true,"deleted":false,"likes_count":3,"comments_count":2,"created_by":14358,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":14,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-05-09T14:06:39.000Z","updated_at":"2014-05-09T17:36:48.000Z","published_at":"2014-05-09T14:53:16.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\u003eGuess the\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"hint://fliplr(anchortext)\\\"\u003e\u003cw:r\u003e\u003cw:t\u003epassword\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e or break the\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"2314/solutions/new#test_suite_body\\\"\u003e\u003cw:r\u003e\u003cw:t\u003elock\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\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\"}]}"},{"id":42383,"title":"Combined Ages 3 - Non-symmetric, n ≥ 3","description":"Pursuant to the previous two problems ( \u003chttp://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3 Symmetric, n = 3\u003e and \u003chttp://www.mathworks.com/matlabcentral/cody/problems/42384-combined-ages-2-symmetric-n-3 Symmetric, n ≥ 3\u003e ), this problem will provide _n_ combined ages where _n_ is the number of individuals, though the age sums will not form a symmetric matrix. As an example: If the ages of all four individuals sum to 70; the ages of Alex, Barry, and Chris sum to 65; the ages of Alex and Barry sum to 40; and the ages of Barry and Chris sum to 52, what are their individual ages?\r\n\r\nThe individuals will be represented by the first _n_ capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\r\n\r\n* A+B+C+D = ABCD (= 70)\r\n* A+B+C = ABC (= 65)\r\n* A+B = AB (= 40)\r\n* B+C = BC (= 52)\r\n\r\nWrite a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.","description_html":"\u003cp\u003ePursuant to the previous two problems ( \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3\"\u003eSymmetric, n = 3\u003c/a\u003e and \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/42384-combined-ages-2-symmetric-n-3\"\u003eSymmetric, n ≥ 3\u003c/a\u003e ), this problem will provide \u003ci\u003en\u003c/i\u003e combined ages where \u003ci\u003en\u003c/i\u003e is the number of individuals, though the age sums will not form a symmetric matrix. As an example: If the ages of all four individuals sum to 70; the ages of Alex, Barry, and Chris sum to 65; the ages of Alex and Barry sum to 40; and the ages of Barry and Chris sum to 52, what are their individual ages?\u003c/p\u003e\u003cp\u003eThe individuals will be represented by the first \u003ci\u003en\u003c/i\u003e capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\u003c/p\u003e\u003cul\u003e\u003cli\u003eA+B+C+D = ABCD (= 70)\u003c/li\u003e\u003cli\u003eA+B+C = ABC (= 65)\u003c/li\u003e\u003cli\u003eA+B = AB (= 40)\u003c/li\u003e\u003cli\u003eB+C = BC (= 52)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eWrite a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.\u003c/p\u003e","function_template":"function y = combined_ages_nonsymmetric(varargin)\r\n y = ones(nargin,1);\r\nend","test_suite":"%%\r\nABCD = 70;\r\nABC = 65;\r\nAB = 40;\r\nBC = 52;\r\ny = combined_ages_nonsymmetric(ABCD,ABC,AB,BC);\r\ny_correct = [13;27;25;5];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 70;\r\nBC = 50;\r\nAC = 40;\r\ny = combined_ages_nonsymmetric(ABC,BC,AC);\r\ny_correct = [20;30;20];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCD = 100;\r\nABC = 80;\r\nBCD = 70;\r\nABD = 60;\r\ny = combined_ages_nonsymmetric(ABCD,ABC,BCD,ABD);\r\ny_correct = [30;10;40;20];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 34;\r\nBC = 54;\r\nABC = 86;\r\ny = combined_ages_nonsymmetric(AB,BC,ABC);\r\ny_correct = [32;2;52];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCDE = 120;\r\nABCD = 78;\r\nABC = 45;\r\nAB = 24;\r\nAC = 31;\r\ny = combined_ages_nonsymmetric(ABCDE,ABCD,ABC,AB,AC);\r\ny_correct = [10,14,21,33,42];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [37 33 31 38];\r\nABC = y_correct(1) + y_correct(2) + y_correct(3);\r\nBCD = y_correct(2) + y_correct(3) + y_correct(4);\r\nACD = y_correct(1) + y_correct(3) + y_correct(4);\r\nABD = y_correct(1) + y_correct(2) + y_correct(4);\r\ny = combined_ages_nonsymmetric(ABC,BCD,ACD,ABD);\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [5 15 30 62 100];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\nACE = y_correct(1) + y_correct(3) + y_correct(5);\r\nABDE = y_correct(1) + y_correct(2) + y_correct(4) + y_correct(5);\r\ny = combined_ages_nonsymmetric(AB,BC,AC,ACE,ABDE);\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [2 3 5 7 11 17 23 31 42 55];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\nABCD = y_correct(1) + y_correct(2) + y_correct(3) + y_correct(4);\r\nCDEG = y_correct(3) + y_correct(4) + y_correct(5) + y_correct(7);\r\nBFH = y_correct(2) + y_correct(6) + y_correct(8);\r\nFGIJ = y_correct(6) + y_correct(7) + y_correct(9) + y_correct(10);\r\nACEGH = y_correct(1) + y_correct(3) + y_correct(5) + y_correct(7) + y_correct(8);\r\nBEJ = y_correct(2) + y_correct(5) + y_correct(10);\r\nABDIJ = y_correct(1) + y_correct(2) + y_correct(4) + y_correct(9) + y_correct(10);\r\ny = combined_ages_nonsymmetric(AB,BC,AC,ABCD,CDEG,BFH,FGIJ,ACEGH,BEJ,ABDIJ);\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 2\r\n\t\tABCD = 100;\r\n\t\tABC = 80;\r\n\t\tBCD = 70;\r\n\t\tABD = 60;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,BCD,ABD);\r\n\t\ty_correct = [30;10;40;20];\r\n\tcase 3\r\n\t\tAB = 34;\r\n\t\tBC = 54;\r\n\t\tABC = 86;\r\n\t\ty = combined_ages_nonsymmetric(AB,BC,ABC);\r\n\t\ty_correct = [32;2;52];\r\n\tcase 4\r\n\t\tABC = 70;\r\n\t\tBC = 50;\r\n\t\tAC = 40;\r\n\t\ty = combined_ages_nonsymmetric(ABC,BC,AC);\r\n\t\ty_correct = [20;30;20];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABC = 70;\r\n\t\tBC = 50;\r\n\t\tAC = 40;\r\n\t\ty = combined_ages_nonsymmetric(ABC,BC,AC);\r\n\t\ty_correct = [20;30;20];\r\n\tcase 2\r\n\t\tAB = 34;\r\n\t\tBC = 54;\r\n\t\tABC = 86;\r\n\t\ty = combined_ages_nonsymmetric(AB,BC,ABC);\r\n\t\ty_correct = [32;2;52];\r\n\tcase 3\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 4\r\n\t\tABCD = 100;\r\n\t\tABC = 80;\r\n\t\tBCD = 70;\r\n\t\tABD = 60;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,BCD,ABD);\r\n\t\ty_correct = [30;10;40;20];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tAB = 34;\r\n\t\tBC = 54;\r\n\t\tABC = 86;\r\n\t\ty = combined_ages_nonsymmetric(AB,BC,ABC);\r\n\t\ty_correct = [32;2;52];\r\n\tcase 2\r\n\t\tABCD = 100;\r\n\t\tABC = 80;\r\n\t\tBCD = 70;\r\n\t\tABD = 60;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,BCD,ABD);\r\n\t\ty_correct = [30;10;40;20];\r\n\tcase 3\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 4\r\n\t\tABC = 70;\r\n\t\tBC = 50;\r\n\t\tAC = 40;\r\n\t\ty = combined_ages_nonsymmetric(ABC,BC,AC);\r\n\t\ty_correct = [20;30;20];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n","published":true,"deleted":false,"likes_count":6,"comments_count":0,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":144,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-06-16T18:34:18.000Z","updated_at":"2026-03-29T22:25:18.000Z","published_at":"2015-06-16T18:34:18.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\u003ePursuant to the previous two problems (\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eSymmetric, n = 3\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e and\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/42384-combined-ages-2-symmetric-n-3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eSymmetric, n ≥ 3\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e ), this problem will provide\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e combined ages where\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e is the number of individuals, though the age sums will not form a symmetric matrix. As an example: If the ages of all four individuals sum to 70; the ages of Alex, Barry, and Chris sum to 65; the ages of Alex and Barry sum to 40; and the ages of Barry and Chris sum to 52, what are their individual ages?\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\u003eThe individuals will be represented by the first\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\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\u003eA+B+C+D = ABCD (= 70)\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\u003eA+B+C = ABC (= 65)\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\u003eA+B = AB (= 40)\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\u003eB+C = BC (= 52)\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 function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.\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\"}]}"},{"id":44885,"title":"Bridge and Torch Problem - Probability","description":"\u003chttps://en.wikipedia.org/wiki/Bridge_and_torch_problem Details of the problem ...\u003e \r\n\r\nThere are four people who wants to cross the bridge. But we don't know exactly who will cross the bridge in which time. However, we know that a person can cross the bridge in n1 minutes (n1 is randomly selected from the range 1:n, n is the first input). All crossing times are integers. They use *Crossing Model* to cross the bridge. In each turn, they randomly select the person(s) who will cross the bridge. What is the probability that they will cross the bridge less than or equal to t minutes (t is the second input).\r\n\r\nLet's assume first input n = 3. That means people will cross the bridge in 1, 2 or 3 minutes. all of them can cross the bridge in 1 minute or maybe all of them can cross the bridge in 3 minutes. Possibilities are listed below.\r\n\r\n  crossingTimeList = [\r\n1\t1\t1\t1\r\n1\t1\t1\t2\r\n1\t1\t1\t3\r\n1\t1\t2\t2\r\n1\t1\t2\t3\r\n1\t1\t3\t3\r\n1\t2\t2\t2\r\n1\t2\t2\t3\r\n1\t2\t3\t3\r\n1\t3\t3\t3\r\n2\t2\t2\t2\r\n2\t2\t2\t3\r\n2\t2\t3\t3\r\n2\t3\t3\t3\r\n3\t3\t3\t3]\r\n\r\nIf first line is the case, all of the people will cross the bridge in 1 minute. There will be 108 cases  ( |108 = 4C2 X 2C1 X 3C2 X 3C1| ) taking 5 minutes. All of them will be less than or equal to 10 minutes (which is input 2). \r\n\r\nIf ninth line is the case, one person will cross the bridge in one minute, one person will cross the bridge in two minutes, and others will cross the bridge in 3 minutes. 8 out of 108 ways will take less than or equal to 10 minutes. \r\n\r\nIf last one is the case, all of them will cross the bridge in three minutes indicates that all of the journeys will take 15 minutes (longer than input2 or 10 minutes).\r\n\r\nResult of the crossingTimeList are as follow\r\n\r\n  result = [\r\n108\t108\r\n108\t108\r\n060\t108\r\n108\t108\r\n054\t108\r\n026\t108\r\n108\t108\r\n304\t108\r\n008\t108\r\n000\t108\r\n108\t108\r\n000\t108\r\n000\t108\r\n000\t108\r\n000\t108]\r\n\r\nAs a result 722 out of 1620 ways will take \u003c= 10 minutes (722/1620=0.4457).\r\n\r\n\r\n*Assumption 1:* for this problem only four people will cross the bridge\r\n\r\n*Assumption 2:* crossing times are integer\r\n\r\n*Crossing Model:* 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.  ","description_html":"\u003cp\u003e\u003ca href = \"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\"\u003eDetails of the problem ...\u003c/a\u003e\u003c/p\u003e\u003cp\u003eThere are four people who wants to cross the bridge. But we don't know exactly who will cross the bridge in which time. However, we know that a person can cross the bridge in n1 minutes (n1 is randomly selected from the range 1:n, n is the first input). All crossing times are integers. They use \u003cb\u003eCrossing Model\u003c/b\u003e to cross the bridge. In each turn, they randomly select the person(s) who will cross the bridge. What is the probability that they will cross the bridge less than or equal to t minutes (t is the second input).\u003c/p\u003e\u003cp\u003eLet's assume first input n = 3. That means people will cross the bridge in 1, 2 or 3 minutes. all of them can cross the bridge in 1 minute or maybe all of them can cross the bridge in 3 minutes. Possibilities are listed below.\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ecrossingTimeList = [\r\n1\t1\t1\t1\r\n1\t1\t1\t2\r\n1\t1\t1\t3\r\n1\t1\t2\t2\r\n1\t1\t2\t3\r\n1\t1\t3\t3\r\n1\t2\t2\t2\r\n1\t2\t2\t3\r\n1\t2\t3\t3\r\n1\t3\t3\t3\r\n2\t2\t2\t2\r\n2\t2\t2\t3\r\n2\t2\t3\t3\r\n2\t3\t3\t3\r\n3\t3\t3\t3]\r\n\u003c/pre\u003e\u003cp\u003eIf first line is the case, all of the people will cross the bridge in 1 minute. There will be 108 cases  ( \u003ctt\u003e108 = 4C2 X 2C1 X 3C2 X 3C1\u003c/tt\u003e ) taking 5 minutes. All of them will be less than or equal to 10 minutes (which is input 2).\u003c/p\u003e\u003cp\u003eIf ninth line is the case, one person will cross the bridge in one minute, one person will cross the bridge in two minutes, and others will cross the bridge in 3 minutes. 8 out of 108 ways will take less than or equal to 10 minutes.\u003c/p\u003e\u003cp\u003eIf last one is the case, all of them will cross the bridge in three minutes indicates that all of the journeys will take 15 minutes (longer than input2 or 10 minutes).\u003c/p\u003e\u003cp\u003eResult of the crossingTimeList are as follow\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eresult = [\r\n108\t108\r\n108\t108\r\n060\t108\r\n108\t108\r\n054\t108\r\n026\t108\r\n108\t108\r\n304\t108\r\n008\t108\r\n000\t108\r\n108\t108\r\n000\t108\r\n000\t108\r\n000\t108\r\n000\t108]\r\n\u003c/pre\u003e\u003cp\u003eAs a result 722 out of 1620 ways will take \u0026lt;= 10 minutes (722/1620=0.4457).\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 1:\u003c/b\u003e for this problem only four people will cross the bridge\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 2:\u003c/b\u003e crossing times are integer\u003c/p\u003e\u003cp\u003e\u003cb\u003eCrossing Model:\u003c/b\u003e 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.\u003c/p\u003e","function_template":"function y = bridgeProb(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nfiletext = fileread('bridgeProb.m');\r\nassert(isempty(strfind(filetext, 'assert')))\r\nassert(isempty(strfind(filetext, 'echo')))\r\n%%\r\nx = [3 10];\r\nassert(and( ge(bridgeProb(x), 0.43) , le(bridgeProb(x), 0.45)))\r\n%%\r\nx = [8 5];\r\nassert(and( ge(bridgeProb(x), 0.00) , le(bridgeProb(x), 0.01)))\r\n%%\r\nx = [10 5];\r\nassert(and( ge(bridgeProb(x), 0.00) , le(bridgeProb(x), 0.01)))\r\n%%\r\nx = [8 15];\r\nassert(and( ge(bridgeProb(x), 0.10) , le(bridgeProb(x), 0.12)))\r\n%%\r\nx = [8 17];\r\nassert(and( ge(bridgeProb(x), 0.15) , le(bridgeProb(x), 0.17)))\r\n%%\r\nx = [10 35];\r\nassert(and( ge(bridgeProb(x), 0.60) , le(bridgeProb(x), 0.62)))\r\n%%\r\nx = [10 35];\r\nassert(and( ge(bridgeProb(x), 0.60) , le(bridgeProb(x), 0.62)))\r\n%%\r\nx = [10 40];\r\nassert(and( ge(bridgeProb(x), 0.78) , le(bridgeProb(x), 0.80)))\r\n%%\r\nx = [7 20];\r\nassert(and( ge(bridgeProb(x), 0.35) , le(bridgeProb(x), 0.37)))\r\n%%\r\nx = [8 25];\r\nassert(and( ge(bridgeProb(x), 0.45) , le(bridgeProb(x), 0.47)))\r\n%%\r\nx = [8 10];\r\nassert(and( ge(bridgeProb(x), 0.01) , le(bridgeProb(x), 0.03)))\r\n%%\r\nx = [9 15];\r\nassert(and( ge(bridgeProb(x), 0.06) , le(bridgeProb(x), 0.08)))\r\n\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":4,"test_suite_updated_at":"2019-04-23T07:16:06.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2019-04-21T08:29:03.000Z","updated_at":"2025-05-02T02:43:56.000Z","published_at":"2019-04-22T12:28:10.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:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eDetails of the problem ...\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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\u003eThere are four people who wants to cross the bridge. But we don't know exactly who will cross the bridge in which time. However, we know that a person can cross the bridge in n1 minutes (n1 is randomly selected from the range 1:n, n is the first input). All crossing times are integers. They use\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eCrossing Model\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e to cross the bridge. In each turn, they randomly select the person(s) who will cross the bridge. What is the probability that they will cross the bridge less than or equal to t minutes (t is the second input).\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\u003eLet's assume first input n = 3. That means people will cross the bridge in 1, 2 or 3 minutes. all of them can cross the bridge in 1 minute or maybe all of them can cross the bridge in 3 minutes. Possibilities are listed below.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[crossingTimeList = [\\n1  1  1  1\\n1  1  1  2\\n1  1  1  3\\n1  1  2  2\\n1  1  2  3\\n1  1  3  3\\n1  2  2  2\\n1  2  2  3\\n1  2  3  3\\n1  3  3  3\\n2  2  2  2\\n2  2  2  3\\n2  2  3  3\\n2  3  3  3\\n3  3  3  3]]]\u003e\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\u003eIf first line is the case, all of the people will cross the bridge in 1 minute. There will be 108 cases (\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003e108 = 4C2 X 2C1 X 3C2 X 3C1\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e ) taking 5 minutes. All of them will be less than or equal to 10 minutes (which is input 2).\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\u003eIf ninth line is the case, one person will cross the bridge in one minute, one person will cross the bridge in two minutes, and others will cross the bridge in 3 minutes. 8 out of 108 ways will take less than or equal to 10 minutes.\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\u003eIf last one is the case, all of them will cross the bridge in three minutes indicates that all of the journeys will take 15 minutes (longer than input2 or 10 minutes).\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\u003eResult of the crossingTimeList are as follow\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[result = [\\n108  108\\n108  108\\n060  108\\n108  108\\n054  108\\n026  108\\n108  108\\n304  108\\n008  108\\n000  108\\n108  108\\n000  108\\n000  108\\n000  108\\n000  108]]]\u003e\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\u003eAs a result 722 out of 1620 ways will take \u0026lt;= 10 minutes (722/1620=0.4457).\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 1:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e for this problem only four people will cross the bridge\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 2:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e crossing times are integer\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eCrossing Model:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.\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":{"errors":[],"problems":[{"id":2313,"title":"Narcissistic problem","description":"How many likes has this problem?","description_html":"\u003cp\u003eHow many likes has this problem?\u003c/p\u003e","function_template":"function y = like_me(x)\r\n  y = x;\r\nend","test_suite":"%%\r\n% this problem will be updated,\r\n% your score/size can change over time\r\n% if you submit a fixed value :-)\r\n%%\r\ny=like_me();\r\nassert(isequal(mod(y,1),0));\r\n%%\r\ny=like_me();\r\nassert(y\u003e0);\r\n%%\r\ny=like_me();\r\nurl='http://www.mathworks.co.uk/matlabcentral/cody/problems/2313'\r\n% the main problem with this problem is that ...\r\n% this problem thinks.\r\n% it thinks about itself most of the time.\r\n% it is convinced, that at least X likes has it.\r\ny_sub_correct=max([10 cellfun(@(S)str2num(cell2mat(S)),regexp(urlread(url),'(\\d*) players\u003c/a\u003e like this problem','tokens'))]); % probably hackable by comments?\r\nt = mtree('like_me.m','-file');\r\nsize = length(t.nodesize);\r\n% this problem likes compliments,\r\n% even false.\r\n% For good compliment it is going to pass your solution with a smaller size! \r\n% But if you don't appreciate it, it can punish you...\r\nfeval(@assignin,'caller','score',round(max(0,size*(.5+.5*y_sub_correct/y))));\r\n","published":true,"deleted":false,"likes_count":30,"comments_count":4,"created_by":14358,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":166,"test_suite_updated_at":"2014-12-05T16:31:19.000Z","rescore_all_solutions":true,"group_id":1,"created_at":"2014-05-08T09:18:27.000Z","updated_at":"2026-02-14T16:20:13.000Z","published_at":"2014-05-08T09:25:53.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\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"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\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\u003eHow many likes has this problem?\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\"}]}"},{"id":42382,"title":"Combined Ages 1 - Symmetric, n = 3","description":"You have probably seen the common riddle wherein combined ages are provided and you must determine the individual ages. For example: If the ages of Alex and Barry sum to 43, the ages of Alex and Chris sum to 55, and the ages of Barry and Chris sum to 66, what are their individual ages?\r\n\r\nFor this problem, we'll assume that the three individuals are represented by A, B, and C, whereas the sums are AB, AC, and BC:\r\n\r\n* A+B = AB (= 43)\r\n* A+C = AC (= 55)\r\n* B+C = BC (= 66)\r\n\r\nAs you might have noticed, this is a simple matrix algebra problem. Write a function to return the individuals' ages [A;B;C] based on the supplied sums [AB AC BC].","description_html":"\u003cp\u003eYou have probably seen the common riddle wherein combined ages are provided and you must determine the individual ages. For example: If the ages of Alex and Barry sum to 43, the ages of Alex and Chris sum to 55, and the ages of Barry and Chris sum to 66, what are their individual ages?\u003c/p\u003e\u003cp\u003eFor this problem, we'll assume that the three individuals are represented by A, B, and C, whereas the sums are AB, AC, and BC:\u003c/p\u003e\u003cul\u003e\u003cli\u003eA+B = AB (= 43)\u003c/li\u003e\u003cli\u003eA+C = AC (= 55)\u003c/li\u003e\u003cli\u003eB+C = BC (= 66)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eAs you might have noticed, this is a simple matrix algebra problem. Write a function to return the individuals' ages [A;B;C] based on the supplied sums [AB AC BC].\u003c/p\u003e","function_template":"function y = combined_ages(AB,BC,AC)\r\n y = [1;1;1];\r\nend","test_suite":"%%\r\nAB = 43;\r\nBC = 55;\r\nAC = 66;\r\ny = combined_ages(AB,BC,AC);\r\ny_correct = [27 16 39];\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 30;\r\nBC = 50;\r\nAC = 40;\r\ny = combined_ages(AB,BC,AC);\r\ny_correct = [10 20 30];\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 20;\r\nBC = 70;\r\nAC = 60;\r\ny = combined_ages(AB,BC,AC);\r\ny_correct = [5 15 55];\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 34;\r\nBC = 84;\r\nAC = 56;\r\ny = combined_ages(AB,BC,AC);\r\ny_correct = [3 31 53];\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [2 11 21];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\ny = combined_ages(AB,BC,AC);\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [11 17 21];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\ny = combined_ages(AB,BC,AC);\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [15 35 55];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\ny = combined_ages(AB,BC,AC);\r\nfor i = 1:3\r\n assert(isequal(y(i),y_correct(i)))\r\nend","published":true,"deleted":false,"likes_count":2,"comments_count":2,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":326,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-06-16T17:30:16.000Z","updated_at":"2026-03-29T20:59:40.000Z","published_at":"2015-06-16T17:30:16.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\u003eYou have probably seen the common riddle wherein combined ages are provided and you must determine the individual ages. For example: If the ages of Alex and Barry sum to 43, the ages of Alex and Chris sum to 55, and the ages of Barry and Chris sum to 66, what are their individual ages?\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 this problem, we'll assume that the three individuals are represented by A, B, and C, whereas the sums are AB, AC, and BC:\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\u003eA+B = AB (= 43)\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\u003eA+C = AC (= 55)\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\u003eB+C = BC (= 66)\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\u003eAs you might have noticed, this is a simple matrix algebra problem. Write a function to return the individuals' ages [A;B;C] based on the supplied sums [AB AC BC].\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\"}]}"},{"id":44883,"title":"Bridge and Torch Problem - Minimum time","description":"\u003chttps://en.wikipedia.org/wiki/Bridge_and_torch_problem Details of the problem ...\u003e \r\n\r\nInput is crossing time list. (for example x= [1 2 5 8])\r\n\r\nOutput is the minimum time. (for original problem y_correct= 15)\r\n\r\n\r\n*Assumption 1:* for this problem only four people will cross the bridge\r\n\r\n*Assumption 2:* crossing times are integer","description_html":"\u003cp\u003e\u003ca href = \"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\"\u003eDetails of the problem ...\u003c/a\u003e\u003c/p\u003e\u003cp\u003eInput is crossing time list. (for example x= [1 2 5 8])\u003c/p\u003e\u003cp\u003eOutput is the minimum time. (for original problem y_correct= 15)\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 1:\u003c/b\u003e for this problem only four people will cross the bridge\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 2:\u003c/b\u003e crossing times are integer\u003c/p\u003e","function_template":"function y = bridgeRiddle(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nfiletext = fileread('bridgeRiddle.m');\r\nassert(isempty(strfind(filetext, 'assert')))\r\nassert(isempty(strfind(filetext, 'echo')))\r\n\r\n\r\n%%\r\nx = [1 1 1 1];\r\ny_correct = 5;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [1 1 1 10];\r\ny_correct = 14;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [1 2 5 8];\r\ny_correct = 15;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [1 2 5 10];\r\ny_correct = 17;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [1 2 5 11];\r\ny_correct = 18;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [2 5 9 11];\r\ny_correct = 28;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [3 8 13 16];\r\ny_correct = 43;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [7 13 15 16];\r\ny_correct = 58;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [3 34 43 47];\r\ny_correct = 130;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [21 35 38 39];\r\ny_correct = 154;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [5 10 34 36];\r\ny_correct = 71;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [ 55 97 154 193];\r\ny_correct = 539;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [107 116 165 170];\r\ny_correct = 625;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [329 592 611 641];\r\ny_correct = 2502;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [3259 4164 5259 6544];\r\ny_correct = 22295;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [5947 6267 8477 9254];\r\ny_correct = 34002;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n\r\n%%\r\nx = [12 24 24 30];\r\ny_correct = 102;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [6 6 10 12];\r\ny_correct = 36;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n%%\r\nx = [3 4 9 9];\r\ny_correct = 24;\r\nassert(isequal(bridgeRiddle(x),y_correct))\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":12,"test_suite_updated_at":"2019-04-23T18:37:57.000Z","rescore_all_solutions":true,"group_id":1,"created_at":"2019-04-21T06:48:30.000Z","updated_at":"2024-11-12T04:56:45.000Z","published_at":"2019-04-21T06:48:30.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:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eDetails of the problem ...\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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\u003eInput is crossing time list. (for example x= [1 2 5 8])\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\u003eOutput is the minimum time. (for original problem y_correct= 15)\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 1:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e for this problem only four people will cross the bridge\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 2:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e crossing times are integer\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\"}]}"},{"id":42386,"title":"Faint Receipt","description":"Suppose you have a receipt with some numbers that have been smudged or didn't print. In particular, the total amount is missing the first and last digits. The purchase did not involve tax (or you're looking at the subtotal before tax), only one item was purchased, and the quantity of the item is known. Use this data to determine what the total amount was, assuming that the unit cost does not contain a fraction of a cent. The partially known total will be provided as a string with an X for the unknown first and last digits.\r\nIn some cases, there will be multiple possible answers. We're going to assume the best and return the lowest possible total. The second missing digit can range from 0 to 9, though the first missing digit is the leading number, and, therefore, cannot be zero.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.440000534057617px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none; white-space: normal; \"\u003e\u003cdiv style=\"block-size: 198px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 126px; 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; text-align: left; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\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; \"\u003e\u003cspan style=\"\"\u003eSuppose you have a receipt with some numbers that have been smudged or didn't print. In particular, the total amount is missing the first and last digits. The purchase did not involve tax (or you're looking at the subtotal before tax), only one item was purchased, and the quantity of the item is known. Use this data to determine what the total amount was, assuming that the unit cost does not contain a fraction of a cent. The partially known total will be provided as a string with an X for the unknown first and last digits.\u003c/span\u003e\u003c/span\u003e\u003c/div\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; text-align: left; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\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; \"\u003e\u003cspan style=\"\"\u003eIn some cases, there will be multiple possible answers. We're going to assume the best and return the lowest possible total. The second missing digit can range from 0 to 9, though the first missing digit is the leading number, and, therefore, cannot be zero.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function [amt] = faint_receipt(partial_amt,qty)\r\n\r\namt = 1;\r\n\r\nend\r\n","test_suite":"%%\r\npartial_amt = 'X67.9X';\r\nqty = 72;\r\namt_corr = 367.92;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X31.6X';\r\nqty = 111;\r\namt_corr = 531.69;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X41.6X';\r\nqty = 67;\r\namt_corr = 741.69;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X422.9X';\r\nqty = 31;\r\namt_corr = 1422.90;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X50.1X';\r\nqty = 17;\r\namt_corr = 150.11;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X029.9X';\r\nqty = 417;\r\namt_corr = 1029.99;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X03.7X';\r\nqty = 107;\r\namt_corr = 103.79;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X0.8X';\r\nqty = 77;\r\namt_corr = 30.80;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%%\r\npartial_amt = 'X6.1X';\r\nqty = 99;\r\namt_corr = 86.13;\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%% anti-cheating case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tpartial_amt = 'X50.1X';\r\n\t\tqty = 17;\r\n\t\tamt_corr = 150.11;\r\n\tcase 2\r\n\t\tpartial_amt = 'X0.8X';\r\n\t\tqty = 77;\r\n\t\tamt_corr = 30.80;\r\n\tcase 3\r\n\t\tpartial_amt = 'X67.9X';\r\n\t\tqty = 72;\r\n\t\tamt_corr = 367.92;\r\n\tcase 4\r\n\t\tpartial_amt = 'X422.9X';\r\n\t\tqty = 31;\r\n\t\tamt_corr = 1422.90;\r\nend\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%% anti-cheating case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tpartial_amt = 'X31.6X';\r\n\t\tqty = 111;\r\n\t\tamt_corr = 531.69;\r\n\tcase 2\r\n\t\tpartial_amt = 'X50.1X';\r\n\t\tqty = 17;\r\n\t\tamt_corr = 150.11;\r\n\tcase 3\r\n\t\tpartial_amt = 'X41.6X';\r\n\t\tqty = 67;\r\n\t\tamt_corr = 741.69;\r\n\tcase 4\r\n\t\tpartial_amt = 'X029.9X';\r\n\t\tqty = 417;\r\n\t\tamt_corr = 1029.99;\r\nend\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n\r\n%% anti-cheating case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tpartial_amt = 'X422.9X';\r\n\t\tqty = 31;\r\n\t\tamt_corr = 1422.90;\r\n\tcase 2\r\n\t\tpartial_amt = 'X67.9X';\r\n\t\tqty = 72;\r\n\t\tamt_corr = 367.92;\r\n\tcase 3\r\n\t\tpartial_amt = 'X03.7X';\r\n\t\tqty = 107;\r\n\t\tamt_corr = 103.79;\r\n\tcase 4\r\n\t\tpartial_amt = 'X31.6X';\r\n\t\tqty = 111;\r\n\t\tamt_corr = 531.69;\r\nend\r\nassert(isequal(amt_corr,faint_receipt(partial_amt,qty)))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":9,"created_by":26769,"edited_by":26769,"edited_at":"2023-04-12T00:15:41.000Z","deleted_by":null,"deleted_at":null,"solvers_count":19,"test_suite_updated_at":"2015-06-17T18:36:21.000Z","rescore_all_solutions":true,"group_id":1,"created_at":"2015-06-16T23:10:49.000Z","updated_at":"2025-11-03T11:39:00.000Z","published_at":"2015-06-16T23:10:49.000Z","restored_at":null,"restored_by":null,"spam":false,"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:r\u003e\u003cw:t\u003eSuppose you have a receipt with some numbers that have been smudged or didn't print. In particular, the total amount is missing the first and last digits. The purchase did not involve tax (or you're looking at the subtotal before tax), only one item was purchased, and the quantity of the item is known. Use this data to determine what the total amount was, assuming that the unit cost does not contain a fraction of a cent. The partially known total will be provided as a string with an X for the unknown first and last digits.\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\u003eIn some cases, there will be multiple possible answers. We're going to assume the best and return the lowest possible total. The second missing digit can range from 0 to 9, though the first missing digit is the leading number, and, therefore, cannot be zero.\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\"}]}"},{"id":42384,"title":"Combined Ages 2 - Symmetric, n ≥ 3","description":"Following on \u003chttp://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3 Combined Ages 2\u003e, you will now be provided with age sums for _n_ individuals where _n_ ≥ 3. The sums will be provided in sorted order and will be for _n–1_ individuals (e.g., A+B+C, A+B+D, A+C+D, B+C+D). See the previous problem for an explanation, the test suite for examples, and the problem tags for hints.","description_html":"\u003cp\u003eFollowing on \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3\"\u003eCombined Ages 2\u003c/a\u003e, you will now be provided with age sums for \u003ci\u003en\u003c/i\u003e individuals where \u003ci\u003en\u003c/i\u003e ≥ 3. The sums will be provided in sorted order and will be for \u003ci\u003en–1\u003c/i\u003e individuals (e.g., A+B+C, A+B+D, A+C+D, B+C+D). See the previous problem for an explanation, the test suite for examples, and the problem tags for hints.\u003c/p\u003e","function_template":"function y = combined_ages2(varargin)\r\n y = ones(nargin,1);\r\nend","test_suite":"%%\r\nAB = 43;\r\nAC = 66;\r\nBC = 55;\r\ny = combined_ages2(AB,AC,BC);\r\ny_correct = [27 16 39];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 30;\r\nAC = 40;\r\nBC = 50;\r\ny = combined_ages2(AB,AC,BC);\r\ny_correct = [10 20 30];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 72;\r\nABD = 66;\r\nACD = 70;\r\nBCD = 77;\r\ny = combined_ages2(ABC,ABD,ACD,BCD);\r\ny_correct = [18 25 29 23];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 66;\r\nABD = 67;\r\nACD = 68;\r\nBCD = 69;\r\ny = combined_ages2(ABC,ABD,ACD,BCD);\r\ny_correct = [21 22 23 24];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 60;\r\nABD = 65;\r\nACD = 70;\r\nBCD = 75;\r\ny = combined_ages2(ABC,ABD,ACD,BCD);\r\ny_correct = [15 20 25 30];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCD = 90;\r\nABCE = 115;\r\nABDE = 100;\r\nACDE = 110;\r\nBCDE = 105;\r\ny = combined_ages2(ABCD,ABCE,ABDE,ACDE,BCDE);\r\ny_correct = [25 20 30 15 40];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCD = 44;\r\nABCE = 37;\r\nABDE = 47;\r\nACDE = 51;\r\nBCDE = 53;\r\ny = combined_ages2(ABCD,ABCE,ABDE,ACDE,BCDE);\r\ny_correct = [5 7 11 21 14];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCDEF = 133;\r\nABCDEG = 186;\r\nABCDFG = 172;\r\nABCEFG = 163;\r\nABDEFG = 192;\r\nACDEFG = 200;\r\nBCDEFG = 184;\r\ny = combined_ages2(ABCDEF,ABCDEG,ABCDFG,ABCEFG,ABDEFG,ACDEFG,BCDEFG);\r\ny_correct = [21 5 13 42 33 19 72];\r\nfor i = 1:numel(y_correct)\r\n assert(isequal(y(i),y_correct(i)))\r\nend\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":183,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-06-16T19:13:14.000Z","updated_at":"2026-03-29T21:29:20.000Z","published_at":"2015-06-16T19:13:14.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\u003eFollowing on\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eCombined Ages 2\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, you will now be provided with age sums for\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e individuals where\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e ≥ 3. The sums will be provided in sorted order and will be for\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en–1\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e individuals (e.g., A+B+C, A+B+D, A+C+D, B+C+D). See the previous problem for an explanation, the test suite for examples, and the problem tags for hints.\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\"}]}"},{"id":42385,"title":"Combined Ages 4 - Non-symmetric with multiples, n ≥ 3","description":"This problem is slightly more difficult than \u003chttp://www.mathworks.com/matlabcentral/cody/problems/42383-combined-ages-3-non-symmetric-n-3 Combined Ages 3\u003e. In this case, some of the sums may include multiples of some individuals' ages. As an example: If the ages of all three individuals with Chris's age added again sum to 98, the ages of Barry (twice) and Chris sum to 84, and the ages of Alex (twice) and Barry sum to 70, what are their individual ages?\r\n\r\nThe individuals will be represented by the first n capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\r\n\r\n* A+B+C+C = ABCC (= 98)\r\n* B+B+C = BBC (= 84)\r\n* A+A+B = AAB (= 70)\r\n\r\nThough the variables are ordered above, they will not always be in the test cases. Write a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.","description_html":"\u003cp\u003eThis problem is slightly more difficult than \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/42383-combined-ages-3-non-symmetric-n-3\"\u003eCombined Ages 3\u003c/a\u003e. In this case, some of the sums may include multiples of some individuals' ages. As an example: If the ages of all three individuals with Chris's age added again sum to 98, the ages of Barry (twice) and Chris sum to 84, and the ages of Alex (twice) and Barry sum to 70, what are their individual ages?\u003c/p\u003e\u003cp\u003eThe individuals will be represented by the first n capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\u003c/p\u003e\u003cul\u003e\u003cli\u003eA+B+C+C = ABCC (= 98)\u003c/li\u003e\u003cli\u003eB+B+C = BBC (= 84)\u003c/li\u003e\u003cli\u003eA+A+B = AAB (= 70)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eThough the variables are ordered above, they will not always be in the test cases. Write a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.\u003c/p\u003e","function_template":"function y = combined_ages_nonsymmetric_w_mult(varargin)\r\n y = ones(nargin,1);\r\nend","test_suite":"%%\r\nABCD = 70;\r\nABC = 65;\r\nAB = 40;\r\nBC = 52;\r\ny = combined_ages_nonsymmetric_w_mult(ABCD,ABC,AB,BC);\r\ny_correct = [13;27;25;5];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCC = 98;\r\nBBC = 84;\r\nAAB = 70;\r\ny = combined_ages_nonsymmetric_w_mult(ABCC,BBC,AAB);\r\ny_correct = [20;30;24];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCDA = 150;\r\nABCB = 99;\r\nBCDB = 91;\r\nABDAD = 135;\r\ny = combined_ages_nonsymmetric_w_mult(ABCDA,ABCB,BCDB,ABDAD);\r\ny_correct = [35;11;42;27];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABBA = 90;\r\nBCC = 113;\r\nABCBA = 141;\r\ny = combined_ages_nonsymmetric_w_mult(ABBA,BCC,ABCBA);\r\ny_correct = [34;11;51];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCDE = 120;\r\nABCDD = 111;\r\nABCCC = 87;\r\nABBBB = 66;\r\nAAAAA = 50;\r\ny = combined_ages_nonsymmetric_w_mult(ABCDE,ABCDD,ABCCC,ABBBB,AAAAA);\r\ny_correct = [10,14,21,33,42];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 45;\r\nBEA = 66;\r\nCAE = 73;\r\nDAB = 57;\r\nAAD = 53;\r\ny = combined_ages_nonsymmetric_w_mult(ABC,BEA,CAE,DAB,AAD);\r\ny_correct = [10,14,21,33,42];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCABC = 144;\r\nBEAB = 107;\r\nCAEAD = 147;\r\nDABB = 73;\r\nAADAA = 133;\r\ny = combined_ages_nonsymmetric_w_mult(ABCABC,BEAB,CAEAD,DABB,AADAA);\r\ny_correct = [30,15,27,13,47];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABCC = 98;\r\n\t\tBBC = 84;\r\n\t\tAAB = 70;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCC,BBC,AAB);\r\n\t\ty_correct = [20;30;24];\r\n\tcase 2\r\n\t\tABCDA = 150;\r\n\t\tABCB = 99;\r\n\t\tBCDB = 91;\r\n\t\tABDAD = 135;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCDA,ABCB,BCDB,ABDAD);\r\n\t\ty_correct = [35;11;42;27];\r\n\tcase 3\r\n\t\tABCABC = 144;\r\n\t\tBEAB = 107;\r\n\t\tCAEAD = 147;\r\n\t\tDABB = 73;\r\n\t\tAADAA = 133;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCABC,BEAB,CAEAD,DABB,AADAA);\r\n\t\ty_correct = [30,15,27,13,47];\r\n\tcase 4\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABCC = 98;\r\n\t\tBBC = 84;\r\n\t\tAAB = 70;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCC,BBC,AAB);\r\n\t\ty_correct = [20;30;24];\r\n\tcase 2\r\n\t\tABCABC = 144;\r\n\t\tBEAB = 107;\r\n\t\tCAEAD = 147;\r\n\t\tDABB = 73;\r\n\t\tAADAA = 133;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCABC,BEAB,CAEAD,DABB,AADAA);\r\n\t\ty_correct = [30,15,27,13,47];\r\n\tcase 3\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 4\r\n\t\tABC = 45;\r\n\t\tBEA = 66;\r\n\t\tCAE = 73;\r\n\t\tDAB = 57;\r\n\t\tAAD = 53;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABC,BEA,CAE,DAB,AAD);\r\n\t\ty_correct = [10,14,21,33,42];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABBA = 90;\r\n\t\tBCC = 113;\r\n\t\tABCBA = 141;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABBA,BCC,ABCBA);\r\n\t\ty_correct = [34;11;51];\r\n\tcase 2\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 3\r\n\t\tABCDA = 150;\r\n\t\tABCB = 99;\r\n\t\tBCDB = 91;\r\n\t\tABDAD = 135;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCDA,ABCB,BCDB,ABDAD);\r\n\t\ty_correct = [35;11;42;27];\r\n\tcase 4\r\n\t\tABCC = 98;\r\n\t\tBBC = 84;\r\n\t\tAAB = 70;\r\n\t\ty = combined_ages_nonsymmetric_w_mult(ABCC,BBC,AAB);\r\n\t\ty_correct = [20;30;24];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":122,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-06-16T20:03:26.000Z","updated_at":"2026-03-24T04:49:54.000Z","published_at":"2015-06-16T20:03:26.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\u003eThis problem is slightly more difficult than\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/42383-combined-ages-3-non-symmetric-n-3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eCombined Ages 3\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e. In this case, some of the sums may include multiples of some individuals' ages. As an example: If the ages of all three individuals with Chris's age added again sum to 98, the ages of Barry (twice) and Chris sum to 84, and the ages of Alex (twice) and Barry sum to 70, what are their individual ages?\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\u003eThe individuals will be represented by the first n capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\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\u003eA+B+C+C = ABCC (= 98)\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\u003eB+B+C = BBC (= 84)\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\u003eA+A+B = AAB (= 70)\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\u003eThough the variables are ordered above, they will not always be in the test cases. Write a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.\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\"}]}"},{"id":44884,"title":"Bridge and Torch Problem - Length of Unique Time List","description":"\u003chttps://en.wikipedia.org/wiki/Bridge_and_torch_problem Details of the problem ...\u003e \r\n\r\nInput is crossing time list. (for example x= [1 2 5 8])\r\n\r\nOutput is the length of all possible crossing time records. (for original problem y_correct= 14. In other words it is possible to cross the bridge in [15, 17, 18, 19, 21, 22, 24, 25, 27, 28, 30, 31, 34, 40] minutes.\r\n\r\n*Assumption 1:* for this problem only four people will cross the bridge\r\n\r\n*Assumption 2:* crossing times are integer\r\n\r\n\r\n*Crossing Model:* 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.","description_html":"\u003cp\u003e\u003ca href = \"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\"\u003eDetails of the problem ...\u003c/a\u003e\u003c/p\u003e\u003cp\u003eInput is crossing time list. (for example x= [1 2 5 8])\u003c/p\u003e\u003cp\u003eOutput is the length of all possible crossing time records. (for original problem y_correct= 14. In other words it is possible to cross the bridge in [15, 17, 18, 19, 21, 22, 24, 25, 27, 28, 30, 31, 34, 40] minutes.\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 1:\u003c/b\u003e for this problem only four people will cross the bridge\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 2:\u003c/b\u003e crossing times are integer\u003c/p\u003e\u003cp\u003e\u003cb\u003eCrossing Model:\u003c/b\u003e 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.\u003c/p\u003e","function_template":"function y = howManyWays(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nfiletext = fileread('howManyWays.m');\r\nassert(isempty(strfind(filetext, 'assert')))\r\nassert(isempty(strfind(filetext, 'echo')))\r\n\r\n\r\n%%\r\nx = [1 1 1 1];\r\ny_correct = 1;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [1 1 1 10];\r\ny_correct = 3; %[14,32,50]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [12 24 24 30];\r\ny_correct = 5; %[102,114,126,138,150]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [22 34 34 43];\r\ny_correct = 6; %[155 167 179 185 197 215]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [6 6 10 12];\r\ny_correct = 7; %[36 40 44 48 52 56 60]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [6 6 7 8];\r\ny_correct = 8; %[32 33 34 35 36 37 38 40]\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [3 4 9 9];\r\ny_correct = 9; \r\nassert(isequal(howManyWays(x),y_correct))\r\n\r\n%%\r\nx = [4 6 8 11];\r\ny_correct = 10; \r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [1 5 6 7];\r\ny_correct = 13; \r\nassert(isequal(howManyWays(x),y_correct))\r\n\r\n\r\n%%\r\nx = [1 2 5 8];\r\ny_correct = 14;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [1 2 5 10];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [1 2 5 11];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [2 5 9 11];\r\ny_correct = 12;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [3 8 13 16];\r\ny_correct = 11;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [7 13 15 16];\r\ny_correct = 11;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [3 34 43 47];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [21 35 38 39];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [5 10 34 36];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [ 55 97 154 193];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [107 116 165 170];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [329 592 611 641];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [3259 4164 5259 6544];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n%%\r\nx = [5947 6267 8477 9254];\r\ny_correct = 15;\r\nassert(isequal(howManyWays(x),y_correct))\r\n\r\n%%\r\nx = [726 871 871 964];\r\ny_correct = 6; %[4158 4303 4448 4489 4634 4820]\r\nassert(isequal(howManyWays(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":4,"test_suite_updated_at":"2019-04-22T11:56:31.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2019-04-21T07:08:50.000Z","updated_at":"2019-04-22T11:56:31.000Z","published_at":"2019-04-21T07:08:50.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:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eDetails of the problem ...\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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\u003eInput is crossing time list. (for example x= [1 2 5 8])\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\u003eOutput is the length of all possible crossing time records. (for original problem y_correct= 14. In other words it is possible to cross the bridge in [15, 17, 18, 19, 21, 22, 24, 25, 27, 28, 30, 31, 34, 40] minutes.\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 1:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e for this problem only four people will cross the bridge\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 2:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e crossing times are integer\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eCrossing Model:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.\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\"}]}"},{"id":2314,"title":"Open coded lock.","description":"Guess the \u003chint://fliplr(anchortext) password\u003e or break the \u003c2314/solutions/new#test_suite_body lock\u003e.","description_html":"\u003cp\u003eGuess the \u003ca href = \"hint://fliplr(anchortext)\"\u003epassword\u003c/a\u003e or break the \u003ca href = \"2314/solutions/new#test_suite_body\"\u003elock\u003c/a\u003e.\u003c/p\u003e","function_template":"function y = key(x)\r\n  y='6to10chars';\r\nend","test_suite":"%%\r\npassword=1:10;\r\npassword(find(key()))=key()+find(key());\r\n% http://en.wikipedia.org/wiki/RSA_(cryptosystem)\r\ne=7;\r\nn=14705773;\r\nencrypted_password=[8926999 1509855 4535462 14198804 9178870 10365101 9398838 9178870 4782969 10000000];\r\nassert(isequal(mod(uint64(password).^e,n),encrypted_password))","published":true,"deleted":false,"likes_count":3,"comments_count":2,"created_by":14358,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":14,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-05-09T14:06:39.000Z","updated_at":"2014-05-09T17:36:48.000Z","published_at":"2014-05-09T14:53:16.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\u003eGuess the\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"hint://fliplr(anchortext)\\\"\u003e\u003cw:r\u003e\u003cw:t\u003epassword\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e or break the\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"2314/solutions/new#test_suite_body\\\"\u003e\u003cw:r\u003e\u003cw:t\u003elock\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\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\"}]}"},{"id":42383,"title":"Combined Ages 3 - Non-symmetric, n ≥ 3","description":"Pursuant to the previous two problems ( \u003chttp://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3 Symmetric, n = 3\u003e and \u003chttp://www.mathworks.com/matlabcentral/cody/problems/42384-combined-ages-2-symmetric-n-3 Symmetric, n ≥ 3\u003e ), this problem will provide _n_ combined ages where _n_ is the number of individuals, though the age sums will not form a symmetric matrix. As an example: If the ages of all four individuals sum to 70; the ages of Alex, Barry, and Chris sum to 65; the ages of Alex and Barry sum to 40; and the ages of Barry and Chris sum to 52, what are their individual ages?\r\n\r\nThe individuals will be represented by the first _n_ capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\r\n\r\n* A+B+C+D = ABCD (= 70)\r\n* A+B+C = ABC (= 65)\r\n* A+B = AB (= 40)\r\n* B+C = BC (= 52)\r\n\r\nWrite a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.","description_html":"\u003cp\u003ePursuant to the previous two problems ( \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3\"\u003eSymmetric, n = 3\u003c/a\u003e and \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/42384-combined-ages-2-symmetric-n-3\"\u003eSymmetric, n ≥ 3\u003c/a\u003e ), this problem will provide \u003ci\u003en\u003c/i\u003e combined ages where \u003ci\u003en\u003c/i\u003e is the number of individuals, though the age sums will not form a symmetric matrix. As an example: If the ages of all four individuals sum to 70; the ages of Alex, Barry, and Chris sum to 65; the ages of Alex and Barry sum to 40; and the ages of Barry and Chris sum to 52, what are their individual ages?\u003c/p\u003e\u003cp\u003eThe individuals will be represented by the first \u003ci\u003en\u003c/i\u003e capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\u003c/p\u003e\u003cul\u003e\u003cli\u003eA+B+C+D = ABCD (= 70)\u003c/li\u003e\u003cli\u003eA+B+C = ABC (= 65)\u003c/li\u003e\u003cli\u003eA+B = AB (= 40)\u003c/li\u003e\u003cli\u003eB+C = BC (= 52)\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eWrite a function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.\u003c/p\u003e","function_template":"function y = combined_ages_nonsymmetric(varargin)\r\n y = ones(nargin,1);\r\nend","test_suite":"%%\r\nABCD = 70;\r\nABC = 65;\r\nAB = 40;\r\nBC = 52;\r\ny = combined_ages_nonsymmetric(ABCD,ABC,AB,BC);\r\ny_correct = [13;27;25;5];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABC = 70;\r\nBC = 50;\r\nAC = 40;\r\ny = combined_ages_nonsymmetric(ABC,BC,AC);\r\ny_correct = [20;30;20];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCD = 100;\r\nABC = 80;\r\nBCD = 70;\r\nABD = 60;\r\ny = combined_ages_nonsymmetric(ABCD,ABC,BCD,ABD);\r\ny_correct = [30;10;40;20];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nAB = 34;\r\nBC = 54;\r\nABC = 86;\r\ny = combined_ages_nonsymmetric(AB,BC,ABC);\r\ny_correct = [32;2;52];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\nABCDE = 120;\r\nABCD = 78;\r\nABC = 45;\r\nAB = 24;\r\nAC = 31;\r\ny = combined_ages_nonsymmetric(ABCDE,ABCD,ABC,AB,AC);\r\ny_correct = [10,14,21,33,42];\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [37 33 31 38];\r\nABC = y_correct(1) + y_correct(2) + y_correct(3);\r\nBCD = y_correct(2) + y_correct(3) + y_correct(4);\r\nACD = y_correct(1) + y_correct(3) + y_correct(4);\r\nABD = y_correct(1) + y_correct(2) + y_correct(4);\r\ny = combined_ages_nonsymmetric(ABC,BCD,ACD,ABD);\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [5 15 30 62 100];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\nACE = y_correct(1) + y_correct(3) + y_correct(5);\r\nABDE = y_correct(1) + y_correct(2) + y_correct(4) + y_correct(5);\r\ny = combined_ages_nonsymmetric(AB,BC,AC,ACE,ABDE);\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%%\r\ny_correct = [2 3 5 7 11 17 23 31 42 55];\r\nAB = y_correct(1) + y_correct(2);\r\nBC = y_correct(2) + y_correct(3);\r\nAC = y_correct(1) + y_correct(3);\r\nABCD = y_correct(1) + y_correct(2) + y_correct(3) + y_correct(4);\r\nCDEG = y_correct(3) + y_correct(4) + y_correct(5) + y_correct(7);\r\nBFH = y_correct(2) + y_correct(6) + y_correct(8);\r\nFGIJ = y_correct(6) + y_correct(7) + y_correct(9) + y_correct(10);\r\nACEGH = y_correct(1) + y_correct(3) + y_correct(5) + y_correct(7) + y_correct(8);\r\nBEJ = y_correct(2) + y_correct(5) + y_correct(10);\r\nABDIJ = y_correct(1) + y_correct(2) + y_correct(4) + y_correct(9) + y_correct(10);\r\ny = combined_ages_nonsymmetric(AB,BC,AC,ABCD,CDEG,BFH,FGIJ,ACEGH,BEJ,ABDIJ);\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 2\r\n\t\tABCD = 100;\r\n\t\tABC = 80;\r\n\t\tBCD = 70;\r\n\t\tABD = 60;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,BCD,ABD);\r\n\t\ty_correct = [30;10;40;20];\r\n\tcase 3\r\n\t\tAB = 34;\r\n\t\tBC = 54;\r\n\t\tABC = 86;\r\n\t\ty = combined_ages_nonsymmetric(AB,BC,ABC);\r\n\t\ty_correct = [32;2;52];\r\n\tcase 4\r\n\t\tABC = 70;\r\n\t\tBC = 50;\r\n\t\tAC = 40;\r\n\t\ty = combined_ages_nonsymmetric(ABC,BC,AC);\r\n\t\ty_correct = [20;30;20];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tABC = 70;\r\n\t\tBC = 50;\r\n\t\tAC = 40;\r\n\t\ty = combined_ages_nonsymmetric(ABC,BC,AC);\r\n\t\ty_correct = [20;30;20];\r\n\tcase 2\r\n\t\tAB = 34;\r\n\t\tBC = 54;\r\n\t\tABC = 86;\r\n\t\ty = combined_ages_nonsymmetric(AB,BC,ABC);\r\n\t\ty_correct = [32;2;52];\r\n\tcase 3\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 4\r\n\t\tABCD = 100;\r\n\t\tABC = 80;\r\n\t\tBCD = 70;\r\n\t\tABD = 60;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,BCD,ABD);\r\n\t\ty_correct = [30;10;40;20];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n\r\n%% anti-cheating test case\r\nind = randi(4);\r\nswitch ind\r\n\tcase 1\r\n\t\tAB = 34;\r\n\t\tBC = 54;\r\n\t\tABC = 86;\r\n\t\ty = combined_ages_nonsymmetric(AB,BC,ABC);\r\n\t\ty_correct = [32;2;52];\r\n\tcase 2\r\n\t\tABCD = 100;\r\n\t\tABC = 80;\r\n\t\tBCD = 70;\r\n\t\tABD = 60;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,BCD,ABD);\r\n\t\ty_correct = [30;10;40;20];\r\n\tcase 3\r\n\t\tABCD = 70;\r\n\t\tABC = 65;\r\n\t\tAB = 40;\r\n\t\tBC = 52;\r\n\t\ty = combined_ages_nonsymmetric(ABCD,ABC,AB,BC);\r\n\t\ty_correct = [13;27;25;5];\r\n\tcase 4\r\n\t\tABC = 70;\r\n\t\tBC = 50;\r\n\t\tAC = 40;\r\n\t\ty = combined_ages_nonsymmetric(ABC,BC,AC);\r\n\t\ty_correct = [20;30;20];\r\nend\r\nfor i = 1:numel(y_correct)\r\n\tassert(isequal(y(i),y_correct(i)))\r\nend\r\n","published":true,"deleted":false,"likes_count":6,"comments_count":0,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":144,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-06-16T18:34:18.000Z","updated_at":"2026-03-29T22:25:18.000Z","published_at":"2015-06-16T18:34:18.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\u003ePursuant to the previous two problems (\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/42382-combined-ages-1-symmetric-n-3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eSymmetric, n = 3\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e and\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/42384-combined-ages-2-symmetric-n-3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eSymmetric, n ≥ 3\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e ), this problem will provide\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e combined ages where\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e is the number of individuals, though the age sums will not form a symmetric matrix. As an example: If the ages of all four individuals sum to 70; the ages of Alex, Barry, and Chris sum to 65; the ages of Alex and Barry sum to 40; and the ages of Barry and Chris sum to 52, what are their individual ages?\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\u003eThe individuals will be represented by the first\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e capital letters of the alphabet and the sums will be represented by variables whose string names contain each associated individual (capital letter). In this example problem, the equations would be represented as:\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\u003eA+B+C+D = ABCD (= 70)\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\u003eA+B+C = ABC (= 65)\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\u003eA+B = AB (= 40)\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\u003eB+C = BC (= 52)\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 function to return the individuals' ages based on the supplied sums. See the test suite for examples and the tags for some hints.\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\"}]}"},{"id":44885,"title":"Bridge and Torch Problem - Probability","description":"\u003chttps://en.wikipedia.org/wiki/Bridge_and_torch_problem Details of the problem ...\u003e \r\n\r\nThere are four people who wants to cross the bridge. But we don't know exactly who will cross the bridge in which time. However, we know that a person can cross the bridge in n1 minutes (n1 is randomly selected from the range 1:n, n is the first input). All crossing times are integers. They use *Crossing Model* to cross the bridge. In each turn, they randomly select the person(s) who will cross the bridge. What is the probability that they will cross the bridge less than or equal to t minutes (t is the second input).\r\n\r\nLet's assume first input n = 3. That means people will cross the bridge in 1, 2 or 3 minutes. all of them can cross the bridge in 1 minute or maybe all of them can cross the bridge in 3 minutes. Possibilities are listed below.\r\n\r\n  crossingTimeList = [\r\n1\t1\t1\t1\r\n1\t1\t1\t2\r\n1\t1\t1\t3\r\n1\t1\t2\t2\r\n1\t1\t2\t3\r\n1\t1\t3\t3\r\n1\t2\t2\t2\r\n1\t2\t2\t3\r\n1\t2\t3\t3\r\n1\t3\t3\t3\r\n2\t2\t2\t2\r\n2\t2\t2\t3\r\n2\t2\t3\t3\r\n2\t3\t3\t3\r\n3\t3\t3\t3]\r\n\r\nIf first line is the case, all of the people will cross the bridge in 1 minute. There will be 108 cases  ( |108 = 4C2 X 2C1 X 3C2 X 3C1| ) taking 5 minutes. All of them will be less than or equal to 10 minutes (which is input 2). \r\n\r\nIf ninth line is the case, one person will cross the bridge in one minute, one person will cross the bridge in two minutes, and others will cross the bridge in 3 minutes. 8 out of 108 ways will take less than or equal to 10 minutes. \r\n\r\nIf last one is the case, all of them will cross the bridge in three minutes indicates that all of the journeys will take 15 minutes (longer than input2 or 10 minutes).\r\n\r\nResult of the crossingTimeList are as follow\r\n\r\n  result = [\r\n108\t108\r\n108\t108\r\n060\t108\r\n108\t108\r\n054\t108\r\n026\t108\r\n108\t108\r\n304\t108\r\n008\t108\r\n000\t108\r\n108\t108\r\n000\t108\r\n000\t108\r\n000\t108\r\n000\t108]\r\n\r\nAs a result 722 out of 1620 ways will take \u003c= 10 minutes (722/1620=0.4457).\r\n\r\n\r\n*Assumption 1:* for this problem only four people will cross the bridge\r\n\r\n*Assumption 2:* crossing times are integer\r\n\r\n*Crossing Model:* 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.  ","description_html":"\u003cp\u003e\u003ca href = \"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\"\u003eDetails of the problem ...\u003c/a\u003e\u003c/p\u003e\u003cp\u003eThere are four people who wants to cross the bridge. But we don't know exactly who will cross the bridge in which time. However, we know that a person can cross the bridge in n1 minutes (n1 is randomly selected from the range 1:n, n is the first input). All crossing times are integers. They use \u003cb\u003eCrossing Model\u003c/b\u003e to cross the bridge. In each turn, they randomly select the person(s) who will cross the bridge. What is the probability that they will cross the bridge less than or equal to t minutes (t is the second input).\u003c/p\u003e\u003cp\u003eLet's assume first input n = 3. That means people will cross the bridge in 1, 2 or 3 minutes. all of them can cross the bridge in 1 minute or maybe all of them can cross the bridge in 3 minutes. Possibilities are listed below.\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ecrossingTimeList = [\r\n1\t1\t1\t1\r\n1\t1\t1\t2\r\n1\t1\t1\t3\r\n1\t1\t2\t2\r\n1\t1\t2\t3\r\n1\t1\t3\t3\r\n1\t2\t2\t2\r\n1\t2\t2\t3\r\n1\t2\t3\t3\r\n1\t3\t3\t3\r\n2\t2\t2\t2\r\n2\t2\t2\t3\r\n2\t2\t3\t3\r\n2\t3\t3\t3\r\n3\t3\t3\t3]\r\n\u003c/pre\u003e\u003cp\u003eIf first line is the case, all of the people will cross the bridge in 1 minute. There will be 108 cases  ( \u003ctt\u003e108 = 4C2 X 2C1 X 3C2 X 3C1\u003c/tt\u003e ) taking 5 minutes. All of them will be less than or equal to 10 minutes (which is input 2).\u003c/p\u003e\u003cp\u003eIf ninth line is the case, one person will cross the bridge in one minute, one person will cross the bridge in two minutes, and others will cross the bridge in 3 minutes. 8 out of 108 ways will take less than or equal to 10 minutes.\u003c/p\u003e\u003cp\u003eIf last one is the case, all of them will cross the bridge in three minutes indicates that all of the journeys will take 15 minutes (longer than input2 or 10 minutes).\u003c/p\u003e\u003cp\u003eResult of the crossingTimeList are as follow\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eresult = [\r\n108\t108\r\n108\t108\r\n060\t108\r\n108\t108\r\n054\t108\r\n026\t108\r\n108\t108\r\n304\t108\r\n008\t108\r\n000\t108\r\n108\t108\r\n000\t108\r\n000\t108\r\n000\t108\r\n000\t108]\r\n\u003c/pre\u003e\u003cp\u003eAs a result 722 out of 1620 ways will take \u0026lt;= 10 minutes (722/1620=0.4457).\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 1:\u003c/b\u003e for this problem only four people will cross the bridge\u003c/p\u003e\u003cp\u003e\u003cb\u003eAssumption 2:\u003c/b\u003e crossing times are integer\u003c/p\u003e\u003cp\u003e\u003cb\u003eCrossing Model:\u003c/b\u003e 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.\u003c/p\u003e","function_template":"function y = bridgeProb(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nfiletext = fileread('bridgeProb.m');\r\nassert(isempty(strfind(filetext, 'assert')))\r\nassert(isempty(strfind(filetext, 'echo')))\r\n%%\r\nx = [3 10];\r\nassert(and( ge(bridgeProb(x), 0.43) , le(bridgeProb(x), 0.45)))\r\n%%\r\nx = [8 5];\r\nassert(and( ge(bridgeProb(x), 0.00) , le(bridgeProb(x), 0.01)))\r\n%%\r\nx = [10 5];\r\nassert(and( ge(bridgeProb(x), 0.00) , le(bridgeProb(x), 0.01)))\r\n%%\r\nx = [8 15];\r\nassert(and( ge(bridgeProb(x), 0.10) , le(bridgeProb(x), 0.12)))\r\n%%\r\nx = [8 17];\r\nassert(and( ge(bridgeProb(x), 0.15) , le(bridgeProb(x), 0.17)))\r\n%%\r\nx = [10 35];\r\nassert(and( ge(bridgeProb(x), 0.60) , le(bridgeProb(x), 0.62)))\r\n%%\r\nx = [10 35];\r\nassert(and( ge(bridgeProb(x), 0.60) , le(bridgeProb(x), 0.62)))\r\n%%\r\nx = [10 40];\r\nassert(and( ge(bridgeProb(x), 0.78) , le(bridgeProb(x), 0.80)))\r\n%%\r\nx = [7 20];\r\nassert(and( ge(bridgeProb(x), 0.35) , le(bridgeProb(x), 0.37)))\r\n%%\r\nx = [8 25];\r\nassert(and( ge(bridgeProb(x), 0.45) , le(bridgeProb(x), 0.47)))\r\n%%\r\nx = [8 10];\r\nassert(and( ge(bridgeProb(x), 0.01) , le(bridgeProb(x), 0.03)))\r\n%%\r\nx = [9 15];\r\nassert(and( ge(bridgeProb(x), 0.06) , le(bridgeProb(x), 0.08)))\r\n\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":4,"test_suite_updated_at":"2019-04-23T07:16:06.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2019-04-21T08:29:03.000Z","updated_at":"2025-05-02T02:43:56.000Z","published_at":"2019-04-22T12:28:10.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:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eDetails of the problem ...\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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\u003eThere are four people who wants to cross the bridge. But we don't know exactly who will cross the bridge in which time. However, we know that a person can cross the bridge in n1 minutes (n1 is randomly selected from the range 1:n, n is the first input). All crossing times are integers. They use\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eCrossing Model\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e to cross the bridge. In each turn, they randomly select the person(s) who will cross the bridge. What is the probability that they will cross the bridge less than or equal to t minutes (t is the second input).\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\u003eLet's assume first input n = 3. That means people will cross the bridge in 1, 2 or 3 minutes. all of them can cross the bridge in 1 minute or maybe all of them can cross the bridge in 3 minutes. Possibilities are listed below.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[crossingTimeList = [\\n1  1  1  1\\n1  1  1  2\\n1  1  1  3\\n1  1  2  2\\n1  1  2  3\\n1  1  3  3\\n1  2  2  2\\n1  2  2  3\\n1  2  3  3\\n1  3  3  3\\n2  2  2  2\\n2  2  2  3\\n2  2  3  3\\n2  3  3  3\\n3  3  3  3]]]\u003e\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\u003eIf first line is the case, all of the people will cross the bridge in 1 minute. There will be 108 cases (\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003e108 = 4C2 X 2C1 X 3C2 X 3C1\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e ) taking 5 minutes. All of them will be less than or equal to 10 minutes (which is input 2).\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\u003eIf ninth line is the case, one person will cross the bridge in one minute, one person will cross the bridge in two minutes, and others will cross the bridge in 3 minutes. 8 out of 108 ways will take less than or equal to 10 minutes.\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\u003eIf last one is the case, all of them will cross the bridge in three minutes indicates that all of the journeys will take 15 minutes (longer than input2 or 10 minutes).\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\u003eResult of the crossingTimeList are as follow\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[result = [\\n108  108\\n108  108\\n060  108\\n108  108\\n054  108\\n026  108\\n108  108\\n304  108\\n008  108\\n000  108\\n108  108\\n000  108\\n000  108\\n000  108\\n000  108]]]\u003e\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\u003eAs a result 722 out of 1620 ways will take \u0026lt;= 10 minutes (722/1620=0.4457).\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 1:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e for this problem only four people will cross the bridge\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAssumption 2:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e crossing times are integer\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eCrossing Model:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.\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\"}]}"}],"term":"tag:\"riddle\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"riddle\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"riddle\"","","\"","riddle","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fac27725e68\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fac27725dc8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fac27725508\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fac277260e8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fac27726048\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fac27725fa8\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fac27725f08\u003e":"tag:\"riddle\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fac27725f08\u003e":"tag:\"riddle\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"search","password":"J3bGPZzQ7asjJcCk","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"riddle\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"riddle\"","","\"","riddle","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fac27725e68\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fac27725dc8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fac27725508\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fac277260e8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fac27726048\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fac27725fa8\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fac27725f08\u003e":"tag:\"riddle\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fac27725f08\u003e":"tag:\"riddle\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":2313,"difficulty_rating":"easy"},{"id":42382,"difficulty_rating":"easy-medium"},{"id":44883,"difficulty_rating":"easy-medium"},{"id":42386,"difficulty_rating":"easy-medium"},{"id":42384,"difficulty_rating":"easy-medium"},{"id":42385,"difficulty_rating":"medium"},{"id":44884,"difficulty_rating":"medium"},{"id":2314,"difficulty_rating":"medium"},{"id":42383,"difficulty_rating":"medium"},{"id":44885,"difficulty_rating":"hard"}]}}