{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-26T00:16:20.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-05-26T00: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":42777,"title":"GJam March 2016 IOW: Polynesiaglot Small","description":"This Challenge is derived from \u003chttp://code.google.com/codejam/contest/8274486/dashboard#s=p2 GJam March 2016 Annual I/O for Polynesiaglot\u003e. This is the first very small set.\r\n\r\nThe GJam story goes that words are such that consonants are always followed by a vowel. Determine the number of possible words of length L using C consonants and V vowels.\r\n\r\n*Input:* [C V L] , C=1, V=1, 1\u003c=L\u003c=15\r\n\r\n*Output:* [Q]\r\n\r\n*Examples:* [C V L] [Q]\r\n\r\n  [1 1 4] [5] {aaaa,aaba,abaa,baaa,baba}  invalid are {bbaa, aaab} \r\n  [1 2 2] [6] {aa,ae,ba,be,ee,ea} invalid are {ab,eb,bb}\r\n \r\n\r\n*\u003chttp://code.google.com/codejam Google Code Jam 2016 Open Qualifier: April 8, 2016\u003e*\r\n\r\n*Contest Theory:* The small case is a warm up of only a single vowel and consonant. For L\u003c16 this can readily be solved by brute force generation of valid sequences followed by size of array. Subsequent challenges will be a subset of small-2 with eps(Q) \u003c0.25 and then the unbounded size case of small-2/large. For the unbounded case a solution method uses Matlab java calls. Solution sizes are on the order of (C+V)^L with the large case C=50,V=50,L=500.","description_html":"\u003cp\u003eThis Challenge is derived from \u003ca href = \"http://code.google.com/codejam/contest/8274486/dashboard#s=p2\"\u003eGJam March 2016 Annual I/O for Polynesiaglot\u003c/a\u003e. This is the first very small set.\u003c/p\u003e\u003cp\u003eThe GJam story goes that words are such that consonants are always followed by a vowel. Determine the number of possible words of length L using C consonants and V vowels.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e [C V L] , C=1, V=1, 1\u0026lt;=L\u0026lt;=15\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e [Q]\u003c/p\u003e\u003cp\u003e\u003cb\u003eExamples:\u003c/b\u003e [C V L] [Q]\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[1 1 4] [5] {aaaa,aaba,abaa,baaa,baba}  invalid are {bbaa, aaab} \r\n[1 2 2] [6] {aa,ae,ba,be,ee,ea} invalid are {ab,eb,bb}\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003e\u003ca href = \"http://code.google.com/codejam\"\u003eGoogle Code Jam 2016 Open Qualifier: April 8, 2016\u003c/a\u003e\u003c/b\u003e\u003c/p\u003e\u003cp\u003e\u003cb\u003eContest Theory:\u003c/b\u003e The small case is a warm up of only a single vowel and consonant. For L\u0026lt;16 this can readily be solved by brute force generation of valid sequences followed by size of array. Subsequent challenges will be a subset of small-2 with eps(Q) \u0026lt;0.25 and then the unbounded size case of small-2/large. For the unbounded case a solution method uses Matlab java calls. Solution sizes are on the order of (C+V)^L with the large case C=50,V=50,L=500.\u003c/p\u003e","function_template":"function Q=Polyglot(m);\r\n% Small case C=V=1  L [1:15]\r\n% Determine number of unique words of length L with the constraint:\r\n% All consonants are followed by a vowel\r\n C=m(1);V=m(2);L=m(3);\r\n Q=0;\r\nend","test_suite":"%%\r\ntic\r\nm=[1 1 4 ];\r\nv=Polyglot(m);\r\nvexp=[5 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 7 ];\r\nv=Polyglot(m);\r\nvexp=[21 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 1 ];\r\nv=Polyglot(m);\r\nvexp=[1 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 13 ];\r\nv=Polyglot(m);\r\nvexp=[377 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 5 ];\r\nv=Polyglot(m);\r\nvexp=[8 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 6 ];\r\nv=Polyglot(m);\r\nvexp=[13 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 14 ];\r\nv=Polyglot(m);\r\nvexp=[610 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 2 ];\r\nv=Polyglot(m);\r\nvexp=[2 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 11 ];\r\nv=Polyglot(m);\r\nvexp=[144 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 8 ];\r\nv=Polyglot(m);\r\nvexp=[34 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 3 ];\r\nv=Polyglot(m);\r\nvexp=[3 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 10 ];\r\nv=Polyglot(m);\r\nvexp=[89 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 9 ];\r\nv=Polyglot(m);\r\nvexp=[55 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 12 ];\r\nv=Polyglot(m);\r\nvexp=[233 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 15 ];\r\nv=Polyglot(m);\r\nvexp=[987 ];\r\nassert(isequal(vexp,v))\r\ntoc\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":1,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":16,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2016-03-19T16:06:15.000Z","updated_at":"2026-05-28T14:42:32.000Z","published_at":"2016-03-19T16:17:17.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:t\u003eThis Challenge is derived from\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://code.google.com/codejam/contest/8274486/dashboard#s=p2\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGJam March 2016 Annual I/O for Polynesiaglot\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e. This is the first very small 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\u003eThe GJam story goes that words are such that consonants are always followed by a vowel. Determine the number of possible words of length L using C consonants and V vowels.\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 [C V L] , C=1, V=1, 1\u0026lt;=L\u0026lt;=15\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 [Q]\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\u003cw:r\u003e\u003cw:t\u003e [C V L] [Q]\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 1 4] [5] {aaaa,aaba,abaa,baaa,baba}  invalid are {bbaa, aaab} \\n[1 2 2] [6] {aa,ae,ba,be,ee,ea} invalid are {ab,eb,bb}]]\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\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://code.google.com/codejam\\\"\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eGoogle Code Jam 2016 Open Qualifier: April 8, 2016\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\u003eContest Theory:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e The small case is a warm up of only a single vowel and consonant. For L\u0026lt;16 this can readily be solved by brute force generation of valid sequences followed by size of array. Subsequent challenges will be a subset of small-2 with eps(Q) \u0026lt;0.25 and then the unbounded size case of small-2/large. For the unbounded case a solution method uses Matlab java calls. Solution sizes are on the order of (C+V)^L with the large case C=50,V=50,L=500.\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":{"problems":[{"id":42777,"title":"GJam March 2016 IOW: Polynesiaglot Small","description":"This Challenge is derived from \u003chttp://code.google.com/codejam/contest/8274486/dashboard#s=p2 GJam March 2016 Annual I/O for Polynesiaglot\u003e. This is the first very small set.\r\n\r\nThe GJam story goes that words are such that consonants are always followed by a vowel. Determine the number of possible words of length L using C consonants and V vowels.\r\n\r\n*Input:* [C V L] , C=1, V=1, 1\u003c=L\u003c=15\r\n\r\n*Output:* [Q]\r\n\r\n*Examples:* [C V L] [Q]\r\n\r\n  [1 1 4] [5] {aaaa,aaba,abaa,baaa,baba}  invalid are {bbaa, aaab} \r\n  [1 2 2] [6] {aa,ae,ba,be,ee,ea} invalid are {ab,eb,bb}\r\n \r\n\r\n*\u003chttp://code.google.com/codejam Google Code Jam 2016 Open Qualifier: April 8, 2016\u003e*\r\n\r\n*Contest Theory:* The small case is a warm up of only a single vowel and consonant. For L\u003c16 this can readily be solved by brute force generation of valid sequences followed by size of array. Subsequent challenges will be a subset of small-2 with eps(Q) \u003c0.25 and then the unbounded size case of small-2/large. For the unbounded case a solution method uses Matlab java calls. Solution sizes are on the order of (C+V)^L with the large case C=50,V=50,L=500.","description_html":"\u003cp\u003eThis Challenge is derived from \u003ca href = \"http://code.google.com/codejam/contest/8274486/dashboard#s=p2\"\u003eGJam March 2016 Annual I/O for Polynesiaglot\u003c/a\u003e. This is the first very small set.\u003c/p\u003e\u003cp\u003eThe GJam story goes that words are such that consonants are always followed by a vowel. Determine the number of possible words of length L using C consonants and V vowels.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e [C V L] , C=1, V=1, 1\u0026lt;=L\u0026lt;=15\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e [Q]\u003c/p\u003e\u003cp\u003e\u003cb\u003eExamples:\u003c/b\u003e [C V L] [Q]\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[1 1 4] [5] {aaaa,aaba,abaa,baaa,baba}  invalid are {bbaa, aaab} \r\n[1 2 2] [6] {aa,ae,ba,be,ee,ea} invalid are {ab,eb,bb}\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003e\u003ca href = \"http://code.google.com/codejam\"\u003eGoogle Code Jam 2016 Open Qualifier: April 8, 2016\u003c/a\u003e\u003c/b\u003e\u003c/p\u003e\u003cp\u003e\u003cb\u003eContest Theory:\u003c/b\u003e The small case is a warm up of only a single vowel and consonant. For L\u0026lt;16 this can readily be solved by brute force generation of valid sequences followed by size of array. Subsequent challenges will be a subset of small-2 with eps(Q) \u0026lt;0.25 and then the unbounded size case of small-2/large. For the unbounded case a solution method uses Matlab java calls. Solution sizes are on the order of (C+V)^L with the large case C=50,V=50,L=500.\u003c/p\u003e","function_template":"function Q=Polyglot(m);\r\n% Small case C=V=1  L [1:15]\r\n% Determine number of unique words of length L with the constraint:\r\n% All consonants are followed by a vowel\r\n C=m(1);V=m(2);L=m(3);\r\n Q=0;\r\nend","test_suite":"%%\r\ntic\r\nm=[1 1 4 ];\r\nv=Polyglot(m);\r\nvexp=[5 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 7 ];\r\nv=Polyglot(m);\r\nvexp=[21 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 1 ];\r\nv=Polyglot(m);\r\nvexp=[1 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 13 ];\r\nv=Polyglot(m);\r\nvexp=[377 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 5 ];\r\nv=Polyglot(m);\r\nvexp=[8 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 6 ];\r\nv=Polyglot(m);\r\nvexp=[13 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 14 ];\r\nv=Polyglot(m);\r\nvexp=[610 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 2 ];\r\nv=Polyglot(m);\r\nvexp=[2 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 11 ];\r\nv=Polyglot(m);\r\nvexp=[144 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 8 ];\r\nv=Polyglot(m);\r\nvexp=[34 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 3 ];\r\nv=Polyglot(m);\r\nvexp=[3 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 10 ];\r\nv=Polyglot(m);\r\nvexp=[89 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 9 ];\r\nv=Polyglot(m);\r\nvexp=[55 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 12 ];\r\nv=Polyglot(m);\r\nvexp=[233 ];\r\nassert(isequal(vexp,v))\r\n%%\r\nm=[1 1 15 ];\r\nv=Polyglot(m);\r\nvexp=[987 ];\r\nassert(isequal(vexp,v))\r\ntoc\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":1,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":16,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2016-03-19T16:06:15.000Z","updated_at":"2026-05-28T14:42:32.000Z","published_at":"2016-03-19T16:17:17.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:t\u003eThis Challenge is derived from\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://code.google.com/codejam/contest/8274486/dashboard#s=p2\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGJam March 2016 Annual I/O for Polynesiaglot\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e. This is the first very small 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\u003eThe GJam story goes that words are such that consonants are always followed by a vowel. Determine the number of possible words of length L using C consonants and V vowels.\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 [C V L] , C=1, V=1, 1\u0026lt;=L\u0026lt;=15\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 [Q]\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\u003cw:r\u003e\u003cw:t\u003e [C V L] [Q]\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 1 4] [5] {aaaa,aaba,abaa,baaa,baba}  invalid are {bbaa, aaab} \\n[1 2 2] [6] {aa,ae,ba,be,ee,ea} invalid are {ab,eb,bb}]]\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\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://code.google.com/codejam\\\"\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eGoogle Code Jam 2016 Open Qualifier: April 8, 2016\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\u003eContest Theory:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e The small case is a warm up of only a single vowel and consonant. For L\u0026lt;16 this can readily be solved by brute force generation of valid sequences followed by size of array. Subsequent challenges will be a subset of small-2 with eps(Q) \u0026lt;0.25 and then the unbounded size case of small-2/large. For the unbounded case a solution method uses Matlab java calls. Solution sizes are on the order of (C+V)^L with the large case C=50,V=50,L=500.\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\"}]}"}],"errors":[],"facets":[[],[{"value":"medium","count":1,"selected":false}]],"term":"tag:\"iow\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}