{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-16T00:12:35.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-04-16T00: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":1732,"title":"GJam: 2013 Rd1a Bullseye Painting - Large Numbers","description":"\u003chttp://code.google.com/codejam/contests.html Google Code Jam\u003e 2013 Round 1a Bullseye challenge is to determine how many full rings can be painted given an initial radius and an amount of paint.\r\n\r\nGiven a radius r, central white zone, create black rings of width 1 cm separated by 1 cm given P ml of paint that covers pi sq-cm per ml of paint provided.\r\n\r\nThe test cases are a few from the 6000 in the Large number set. In contest mode the player has 8 minutes to submit a response after downloading the data set.\r\n\r\n\u003c\u003chttp://code.google.com/codejam/contest/images/?image=bullseye.png\u0026p=2464487\u0026c=2418487\u003e\u003e\r\n\r\n*Input:* [r, p]  uint64, 1\u003c=r\u003c=1E18, 1\u003c=P\u003c=2E18. Always enough P for one ring\r\n\r\n\r\n*Output:* Rings\r\n\r\n*Examples:*\r\n\r\n  [1 9] 1; % Normal number examples to understand concept\r\n  [1 10] 2;\r\n  [3 40] 3;\r\n  \r\n  [1 1000000000000000000] 707106780 for Bullseye Large Number Challenge\r\n  [1 2000000000000000000] 999999999\r\n  [760961177192651897 1521922354385303795] 1\r\n\r\n\r\n*Google Code Jam:*\r\n\r\nThe next competition starts in April 2014. See details from above link.\r\n\r\nSolutions to the various past Challenges using Matlab can be found via \u003chttp://www.go-hero.net/jam/13/solutions GJam Solutions\u003e.\r\n\r\nLarge number solutions require more elegant methods to avoid time-outs.\r\n\r\n*Related Challenges:*\r\n\r\n1) \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1731-text-file-read-64-bit-data-set Reading 64 bit input file\u003e\r\n\r\n2) \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1730-gjam-2013-rd1a-bullseye-painting Bullseye Regular Numbers\u003e\r\n\r\n*Usage of regexp is verboten*","description_html":"\u003cp\u003e\u003ca href = \"http://code.google.com/codejam/contests.html\"\u003eGoogle Code Jam\u003c/a\u003e 2013 Round 1a Bullseye challenge is to determine how many full rings can be painted given an initial radius and an amount of paint.\u003c/p\u003e\u003cp\u003eGiven a radius r, central white zone, create black rings of width 1 cm separated by 1 cm given P ml of paint that covers pi sq-cm per ml of paint provided.\u003c/p\u003e\u003cp\u003eThe test cases are a few from the 6000 in the Large number set. In contest mode the player has 8 minutes to submit a response after downloading the data set.\u003c/p\u003e\u003cimg src = \"http://code.google.com/codejam/contest/images/?image=bullseye.png\u0026p=2464487\u0026c=2418487\"\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e [r, p]  uint64, 1\u0026lt;=r\u0026lt;=1E18, 1\u0026lt;=P\u0026lt;=2E18. Always enough P for one ring\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Rings\u003c/p\u003e\u003cp\u003e\u003cb\u003eExamples:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[1 9] 1; % Normal number examples to understand concept\r\n[1 10] 2;\r\n[3 40] 3;\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003e[1 1000000000000000000] 707106780 for Bullseye Large Number Challenge\r\n[1 2000000000000000000] 999999999\r\n[760961177192651897 1521922354385303795] 1\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eGoogle Code Jam:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eThe next competition starts in April 2014. See details from above link.\u003c/p\u003e\u003cp\u003eSolutions to the various past Challenges using Matlab can be found via \u003ca href = \"http://www.go-hero.net/jam/13/solutions\"\u003eGJam Solutions\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eLarge number solutions require more elegant methods to avoid time-outs.\u003c/p\u003e\u003cp\u003e\u003cb\u003eRelated Challenges:\u003c/b\u003e\u003c/p\u003e\u003cp\u003e1) \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1731-text-file-read-64-bit-data-set\"\u003eReading 64 bit input file\u003c/a\u003e\u003c/p\u003e\u003cp\u003e2) \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1730-gjam-2013-rd1a-bullseye-painting\"\u003eBullseye Regular Numbers\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003cb\u003eUsage of regexp is verboten\u003c/b\u003e\u003c/p\u003e","function_template":"function rings=solve_rings(r,pmax)\r\n rings=0;\r\nend","test_suite":"%%\r\ntic\r\nr=uint64(308436464205151562);\r\npmax=uint64(1850618785230909388);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,3),sprintf('rings=%i, Expected 3',rings))\r\n%%\r\nr=uint64(760961177192651897);\r\npmax=uint64(1521922354385303795);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,1),sprintf('rings=%i, Expected 1',rings))\r\n%%\r\nr=uint64(1);\r\npmax=uint64(2000000000000000000);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,999999999),sprintf('rings=%i, Expected 999999999',rings))\r\n%%\r\nr=uint64(1000);\r\npmax=uint64(2000000000000000000);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,999999500),sprintf('rings=%i, Expected 999999500',rings))\r\n%%\r\nr=uint64(3);\r\npmax=uint64(1243678947483597075);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,788567988),sprintf('rings=%i, Expected 788567988',rings))\r\n%%\r\nr=uint64(432);\r\npmax=uint64(1800692162794074077);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,948865465),sprintf('rings=%i, Expected 948865465',rings))\r\ntoc\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":2,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":8,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-07-21T05:00:05.000Z","updated_at":"2013-07-21T06:00:55.000Z","published_at":"2013-07-21T06:00:27.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:hyperlink w:docLocation=\\\"http://code.google.com/codejam/contests.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGoogle Code Jam\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e 2013 Round 1a Bullseye challenge is to determine how many full rings can be painted given an initial radius and an amount of paint.\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\u003eGiven a radius r, central white zone, create black rings of width 1 cm separated by 1 cm given P ml of paint that covers pi sq-cm per ml of paint provided.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe test cases are a few from the 6000 in the Large number set. In contest mode the player has 8 minutes to submit a response after downloading the data set.\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\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\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e [r, p] uint64, 1\u0026lt;=r\u0026lt;=1E18, 1\u0026lt;=P\u0026lt;=2E18. Always enough P for one ring\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\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Rings\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\u003eExamples:\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[[1 9] 1; % Normal number examples to understand concept\\n[1 10] 2;\\n[3 40] 3;\\n\\n[1 1000000000000000000] 707106780 for Bullseye Large Number Challenge\\n[1 2000000000000000000] 999999999\\n[760961177192651897 1521922354385303795] 1]]\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\u003eGoogle Code Jam:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe next competition starts in April 2014. See details from above link.\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\u003eSolutions to the various past Challenges using Matlab can be found via\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.go-hero.net/jam/13/solutions\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGJam Solutions\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eLarge number solutions require more elegant methods to avoid time-outs.\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\u003eRelated Challenges:\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)\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/1731-text-file-read-64-bit-data-set\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eReading 64 bit input file\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2)\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/1730-gjam-2013-rd1a-bullseye-painting\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eBullseye Regular Numbers\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eUsage of regexp is verboten\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":1732,"title":"GJam: 2013 Rd1a Bullseye Painting - Large Numbers","description":"\u003chttp://code.google.com/codejam/contests.html Google Code Jam\u003e 2013 Round 1a Bullseye challenge is to determine how many full rings can be painted given an initial radius and an amount of paint.\r\n\r\nGiven a radius r, central white zone, create black rings of width 1 cm separated by 1 cm given P ml of paint that covers pi sq-cm per ml of paint provided.\r\n\r\nThe test cases are a few from the 6000 in the Large number set. In contest mode the player has 8 minutes to submit a response after downloading the data set.\r\n\r\n\u003c\u003chttp://code.google.com/codejam/contest/images/?image=bullseye.png\u0026p=2464487\u0026c=2418487\u003e\u003e\r\n\r\n*Input:* [r, p]  uint64, 1\u003c=r\u003c=1E18, 1\u003c=P\u003c=2E18. Always enough P for one ring\r\n\r\n\r\n*Output:* Rings\r\n\r\n*Examples:*\r\n\r\n  [1 9] 1; % Normal number examples to understand concept\r\n  [1 10] 2;\r\n  [3 40] 3;\r\n  \r\n  [1 1000000000000000000] 707106780 for Bullseye Large Number Challenge\r\n  [1 2000000000000000000] 999999999\r\n  [760961177192651897 1521922354385303795] 1\r\n\r\n\r\n*Google Code Jam:*\r\n\r\nThe next competition starts in April 2014. See details from above link.\r\n\r\nSolutions to the various past Challenges using Matlab can be found via \u003chttp://www.go-hero.net/jam/13/solutions GJam Solutions\u003e.\r\n\r\nLarge number solutions require more elegant methods to avoid time-outs.\r\n\r\n*Related Challenges:*\r\n\r\n1) \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1731-text-file-read-64-bit-data-set Reading 64 bit input file\u003e\r\n\r\n2) \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1730-gjam-2013-rd1a-bullseye-painting Bullseye Regular Numbers\u003e\r\n\r\n*Usage of regexp is verboten*","description_html":"\u003cp\u003e\u003ca href = \"http://code.google.com/codejam/contests.html\"\u003eGoogle Code Jam\u003c/a\u003e 2013 Round 1a Bullseye challenge is to determine how many full rings can be painted given an initial radius and an amount of paint.\u003c/p\u003e\u003cp\u003eGiven a radius r, central white zone, create black rings of width 1 cm separated by 1 cm given P ml of paint that covers pi sq-cm per ml of paint provided.\u003c/p\u003e\u003cp\u003eThe test cases are a few from the 6000 in the Large number set. In contest mode the player has 8 minutes to submit a response after downloading the data set.\u003c/p\u003e\u003cimg src = \"http://code.google.com/codejam/contest/images/?image=bullseye.png\u0026p=2464487\u0026c=2418487\"\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e [r, p]  uint64, 1\u0026lt;=r\u0026lt;=1E18, 1\u0026lt;=P\u0026lt;=2E18. Always enough P for one ring\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Rings\u003c/p\u003e\u003cp\u003e\u003cb\u003eExamples:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[1 9] 1; % Normal number examples to understand concept\r\n[1 10] 2;\r\n[3 40] 3;\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003e[1 1000000000000000000] 707106780 for Bullseye Large Number Challenge\r\n[1 2000000000000000000] 999999999\r\n[760961177192651897 1521922354385303795] 1\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eGoogle Code Jam:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eThe next competition starts in April 2014. See details from above link.\u003c/p\u003e\u003cp\u003eSolutions to the various past Challenges using Matlab can be found via \u003ca href = \"http://www.go-hero.net/jam/13/solutions\"\u003eGJam Solutions\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eLarge number solutions require more elegant methods to avoid time-outs.\u003c/p\u003e\u003cp\u003e\u003cb\u003eRelated Challenges:\u003c/b\u003e\u003c/p\u003e\u003cp\u003e1) \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1731-text-file-read-64-bit-data-set\"\u003eReading 64 bit input file\u003c/a\u003e\u003c/p\u003e\u003cp\u003e2) \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1730-gjam-2013-rd1a-bullseye-painting\"\u003eBullseye Regular Numbers\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003cb\u003eUsage of regexp is verboten\u003c/b\u003e\u003c/p\u003e","function_template":"function rings=solve_rings(r,pmax)\r\n rings=0;\r\nend","test_suite":"%%\r\ntic\r\nr=uint64(308436464205151562);\r\npmax=uint64(1850618785230909388);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,3),sprintf('rings=%i, Expected 3',rings))\r\n%%\r\nr=uint64(760961177192651897);\r\npmax=uint64(1521922354385303795);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,1),sprintf('rings=%i, Expected 1',rings))\r\n%%\r\nr=uint64(1);\r\npmax=uint64(2000000000000000000);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,999999999),sprintf('rings=%i, Expected 999999999',rings))\r\n%%\r\nr=uint64(1000);\r\npmax=uint64(2000000000000000000);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,999999500),sprintf('rings=%i, Expected 999999500',rings))\r\n%%\r\nr=uint64(3);\r\npmax=uint64(1243678947483597075);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,788567988),sprintf('rings=%i, Expected 788567988',rings))\r\n%%\r\nr=uint64(432);\r\npmax=uint64(1800692162794074077);\r\nrings=solve_rings(r,pmax);\r\nassert(isequal(rings,948865465),sprintf('rings=%i, Expected 948865465',rings))\r\ntoc\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":2,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":8,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-07-21T05:00:05.000Z","updated_at":"2013-07-21T06:00:55.000Z","published_at":"2013-07-21T06:00:27.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:hyperlink w:docLocation=\\\"http://code.google.com/codejam/contests.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGoogle Code Jam\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e 2013 Round 1a Bullseye challenge is to determine how many full rings can be painted given an initial radius and an amount of paint.\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\u003eGiven a radius r, central white zone, create black rings of width 1 cm separated by 1 cm given P ml of paint that covers pi sq-cm per ml of paint provided.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe test cases are a few from the 6000 in the Large number set. In contest mode the player has 8 minutes to submit a response after downloading the data set.\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\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\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e [r, p] uint64, 1\u0026lt;=r\u0026lt;=1E18, 1\u0026lt;=P\u0026lt;=2E18. Always enough P for one ring\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\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Rings\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\u003eExamples:\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[[1 9] 1; % Normal number examples to understand concept\\n[1 10] 2;\\n[3 40] 3;\\n\\n[1 1000000000000000000] 707106780 for Bullseye Large Number Challenge\\n[1 2000000000000000000] 999999999\\n[760961177192651897 1521922354385303795] 1]]\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\u003eGoogle Code Jam:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe next competition starts in April 2014. See details from above link.\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\u003eSolutions to the various past Challenges using Matlab can be found via\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.go-hero.net/jam/13/solutions\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGJam Solutions\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eLarge number solutions require more elegant methods to avoid time-outs.\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\u003eRelated Challenges:\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)\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/1731-text-file-read-64-bit-data-set\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eReading 64 bit input file\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2)\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/1730-gjam-2013-rd1a-bullseye-painting\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eBullseye Regular Numbers\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eUsage of regexp is verboten\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:\"quadratic approximation\"","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:\"quadratic approximation\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"quadratic approximation\"","","\"","quadratic approximation","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f3564b8fb50\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f3564b8fab0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f3564b8f1f0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f3564b8fdd0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f3564b8fd30\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f3564b8fc90\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f3564b8fbf0\u003e":"tag:\"quadratic approximation\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f3564b8fbf0\u003e":"tag:\"quadratic approximation\""},"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":"cody-search","password":"78X075ddcV44","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:\"quadratic approximation\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"quadratic approximation\"","","\"","quadratic approximation","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f3564b8fb50\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f3564b8fab0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f3564b8f1f0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f3564b8fdd0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f3564b8fd30\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f3564b8fc90\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f3564b8fbf0\u003e":"tag:\"quadratic approximation\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f3564b8fbf0\u003e":"tag:\"quadratic approximation\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1732,"difficulty_rating":"medium"}]}}