{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-06T14:01:22.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-06T00: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":1730,"title":"GJam: 2013 Rd1a Bullseye Painting","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\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]  Integer values, 1\u003c=r,P\u003c=1000. 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;\r\n  [1 10] 2;\r\n  [3 40] 3;\r\n  \r\n  [1 1000000000000000000] 707106780 for Bullseye Large Number Challenge\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\nThis contest does not discriminate by age or against the superiority of Matlab, unlike ACM. Forty-seven Matlab contestants in GJam 2013 out of 21,273.\r\n\r\nSolutions to the various past Challenges in Matlab can be found via \u003chttp://www.go-hero.net/jam/13/solutions GJam Solutions\u003e.\r\n\r\nThe Challenges have subsets with Large Number aspects which appear to favor C and Java. Binbin Qi is our last hope with his expertise in Matlab/Java  BigInteger.\r\n\r\n*Related Challenges:*\r\n\r\n  1) Reading 64 bit input file\r\n  2) Bullseye Large Numbers r\u003c1E18, P\u003c2E18\r\n\r\n*Usage of regexp is verboten*\r\n\r\n","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\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]  Integer values, 1\u0026lt;=r,P\u0026lt;=1000. 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;\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\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\u003eThis contest does not discriminate by age or against the superiority of Matlab, unlike ACM. Forty-seven Matlab contestants in GJam 2013 out of 21,273.\u003c/p\u003e\u003cp\u003eSolutions to the various past Challenges in Matlab can be found via \u003ca href = \"http://www.go-hero.net/jam/13/solutions\"\u003eGJam Solutions\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eThe Challenges have subsets with Large Number aspects which appear to favor C and Java. Binbin Qi is our last hope with his expertise in Matlab/Java  BigInteger.\u003c/p\u003e\u003cp\u003e\u003cb\u003eRelated Challenges:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1) Reading 64 bit input file\r\n2) Bullseye Large Numbers r\u0026lt;1E18, P\u0026lt;2E18\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eUsage of regexp is verboten\u003c/b\u003e\u003c/p\u003e","function_template":"function rings=solve_rings(r,p)\r\n rings=0;\r\nend","test_suite":"%%\r\nr=138;p=844;rings=3;\r\nassert(isequal(solve_rings(r,p),rings))\r\n%%\r\nr=21;p=197;rings=4;\r\nassert(isequal(solve_rings(r,p),rings))\r\n%%\r\nr=214;p=862;rings=2;\r\nassert(isequal(solve_rings(r,p),rings))\r\n%%\r\nr=20;p=845;rings=13;\r\nassert(isequal(solve_rings(r,p),rings))\r\n%%\r\nr=20;p=844;rings=12;\r\nassert(isequal(solve_rings(r,p),rings))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":3097,"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":"2013-07-20T20:30:52.000Z","updated_at":"2025-12-31T13:40:54.000Z","published_at":"2013-07-20T21:02:01.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\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] Integer values, 1\u0026lt;=r,P\u0026lt;=1000. 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;\\n[1 10] 2;\\n[3 40] 3;\\n\\n[1 1000000000000000000] 707106780 for Bullseye Large Number Challenge]]\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\u003eThis contest does not discriminate by age or against the superiority of Matlab, unlike ACM. Forty-seven Matlab contestants in GJam 2013 out of 21,273.\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 in 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\u003eThe Challenges have subsets with Large Number aspects which appear to favor C and Java. Binbin Qi is our last hope with his expertise in Matlab/Java BigInteger.\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=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[1) Reading 64 bit input file\\n2) Bullseye Large Numbers r\u003c1E18, P\u003c2E18]]\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\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\"}]}"},{"id":55680,"title":"AZPC Oddly Triangular: Small N  Part 1 of 5","description":"AZPC created the Oddly Triangular contest on 9/7/22. The challenge is to find the longest sequence of N odd digits such that sum(1:value)  is composed of only odd digits. The contest ended on 9/8/22 as Rokicki created a 3.6 million digit solution with the implication that an infinite length pattern had been determined. [N=2, 17, sum(1:17)=153]\r\nThis challenge sequence shall step thru the steps and processing types to find Rokicki's result.\r\nThis challenge is to find all solutions with lengths 1 thru 7.\r\nM=OddlyTri_1(N,Q) where N=digit length, Q=number of solutions, M is a vector of the Q values.\r\n","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 183px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 91.5px; transform-origin: 407px 91.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003ca target='_blank' href = \"/#null\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eAZPC\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 40px 8px; transform-origin: 40px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e created the \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"/#null\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eOddly Triangular\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 270.5px 8px; transform-origin: 270.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e contest on 9/7/22. The challenge is to find the longest sequence of N odd digits such that sum(1:value)  is composed of only odd digits. The contest ended on 9/8/22 as Rokicki created a 3.6 million digit solution with the implication that an infinite length pattern had been determined. [N=2, 17, sum(1:17)=153]\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 298.5px 8px; transform-origin: 298.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis challenge sequence shall step thru the steps and processing types to find Rokicki's result.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 181px 8px; transform-origin: 181px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis challenge is to find all solutions with lengths 1 thru 7.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 298.5px 8px; transform-origin: 298.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eM=OddlyTri_1(N,Q) where N=digit length, Q=number of solutions, M is a vector of the Q values.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 8px; transform-origin: 0px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function M=OddlyTri_1(N,Q)\r\n  M=zeros(Q,1);\r\nend","test_suite":"%%\r\ntic\r\nN = 1;\r\nQ = 2;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 2;\r\nQ = 2;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 3;\r\nQ = 1;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 4;\r\nQ = 4;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 5;\r\nQ = 4;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 6;\r\nQ = 6;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 7;\r\nQ = 3;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":3097,"edited_at":"2022-09-14T03:22:22.000Z","deleted_by":null,"deleted_at":null,"solvers_count":6,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2022-09-13T16:00:45.000Z","updated_at":"2022-09-14T03:22:22.000Z","published_at":"2022-09-14T03:22:22.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:hyperlink w:docLocation=\\\"\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eAZPC\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e created the \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eOddly Triangular\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e contest on 9/7/22. The challenge is to find the longest sequence of N odd digits such that sum(1:value)  is composed of only odd digits. The contest ended on 9/8/22 as Rokicki created a 3.6 million digit solution with the implication that an infinite length pattern had been determined. [N=2, 17, sum(1:17)=153]\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis challenge sequence shall step thru the steps and processing types to find Rokicki's result.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis challenge is to find all solutions with lengths 1 thru 7.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eM=OddlyTri_1(N,Q) where N=digit length, Q=number of solutions, M is a vector of the Q values.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":1730,"title":"GJam: 2013 Rd1a Bullseye Painting","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\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]  Integer values, 1\u003c=r,P\u003c=1000. 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;\r\n  [1 10] 2;\r\n  [3 40] 3;\r\n  \r\n  [1 1000000000000000000] 707106780 for Bullseye Large Number Challenge\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\nThis contest does not discriminate by age or against the superiority of Matlab, unlike ACM. Forty-seven Matlab contestants in GJam 2013 out of 21,273.\r\n\r\nSolutions to the various past Challenges in Matlab can be found via \u003chttp://www.go-hero.net/jam/13/solutions GJam Solutions\u003e.\r\n\r\nThe Challenges have subsets with Large Number aspects which appear to favor C and Java. Binbin Qi is our last hope with his expertise in Matlab/Java  BigInteger.\r\n\r\n*Related Challenges:*\r\n\r\n  1) Reading 64 bit input file\r\n  2) Bullseye Large Numbers r\u003c1E18, P\u003c2E18\r\n\r\n*Usage of regexp is verboten*\r\n\r\n","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\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]  Integer values, 1\u0026lt;=r,P\u0026lt;=1000. 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;\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\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\u003eThis contest does not discriminate by age or against the superiority of Matlab, unlike ACM. Forty-seven Matlab contestants in GJam 2013 out of 21,273.\u003c/p\u003e\u003cp\u003eSolutions to the various past Challenges in Matlab can be found via \u003ca href = \"http://www.go-hero.net/jam/13/solutions\"\u003eGJam Solutions\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eThe Challenges have subsets with Large Number aspects which appear to favor C and Java. Binbin Qi is our last hope with his expertise in Matlab/Java  BigInteger.\u003c/p\u003e\u003cp\u003e\u003cb\u003eRelated Challenges:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1) Reading 64 bit input file\r\n2) Bullseye Large Numbers r\u0026lt;1E18, P\u0026lt;2E18\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eUsage of regexp is verboten\u003c/b\u003e\u003c/p\u003e","function_template":"function rings=solve_rings(r,p)\r\n rings=0;\r\nend","test_suite":"%%\r\nr=138;p=844;rings=3;\r\nassert(isequal(solve_rings(r,p),rings))\r\n%%\r\nr=21;p=197;rings=4;\r\nassert(isequal(solve_rings(r,p),rings))\r\n%%\r\nr=214;p=862;rings=2;\r\nassert(isequal(solve_rings(r,p),rings))\r\n%%\r\nr=20;p=845;rings=13;\r\nassert(isequal(solve_rings(r,p),rings))\r\n%%\r\nr=20;p=844;rings=12;\r\nassert(isequal(solve_rings(r,p),rings))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":3097,"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":"2013-07-20T20:30:52.000Z","updated_at":"2025-12-31T13:40:54.000Z","published_at":"2013-07-20T21:02:01.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\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] Integer values, 1\u0026lt;=r,P\u0026lt;=1000. 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;\\n[1 10] 2;\\n[3 40] 3;\\n\\n[1 1000000000000000000] 707106780 for Bullseye Large Number Challenge]]\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\u003eThis contest does not discriminate by age or against the superiority of Matlab, unlike ACM. Forty-seven Matlab contestants in GJam 2013 out of 21,273.\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 in 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\u003eThe Challenges have subsets with Large Number aspects which appear to favor C and Java. Binbin Qi is our last hope with his expertise in Matlab/Java BigInteger.\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=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[1) Reading 64 bit input file\\n2) Bullseye Large Numbers r\u003c1E18, P\u003c2E18]]\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\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\"}]}"},{"id":55680,"title":"AZPC Oddly Triangular: Small N  Part 1 of 5","description":"AZPC created the Oddly Triangular contest on 9/7/22. The challenge is to find the longest sequence of N odd digits such that sum(1:value)  is composed of only odd digits. The contest ended on 9/8/22 as Rokicki created a 3.6 million digit solution with the implication that an infinite length pattern had been determined. [N=2, 17, sum(1:17)=153]\r\nThis challenge sequence shall step thru the steps and processing types to find Rokicki's result.\r\nThis challenge is to find all solutions with lengths 1 thru 7.\r\nM=OddlyTri_1(N,Q) where N=digit length, Q=number of solutions, M is a vector of the Q values.\r\n","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 183px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 91.5px; transform-origin: 407px 91.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003ca target='_blank' href = \"/#null\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eAZPC\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 40px 8px; transform-origin: 40px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e created the \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"/#null\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eOddly Triangular\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 270.5px 8px; transform-origin: 270.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e contest on 9/7/22. The challenge is to find the longest sequence of N odd digits such that sum(1:value)  is composed of only odd digits. The contest ended on 9/8/22 as Rokicki created a 3.6 million digit solution with the implication that an infinite length pattern had been determined. [N=2, 17, sum(1:17)=153]\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 298.5px 8px; transform-origin: 298.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis challenge sequence shall step thru the steps and processing types to find Rokicki's result.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 181px 8px; transform-origin: 181px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis challenge is to find all solutions with lengths 1 thru 7.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 298.5px 8px; transform-origin: 298.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eM=OddlyTri_1(N,Q) where N=digit length, Q=number of solutions, M is a vector of the Q values.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 8px; transform-origin: 0px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function M=OddlyTri_1(N,Q)\r\n  M=zeros(Q,1);\r\nend","test_suite":"%%\r\ntic\r\nN = 1;\r\nQ = 2;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 2;\r\nQ = 2;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 3;\r\nQ = 1;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 4;\r\nQ = 4;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 5;\r\nQ = 4;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 6;\r\nQ = 6;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc\r\n%%\r\ntic\r\nN = 7;\r\nQ = 3;\r\nvalid = 0;\r\nM=OddlyTri_1(N,Q)\r\nM(M\u003c10^(N-1))=[]; %Verify digit lengths\r\nM(M\u003e=10^N)=[];\r\nM=unique(M);\r\nif length(M)==Q\r\n valid=prod(mod(prod(num2str(M)-'0',2),2));\r\n if valid % Now calc sums\r\n  Msum=M.*(M+1)/2;\r\n  for i=1:length(M)\r\n   valid=valid*prod(mod(prod(num2str(Msum(i))-'0',2),2));\r\n  end\r\n end\r\nend % length(M)==Q\r\nif valid\r\n fprintf('Valid set\\n')\r\n for i=1:length(M)\r\n  fprintf('%i\\n',M(i))\r\n end\r\nelse\r\n fprintf('Not Valid set: Q %i required\\n',Q)\r\n for i=1:length(M)\r\n  fprintf('%i %i\\n',M(i),M(i)*(M(i)+1)/2)\r\n end\r\nend\r\n\r\nassert(isequal(valid,1))\r\ntoc","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":3097,"edited_at":"2022-09-14T03:22:22.000Z","deleted_by":null,"deleted_at":null,"solvers_count":6,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2022-09-13T16:00:45.000Z","updated_at":"2022-09-14T03:22:22.000Z","published_at":"2022-09-14T03:22:22.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:hyperlink w:docLocation=\\\"\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eAZPC\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e created the \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eOddly Triangular\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e contest on 9/7/22. The challenge is to find the longest sequence of N odd digits such that sum(1:value)  is composed of only odd digits. The contest ended on 9/8/22 as Rokicki created a 3.6 million digit solution with the implication that an infinite length pattern had been determined. [N=2, 17, sum(1:17)=153]\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis challenge sequence shall step thru the steps and processing types to find Rokicki's result.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis challenge is to find all solutions with lengths 1 thru 7.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eM=OddlyTri_1(N,Q) where N=digit length, Q=number of solutions, M is a vector of the Q values.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"term":"tag:\"integer math\"","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:\"integer math\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"integer math\"","","\"","integer math","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f3d95d0c080\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f3d95d0bfe0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f3d95d0b720\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f3d95d0c300\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f3d95d0c260\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f3d95d0c1c0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f3d95d0c120\u003e":"tag:\"integer math\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f3d95d0c120\u003e":"tag:\"integer math\""},"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:\"integer math\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"integer math\"","","\"","integer math","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f3d95d0c080\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f3d95d0bfe0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f3d95d0b720\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f3d95d0c300\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f3d95d0c260\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f3d95d0c1c0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f3d95d0c120\u003e":"tag:\"integer math\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f3d95d0c120\u003e":"tag:\"integer math\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1730,"difficulty_rating":"easy-medium"},{"id":55680,"difficulty_rating":"medium"}]}}