{"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":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\"}]}"}],"problem_search":{"errors":[],"problems":[{"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\"}]}"}],"term":"tag:\"eatfest\"","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:\"eatfest\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"eatfest\"","","\"","eatfest","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f2516794428\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f2516794388\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f2516793988\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f2516794748\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f25167946a8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f2516794568\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f25167944c8\u003e":"tag:\"eatfest\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f25167944c8\u003e":"tag:\"eatfest\""},"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:\"eatfest\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"eatfest\"","","\"","eatfest","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f2516794428\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f2516794388\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f2516793988\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f2516794748\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f25167946a8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f2516794568\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f25167944c8\u003e":"tag:\"eatfest\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f25167944c8\u003e":"tag:\"eatfest\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":44706,"difficulty_rating":"easy-medium"}]}}