{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-06T14:01:22.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-04-06T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":42914,"title":"Counting the Grand Primes","description":"A grand prime pair is a pair of primes, p1 and p2=p1+1000, such that both numbers are prime. Like a twin prime pair, where the difference is 2, the members of a grand prime pair always have a difference of 1000. Some facts about grand prime pairs, so that you can test your code:\r\n\r\n1. The smallest grand prime pair is [13,1013], the 100th such pair is [3229,4229].\r\n\r\n2. There are 37 grand prime pairs such that the larger element of the pair is no larger than 2000.\r\n\r\n3. There should be infinitely many grand prime pairs.\r\n\r\n4. All such grand prime pairs must have the property that the smaller element of the pair is of the form 6*k+1, for some integer k.\r\n\r\nWrite a function that counts the number of grand prime pairs that exist, such that the larger element of the pair is no larger than N. I'll be nice and not ask you to compute that result for N too large, 1e8 seems a reasonable upper limit.","description_html":"\u003cp\u003eA grand prime pair is a pair of primes, p1 and p2=p1+1000, such that both numbers are prime. Like a twin prime pair, where the difference is 2, the members of a grand prime pair always have a difference of 1000. Some facts about grand prime pairs, so that you can test your code:\u003c/p\u003e\u003cp\u003e1. The smallest grand prime pair is [13,1013], the 100th such pair is [3229,4229].\u003c/p\u003e\u003cp\u003e2. There are 37 grand prime pairs such that the larger element of the pair is no larger than 2000.\u003c/p\u003e\u003cp\u003e3. There should be infinitely many grand prime pairs.\u003c/p\u003e\u003cp\u003e4. All such grand prime pairs must have the property that the smaller element of the pair is of the form 6*k+1, for some integer k.\u003c/p\u003e\u003cp\u003eWrite a function that counts the number of grand prime pairs that exist, such that the larger element of the pair is no larger than N. I'll be nice and not ask you to compute that result for N too large, 1e8 seems a reasonable upper limit.\u003c/p\u003e","function_template":"function y = grandPrimeCounter(N)\r\n  y = N;\r\nend","test_suite":"%%\r\nN = 1000;\r\ny_correct = 0;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 1234;\r\ny_correct = 13;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 12345;\r\ny_correct = 280;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 123456;\r\ny_correct = 1925;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 1234567;\r\ny_correct = 13142;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 99999900;\r\ny_correct = 586509;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":544,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":63,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2016-07-22T17:41:15.000Z","updated_at":"2026-03-16T15:24:57.000Z","published_at":"2016-07-22T18:20: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\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"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\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\u003eA grand prime pair is a pair of primes, p1 and p2=p1+1000, such that both numbers are prime. Like a twin prime pair, where the difference is 2, the members of a grand prime pair always have a difference of 1000. Some facts about grand prime pairs, so that you can test your code:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1. The smallest grand prime pair is [13,1013], the 100th such pair is [3229,4229].\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2. There are 37 grand prime pairs such that the larger element of the pair is no larger than 2000.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3. There should be infinitely many grand prime pairs.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4. All such grand prime pairs must have the property that the smaller element of the pair is of the form 6*k+1, for some integer k.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eWrite a function that counts the number of grand prime pairs that exist, such that the larger element of the pair is no larger than N. I'll be nice and not ask you to compute that result for N too large, 1e8 seems a reasonable upper limit.\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":737,"title":"Criss_Cross_000 : Unique elements in a Square array","description":"Criss Cross matrix puzzle - Easy: Square matrix, Unique elements\r\n\r\nArrange the \"words\" into a solid square such that all words are used.\r\n\r\nGiven an array of row words and an array of column words make the unique Square.\r\n\r\nThere is no flipping or rotating in this simplest case.\r\n\r\nexample:\r\n\r\nM_orig =[1 2 3; 4 5 6; 7 8 9]\r\n\r\n*Inputs:*\r\n\r\nvr = [1 2 3; 4 5 6; 7 8 9]\r\n\r\nscramled gives vr =[7 8 9; 1 2 3; 4 5 6]\r\n\r\nvc =[1 2 3; 4 5 6; 7 8 9]\r\n\r\nscrambled gives vc =[3 1 2;6 4 5; 9 7 8]\r\n\r\n*Output:*\r\n\r\nM_out=[1 2 3; 4 5 6; 7 8 9]\r\n\r\nMax size : 4096\r\n\r\n\r\nThis is the first in a series of Criss Cross puzzles.\r\n\r\nFollow up puzzles will have non-unique values, non-identified row or col, and there are quite a few other variations.","description_html":"\u003cp\u003eCriss Cross matrix puzzle - Easy: Square matrix, Unique elements\u003c/p\u003e\u003cp\u003eArrange the \"words\" into a solid square such that all words are used.\u003c/p\u003e\u003cp\u003eGiven an array of row words and an array of column words make the unique Square.\u003c/p\u003e\u003cp\u003eThere is no flipping or rotating in this simplest case.\u003c/p\u003e\u003cp\u003eexample:\u003c/p\u003e\u003cp\u003eM_orig =[1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003e\u003cb\u003eInputs:\u003c/b\u003e\u003c/p\u003e\u003cp\u003evr = [1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003escramled gives vr =[7 8 9; 1 2 3; 4 5 6]\u003c/p\u003e\u003cp\u003evc =[1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003escrambled gives vc =[3 1 2;6 4 5; 9 7 8]\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eM_out=[1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003eMax size : 4096\u003c/p\u003e\u003cp\u003eThis is the first in a series of Criss Cross puzzles.\u003c/p\u003e\u003cp\u003eFollow up puzzles will have non-unique values, non-identified row or col, and there are quite a few other variations.\u003c/p\u003e","function_template":"function M_out = Criss_Cross(vr,vc)\r\n\r\n M_out=vr*0;\r\n \r\nend","test_suite":"%%\r\nformat long\r\nformat compact\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=4;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n)\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\nM_out\r\n\r\nassert(isequal(M,M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=8;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n)\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\nM_out\r\n\r\nassert(isequal(M,M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=128;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\n\r\nassert(isequal(M,M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=1024;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\n\r\nassert(isequal(M,M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=4096;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\n\r\nassert(isequal(M,M_out));","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":8,"test_suite_updated_at":"2012-06-03T20:42:28.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-06-03T18:05:05.000Z","updated_at":"2012-06-04T02:25:58.000Z","published_at":"2012-06-03T19:37:49.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\u003eCriss Cross matrix puzzle - Easy: Square matrix, Unique elements\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\u003eArrange the \\\"words\\\" into a solid square such that all words 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\u003eGiven an array of row words and an array of column words make the unique Square.\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\u003eThere is no flipping or rotating in this simplest case.\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\u003eM_orig =[1 2 3; 4 5 6; 7 8 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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInputs:\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\u003evr = [1 2 3; 4 5 6; 7 8 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\u003escramled gives vr =[7 8 9; 1 2 3; 4 5 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\u003evc =[1 2 3; 4 5 6; 7 8 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\u003escrambled gives vc =[3 1 2;6 4 5; 9 7 8]\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\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\u003eM_out=[1 2 3; 4 5 6; 7 8 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\u003eMax size : 4096\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis is the first in a series of Criss Cross puzzles.\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\u003eFollow up puzzles will have non-unique values, non-identified row or col, and there are quite a few other variations.\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":738,"title":"Criss_Cross_010 : Unique elements, Square array, Words in one array","description":"Criss Cross matrix puzzle - Square matrix, Unique elements, Single Word List\r\n\r\nArrange the \"words\" into a solid square such that all words are used.\r\n\r\nGiven an array of words make the original Square or Square Transpose.\r\n\r\nWords are left to Right or Top to Bottom. No fliplr or flipud.\r\n\r\n*Example:*\r\n\r\nM_orig = [1 2 3; 4 5 6; 7 8 9]\r\n\r\nvr = [1 2 3; 4 5 6; 7 8 9]\r\n\r\nvc = [1 2 3; 4 5 6; 7 8 9]\r\n\r\n*Inputs:*\r\n\r\nw = [1 2 3; 4 5 6; 7 8 9;1 4 7; 2 5 8; 3 6 9]\r\n\r\nsorted w gives\r\n\r\nw = [1 2 3; 1 4 7; 2 5 8; 3 6 9; 4 5 6; 7 8 9]\r\n\r\n\r\n*Output:*\r\n\r\nM_out = [1 2 3; 4 5 6; 7 8 9] or\r\n\r\nM_out=[1 4 7; 2 5 8; 3 6 9]\r\n\r\n\r\nMax size : 256\r\n\r\nThis is the second in the Criss Cross puzzles series.\r\n\r\nFollow up puzzles will have non-unique values and quite a few other variations.\r\n","description_html":"\u003cp\u003eCriss Cross matrix puzzle - Square matrix, Unique elements, Single Word List\u003c/p\u003e\u003cp\u003eArrange the \"words\" into a solid square such that all words are used.\u003c/p\u003e\u003cp\u003eGiven an array of words make the original Square or Square Transpose.\u003c/p\u003e\u003cp\u003eWords are left to Right or Top to Bottom. No fliplr or flipud.\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eM_orig = [1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003evr = [1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003evc = [1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003e\u003cb\u003eInputs:\u003c/b\u003e\u003c/p\u003e\u003cp\u003ew = [1 2 3; 4 5 6; 7 8 9;1 4 7; 2 5 8; 3 6 9]\u003c/p\u003e\u003cp\u003esorted w gives\u003c/p\u003e\u003cp\u003ew = [1 2 3; 1 4 7; 2 5 8; 3 6 9; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eM_out = [1 2 3; 4 5 6; 7 8 9] or\u003c/p\u003e\u003cp\u003eM_out=[1 4 7; 2 5 8; 3 6 9]\u003c/p\u003e\u003cp\u003eMax size : 256\u003c/p\u003e\u003cp\u003eThis is the second in the Criss Cross puzzles series.\u003c/p\u003e\u003cp\u003eFollow up puzzles will have non-unique values and quite a few other variations.\u003c/p\u003e","function_template":"function M_out = Criss_Cross(w)\r\n\r\n M_out=zeros(size(w,2));\r\n \r\nend","test_suite":"%%\r\nformat long\r\nformat compact\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed);\r\n\r\nn=4;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n)\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\nM_out=Criss_Cross(w)\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed);\r\n\r\nn=8;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n)\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\nM_out=Criss_Cross(w)\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed);\r\n\r\nn=16;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\ntic\r\nM_out=Criss_Cross(w);\r\ntoc\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed);\r\n\r\nn=16;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\ntic\r\nM_out=Criss_Cross(w);\r\ntoc\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));\r\n%%\r\nn=256;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\ntic\r\nM_out=Criss_Cross(w);\r\ntoc\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));","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":8,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-06-03T20:11:23.000Z","updated_at":"2012-06-04T02:27:22.000Z","published_at":"2012-06-03T21:38:39.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\u003eCriss Cross matrix puzzle - Square matrix, Unique elements, Single Word List\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\u003eArrange the \\\"words\\\" into a solid square such that all words 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\u003eGiven an array of words make the original Square or Square Transpose.\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\u003eWords are left to Right or Top to Bottom. No fliplr or flipud.\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:\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\u003eM_orig = [1 2 3; 4 5 6; 7 8 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\u003evr = [1 2 3; 4 5 6; 7 8 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\u003evc = [1 2 3; 4 5 6; 7 8 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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInputs:\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\u003ew = [1 2 3; 4 5 6; 7 8 9;1 4 7; 2 5 8; 3 6 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\u003esorted w gives\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\u003ew = [1 2 3; 1 4 7; 2 5 8; 3 6 9; 4 5 6; 7 8 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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eOutput:\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\u003eM_out = [1 2 3; 4 5 6; 7 8 9] or\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\u003eM_out=[1 4 7; 2 5 8; 3 6 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\u003eMax size : 256\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis is the second in the Criss Cross puzzles series.\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\u003eFollow up puzzles will have non-unique values and quite a few other variations.\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":42914,"title":"Counting the Grand Primes","description":"A grand prime pair is a pair of primes, p1 and p2=p1+1000, such that both numbers are prime. Like a twin prime pair, where the difference is 2, the members of a grand prime pair always have a difference of 1000. Some facts about grand prime pairs, so that you can test your code:\r\n\r\n1. The smallest grand prime pair is [13,1013], the 100th such pair is [3229,4229].\r\n\r\n2. There are 37 grand prime pairs such that the larger element of the pair is no larger than 2000.\r\n\r\n3. There should be infinitely many grand prime pairs.\r\n\r\n4. All such grand prime pairs must have the property that the smaller element of the pair is of the form 6*k+1, for some integer k.\r\n\r\nWrite a function that counts the number of grand prime pairs that exist, such that the larger element of the pair is no larger than N. I'll be nice and not ask you to compute that result for N too large, 1e8 seems a reasonable upper limit.","description_html":"\u003cp\u003eA grand prime pair is a pair of primes, p1 and p2=p1+1000, such that both numbers are prime. Like a twin prime pair, where the difference is 2, the members of a grand prime pair always have a difference of 1000. Some facts about grand prime pairs, so that you can test your code:\u003c/p\u003e\u003cp\u003e1. The smallest grand prime pair is [13,1013], the 100th such pair is [3229,4229].\u003c/p\u003e\u003cp\u003e2. There are 37 grand prime pairs such that the larger element of the pair is no larger than 2000.\u003c/p\u003e\u003cp\u003e3. There should be infinitely many grand prime pairs.\u003c/p\u003e\u003cp\u003e4. All such grand prime pairs must have the property that the smaller element of the pair is of the form 6*k+1, for some integer k.\u003c/p\u003e\u003cp\u003eWrite a function that counts the number of grand prime pairs that exist, such that the larger element of the pair is no larger than N. I'll be nice and not ask you to compute that result for N too large, 1e8 seems a reasonable upper limit.\u003c/p\u003e","function_template":"function y = grandPrimeCounter(N)\r\n  y = N;\r\nend","test_suite":"%%\r\nN = 1000;\r\ny_correct = 0;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 1234;\r\ny_correct = 13;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 12345;\r\ny_correct = 280;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 123456;\r\ny_correct = 1925;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 1234567;\r\ny_correct = 13142;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n\r\n%%\r\nN = 99999900;\r\ny_correct = 586509;\r\nassert(isequal(grandPrimeCounter(N),y_correct))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":544,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":63,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2016-07-22T17:41:15.000Z","updated_at":"2026-03-16T15:24:57.000Z","published_at":"2016-07-22T18:20: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\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"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\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\u003eA grand prime pair is a pair of primes, p1 and p2=p1+1000, such that both numbers are prime. Like a twin prime pair, where the difference is 2, the members of a grand prime pair always have a difference of 1000. Some facts about grand prime pairs, so that you can test your code:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1. The smallest grand prime pair is [13,1013], the 100th such pair is [3229,4229].\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2. There are 37 grand prime pairs such that the larger element of the pair is no larger than 2000.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3. There should be infinitely many grand prime pairs.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4. All such grand prime pairs must have the property that the smaller element of the pair is of the form 6*k+1, for some integer k.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eWrite a function that counts the number of grand prime pairs that exist, such that the larger element of the pair is no larger than N. I'll be nice and not ask you to compute that result for N too large, 1e8 seems a reasonable upper limit.\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":737,"title":"Criss_Cross_000 : Unique elements in a Square array","description":"Criss Cross matrix puzzle - Easy: Square matrix, Unique elements\r\n\r\nArrange the \"words\" into a solid square such that all words are used.\r\n\r\nGiven an array of row words and an array of column words make the unique Square.\r\n\r\nThere is no flipping or rotating in this simplest case.\r\n\r\nexample:\r\n\r\nM_orig =[1 2 3; 4 5 6; 7 8 9]\r\n\r\n*Inputs:*\r\n\r\nvr = [1 2 3; 4 5 6; 7 8 9]\r\n\r\nscramled gives vr =[7 8 9; 1 2 3; 4 5 6]\r\n\r\nvc =[1 2 3; 4 5 6; 7 8 9]\r\n\r\nscrambled gives vc =[3 1 2;6 4 5; 9 7 8]\r\n\r\n*Output:*\r\n\r\nM_out=[1 2 3; 4 5 6; 7 8 9]\r\n\r\nMax size : 4096\r\n\r\n\r\nThis is the first in a series of Criss Cross puzzles.\r\n\r\nFollow up puzzles will have non-unique values, non-identified row or col, and there are quite a few other variations.","description_html":"\u003cp\u003eCriss Cross matrix puzzle - Easy: Square matrix, Unique elements\u003c/p\u003e\u003cp\u003eArrange the \"words\" into a solid square such that all words are used.\u003c/p\u003e\u003cp\u003eGiven an array of row words and an array of column words make the unique Square.\u003c/p\u003e\u003cp\u003eThere is no flipping or rotating in this simplest case.\u003c/p\u003e\u003cp\u003eexample:\u003c/p\u003e\u003cp\u003eM_orig =[1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003e\u003cb\u003eInputs:\u003c/b\u003e\u003c/p\u003e\u003cp\u003evr = [1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003escramled gives vr =[7 8 9; 1 2 3; 4 5 6]\u003c/p\u003e\u003cp\u003evc =[1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003escrambled gives vc =[3 1 2;6 4 5; 9 7 8]\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eM_out=[1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003eMax size : 4096\u003c/p\u003e\u003cp\u003eThis is the first in a series of Criss Cross puzzles.\u003c/p\u003e\u003cp\u003eFollow up puzzles will have non-unique values, non-identified row or col, and there are quite a few other variations.\u003c/p\u003e","function_template":"function M_out = Criss_Cross(vr,vc)\r\n\r\n M_out=vr*0;\r\n \r\nend","test_suite":"%%\r\nformat long\r\nformat compact\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=4;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n)\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\nM_out\r\n\r\nassert(isequal(M,M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=8;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n)\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\nM_out\r\n\r\nassert(isequal(M,M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=128;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\n\r\nassert(isequal(M,M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=1024;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\n\r\nassert(isequal(M,M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed)\r\n\r\nn=4096;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvr=sortrows(vr);\r\n\r\nvc=M(:,1:n);\r\nvc=sortrows(vc')';\r\n\r\ntic\r\nM_out=Criss_Cross(vr,vc);\r\ntoc\r\n\r\nassert(isequal(M,M_out));","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":8,"test_suite_updated_at":"2012-06-03T20:42:28.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-06-03T18:05:05.000Z","updated_at":"2012-06-04T02:25:58.000Z","published_at":"2012-06-03T19:37:49.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\u003eCriss Cross matrix puzzle - Easy: Square matrix, Unique elements\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\u003eArrange the \\\"words\\\" into a solid square such that all words 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\u003eGiven an array of row words and an array of column words make the unique Square.\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\u003eThere is no flipping or rotating in this simplest case.\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\u003eM_orig =[1 2 3; 4 5 6; 7 8 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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInputs:\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\u003evr = [1 2 3; 4 5 6; 7 8 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\u003escramled gives vr =[7 8 9; 1 2 3; 4 5 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\u003evc =[1 2 3; 4 5 6; 7 8 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\u003escrambled gives vc =[3 1 2;6 4 5; 9 7 8]\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\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\u003eM_out=[1 2 3; 4 5 6; 7 8 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\u003eMax size : 4096\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis is the first in a series of Criss Cross puzzles.\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\u003eFollow up puzzles will have non-unique values, non-identified row or col, and there are quite a few other variations.\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":738,"title":"Criss_Cross_010 : Unique elements, Square array, Words in one array","description":"Criss Cross matrix puzzle - Square matrix, Unique elements, Single Word List\r\n\r\nArrange the \"words\" into a solid square such that all words are used.\r\n\r\nGiven an array of words make the original Square or Square Transpose.\r\n\r\nWords are left to Right or Top to Bottom. No fliplr or flipud.\r\n\r\n*Example:*\r\n\r\nM_orig = [1 2 3; 4 5 6; 7 8 9]\r\n\r\nvr = [1 2 3; 4 5 6; 7 8 9]\r\n\r\nvc = [1 2 3; 4 5 6; 7 8 9]\r\n\r\n*Inputs:*\r\n\r\nw = [1 2 3; 4 5 6; 7 8 9;1 4 7; 2 5 8; 3 6 9]\r\n\r\nsorted w gives\r\n\r\nw = [1 2 3; 1 4 7; 2 5 8; 3 6 9; 4 5 6; 7 8 9]\r\n\r\n\r\n*Output:*\r\n\r\nM_out = [1 2 3; 4 5 6; 7 8 9] or\r\n\r\nM_out=[1 4 7; 2 5 8; 3 6 9]\r\n\r\n\r\nMax size : 256\r\n\r\nThis is the second in the Criss Cross puzzles series.\r\n\r\nFollow up puzzles will have non-unique values and quite a few other variations.\r\n","description_html":"\u003cp\u003eCriss Cross matrix puzzle - Square matrix, Unique elements, Single Word List\u003c/p\u003e\u003cp\u003eArrange the \"words\" into a solid square such that all words are used.\u003c/p\u003e\u003cp\u003eGiven an array of words make the original Square or Square Transpose.\u003c/p\u003e\u003cp\u003eWords are left to Right or Top to Bottom. No fliplr or flipud.\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eM_orig = [1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003evr = [1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003evc = [1 2 3; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003e\u003cb\u003eInputs:\u003c/b\u003e\u003c/p\u003e\u003cp\u003ew = [1 2 3; 4 5 6; 7 8 9;1 4 7; 2 5 8; 3 6 9]\u003c/p\u003e\u003cp\u003esorted w gives\u003c/p\u003e\u003cp\u003ew = [1 2 3; 1 4 7; 2 5 8; 3 6 9; 4 5 6; 7 8 9]\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e\u003c/p\u003e\u003cp\u003eM_out = [1 2 3; 4 5 6; 7 8 9] or\u003c/p\u003e\u003cp\u003eM_out=[1 4 7; 2 5 8; 3 6 9]\u003c/p\u003e\u003cp\u003eMax size : 256\u003c/p\u003e\u003cp\u003eThis is the second in the Criss Cross puzzles series.\u003c/p\u003e\u003cp\u003eFollow up puzzles will have non-unique values and quite a few other variations.\u003c/p\u003e","function_template":"function M_out = Criss_Cross(w)\r\n\r\n M_out=zeros(size(w,2));\r\n \r\nend","test_suite":"%%\r\nformat long\r\nformat compact\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed);\r\n\r\nn=4;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n)\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\nM_out=Criss_Cross(w)\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed);\r\n\r\nn=8;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n)\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\nM_out=Criss_Cross(w)\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed);\r\n\r\nn=16;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\ntic\r\nM_out=Criss_Cross(w);\r\ntoc\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));\r\n%%\r\nseed=clock;\r\nseed=1000*seed(6);\r\nrng(seed);\r\n\r\nn=16;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\ntic\r\nM_out=Criss_Cross(w);\r\ntoc\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));\r\n%%\r\nn=256;\r\n% Create a Unique element square array\r\nM=randperm(n*n);\r\nM=reshape(M,n,n);\r\n\r\nvr=M(1:n,:);\r\nvc=M(:,1:n);\r\n\r\nw=[vr;vc'];\r\nw=sortrows(w);\r\n\r\ntic\r\nM_out=Criss_Cross(w);\r\ntoc\r\n\r\nassert(isequal(M,M_out)||isequal(M',M_out));","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":8,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-06-03T20:11:23.000Z","updated_at":"2012-06-04T02:27:22.000Z","published_at":"2012-06-03T21:38:39.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\u003eCriss Cross matrix puzzle - Square matrix, Unique elements, Single Word List\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\u003eArrange the \\\"words\\\" into a solid square such that all words 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\u003eGiven an array of words make the original Square or Square Transpose.\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\u003eWords are left to Right or Top to Bottom. No fliplr or flipud.\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:\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\u003eM_orig = [1 2 3; 4 5 6; 7 8 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\u003evr = [1 2 3; 4 5 6; 7 8 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\u003evc = [1 2 3; 4 5 6; 7 8 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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInputs:\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\u003ew = [1 2 3; 4 5 6; 7 8 9;1 4 7; 2 5 8; 3 6 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\u003esorted w gives\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\u003ew = [1 2 3; 1 4 7; 2 5 8; 3 6 9; 4 5 6; 7 8 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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eOutput:\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\u003eM_out = [1 2 3; 4 5 6; 7 8 9] or\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\u003eM_out=[1 4 7; 2 5 8; 3 6 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\u003eMax size : 256\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis is the second in the Criss Cross puzzles series.\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\u003eFollow up puzzles will have non-unique values and quite a few other variations.\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:\"intersect\"","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:\"intersect\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"intersect\"","","\"","intersect","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007ff7c6384120\u003e":null,"#\u003cMathWorks::Search::Field:0x00007ff7c6384080\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007ff7c6383680\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007ff7c63843a0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007ff7c6384300\u003e":50,"#\u003cMathWorks::Search::Field:0x00007ff7c6384260\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007ff7c63841c0\u003e":"tag:\"intersect\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007ff7c63841c0\u003e":"tag:\"intersect\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"cody-search","password":"78X075ddcV44","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"intersect\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"intersect\"","","\"","intersect","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007ff7c6384120\u003e":null,"#\u003cMathWorks::Search::Field:0x00007ff7c6384080\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007ff7c6383680\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007ff7c63843a0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007ff7c6384300\u003e":50,"#\u003cMathWorks::Search::Field:0x00007ff7c6384260\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007ff7c63841c0\u003e":"tag:\"intersect\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007ff7c63841c0\u003e":"tag:\"intersect\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":42914,"difficulty_rating":"easy-medium"},{"id":737,"difficulty_rating":"unrated"},{"id":738,"difficulty_rating":"unrated"}]}}