{"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":1097,"title":"USC Fall 2012 ACM Question A : Read Input File","description":"This Challenge is to read the Question A input text file of the \u003chttp://contest.usc.edu/index.php/Fall12/Home USC ACM Fall 2012 Contest\u003e.\r\n\r\nThe text format is: Number of sets,RowsSet1 ColsSet1,Array1, Vector1, RowsSet2 ColsSet2, Array2, Vector2\r\n\r\neg:Two data sets of arrays 3x3 and 2x4\r\n\r\n  2\r\n  3 3\r\n  000\r\n  111\r\n  110\r\n  010\r\n  2 4\r\n  1010\r\n  1100\r\n  0001\r\n\r\n\r\nThe USC input file has 17 data sets.\r\n\r\nInput: [ url_filename, k],  k= array data set to return\r\n\r\nOutput: Selected data set Array\r\n\r\nExample: [ \u003chttp://contest.usc.edu/index.php/Fall12/Home?action=download\u0026upname=codes.in.txt\u003e, 1]\r\n\r\nOutput:\r\n[0 0 0; 1 1 1; 1 1 0]\r\n\r\nHow will the Pros read and process the text file?\r\n\r\nFollow up Challenge will be solving the actual ACM question.\r\n\r\n\r\n\r\n","description_html":"\u003cp\u003eThis Challenge is to read the Question A input text file of the \u003ca href=\"http://contest.usc.edu/index.php/Fall12/Home\"\u003eUSC ACM Fall 2012 Contest\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eThe text format is: Number of sets,RowsSet1 ColsSet1,Array1, Vector1, RowsSet2 ColsSet2, Array2, Vector2\u003c/p\u003e\u003cp\u003eeg:Two data sets of arrays 3x3 and 2x4\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e2\r\n3 3\r\n000\r\n111\r\n110\r\n010\r\n2 4\r\n1010\r\n1100\r\n0001\r\n\u003c/pre\u003e\u003cp\u003eThe USC input file has 17 data sets.\u003c/p\u003e\u003cp\u003eInput: [ url_filename, k],  k= array data set to return\u003c/p\u003e\u003cp\u003eOutput: Selected data set Array\u003c/p\u003e\u003cp\u003eExample: [ \u003ca href=\"http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026amp;upname=codes.in.txt\"\u003ehttp://contest.usc.edu/index.php/Fall12/Home?action=download\u0026upname=codes.in.txt\u003c/a\u003e, 1]\u003c/p\u003e\u003cp\u003eOutput:\r\n[0 0 0; 1 1 1; 1 1 0]\u003c/p\u003e\u003cp\u003eHow will the Pros read and process the text file?\u003c/p\u003e\u003cp\u003eFollow up Challenge will be solving the actual ACM question.\u003c/p\u003e","function_template":"function A = USC_file(urlfn,ptr)\r\n% urlfn is 'http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026upname=codes.in.txt';\r\n\r\n urlwrite(urlfn,'codesinput.txt');\r\n A=[];\r\n\r\nend","test_suite":"%%\r\ntic\r\nurlfn='http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026upname=codes.in.txt';\r\nurlwrite(urlfn,'codesin_A.txt'); % Load file from USC\r\ntoc\r\n\r\nfor trial=1:3\r\n\r\n ptr=randi(17);\r\n\r\n A_USC = USC_file(urlfn,ptr);\r\n\r\n fid=fopen('codesin_A.txt','r');\r\n\r\n qty=fscanf(fid,'%i',1);\r\n for q=1:ptr\r\n  nr=fscanf(fid,'%i',1);\r\n  nc=fscanf(fid,'%i',1);\r\n \r\n  A=zeros(nr,nc);\r\n  for i=1:nr\r\n   strv=fscanf(fid,'%s',1); % Reads a line of text\r\n   A(i,:)=strv-'0'; % vectorize the string\r\n  end\r\n \r\n  strv=fscanf(fid,'%s',1);\r\n  Test=strv-'0';\r\n \r\n end\r\n fclose(fid);\r\n \r\n assert(isequal(A,A_USC))\r\n \r\nend % trial\r\n \r\n\r\ntoc\r\n\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":9,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-12-06T00:57:32.000Z","updated_at":"2012-12-06T02:39:34.000Z","published_at":"2012-12-06T02:37:29.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 to read the Question A input text file of the\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://contest.usc.edu/index.php/Fall12/Home\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eUSC ACM Fall 2012 Contest\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe text format is: Number of sets,RowsSet1 ColsSet1,Array1, Vector1, RowsSet2 ColsSet2, Array2, Vector2\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\u003eeg:Two data sets of arrays 3x3 and 2x4\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[2\\n3 3\\n000\\n111\\n110\\n010\\n2 4\\n1010\\n1100\\n0001]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe USC input file has 17 data sets.\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: [ url_filename, k], k= array data set to return\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\u003eOutput: Selected data set Array\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\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026amp;upname=codes.in.txt\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026amp;upname=codes.in.txt\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt;, 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:t\u003eOutput: [0 0 0; 1 1 1; 1 1 0]\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\u003eHow will the Pros read and process the text file?\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 Challenge will be solving the actual ACM question.\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":1097,"title":"USC Fall 2012 ACM Question A : Read Input File","description":"This Challenge is to read the Question A input text file of the \u003chttp://contest.usc.edu/index.php/Fall12/Home USC ACM Fall 2012 Contest\u003e.\r\n\r\nThe text format is: Number of sets,RowsSet1 ColsSet1,Array1, Vector1, RowsSet2 ColsSet2, Array2, Vector2\r\n\r\neg:Two data sets of arrays 3x3 and 2x4\r\n\r\n  2\r\n  3 3\r\n  000\r\n  111\r\n  110\r\n  010\r\n  2 4\r\n  1010\r\n  1100\r\n  0001\r\n\r\n\r\nThe USC input file has 17 data sets.\r\n\r\nInput: [ url_filename, k],  k= array data set to return\r\n\r\nOutput: Selected data set Array\r\n\r\nExample: [ \u003chttp://contest.usc.edu/index.php/Fall12/Home?action=download\u0026upname=codes.in.txt\u003e, 1]\r\n\r\nOutput:\r\n[0 0 0; 1 1 1; 1 1 0]\r\n\r\nHow will the Pros read and process the text file?\r\n\r\nFollow up Challenge will be solving the actual ACM question.\r\n\r\n\r\n\r\n","description_html":"\u003cp\u003eThis Challenge is to read the Question A input text file of the \u003ca href=\"http://contest.usc.edu/index.php/Fall12/Home\"\u003eUSC ACM Fall 2012 Contest\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eThe text format is: Number of sets,RowsSet1 ColsSet1,Array1, Vector1, RowsSet2 ColsSet2, Array2, Vector2\u003c/p\u003e\u003cp\u003eeg:Two data sets of arrays 3x3 and 2x4\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e2\r\n3 3\r\n000\r\n111\r\n110\r\n010\r\n2 4\r\n1010\r\n1100\r\n0001\r\n\u003c/pre\u003e\u003cp\u003eThe USC input file has 17 data sets.\u003c/p\u003e\u003cp\u003eInput: [ url_filename, k],  k= array data set to return\u003c/p\u003e\u003cp\u003eOutput: Selected data set Array\u003c/p\u003e\u003cp\u003eExample: [ \u003ca href=\"http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026amp;upname=codes.in.txt\"\u003ehttp://contest.usc.edu/index.php/Fall12/Home?action=download\u0026upname=codes.in.txt\u003c/a\u003e, 1]\u003c/p\u003e\u003cp\u003eOutput:\r\n[0 0 0; 1 1 1; 1 1 0]\u003c/p\u003e\u003cp\u003eHow will the Pros read and process the text file?\u003c/p\u003e\u003cp\u003eFollow up Challenge will be solving the actual ACM question.\u003c/p\u003e","function_template":"function A = USC_file(urlfn,ptr)\r\n% urlfn is 'http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026upname=codes.in.txt';\r\n\r\n urlwrite(urlfn,'codesinput.txt');\r\n A=[];\r\n\r\nend","test_suite":"%%\r\ntic\r\nurlfn='http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026upname=codes.in.txt';\r\nurlwrite(urlfn,'codesin_A.txt'); % Load file from USC\r\ntoc\r\n\r\nfor trial=1:3\r\n\r\n ptr=randi(17);\r\n\r\n A_USC = USC_file(urlfn,ptr);\r\n\r\n fid=fopen('codesin_A.txt','r');\r\n\r\n qty=fscanf(fid,'%i',1);\r\n for q=1:ptr\r\n  nr=fscanf(fid,'%i',1);\r\n  nc=fscanf(fid,'%i',1);\r\n \r\n  A=zeros(nr,nc);\r\n  for i=1:nr\r\n   strv=fscanf(fid,'%s',1); % Reads a line of text\r\n   A(i,:)=strv-'0'; % vectorize the string\r\n  end\r\n \r\n  strv=fscanf(fid,'%s',1);\r\n  Test=strv-'0';\r\n \r\n end\r\n fclose(fid);\r\n \r\n assert(isequal(A,A_USC))\r\n \r\nend % trial\r\n \r\n\r\ntoc\r\n\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":9,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-12-06T00:57:32.000Z","updated_at":"2012-12-06T02:39:34.000Z","published_at":"2012-12-06T02:37:29.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 to read the Question A input text file of the\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://contest.usc.edu/index.php/Fall12/Home\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eUSC ACM Fall 2012 Contest\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe text format is: Number of sets,RowsSet1 ColsSet1,Array1, Vector1, RowsSet2 ColsSet2, Array2, Vector2\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\u003eeg:Two data sets of arrays 3x3 and 2x4\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[2\\n3 3\\n000\\n111\\n110\\n010\\n2 4\\n1010\\n1100\\n0001]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe USC input file has 17 data sets.\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: [ url_filename, k], k= array data set to return\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\u003eOutput: Selected data set Array\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\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026amp;upname=codes.in.txt\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;http://contest.usc.edu/index.php/Fall12/Home?action=download\u0026amp;upname=codes.in.txt\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt;, 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:t\u003eOutput: [0 0 0; 1 1 1; 1 1 0]\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\u003eHow will the Pros read and process the text file?\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 Challenge will be solving the actual ACM question.\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:\"fall 2012\"","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:\"fall 2012\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"fall 2012\"","","\"","fall 2012","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007effc5579a60\u003e":null,"#\u003cMathWorks::Search::Field:0x00007effc55799c0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007effc5578de0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007effc5579ce0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007effc5579c40\u003e":50,"#\u003cMathWorks::Search::Field:0x00007effc5579ba0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007effc5579b00\u003e":"tag:\"fall 2012\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007effc5579b00\u003e":"tag:\"fall 2012\""},"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:\"fall 2012\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"fall 2012\"","","\"","fall 2012","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007effc5579a60\u003e":null,"#\u003cMathWorks::Search::Field:0x00007effc55799c0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007effc5578de0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007effc5579ce0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007effc5579c40\u003e":50,"#\u003cMathWorks::Search::Field:0x00007effc5579ba0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007effc5579b00\u003e":"tag:\"fall 2012\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007effc5579b00\u003e":"tag:\"fall 2012\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1097,"difficulty_rating":"easy-medium"}]}}