{"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":1774,"title":"Free passes for everyone!","description":"_Simply return the name of the coolest numerical computation software ever_\r\n\r\n*Extra reward* (get a _freepass_):\r\n\r\nOnce a month, as an additional reward for solving this problem, you may get a temporary freepass *to solve any other Cody problem*. To use this freepass follow these steps:\r\n\r\n# First, at the beginning of a new month, solve this problem correctly\r\n# Then immediately visit the Cody problem that you wish to solve, click 'Solve this now', and enter within the function body of your solution the line: \r\n\r\n freepass.please;\r\n\r\nand Cody _may_ accept that solution as correct. \r\n\r\nYou will typically need to repeat step (2) above multiple times until Cody _does_ accept your solution as correct. If you are getting an error message saying _Undefined variable \"freepass\" or class \"freepass.please\"_ simply continue repeating step 2 until you pass the problem and get a message saying _freepass granted, congratulations!_. \r\n\r\n*Fineprint*:\r\n\r\n1) For each Cody player, this problem will grant a new freepass per day until one is successfully used to pass a different Cody problem. Once this happens this problem will only grant the same Cody player a new freepass the next Calendar month.  \r\n\r\n2) _How many times do I need to submit a freepass.please solution to a different Cody problem for it to pass?_ Short answer: around 10, but perhaps as many as 30 times (your faith may be tested, but perseverance will be rewarded at the end :)  \r\n\r\nLong answer: at any given time, Cody has many servers running players' solutions (perhaps around 20 servers?). Every time that you solve this problem a _freepass_ is issued only for the particular server where your solution was evaluated. When you run a _freepass.please_ solution, if that solution is run in the same server where a freepass was issued your solution will pass, otherwise you will get an \"_undefined variable freepass_\" error. So in order for your solution to pass you simply need to keep resubmitting it until you finally hit the same server where your freepass-problem solution was originally evaluated. Also note that, from time to time, Cody will close a server and start a new one. If that happens any freepass stored in that server will be lost (and you will need to try again steps 1 and 2 above next day)\r\n\r\n3) Your correct solution will get a score of 100 (this is typically high enough so that we do not troll the score lead with these freepasses)\r\n\r\n4) Feel free to explore this problem testsuite to see how this works, but please respect some basic courtesy guidelines if you decide to implement your own (e.g. the service does not interfere with the normal Cody operation; it cleans up after itself; don't use it to get a leading score; etc.)  Comments and suggestions for improvement are appreciated!\r\n\r\n5) This _freepass_ service is 'likeware'. Please 'like' this problem if you liked the code or enjoy using your freepasses :)\r\n","description_html":"\u003cp\u003e\u003ci\u003eSimply return the name of the coolest numerical computation software ever\u003c/i\u003e\u003c/p\u003e\u003cp\u003e\u003cb\u003eExtra reward\u003c/b\u003e (get a \u003ci\u003efreepass\u003c/i\u003e):\u003c/p\u003e\u003cp\u003eOnce a month, as an additional reward for solving this problem, you may get a temporary freepass \u003cb\u003eto solve any other Cody problem\u003c/b\u003e. To use this freepass follow these steps:\u003c/p\u003e\u003col\u003e\u003cli\u003eFirst, at the beginning of a new month, solve this problem correctly\u003c/li\u003e\u003cli\u003eThen immediately visit the Cody problem that you wish to solve, click 'Solve this now', and enter within the function body of your solution the line:\u003c/li\u003e\u003c/ol\u003e\u003cpre\u003e freepass.please;\u003c/pre\u003e\u003cp\u003eand Cody \u003ci\u003emay\u003c/i\u003e accept that solution as correct.\u003c/p\u003e\u003cp\u003eYou will typically need to repeat step (2) above multiple times until Cody \u003ci\u003edoes\u003c/i\u003e accept your solution as correct. If you are getting an error message saying \u003ci\u003eUndefined variable \"freepass\" or class \"freepass.please\"\u003c/i\u003e simply continue repeating step 2 until you pass the problem and get a message saying \u003ci\u003efreepass granted, congratulations!\u003c/i\u003e.\u003c/p\u003e\u003cp\u003e\u003cb\u003eFineprint\u003c/b\u003e:\u003c/p\u003e\u003cp\u003e1) For each Cody player, this problem will grant a new freepass per day until one is successfully used to pass a different Cody problem. Once this happens this problem will only grant the same Cody player a new freepass the next Calendar month.\u003c/p\u003e\u003cp\u003e2) \u003ci\u003eHow many times do I need to submit a freepass.please solution to a different Cody problem for it to pass?\u003c/i\u003e Short answer: around 10, but perhaps as many as 30 times (your faith may be tested, but perseverance will be rewarded at the end :)\u003c/p\u003e\u003cp\u003eLong answer: at any given time, Cody has many servers running players' solutions (perhaps around 20 servers?). Every time that you solve this problem a \u003ci\u003efreepass\u003c/i\u003e is issued only for the particular server where your solution was evaluated. When you run a \u003ci\u003efreepass.please\u003c/i\u003e solution, if that solution is run in the same server where a freepass was issued your solution will pass, otherwise you will get an \"_undefined variable freepass_\" error. So in order for your solution to pass you simply need to keep resubmitting it until you finally hit the same server where your freepass-problem solution was originally evaluated. Also note that, from time to time, Cody will close a server and start a new one. If that happens any freepass stored in that server will be lost (and you will need to try again steps 1 and 2 above next day)\u003c/p\u003e\u003cp\u003e3) Your correct solution will get a score of 100 (this is typically high enough so that we do not troll the score lead with these freepasses)\u003c/p\u003e\u003cp\u003e4) Feel free to explore this problem testsuite to see how this works, but please respect some basic courtesy guidelines if you decide to implement your own (e.g. the service does not interfere with the normal Cody operation; it cleans up after itself; don't use it to get a leading score; etc.)  Comments and suggestions for improvement are appreciated!\u003c/p\u003e\u003cp\u003e5) This \u003ci\u003efreepass\u003c/i\u003e service is 'likeware'. Please 'like' this problem if you liked the code or enjoy using your freepasses :)\u003c/p\u003e","function_template":"function y = myfunction()\r\n  y = 'mmm...';\r\nend","test_suite":"%%\r\nif strcmpi(myfunction(),'matlab')\r\n if isempty(which('freepass')),\r\n  fh=fopen('freepass_system.p','wb');\r\n  fwrite(fh,uint8(sscanf('7630312E30307630302E3030000A101CBC6EDFB1000000E3000005F30000097C16D96804352FE98DD24AC0CF78D05A46EB3BA144303F54379A8622E060F96AD31BA819796EF843D2B5A203AB63481C90679596B80A480D4D3D75BEF8E968330277757DBC07DEDE4552F29944A7E60F736862BD148B85D7195AB9078A8D23D0649B53B58A0E99919D616972465982E71AEC4AC18B74C952CF140A1386FB25F4A706BE326CDA10068E267864FE898B79C4B8A0C53B342F6007727CB1FBD1408B3D10B92C3CF7EF87A5FD488524F5735EE3D954A4C0DA662887A6953DD56712E278BD32681CA13EE9BD447626191097A15737A82CAB411732609720D35181AC240D6011AC24EA5EE2A00FF557831609A6252A1C61CFDCA40BE6E908B01ABEC50AEEEF38C36D22528C3506FB3777675806BC12E98E0C741DAEE477077DF0FC1338206205146B558BD41AE55D9AB8425426F52DB1115FFD2DAD867A94E377DC041A0868437742180F4B835487C8A9D237DF1F3AF1E5521E88B54C949CB19AE77C96F9BBB663761E15D9A9437C2DB20BA20C545E484691129D8964615FF08CE57D009B0BD6CB7995DEC39574CC39FCD5CEC940F06158AEAC8809306E3DE67F2C0BD6B025D9F6D13657027C9D0EC469EDCC064A0C96A56366C8100882DE2261AABB24E52D20F2230493799721942349EA9671A82A6340FE1FDC3426C42773CF22DEA4A4894FFA493CFDEBE34578213F94F9D304519081F5AB88C7AA36100089EAD88B3349CD9A949A20EE6EDC557DCC4E53FC981A30D4D4BB2F7BC536CBBA13D3AD79BA784DC2609B452154BED25FF25188A8D0AFF72DF0E4A9AA503341B3500E747390E5CC4C1F62306C596DE096A171944244619C7B7DCCB88CAC4D3D6592D6783A5BB6815245D154D422594EA5137383CE944CBEFFA1CE7EDA769289AB48A1ABB68D2E2FFD75AC03D89E5DC3497D127447EAC9BD3B30A48FB2DF7F3155CB9DB801AF4C02DBFD67B07B1C3A109B8F372E14AB8439DC15381BBFD727EAD3D21BAD3A695A96916C63070111041AF243AEA88C736E36A9949425C7E7B2F0CF8F8A317690FE458108FDB88B9E8B94B1B6F85D401D04DAA4B7EBAA5945CBC0832A7C87DA2481B6C9796ECFE855CB03496A58B294A07F846038153D10206DC484F68843B328E883091BD9A32DE92E67A72F5FE499B3A9BF7931FDB02079D85628C6177D66244BD1EA2F217178F830045E0E235CF19B8305C15222FB55BE3D7C0B6DA203CD0CDB7DC419FF11D6CEBA150EC517EFD917F1A75EF33207FB0582F54163C08E5D1BAE47532668AAC257E41C673BB0F177F958C26CC923C78790199B4848A91889CADF247B8EBDC53ECFAF31F855A20674E45B1FFC3BCE4AB747C3CD41FAAEC532D2AD80AE72DFCD71034C473B2D4F1DC916D7D53832181A3834B773877B9790C75460BD7F003D52C31AFB11CFC98069E6DFEF01BC9879304E2DE899D329BB6C27BD2DDDF257DCC8DD2236ED6C944396147BE0DC33835F136555070E7E3FD9938D4771835D71D26038D730C64C9C9547F8DADB033D7927291B48B61EF407950EC5338FA84AA5423FE6F6A8F967312B215B7C60F10CE0D67BF7D1E533588C6BCBAE05BB7A5ED6E4B54AF670055D7D7D39BA9653D3FC74CD3AEE7ACE4CDE7E663B2C8882B7D2F5E5A3B59B0D647E919BC80C2F7F5448E1D4E2408AC0C8C9E5861B000B3456F5524946C8F6272B283DC801BD0F63A70BA3DD601E9711717E01F2E9774EC684B01F030A12A5139D94B99EFBDCE365A23C0CDC197AC640C76F5B51697802DB7A5EC8DAD8D483D8DCED82C6A70EA1752C6246003CC678D6820CD06A8700C335B702ADB0611AD824EF0F57196D53340DD1F3E125AEC6858B273FD6B8F42E23A98EE35783EC494E93798E4ABA04487F7025F91A390DEDEB63E3F565A6588C384E5D8AD11AB821EEAF4CCBEA33151B7EFDB181A0AA6393BE60DC5E6D3FF1DDAF496B0E169AB3052A5079BB8D372AC79186C79EE8E0E8EFFF604FD371072A3082420FA87D52E12D2A18F5672626CD8AC18DF2E84F201A9ABB1D082C865382C842B81964E81C2DA252269A66FAAF398D096B30323DF49CD4FAD57001D36B77C265320F125B56E951A652528BF7250D2100E907F51DF39F50D660C2C4A4D6232945926A0A2A614DD4F52B4FAB1802BDAAFE62C446','%2X')));\r\n  fclose(fh);\r\n  ok=freepass_system();\r\n  if ok\r\n      [nill,name]=system('hostname');\r\n      fprintf('A new freepass was issued at server %s\\n',name);\r\n  else\r\n      fprintf('Sorry, it was not possible to issue a new freepass\\n');\r\n  end\r\n else\r\n  [nill,name]=system('hostname');\r\n  fprintf('An existing freepass was already available at server %s\\n',name);\r\n end\r\nelse\r\n  assert(false);\r\nend\r\n","published":true,"deleted":false,"likes_count":67,"comments_count":22,"created_by":43,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":764,"test_suite_updated_at":"2017-10-29T03:47:26.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-08-04T07:42:38.000Z","updated_at":"2026-03-29T19:47:31.000Z","published_at":"2013-08-05T05:29:02.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:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eSimply return the name of the coolest numerical computation software ever\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\u003eExtra reward\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e (get a\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\u003efreepass\u003c/w:t\u003e\u003c/w:r\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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOnce a month, as an additional reward for solving this problem, you may get a temporary freepass\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\u003eto solve any other Cody problem\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e. To use this freepass follow these steps:\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=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFirst, at the beginning of a new month, solve this problem correctly\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=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThen immediately visit the Cody problem that you wish to solve, click 'Solve this now', and enter within the function body of your solution the line:\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[ freepass.please;]]\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\u003eand Cody\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\u003emay\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e accept that solution as correct.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou will typically need to repeat step (2) above multiple times until Cody\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\u003edoes\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e accept your solution as correct. If you are getting an error message saying\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\u003eUndefined variable \\\"freepass\\\" or class \\\"freepass.please\\\"\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e simply continue repeating step 2 until you pass the problem and get a message saying\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\u003efreepass granted, congratulations!\u003c/w:t\u003e\u003c/w:r\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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eFineprint\u003c/w:t\u003e\u003c/w:r\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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1) For each Cody player, this problem will grant a new freepass per day until one is successfully used to pass a different Cody problem. Once this happens this problem will only grant the same Cody player a new freepass the next Calendar month.\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\u003e2)\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\u003eHow many times do I need to submit a freepass.please solution to a different Cody problem for it to pass?\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Short answer: around 10, but perhaps as many as 30 times (your faith may be tested, but perseverance will be rewarded at the end :)\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\u003eLong answer: at any given time, Cody has many servers running players' solutions (perhaps around 20 servers?). Every time that you solve this problem a\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\u003efreepass\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e is issued only for the particular server where your solution was evaluated. When you run a\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\u003efreepass.please\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e solution, if that solution is run in the same server where a freepass was issued your solution will pass, otherwise you will get an \\\"_undefined variable freepass_\\\" error. So in order for your solution to pass you simply need to keep resubmitting it until you finally hit the same server where your freepass-problem solution was originally evaluated. Also note that, from time to time, Cody will close a server and start a new one. If that happens any freepass stored in that server will be lost (and you will need to try again steps 1 and 2 above next 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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3) Your correct solution will get a score of 100 (this is typically high enough so that we do not troll the score lead with these freepasses)\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\u003e4) Feel free to explore this problem testsuite to see how this works, but please respect some basic courtesy guidelines if you decide to implement your own (e.g. the service does not interfere with the normal Cody operation; it cleans up after itself; don't use it to get a leading score; etc.) Comments and suggestions for improvement are appreciated!\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\u003e5) This\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\u003efreepass\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e service is 'likeware'. Please 'like' this problem if you liked the code or enjoy using your freepasses :)\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":1774,"title":"Free passes for everyone!","description":"_Simply return the name of the coolest numerical computation software ever_\r\n\r\n*Extra reward* (get a _freepass_):\r\n\r\nOnce a month, as an additional reward for solving this problem, you may get a temporary freepass *to solve any other Cody problem*. To use this freepass follow these steps:\r\n\r\n# First, at the beginning of a new month, solve this problem correctly\r\n# Then immediately visit the Cody problem that you wish to solve, click 'Solve this now', and enter within the function body of your solution the line: \r\n\r\n freepass.please;\r\n\r\nand Cody _may_ accept that solution as correct. \r\n\r\nYou will typically need to repeat step (2) above multiple times until Cody _does_ accept your solution as correct. If you are getting an error message saying _Undefined variable \"freepass\" or class \"freepass.please\"_ simply continue repeating step 2 until you pass the problem and get a message saying _freepass granted, congratulations!_. \r\n\r\n*Fineprint*:\r\n\r\n1) For each Cody player, this problem will grant a new freepass per day until one is successfully used to pass a different Cody problem. Once this happens this problem will only grant the same Cody player a new freepass the next Calendar month.  \r\n\r\n2) _How many times do I need to submit a freepass.please solution to a different Cody problem for it to pass?_ Short answer: around 10, but perhaps as many as 30 times (your faith may be tested, but perseverance will be rewarded at the end :)  \r\n\r\nLong answer: at any given time, Cody has many servers running players' solutions (perhaps around 20 servers?). Every time that you solve this problem a _freepass_ is issued only for the particular server where your solution was evaluated. When you run a _freepass.please_ solution, if that solution is run in the same server where a freepass was issued your solution will pass, otherwise you will get an \"_undefined variable freepass_\" error. So in order for your solution to pass you simply need to keep resubmitting it until you finally hit the same server where your freepass-problem solution was originally evaluated. Also note that, from time to time, Cody will close a server and start a new one. If that happens any freepass stored in that server will be lost (and you will need to try again steps 1 and 2 above next day)\r\n\r\n3) Your correct solution will get a score of 100 (this is typically high enough so that we do not troll the score lead with these freepasses)\r\n\r\n4) Feel free to explore this problem testsuite to see how this works, but please respect some basic courtesy guidelines if you decide to implement your own (e.g. the service does not interfere with the normal Cody operation; it cleans up after itself; don't use it to get a leading score; etc.)  Comments and suggestions for improvement are appreciated!\r\n\r\n5) This _freepass_ service is 'likeware'. Please 'like' this problem if you liked the code or enjoy using your freepasses :)\r\n","description_html":"\u003cp\u003e\u003ci\u003eSimply return the name of the coolest numerical computation software ever\u003c/i\u003e\u003c/p\u003e\u003cp\u003e\u003cb\u003eExtra reward\u003c/b\u003e (get a \u003ci\u003efreepass\u003c/i\u003e):\u003c/p\u003e\u003cp\u003eOnce a month, as an additional reward for solving this problem, you may get a temporary freepass \u003cb\u003eto solve any other Cody problem\u003c/b\u003e. To use this freepass follow these steps:\u003c/p\u003e\u003col\u003e\u003cli\u003eFirst, at the beginning of a new month, solve this problem correctly\u003c/li\u003e\u003cli\u003eThen immediately visit the Cody problem that you wish to solve, click 'Solve this now', and enter within the function body of your solution the line:\u003c/li\u003e\u003c/ol\u003e\u003cpre\u003e freepass.please;\u003c/pre\u003e\u003cp\u003eand Cody \u003ci\u003emay\u003c/i\u003e accept that solution as correct.\u003c/p\u003e\u003cp\u003eYou will typically need to repeat step (2) above multiple times until Cody \u003ci\u003edoes\u003c/i\u003e accept your solution as correct. If you are getting an error message saying \u003ci\u003eUndefined variable \"freepass\" or class \"freepass.please\"\u003c/i\u003e simply continue repeating step 2 until you pass the problem and get a message saying \u003ci\u003efreepass granted, congratulations!\u003c/i\u003e.\u003c/p\u003e\u003cp\u003e\u003cb\u003eFineprint\u003c/b\u003e:\u003c/p\u003e\u003cp\u003e1) For each Cody player, this problem will grant a new freepass per day until one is successfully used to pass a different Cody problem. Once this happens this problem will only grant the same Cody player a new freepass the next Calendar month.\u003c/p\u003e\u003cp\u003e2) \u003ci\u003eHow many times do I need to submit a freepass.please solution to a different Cody problem for it to pass?\u003c/i\u003e Short answer: around 10, but perhaps as many as 30 times (your faith may be tested, but perseverance will be rewarded at the end :)\u003c/p\u003e\u003cp\u003eLong answer: at any given time, Cody has many servers running players' solutions (perhaps around 20 servers?). Every time that you solve this problem a \u003ci\u003efreepass\u003c/i\u003e is issued only for the particular server where your solution was evaluated. When you run a \u003ci\u003efreepass.please\u003c/i\u003e solution, if that solution is run in the same server where a freepass was issued your solution will pass, otherwise you will get an \"_undefined variable freepass_\" error. So in order for your solution to pass you simply need to keep resubmitting it until you finally hit the same server where your freepass-problem solution was originally evaluated. Also note that, from time to time, Cody will close a server and start a new one. If that happens any freepass stored in that server will be lost (and you will need to try again steps 1 and 2 above next day)\u003c/p\u003e\u003cp\u003e3) Your correct solution will get a score of 100 (this is typically high enough so that we do not troll the score lead with these freepasses)\u003c/p\u003e\u003cp\u003e4) Feel free to explore this problem testsuite to see how this works, but please respect some basic courtesy guidelines if you decide to implement your own (e.g. the service does not interfere with the normal Cody operation; it cleans up after itself; don't use it to get a leading score; etc.)  Comments and suggestions for improvement are appreciated!\u003c/p\u003e\u003cp\u003e5) This \u003ci\u003efreepass\u003c/i\u003e service is 'likeware'. Please 'like' this problem if you liked the code or enjoy using your freepasses :)\u003c/p\u003e","function_template":"function y = myfunction()\r\n  y = 'mmm...';\r\nend","test_suite":"%%\r\nif strcmpi(myfunction(),'matlab')\r\n if isempty(which('freepass')),\r\n  fh=fopen('freepass_system.p','wb');\r\n  fwrite(fh,uint8(sscanf('7630312E30307630302E3030000A101CBC6EDFB1000000E3000005F30000097C16D96804352FE98DD24AC0CF78D05A46EB3BA144303F54379A8622E060F96AD31BA819796EF843D2B5A203AB63481C90679596B80A480D4D3D75BEF8E968330277757DBC07DEDE4552F29944A7E60F736862BD148B85D7195AB9078A8D23D0649B53B58A0E99919D616972465982E71AEC4AC18B74C952CF140A1386FB25F4A706BE326CDA10068E267864FE898B79C4B8A0C53B342F6007727CB1FBD1408B3D10B92C3CF7EF87A5FD488524F5735EE3D954A4C0DA662887A6953DD56712E278BD32681CA13EE9BD447626191097A15737A82CAB411732609720D35181AC240D6011AC24EA5EE2A00FF557831609A6252A1C61CFDCA40BE6E908B01ABEC50AEEEF38C36D22528C3506FB3777675806BC12E98E0C741DAEE477077DF0FC1338206205146B558BD41AE55D9AB8425426F52DB1115FFD2DAD867A94E377DC041A0868437742180F4B835487C8A9D237DF1F3AF1E5521E88B54C949CB19AE77C96F9BBB663761E15D9A9437C2DB20BA20C545E484691129D8964615FF08CE57D009B0BD6CB7995DEC39574CC39FCD5CEC940F06158AEAC8809306E3DE67F2C0BD6B025D9F6D13657027C9D0EC469EDCC064A0C96A56366C8100882DE2261AABB24E52D20F2230493799721942349EA9671A82A6340FE1FDC3426C42773CF22DEA4A4894FFA493CFDEBE34578213F94F9D304519081F5AB88C7AA36100089EAD88B3349CD9A949A20EE6EDC557DCC4E53FC981A30D4D4BB2F7BC536CBBA13D3AD79BA784DC2609B452154BED25FF25188A8D0AFF72DF0E4A9AA503341B3500E747390E5CC4C1F62306C596DE096A171944244619C7B7DCCB88CAC4D3D6592D6783A5BB6815245D154D422594EA5137383CE944CBEFFA1CE7EDA769289AB48A1ABB68D2E2FFD75AC03D89E5DC3497D127447EAC9BD3B30A48FB2DF7F3155CB9DB801AF4C02DBFD67B07B1C3A109B8F372E14AB8439DC15381BBFD727EAD3D21BAD3A695A96916C63070111041AF243AEA88C736E36A9949425C7E7B2F0CF8F8A317690FE458108FDB88B9E8B94B1B6F85D401D04DAA4B7EBAA5945CBC0832A7C87DA2481B6C9796ECFE855CB03496A58B294A07F846038153D10206DC484F68843B328E883091BD9A32DE92E67A72F5FE499B3A9BF7931FDB02079D85628C6177D66244BD1EA2F217178F830045E0E235CF19B8305C15222FB55BE3D7C0B6DA203CD0CDB7DC419FF11D6CEBA150EC517EFD917F1A75EF33207FB0582F54163C08E5D1BAE47532668AAC257E41C673BB0F177F958C26CC923C78790199B4848A91889CADF247B8EBDC53ECFAF31F855A20674E45B1FFC3BCE4AB747C3CD41FAAEC532D2AD80AE72DFCD71034C473B2D4F1DC916D7D53832181A3834B773877B9790C75460BD7F003D52C31AFB11CFC98069E6DFEF01BC9879304E2DE899D329BB6C27BD2DDDF257DCC8DD2236ED6C944396147BE0DC33835F136555070E7E3FD9938D4771835D71D26038D730C64C9C9547F8DADB033D7927291B48B61EF407950EC5338FA84AA5423FE6F6A8F967312B215B7C60F10CE0D67BF7D1E533588C6BCBAE05BB7A5ED6E4B54AF670055D7D7D39BA9653D3FC74CD3AEE7ACE4CDE7E663B2C8882B7D2F5E5A3B59B0D647E919BC80C2F7F5448E1D4E2408AC0C8C9E5861B000B3456F5524946C8F6272B283DC801BD0F63A70BA3DD601E9711717E01F2E9774EC684B01F030A12A5139D94B99EFBDCE365A23C0CDC197AC640C76F5B51697802DB7A5EC8DAD8D483D8DCED82C6A70EA1752C6246003CC678D6820CD06A8700C335B702ADB0611AD824EF0F57196D53340DD1F3E125AEC6858B273FD6B8F42E23A98EE35783EC494E93798E4ABA04487F7025F91A390DEDEB63E3F565A6588C384E5D8AD11AB821EEAF4CCBEA33151B7EFDB181A0AA6393BE60DC5E6D3FF1DDAF496B0E169AB3052A5079BB8D372AC79186C79EE8E0E8EFFF604FD371072A3082420FA87D52E12D2A18F5672626CD8AC18DF2E84F201A9ABB1D082C865382C842B81964E81C2DA252269A66FAAF398D096B30323DF49CD4FAD57001D36B77C265320F125B56E951A652528BF7250D2100E907F51DF39F50D660C2C4A4D6232945926A0A2A614DD4F52B4FAB1802BDAAFE62C446','%2X')));\r\n  fclose(fh);\r\n  ok=freepass_system();\r\n  if ok\r\n      [nill,name]=system('hostname');\r\n      fprintf('A new freepass was issued at server %s\\n',name);\r\n  else\r\n      fprintf('Sorry, it was not possible to issue a new freepass\\n');\r\n  end\r\n else\r\n  [nill,name]=system('hostname');\r\n  fprintf('An existing freepass was already available at server %s\\n',name);\r\n end\r\nelse\r\n  assert(false);\r\nend\r\n","published":true,"deleted":false,"likes_count":67,"comments_count":22,"created_by":43,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":764,"test_suite_updated_at":"2017-10-29T03:47:26.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-08-04T07:42:38.000Z","updated_at":"2026-03-29T19:47:31.000Z","published_at":"2013-08-05T05:29:02.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:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eSimply return the name of the coolest numerical computation software ever\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\u003eExtra reward\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e (get a\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\u003efreepass\u003c/w:t\u003e\u003c/w:r\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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOnce a month, as an additional reward for solving this problem, you may get a temporary freepass\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\u003eto solve any other Cody problem\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e. To use this freepass follow these steps:\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=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFirst, at the beginning of a new month, solve this problem correctly\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=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThen immediately visit the Cody problem that you wish to solve, click 'Solve this now', and enter within the function body of your solution the line:\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[ freepass.please;]]\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\u003eand Cody\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\u003emay\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e accept that solution as correct.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou will typically need to repeat step (2) above multiple times until Cody\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\u003edoes\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e accept your solution as correct. If you are getting an error message saying\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\u003eUndefined variable \\\"freepass\\\" or class \\\"freepass.please\\\"\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e simply continue repeating step 2 until you pass the problem and get a message saying\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\u003efreepass granted, congratulations!\u003c/w:t\u003e\u003c/w:r\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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eFineprint\u003c/w:t\u003e\u003c/w:r\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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1) For each Cody player, this problem will grant a new freepass per day until one is successfully used to pass a different Cody problem. Once this happens this problem will only grant the same Cody player a new freepass the next Calendar month.\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\u003e2)\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\u003eHow many times do I need to submit a freepass.please solution to a different Cody problem for it to pass?\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Short answer: around 10, but perhaps as many as 30 times (your faith may be tested, but perseverance will be rewarded at the end :)\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\u003eLong answer: at any given time, Cody has many servers running players' solutions (perhaps around 20 servers?). Every time that you solve this problem a\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\u003efreepass\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e is issued only for the particular server where your solution was evaluated. When you run a\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\u003efreepass.please\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e solution, if that solution is run in the same server where a freepass was issued your solution will pass, otherwise you will get an \\\"_undefined variable freepass_\\\" error. So in order for your solution to pass you simply need to keep resubmitting it until you finally hit the same server where your freepass-problem solution was originally evaluated. Also note that, from time to time, Cody will close a server and start a new one. If that happens any freepass stored in that server will be lost (and you will need to try again steps 1 and 2 above next 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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3) Your correct solution will get a score of 100 (this is typically high enough so that we do not troll the score lead with these freepasses)\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\u003e4) Feel free to explore this problem testsuite to see how this works, but please respect some basic courtesy guidelines if you decide to implement your own (e.g. the service does not interfere with the normal Cody operation; it cleans up after itself; don't use it to get a leading score; etc.) Comments and suggestions for improvement are appreciated!\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\u003e5) This\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\u003efreepass\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e service is 'likeware'. Please 'like' this problem if you liked the code or enjoy using your freepasses :)\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:\"free pass\"","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:\"free pass\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"free pass\"","","\"","free pass","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f49e33bcd18\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f49e33bcc78\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f49e33bc3b8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f49e33bcf98\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f49e33bcef8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f49e33bce58\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f49e33bcdb8\u003e":"tag:\"free pass\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f49e33bcdb8\u003e":"tag:\"free pass\""},"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:\"free pass\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"free pass\"","","\"","free pass","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f49e33bcd18\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f49e33bcc78\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f49e33bc3b8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f49e33bcf98\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f49e33bcef8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f49e33bce58\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f49e33bcdb8\u003e":"tag:\"free pass\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f49e33bcdb8\u003e":"tag:\"free pass\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1774,"difficulty_rating":"easy"}]}}