{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2025-12-14T01:33:56.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2025-12-14T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":1506,"title":"Maximum Intra-Vector Swaps","description":"This Challenge, based upon a contest in which Rokicki came in 2nd, is to find sequences containing 1:N that require maximum iterations prior to the value 1 appearing in the first position.\r\n\r\nThe processing rule is that positions 1 thru Vector(1) are swapped. Processing stops when Vector(1) is 1.\r\n\r\n*Example Sequences:* \r\n\r\n  [3 1 2], [2 1 3], [1 2 3] Score 2\r\n  [3 1 4 5 2][4 1 3 5 2][5 3 1 4 2][2 4 1 3 5][4 2 1 3 5][3 1 2 4 5][2 1 3 4 5][1 2 3 4 5]\r\n\r\n\r\n*Input:* n  (Integer from 1 to 31) (16 Actual Cases 2:11 13 17 19 23 29 31) \r\n\r\n*Output:* Vector of values 1:n\r\n\r\nExample:\r\n\r\nInput: 5  Output: [3 1 4 5 2]  \r\n\r\nScore: 7  \r\n\r\nA minimum cumulative score of 531 for the 17 cases is required to Pass.\r\n\r\nFinal Score = 2531 - sum(scores)\r\n\r\n*Hints:*\r\n\r\nUsage of perms for 10 or higher may cause Cody Memory/Time issues. Random subsets are suggested for n\u003e9.\r\n\r\nRequest: If Code is implemented external then please post as a block comment.\r\n\r\nFaster Code Block than fliplr:\r\n\r\n  function count=process_seq(seq)\r\n   count=0;\r\n   while seq(1)\u003e1\r\n    count=count+1;\r\n    seq(1:seq(1))=seq(seq(1):-1:1);\r\n   end\r\n  end","description_html":"\u003cp\u003eThis Challenge, based upon a contest in which Rokicki came in 2nd, is to find sequences containing 1:N that require maximum iterations prior to the value 1 appearing in the first position.\u003c/p\u003e\u003cp\u003eThe processing rule is that positions 1 thru Vector(1) are swapped. Processing stops when Vector(1) is 1.\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample Sequences:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[3 1 2], [2 1 3], [1 2 3] Score 2\r\n[3 1 4 5 2][4 1 3 5 2][5 3 1 4 2][2 4 1 3 5][4 2 1 3 5][3 1 2 4 5][2 1 3 4 5][1 2 3 4 5]\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e n  (Integer from 1 to 31) (16 Actual Cases 2:11 13 17 19 23 29 31)\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Vector of values 1:n\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cp\u003eInput: 5  Output: [3 1 4 5 2]\u003c/p\u003e\u003cp\u003eScore: 7\u003c/p\u003e\u003cp\u003eA minimum cumulative score of 531 for the 17 cases is required to Pass.\u003c/p\u003e\u003cp\u003eFinal Score = 2531 - sum(scores)\u003c/p\u003e\u003cp\u003e\u003cb\u003eHints:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eUsage of perms for 10 or higher may cause Cody Memory/Time issues. Random subsets are suggested for n\u003e9.\u003c/p\u003e\u003cp\u003eRequest: If Code is implemented external then please post as a block comment.\u003c/p\u003e\u003cp\u003eFaster Code Block than fliplr:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003efunction count=process_seq(seq)\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nend\r\n\u003c/pre\u003e","function_template":"function max_seq=find_max_swap_seq(n)\r\n max_seq=1:n;\r\n count=process_seq(max_seq);\r\nend\r\n\r\n% Suggested function for sequence performance evaluation\r\nfunction count=process_seq(seq)\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nend","test_suite":"tic\r\nfeval(@assignin,'caller','score',2000);\r\n%%\r\n% 2 1\r\nglobal cseq\r\ncseq{1}=1; % Gift answer\r\nmax_seq=find_max_swap_seq(2);\r\nassert(isequal(1:2,unique(max_seq)))\r\ncseq{2}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 3 2\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(3);\r\nassert(isequal(1:3,unique(max_seq)))\r\ncseq{3}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 4 4\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(4);\r\nassert(isequal(1:4,unique(max_seq)))\r\ncseq{4}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 5 7\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(5);\r\nassert(isequal(1:5,unique(max_seq)))\r\ncseq{5}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 6 10\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(6);\r\nassert(isequal(1:6,unique(max_seq)))\r\ncseq{6}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 7 16\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(7);\r\nassert(isequal(1:7,unique(max_seq)))\r\ncseq{7}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 8 22\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(8);\r\nassert(isequal(1:8,unique(max_seq)))\r\ncseq{8}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 9 30\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(9);\r\nassert(isequal(1:9,unique(max_seq)))\r\ncseq{9}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%10 38\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(10);\r\nassert(isequal(1:10,unique(max_seq)))\r\ncseq{10}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%11 51\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(11);\r\nassert(isequal(1:11,unique(max_seq)))\r\ncseq{11}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%13 80 case 12\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(13);\r\nassert(isequal(1:13,unique(max_seq)))\r\ncseq{12}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%17 159 case 13\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(17);\r\nassert(isequal(1:17,unique(max_seq)))\r\ncseq{13}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%19 221 case 14\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(19);\r\nassert(isequal(1:19,unique(max_seq)))\r\ncseq{14}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%23 382 case 15\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(23);\r\nassert(isequal(1:23,unique(max_seq)))\r\ncseq{15}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%29 689 case 16\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(29);\r\nassert(isequal(1:29,unique(max_seq)))\r\ncseq{16}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%31 819 case 17\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(31);\r\nassert(isequal(1:31,unique(max_seq)))\r\ncseq{17}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\ntoc\r\n%%\r\nglobal cseq\r\ntotal=0;\r\nfor i=2:17\r\n seq=cseq{i};\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\n total=total+count;\r\nend\r\n\r\n% 2531 is optimal sum\r\ntotal=sum([0 1 2 4 7 10 16 22 30 38 51 80 159 221 382 689 819])-total;\r\nassert(total\u003c2001); % Minimum performance requirement\r\n\r\ntoc\r\nfeval(@assignin,'caller','score',min(2000,total));\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":1,"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-05-13T01:28:12.000Z","updated_at":"2026-04-01T14:34:03.000Z","published_at":"2013-05-13T04:01:26.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, based upon a contest in which Rokicki came in 2nd, is to find sequences containing 1:N that require maximum iterations prior to the value 1 appearing in the first position.\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 processing rule is that positions 1 thru Vector(1) are swapped. Processing stops when Vector(1) is 1.\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\u003eExample Sequences:\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[[3 1 2], [2 1 3], [1 2 3] Score 2\\n[3 1 4 5 2][4 1 3 5 2][5 3 1 4 2][2 4 1 3 5][4 2 1 3 5][3 1 2 4 5][2 1 3 4 5][1 2 3 4 5]]]\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 n (Integer from 1 to 31) (16 Actual Cases 2:11 13 17 19 23 29 31)\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 Vector of values 1:n\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eInput: 5 Output: [3 1 4 5 2]\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\u003eScore: 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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA minimum cumulative score of 531 for the 17 cases is required to Pass.\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\u003eFinal Score = 2531 - sum(scores)\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\u003eHints:\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\u003eUsage of perms for 10 or higher may cause Cody Memory/Time issues. Random subsets are suggested for n\u0026gt;9.\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\u003eRequest: If Code is implemented external then please post as a block comment.\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\u003eFaster Code Block than fliplr:\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[function count=process_seq(seq)\\n count=0;\\n while seq(1)\u003e1\\n  count=count+1;\\n  seq(1:seq(1))=seq(seq(1):-1:1);\\n end\\nend]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":1646,"title":"Kurchan 3x3 - Optimal Score","description":"Find an optimal 3x3 Kurchan square, score of 198. \r\n\r\nA 3x3 Kurchan square has values 1:9.The products of each row, column, diagonal, and anti-diagonal are used\r\n\r\nThe Kurchan-value is the Max minus the Minimum of these products.\r\n\r\n*Example: m=[5 1 8;3 9 4;7 2 6]*\r\n\r\nRow Products: 40,108, and 84. Column products 105, 18, and 192.\r\n\r\nDiagonal Products: 270, 1*4*7=28, and 8*3*2=48.\r\n\r\nAnti-Diagonal Products: 8*9*7=504, 1*3*6=18, and 5*4*2=40.\r\n\r\nK is thus 504-18 = 486. [ Max of all products - Min of all products ]\r\n\r\n*Input:* None\r\n\r\n*Output:* Kurchan Square [3x3] that scores 198\r\n\r\nI expect someone to give a min size hardcoded solution at some point.\r\n\r\nRelated Challenges:\r\n\r\n1) \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1634-kurchan-square-evaluation-function Kurchan Square Evaluation\u003e\r\n\r\n2) Minimize Kurchan Squares (N=4:9)\r\n\r\n3) Minimize Kurchan Squares (N=10:20) [Very large numbers]\r\n\r\n4) Maximize Sum of Products (N=4:9) and a Large number Challenge\r\n\r\n5) Minimize Sum of Products (N=4:9) and a Large number Challenge","description_html":"\u003cp\u003eFind an optimal 3x3 Kurchan square, score of 198.\u003c/p\u003e\u003cp\u003eA 3x3 Kurchan square has values 1:9.The products of each row, column, diagonal, and anti-diagonal are used\u003c/p\u003e\u003cp\u003eThe Kurchan-value is the Max minus the Minimum of these products.\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample: m=[5 1 8;3 9 4;7 2 6]\u003c/b\u003e\u003c/p\u003e\u003cp\u003eRow Products: 40,108, and 84. Column products 105, 18, and 192.\u003c/p\u003e\u003cp\u003eDiagonal Products: 270, 1*4*7=28, and 8*3*2=48.\u003c/p\u003e\u003cp\u003eAnti-Diagonal Products: 8*9*7=504, 1*3*6=18, and 5*4*2=40.\u003c/p\u003e\u003cp\u003eK is thus 504-18 = 486. [ Max of all products - Min of all products ]\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e None\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Kurchan Square [3x3] that scores 198\u003c/p\u003e\u003cp\u003eI expect someone to give a min size hardcoded solution at some point.\u003c/p\u003e\u003cp\u003eRelated Challenges:\u003c/p\u003e\u003cp\u003e1) \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1634-kurchan-square-evaluation-function\"\u003eKurchan Square Evaluation\u003c/a\u003e\u003c/p\u003e\u003cp\u003e2) Minimize Kurchan Squares (N=4:9)\u003c/p\u003e\u003cp\u003e3) Minimize Kurchan Squares (N=10:20) [Very large numbers]\u003c/p\u003e\u003cp\u003e4) Maximize Sum of Products (N=4:9) and a Large number Challenge\u003c/p\u003e\u003cp\u003e5) Minimize Sum of Products (N=4:9) and a Large number Challenge\u003c/p\u003e","function_template":"function m = kurchan_3x3\r\n  m=zeros(3);\r\nend","test_suite":"%%\r\ntic\r\nm = kurchan_3x3\r\ntoc\r\n p=[1     4     7\r\n     2     5     8\r\n     3     6     9\r\n     1     2     3\r\n     4     5     6\r\n     7     8     9\r\n     1     5     9\r\n     4     8     3\r\n     7     2     6\r\n     7     5     3\r\n     8     6     1\r\n     9     4     2];\r\nassert(isequal((1:9)',unique(m(:)))) % check use 1 thru 9\r\nmp=prod(m(p),2);\r\nK=max(mp)-min(mp) % display K score\r\n\r\n% simplified Kurchan scoring for 3x3\r\n\r\nassert(K\u003c=198)  % Pretty certain 198 is best possible, allow better score\r\n\r\n\r\n\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":30,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-06-13T04:20:37.000Z","updated_at":"2025-11-27T17:20:36.000Z","published_at":"2013-06-13T05:10:56.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\u003eFind an optimal 3x3 Kurchan square, score of 198.\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\u003eA 3x3 Kurchan square has values 1:9.The products of each row, column, diagonal, and anti-diagonal are used\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 Kurchan-value is the Max minus the Minimum of these products.\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\u003eExample: m=[5 1 8;3 9 4;7 2 6]\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\u003eRow Products: 40,108, and 84. Column products 105, 18, and 192.\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\u003eDiagonal Products: 270, 1*4*7=28, and 8*3*2=48.\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\u003eAnti-Diagonal Products: 8*9*7=504, 1*3*6=18, and 5*4*2=40.\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\u003eK is thus 504-18 = 486. [ Max of all products - Min of all products ]\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 None\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 Kurchan Square [3x3] that scores 198\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\u003eI expect someone to give a min size hardcoded solution at some point.\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\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/1634-kurchan-square-evaluation-function\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eKurchan Square Evaluation\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) Minimize Kurchan Squares (N=4:9)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3) Minimize Kurchan Squares (N=10:20) [Very large numbers]\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4) Maximize Sum of Products (N=4:9) and a Large number Challenge\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e5) Minimize Sum of Products (N=4:9) and a Large number Challenge\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":42782,"title":"GJam March 2016 IOW: Passwords and the Block Set","description":"This Challenge is derived from \u003chttp://code.google.com/codejam/contest/8274486/dashboard#s=p3 GJam March 2016 Annual I/O for Password Security\u003e. This is the small-2 case of up to 50 passwords of length 1 to 26\r\n\r\nThe GJam story goes that a random block set A:Z exists to the child of a paranoid corporate president. He is worried that his password(s) may exist in the block pattern. Produce a 26 character block sequence that does not contain his password. If no sequence can be made that does not contain his strong password output 'IMPOSSIBLE'. \r\n\r\n*Input:* [PW], string up to 50 space separated passwords of 1 to 26 characters\r\n\r\n*Output:* [Pstr], string containing A:Z with no instance of PW or 'IMPOSSIBLE'\r\n\r\n*Examples:* [PW] [Pstr]\r\n\r\n  [X] [IMPOSSIBLE] \r\n  [QQ][ABCDEFGHIJKLMNOPQRSTUVWXYZ]\r\n  ['XYZ GCJ OMG LMAO JK'][ABCDEFGHIKLMNOPQRSTUVWXYJZ] \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*Theory:* Remove Impossible cases first. Produce a PW string with a robust start/end pairs and a random middle. Try multiple formats with a timer. The most common letter can be placed at both the start and end with random internal letters. OR you can just guess for awhile and then give up. The key here is an efficient invalid string check. The IOW Champion Stacy992's java solution is in the test suite for misguidance versus the Matlab 5 line solution.\r\n","description_html":"\u003cp\u003eThis Challenge is derived from \u003ca href = \"http://code.google.com/codejam/contest/8274486/dashboard#s=p3\"\u003eGJam March 2016 Annual I/O for Password Security\u003c/a\u003e. This is the small-2 case of up to 50 passwords of length 1 to 26\u003c/p\u003e\u003cp\u003eThe GJam story goes that a random block set A:Z exists to the child of a paranoid corporate president. He is worried that his password(s) may exist in the block pattern. Produce a 26 character block sequence that does not contain his password. If no sequence can be made that does not contain his strong password output 'IMPOSSIBLE'.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e [PW], string up to 50 space separated passwords of 1 to 26 characters\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e [Pstr], string containing A:Z with no instance of PW or 'IMPOSSIBLE'\u003c/p\u003e\u003cp\u003e\u003cb\u003eExamples:\u003c/b\u003e [PW] [Pstr]\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[X] [IMPOSSIBLE] \r\n[QQ][ABCDEFGHIJKLMNOPQRSTUVWXYZ]\r\n['XYZ GCJ OMG LMAO JK'][ABCDEFGHIKLMNOPQRSTUVWXYJZ] \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\u003eTheory:\u003c/b\u003e Remove Impossible cases first. Produce a PW string with a robust start/end pairs and a random middle. Try multiple formats with a timer. The most common letter can be placed at both the start and end with random internal letters. OR you can just guess for awhile and then give up. The key here is an efficient invalid string check. The IOW Champion Stacy992's java solution is in the test suite for misguidance versus the Matlab 5 line solution.\u003c/p\u003e","function_template":"function Pstr=Password(c)\r\n% c is a string of space separated passwords\r\n% Suggested sequence\r\n\r\n Pstr='IMPOSSIBLE';\r\n [Impossible]=check_Impossible1(c); % Single character check\r\n if Impossible,return;end\r\n \r\n c=clean(c); % remove passwords with duplicate letters\r\n if isempty(c) % A:Z is okay\r\n  Pstr=char(65:90); %Valid answer A:Z\r\n  return\r\n end\r\n \r\n [Impossible]=check_Impossible(c);\r\n if Impossible\r\n  Pstr='IMPOSSIBLE';\r\n  return;\r\n end\r\n \r\n% Create Valid string\r\n Pstr=make_Pstr(c);\r\nend","test_suite":"%%\r\nglobal zstart;\r\nzstart=now;\r\n%%\r\n%%\r\nm='ABCDEFGHIJKLMNOPQRSTUVWXYZ';\r\nvexp='AIMZGLDTUWKSQBVYXHRCNOEFJP';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='X';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QQ';\r\nvexp='ABCDEFGHIJKLMNOPQRSTUVWXYZ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='XYZ GCJ OMG LMAO JK';\r\nvexp='AYTKXMBFSCZWRQODUNPJEVLIHG';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AB YZ NM';\r\nvexp='AILEPCWDFKTZYJRVMUXGQOSBNH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='C PYTHON GO PERL RUBY JS';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='SUBDERMATOGLYPHIC UNCOPYRIGHTABLES';\r\nvexp='AENYGJXRTWOKCZDPLMBISHVFUQ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='EY OV OU OF OC OQ OP ED OEI EK OT OH EG ET OR EU ER EM OB OW ON OD EL OX EN EC OG EW OJ OI OM OY EP OS ES EI EV EJ OK EZ EX EQ OL EB EF EO EH EA OA OZ';\r\nvexp='GJUKHQMVZDPTFIXWLSCRYBANOE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='CO CH CT LC MC VC CR AC CU CG CJ UC BC IC CM CQ CK CV NC OC TC CZ CL CN FC QC JC CB CW CE CI CX HC WC ZC DC CY CP KC CF GC EC RC YC XC CD PC SC CS CA';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ZT XM XD ZE XZ ZI XO ZH ZB XE XY XJ ZQ ZX XI ZY ZW XH XA XK ZS XV ZM ZL ZD ZJ ZA ZF XC XN ZV ZG ZU ZN XP ZK ZC XL XT ZP XU XF XQ XW XG XB XS ZO XR ZR';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MB FR PC TJ BV XF OE LY MF VS AP DR PD HN FI XQ MG EN VC RL KP KR OV XD ME TC KQ QW RA RP HF VH VT XL ZI LZ HG OI YN CT JC RN YZ LA EO QB ZY QI AQ TU';\r\nvexp='AZOYBSTHEDWPMLCGUFNQVKJXIR';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='CR CD CJ MC CO CV IC CW TCZ CK BC EC RC CG FC NC HC KC CL OC JC CH CQ AC GC CF ZC CE PC UC CX CB CZ CN LC CP CU WC QC CI YC CT CS DC SC CA XC CY VC CM';\r\nvexp='SLZQOFHUINXWKEYDMJPGVBARTC';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='YJ OU DJ GJ OM IJ VJ PJ QJ UJ OS OC OQ LJ RJ AJ TJ OR OA OE OX OD FJ NJ OT SJ ZJ OV WJ OJ OG ON OI OY OW BJ KJ EJ CJ HJ OH OL OB OP OF XJ OZ MJ OK';\r\nvexp='JVSYWIBTLUMNDAEHFGZPCRQKXO';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='XQ EV IV IS HL GB TZ HR RN HY IG PL OA BK OI YC NC VM NF VB UT IE QR RE TD AZ YT CZ NA KJ AJ DJ MJ LM LK FO JX QL MV ZO TU OL NB AU NV ZJ ZB KC WT JP';\r\nvexp='ADTPRBMOFXHWYGCEQNSZKVLUIJ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='IV DLB IU DM DT DH ID IE IT IP DP IK IG IY IX IA IS DX IO IW IR DW IF DB IN DZ IB IH IM DF DA IL IJ DS DJ DK IZ DU IC DN DV DE IQ DQ DC DY DG DO DI DR';\r\nvexp='DLEVWYSCGXFUZOMAQBRNKTHPJI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QZ FP VB AW TL LJ AZ JI ZX SR XF RE QD KG KI MD HY DF HQ DP RA AX DL XR OT MX ZY AG BQ YP KP LS JY IO BF QI EX BZ VG PA TD ZR EC VN VM NJ RW HM EB XU';\r\nvexp='OLNUZCSTHEVRDAJPKMBWGYIQFX';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='LVPF LVR LVD LZ LF LB LVS LD LO LVK LI LP LVH LVQ LJ LVU LVX LQ LVG LM LVM LVC LG LVA LVN LVO LVW LVE LVZ LVI LK LE LVT LY LS LT LN LC LVB LX LW LH OLVP LA LVF LVJ LR LU LVPS LVY';\r\nvexp='ATYCWPFNQGHKXDBISRMJOZUVEL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AZ GZ OD JZ SD BZ QZ BD FD NZ LZ VD RZ JD HZ TZ XD ID ED AD GD TD KD OZU WD CZ KZ HD YD VZ MZ UD FZ SZ YZ WZ XZ QD MD ZD LD RD PD PZ EZ CD DZ UZ IZ ND';\r\nvexp='DKNVYCBFATUWGMRJILXPEHOZQS';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GR AO KF CG ML IY FY EK OJ XW XU ME SP LX PR MD SQ IE KL EQ AK PC SV SK TM NH AS IK OM FQ JD QX WQ CI UH GF XN LP MS LU EG IL GK ZD IQ TR JX OR ND DU';\r\nvexp='DCNYTGXBSLMIHQRJZWFPOAVEUK';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='IU IY RF XN LC MR OG ZM OH MT NO TA KR VO DH GC LN VF TO PB WV KV XE FE NC UQ SJ NL CI FL KP QY WN LI LY YH YE KE YX PJ YJ OA YO XV XF AL GK NJ DP DW';\r\nvexp='JKQSNRGAEVBFXMUCHOLPZTDIWY';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='LK PO SO LP LQOP LD IO AO LA LF FO LB LZ VO WO GO LM LO LV LT LJ DO MO LG KO JO TO ZO XO YO BO LY LN LU LQOW XLQO LC RO HO NO EO LW LS LI LE LR LH LX CO UO';\r\nvexp='OTWBHRIUMKPGXVFYDQNJSCEAZL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='RF RD IF PD SD BD AD EF FD YF MF ZF XF JD ZD CF XD TF QD CD WD LD TD VF BF HF JF ID YD AF OD PF HD NF UF GD OF QF UD DF VD KD LF ED MD SF ND WF KF GF';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='EO OV OM OT FON OF OD BO QO SO XO HO ZO LO OG AO KO ON DO VO WO MO CO OQ JO OL OZ OA NO OR OJ OK OY OI OB GO OE OC RO IO UO OW OH OX YO PO OS OP OU TO';\r\nvexp='QSTZKANWYGERCLPDXIUHJMBVFO';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GJ RN LF GK TN WB KO FC HZ JZ ST VF GT BS TP WZ OE XI MK DO MG DW EN IY ZF WD JO YS ZN HG LR KS IQ OZ KT PG XE ID GP GS RJ HJ WP PL PA FO UT NH ZQ LD';\r\nvexp='SVAHTECFDRIKUQJPBZLNMWYOXG';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='JA JY SH SN SF SB SC SE JH JP SW JS JO SG JQ SD SX SQ JW JL SL SY SP JX JE SR JI JF JV SV JM SJ SO JU JN JT SI SZ JZ SA SK SM SU JD JG ST JR JK JC JB';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HN RN WN QA TB YD LZ GB GC OC BR SV RD VY UI IX RB ON IG WQ ZO RO UF DF PZ LH HD RI MJ AG BZ LM NC KS MZ WU RM IM VT YW WA PI CI DX AV QP AP YU FP XT';\r\nvexp='AJMUPTDSXBHGQZLYREOWVCNKFI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='EU RC YT VD XW IJ XN NS QW SH YR KJ DE HD PV CW HG NF RB CI AP QY IY OD EV ZU FV GW CY QF IZ CB XM ML QG QI WG MQ TI MN IG CA HM BW XK FS XF LI NX GZ';\r\nvexp='PXYBGKHREZCVAWJMSFDTQUNLOI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MR MI HQ ZI XP OX MG KL XZ QL MB VN HO YL VI ZX HP AX CD DE WG DV EP JO CL HD KE GM NE UK PF KW ZM RE LG FY DZ OU LH EV FP DQ JL PR CT PK NH UQ HZ QW';\r\nvexp='AKRNIQBUFVYDSMJZPTWXLCOEGH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WA FT EY VK RI MD NS WZ QW PL DO SL LV WM OP HN OH JD KE OV NE TI PM RJ JL KY EA BQ XS AD VB FS XV QF GT HM MY JY FX IA XK RX GS NU KV RW BY CA GM ZO';\r\nvexp='OBXNTURDGPZCWIJHFKSYVQELAM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='IP SP BP PL PS OP YP PI NP PU PGM PT PO AP EP TP CP PH RP PY HP PZ PB DP QP KP JP UP VP PR FP PQ PX PM MP PN GP WP PD PV PW XP PJ PC PF PE PA PK LP ZP';\r\nvexp='PGXNTOZKYRHADSBLQEJFWUCVMI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MC WC LC HF AF WF YC QC TC EC SC ZF IF RC ZC AC IC GC EF OF UC KC DC PF RF XF UF FC TF YF PC JF GF BC NF HC JC LF BF VF MF NC OC SF KF QF CF VC DF XC';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='PF DF VL HY XK XQ BZ HT WM AQ LB HC LF AL JR ZB XA SQ OA EX OF JX QP MX QI OJ EN JP HS QS TV FV HU JK NJ VW PJ ZT AR YK UT ZE JF BP IM XF ZC LS EC VU';\r\nvexp='FXYZMSBVEPDRIUQHATGCNWOLKJ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='LT DL LN LA LP KL OL WL LF QL GL LG TL LR NL RL LQ IL ML PL LJ CL LS LD EL JL LC LH LM YL LW LI VL UL ZL LX FL BL LV HL AL LO LY LU LZ LE LK KSL LB XL';\r\nvexp='AKINEMBQJVPUYCDHRFGZXOTWSL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WI KW PW WX VW WQ WN WE WC HW WG DW WD WM SW WA WO MW WY WU OW WV LW RW BW NW YW WR AW WS UW JW FW WT XW WZ ZW WF QW WK WH GW IW WJ WP WL CW EW WB TW';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='BD BT BJ BUI MBUN BUQ BF BN BUS BUP BUA BW BUF BL BK BC BR BUJ FBUN BUY BP BI BH BUE BG BY BUD BO BQ BUW BM BUH YBUN BUZ BUM BUV BX BE BUR BUL BUO BUX BS BUG BUT BZ BA BV BUC BUK';\r\nvexp='ADPQETZGKJCNHOIMRSLYFWXUVB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ZT UT HT ZZ BW LT ZW QT HW VW RT SW KT OW KW QW XW DW TW GW MW FT CT EW WT YW PT NW GT IT ST IW UW DT AW BT JW JT RW ET LW OT PW CW NT VT FW MT YT XT';\r\nvexp='WEZLGIVUJCDXBSOPNYQRFMKATH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WG YM WO TJ JO TN UV OD FI RS FO MN MR YS RH ZB LF ZA SE QP OH KR KF RI ZV MF ON BN QH ME MU UE ZT GC VU ZS UP SR FU NX QX NR YL VW QF OE ZD FB GB UA';\r\nvexp='EBXPWUHKNSCLYRDAOVMJZQIGTF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AN ET HT KT DT CT FT ON GT FN JT ZT VT TN JN YN ZN XT DN UT PT YT MT WT GN KN LN XN PN UN EN ST MN RT AT QT LT RN HN QN SN IN NT BT WN IT OT CN BN VN';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='NF KU YF SF TU BF PU YU NU OF FU GF MF AU XF OU KF WU LF PF IF XU AF HF CF VU DU HU BU TF ZU WF JF UF RF ZF LU EF VF IU GU JU CU RU QU MU DF QF SU EU';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HO BA ZA SD SF ZW RE VN MO QK FI PD NC UQ PH OP HR LZ HY HZ CG YU AN MC EW QE JO UX RL ZF YK XA AV RH IA NX NG BI SG HS QG BW GJ CY QH NV FR HI PJ SH';\r\nvexp='AMITGVDKRNYFOSPECQZBJULXWH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QL QB QE QG QD QI XG XU XZ XL QF XS QY QH XA QU XT QO XK QC QR QS QT XW XH QN XY XI QM XP XB QK XV QV XF XN XM QW XO XR QX XE XQ XJ XD QJ QA QZ QP XC';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ZIWCDOJXEVLBAPMRFHT JVHQGFXCWOKUYENPDRI UIMWSROLGHNAXTJBZYVPKCDQ LOJVG YNCRGWALHVJU IQRWJH TCVIYN MNLZTGHBO VOZFGPSXKTIQNWHBEARL DEW SUIXVZMWQNGFJPEHACRYOBTL DNLHKEVABRY DWPIUEXLVQJBYGM MJCUFONTGQH XW CGVLRZXPNWKQHDBY AEXTQCD DG HWKUGSCVYJMPINXATBLOF TAVJQMXBCUWN RFBGWNSLJCUQVAKEXOIT TNAQDKJEBPCMVSWGOZXYIR RLKFO BTXKLCNOV AO LGOQXCYMP HQIXLAOB KQSP GJBSYULWTARIKFCQO DSKEHGAMWPCVZFLQTYB XU WRJ EJCOQBFPNYXIKGZS IHRTYQCVSWOLEFDK WGDBECOQMZYPU VFRMWYAJQLOX AEFNOJHKGWTXRLZIBSDM GBAI MALFKYCXHZGQVWTOEDBPSIRN POJIHBYL QCAWXZBHRTYMD UEDNYVMHQ VKBTLDH XLZYBCNFORDMASHWGE RLZDOVPUJKWMNEFSCQYIH OLCBKWQGNDZE ZACRGBYMSINWQ ZBTC AXLEBTJSCWGUFHMZQVPDKINOR SPEQFHYXRGLTC';\r\nvexp='WRYCGUVXQISNDPHAJOTMFEZLKB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QM YQ NY HI QC AQ MW LN PK WL XK TW HG DB AR RY DN ZG XO MH QZ GR DA RF KR IF ZL YN HP HL KU PT IC YB OA RJ QI PW ZF RI WS PB NZ HA MA DY WD GO GQ HW';\r\nvexp='NXLDVJKBSITYCGMFOREWPZQUAH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='VD UG JW EB UT EX ES BX GK WF VN OG US EP YU AH XJ WL SZ PZ DA IY WV PX IN VO UW RU ED KL XM DM CD LG CS KX IB AQ SH DK BA ME EO CW GC WT XT AU RL EV';\r\nvexp='PLKVYZNJHIMSTCBUAORGQFDWXE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HF XP XN HQ XH HI XS HL HT XZ HX XB HV XV HM XY XR XF HD HG HC HA XG XL XW HZ HR XI XM XE HW HB XU HY HS HU XO HK HJ HO XC XT XQ XK HE XJ HP XD HN XA';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='DJT WNR FWG QV TH GY UP WH LP YWP VY QMF QIK VR YS JP MAW BY TCN PZ NFL AG VLO YZV NJ YD UG QEK AQ DB ESY WC GF XY JVR RY ZY IYV DPH QY JSZ XEW SMK FRX GRQ NH WG PZX UZ NCM';\r\nvexp='AKSTVBFGDIWREQXNPCMZUOLJHY';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QB AU TR AJ SI BH FU KB VS FK UL QM TM GE WC OD WX RB XC JA DJ PQ FC YV WV QL CM FI CA TE UI CS GX MX WJ JC CE BU UJ OU NE XK CB LE NH QY TF TX XA UF';\r\nvexp='FVAZHLPRYUEXJMBIGQWTKDSONC';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='UYQWAJ IJEXGT RADYMIBEJFGKN OXNZH BKZ RDOJETUQKWYVHBZX AOGQLNZCEYKMJSFPURDHIT HXPRJDLNEIGVFZWQTASU EN VXKYGTOABRZDFIWLQ PJSGYZFHDILB MYHNVAESQTXUKG YLFVAWIBGREOCXSPTZUNMD UARXV ARLIFUMCXVKNOHBSPDEZTJ FMSOPJ VFXKHOGEPZYUDA DLXKUSQVBGOIZRYTEFNACWMHP QOCEJRWTIAKMFYNGPV DOSXEPFRQJZBLMGV AVF YLRVZUIHCBFKWDJGXNTOMQ RPSDQFNMKXGOYJACELV ALSOH HRTOPQAWDLBEIKFNCUZJM UWXTQCSKBZNOEYFAGLPMD VTS XB SDLUG WPFLYGACUQIXNJBMSDROEHVTZ GDQTFVSUNRPLHAJMEY XCNTI LJAXKWH WFQNXZOMJIK XAJDTRBYMVZENIKOLGCQHFW NHZMXEIVFDCSAQK BFEMAGNULJW WJRZEQHONX KOTWNQMLBHRVFSZAPYD RELGPAOJKBZTQDUSXMVFIC ZWHQKICMYJTRUBOFEGNADLSVPX ONSGXIYMHWLVR RAJ RF CPMABRIHGSLUQNTXEDOZKYWJF MFYRGICKELNSHOPAWZDBTQ OIJFSMAKGNBHRQYPTEWCLX PYRCUNWKZAQ NPMOIZQJLVTUCWRGYKSAH FXDZAMYRN';\r\nvexp='AVREHGQUFPJNLDOKXWZIMSYCTB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='CN XG KO WB TX BI LF WF XM OJ CJ JO XP VP AZ LO AL NH XI ZS FJ EQ DY FQ PS BY UJ KR RC CU KU LZ SY PE FD ZD ZA GN DL MI GZ NB AM PW IO RM SI SF VT JZ';\r\nvexp='FUVXSABDCMLKIQOGPJRNWEHYTZ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='DP VF XI BS VE WA VP WJ UQ GY CR NP MI CP LH WK EZ VR AC PH CS XB JS JN RZ EQ YA JK QE PG JV WZ QZ YH QI ES IY AG JT KY VQ GS KN GT FM KH SU PN PU RX';\r\nvexp='ATRNHSQFKZOWXYMGBIUJDVLCEP';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GF PY PC PE OF PT PZ NF PW PK WF PG CF YF PF PA TF PLFO PD PR EF PQ PN VF MF PX QF ZF BF UF KF PS PM PV PLFD PH RF PB PJ JF HF SF DF PO AF IF MPLF PU XF PI';\r\nvexp='FBTOERACUZWYJHVMIDSGKXPLQN';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='IU RT XR YA OZ OF UW VN PK WT HR PX LY ZW SZ IK BE XH VW GV NM NY GX KH UZ MS UA CQ CV VS CF IR IN OY NB NZ GR TK RP NO RJ JO CE SY LH TX QB RB VH MY';\r\nvexp='AEBZTMJUFQHPOCXISDKWLNVGYR';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='UL UO ANY GA YNE FMH PL ZHO OF KG EPK NFU OE VCS UR AM HBU NMD OUZ DY IL RI SL CPD OY AC YLE DK IR FDC IAT CZ ZPL BV XM VL XF WGU KZI DL SLN XC UGK UJ NA HZL PM TY IKW NU';\r\nvexp='LEWKQMYBNSOXVZCRJIFHPATGDU';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='BN BI BGH BGP BF JBGL BH BGS BU BS BGF BQ BE BL BV BO BGZ BP BGQ BGJ BGK BGN BT BGY BGV BGM BX BZ BGO BA BGC BR BD BGA BY BK BGI BC BGR BGLS BGE BJ BW BM BGU BGT BGW BGD BGLA BGX';\r\nvexp='AORQKWXMYGDENHIVTJUZPFCLSB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WL DK KY UK GM DB VC JR PK AJ UZ LW CT QF MH LM HX VP BO HT FO YU TZ KC NG FC PV XR QY UR FS YP ZX AR DV GP ES QB LS KA RB EZ PD UY CH BI EU IX IK SQ';\r\nvexp='ABEFHZPWRVGUJDNLTOCYISMXQK';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AX CL CX MX CZ RX CQ OX CE NX LCJX CH QX YCJX CA CB ZX CS LX PX CK CT HX DX CV WX CW CO GX CM CN YX KX CF CJXB CI IX TX FX BX CU UX CP SX CY EX VX CR CD CG';\r\nvexp='XULBSYFQVTZDKARPJHMEGNWIOC';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MB UX MF MH UH UB UT UI UQ UEJ MP MG MV UF MD UV UO MJ UR UL MA UP UD MO MY UM UA MX UW MZ US UY MK UJ UK MC MW UN MN MU MT ML MS UC MQ UG ME UZ MI MR';\r\nvexp='UEIPJXKVRBDWYQTAFSOGLCZHNM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='KE KS UV KZ EV KI KY BV NV XV MV KF KD KM KT KU RV TV KC ZV KN SV KA KV QV HV KO GV PV KL CV KQ LV KP KX KR FV IV OV JV KJ YV AV DV KH KG KW KB WV';\r\nvexp='VHRAUSYCWGJXIFEPBTDOLQZMNK';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GZ UW UR UG UO QZ DZ CZ WZ UI UZ UH EZ VZ JZ UY UP SZ UD UV UF IZ UA UT UC RZ YZ UM UK UL TZ UJ HZ AZ US UB UN UE UQ KZ OZ XZ MZ UX FZ BZ LZ PZ NZ';\r\nvexp='ZXLCVMQIGTSEJRYFAHDWNPBKOU';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='UL HA WL PA VA RA WA ZA UA AL QL JA OL KL CL DL JL GA XA EL XL IL VL YL TA BL GL YA IA EA NA HL ML FL TL MA FA ZL CA PL NL BA OA SL SA DA LA QA KA RL';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='LR FT IR RT OR XR FR XT DR ER MR NT IT PR MT UTR QR UR VR CT GT WR VT YT BT NR UT SR WT AR ZT BR QT PT HT KR ST DT GR KT JT YR LT CR AT HR ET JR OT ZR';\r\nvexp='TRHIPEYZCFXODASNLJUGKMQWVB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HP JV LC OX XA TG RK GW FP DO EL FQ PD CH EQ GU FM SA YD ZU NJ SM BR YQ KT RZ ZP XU OF MC JA CD UT FC AR ZO RE YI SH NM ZJ OY MB HK QW FN JW HC WS JF';\r\nvexp='BIJMZYPEGDKOSNQUCAHTXWLVRF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='VL LK LY XL LA LQ PL LT JL AL LZ BL LU LP RL LG CL GL QL KL LC HL NL LW LO ZL LE WL LR EL YL LX LH LD UL LM DL TL UOL LF IL SL FL LI LB LV LN LS LJ ML';\r\nvexp='AJYHPRCXMQGIEDBZSWNUFKVTOL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GS GC XQ XT GV XZ GX XO XB XF GW GK XV XW GR XI XM GB GO XA GA XP GU GT GF GM GD XS XL XY XN XG GY XH GL GH GE XD XE GZ GJ GQ XC GN XR XU GP XK GI XJ';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HW UH HC HZ WH HA HU HK HE DH AH VH HV TH HM HP HY HG XH HX LH HS HR HD QH GH KH HQ OH SH IH HJ HF FH CH RH JH HL HT HO HI NH EH ZH BH HN HB MH PH YH';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='FG IG HY JG UG TY GY XG VY ZY XY AG PY SG MG KG EG YG QY BY CG ZG RG CY NY FY SY LG LY PG WG BG VG AY NG WY DY TG IY OMY RY OG UY KY EY HG DG JY OY QG';\r\nvexp='GVUHTMYWAFLJENZBDKOSRCIPQX';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='RVELZJMSYOQUNIXTKDGHFCP XZSDNJIEKTUCMVBWF QFC IPXEBZSMDCHLQWJNUGK NEXKU FVTE QPWSFVRUBEZ XD RIOUBSFK XTUKDHORJGYPCWLNBMIVAE BMFSRUNKHOJI INZMOUAVQJ BFMWUXIQCRZNAEDHY DFHSTZNYVXEJLQRMBA RKN NBHVWTXRCPGUZ ZPCWVLYIMTXJDOFSKARQNEGU FVXZITHRCDPJE BKOEAGNXSUZCJTVQHFWDPM OVDWCNLAF HLYUJDTRF KFJU FDZBONYJCLPEHGWSVKUQMITXR EAJ ZPHIOWKTN EAISBGUDZRQKLHXTCNM RHVKBZPOADNY CIKWHQPTVJNYBOASFDZXGMRL FAXRGVWMNSHEIO JD RBHMS LWGXSDHZJ YZJICSUGDVRKBQA SNYUGPEOIQWZACVD WFXGPABYLUSIKODZTCQVNEHR BGJUQFWIZPHM SPKWETGHXBNUQAZDOVJC LOPDATIGFSNUHJQYWZRBMKXEVC XEJRGIMDHLFUYPCWKNQOBSZVTA VLIFMDAKE DIGR UGYHFRSZD GXBA TAXUGQLKH XUNIOBAYHTSPGEMQVWDRLFJK CYHQPBXVMLAOITFZD WFYKTHPEC WPRSXYGKBTMUZC HFTXMWPGECDZSLNIRYUJKO CKARHVPOZLISWFY';\r\nvexp='AOKPCBIWNMGQLFSHTXEJURZYVD';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='DO IH WO QH GH EO XH FO VH UO DH LO VO KH LHY CH UH FH JH EH TH PO BH TO YO QO IO HO JO SO XO NO GO AO BO KO WH ZO AH RH CO OH ZH SH PH NH RO MH YH MO';\r\nvexp='OSNGBDXZEKTJWIMYUQFARCPVLH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HV CJ RV VU LO OM ZG JU KL XU IT AN AJ SL DV AT CH PC UT DI EI NJ UO QL NS VI DY VZ PE XL LA YX OQ XF EK FY EF DR EM YD ZW DC TP BW MX YE WT JH WN ZM';\r\nvexp='AILHKUEVNQWMGFRBTOSXYZJCPD';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='VT VE VO GB VG CB JB VF FB QB HB NB VX VD VC SB DB VW KB VZ VJ VS VQ VU VR VK AB VB PB VP VY VI WB IB VL VN MB VA YB UB XB RB ZB TB OB LB EB VM VH';\r\nvexp='BJAIXSYPMFCHQEWDZKRUNTOLGV';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ED FR WF AO CQ IW BN BS LS HP FJ BV QM HV AV BJ HQ LN HR PE VR RE FC LF XK IQ RI XN ZK CF MP XZ QV OG TS XW FM RZ EY TM YZ BI SU SI QS YD HU CT IK UW';\r\nvexp='RHSCVQPJWLXGENIBMOTUKDZAYF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='SD OY ML SU XU YX RU XY PY HX YT WD XZ PN JV UE RO NC VY PZ QP GS JN TM SO TC SY GT NV QC FW SX GB NL ZD TX ND OA QS KA PB UB TW MB KW RV UT OJ ER BJ';\r\nvexp='ULJQNPCEMVFIDZXRWKOTAHBGYS';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HY BY PA MY XY PN RY PS EY SY KY PJ PX IY PG PDYX ZY VY PDYG PT PB QY JY UY PL PC PY PV PM PZ PW FY PH PU PO OY PR AY TY WY PE PQ PI PK PF HPDY NY GY LY CY';\r\nvexp='DYOMIJRHUSEFKTLQBWGCVNZXAP';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='OP ZN IZV RT HSI ZHF YWC YH QY OK YOD IZ FJB FVO XPQ NQ JN ME FA REN GP QW PZH OZP DF DJ GVA YT GI LN PC RYG NJ EPO US YWL LD IQ NEY TCH BRX GB FXR AEF MO DKZ WJ IJX LZX AU';\r\nvexp='ANWMKGQJLPUXSTEBFRCHIOVDZY';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='BN NS NB MN NV NP AN LN ON ND NA NK GN HN NY NX ZN SN QN NJ NT NM YN WN PN NZ NC NQ EN JN IN UN FN NU NH XN RN KN CN NO NE VN NW NF NR NL NI DN TN NG';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MI MD MC MA BW MO MF MW MZ MK BS BN BE BO MP MR BC BJ BH BG BY BA ABX BF MY MB BT MH MN BR ML BI MU BL BD ME BP MS BM MJ BU MG MX BK MV BZ MT MQ BV BQ';\r\nvexp='BXSUIFKHDTEYAWGOJPLZQNVCRM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='RN VQ BT QG CW UX MZ DN UA TX QB DE KC YH NJ ZI TJ TC CO VH DJ GY UE RF CF EU IH QW YL NQ KR HK QZ JM TZ RQ QC YG HC WJ QX MP YJ XQ FK SM PT WZ EY XC';\r\nvexp='CUKSFNYTELADPZVJWBORMHXIGQ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AZ NX TX SN XP HO RF JP EG DB ER UV WN IG DO BT YK EB KB DE VI RW HV TW DI FE WY VD IF UO RY GS NK GI OH WL VL WG AM NH KI EZ WQ CO LV KP QZ FS IL GC';\r\nvexp='HAVSRMOJQPYFGLUWEKZXDCTNBI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='OF UV HL JC WK XJ EM TM UF IQ XC MH EC UM PJ HT VC JO LN NW AH PM KN BU ZJ JA RJ BT KM TR CM PW ZL NC QM TV GL AQ UE LG GH RM UR QU GW ZY FP UN QK LF';\r\nvexp='TJHUPIVKENBLDWOYZCFSXQRGAM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WS IL ID WT WD IY IT IN WF IH IQ IS WZ WO WI WM IX IP IC WG WN IE WH WA IJ WL IW ZZ WQ IM WE WX WK Z IR IZ WB WJ WC WY WP WV IU IV WU IG IK WR IO IF';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QL UF UL VL BF YF NL IL ZF HF PF ML AF OF AL WL GF MF NF OL LF BL HL JL SL KL EL KF VF CL TL EF DL WF JF CF TF DF XF QF DGL XL RF RL YL SF IF PL FL ZL';\r\nvexp='FMQPUENTHJYRSGLIZBWDAKCVOX';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AR BH LK JL TD XK HK RK KU RW QO BZ CM IA ZR WK WL GP XJ NK TS SU DN NJ YT TJ MU UM HW CX HX EA QL QV IH NG DU IO XV DY VH AZ VB DB IG CN FQ UZ MH SZ';\r\nvexp='SBGOQCLTVPXWJFDMZNIURAEYKH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='SKI SQ SP SE SB SU SKR SKG SKZ SKJ MSKP SKM SL SKC SC SKW SO SKA SM SI SKPT SKD SG SKO SKN NSKP SX SKH SW SR ST SD SA SV SJ SKX SH SKL SF SN SKV SZ SKB SKF SKQ SKU SKY SKE SKT SY';\r\nvexp='AZCTJGBEDFRPQILKOHUWXYMVNS';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='KE KJ WE XS UK OT GF IF VY NI ZV CL HJ AV AM MO ES QM CO ST LU CI AU JX EJ JU CB IP DL QX GL AF AD LG DG QR EQ FZ AW FY HQ AN SX MY QS MC GC LD SM QB';\r\nvexp='QVUJEPMXFODNBRCHTGIYWKSLZA';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='EA JE KN MZ TD KV NC ZG YH MO JX JC OM UI BA DH KS FL YX UT FX RF RW TG HF BJ QT ZT EC IZ QV GP CY OT EX QF ML GO LD GQ GL TB SQ WF WO GC GM MK JN NO';\r\nvexp='AZOLCRSHMFPNBUXTEYQIDWJVKG';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='XE VO CI GS AB CD LN PG FA XD KE TU XU DE AQ UD HL IB EI GY FJ OA YU MJ GT CH WO LI WQ JY UB SJ QJ ZG WI WK AL UV LX WD FQ FE KN CT XC GW RY PY MF IV';\r\nvexp='AZJCPTKSFIUORXMBEVQHYDNWLG';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='KG FS ZU JX CH PM XL IA JZ AP WD RS SX BT GC EG AW KD EL WE NH VW BJ CO DW LH PO RF AX LN OJ CB BR CX XJ IR ZY EZ RQ BZ YS WX FA KA BL VG WZ FT TN QH';\r\nvexp='ACSYROIFKEMZJULQVNDTBHPXGW';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='NMOKZL YQADTPXVMEK AVELGHMKTQRUWIFOSJNZP PNMCQGI TG UCLTEHPSYKXFRQGMWANZBIOV ZEABLRXSGHJK LXQZCJOSD PMYXVARWGUSECBHDQNZKLIFT PEBDUYHJMQI KYIXRZJTA PLOBJXE CTUPZHXI TNLMJYOCEIQGZPDABHKUV NVBGMSKFIWYZAXPRCUET JHAGRN TYCDAQHWPXK ZQXMWKHETG KWYOZMFBHVQNLCUPG FNOQAETIDVPSMLBGZCUYR FDESNRU JSBFYZ VBQSDCPMFOHKZXI DNZLJXPMSGOERVKWHAYICFBQU EAOKPHQVD VBMPYRDIT FAGXUVN TUHROSPGCDJI OHSMTCRUYVPFBAZNQGDIEJ BOFWMSC NOCUGQF XFUKMEOBZSIQNVJYPW XVIFLSAYZRDH WLZIXRAUYKFDNHB VOAJGRYDEMFBZNWISXH JLHTYUBCFZRQA RKBWNMDYJAPGVCHIOUZXTE LWPQUSBTCEIZOAVKMGYRJXFN BDKZ LEDOHPUTJNV ELIYBCSWPRNZGKJ LOSTUBYNQXVZCWRGIEPAFD MNRI UHXLNPWKDZRMBAGTYSFCJQVOI QONLSME YTXEOZURJMIDALKBVN ZKYGRMBSDLIEPFVJQOXHNCU GTRMENSDFIWBCXYAOJHPQZU ZJTXAKPIQNYMLW RWGVQITLFPOMXNCUEHD';\r\nvexp='AOMLBEFYSKCRVUXHGPQWJIDTNZ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='JTIYSCR KYBNCVHUZOEFQGWXSRMDLT NQJEZFDWRMLAYKBVUSXPCG KLDHNEFMXYBP RMLGEPYFDT GNZXUFYTODHJVQRIMPC JDZGTRHFX ND UHOEKYVZRPSWGLJXNFQ YZRSG HVIWKTXMDFYCOSA ZODHRSGIVYALEMUQ QFLKYNJITBRACDVP FQZTVBMPLIKJXOGUHAYDCWRESN XLHRYIBUMDPCQOFN HMYTNAFKZOJLRGISCPXVEUQDBW KJOQGSIUCDYVRLATEFBWNZPHM ZAMHYSQEWCXRUNPIBDJT ZDKRHU OICRFYXWNHED TGCQYSP IBOLPZYUWJSDHNCVTMFXR WCQFXHSVRDAGEKUPNBJITMYL OLWZQBISETYJPMDNGUKF UGRWSPJADBCFNOXIEYMHTKLQV ZOEWBSRNUIYTJQDP QIBLMEHCAPDO DLCYANVBSFHWGTORK OJIZDVCMNSTPKAXUQBERYLFG DP FTKOYDSENCAQXBVJZUG WSMBGUHPAJVD NOPYILEVJ UYDXZFGJECQSIVPONBMRHLWAK KCZIPRXJQHTBAUOWVFYMLSE KXCGZVUL DXMU BKLSMCJUDQXAWPOIRZFVNTH RMABZCE PXOMV LFSGCXOMTYJEIN BLCSYFAOGDEXIPNJ VMIZKYXWNAFJHEGUPLRDSBC UD LUCGEQMOSDWVBX TZDMRJUNHLGEYIBSC XJQDPYENKRMFHUTBISA XLREUDNFOTMKWSJAPZCHIQBYV XLSKUHPOTDVZWMFANCRIEYQ CHDULZMIVXAJSYFQWGOTR';\r\nvexp='AMKVZSXCTNFLHWQRIJOGPEUBYD';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ZO SK IC OM CO IK TI BM BO NR VH LF OP YC FM GR HV EY FQ GL MX XP KO DY MS XQ DP DC PR KF OS LU EZ UP ZT VE NA WM XW RW MN IB VY TS LK PQ JN KR XE SM';\r\nvexp='AIUXVNQWBDKETCGYRLJOFZPSHM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='PI UZK KF YRA TF KR FPG CKH NML HX LCO RPI YRG BFY RW LK EM UGJ NR DTI JS JMV CKD ZG FO BN LZ PG NZ QZO DRH DLF TE LH JWB USX NLZ FE BMP NY ZF AJ JF CJW QDO VWM IQO XQ EU IKN';\r\nvexp='AXGMSLRUYWDITZKHVBQJPCEONF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='NM RC HM RY RW OM RU DM AM RI WM RQ RV RH XM RK RF RZ TM RG PM SM RJ IM RX VM RB RE JM RO KM RM RD RL RT RA RN LM ZM FM YM BM RS UM CM QM GM EM RP';\r\nvexp='MYHXBEFNPWQKZGODCUIAVJLSTR';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='BM BZ BR BD LA LQ LS LI BN BW LU LB LZ LK LT LG LP BI BK LW LX BT LV LE LD BCN LH BQ BV LJ BS LO BY BF BH BX BP BA BL LY LN LR BE LM LC BU BJ BO LF BG';\r\nvexp='BCSXFRHZIMVJWYEPODTAQUKGNL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='VF QV VS VN OV VZ VY VD VM MV AV NV Z IV KV VR YV JV VX ZV BV VT VC VL RV EV VJ GV CV VI UV WV LV VK TV VQ VB VG XV VW VU VP HV VE PV VO FV VH SV DV';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WD QPT ALC SCJ IT OF GED EU XA MLY ATE OP BK NXJ FS ZCD NOW GY IL QER UAI BJY FPB UOD XDB HYE MI FEK TI GKH UZ KR AN VNB BMH REY RQY PTZ WK MQH SR GOJ ZS UCL HCV UP EAI XWB LW OL';\r\nvexp='BNLJQDYXPUCAOGWTRMHSZKVIFE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AB DR KM VS XD ZS BK FJ GO JI ZK JK AE TB BU GH YD ZL PL DW TI PB YZ RG SF YX AI ER KU QH QF IN WB VB RX WP SC BR DF IV ZX MA IJ ZI SY BV AN QE GW AD';\r\nvexp='DNXVASJQWGPMFLORZEKCHIYTUB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='YE SQ XL VY LZ MB ZS OC TP ML CA AS HR HQ NV XH OX DM FJ WO LC VP CK IE HK MC EQ CF NM GD KX BR XJ RD KG ZB CT PL SE AH JV TR FQ ND US OK DN KM TU KT';\r\nvexp='KAZILWYDUTFXMNBQVESOHGPJRC';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='XD JX MX OX XP GX DX XK XY XB NX XN XT XQ PX XR XV XE XH FX CX XC XI LX XU XO YX XW HX VX XJ XA WX ZX BX QX XF XG XS IX XL UX KX RX AX EX XM XZ SX TX';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='OFA OX OFQ OJ OFW OFY OW OG OFB OQ OH OFH OFR SOFV OM OFD OFP OT OI OFI OFS OZ OFL OU OK OL OFE OFJ OFZ ON OFX OFVW OFC OB OR OE HOFV OY OA OFN OFM OV OFG OC OD OP OFK OS OFU OFT';\r\nvexp='AHDSTUJGPMIRFZQKLXNBVYECWO';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GI ZI FK FG WI PI JI FYIR FV VI FJ BI UI SI FW FC KI OI MI FQ FS FYIX EI FZ FU CI FO FA FX HI FE NI FM LI QI AI FN TI FL FR FD FI FB FYIL FT DI FH RI FP XI';\r\nvexp='IDYPQKVGBAUZNWJRSHTEMCLXOF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n\r\n%%\r\nglobal zstart\r\nzdelta=(now-zstart)*24*60*60\r\n\r\n%%\r\n%Stacy992 Solution\r\n% import java.util.*;\r\n% import java.io.*;\r\n% public class d {\r\n% \tpublic static HashMap\u003cString, Integer\u003e memo;\r\n% \tpublic static void main(String[] args){\r\n% \t\tScanner in = new Scanner(System.in);\r\n% \t\tint t = in.nextInt();\r\n% \t\tfor(int z = 1;z\u003c=t;z++){\r\n% \t\t\tint n = in.nextInt();\r\n% \t\t\tString[] words = new String[n];\r\n% \t\t\tboolean flag = false;\r\n% \t\t\tfor(int i = 0;i\u003cn;i++){\r\n% \t\t\t\twords[i] = in.next().toLowerCase();\r\n% \t\t\t\tif(words[i].length() == 1){\r\n% \t\t\t\t\tflag = true;\r\n% \t\t\t\t}\r\n% \t\t\t}\r\n% \t\t\tAhoCorasick.createAhoCorasick(words);\r\n% \t\t\tif(flag){\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": IMPOSSIBLE\");\r\n% \t\t\t\tcontinue;\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\tArrayList\u003cInteger\u003e order = new ArrayList\u003cInteger\u003e();\r\n% \t\t\tfor(int i = 0;i\u003c26;i++){\r\n% \t\t\t\torder.add(i);\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\tint steps = 10000000;\r\n% \t\t\tboolean found = false;\r\n% \t\t\twhile(steps \u003e= 0){\r\n% \t\t\t\tsteps--;\r\n% \t\t\t\tint state = 0;\r\n% \t\t\t\tboolean good = true;\r\n% \t\t\t\tfor(int i : order){\r\n% \t\t\t\t\tstate = AhoCorasick.transition[i][state];\r\n% \t\t\t\t\tif(AhoCorasick.term[state]){\r\n% \t\t\t\t\t\tgood = false;\r\n% \t\t\t\t\t\tbreak;\r\n% \t\t\t\t\t}\r\n% \t\t\t\t}\r\n% \t\t\t\tif(good){\r\n% \t\t\t\t\tfound = true;\r\n% \t\t\t\t\tbreak;\r\n% \t\t\t\t}\r\n% \t\t\t\t\r\n% \t\t\t\tCollections.shuffle(order);\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\tif(!found){\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": IMPOSSIBLE\");\r\n% \t\t\t}\r\n% \t\t\telse{\r\n% \t\t\t\tStringBuilder res = new StringBuilder(\"\");\r\n% \t\t\t\tfor(int i : order){\r\n% \t\t\t\t\tres.append((char)('A'+i));\r\n% \t\t\t\t}\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": \"+res);\r\n% \t\t\t}\r\n% \t\t\t/*memo = new HashMap\u003cString, Integer\u003e();\r\n% \t\t\tif(flag){\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": IMPOSSIBLE\");\r\n% \t\t\t\tcontinue;\r\n% \t\t\t}\r\n% \t\t\tint ans = go(0, 0);\r\n% \t\t\tif(ans == 0){\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": IMPOSSIBLE\");\r\n% \t\t\t}\r\n% \t\t\telse{\r\n% \t\t\t\tint mask = 0;\r\n% \t\t\t\tint state = 0;\r\n% \t\t\t\tStringBuilder res = new StringBuilder(\"\");\r\n% \t\t\t\twhile(mask != (1\u003c\u003c26)-1){\r\n% \t\t\t\t\tint i = memo.get(mask+\" \"+state);\r\n% \t\t\t\t\tres.append((char)('A'+i));\r\n% \t\t\t\t\tmask|=(1\u003c\u003ci);\r\n% \t\t\t\t\tstate = AhoCorasick.transition[i][state];\r\n% \t\t\t\t}\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": \"+res);\r\n% \t\t\t}*/\r\n% \t\t}\r\n% \t}\r\n% \t\r\n% \tpublic static int go(int mask, int state){\r\n% \t\t\r\n% \t\t\r\n% \t\tif(AhoCorasick.term[state]){\r\n% \t\t\treturn 0;\r\n% \t\t}\r\n% \t\tif(mask == (1\u003c\u003c26)-1){\r\n% \t\t\treturn 1;\r\n% \t\t}\r\n% \t\tif(memo.size() \u003e 1000000){\r\n% \t\t\treturn 0;\r\n% \t\t}\r\n% \t\t\r\n% \t\tString key = mask+\" \"+state;\r\n% \t\tif(memo.containsKey(key)){\r\n% \t\t\tif(memo.get(key).intValue() == -1){\r\n% \t\t\t\treturn 0;\r\n% \t\t\t}\r\n% \t\t\treturn 1;\r\n% \t\t}\r\n% \t\tArrayList\u003cInteger\u003e order = new ArrayList\u003cInteger\u003e();\r\n% \t\tfor(int i = 0;i\u003c26;i++){\r\n% \t\t\tif((mask \u0026 (1\u003c\u003ci)) == 0){\r\n% \t\t\t\torder.add(i);\r\n% \t\t\t}\r\n% \t\t}\r\n% \t\t\r\n% \t\tCollections.shuffle(order);\r\n% \t\tint index = -1;\r\n% \t\tint ans = 0;\r\n% \t\tfor(int i : order){\r\n% \t\t\tif((mask \u0026(1\u003c\u003ci)) == 0){\r\n% \t\t\t\tint res = go(mask|(1\u003c\u003ci), AhoCorasick.transition[i][state]);\r\n% \t\t\t\tif(res == 1){\r\n% \t\t\t\t\tans = 1;\r\n% \t\t\t\t\tindex = i;\r\n% \t\t\t\t\tbreak;\r\n% \t\t\t\t}\r\n% \t\t\t}\r\n% \t\t}\r\n% \t\tmemo.put(key, index);\r\n% \t\treturn ans;\r\n% \t}\r\n% \tpublic static class AhoCorasick\r\n% \t{\r\n% \t\tpublic static final int ALPHA = 26;\r\n% \t\t\r\n% \t\tpublic static int nodeCount;\r\n% \t\tpublic static int[][] transition;\r\n% \t\tpublic static boolean[] term;\r\n% \t\t\r\n% \t\tpublic static void createAhoCorasick(String[] strs)\r\n% \t\t{\r\n% \t\t\tint maxNodes = 1;\r\n% \t\t\tfor(String s : strs)\r\n% \t\t\t{\r\n% \t\t\t\tmaxNodes += s.length(); // This could be passed in instead\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\tint[][] children = new int[ALPHA][maxNodes];\r\n% \t\t\tboolean[] leaf = new boolean[maxNodes];\r\n% \t\t\tnodeCount = 1;\r\n% \t\t\tfor(String s : strs)\r\n% \t\t\t{\r\n% \t\t\t\tint node = 0;\r\n% \t\t\t\tfor(char ch : s.toCharArray())\r\n% \t\t\t\t{\r\n% \t\t\t\t\tint c = ch - 'a';\r\n% \t\t\t\t\tif(children[c][node] == 0)\r\n% \t\t\t\t\t{\r\n% \t\t\t\t\t\tchildren[c][node] = nodeCount;\r\n% \t\t\t\t\t\tnodeCount++;\r\n% \t\t\t\t\t}\r\n% \t\t\t\t\t\r\n% \t\t\t\t\tnode = children[c][node];\r\n% \t\t\t\t}\r\n% \t\t\t\t\r\n% \t\t\t\tleaf[node] = true;\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\ttransition = new int[ALPHA][nodeCount];\r\n% \t\t\tterm = new boolean[nodeCount];\r\n% \t\t\t\r\n% \t\t\tArrayDeque\u003cInteger\u003e queue = new ArrayDeque\u003cInteger\u003e();\r\n% \t\t\tqueue.add(0);\r\n% \t\t\tqueue.add(0);\r\n% \t\t\t\r\n% \t\t\twhile(queue.size() \u003e 0)\r\n% \t\t\t{\r\n% \t\t\t\tint node = queue.remove();\r\n% \t\t\t\tint suffLink = queue.remove();\r\n% \t\t\t\t\r\n% \t\t\t\tterm[node] = leaf[node] || term[suffLink];\r\n% \t\t\t\t\r\n% \t\t\t\tfor(int ch = 0; ch \u003c ALPHA; ch++)\r\n% \t\t\t\t{\r\n% \t\t\t\t\tif(children[ch][node] != 0)\r\n% \t\t\t\t\t{\r\n% \t\t\t\t\t\ttransition[ch][node] = children[ch][node];\r\n% \t\t\t\t\t\tqueue.add(children[ch][node]);\r\n% \t\t\t\t\t\tqueue.add(node == 0 ? 0 : transition[ch][suffLink]);\r\n% \t\t\t\t\t}\r\n% \t\t\t\t\telse\r\n% \t\t\t\t\t{\r\n% \t\t\t\t\t\ttransition[ch][node] = transition[ch][suffLink];\r\n% \t\t\t\t\t}\r\n% \t\t\t\t}\r\n% \t\t\t}\r\n% \t\t}\r\n% \t}\r\n% }","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":6,"test_suite_updated_at":"2016-03-25T23:43:24.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2016-03-24T05:30:35.000Z","updated_at":"2026-04-01T12:22:42.000Z","published_at":"2016-03-24T06:05:37.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=p3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGJam March 2016 Annual I/O for Password Security\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e. This is the small-2 case of up to 50 passwords of length 1 to 26\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 a random block set A:Z exists to the child of a paranoid corporate president. He is worried that his password(s) may exist in the block pattern. Produce a 26 character block sequence that does not contain his password. If no sequence can be made that does not contain his strong password output 'IMPOSSIBLE'.\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 [PW], string up to 50 space separated passwords of 1 to 26 characters\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 [Pstr], string containing A:Z with no instance of PW or 'IMPOSSIBLE'\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 [PW] [Pstr]\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[[X] [IMPOSSIBLE] \\n[QQ][ABCDEFGHIJKLMNOPQRSTUVWXYZ]\\n['XYZ GCJ OMG LMAO JK'][ABCDEFGHIKLMNOPQRSTUVWXYJZ]]]\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\u003eTheory:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Remove Impossible cases first. Produce a PW string with a robust start/end pairs and a random middle. Try multiple formats with a timer. The most common letter can be placed at both the start and end with random internal letters. OR you can just guess for awhile and then give up. The key here is an efficient invalid string check. The IOW Champion Stacy992's java solution is in the test suite for misguidance versus the Matlab 5 line solution.\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":1506,"title":"Maximum Intra-Vector Swaps","description":"This Challenge, based upon a contest in which Rokicki came in 2nd, is to find sequences containing 1:N that require maximum iterations prior to the value 1 appearing in the first position.\r\n\r\nThe processing rule is that positions 1 thru Vector(1) are swapped. Processing stops when Vector(1) is 1.\r\n\r\n*Example Sequences:* \r\n\r\n  [3 1 2], [2 1 3], [1 2 3] Score 2\r\n  [3 1 4 5 2][4 1 3 5 2][5 3 1 4 2][2 4 1 3 5][4 2 1 3 5][3 1 2 4 5][2 1 3 4 5][1 2 3 4 5]\r\n\r\n\r\n*Input:* n  (Integer from 1 to 31) (16 Actual Cases 2:11 13 17 19 23 29 31) \r\n\r\n*Output:* Vector of values 1:n\r\n\r\nExample:\r\n\r\nInput: 5  Output: [3 1 4 5 2]  \r\n\r\nScore: 7  \r\n\r\nA minimum cumulative score of 531 for the 17 cases is required to Pass.\r\n\r\nFinal Score = 2531 - sum(scores)\r\n\r\n*Hints:*\r\n\r\nUsage of perms for 10 or higher may cause Cody Memory/Time issues. Random subsets are suggested for n\u003e9.\r\n\r\nRequest: If Code is implemented external then please post as a block comment.\r\n\r\nFaster Code Block than fliplr:\r\n\r\n  function count=process_seq(seq)\r\n   count=0;\r\n   while seq(1)\u003e1\r\n    count=count+1;\r\n    seq(1:seq(1))=seq(seq(1):-1:1);\r\n   end\r\n  end","description_html":"\u003cp\u003eThis Challenge, based upon a contest in which Rokicki came in 2nd, is to find sequences containing 1:N that require maximum iterations prior to the value 1 appearing in the first position.\u003c/p\u003e\u003cp\u003eThe processing rule is that positions 1 thru Vector(1) are swapped. Processing stops when Vector(1) is 1.\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample Sequences:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[3 1 2], [2 1 3], [1 2 3] Score 2\r\n[3 1 4 5 2][4 1 3 5 2][5 3 1 4 2][2 4 1 3 5][4 2 1 3 5][3 1 2 4 5][2 1 3 4 5][1 2 3 4 5]\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e n  (Integer from 1 to 31) (16 Actual Cases 2:11 13 17 19 23 29 31)\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Vector of values 1:n\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cp\u003eInput: 5  Output: [3 1 4 5 2]\u003c/p\u003e\u003cp\u003eScore: 7\u003c/p\u003e\u003cp\u003eA minimum cumulative score of 531 for the 17 cases is required to Pass.\u003c/p\u003e\u003cp\u003eFinal Score = 2531 - sum(scores)\u003c/p\u003e\u003cp\u003e\u003cb\u003eHints:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eUsage of perms for 10 or higher may cause Cody Memory/Time issues. Random subsets are suggested for n\u003e9.\u003c/p\u003e\u003cp\u003eRequest: If Code is implemented external then please post as a block comment.\u003c/p\u003e\u003cp\u003eFaster Code Block than fliplr:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003efunction count=process_seq(seq)\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nend\r\n\u003c/pre\u003e","function_template":"function max_seq=find_max_swap_seq(n)\r\n max_seq=1:n;\r\n count=process_seq(max_seq);\r\nend\r\n\r\n% Suggested function for sequence performance evaluation\r\nfunction count=process_seq(seq)\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nend","test_suite":"tic\r\nfeval(@assignin,'caller','score',2000);\r\n%%\r\n% 2 1\r\nglobal cseq\r\ncseq{1}=1; % Gift answer\r\nmax_seq=find_max_swap_seq(2);\r\nassert(isequal(1:2,unique(max_seq)))\r\ncseq{2}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 3 2\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(3);\r\nassert(isequal(1:3,unique(max_seq)))\r\ncseq{3}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 4 4\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(4);\r\nassert(isequal(1:4,unique(max_seq)))\r\ncseq{4}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 5 7\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(5);\r\nassert(isequal(1:5,unique(max_seq)))\r\ncseq{5}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 6 10\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(6);\r\nassert(isequal(1:6,unique(max_seq)))\r\ncseq{6}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 7 16\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(7);\r\nassert(isequal(1:7,unique(max_seq)))\r\ncseq{7}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 8 22\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(8);\r\nassert(isequal(1:8,unique(max_seq)))\r\ncseq{8}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n% 9 30\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(9);\r\nassert(isequal(1:9,unique(max_seq)))\r\ncseq{9}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%10 38\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(10);\r\nassert(isequal(1:10,unique(max_seq)))\r\ncseq{10}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%11 51\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(11);\r\nassert(isequal(1:11,unique(max_seq)))\r\ncseq{11}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%13 80 case 12\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(13);\r\nassert(isequal(1:13,unique(max_seq)))\r\ncseq{12}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%17 159 case 13\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(17);\r\nassert(isequal(1:17,unique(max_seq)))\r\ncseq{13}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%19 221 case 14\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(19);\r\nassert(isequal(1:19,unique(max_seq)))\r\ncseq{14}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%23 382 case 15\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(23);\r\nassert(isequal(1:23,unique(max_seq)))\r\ncseq{15}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%29 689 case 16\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(29);\r\nassert(isequal(1:29,unique(max_seq)))\r\ncseq{16}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\n%%\r\n%31 819 case 17\r\nglobal cseq\r\nmax_seq=find_max_swap_seq(31);\r\nassert(isequal(1:31,unique(max_seq)))\r\ncseq{17}=max_seq;\r\n seq=max_seq;\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\nfprintf('count %i\\n',count)\r\nfprintf('%i ',max_seq)\r\nfprintf('\\n')\r\ntoc\r\n%%\r\nglobal cseq\r\ntotal=0;\r\nfor i=2:17\r\n seq=cseq{i};\r\n count=0;\r\n while seq(1)\u003e1\r\n  count=count+1;\r\n  seq(1:seq(1))=seq(seq(1):-1:1);\r\n end\r\n total=total+count;\r\nend\r\n\r\n% 2531 is optimal sum\r\ntotal=sum([0 1 2 4 7 10 16 22 30 38 51 80 159 221 382 689 819])-total;\r\nassert(total\u003c2001); % Minimum performance requirement\r\n\r\ntoc\r\nfeval(@assignin,'caller','score',min(2000,total));\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":1,"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-05-13T01:28:12.000Z","updated_at":"2026-04-01T14:34:03.000Z","published_at":"2013-05-13T04:01:26.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, based upon a contest in which Rokicki came in 2nd, is to find sequences containing 1:N that require maximum iterations prior to the value 1 appearing in the first position.\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 processing rule is that positions 1 thru Vector(1) are swapped. Processing stops when Vector(1) is 1.\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\u003eExample Sequences:\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[[3 1 2], [2 1 3], [1 2 3] Score 2\\n[3 1 4 5 2][4 1 3 5 2][5 3 1 4 2][2 4 1 3 5][4 2 1 3 5][3 1 2 4 5][2 1 3 4 5][1 2 3 4 5]]]\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 n (Integer from 1 to 31) (16 Actual Cases 2:11 13 17 19 23 29 31)\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 Vector of values 1:n\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eInput: 5 Output: [3 1 4 5 2]\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\u003eScore: 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\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA minimum cumulative score of 531 for the 17 cases is required to Pass.\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\u003eFinal Score = 2531 - sum(scores)\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\u003eHints:\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\u003eUsage of perms for 10 or higher may cause Cody Memory/Time issues. Random subsets are suggested for n\u0026gt;9.\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\u003eRequest: If Code is implemented external then please post as a block comment.\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\u003eFaster Code Block than fliplr:\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[function count=process_seq(seq)\\n count=0;\\n while seq(1)\u003e1\\n  count=count+1;\\n  seq(1:seq(1))=seq(seq(1):-1:1);\\n end\\nend]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":1646,"title":"Kurchan 3x3 - Optimal Score","description":"Find an optimal 3x3 Kurchan square, score of 198. \r\n\r\nA 3x3 Kurchan square has values 1:9.The products of each row, column, diagonal, and anti-diagonal are used\r\n\r\nThe Kurchan-value is the Max minus the Minimum of these products.\r\n\r\n*Example: m=[5 1 8;3 9 4;7 2 6]*\r\n\r\nRow Products: 40,108, and 84. Column products 105, 18, and 192.\r\n\r\nDiagonal Products: 270, 1*4*7=28, and 8*3*2=48.\r\n\r\nAnti-Diagonal Products: 8*9*7=504, 1*3*6=18, and 5*4*2=40.\r\n\r\nK is thus 504-18 = 486. [ Max of all products - Min of all products ]\r\n\r\n*Input:* None\r\n\r\n*Output:* Kurchan Square [3x3] that scores 198\r\n\r\nI expect someone to give a min size hardcoded solution at some point.\r\n\r\nRelated Challenges:\r\n\r\n1) \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1634-kurchan-square-evaluation-function Kurchan Square Evaluation\u003e\r\n\r\n2) Minimize Kurchan Squares (N=4:9)\r\n\r\n3) Minimize Kurchan Squares (N=10:20) [Very large numbers]\r\n\r\n4) Maximize Sum of Products (N=4:9) and a Large number Challenge\r\n\r\n5) Minimize Sum of Products (N=4:9) and a Large number Challenge","description_html":"\u003cp\u003eFind an optimal 3x3 Kurchan square, score of 198.\u003c/p\u003e\u003cp\u003eA 3x3 Kurchan square has values 1:9.The products of each row, column, diagonal, and anti-diagonal are used\u003c/p\u003e\u003cp\u003eThe Kurchan-value is the Max minus the Minimum of these products.\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample: m=[5 1 8;3 9 4;7 2 6]\u003c/b\u003e\u003c/p\u003e\u003cp\u003eRow Products: 40,108, and 84. Column products 105, 18, and 192.\u003c/p\u003e\u003cp\u003eDiagonal Products: 270, 1*4*7=28, and 8*3*2=48.\u003c/p\u003e\u003cp\u003eAnti-Diagonal Products: 8*9*7=504, 1*3*6=18, and 5*4*2=40.\u003c/p\u003e\u003cp\u003eK is thus 504-18 = 486. [ Max of all products - Min of all products ]\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e None\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Kurchan Square [3x3] that scores 198\u003c/p\u003e\u003cp\u003eI expect someone to give a min size hardcoded solution at some point.\u003c/p\u003e\u003cp\u003eRelated Challenges:\u003c/p\u003e\u003cp\u003e1) \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1634-kurchan-square-evaluation-function\"\u003eKurchan Square Evaluation\u003c/a\u003e\u003c/p\u003e\u003cp\u003e2) Minimize Kurchan Squares (N=4:9)\u003c/p\u003e\u003cp\u003e3) Minimize Kurchan Squares (N=10:20) [Very large numbers]\u003c/p\u003e\u003cp\u003e4) Maximize Sum of Products (N=4:9) and a Large number Challenge\u003c/p\u003e\u003cp\u003e5) Minimize Sum of Products (N=4:9) and a Large number Challenge\u003c/p\u003e","function_template":"function m = kurchan_3x3\r\n  m=zeros(3);\r\nend","test_suite":"%%\r\ntic\r\nm = kurchan_3x3\r\ntoc\r\n p=[1     4     7\r\n     2     5     8\r\n     3     6     9\r\n     1     2     3\r\n     4     5     6\r\n     7     8     9\r\n     1     5     9\r\n     4     8     3\r\n     7     2     6\r\n     7     5     3\r\n     8     6     1\r\n     9     4     2];\r\nassert(isequal((1:9)',unique(m(:)))) % check use 1 thru 9\r\nmp=prod(m(p),2);\r\nK=max(mp)-min(mp) % display K score\r\n\r\n% simplified Kurchan scoring for 3x3\r\n\r\nassert(K\u003c=198)  % Pretty certain 198 is best possible, allow better score\r\n\r\n\r\n\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":30,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-06-13T04:20:37.000Z","updated_at":"2025-11-27T17:20:36.000Z","published_at":"2013-06-13T05:10:56.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\u003eFind an optimal 3x3 Kurchan square, score of 198.\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\u003eA 3x3 Kurchan square has values 1:9.The products of each row, column, diagonal, and anti-diagonal are used\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 Kurchan-value is the Max minus the Minimum of these products.\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\u003eExample: m=[5 1 8;3 9 4;7 2 6]\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\u003eRow Products: 40,108, and 84. Column products 105, 18, and 192.\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\u003eDiagonal Products: 270, 1*4*7=28, and 8*3*2=48.\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\u003eAnti-Diagonal Products: 8*9*7=504, 1*3*6=18, and 5*4*2=40.\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\u003eK is thus 504-18 = 486. [ Max of all products - Min of all products ]\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 None\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 Kurchan Square [3x3] that scores 198\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\u003eI expect someone to give a min size hardcoded solution at some point.\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\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/1634-kurchan-square-evaluation-function\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eKurchan Square Evaluation\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) Minimize Kurchan Squares (N=4:9)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3) Minimize Kurchan Squares (N=10:20) [Very large numbers]\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4) Maximize Sum of Products (N=4:9) and a Large number Challenge\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e5) Minimize Sum of Products (N=4:9) and a Large number Challenge\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":42782,"title":"GJam March 2016 IOW: Passwords and the Block Set","description":"This Challenge is derived from \u003chttp://code.google.com/codejam/contest/8274486/dashboard#s=p3 GJam March 2016 Annual I/O for Password Security\u003e. This is the small-2 case of up to 50 passwords of length 1 to 26\r\n\r\nThe GJam story goes that a random block set A:Z exists to the child of a paranoid corporate president. He is worried that his password(s) may exist in the block pattern. Produce a 26 character block sequence that does not contain his password. If no sequence can be made that does not contain his strong password output 'IMPOSSIBLE'. \r\n\r\n*Input:* [PW], string up to 50 space separated passwords of 1 to 26 characters\r\n\r\n*Output:* [Pstr], string containing A:Z with no instance of PW or 'IMPOSSIBLE'\r\n\r\n*Examples:* [PW] [Pstr]\r\n\r\n  [X] [IMPOSSIBLE] \r\n  [QQ][ABCDEFGHIJKLMNOPQRSTUVWXYZ]\r\n  ['XYZ GCJ OMG LMAO JK'][ABCDEFGHIKLMNOPQRSTUVWXYJZ] \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*Theory:* Remove Impossible cases first. Produce a PW string with a robust start/end pairs and a random middle. Try multiple formats with a timer. The most common letter can be placed at both the start and end with random internal letters. OR you can just guess for awhile and then give up. The key here is an efficient invalid string check. The IOW Champion Stacy992's java solution is in the test suite for misguidance versus the Matlab 5 line solution.\r\n","description_html":"\u003cp\u003eThis Challenge is derived from \u003ca href = \"http://code.google.com/codejam/contest/8274486/dashboard#s=p3\"\u003eGJam March 2016 Annual I/O for Password Security\u003c/a\u003e. This is the small-2 case of up to 50 passwords of length 1 to 26\u003c/p\u003e\u003cp\u003eThe GJam story goes that a random block set A:Z exists to the child of a paranoid corporate president. He is worried that his password(s) may exist in the block pattern. Produce a 26 character block sequence that does not contain his password. If no sequence can be made that does not contain his strong password output 'IMPOSSIBLE'.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e [PW], string up to 50 space separated passwords of 1 to 26 characters\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e [Pstr], string containing A:Z with no instance of PW or 'IMPOSSIBLE'\u003c/p\u003e\u003cp\u003e\u003cb\u003eExamples:\u003c/b\u003e [PW] [Pstr]\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[X] [IMPOSSIBLE] \r\n[QQ][ABCDEFGHIJKLMNOPQRSTUVWXYZ]\r\n['XYZ GCJ OMG LMAO JK'][ABCDEFGHIKLMNOPQRSTUVWXYJZ] \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\u003eTheory:\u003c/b\u003e Remove Impossible cases first. Produce a PW string with a robust start/end pairs and a random middle. Try multiple formats with a timer. The most common letter can be placed at both the start and end with random internal letters. OR you can just guess for awhile and then give up. The key here is an efficient invalid string check. The IOW Champion Stacy992's java solution is in the test suite for misguidance versus the Matlab 5 line solution.\u003c/p\u003e","function_template":"function Pstr=Password(c)\r\n% c is a string of space separated passwords\r\n% Suggested sequence\r\n\r\n Pstr='IMPOSSIBLE';\r\n [Impossible]=check_Impossible1(c); % Single character check\r\n if Impossible,return;end\r\n \r\n c=clean(c); % remove passwords with duplicate letters\r\n if isempty(c) % A:Z is okay\r\n  Pstr=char(65:90); %Valid answer A:Z\r\n  return\r\n end\r\n \r\n [Impossible]=check_Impossible(c);\r\n if Impossible\r\n  Pstr='IMPOSSIBLE';\r\n  return;\r\n end\r\n \r\n% Create Valid string\r\n Pstr=make_Pstr(c);\r\nend","test_suite":"%%\r\nglobal zstart;\r\nzstart=now;\r\n%%\r\n%%\r\nm='ABCDEFGHIJKLMNOPQRSTUVWXYZ';\r\nvexp='AIMZGLDTUWKSQBVYXHRCNOEFJP';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='X';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QQ';\r\nvexp='ABCDEFGHIJKLMNOPQRSTUVWXYZ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='XYZ GCJ OMG LMAO JK';\r\nvexp='AYTKXMBFSCZWRQODUNPJEVLIHG';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AB YZ NM';\r\nvexp='AILEPCWDFKTZYJRVMUXGQOSBNH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='C PYTHON GO PERL RUBY JS';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='SUBDERMATOGLYPHIC UNCOPYRIGHTABLES';\r\nvexp='AENYGJXRTWOKCZDPLMBISHVFUQ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='EY OV OU OF OC OQ OP ED OEI EK OT OH EG ET OR EU ER EM OB OW ON OD EL OX EN EC OG EW OJ OI OM OY EP OS ES EI EV EJ OK EZ EX EQ OL EB EF EO EH EA OA OZ';\r\nvexp='GJUKHQMVZDPTFIXWLSCRYBANOE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='CO CH CT LC MC VC CR AC CU CG CJ UC BC IC CM CQ CK CV NC OC TC CZ CL CN FC QC JC CB CW CE CI CX HC WC ZC DC CY CP KC CF GC EC RC YC XC CD PC SC CS CA';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ZT XM XD ZE XZ ZI XO ZH ZB XE XY XJ ZQ ZX XI ZY ZW XH XA XK ZS XV ZM ZL ZD ZJ ZA ZF XC XN ZV ZG ZU ZN XP ZK ZC XL XT ZP XU XF XQ XW XG XB XS ZO XR ZR';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MB FR PC TJ BV XF OE LY MF VS AP DR PD HN FI XQ MG EN VC RL KP KR OV XD ME TC KQ QW RA RP HF VH VT XL ZI LZ HG OI YN CT JC RN YZ LA EO QB ZY QI AQ TU';\r\nvexp='AZOYBSTHEDWPMLCGUFNQVKJXIR';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='CR CD CJ MC CO CV IC CW TCZ CK BC EC RC CG FC NC HC KC CL OC JC CH CQ AC GC CF ZC CE PC UC CX CB CZ CN LC CP CU WC QC CI YC CT CS DC SC CA XC CY VC CM';\r\nvexp='SLZQOFHUINXWKEYDMJPGVBARTC';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='YJ OU DJ GJ OM IJ VJ PJ QJ UJ OS OC OQ LJ RJ AJ TJ OR OA OE OX OD FJ NJ OT SJ ZJ OV WJ OJ OG ON OI OY OW BJ KJ EJ CJ HJ OH OL OB OP OF XJ OZ MJ OK';\r\nvexp='JVSYWIBTLUMNDAEHFGZPCRQKXO';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='XQ EV IV IS HL GB TZ HR RN HY IG PL OA BK OI YC NC VM NF VB UT IE QR RE TD AZ YT CZ NA KJ AJ DJ MJ LM LK FO JX QL MV ZO TU OL NB AU NV ZJ ZB KC WT JP';\r\nvexp='ADTPRBMOFXHWYGCEQNSZKVLUIJ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='IV DLB IU DM DT DH ID IE IT IP DP IK IG IY IX IA IS DX IO IW IR DW IF DB IN DZ IB IH IM DF DA IL IJ DS DJ DK IZ DU IC DN DV DE IQ DQ DC DY DG DO DI DR';\r\nvexp='DLEVWYSCGXFUZOMAQBRNKTHPJI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QZ FP VB AW TL LJ AZ JI ZX SR XF RE QD KG KI MD HY DF HQ DP RA AX DL XR OT MX ZY AG BQ YP KP LS JY IO BF QI EX BZ VG PA TD ZR EC VN VM NJ RW HM EB XU';\r\nvexp='OLNUZCSTHEVRDAJPKMBWGYIQFX';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='LVPF LVR LVD LZ LF LB LVS LD LO LVK LI LP LVH LVQ LJ LVU LVX LQ LVG LM LVM LVC LG LVA LVN LVO LVW LVE LVZ LVI LK LE LVT LY LS LT LN LC LVB LX LW LH OLVP LA LVF LVJ LR LU LVPS LVY';\r\nvexp='ATYCWPFNQGHKXDBISRMJOZUVEL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AZ GZ OD JZ SD BZ QZ BD FD NZ LZ VD RZ JD HZ TZ XD ID ED AD GD TD KD OZU WD CZ KZ HD YD VZ MZ UD FZ SZ YZ WZ XZ QD MD ZD LD RD PD PZ EZ CD DZ UZ IZ ND';\r\nvexp='DKNVYCBFATUWGMRJILXPEHOZQS';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GR AO KF CG ML IY FY EK OJ XW XU ME SP LX PR MD SQ IE KL EQ AK PC SV SK TM NH AS IK OM FQ JD QX WQ CI UH GF XN LP MS LU EG IL GK ZD IQ TR JX OR ND DU';\r\nvexp='DCNYTGXBSLMIHQRJZWFPOAVEUK';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='IU IY RF XN LC MR OG ZM OH MT NO TA KR VO DH GC LN VF TO PB WV KV XE FE NC UQ SJ NL CI FL KP QY WN LI LY YH YE KE YX PJ YJ OA YO XV XF AL GK NJ DP DW';\r\nvexp='JKQSNRGAEVBFXMUCHOLPZTDIWY';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='LK PO SO LP LQOP LD IO AO LA LF FO LB LZ VO WO GO LM LO LV LT LJ DO MO LG KO JO TO ZO XO YO BO LY LN LU LQOW XLQO LC RO HO NO EO LW LS LI LE LR LH LX CO UO';\r\nvexp='OTWBHRIUMKPGXVFYDQNJSCEAZL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='RF RD IF PD SD BD AD EF FD YF MF ZF XF JD ZD CF XD TF QD CD WD LD TD VF BF HF JF ID YD AF OD PF HD NF UF GD OF QF UD DF VD KD LF ED MD SF ND WF KF GF';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='EO OV OM OT FON OF OD BO QO SO XO HO ZO LO OG AO KO ON DO VO WO MO CO OQ JO OL OZ OA NO OR OJ OK OY OI OB GO OE OC RO IO UO OW OH OX YO PO OS OP OU TO';\r\nvexp='QSTZKANWYGERCLPDXIUHJMBVFO';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GJ RN LF GK TN WB KO FC HZ JZ ST VF GT BS TP WZ OE XI MK DO MG DW EN IY ZF WD JO YS ZN HG LR KS IQ OZ KT PG XE ID GP GS RJ HJ WP PL PA FO UT NH ZQ LD';\r\nvexp='SVAHTECFDRIKUQJPBZLNMWYOXG';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='JA JY SH SN SF SB SC SE JH JP SW JS JO SG JQ SD SX SQ JW JL SL SY SP JX JE SR JI JF JV SV JM SJ SO JU JN JT SI SZ JZ SA SK SM SU JD JG ST JR JK JC JB';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HN RN WN QA TB YD LZ GB GC OC BR SV RD VY UI IX RB ON IG WQ ZO RO UF DF PZ LH HD RI MJ AG BZ LM NC KS MZ WU RM IM VT YW WA PI CI DX AV QP AP YU FP XT';\r\nvexp='AJMUPTDSXBHGQZLYREOWVCNKFI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='EU RC YT VD XW IJ XN NS QW SH YR KJ DE HD PV CW HG NF RB CI AP QY IY OD EV ZU FV GW CY QF IZ CB XM ML QG QI WG MQ TI MN IG CA HM BW XK FS XF LI NX GZ';\r\nvexp='PXYBGKHREZCVAWJMSFDTQUNLOI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MR MI HQ ZI XP OX MG KL XZ QL MB VN HO YL VI ZX HP AX CD DE WG DV EP JO CL HD KE GM NE UK PF KW ZM RE LG FY DZ OU LH EV FP DQ JL PR CT PK NH UQ HZ QW';\r\nvexp='AKRNIQBUFVYDSMJZPTWXLCOEGH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WA FT EY VK RI MD NS WZ QW PL DO SL LV WM OP HN OH JD KE OV NE TI PM RJ JL KY EA BQ XS AD VB FS XV QF GT HM MY JY FX IA XK RX GS NU KV RW BY CA GM ZO';\r\nvexp='OBXNTURDGPZCWIJHFKSYVQELAM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='IP SP BP PL PS OP YP PI NP PU PGM PT PO AP EP TP CP PH RP PY HP PZ PB DP QP KP JP UP VP PR FP PQ PX PM MP PN GP WP PD PV PW XP PJ PC PF PE PA PK LP ZP';\r\nvexp='PGXNTOZKYRHADSBLQEJFWUCVMI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MC WC LC HF AF WF YC QC TC EC SC ZF IF RC ZC AC IC GC EF OF UC KC DC PF RF XF UF FC TF YF PC JF GF BC NF HC JC LF BF VF MF NC OC SF KF QF CF VC DF XC';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='PF DF VL HY XK XQ BZ HT WM AQ LB HC LF AL JR ZB XA SQ OA EX OF JX QP MX QI OJ EN JP HS QS TV FV HU JK NJ VW PJ ZT AR YK UT ZE JF BP IM XF ZC LS EC VU';\r\nvexp='FXYZMSBVEPDRIUQHATGCNWOLKJ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='LT DL LN LA LP KL OL WL LF QL GL LG TL LR NL RL LQ IL ML PL LJ CL LS LD EL JL LC LH LM YL LW LI VL UL ZL LX FL BL LV HL AL LO LY LU LZ LE LK KSL LB XL';\r\nvexp='AKINEMBQJVPUYCDHRFGZXOTWSL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WI KW PW WX VW WQ WN WE WC HW WG DW WD WM SW WA WO MW WY WU OW WV LW RW BW NW YW WR AW WS UW JW FW WT XW WZ ZW WF QW WK WH GW IW WJ WP WL CW EW WB TW';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='BD BT BJ BUI MBUN BUQ BF BN BUS BUP BUA BW BUF BL BK BC BR BUJ FBUN BUY BP BI BH BUE BG BY BUD BO BQ BUW BM BUH YBUN BUZ BUM BUV BX BE BUR BUL BUO BUX BS BUG BUT BZ BA BV BUC BUK';\r\nvexp='ADPQETZGKJCNHOIMRSLYFWXUVB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ZT UT HT ZZ BW LT ZW QT HW VW RT SW KT OW KW QW XW DW TW GW MW FT CT EW WT YW PT NW GT IT ST IW UW DT AW BT JW JT RW ET LW OT PW CW NT VT FW MT YT XT';\r\nvexp='WEZLGIVUJCDXBSOPNYQRFMKATH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WG YM WO TJ JO TN UV OD FI RS FO MN MR YS RH ZB LF ZA SE QP OH KR KF RI ZV MF ON BN QH ME MU UE ZT GC VU ZS UP SR FU NX QX NR YL VW QF OE ZD FB GB UA';\r\nvexp='EBXPWUHKNSCLYRDAOVMJZQIGTF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AN ET HT KT DT CT FT ON GT FN JT ZT VT TN JN YN ZN XT DN UT PT YT MT WT GN KN LN XN PN UN EN ST MN RT AT QT LT RN HN QN SN IN NT BT WN IT OT CN BN VN';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='NF KU YF SF TU BF PU YU NU OF FU GF MF AU XF OU KF WU LF PF IF XU AF HF CF VU DU HU BU TF ZU WF JF UF RF ZF LU EF VF IU GU JU CU RU QU MU DF QF SU EU';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HO BA ZA SD SF ZW RE VN MO QK FI PD NC UQ PH OP HR LZ HY HZ CG YU AN MC EW QE JO UX RL ZF YK XA AV RH IA NX NG BI SG HS QG BW GJ CY QH NV FR HI PJ SH';\r\nvexp='AMITGVDKRNYFOSPECQZBJULXWH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QL QB QE QG QD QI XG XU XZ XL QF XS QY QH XA QU XT QO XK QC QR QS QT XW XH QN XY XI QM XP XB QK XV QV XF XN XM QW XO XR QX XE XQ XJ XD QJ QA QZ QP XC';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ZIWCDOJXEVLBAPMRFHT JVHQGFXCWOKUYENPDRI UIMWSROLGHNAXTJBZYVPKCDQ LOJVG YNCRGWALHVJU IQRWJH TCVIYN MNLZTGHBO VOZFGPSXKTIQNWHBEARL DEW SUIXVZMWQNGFJPEHACRYOBTL DNLHKEVABRY DWPIUEXLVQJBYGM MJCUFONTGQH XW CGVLRZXPNWKQHDBY AEXTQCD DG HWKUGSCVYJMPINXATBLOF TAVJQMXBCUWN RFBGWNSLJCUQVAKEXOIT TNAQDKJEBPCMVSWGOZXYIR RLKFO BTXKLCNOV AO LGOQXCYMP HQIXLAOB KQSP GJBSYULWTARIKFCQO DSKEHGAMWPCVZFLQTYB XU WRJ EJCOQBFPNYXIKGZS IHRTYQCVSWOLEFDK WGDBECOQMZYPU VFRMWYAJQLOX AEFNOJHKGWTXRLZIBSDM GBAI MALFKYCXHZGQVWTOEDBPSIRN POJIHBYL QCAWXZBHRTYMD UEDNYVMHQ VKBTLDH XLZYBCNFORDMASHWGE RLZDOVPUJKWMNEFSCQYIH OLCBKWQGNDZE ZACRGBYMSINWQ ZBTC AXLEBTJSCWGUFHMZQVPDKINOR SPEQFHYXRGLTC';\r\nvexp='WRYCGUVXQISNDPHAJOTMFEZLKB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QM YQ NY HI QC AQ MW LN PK WL XK TW HG DB AR RY DN ZG XO MH QZ GR DA RF KR IF ZL YN HP HL KU PT IC YB OA RJ QI PW ZF RI WS PB NZ HA MA DY WD GO GQ HW';\r\nvexp='NXLDVJKBSITYCGMFOREWPZQUAH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='VD UG JW EB UT EX ES BX GK WF VN OG US EP YU AH XJ WL SZ PZ DA IY WV PX IN VO UW RU ED KL XM DM CD LG CS KX IB AQ SH DK BA ME EO CW GC WT XT AU RL EV';\r\nvexp='PLKVYZNJHIMSTCBUAORGQFDWXE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HF XP XN HQ XH HI XS HL HT XZ HX XB HV XV HM XY XR XF HD HG HC HA XG XL XW HZ HR XI XM XE HW HB XU HY HS HU XO HK HJ HO XC XT XQ XK HE XJ HP XD HN XA';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='DJT WNR FWG QV TH GY UP WH LP YWP VY QMF QIK VR YS JP MAW BY TCN PZ NFL AG VLO YZV NJ YD UG QEK AQ DB ESY WC GF XY JVR RY ZY IYV DPH QY JSZ XEW SMK FRX GRQ NH WG PZX UZ NCM';\r\nvexp='AKSTVBFGDIWREQXNPCMZUOLJHY';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QB AU TR AJ SI BH FU KB VS FK UL QM TM GE WC OD WX RB XC JA DJ PQ FC YV WV QL CM FI CA TE UI CS GX MX WJ JC CE BU UJ OU NE XK CB LE NH QY TF TX XA UF';\r\nvexp='FVAZHLPRYUEXJMBIGQWTKDSONC';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='UYQWAJ IJEXGT RADYMIBEJFGKN OXNZH BKZ RDOJETUQKWYVHBZX AOGQLNZCEYKMJSFPURDHIT HXPRJDLNEIGVFZWQTASU EN VXKYGTOABRZDFIWLQ PJSGYZFHDILB MYHNVAESQTXUKG YLFVAWIBGREOCXSPTZUNMD UARXV ARLIFUMCXVKNOHBSPDEZTJ FMSOPJ VFXKHOGEPZYUDA DLXKUSQVBGOIZRYTEFNACWMHP QOCEJRWTIAKMFYNGPV DOSXEPFRQJZBLMGV AVF YLRVZUIHCBFKWDJGXNTOMQ RPSDQFNMKXGOYJACELV ALSOH HRTOPQAWDLBEIKFNCUZJM UWXTQCSKBZNOEYFAGLPMD VTS XB SDLUG WPFLYGACUQIXNJBMSDROEHVTZ GDQTFVSUNRPLHAJMEY XCNTI LJAXKWH WFQNXZOMJIK XAJDTRBYMVZENIKOLGCQHFW NHZMXEIVFDCSAQK BFEMAGNULJW WJRZEQHONX KOTWNQMLBHRVFSZAPYD RELGPAOJKBZTQDUSXMVFIC ZWHQKICMYJTRUBOFEGNADLSVPX ONSGXIYMHWLVR RAJ RF CPMABRIHGSLUQNTXEDOZKYWJF MFYRGICKELNSHOPAWZDBTQ OIJFSMAKGNBHRQYPTEWCLX PYRCUNWKZAQ NPMOIZQJLVTUCWRGYKSAH FXDZAMYRN';\r\nvexp='AVREHGQUFPJNLDOKXWZIMSYCTB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='CN XG KO WB TX BI LF WF XM OJ CJ JO XP VP AZ LO AL NH XI ZS FJ EQ DY FQ PS BY UJ KR RC CU KU LZ SY PE FD ZD ZA GN DL MI GZ NB AM PW IO RM SI SF VT JZ';\r\nvexp='FUVXSABDCMLKIQOGPJRNWEHYTZ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='DP VF XI BS VE WA VP WJ UQ GY CR NP MI CP LH WK EZ VR AC PH CS XB JS JN RZ EQ YA JK QE PG JV WZ QZ YH QI ES IY AG JT KY VQ GS KN GT FM KH SU PN PU RX';\r\nvexp='ATRNHSQFKZOWXYMGBIUJDVLCEP';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GF PY PC PE OF PT PZ NF PW PK WF PG CF YF PF PA TF PLFO PD PR EF PQ PN VF MF PX QF ZF BF UF KF PS PM PV PLFD PH RF PB PJ JF HF SF DF PO AF IF MPLF PU XF PI';\r\nvexp='FBTOERACUZWYJHVMIDSGKXPLQN';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='IU RT XR YA OZ OF UW VN PK WT HR PX LY ZW SZ IK BE XH VW GV NM NY GX KH UZ MS UA CQ CV VS CF IR IN OY NB NZ GR TK RP NO RJ JO CE SY LH TX QB RB VH MY';\r\nvexp='AEBZTMJUFQHPOCXISDKWLNVGYR';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='UL UO ANY GA YNE FMH PL ZHO OF KG EPK NFU OE VCS UR AM HBU NMD OUZ DY IL RI SL CPD OY AC YLE DK IR FDC IAT CZ ZPL BV XM VL XF WGU KZI DL SLN XC UGK UJ NA HZL PM TY IKW NU';\r\nvexp='LEWKQMYBNSOXVZCRJIFHPATGDU';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='BN BI BGH BGP BF JBGL BH BGS BU BS BGF BQ BE BL BV BO BGZ BP BGQ BGJ BGK BGN BT BGY BGV BGM BX BZ BGO BA BGC BR BD BGA BY BK BGI BC BGR BGLS BGE BJ BW BM BGU BGT BGW BGD BGLA BGX';\r\nvexp='AORQKWXMYGDENHIVTJUZPFCLSB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WL DK KY UK GM DB VC JR PK AJ UZ LW CT QF MH LM HX VP BO HT FO YU TZ KC NG FC PV XR QY UR FS YP ZX AR DV GP ES QB LS KA RB EZ PD UY CH BI EU IX IK SQ';\r\nvexp='ABEFHZPWRVGUJDNLTOCYISMXQK';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AX CL CX MX CZ RX CQ OX CE NX LCJX CH QX YCJX CA CB ZX CS LX PX CK CT HX DX CV WX CW CO GX CM CN YX KX CF CJXB CI IX TX FX BX CU UX CP SX CY EX VX CR CD CG';\r\nvexp='XULBSYFQVTZDKARPJHMEGNWIOC';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MB UX MF MH UH UB UT UI UQ UEJ MP MG MV UF MD UV UO MJ UR UL MA UP UD MO MY UM UA MX UW MZ US UY MK UJ UK MC MW UN MN MU MT ML MS UC MQ UG ME UZ MI MR';\r\nvexp='UEIPJXKVRBDWYQTAFSOGLCZHNM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='KE KS UV KZ EV KI KY BV NV XV MV KF KD KM KT KU RV TV KC ZV KN SV KA KV QV HV KO GV PV KL CV KQ LV KP KX KR FV IV OV JV KJ YV AV DV KH KG KW KB WV';\r\nvexp='VHRAUSYCWGJXIFEPBTDOLQZMNK';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GZ UW UR UG UO QZ DZ CZ WZ UI UZ UH EZ VZ JZ UY UP SZ UD UV UF IZ UA UT UC RZ YZ UM UK UL TZ UJ HZ AZ US UB UN UE UQ KZ OZ XZ MZ UX FZ BZ LZ PZ NZ';\r\nvexp='ZXLCVMQIGTSEJRYFAHDWNPBKOU';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='UL HA WL PA VA RA WA ZA UA AL QL JA OL KL CL DL JL GA XA EL XL IL VL YL TA BL GL YA IA EA NA HL ML FL TL MA FA ZL CA PL NL BA OA SL SA DA LA QA KA RL';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='LR FT IR RT OR XR FR XT DR ER MR NT IT PR MT UTR QR UR VR CT GT WR VT YT BT NR UT SR WT AR ZT BR QT PT HT KR ST DT GR KT JT YR LT CR AT HR ET JR OT ZR';\r\nvexp='TRHIPEYZCFXODASNLJUGKMQWVB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HP JV LC OX XA TG RK GW FP DO EL FQ PD CH EQ GU FM SA YD ZU NJ SM BR YQ KT RZ ZP XU OF MC JA CD UT FC AR ZO RE YI SH NM ZJ OY MB HK QW FN JW HC WS JF';\r\nvexp='BIJMZYPEGDKOSNQUCAHTXWLVRF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='VL LK LY XL LA LQ PL LT JL AL LZ BL LU LP RL LG CL GL QL KL LC HL NL LW LO ZL LE WL LR EL YL LX LH LD UL LM DL TL UOL LF IL SL FL LI LB LV LN LS LJ ML';\r\nvexp='AJYHPRCXMQGIEDBZSWNUFKVTOL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GS GC XQ XT GV XZ GX XO XB XF GW GK XV XW GR XI XM GB GO XA GA XP GU GT GF GM GD XS XL XY XN XG GY XH GL GH GE XD XE GZ GJ GQ XC GN XR XU GP XK GI XJ';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HW UH HC HZ WH HA HU HK HE DH AH VH HV TH HM HP HY HG XH HX LH HS HR HD QH GH KH HQ OH SH IH HJ HF FH CH RH JH HL HT HO HI NH EH ZH BH HN HB MH PH YH';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='FG IG HY JG UG TY GY XG VY ZY XY AG PY SG MG KG EG YG QY BY CG ZG RG CY NY FY SY LG LY PG WG BG VG AY NG WY DY TG IY OMY RY OG UY KY EY HG DG JY OY QG';\r\nvexp='GVUHTMYWAFLJENZBDKOSRCIPQX';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='RVELZJMSYOQUNIXTKDGHFCP XZSDNJIEKTUCMVBWF QFC IPXEBZSMDCHLQWJNUGK NEXKU FVTE QPWSFVRUBEZ XD RIOUBSFK XTUKDHORJGYPCWLNBMIVAE BMFSRUNKHOJI INZMOUAVQJ BFMWUXIQCRZNAEDHY DFHSTZNYVXEJLQRMBA RKN NBHVWTXRCPGUZ ZPCWVLYIMTXJDOFSKARQNEGU FVXZITHRCDPJE BKOEAGNXSUZCJTVQHFWDPM OVDWCNLAF HLYUJDTRF KFJU FDZBONYJCLPEHGWSVKUQMITXR EAJ ZPHIOWKTN EAISBGUDZRQKLHXTCNM RHVKBZPOADNY CIKWHQPTVJNYBOASFDZXGMRL FAXRGVWMNSHEIO JD RBHMS LWGXSDHZJ YZJICSUGDVRKBQA SNYUGPEOIQWZACVD WFXGPABYLUSIKODZTCQVNEHR BGJUQFWIZPHM SPKWETGHXBNUQAZDOVJC LOPDATIGFSNUHJQYWZRBMKXEVC XEJRGIMDHLFUYPCWKNQOBSZVTA VLIFMDAKE DIGR UGYHFRSZD GXBA TAXUGQLKH XUNIOBAYHTSPGEMQVWDRLFJK CYHQPBXVMLAOITFZD WFYKTHPEC WPRSXYGKBTMUZC HFTXMWPGECDZSLNIRYUJKO CKARHVPOZLISWFY';\r\nvexp='AOKPCBIWNMGQLFSHTXEJURZYVD';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='DO IH WO QH GH EO XH FO VH UO DH LO VO KH LHY CH UH FH JH EH TH PO BH TO YO QO IO HO JO SO XO NO GO AO BO KO WH ZO AH RH CO OH ZH SH PH NH RO MH YH MO';\r\nvexp='OSNGBDXZEKTJWIMYUQFARCPVLH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HV CJ RV VU LO OM ZG JU KL XU IT AN AJ SL DV AT CH PC UT DI EI NJ UO QL NS VI DY VZ PE XL LA YX OQ XF EK FY EF DR EM YD ZW DC TP BW MX YE WT JH WN ZM';\r\nvexp='AILHKUEVNQWMGFRBTOSXYZJCPD';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='VT VE VO GB VG CB JB VF FB QB HB NB VX VD VC SB DB VW KB VZ VJ VS VQ VU VR VK AB VB PB VP VY VI WB IB VL VN MB VA YB UB XB RB ZB TB OB LB EB VM VH';\r\nvexp='BJAIXSYPMFCHQEWDZKRUNTOLGV';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ED FR WF AO CQ IW BN BS LS HP FJ BV QM HV AV BJ HQ LN HR PE VR RE FC LF XK IQ RI XN ZK CF MP XZ QV OG TS XW FM RZ EY TM YZ BI SU SI QS YD HU CT IK UW';\r\nvexp='RHSCVQPJWLXGENIBMOTUKDZAYF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='SD OY ML SU XU YX RU XY PY HX YT WD XZ PN JV UE RO NC VY PZ QP GS JN TM SO TC SY GT NV QC FW SX GB NL ZD TX ND OA QS KA PB UB TW MB KW RV UT OJ ER BJ';\r\nvexp='ULJQNPCEMVFIDZXRWKOTAHBGYS';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='HY BY PA MY XY PN RY PS EY SY KY PJ PX IY PG PDYX ZY VY PDYG PT PB QY JY UY PL PC PY PV PM PZ PW FY PH PU PO OY PR AY TY WY PE PQ PI PK PF HPDY NY GY LY CY';\r\nvexp='DYOMIJRHUSEFKTLQBWGCVNZXAP';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='OP ZN IZV RT HSI ZHF YWC YH QY OK YOD IZ FJB FVO XPQ NQ JN ME FA REN GP QW PZH OZP DF DJ GVA YT GI LN PC RYG NJ EPO US YWL LD IQ NEY TCH BRX GB FXR AEF MO DKZ WJ IJX LZX AU';\r\nvexp='ANWMKGQJLPUXSTEBFRCHIOVDZY';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='BN NS NB MN NV NP AN LN ON ND NA NK GN HN NY NX ZN SN QN NJ NT NM YN WN PN NZ NC NQ EN JN IN UN FN NU NH XN RN KN CN NO NE VN NW NF NR NL NI DN TN NG';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='MI MD MC MA BW MO MF MW MZ MK BS BN BE BO MP MR BC BJ BH BG BY BA ABX BF MY MB BT MH MN BR ML BI MU BL BD ME BP MS BM MJ BU MG MX BK MV BZ MT MQ BV BQ';\r\nvexp='BXSUIFKHDTEYAWGOJPLZQNVCRM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='RN VQ BT QG CW UX MZ DN UA TX QB DE KC YH NJ ZI TJ TC CO VH DJ GY UE RF CF EU IH QW YL NQ KR HK QZ JM TZ RQ QC YG HC WJ QX MP YJ XQ FK SM PT WZ EY XC';\r\nvexp='CUKSFNYTELADPZVJWBORMHXIGQ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AZ NX TX SN XP HO RF JP EG DB ER UV WN IG DO BT YK EB KB DE VI RW HV TW DI FE WY VD IF UO RY GS NK GI OH WL VL WG AM NH KI EZ WQ CO LV KP QZ FS IL GC';\r\nvexp='HAVSRMOJQPYFGLUWEKZXDCTNBI';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='OF UV HL JC WK XJ EM TM UF IQ XC MH EC UM PJ HT VC JO LN NW AH PM KN BU ZJ JA RJ BT KM TR CM PW ZL NC QM TV GL AQ UE LG GH RM UR QU GW ZY FP UN QK LF';\r\nvexp='TJHUPIVKENBLDWOYZCFSXQRGAM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WS IL ID WT WD IY IT IN WF IH IQ IS WZ WO WI WM IX IP IC WG WN IE WH WA IJ WL IW ZZ WQ IM WE WX WK Z IR IZ WB WJ WC WY WP WV IU IV WU IG IK WR IO IF';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='QL UF UL VL BF YF NL IL ZF HF PF ML AF OF AL WL GF MF NF OL LF BL HL JL SL KL EL KF VF CL TL EF DL WF JF CF TF DF XF QF DGL XL RF RL YL SF IF PL FL ZL';\r\nvexp='FMQPUENTHJYRSGLIZBWDAKCVOX';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AR BH LK JL TD XK HK RK KU RW QO BZ CM IA ZR WK WL GP XJ NK TS SU DN NJ YT TJ MU UM HW CX HX EA QL QV IH NG DU IO XV DY VH AZ VB DB IG CN FQ UZ MH SZ';\r\nvexp='SBGOQCLTVPXWJFDMZNIURAEYKH';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='SKI SQ SP SE SB SU SKR SKG SKZ SKJ MSKP SKM SL SKC SC SKW SO SKA SM SI SKPT SKD SG SKO SKN NSKP SX SKH SW SR ST SD SA SV SJ SKX SH SKL SF SN SKV SZ SKB SKF SKQ SKU SKY SKE SKT SY';\r\nvexp='AZCTJGBEDFRPQILKOHUWXYMVNS';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='KE KJ WE XS UK OT GF IF VY NI ZV CL HJ AV AM MO ES QM CO ST LU CI AU JX EJ JU CB IP DL QX GL AF AD LG DG QR EQ FZ AW FY HQ AN SX MY QS MC GC LD SM QB';\r\nvexp='QVUJEPMXFODNBRCHTGIYWKSLZA';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='EA JE KN MZ TD KV NC ZG YH MO JX JC OM UI BA DH KS FL YX UT FX RF RW TG HF BJ QT ZT EC IZ QV GP CY OT EX QF ML GO LD GQ GL TB SQ WF WO GC GM MK JN NO';\r\nvexp='AZOLCRSHMFPNBUXTEYQIDWJVKG';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='XE VO CI GS AB CD LN PG FA XD KE TU XU DE AQ UD HL IB EI GY FJ OA YU MJ GT CH WO LI WQ JY UB SJ QJ ZG WI WK AL UV LX WD FQ FE KN CT XC GW RY PY MF IV';\r\nvexp='AZJCPTKSFIUORXMBEVQHYDNWLG';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='KG FS ZU JX CH PM XL IA JZ AP WD RS SX BT GC EG AW KD EL WE NH VW BJ CO DW LH PO RF AX LN OJ CB BR CX XJ IR ZY EZ RQ BZ YS WX FA KA BL VG WZ FT TN QH';\r\nvexp='ACSYROIFKEMZJULQVNDTBHPXGW';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='NMOKZL YQADTPXVMEK AVELGHMKTQRUWIFOSJNZP PNMCQGI TG UCLTEHPSYKXFRQGMWANZBIOV ZEABLRXSGHJK LXQZCJOSD PMYXVARWGUSECBHDQNZKLIFT PEBDUYHJMQI KYIXRZJTA PLOBJXE CTUPZHXI TNLMJYOCEIQGZPDABHKUV NVBGMSKFIWYZAXPRCUET JHAGRN TYCDAQHWPXK ZQXMWKHETG KWYOZMFBHVQNLCUPG FNOQAETIDVPSMLBGZCUYR FDESNRU JSBFYZ VBQSDCPMFOHKZXI DNZLJXPMSGOERVKWHAYICFBQU EAOKPHQVD VBMPYRDIT FAGXUVN TUHROSPGCDJI OHSMTCRUYVPFBAZNQGDIEJ BOFWMSC NOCUGQF XFUKMEOBZSIQNVJYPW XVIFLSAYZRDH WLZIXRAUYKFDNHB VOAJGRYDEMFBZNWISXH JLHTYUBCFZRQA RKBWNMDYJAPGVCHIOUZXTE LWPQUSBTCEIZOAVKMGYRJXFN BDKZ LEDOHPUTJNV ELIYBCSWPRNZGKJ LOSTUBYNQXVZCWRGIEPAFD MNRI UHXLNPWKDZRMBAGTYSFCJQVOI QONLSME YTXEOZURJMIDALKBVN ZKYGRMBSDLIEPFVJQOXHNCU GTRMENSDFIWBCXYAOJHPQZU ZJTXAKPIQNYMLW RWGVQITLFPOMXNCUEHD';\r\nvexp='AOMLBEFYSKCRVUXHGPQWJIDTNZ';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='JTIYSCR KYBNCVHUZOEFQGWXSRMDLT NQJEZFDWRMLAYKBVUSXPCG KLDHNEFMXYBP RMLGEPYFDT GNZXUFYTODHJVQRIMPC JDZGTRHFX ND UHOEKYVZRPSWGLJXNFQ YZRSG HVIWKTXMDFYCOSA ZODHRSGIVYALEMUQ QFLKYNJITBRACDVP FQZTVBMPLIKJXOGUHAYDCWRESN XLHRYIBUMDPCQOFN HMYTNAFKZOJLRGISCPXVEUQDBW KJOQGSIUCDYVRLATEFBWNZPHM ZAMHYSQEWCXRUNPIBDJT ZDKRHU OICRFYXWNHED TGCQYSP IBOLPZYUWJSDHNCVTMFXR WCQFXHSVRDAGEKUPNBJITMYL OLWZQBISETYJPMDNGUKF UGRWSPJADBCFNOXIEYMHTKLQV ZOEWBSRNUIYTJQDP QIBLMEHCAPDO DLCYANVBSFHWGTORK OJIZDVCMNSTPKAXUQBERYLFG DP FTKOYDSENCAQXBVJZUG WSMBGUHPAJVD NOPYILEVJ UYDXZFGJECQSIVPONBMRHLWAK KCZIPRXJQHTBAUOWVFYMLSE KXCGZVUL DXMU BKLSMCJUDQXAWPOIRZFVNTH RMABZCE PXOMV LFSGCXOMTYJEIN BLCSYFAOGDEXIPNJ VMIZKYXWNAFJHEGUPLRDSBC UD LUCGEQMOSDWVBX TZDMRJUNHLGEYIBSC XJQDPYENKRMFHUTBISA XLREUDNFOTMKWSJAPZCHIQBYV XLSKUHPOTDVZWMFANCRIEYQ CHDULZMIVXAJSYFQWGOTR';\r\nvexp='AMKVZSXCTNFLHWQRIJOGPEUBYD';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='ZO SK IC OM CO IK TI BM BO NR VH LF OP YC FM GR HV EY FQ GL MX XP KO DY MS XQ DP DC PR KF OS LU EZ UP ZT VE NA WM XW RW MN IB VY TS LK PQ JN KR XE SM';\r\nvexp='AIUXVNQWBDKETCGYRLJOFZPSHM';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='PI UZK KF YRA TF KR FPG CKH NML HX LCO RPI YRG BFY RW LK EM UGJ NR DTI JS JMV CKD ZG FO BN LZ PG NZ QZO DRH DLF TE LH JWB USX NLZ FE BMP NY ZF AJ JF CJW QDO VWM IQO XQ EU IKN';\r\nvexp='AXGMSLRUYWDITZKHVBQJPCEONF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='NM RC HM RY RW OM RU DM AM RI WM RQ RV RH XM RK RF RZ TM RG PM SM RJ IM RX VM RB RE JM RO KM RM RD RL RT RA RN LM ZM FM YM BM RS UM CM QM GM EM RP';\r\nvexp='MYHXBEFNPWQKZGODCUIAVJLSTR';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='BM BZ BR BD LA LQ LS LI BN BW LU LB LZ LK LT LG LP BI BK LW LX BT LV LE LD BCN LH BQ BV LJ BS LO BY BF BH BX BP BA BL LY LN LR BE LM LC BU BJ BO LF BG';\r\nvexp='BCSXFRHZIMVJWYEPODTAQUKGNL';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='VF QV VS VN OV VZ VY VD VM MV AV NV Z IV KV VR YV JV VX ZV BV VT VC VL RV EV VJ GV CV VI UV WV LV VK TV VQ VB VG XV VW VU VP HV VE PV VO FV VH SV DV';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='WD QPT ALC SCJ IT OF GED EU XA MLY ATE OP BK NXJ FS ZCD NOW GY IL QER UAI BJY FPB UOD XDB HYE MI FEK TI GKH UZ KR AN VNB BMH REY RQY PTZ WK MQH SR GOJ ZS UCL HCV UP EAI XWB LW OL';\r\nvexp='BNLJQDYXPUCAOGWTRMHSZKVIFE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='AB DR KM VS XD ZS BK FJ GO JI ZK JK AE TB BU GH YD ZL PL DW TI PB YZ RG SF YX AI ER KU QH QF IN WB VB RX WP SC BR DF IV ZX MA IJ ZI SY BV AN QE GW AD';\r\nvexp='DNXVASJQWGPMFLORZEKCHIYTUB';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='YE SQ XL VY LZ MB ZS OC TP ML CA AS HR HQ NV XH OX DM FJ WO LC VP CK IE HK MC EQ CF NM GD KX BR XJ RD KG ZB CT PL SE AH JV TR FQ ND US OK DN KM TU KT';\r\nvexp='KAZILWYDUTFXMNBQVESOHGPJRC';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='XD JX MX OX XP GX DX XK XY XB NX XN XT XQ PX XR XV XE XH FX CX XC XI LX XU XO YX XW HX VX XJ XA WX ZX BX QX XF XG XS IX XL UX KX RX AX EX XM XZ SX TX';\r\nvexp='IMPOSSIBLE';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='OFA OX OFQ OJ OFW OFY OW OG OFB OQ OH OFH OFR SOFV OM OFD OFP OT OI OFI OFS OZ OFL OU OK OL OFE OFJ OFZ ON OFX OFVW OFC OB OR OE HOFV OY OA OFN OFM OV OFG OC OD OP OFK OS OFU OFT';\r\nvexp='AHDSTUJGPMIRFZQKLXNBVYECWO';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n%%\r\nm='GI ZI FK FG WI PI JI FYIR FV VI FJ BI UI SI FW FC KI OI MI FQ FS FYIX EI FZ FU CI FO FA FX HI FE NI FM LI QI AI FN TI FL FR FD FI FB FYIL FT DI FH RI FP XI';\r\nvexp='IDYPQKVGBAUZNWJRSHTEMCLXOF';\r\nv=Password(m);\r\nvalid=1;\r\nif ~strcmp(unique(v),char(65:90)),valid=0;end\r\npwc=strsplit(m);\r\nfor j=1:size(pwc,2)\r\n if ~isempty(strfind(v,pwc{j}))\r\n  valid=0;\r\n  break;\r\n end;\r\nend\r\nif strcmp(vexp,'IMPOSSIBLE'),valid=strcmp(v,'IMPOSSIBLE');end\r\nassert(valid==1)\r\n\r\n%%\r\nglobal zstart\r\nzdelta=(now-zstart)*24*60*60\r\n\r\n%%\r\n%Stacy992 Solution\r\n% import java.util.*;\r\n% import java.io.*;\r\n% public class d {\r\n% \tpublic static HashMap\u003cString, Integer\u003e memo;\r\n% \tpublic static void main(String[] args){\r\n% \t\tScanner in = new Scanner(System.in);\r\n% \t\tint t = in.nextInt();\r\n% \t\tfor(int z = 1;z\u003c=t;z++){\r\n% \t\t\tint n = in.nextInt();\r\n% \t\t\tString[] words = new String[n];\r\n% \t\t\tboolean flag = false;\r\n% \t\t\tfor(int i = 0;i\u003cn;i++){\r\n% \t\t\t\twords[i] = in.next().toLowerCase();\r\n% \t\t\t\tif(words[i].length() == 1){\r\n% \t\t\t\t\tflag = true;\r\n% \t\t\t\t}\r\n% \t\t\t}\r\n% \t\t\tAhoCorasick.createAhoCorasick(words);\r\n% \t\t\tif(flag){\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": IMPOSSIBLE\");\r\n% \t\t\t\tcontinue;\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\tArrayList\u003cInteger\u003e order = new ArrayList\u003cInteger\u003e();\r\n% \t\t\tfor(int i = 0;i\u003c26;i++){\r\n% \t\t\t\torder.add(i);\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\tint steps = 10000000;\r\n% \t\t\tboolean found = false;\r\n% \t\t\twhile(steps \u003e= 0){\r\n% \t\t\t\tsteps--;\r\n% \t\t\t\tint state = 0;\r\n% \t\t\t\tboolean good = true;\r\n% \t\t\t\tfor(int i : order){\r\n% \t\t\t\t\tstate = AhoCorasick.transition[i][state];\r\n% \t\t\t\t\tif(AhoCorasick.term[state]){\r\n% \t\t\t\t\t\tgood = false;\r\n% \t\t\t\t\t\tbreak;\r\n% \t\t\t\t\t}\r\n% \t\t\t\t}\r\n% \t\t\t\tif(good){\r\n% \t\t\t\t\tfound = true;\r\n% \t\t\t\t\tbreak;\r\n% \t\t\t\t}\r\n% \t\t\t\t\r\n% \t\t\t\tCollections.shuffle(order);\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\tif(!found){\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": IMPOSSIBLE\");\r\n% \t\t\t}\r\n% \t\t\telse{\r\n% \t\t\t\tStringBuilder res = new StringBuilder(\"\");\r\n% \t\t\t\tfor(int i : order){\r\n% \t\t\t\t\tres.append((char)('A'+i));\r\n% \t\t\t\t}\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": \"+res);\r\n% \t\t\t}\r\n% \t\t\t/*memo = new HashMap\u003cString, Integer\u003e();\r\n% \t\t\tif(flag){\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": IMPOSSIBLE\");\r\n% \t\t\t\tcontinue;\r\n% \t\t\t}\r\n% \t\t\tint ans = go(0, 0);\r\n% \t\t\tif(ans == 0){\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": IMPOSSIBLE\");\r\n% \t\t\t}\r\n% \t\t\telse{\r\n% \t\t\t\tint mask = 0;\r\n% \t\t\t\tint state = 0;\r\n% \t\t\t\tStringBuilder res = new StringBuilder(\"\");\r\n% \t\t\t\twhile(mask != (1\u003c\u003c26)-1){\r\n% \t\t\t\t\tint i = memo.get(mask+\" \"+state);\r\n% \t\t\t\t\tres.append((char)('A'+i));\r\n% \t\t\t\t\tmask|=(1\u003c\u003ci);\r\n% \t\t\t\t\tstate = AhoCorasick.transition[i][state];\r\n% \t\t\t\t}\r\n% \t\t\t\tSystem.out.println(\"Case #\"+z+\": \"+res);\r\n% \t\t\t}*/\r\n% \t\t}\r\n% \t}\r\n% \t\r\n% \tpublic static int go(int mask, int state){\r\n% \t\t\r\n% \t\t\r\n% \t\tif(AhoCorasick.term[state]){\r\n% \t\t\treturn 0;\r\n% \t\t}\r\n% \t\tif(mask == (1\u003c\u003c26)-1){\r\n% \t\t\treturn 1;\r\n% \t\t}\r\n% \t\tif(memo.size() \u003e 1000000){\r\n% \t\t\treturn 0;\r\n% \t\t}\r\n% \t\t\r\n% \t\tString key = mask+\" \"+state;\r\n% \t\tif(memo.containsKey(key)){\r\n% \t\t\tif(memo.get(key).intValue() == -1){\r\n% \t\t\t\treturn 0;\r\n% \t\t\t}\r\n% \t\t\treturn 1;\r\n% \t\t}\r\n% \t\tArrayList\u003cInteger\u003e order = new ArrayList\u003cInteger\u003e();\r\n% \t\tfor(int i = 0;i\u003c26;i++){\r\n% \t\t\tif((mask \u0026 (1\u003c\u003ci)) == 0){\r\n% \t\t\t\torder.add(i);\r\n% \t\t\t}\r\n% \t\t}\r\n% \t\t\r\n% \t\tCollections.shuffle(order);\r\n% \t\tint index = -1;\r\n% \t\tint ans = 0;\r\n% \t\tfor(int i : order){\r\n% \t\t\tif((mask \u0026(1\u003c\u003ci)) == 0){\r\n% \t\t\t\tint res = go(mask|(1\u003c\u003ci), AhoCorasick.transition[i][state]);\r\n% \t\t\t\tif(res == 1){\r\n% \t\t\t\t\tans = 1;\r\n% \t\t\t\t\tindex = i;\r\n% \t\t\t\t\tbreak;\r\n% \t\t\t\t}\r\n% \t\t\t}\r\n% \t\t}\r\n% \t\tmemo.put(key, index);\r\n% \t\treturn ans;\r\n% \t}\r\n% \tpublic static class AhoCorasick\r\n% \t{\r\n% \t\tpublic static final int ALPHA = 26;\r\n% \t\t\r\n% \t\tpublic static int nodeCount;\r\n% \t\tpublic static int[][] transition;\r\n% \t\tpublic static boolean[] term;\r\n% \t\t\r\n% \t\tpublic static void createAhoCorasick(String[] strs)\r\n% \t\t{\r\n% \t\t\tint maxNodes = 1;\r\n% \t\t\tfor(String s : strs)\r\n% \t\t\t{\r\n% \t\t\t\tmaxNodes += s.length(); // This could be passed in instead\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\tint[][] children = new int[ALPHA][maxNodes];\r\n% \t\t\tboolean[] leaf = new boolean[maxNodes];\r\n% \t\t\tnodeCount = 1;\r\n% \t\t\tfor(String s : strs)\r\n% \t\t\t{\r\n% \t\t\t\tint node = 0;\r\n% \t\t\t\tfor(char ch : s.toCharArray())\r\n% \t\t\t\t{\r\n% \t\t\t\t\tint c = ch - 'a';\r\n% \t\t\t\t\tif(children[c][node] == 0)\r\n% \t\t\t\t\t{\r\n% \t\t\t\t\t\tchildren[c][node] = nodeCount;\r\n% \t\t\t\t\t\tnodeCount++;\r\n% \t\t\t\t\t}\r\n% \t\t\t\t\t\r\n% \t\t\t\t\tnode = children[c][node];\r\n% \t\t\t\t}\r\n% \t\t\t\t\r\n% \t\t\t\tleaf[node] = true;\r\n% \t\t\t}\r\n% \t\t\t\r\n% \t\t\ttransition = new int[ALPHA][nodeCount];\r\n% \t\t\tterm = new boolean[nodeCount];\r\n% \t\t\t\r\n% \t\t\tArrayDeque\u003cInteger\u003e queue = new ArrayDeque\u003cInteger\u003e();\r\n% \t\t\tqueue.add(0);\r\n% \t\t\tqueue.add(0);\r\n% \t\t\t\r\n% \t\t\twhile(queue.size() \u003e 0)\r\n% \t\t\t{\r\n% \t\t\t\tint node = queue.remove();\r\n% \t\t\t\tint suffLink = queue.remove();\r\n% \t\t\t\t\r\n% \t\t\t\tterm[node] = leaf[node] || term[suffLink];\r\n% \t\t\t\t\r\n% \t\t\t\tfor(int ch = 0; ch \u003c ALPHA; ch++)\r\n% \t\t\t\t{\r\n% \t\t\t\t\tif(children[ch][node] != 0)\r\n% \t\t\t\t\t{\r\n% \t\t\t\t\t\ttransition[ch][node] = children[ch][node];\r\n% \t\t\t\t\t\tqueue.add(children[ch][node]);\r\n% \t\t\t\t\t\tqueue.add(node == 0 ? 0 : transition[ch][suffLink]);\r\n% \t\t\t\t\t}\r\n% \t\t\t\t\telse\r\n% \t\t\t\t\t{\r\n% \t\t\t\t\t\ttransition[ch][node] = transition[ch][suffLink];\r\n% \t\t\t\t\t}\r\n% \t\t\t\t}\r\n% \t\t\t}\r\n% \t\t}\r\n% \t}\r\n% }","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":6,"test_suite_updated_at":"2016-03-25T23:43:24.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2016-03-24T05:30:35.000Z","updated_at":"2026-04-01T12:22:42.000Z","published_at":"2016-03-24T06:05:37.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=p3\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGJam March 2016 Annual I/O for Password Security\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e. This is the small-2 case of up to 50 passwords of length 1 to 26\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 a random block set A:Z exists to the child of a paranoid corporate president. He is worried that his password(s) may exist in the block pattern. Produce a 26 character block sequence that does not contain his password. If no sequence can be made that does not contain his strong password output 'IMPOSSIBLE'.\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 [PW], string up to 50 space separated passwords of 1 to 26 characters\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 [Pstr], string containing A:Z with no instance of PW or 'IMPOSSIBLE'\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 [PW] [Pstr]\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[[X] [IMPOSSIBLE] \\n[QQ][ABCDEFGHIJKLMNOPQRSTUVWXYZ]\\n['XYZ GCJ OMG LMAO JK'][ABCDEFGHIKLMNOPQRSTUVWXYJZ]]]\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\u003eTheory:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Remove Impossible cases first. Produce a PW string with a robust start/end pairs and a random middle. Try multiple formats with a timer. The most common letter can be placed at both the start and end with random internal letters. OR you can just guess for awhile and then give up. The key here is an efficient invalid string check. The IOW Champion Stacy992's java solution is in the test suite for misguidance versus the Matlab 5 line solution.\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:\"randperm\"","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:\"randperm\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"randperm\"","","\"","randperm","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f534a662458\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f534a6623b8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f534a661af8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f534a6626d8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f534a662638\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f534a662598\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f534a6624f8\u003e":"tag:\"randperm\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f534a6624f8\u003e":"tag:\"randperm\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"search","password":"J3bGPZzQ7asjJcCk","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"randperm\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"randperm\"","","\"","randperm","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f534a662458\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f534a6623b8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f534a661af8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f534a6626d8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f534a662638\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f534a662598\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f534a6624f8\u003e":"tag:\"randperm\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f534a6624f8\u003e":"tag:\"randperm\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1506,"difficulty_rating":"easy"},{"id":1646,"difficulty_rating":"easy-medium"},{"id":42782,"difficulty_rating":"medium"}]}}