{"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":44501,"title":"Please check if calorie intake is less than 300 kcal.","description":"I like eating some puddings and some chocolate cookies around 3 o'clock. However, I care about calorie intake.\r\nPlease check whether total calorie intake is less than 300 kcal.\r\n\r\nThe calorie of a pudding is 108 kcal. \r\nThe calorie of a chocolate cookie is 48 kcal.\r\n\r\nFor example, in case of pudding = 1, cookie = 2, 1 is returned because the total caloric intake is 204 kcal and less than 300 kcal.","description_html":"\u003cp\u003eI like eating some puddings and some chocolate cookies around 3 o'clock. However, I care about calorie intake.\r\nPlease check whether total calorie intake is less than 300 kcal.\u003c/p\u003e\u003cp\u003eThe calorie of a pudding is 108 kcal. \r\nThe calorie of a chocolate cookie is 48 kcal.\u003c/p\u003e\u003cp\u003eFor example, in case of pudding = 1, cookie = 2, 1 is returned because the total caloric intake is 204 kcal and less than 300 kcal.\u003c/p\u003e","function_template":"function  c = check_cal(pudding,cookie)\r\n  c = ;\r\nend","test_suite":"%% 1 \r\npudding = 1;\r\ncookie = 2;\r\nc_correct = 1;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n\r\n%% 2 \r\npudding = 2;\r\ncookie = 2;\r\nc_correct = 0;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n\r\n\r\n%% 3 \r\npudding = 0;\r\ncookie = 6;\r\nc_correct = 1;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n\r\n\r\n%% 4 \r\npudding = 0;\r\ncookie = 7;\r\nc_correct = 0;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n\r\n\r\n%% 5 \r\npudding = 1;\r\ncookie = 4;\r\nc_correct = 0;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":1,"created_by":137687,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":59,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2018-01-17T13:18:39.000Z","updated_at":"2026-02-17T08:33:36.000Z","published_at":"2018-01-18T14:14:04.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\u003eI like eating some puddings and some chocolate cookies around 3 o'clock. However, I care about calorie intake. Please check whether total calorie intake is less than 300 kcal.\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\u003eThe calorie of a pudding is 108 kcal. The calorie of a chocolate cookie is 48 kcal.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor example, in case of pudding = 1, cookie = 2, 1 is returned because the total caloric intake is 204 kcal and less than 300 kcal.\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":60938,"title":"Breaking up a chocolate bar","description":"You've got a chocolate bar of size , and you want to break it up into bite-sized () pieces. How many steps are required to do this, assuming you cannot stack blocks and cut through several at once?","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; 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: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 42px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 408.5px 21px; transform-origin: 408.5px 21px; vertical-align: baseline; \"\u003e\u003cdiv style=\"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; perspective-origin: 385.5px 21px; text-align: left; transform-origin: 385.5px 21px; white-space-collapse: preserve; 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; perspective-origin: 106.1px 7.66667px; transform-origin: 106.1px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eYou've got a chocolate bar of size \u003c/span\u003e\u003c/span\u003e\u003cspan style=\"vertical-align:-5px\"\u003e\u003cimg src=\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAEsAAAAkCAYAAADB7MdlAAADe0lEQVRoQ+2YO6xNQRSG7+0lHp2GBAUJIfFMRCIiJEIU4tXdyqPQIaEQFUKhUHhUokKrolB7RIGCgpaKEHr+72aWrDt39mPtncgp5iR/9tl7Zs2s+faateac6an66U1gunfP2nGqwgoEQYVVYQUIBLrWyKqwAgQCXWtkVVgBAoGuNbIqrACBQNdJiaxT8nmFdD7gO13vSs+lR0G7Qd0nAdZmef4qeX9P15M9VwKgI9JvaZf0uqfd4G6TAAvniazbAWAe1DnZ3RlMIGBYgrVS9mi3tF5aJr2TjqZxL+h6RloqfZTWuPnoczO1PdN1b8CXvsCGgloiXzZJG6UN0vLk27Z0xffL0mqpGK1NsBjUDBnrmISTiEl+SnvSJL5th569L7T1ZdYFbCgo5me7H5YOJCA8uyhdTevC9yfSieTsS10N5Oyjtm3oHQOQbZPT+g7Mp2nQLbqeTd+ZnKi0NiKLCIt8moCNAeXnv64bti6fVdKV9J11fZf+pPt5O6MN1gcZEZIQfistkmxAm/Crnt2SdkrH02TWRigDGQeinxwYc1syH5ujXmisrWld93WdkfYlP3nRnxy8ObmwCRb7+5sjvNANyGMih21IzuKzX/qcvpsz0ZyVA/XAaAP+WFCM4yNnne7ZfuY7eethcoSos+ezj5pgeSOi56DkS/Mv3S9Ig1rOssWaM5YPcgiRe4tubMbCZwy/Lu5z322r54WrFZYZ0emG5A+L/lyUL4Bo87lszNnH+2CAI+ew0kvhEGsJvAT/i9qp8vmaW2GZEVG1VvJ5xydIkrsH4nNZbheJqDyZYxs5hzXNZetiS3N88NvM56tiYSptw64TtU+Qc0qrJre2xynkI4Csb1PV6zpWdM3lYZSiivMjlbEUII2R1RY5PvGXcpLlK6omlYSwx4m+FbHreDAGmMFg4aXIsaJlIEkpi6V/vztLkWVJlSS3PVuodzavFj5f0cZvPKrokN96bVVvKDCDUYocHwS86DfSA8lX+XnV0BuVkpyvFjlI/+Z4Oz8kO5d1bZGuiMrthwCzCl5KEf5F4ztHihlpzoE6jyzvRJ68cbhtQivLJE+S8bWe288cjZ6jzFfsDuULy+h6GJYi8hfgD+GXSuNN0r8OOB/99wBgQ+y6Ir3YPimwBjn/v40qrADxCqvCChAIdK2RVWEFCAS61siqsAIEAl3/AjF16yVFGsuNAAAAAElFTkSuQmCC\" width=\"37.5\" height=\"18\" style=\"width: 37.5px; height: 18px;\"\u003e\u003c/span\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 137.3px 7.66667px; transform-origin: 137.3px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e, and you want to break it up into bite-sized (\u003c/span\u003e\u003c/span\u003e\u003cspan style=\"vertical-align:-5px\"\u003e\u003cimg src=\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAEUAAAAkCAYAAADfJffWAAAB70lEQVRoQ+2YPS9EQRSGba8QnVpDp8E/IJGIaBBaBXoSzVZC4g9olBJfrYZCJyEapUatU+l5TzInOdkdM2fuzt3MyNnkzd3snXvumWffM1+dEfv0EegYk34CBsXjCoNiUHSDhTnFnJLfKTsI2YVWoFdd+GJaTSKTY2gMWoxlpSkfhjHhgs1VBIVhrLncHwaFMosA2y7YJq6jlUE5RL4zzh0LuaAQ5Q8X7BTX/cqgyPx/ckGRpZcDyjgCXkJ7AnasvOk+OfZIY/tAsGKh3CNpsvG3szW7MASGgDy60r3BdV1D0dOmWCjklCdoSglGAnnBM0vQ13+DQv3RgskJhN5brFP4T46ByQ2kCighx7QBpBooPjC0Jjp3g+qgY0jv0FN8+ciEZSnx77mBVOUUhkDT7JUg1cY2oiqnyDGEuaSsY7QzdDVQegfVLfTwLmEdowVSTfn8NcvEpusUELJt8U6JTbttgCkaSgyIdoGX6phWoDwji3mXyQau16lZob0WSG4wtAmlzSh93qHpWO6hkzc6jziAliE+deN4tGN9g05iLxD3GWzKOkSWkurUTLyPTgxXIT5g4luf+HIB3ULeY1XNcWRCv4NNqYNn0C6Usttt+lzjvIcJpXGSw37QoHiIGxSDoitEc4o5xZyiI2BO0XH6BQykpyWBRIonAAAAAElFTkSuQmCC\" width=\"34.5\" height=\"18\" style=\"width: 34.5px; height: 18px;\"\u003e\u003c/span\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 94.125px 7.66667px; transform-origin: 94.125px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e) pieces. How many steps are required to do this, assuming you cannot stack blocks and cut through several at once?\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function steps = chocolate(m, n)\r\n    \r\nend","test_suite":"%%\r\nassert(chocolate(1, 1) == 0)\r\n\r\n%%\r\nassert(chocolate(2, 2) == 3)\r\n\r\n%%\r\nassert(chocolate(4, 2) == 7)\r\n\r\n%%\r\nassert(chocolate(3, 3) == 8)\r\n\r\n%%\r\nassert(chocolate(5, 7) == 34)\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":332395,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":50,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2025-06-22T08:44:31.000Z","updated_at":"2026-03-05T10:46:48.000Z","published_at":"2025-06-22T08:44:31.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou've got a chocolate bar of size \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:customXml w:element=\\\"equation\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"displayStyle\\\" w:val=\\\"false\\\"/\u003e\u003c/w:customXmlPr\u003e\u003cw:r\u003e\u003cw:t\u003em\\\\times n\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:customXml\u003e\u003cw:r\u003e\u003cw:t\u003e, and you want to break it up into bite-sized (\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:customXml w:element=\\\"equation\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"displayStyle\\\" w:val=\\\"false\\\"/\u003e\u003c/w:customXmlPr\u003e\u003cw:r\u003e\u003cw:t\u003e1\\\\times 1\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:customXml\u003e\u003cw:r\u003e\u003cw:t\u003e) pieces. How many steps are required to do this, assuming you cannot stack blocks and cut through several at once?\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":44706,"title":"The Deadly Sin","description":"Melvyn and Banner are fighting over chocolates. Melvyn has X chocolates, while Banner has Y. Whoever has a lesser number of chocolates eats as many chocolates as he has from the other's collection. This eatfest war continues till either they have the same number of chocolates, or at least one of them is left with no chocolates.\r\nCan you help Eliza predict the total number of chocolates they'll be left with at the end of their war?\r\n\r\nExample \r\n  \r\n\r\n  Input:\r\nx = [5 3]\r\n\r\n  \r\nExplanation:\r\nDenoting Melvyn as M, Banner as B\r\n\r\nM=5, B=3 - Banner eats 3 chocolates of Melvyn.\r\n\r\nM=2, B=3 - Melvyn eats 2 chocolates of Banner.\r\n\r\nM=2, B=1 - Banner eats 1 chocolate of Melvyn.\r\n\r\nM=1, B=1 - Since they have the same no of candies, they stop quarreling.\r\n\r\nTotal candies left: 2 \r\n\r\n  Output:\r\n  y = 2\r\n","description_html":"\u003cp\u003eMelvyn and Banner are fighting over chocolates. Melvyn has X chocolates, while Banner has Y. Whoever has a lesser number of chocolates eats as many chocolates as he has from the other's collection. This eatfest war continues till either they have the same number of chocolates, or at least one of them is left with no chocolates.\r\nCan you help Eliza predict the total number of chocolates they'll be left with at the end of their war?\u003c/p\u003e\u003cp\u003eExample\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eInput:\r\nx = [5 3]\r\n\u003c/pre\u003e\u003cp\u003eExplanation:\r\nDenoting Melvyn as M, Banner as B\u003c/p\u003e\u003cp\u003eM=5, B=3 - Banner eats 3 chocolates of Melvyn.\u003c/p\u003e\u003cp\u003eM=2, B=3 - Melvyn eats 2 chocolates of Banner.\u003c/p\u003e\u003cp\u003eM=2, B=1 - Banner eats 1 chocolate of Melvyn.\u003c/p\u003e\u003cp\u003eM=1, B=1 - Since they have the same no of candies, they stop quarreling.\u003c/p\u003e\u003cp\u003eTotal candies left: 2\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eOutput:\r\ny = 2\r\n\u003c/pre\u003e","function_template":"function y = the_deadly_sin(x)\r\n  % Try to be witty. The problem is not that difficult to figure out.\r\nend","test_suite":"%%\r\nx = [5 3];\r\ny_correct = 2;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [10 10];\r\ny_correct = 20;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [4 8];\r\ny_correct = 8;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [30 12];\r\ny_correct = 12;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [42 91];\r\ny_correct = 14;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n\r\n%%\r\nx = [700 80];\r\ny_correct = 40;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [638 899];\r\ny_correct = 58;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [819 949];\r\ny_correct = 26;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n\r\nx = [500 500];\r\ny_correct = 1000;\r\nassert(isequal(the_deadly_sin(x),y_correct))","published":true,"deleted":false,"likes_count":5,"comments_count":0,"created_by":195572,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":27,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2018-08-02T23:07:17.000Z","updated_at":"2018-08-02T23:08:40.000Z","published_at":"2018-08-02T23:07:17.000Z","restored_at":"2018-10-10T14:57:50.000Z","restored_by":null,"spam":false,"simulink":false,"admin_reviewed":true,"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\u003eMelvyn and Banner are fighting over chocolates. Melvyn has X chocolates, while Banner has Y. Whoever has a lesser number of chocolates eats as many chocolates as he has from the other's collection. This eatfest war continues till either they have the same number of chocolates, or at least one of them is left with no chocolates. Can you help Eliza predict the total number of chocolates they'll be left with at the end of their war?\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\u003eExample\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[Input:\\nx = [5 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\u003eExplanation: Denoting Melvyn as M, Banner as B\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\u003eM=5, B=3 - Banner eats 3 chocolates of Melvyn.\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\u003eM=2, B=3 - Melvyn eats 2 chocolates of Banner.\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\u003eM=2, B=1 - Banner eats 1 chocolate of Melvyn.\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\u003eM=1, B=1 - Since they have the same no of candies, they stop quarreling.\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\u003eTotal candies left: 2\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[Output:\\ny = 2]]\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":58763,"title":"Getting Maximum Chocolate","description":"John loves Chocolate but he didn't have money. The owner of \"Sweet Chocolate\" launches a scheme for free chocolate. He divided a day into \"n\" number of slots. A person has can take the number of chocolates available in the slot with a condition that he has to return the number of chocolates which are available in the slot in which he is returning the chocolates only once in a day. Now this return has to be done on the same day and it can't be done before taking the chocolates. The number of chocolates left after the return is what you get for free. John wanted to try his luck on this, Help him in it.\r\n \r\nx-\u003eis an array consisting of the number of chocolate available in the different slots of the day.\r\n(the number of slots per day can be got from the size of the array x)","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.44px; 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 solid rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 195px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 97.5px; transform-origin: 407px 97.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 105px; 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; perspective-origin: 384px 52.5px; text-align: left; transform-origin: 384px 52.5px; white-space-collapse: preserve; 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; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eJohn loves Chocolate but he didn't have money. The owner of \"Sweet Chocolate\" launches a scheme for free chocolate. He divided a day into \"n\" number of slots. A person has can take the number of chocolates available in the slot with a condition that he has to return the number of chocolates which are available in the slot in which he is returning the chocolates only once in a day. Now this return has to be done on the same day and it can't be done before taking the chocolates. The number of chocolates left after the return is what you get for free. John wanted to try his luck on this, Help him in it.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space-collapse: preserve; 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; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space-collapse: preserve; 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; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003ex-\u0026gt;is an array consisting of the number of chocolate available in the different slots of the day.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space-collapse: preserve; 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; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e(the number of slots per day can be got from the size of the array x)\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = maxChocolate(x)\r\n    y = x;\r\nend","test_suite":"%%\r\nx = [2 4 8 5 9 12 3 1 4];\r\ny_correct = 11;\r\nassert(isequal(maxChocolate(x),y_correct));\r\n%%\r\nx = [2 4 8 9 12];\r\ny_correct = 0;\r\nassert(isequal(maxChocolate(x),y_correct));\r\n%%\r\nx = [14 100 67 78 835 4 7334 5];\r\ny_correct = 7329;\r\nassert(isequal(maxChocolate(x),y_correct));\r\n%%\r\nx = [1];\r\ny_correct = 0;\r\nassert(isequal(maxChocolate(x),y_correct))\r\n%%\r\nx = [2 324 823 23 4 292 34 39];\r\ny_correct = 819;\r\nassert(isequal(maxChocolate(x),y_correct))\r\n%%\r\nx = [1 2 4 5 0 98 1];\r\ny_correct = 97;\r\nassert(isequal(maxChocolate(x),y_correct))\r\n%%\r\nx = ones(80000,1);\r\ny_correct = 0;\r\nassert(isequal(maxChocolate(x),y_correct))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":3402444,"edited_by":3402444,"edited_at":"2023-07-19T11:04:51.000Z","deleted_by":null,"deleted_at":null,"solvers_count":8,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2023-07-19T10:13:24.000Z","updated_at":"2025-08-11T11:47:45.000Z","published_at":"2023-07-19T11:04:51.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eJohn loves Chocolate but he didn't have money. The owner of \\\"Sweet Chocolate\\\" launches a scheme for free chocolate. He divided a day into \\\"n\\\" number of slots. A person has can take the number of chocolates available in the slot with a condition that he has to return the number of chocolates which are available in the slot in which he is returning the chocolates only once in a day. Now this return has to be done on the same day and it can't be done before taking the chocolates. The number of chocolates left after the return is what you get for free. John wanted to try his luck on this, Help him in it.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ex-\u0026gt;is an array consisting of the number of chocolate available in the different slots of the day.\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\u003e(the number of slots per day can be got from the size of the array x)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":44501,"title":"Please check if calorie intake is less than 300 kcal.","description":"I like eating some puddings and some chocolate cookies around 3 o'clock. However, I care about calorie intake.\r\nPlease check whether total calorie intake is less than 300 kcal.\r\n\r\nThe calorie of a pudding is 108 kcal. \r\nThe calorie of a chocolate cookie is 48 kcal.\r\n\r\nFor example, in case of pudding = 1, cookie = 2, 1 is returned because the total caloric intake is 204 kcal and less than 300 kcal.","description_html":"\u003cp\u003eI like eating some puddings and some chocolate cookies around 3 o'clock. However, I care about calorie intake.\r\nPlease check whether total calorie intake is less than 300 kcal.\u003c/p\u003e\u003cp\u003eThe calorie of a pudding is 108 kcal. \r\nThe calorie of a chocolate cookie is 48 kcal.\u003c/p\u003e\u003cp\u003eFor example, in case of pudding = 1, cookie = 2, 1 is returned because the total caloric intake is 204 kcal and less than 300 kcal.\u003c/p\u003e","function_template":"function  c = check_cal(pudding,cookie)\r\n  c = ;\r\nend","test_suite":"%% 1 \r\npudding = 1;\r\ncookie = 2;\r\nc_correct = 1;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n\r\n%% 2 \r\npudding = 2;\r\ncookie = 2;\r\nc_correct = 0;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n\r\n\r\n%% 3 \r\npudding = 0;\r\ncookie = 6;\r\nc_correct = 1;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n\r\n\r\n%% 4 \r\npudding = 0;\r\ncookie = 7;\r\nc_correct = 0;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n\r\n\r\n%% 5 \r\npudding = 1;\r\ncookie = 4;\r\nc_correct = 0;\r\nassert(isequal(check_cal(pudding,cookie),c_correct))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":1,"created_by":137687,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":59,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2018-01-17T13:18:39.000Z","updated_at":"2026-02-17T08:33:36.000Z","published_at":"2018-01-18T14:14:04.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\u003eI like eating some puddings and some chocolate cookies around 3 o'clock. However, I care about calorie intake. Please check whether total calorie intake is less than 300 kcal.\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\u003eThe calorie of a pudding is 108 kcal. The calorie of a chocolate cookie is 48 kcal.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor example, in case of pudding = 1, cookie = 2, 1 is returned because the total caloric intake is 204 kcal and less than 300 kcal.\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":60938,"title":"Breaking up a chocolate bar","description":"You've got a chocolate bar of size , and you want to break it up into bite-sized () pieces. How many steps are required to do this, assuming you cannot stack blocks and cut through several at once?","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; 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: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 42px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 408.5px 21px; transform-origin: 408.5px 21px; vertical-align: baseline; \"\u003e\u003cdiv style=\"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; perspective-origin: 385.5px 21px; text-align: left; transform-origin: 385.5px 21px; white-space-collapse: preserve; 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; perspective-origin: 106.1px 7.66667px; transform-origin: 106.1px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eYou've got a chocolate bar of size \u003c/span\u003e\u003c/span\u003e\u003cspan style=\"vertical-align:-5px\"\u003e\u003cimg src=\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAEsAAAAkCAYAAADB7MdlAAADe0lEQVRoQ+2YO6xNQRSG7+0lHp2GBAUJIfFMRCIiJEIU4tXdyqPQIaEQFUKhUHhUokKrolB7RIGCgpaKEHr+72aWrDt39mPtncgp5iR/9tl7Zs2s+faateac6an66U1gunfP2nGqwgoEQYVVYQUIBLrWyKqwAgQCXWtkVVgBAoGuNbIqrACBQNdJiaxT8nmFdD7gO13vSs+lR0G7Qd0nAdZmef4qeX9P15M9VwKgI9JvaZf0uqfd4G6TAAvniazbAWAe1DnZ3RlMIGBYgrVS9mi3tF5aJr2TjqZxL+h6RloqfZTWuPnoczO1PdN1b8CXvsCGgloiXzZJG6UN0vLk27Z0xffL0mqpGK1NsBjUDBnrmISTiEl+SnvSJL5th569L7T1ZdYFbCgo5me7H5YOJCA8uyhdTevC9yfSieTsS10N5Oyjtm3oHQOQbZPT+g7Mp2nQLbqeTd+ZnKi0NiKLCIt8moCNAeXnv64bti6fVdKV9J11fZf+pPt5O6MN1gcZEZIQfistkmxAm/Crnt2SdkrH02TWRigDGQeinxwYc1syH5ujXmisrWld93WdkfYlP3nRnxy8ObmwCRb7+5sjvNANyGMih21IzuKzX/qcvpsz0ZyVA/XAaAP+WFCM4yNnne7ZfuY7eethcoSos+ezj5pgeSOi56DkS/Mv3S9Ig1rOssWaM5YPcgiRe4tubMbCZwy/Lu5z322r54WrFZYZ0emG5A+L/lyUL4Bo87lszNnH+2CAI+ew0kvhEGsJvAT/i9qp8vmaW2GZEVG1VvJ5xydIkrsH4nNZbheJqDyZYxs5hzXNZetiS3N88NvM56tiYSptw64TtU+Qc0qrJre2xynkI4Csb1PV6zpWdM3lYZSiivMjlbEUII2R1RY5PvGXcpLlK6omlYSwx4m+FbHreDAGmMFg4aXIsaJlIEkpi6V/vztLkWVJlSS3PVuodzavFj5f0cZvPKrokN96bVVvKDCDUYocHwS86DfSA8lX+XnV0BuVkpyvFjlI/+Z4Oz8kO5d1bZGuiMrthwCzCl5KEf5F4ztHihlpzoE6jyzvRJ68cbhtQivLJE+S8bWe288cjZ6jzFfsDuULy+h6GJYi8hfgD+GXSuNN0r8OOB/99wBgQ+y6Ir3YPimwBjn/v40qrADxCqvCChAIdK2RVWEFCAS61siqsAIEAl3/AjF16yVFGsuNAAAAAElFTkSuQmCC\" width=\"37.5\" height=\"18\" style=\"width: 37.5px; height: 18px;\"\u003e\u003c/span\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 137.3px 7.66667px; transform-origin: 137.3px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e, and you want to break it up into bite-sized (\u003c/span\u003e\u003c/span\u003e\u003cspan style=\"vertical-align:-5px\"\u003e\u003cimg src=\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAEUAAAAkCAYAAADfJffWAAAB70lEQVRoQ+2YPS9EQRSGba8QnVpDp8E/IJGIaBBaBXoSzVZC4g9olBJfrYZCJyEapUatU+l5TzInOdkdM2fuzt3MyNnkzd3snXvumWffM1+dEfv0EegYk34CBsXjCoNiUHSDhTnFnJLfKTsI2YVWoFdd+GJaTSKTY2gMWoxlpSkfhjHhgs1VBIVhrLncHwaFMosA2y7YJq6jlUE5RL4zzh0LuaAQ5Q8X7BTX/cqgyPx/ckGRpZcDyjgCXkJ7AnasvOk+OfZIY/tAsGKh3CNpsvG3szW7MASGgDy60r3BdV1D0dOmWCjklCdoSglGAnnBM0vQ13+DQv3RgskJhN5brFP4T46ByQ2kCighx7QBpBooPjC0Jjp3g+qgY0jv0FN8+ciEZSnx77mBVOUUhkDT7JUg1cY2oiqnyDGEuaSsY7QzdDVQegfVLfTwLmEdowVSTfn8NcvEpusUELJt8U6JTbttgCkaSgyIdoGX6phWoDwji3mXyQau16lZob0WSG4wtAmlzSh93qHpWO6hkzc6jziAliE+deN4tGN9g05iLxD3GWzKOkSWkurUTLyPTgxXIT5g4luf+HIB3ULeY1XNcWRCv4NNqYNn0C6Usttt+lzjvIcJpXGSw37QoHiIGxSDoitEc4o5xZyiI2BO0XH6BQykpyWBRIonAAAAAElFTkSuQmCC\" width=\"34.5\" height=\"18\" style=\"width: 34.5px; height: 18px;\"\u003e\u003c/span\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 94.125px 7.66667px; transform-origin: 94.125px 7.66667px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e) pieces. How many steps are required to do this, assuming you cannot stack blocks and cut through several at once?\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function steps = chocolate(m, n)\r\n    \r\nend","test_suite":"%%\r\nassert(chocolate(1, 1) == 0)\r\n\r\n%%\r\nassert(chocolate(2, 2) == 3)\r\n\r\n%%\r\nassert(chocolate(4, 2) == 7)\r\n\r\n%%\r\nassert(chocolate(3, 3) == 8)\r\n\r\n%%\r\nassert(chocolate(5, 7) == 34)\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":332395,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":50,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2025-06-22T08:44:31.000Z","updated_at":"2026-03-05T10:46:48.000Z","published_at":"2025-06-22T08:44:31.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou've got a chocolate bar of size \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:customXml w:element=\\\"equation\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"displayStyle\\\" w:val=\\\"false\\\"/\u003e\u003c/w:customXmlPr\u003e\u003cw:r\u003e\u003cw:t\u003em\\\\times n\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:customXml\u003e\u003cw:r\u003e\u003cw:t\u003e, and you want to break it up into bite-sized (\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:customXml w:element=\\\"equation\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"displayStyle\\\" w:val=\\\"false\\\"/\u003e\u003c/w:customXmlPr\u003e\u003cw:r\u003e\u003cw:t\u003e1\\\\times 1\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:customXml\u003e\u003cw:r\u003e\u003cw:t\u003e) pieces. How many steps are required to do this, assuming you cannot stack blocks and cut through several at once?\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":44706,"title":"The Deadly Sin","description":"Melvyn and Banner are fighting over chocolates. Melvyn has X chocolates, while Banner has Y. Whoever has a lesser number of chocolates eats as many chocolates as he has from the other's collection. This eatfest war continues till either they have the same number of chocolates, or at least one of them is left with no chocolates.\r\nCan you help Eliza predict the total number of chocolates they'll be left with at the end of their war?\r\n\r\nExample \r\n  \r\n\r\n  Input:\r\nx = [5 3]\r\n\r\n  \r\nExplanation:\r\nDenoting Melvyn as M, Banner as B\r\n\r\nM=5, B=3 - Banner eats 3 chocolates of Melvyn.\r\n\r\nM=2, B=3 - Melvyn eats 2 chocolates of Banner.\r\n\r\nM=2, B=1 - Banner eats 1 chocolate of Melvyn.\r\n\r\nM=1, B=1 - Since they have the same no of candies, they stop quarreling.\r\n\r\nTotal candies left: 2 \r\n\r\n  Output:\r\n  y = 2\r\n","description_html":"\u003cp\u003eMelvyn and Banner are fighting over chocolates. Melvyn has X chocolates, while Banner has Y. Whoever has a lesser number of chocolates eats as many chocolates as he has from the other's collection. This eatfest war continues till either they have the same number of chocolates, or at least one of them is left with no chocolates.\r\nCan you help Eliza predict the total number of chocolates they'll be left with at the end of their war?\u003c/p\u003e\u003cp\u003eExample\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eInput:\r\nx = [5 3]\r\n\u003c/pre\u003e\u003cp\u003eExplanation:\r\nDenoting Melvyn as M, Banner as B\u003c/p\u003e\u003cp\u003eM=5, B=3 - Banner eats 3 chocolates of Melvyn.\u003c/p\u003e\u003cp\u003eM=2, B=3 - Melvyn eats 2 chocolates of Banner.\u003c/p\u003e\u003cp\u003eM=2, B=1 - Banner eats 1 chocolate of Melvyn.\u003c/p\u003e\u003cp\u003eM=1, B=1 - Since they have the same no of candies, they stop quarreling.\u003c/p\u003e\u003cp\u003eTotal candies left: 2\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eOutput:\r\ny = 2\r\n\u003c/pre\u003e","function_template":"function y = the_deadly_sin(x)\r\n  % Try to be witty. The problem is not that difficult to figure out.\r\nend","test_suite":"%%\r\nx = [5 3];\r\ny_correct = 2;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [10 10];\r\ny_correct = 20;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [4 8];\r\ny_correct = 8;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [30 12];\r\ny_correct = 12;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [42 91];\r\ny_correct = 14;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n\r\n%%\r\nx = [700 80];\r\ny_correct = 40;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [638 899];\r\ny_correct = 58;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n%%\r\nx = [819 949];\r\ny_correct = 26;\r\nassert(isequal(the_deadly_sin(x),y_correct))\r\n\r\n\r\nx = [500 500];\r\ny_correct = 1000;\r\nassert(isequal(the_deadly_sin(x),y_correct))","published":true,"deleted":false,"likes_count":5,"comments_count":0,"created_by":195572,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":27,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2018-08-02T23:07:17.000Z","updated_at":"2018-08-02T23:08:40.000Z","published_at":"2018-08-02T23:07:17.000Z","restored_at":"2018-10-10T14:57:50.000Z","restored_by":null,"spam":false,"simulink":false,"admin_reviewed":true,"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\u003eMelvyn and Banner are fighting over chocolates. Melvyn has X chocolates, while Banner has Y. Whoever has a lesser number of chocolates eats as many chocolates as he has from the other's collection. This eatfest war continues till either they have the same number of chocolates, or at least one of them is left with no chocolates. Can you help Eliza predict the total number of chocolates they'll be left with at the end of their war?\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\u003eExample\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[Input:\\nx = [5 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\u003eExplanation: Denoting Melvyn as M, Banner as B\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\u003eM=5, B=3 - Banner eats 3 chocolates of Melvyn.\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\u003eM=2, B=3 - Melvyn eats 2 chocolates of Banner.\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\u003eM=2, B=1 - Banner eats 1 chocolate of Melvyn.\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\u003eM=1, B=1 - Since they have the same no of candies, they stop quarreling.\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\u003eTotal candies left: 2\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[Output:\\ny = 2]]\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":58763,"title":"Getting Maximum Chocolate","description":"John loves Chocolate but he didn't have money. The owner of \"Sweet Chocolate\" launches a scheme for free chocolate. He divided a day into \"n\" number of slots. A person has can take the number of chocolates available in the slot with a condition that he has to return the number of chocolates which are available in the slot in which he is returning the chocolates only once in a day. Now this return has to be done on the same day and it can't be done before taking the chocolates. The number of chocolates left after the return is what you get for free. John wanted to try his luck on this, Help him in it.\r\n \r\nx-\u003eis an array consisting of the number of chocolate available in the different slots of the day.\r\n(the number of slots per day can be got from the size of the array x)","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.44px; 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 solid rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 195px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 97.5px; transform-origin: 407px 97.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 105px; 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; perspective-origin: 384px 52.5px; text-align: left; transform-origin: 384px 52.5px; white-space-collapse: preserve; 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; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eJohn loves Chocolate but he didn't have money. The owner of \"Sweet Chocolate\" launches a scheme for free chocolate. He divided a day into \"n\" number of slots. A person has can take the number of chocolates available in the slot with a condition that he has to return the number of chocolates which are available in the slot in which he is returning the chocolates only once in a day. Now this return has to be done on the same day and it can't be done before taking the chocolates. The number of chocolates left after the return is what you get for free. John wanted to try his luck on this, Help him in it.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space-collapse: preserve; 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; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space-collapse: preserve; 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; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003ex-\u0026gt;is an array consisting of the number of chocolate available in the different slots of the day.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space-collapse: preserve; 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; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e(the number of slots per day can be got from the size of the array x)\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = maxChocolate(x)\r\n    y = x;\r\nend","test_suite":"%%\r\nx = [2 4 8 5 9 12 3 1 4];\r\ny_correct = 11;\r\nassert(isequal(maxChocolate(x),y_correct));\r\n%%\r\nx = [2 4 8 9 12];\r\ny_correct = 0;\r\nassert(isequal(maxChocolate(x),y_correct));\r\n%%\r\nx = [14 100 67 78 835 4 7334 5];\r\ny_correct = 7329;\r\nassert(isequal(maxChocolate(x),y_correct));\r\n%%\r\nx = [1];\r\ny_correct = 0;\r\nassert(isequal(maxChocolate(x),y_correct))\r\n%%\r\nx = [2 324 823 23 4 292 34 39];\r\ny_correct = 819;\r\nassert(isequal(maxChocolate(x),y_correct))\r\n%%\r\nx = [1 2 4 5 0 98 1];\r\ny_correct = 97;\r\nassert(isequal(maxChocolate(x),y_correct))\r\n%%\r\nx = ones(80000,1);\r\ny_correct = 0;\r\nassert(isequal(maxChocolate(x),y_correct))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":3402444,"edited_by":3402444,"edited_at":"2023-07-19T11:04:51.000Z","deleted_by":null,"deleted_at":null,"solvers_count":8,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2023-07-19T10:13:24.000Z","updated_at":"2025-08-11T11:47:45.000Z","published_at":"2023-07-19T11:04:51.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eJohn loves Chocolate but he didn't have money. The owner of \\\"Sweet Chocolate\\\" launches a scheme for free chocolate. He divided a day into \\\"n\\\" number of slots. A person has can take the number of chocolates available in the slot with a condition that he has to return the number of chocolates which are available in the slot in which he is returning the chocolates only once in a day. Now this return has to be done on the same day and it can't be done before taking the chocolates. The number of chocolates left after the return is what you get for free. John wanted to try his luck on this, Help him in it.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ex-\u0026gt;is an array consisting of the number of chocolate available in the different slots of the day.\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\u003e(the number of slots per day can be got from the size of the array x)\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\"}]}"}],"term":"tag:\"chocolate\"","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:\"chocolate\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"chocolate\"","","\"","chocolate","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f46047bdad0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f46047bd850\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f46047bce50\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f46047bddf0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f46047bdd50\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f46047bdcb0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f46047bdb70\u003e":"tag:\"chocolate\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f46047bdb70\u003e":"tag:\"chocolate\""},"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:\"chocolate\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"chocolate\"","","\"","chocolate","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f46047bdad0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f46047bd850\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f46047bce50\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f46047bddf0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f46047bdd50\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f46047bdcb0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f46047bdb70\u003e":"tag:\"chocolate\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f46047bdb70\u003e":"tag:\"chocolate\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":44501,"difficulty_rating":"easy"},{"id":60938,"difficulty_rating":"easy"},{"id":44706,"difficulty_rating":"easy-medium"},{"id":58763,"difficulty_rating":"medium"}]}}