submission_id,user_id,create_at,language,score,problem_set_problem_id,problem_id,skill_id,code,response,time_consume,memory_consume 1178596721662128128,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-09-30 17:05:30,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/4), 4))\r\n for i in range(ceil(len(Text)/4)):\r\n for j in range(4):\r\n l[i,j] = Text[4*i+j]\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(4):\r\n for i in range(ceil(len(Text)/4)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result]\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/4), 4))\r\n for j in range(4):\r\n for i in range(ceil(len(Text)/4)):\r\n l[i,j] = next(t)\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/4)):\r\n for j in range(4):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result]\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,680,14088 1178598073289175040,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-09-30 17:10:52,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/4), 4))\r\n for i in range(ceil(len(Text)/4)):\r\n for j in range(4):\r\n try:\r\n l[i,j] = Text[4*i+j]\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(4):\r\n for i in range(ceil(len(Text)/4)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i[2]!=' ']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/4), 4))\r\n for j in range(4):\r\n for i in range(ceil(len(Text)/4)):\r\n l[i,j] = next(t)\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/4)):\r\n for j in range(4):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result]\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,682,14084 1178598307633328128,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-09-30 17:11:48,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n try:\r\n l[i,j] = Text[len(key)*i+j]\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i[2]!=' ']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n l[i,j] = next(t)\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result]\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,618,14052 1178598807640502272,3ebb5dc2158fb2b0b59131ed3788fbb55133cda2ad2791ae3d885151b6cc1784,2019-09-30 17:13:47,C++,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\nusing namespace std;\r\nint f,n;\r\nstring ans,s,c;\r\nint a[25];\r\nint main(){\r\n\tcin>>f;\r\n\tcin>>s;\r\n\tcin>>c;\r\n\tans=s;\r\n\tint l=c.size();\r\n\tif(f){\r\n\t\tstring tem=c;\r\n\t\tsort(tem.begin(),tem.end());\r\n\t\tfor(int i=0;i\r\nusing namespace std;\r\nint f,n;\r\nstring ans,s,c;\r\nint a[25];\r\nint main(){\r\n\tcin>>f;\r\n\tcin>>s;\r\n\tcin>>c;\r\n\tint l=c.size();\r\n\tif(f){\r\n\t\tstring tem=c;\r\n\t\tsort(tem.begin(),tem.end());\r\n\t\tfor(int i=0;i key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n l[i,j] = next(t)\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,629,14180 1178600058465841152,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-09-30 17:18:45,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n try:\r\n l[i,j] = Text[len(key)*i+j]\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n try:\r\n x = next(t)\r\n l[i,j] = x\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,637,14116 1178644423758344192,0680e34a1bf420102f68e76dd4dccd788e0d2451b6b5cc5a1355ebbbfb4c7c13,2019-09-30 20:15:03,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n\r\nint main ()\r\n{\r\n\tint F;\r\n\tchar S[50];\r\n\tchar K[20];\r\n\tscanf (\""%d%s%s\"",&F,S,K);\r\n\tint k=strlen(K) , length=strlen(S)/k , i=0 , j=0;\r\n\tif (strlen(S)%k)\tlength++;\r\n\t\r\n\tint matrix[length+1][k];\r\n\tfor (i=0;i= len(S):\r\n break\r\n pre_atc.append(list(S[j:j+lenth].ljust(lenth,' '))) # 把每一段文字拆解成列表,最后一行长度不够的话用0补齐（方便后面处理）\r\n j += lenth # 更新下标\r\n pre_atc = np.array(pre_atc).T # 将列表变成矩阵并转置（列转行，便于阅读）\r\n # 将重新排列之后的密文以字符串的形式传给aft_act，aft_act以列表进行保存\r\n for i in range(len(pre_atc)):\r\n str=''\r\n for j in range(len(pre_atc[i])):\r\n if pre_atc[i][j] != ' ':\r\n str += pre_atc[i][j]\r\n aft_act.append(str)\r\n key = list(K)\r\n diction = dict(zip(key, aft_act)) # 将 K 与 aft_act 合并成字典，K是key，aft_act是value\r\n for i in sorted(diction):\r\n print(diction[i], end = '') # 以字典key的顺序输出\r\n\r\n\r\ndef solve_secret(S,K):\r\n lenth = len(K)\r\n out = len(S)%len(K)\r\n pre_atc = [] # 保存密文\r\n aft_act = [] # 保存明文\r\n j = 0 # 初始化下标\r\n for i in range(len(K)):\r\n if i < out:\r\n pre_atc.append(list(S[j:j + lenth+1])) # 把每一段文字拆解成列表\r\n j += (lenth+1) # 更新下标\r\n else:\r\n pre_atc.append(list(S[j:j + lenth]+' ')) # 把每一段文字拆解成列表,不够的用空格补充\r\n j += lenth # 更新下标\r\n key = list(K)\r\n diction = dict(zip(key, pre_atc)) # 将 K 与 aft_act 合并成字典，K是key，aft_act是value\r\n temp = []\r\n # 更改顺序\r\n for i in sorted(diction):\r\n temp.append(diction[i])\r\n aft_act = np.array(temp).T # 将列表变成矩阵并转置（列转行，便于阅读)\r\n str = ''\r\n for i in range(len(aft_act)):\r\n for j in range(len(aft_act[i])):\r\n if aft_act[i][j] != ' ':\r\n str += aft_act[i][j]\r\n print(str)\r\n\r\n\r\ndef main():\r\n F = int(input())\r\n S = input()\r\n K = input()\r\n if F==1:\r\n secret(S,K)\r\n else:\r\n solve_secret(S,K)\r\n\r\nif __name__ == '__main__':\r\n main()",PARTIAL_ACCEPTED,784,14056 1178652621076721664,0680e34a1bf420102f68e76dd4dccd788e0d2451b6b5cc5a1355ebbbfb4c7c13,2019-09-30 20:47:37,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n\r\nint main ()\r\n{\r\n\tint F;\r\n\tchar S[50];\r\n\tchar K[20];\r\n\tscanf (\""%d%s%s\"",&F,S,K);\r\n\tint k=strlen(K) , length=strlen(S)/k , i=0 , j=0;\r\n\tif (strlen(S)%k)\tlength++;\r\n\t\r\n\tint matrix[length+1][k];\r\n\tfor (i=0;i\r\n#include\r\n\r\nint main ()\r\n{\r\n\tint F;\r\n\tchar S[50];\r\n\tchar K[20];\r\n\tscanf (\""%d%s%s\"",&F,S,K);\r\n\tint k=strlen(K) , length=strlen(S)/k , i=0 , j=0;\r\n\tif (strlen(S)%k)\tlength++;\r\n\t\r\n\tint matrix[length+1][k];\r\n\tfor (i=0;i key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n try:\r\n x = next(t)\r\n l[i,j] = x\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\n",PARTIAL_ACCEPTED,790,14076 1179023418920300544,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-10-01 21:21:02,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n try:\r\n l[i,j] = Text[len(key)*i+j]\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n Text = list(Text)\r\n a = len(Text) % len(key)\r\n if(a==2):\r\n Text.insert(-3,' ')\r\n if(a==3):\r\n Text.insert(-6,' ')\r\n Text.insert(-3,' ')\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n try:\r\n x = next(t)\r\n l[i,j] = x\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,614,14040 1179023538512490496,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-10-01 21:21:31,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n try:\r\n l[i,j] = Text[len(key)*i+j]\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n # Text = list(Text)\r\n # a = len(Text) % len(key)\r\n # if(a==2):\r\n # Text.insert(-3,' ')\r\n # if(a==3):\r\n # Text.insert(-6,' ')\r\n # Text.insert(-3,' ')\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n try:\r\n x = next(t)\r\n l[i,j] = x\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,818,14320 1179023612688756736,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-10-01 21:21:49,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n try:\r\n l[i,j] = Text[len(key)*i+j]\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n Text = list(Text)\r\n a = len(Text) % len(key)\r\n if(a==2):\r\n Text.insert(-3,' ')\r\n # if(a==3):\r\n # Text.insert(-6,' ')\r\n # Text.insert(-3,' ')\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n try:\r\n x = next(t)\r\n l[i,j] = x\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,594,14072 1179024691732180992,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-10-01 21:26:06,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n try:\r\n l[i,j] = Text[len(key)*i+j]\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n Text = list(Text)\r\n a = len(Text) % len(key)\r\n if(a==2):\r\n Text.insert(-3,' ')\r\n if(a==1):\r\n Text.insert(-6,' ')\r\n Text.insert(-3,' ')\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n try:\r\n x = next(t)\r\n l[i,j] = x\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,599,14044 1179030921917788160,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-10-01 21:50:51,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n try:\r\n l[i,j] = Text[len(key)*i+j]\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n Text = list(Text)\r\n a = len(Text) % len(key)\r\n rows = ceil(len(Text)/len(key))\r\n if(a==3):\r\n Text.insert(-rows,' ')\r\n if(a==2):\r\n Text.insert(-rows+1,' ')\r\n Text.append(' ')\r\n if(a==1):\r\n Text.insert(-2*(rows-1),' ')\r\n Text.insert(-rows+1,' ')\r\n Text.append(' ')\r\n t = iter(Text)\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n try:\r\n x = next(t)\r\n l[i,j] = x\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\n\r\nmode = int(input())\r\nText = input()\r\nkey = input()\r\nif mode == 1:\r\n a = encipher(Text, key)\r\n print(a)\r\nif mode == 0:\r\n b = decipher(Text, key)\r\n print(b)",PARTIAL_ACCEPTED,781,13996 1179260273448218624,4ce3e6cfb5818a0b9db9436504db777b58b06ffd5d5d8a6e1f0711a0a9e042f1,2019-10-02 13:02:13,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void){\r\n\tint F,length1,length2,c,e,f,i,j,l,k,q,t;\r\n\tchar a[20];\r\n\tchar b[20];\r\n\tchar d[20]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};\r\n\tchar g[20];\r\n\tchar p[20];\r\n\tk=0;\r\n\tscanf(\""%d%s%s\"",&F,a,b);\r\n\tlength1=strlen(a);\t\r\n\tlength2=strlen(b);\r\n\tc=length1/length2;\r\n\tif(F==1){\r\n\t\tfor(i=0;i<=length2-1;i++){\r\n\t\t\te=b[i];\r\n\t\t\tfor(j=0;j<=length2-1;j++){\r\n\t\t\t\tif(b[j]\r\n#include\r\nint main(void){\r\n\tint F,length1,length2,c,e,f,i,j,l,k,q,t;\r\n\tchar a[20];\r\n\tchar b[20];\r\n\tchar d[20]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};\r\n\tchar g[20];\r\n\tchar p[20];\r\n\tk=0;\r\n\tscanf(\""%d%s%s\"",&F,a,b);\r\n\tlength1=strlen(a);\t\r\n\tlength2=strlen(b);\r\n\tc=length1/length2+1;\r\n\tif(F==1){\r\n\t\tfor(i=0;i<=length2-1;i++){\r\n\t\t\te=b[i];\r\n\t\t\tfor(j=0;j<=length2-1;j++){\r\n\t\t\t\tif(b[j]=length1){\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tg[k]=a[j+l*length2];\r\n\t\t\t\t\t\tk+=1;\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\tprintf(\""%s\\n\"",g);\r\n\t}\r\n\tif(F==0){\r\n\t\tfor(i=0;i<=length2-1;i++){\r\n\t\t\te=b[i];\r\n\t\t\tfor(j=0;j<=length2-1;j++){\r\n\t\t\t\tif(b[j]=length1){\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tg[j+l*length2]=a[k];\r\n\t\t\t\t\t\tk+=1;\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\tprintf(\""%s\\n\"",g);\r\n\t}\r\n\r\n}",PARTIAL_ACCEPTED,10,384 1179263612294557696,4ce3e6cfb5818a0b9db9436504db777b58b06ffd5d5d8a6e1f0711a0a9e042f1,2019-10-02 13:15:29,C,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void){\r\n\tint F,length1,length2,c,e,f,i,j,l,k,q,t;\r\n\tchar a[200];\r\n\tchar b[26];\r\n\tchar d[20]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};\r\n\tchar g[200];\r\n\tk=0;\r\n\tscanf(\""%d%s%s\"",&F,a,b);\r\n\tlength1=strlen(a);\t\r\n\tlength2=strlen(b);\r\n\tc=length1/length2+1;\r\n\tif(F==1){\r\n\t\tfor(i=0;i<=length2-1;i++){\r\n\t\t\te=b[i];\r\n\t\t\tfor(j=0;j<=length2-1;j++){\r\n\t\t\t\tif(b[j]=length1){\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tg[k]=a[j+l*length2];\r\n\t\t\t\t\t\tk+=1;\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\tprintf(\""%s\\n\"",g);\r\n\t}\r\n\tif(F==0){\r\n\t\tfor(i=0;i<=length2-1;i++){\r\n\t\t\te=b[i];\r\n\t\t\tfor(j=0;j<=length2-1;j++){\r\n\t\t\t\tif(b[j]=length1){\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tg[j+l*length2]=a[k];\r\n\t\t\t\t\t\tk+=1;\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\tprintf(\""%s\\n\"",g);\r\n\t}\r\n\r\n}",PARTIAL_ACCEPTED,37,360 1179265087041204224,4ce3e6cfb5818a0b9db9436504db777b58b06ffd5d5d8a6e1f0711a0a9e042f1,2019-10-02 13:21:21,C,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void){\r\n\tint F,length1,length2,c,e,f,i,j,l,k,q,t;\r\n\tchar a[200];\r\n\tchar b[26];\r\n\tchar d[26]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};\r\n\tchar g[200];\r\n\tk=0;\r\n\tscanf(\""%d%s%s\"",&F,a,b);\r\n\tlength1=strlen(a);\t\r\n\tlength2=strlen(b);\r\n\tc=length1/length2+1;\r\n\tif(F==1){\r\n\t\tfor(i=0;i<=length2-1;i++){\r\n\t\t\te=b[i];\r\n\t\t\tfor(j=0;j<=length2-1;j++){\r\n\t\t\t\tif(b[j]=length1){\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tg[k]=a[j+l*length2];\r\n\t\t\t\t\t\tk+=1;\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\tprintf(\""%s\\n\"",g);\r\n\t}\r\n\tif(F==0){\r\n\t\tfor(i=0;i<=length2-1;i++){\r\n\t\t\te=b[i];\r\n\t\t\tfor(j=0;j<=length2-1;j++){\r\n\t\t\t\tif(b[j]=length1){\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tg[j+l*length2]=a[k];\r\n\t\t\t\t\t\tk+=1;\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\tprintf(\""%s\\n\"",g);\r\n\t}\r\n\r\n}",PARTIAL_ACCEPTED,11,384 1179265891613569024,4ce3e6cfb5818a0b9db9436504db777b58b06ffd5d5d8a6e1f0711a0a9e042f1,2019-10-02 13:24:32,C,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void){\r\n\tint F,length1,length2,c,e,f,i,j,l,k,q,t;\r\n\tchar a[200];\r\n\tchar b[26];\r\n\tchar d[26]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};\r\n\tchar g[200];\r\n\tk=0;\r\n\tscanf(\""%d%s%s\"",&F,a,b);\r\n\tlength1=strlen(a);\t\r\n\tlength2=strlen(b);\r\n\tc=length1/length2+1;\r\n\tif(F==1){\r\n\t\tfor(i=0;i<=length2-1;i++){\r\n\t\t\te=b[i];\r\n\t\t\tfor(j=0;j<=length2-1;j++){\r\n\t\t\t\tif(b[j]=length1){\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tg[k]=a[j+l*length2];\r\n\t\t\t\t\t\tk+=1;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n g[length1]='\\0';\r\n\t\tprintf(\""%s\\n\"",g);\r\n\t}\r\n\tif(F==0){\r\n\t\tfor(i=0;i<=length2-1;i++){\r\n\t\t\te=b[i];\r\n\t\t\tfor(j=0;j<=length2-1;j++){\r\n\t\t\t\tif(b[j]=length1){\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tg[j+l*length2]=a[k];\r\n\t\t\t\t\t\tk+=1;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n g[length1]='\\0';\r\n\t\tprintf(\""%s\\n\"",g);\r\n\t}\r\n\r\n}",ACCEPTED,10,384 1179644816680316928,582b5cf1d973e417960d17a24008f6bcd108acac979860ec07891007fae69bdb,2019-10-03 14:30:15,C++,6.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include\r\nusing namespace std;\r\nint main() {\r\n\tint F;\r\n\tstring str;\r\n\tstring key;\r\n\tvector A, B, E, L;\r\n\tcin >> F;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tif (F == 1) {\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) % 4 == 1) {\r\n\t\t\t\tA.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 2) {\r\n\t\t\t\tB.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 3) {\r\n\t\t\t\tE.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 0) {\r\n\t\t\t\tL.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tif (key[i] == 'A') {\r\n\t\t\t\tfor (int i = 0; i < A.size(); i++) {\r\n\t\t\t\t\tcout << A[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B') {\r\n\t\t\t\tfor (int i = 0; i < B.size(); i++) {\r\n\t\t\t\t\tcout << B[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E') {\r\n\t\t\t\tfor(int i = 0; i < E.size(); i++) {\r\n\t\t\t\t\tcout << E[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L') {\r\n\t\t\t\tfor (int i = 0; i < L.size(); i++) {\r\n\t\t\t\t\tcout << L[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse if(F == 0) {\r\n\r\n\t}\r\n}",PARTIAL_ACCEPTED,16,424 1180055347627061248,582b5cf1d973e417960d17a24008f6bcd108acac979860ec07891007fae69bdb,2019-10-04 17:41:33,C++,6.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\nint main() {\r\n\tint F;\r\n\tstring str;\r\n\tstring key;\r\n\tvector a, b, c, d;\r\n\tcin >> F;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tif (F == 1) {\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) % 4 == 1) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 2) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 3) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 0) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tif (key[i] == 'A') {\r\n\t\t\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\t\t\tcout << a[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B') {\r\n\t\t\t\tfor (int i = 0; i < b.size(); i++) {\r\n\t\t\t\t\tcout << b[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E') {\r\n\t\t\t\tfor(int i = 0; i < c.size(); i++) {\r\n\t\t\t\t\tcout << c[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L') {\r\n\t\t\t\tfor (int i = 0; i < d.size(); i++) {\r\n\t\t\t\t\tcout << d[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse if(F == 0) {\r\n\t\tint column = 0;\r\n\t\tcolumn = ceil(double(str.length()) / 4);\r\n\t\tvector> v1(4, vector(column));\r\n\t\tvector> v2(4, vector(column));\r\n\t\tcout << v1[0].size() << endl;\r\n\t\tv1[0][3] = 'a';\r\n\t\tcout << v1[0][3] << endl;\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) <= column) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > column && (i + 1) <= 2*column) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 2*column && (i + 1) <= 3 * column) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 3*column && (i + 1) <= str.length()) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\tv1[0][i] = a[i];\r\n\t\t\tv1[1][i] = b[i];\r\n\t\t\tv1[2][i] = c[i];\r\n\t\t\tv1[3][i] = d[i];\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++){\r\n\t\t\tif (key[i] == 'A'){\r\n\t\t\t\tv2[0] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B'){\r\n\t\t\t\tv2[1] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E'){\r\n\t\t\t\tv2[2] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L'){\r\n\t\t\t\tv2[3] = v1[i];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < column; i++) {\r\n\t\t\tfor (int j = 0; j < 4; j++) {\r\n\t\t\t\tcout << v2[j][i];\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}",PARTIAL_ACCEPTED,16,512 1180055457056452608,582b5cf1d973e417960d17a24008f6bcd108acac979860ec07891007fae69bdb,2019-10-04 17:41:59,C++,6.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\nint main() {\r\n\tint F;\r\n\tstring str;\r\n\tstring key;\r\n\tvector a, b, c, d;\r\n\tcin >> F;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tif (F == 1) {\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) % 4 == 1) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 2) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 3) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 0) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tif (key[i] == 'A') {\r\n\t\t\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\t\t\tcout << a[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B') {\r\n\t\t\t\tfor (int i = 0; i < b.size(); i++) {\r\n\t\t\t\t\tcout << b[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E') {\r\n\t\t\t\tfor(int i = 0; i < c.size(); i++) {\r\n\t\t\t\t\tcout << c[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L') {\r\n\t\t\t\tfor (int i = 0; i < d.size(); i++) {\r\n\t\t\t\t\tcout << d[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse if(F == 0) {\r\n\t\tint column = 0;\r\n\t\tcolumn = ceil(double(str.length()) / 4);\r\n\t\tvector> v1(4, vector(column));\r\n\t\tvector> v2(4, vector(column));\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) <= column) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > column && (i + 1) <= 2*column) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 2*column && (i + 1) <= 3 * column) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 3*column && (i + 1) <= str.length()) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\tv1[0][i] = a[i];\r\n\t\t\tv1[1][i] = b[i];\r\n\t\t\tv1[2][i] = c[i];\r\n\t\t\tv1[3][i] = d[i];\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++){\r\n\t\t\tif (key[i] == 'A'){\r\n\t\t\t\tv2[0] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B'){\r\n\t\t\t\tv2[1] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E'){\r\n\t\t\t\tv2[2] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L'){\r\n\t\t\t\tv2[3] = v1[i];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < column; i++) {\r\n\t\t\tfor (int j = 0; j < 4; j++) {\r\n\t\t\t\tcout << v2[j][i];\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}",PARTIAL_ACCEPTED,15,424 1180055903372341248,582b5cf1d973e417960d17a24008f6bcd108acac979860ec07891007fae69bdb,2019-10-04 17:43:46,C++,6.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\nint main() {\r\n\tint F;\r\n\tstring str;\r\n\tstring key;\r\n\tvector a, b, c, d;\r\n\tcin >> F;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tif (F == 1) {\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) % 4 == 1) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 2) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 3) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 0) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tif (key[i] == 'A') {\r\n\t\t\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\t\t\tcout << a[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B') {\r\n\t\t\t\tfor (int i = 0; i < b.size(); i++) {\r\n\t\t\t\t\tcout << b[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E') {\r\n\t\t\t\tfor(int i = 0; i < c.size(); i++) {\r\n\t\t\t\t\tcout << c[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L') {\r\n\t\t\t\tfor (int i = 0; i < d.size(); i++) {\r\n\t\t\t\t\tcout << d[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse if(F == 0) {\r\n\t\tint column = 0;\r\n\t\tcolumn = ceil(double(str.length()) / 4);\r\n\t\tvector> v1(4, vector(column));\r\n\t\tvector> v2(4, vector(column));\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) <= column) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > column && (i + 1) <= 2*column) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 2*column && (i + 1) <= 3 * column) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 3*column && (i + 1) <= str.length()) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\tv1[0][i] = a[i];\r\n\t\t\tv1[1][i] = b[i];\r\n\t\t\tv1[2][i] = c[i];\r\n\t\t\tv1[3][i] = d[i];\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++){\r\n\t\t\tif (key[i] == 'A'){\r\n\t\t\t\tv2[0] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B'){\r\n\t\t\t\tv2[1] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E'){\r\n\t\t\t\tv2[2] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L'){\r\n\t\t\t\tv2[3] = v1[i];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < column; i++) {\r\n\t\t\tfor (int j = 0; j < 4; j++) {\r\n\t\t\t\tcout << v2[j][i];\r\n\t\t\t}\r\n\t\t}\r\n cout<\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\nint main() {\r\n\tint F;\r\n\tstring str;\r\n\tstring key;\r\n\tvector a, b, c, d;\r\n\tcin >> F;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tif (F == 1) {\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) % 4 == 1) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 2) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 3) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 0) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tif (key[i] == 'A') {\r\n\t\t\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\t\t\tcout << a[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B') {\r\n\t\t\t\tfor (int i = 0; i < b.size(); i++) {\r\n\t\t\t\t\tcout << b[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E') {\r\n\t\t\t\tfor(int i = 0; i < c.size(); i++) {\r\n\t\t\t\t\tcout << c[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L') {\r\n\t\t\t\tfor (int i = 0; i < d.size(); i++) {\r\n\t\t\t\t\tcout << d[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse if(F == 0) {\r\n\t\tint column = 0;\r\n\t\tcolumn = ceil(double(str.length()) / 4);\r\n\t\tvector> v1(4, vector(column));\r\n\t\tvector> v2(4, vector(column));\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) <= column) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > column && (i + 1) <= 2*column) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 2*column && (i + 1) <= 3 * column) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 3*column && (i + 1) <= str.length()) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\tv1[0][i] = a[i];\r\n\t\t\tv1[1][i] = b[i];\r\n\t\t\tv1[2][i] = c[i];\r\n\t\t\tv1[3][i] = d[i];\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++){\r\n\t\t\tif (key[i] == 'A'){\r\n\t\t\t\tv2[0] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B'){\r\n\t\t\t\tv2[1] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E'){\r\n\t\t\t\tv2[2] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L'){\r\n\t\t\t\tv2[3] = v1[i];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < column; i++) {\r\n\t\t\tfor (int j = 0; j < 4; j++) {\r\n\t\t\t\tcout << v2[j][i];\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}",PARTIAL_ACCEPTED,15,512 1180675924888940544,ab254df7ae28c2b162e45f6e2f5dc697a5abb18265dde759d28cabd829c73efa,2019-10-06 10:47:31,C,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\nint main(){\r\n\tint mode=-1;\r\n\tscanf(\""%d\\n\"",&mode);\r\n\tint a[10000]={}; \r\n\tint i=-1;\r\n\tdo{\r\n\t\ti++;\r\n\t\tscanf(\""%c\"",&a[i]);\r\n\t//\tprintf(\""%c\"",a[i]);\r\n\t}while(a[i]>=65&&a[i]<=90);\r\n\t/*从a[0]开始依次读入明文，总个数即为i*/ \r\n//\tprintf(\""%c\"",a[0]);\r\n\t\r\n\t\t\r\n\tint code[28]={};\r\n\t\tint c=0;\r\n\t\tint j=1;\r\n\t\twhile(1){\r\n\t\t\tscanf(\""%c\"",&c);\r\n\t\t\tif(c<65||c>90)break; \r\n\t\t//\tprintf(\""%c \"",c);\r\n\t\t\tint C=(int)c;\r\n\t\t\tcode[C-64]=j;/*第c-64个字母是第j个出现的*/ \r\n\t\t//\tprintf(\""code[%d]=%d \"",C-64,code[C-64]);\r\n\t\t//\tprintf(\""j=%d\"",j);\r\n\t\t\tj++;\r\n\t\t\t\r\n\t\t//\tc=0;\r\n\t\t}\r\n\t\tj--;\t\r\n\t\ti/=j;/*共有j组,每组i个*/\r\n\t//\tprintf(\""j=%d,i=%d\\n\"",j,i); \r\n\t// 1 2 3 \r\n\t// A B C D E F \r\n\t// 0 3 0 2 1 0\r\n\t\r\n\tif(mode==0){\r\n\t\tint s[22]={};\r\n\t\tint m=1,n=1;\r\n\t\tfor(m=1;m<28;m++){\r\n\t\t\tif(code[m]>=1){\r\n\t\t\t\ts[n]=code[m];/*排序为第n的字母是第s[n]个出现的*/ \r\n\t\t//\t\tprintf(\""s[%d]=%d\\n\\n\\n\\n\"",n,s[n]);\r\n\t\t\t\tn++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tint t=0;\r\n\t\tfor(t=0;t\r\n#include\r\n\r\nint main ()\r\n{\r\n\tint F;\r\n\tchar S[500];\r\n\tchar K[20];\r\n\tscanf (\""%d%s%s\"",&F,S,K);\r\n\tint k=strlen(K) , length=strlen(S)/k , i=0 , j=0;\r\n\tif (strlen(S)%k)\tlength++;\r\n\t\r\n\tint matrix[length+1][k];\r\n\tfor (i=0;i\r\n#include\r\n\r\nint main ()\r\n{\r\n\tint F;\r\n\tchar S[50000];\r\n\tchar K[20];\r\n\tscanf (\""%d%s%s\"",&F,S,K);\r\n\tint k=strlen(K) , length=strlen(S)/k , i=0 , j=0;\r\n\tif (strlen(S)%k)\tlength++;\r\n\t\r\n\tint matrix[length+1][k];\r\n\tfor (i=0;i\r\n#include\r\n\r\nint main ()\r\n{\r\n\tint F;\r\n\tchar S[500000000];\r\n\tchar K[20];\r\n\tscanf (\""%d%s%s\"",&F,S,K);\r\n\tint k=strlen(K) , length=strlen(S)/k , i=0 , j=0;\r\n\tif (strlen(S)%k)\tlength++;\r\n\t\r\n\tint matrix[length+1][k];\r\n\tfor (i=0;i\r\n#include\r\n\r\nint main ()\r\n{\r\n\tint F;\r\n\tchar S[50];\r\n\tchar K[20];\r\n\tscanf (\""%d%s%s\"",&F,S,K);\r\n\tint k=strlen(K) , length=strlen(S)/k , i=0 , j=0;\r\n\tif (strlen(S)%k)\tlength++;\r\n\t\r\n\tint matrix[length+1][k];\r\n\tfor (i=0;i\r\n#include\r\n\r\nint main ()\r\n{\r\n\tint F;\r\n\tchar S[50];\r\n\tchar K[20];\r\n\tscanf (\""%d%s%s\"",&F,S,K);\r\n\tint k=strlen(K) , length=strlen(S)/k , i=0 , j=0;\r\n\tif (strlen(S)%k)\tlength++;\r\n\t\r\n\tint matrix[length+1][k];\r\n\tfor (i=0;i,COMPILE_ERROR,0,0 1182210521481113600,b3ca82c2bd2172e23900f3784b44cdf291c6c584d36e6cda5c882b257a293ce8,2019-10-10 16:25:27,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,#include,COMPILE_ERROR,0,0 1182297450444779520,4d897cfdb193660c6acb7a62ec34e04c987a5057ae85084d156ae35a5a07e7e6,2019-10-10 22:10:52,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"from math import ceil\r\nimport numpy as np\r\ndef encipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n try:\r\n l[i,j] = Text[len(key)*i+j]\r\n except:\r\n l[i,j] = ' '\r\n for i in range(len(key)):\r\n for j in range(len(key)-i-1):\r\n if key[j] > key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n l = np.chararray((ceil(len(Text)/len(key)), len(key)))\r\n for i in range(ceil(len(Text)/len(key))):\r\n for j in range(len(key)):\r\n l[i,j] = '0'\r\n a = len(Text)%len(key)\r\n b = len(key)\r\n for i in range(a):\r\n l[-i-1,-1] = '1'\r\n ptr = 0\r\n lp = 0\r\n while(ptr key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n l = [list('0'*len(key)) for i in range(ceil(len(Text)/len(key)))]\r\n a = len(Text)%len(key)\r\n b = len(key)\r\n for i in range(a):\r\n l[-i-1][-1] = '\\0'\r\n ptr = 0\r\n lp = 0\r\n while(ptr key[j+1]:\r\n temp = l.copy()[:,j]\r\n l[:,j] = l[:,j+1]\r\n l[:,j+1] = temp\r\n result = []\r\n for j in range(len(key)):\r\n for i in range(ceil(len(Text)/len(key))):\r\n result.append(str(l[i,j]))\r\n r = [i[2] for i in result if i!='']\r\n return ''.join(r)\r\n\r\ndef decipher(Text, key):\r\n l = [list('0'*len(key)) for i in range(ceil(len(Text)/len(key)))]\r\n a = ceil(len(Text)/len(key)) # 行数\r\n b = len(key) # 列数\r\n for i in range(len(Text)%len(key)):\r\n l[-1][-1-i] = '\\0'\r\n ptr = 0\r\n lp = 0\r\n while(ptr\r\n\r\nint main()\r\n{\r\n int a, b;\r\n int b=[4];\r\n char str[20]\r\n char key[20]\r\n char str2[20]\r\nscanf(\""%d\"" ,&a) ;\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]='L'){\r\nb[i-1]=3;\r\nelse if(key[i-1]='E'){\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n}\r\nif(a=1){\r\nfor(i=0; i<=3; i++){\r\nstr2[i*4]=str[b[i-1]]；\r\nstr2[i*4+1]=str[b[i-1]+4]；\r\nstr2[i*4+2]=str[b[i-1]+8];\r\nstr2[i*4+3]=str[b[i-1]+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4]；\r\nstr2[b[i]+4]=str[i*4+1]；\r\nstr2[b[i]+8]=str[*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}",COMPILE_ERROR,0,0 1182628962188947456,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-11 20:08:11,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n\r\nint main()\r\n{\r\n int a, b;\r\n int b[4];\r\n char str[20]\r\n char key[20]\r\n char str2[20]\r\nscanf(\""%d\"" ,&a) ;\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]='L'){\r\nb[i-1]=3;\r\nelse if(key[i-1]='E'){\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n}\r\nif(a=1){\r\nfor(i=0; i<=3; i++){\r\nstr2[i*4]=str[b[i-1]]；\r\nstr2[i*4+1]=str[b[i-1]+4]；\r\nstr2[i*4+2]=str[b[i-1]+8];\r\nstr2[i*4+3]=str[b[i-1]+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4]；\r\nstr2[b[i]+4]=str[i*4+1]；\r\nstr2[b[i]+8]=str[*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}",COMPILE_ERROR,0,0 1182629005130231808,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-11 20:08:21,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n\r\nint main()\r\n{\r\n int a;\r\n int b[4];\r\n char str[20]\r\n char key[20]\r\n char str2[20]\r\nscanf(\""%d\"" ,&a) ;\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]='L'){\r\nb[i-1]=3;\r\nelse if(key[i-1]='E'){\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n}\r\nif(a=1){\r\nfor(i=0; i<=3; i++){\r\nstr2[i*4]=str[b[i-1]]；\r\nstr2[i*4+1]=str[b[i-1]+4]；\r\nstr2[i*4+2]=str[b[i-1]+8];\r\nstr2[i*4+3]=str[b[i-1]+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4]；\r\nstr2[b[i]+4]=str[i*4+1]；\r\nstr2[b[i]+8]=str[*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}",COMPILE_ERROR,0,0 1182629726022037504,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-11 20:11:13,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n\r\nint main()\r\n{\r\n int a;\r\n int b[4];\r\n char str[20]\r\n char key[20]\r\n char str2[20]\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]='L'){\r\nb[i-1]=3;\r\nelse if(key[i-1]='E'){\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n}\r\nif(a=1){\r\nfor(i=0; i<=3; i++){\r\nstr2[i*4]=str[b[i-1]]；\r\nstr2[i*4+1]=str[b[i-1]+4]；\r\nstr2[i*4+2]=str[b[i-1]+8];\r\nstr2[i*4+3]=str[b[i-1]+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4]；\r\nstr2[b[i]+4]=str[i*4+1]；\r\nstr2[b[i]+8]=str[*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}",COMPILE_ERROR,0,0 1182630622512574464,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-11 20:14:47,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n\r\nint main()\r\n{ int a;\r\n int b[4];\r\n char str[20];\r\n char key[20];\r\n char str2[20];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]='L')\r\nb[i-1]=3;\r\nelse if(key[i-1]='E')\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n\r\nif(a=1){\r\nfor(i=0; i<=3; i++){\r\nstr2[i*4]=str[b[i-1]]；\r\nstr2[i*4+1]=str[b[i-1]+4]；\r\nstr2[i*4+2]=str[b[i-1]+8];\r\nstr2[i*4+3]=str[b[i-1]+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4]；\r\nstr2[b[i]+4]=str[i*4+1]；\r\nstr2[b[i]+8]=str[*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}\r\n}",COMPILE_ERROR,0,0 1182630702594420736,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-11 20:15:06,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n\r\nint main()\r\n{ int a,i;\r\n int b[4];\r\n char str[20];\r\n char key[20];\r\n char str2[20];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]='L')\r\nb[i-1]=3;\r\nelse if(key[i-1]='E')\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n\r\nif(a=1){\r\nfor(i=0; i<=3; i++){\r\nstr2[i*4]=str[b[i-1]]；\r\nstr2[i*4+1]=str[b[i-1]+4]；\r\nstr2[i*4+2]=str[b[i-1]+8];\r\nstr2[i*4+3]=str[b[i-1]+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4]；\r\nstr2[b[i]+4]=str[i*4+1]；\r\nstr2[b[i]+8]=str[*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}\r\n}",COMPILE_ERROR,0,0 1182631506701217792,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-11 20:18:17,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n\r\nint main()\r\n{ int a,i;\r\n int b[4];\r\n char str[20];\r\n char key[20];\r\n char str2[20];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]=='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]=='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]=='L')\r\nb[i-1]=3;\r\nelse if(key[i-1]=='E')\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\nstr2[i*4]=str[b[i-1]]；\r\nstr2[i*4+1]=str[b[i-1]+4]；\r\nstr2[i*4+2]=str[b[i-1]+8];\r\nstr2[i*4+3]=str[b[i-1]+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4]；\r\nstr2[b[i]+4]=str[i*4+1]；\r\nstr2[b[i]+8]=str[*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}\r\n}",COMPILE_ERROR,0,0 1182633174037721088,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-11 20:24:55,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n\r\nint main()\r\n{ int a,i,k;\r\n int b[4];\r\n char str[20];\r\n char key[20];\r\n char str2[20];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]=='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]=='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]=='L')\r\nb[i-1]=3;\r\nelse if(key[i-1]=='E')\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\n k=b[i-1];\r\nstr2[i*4]=str[k]；\r\nstr2[i*4+1]=str[k+4]；\r\nstr2[i*4+2]=str[k+8];\r\nstr2[i*4+3]=str[k+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4]；\r\nstr2[b[i]+4]=str[i*4+1]；\r\nstr2[b[i]+8]=str[*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}\r\n}",COMPILE_ERROR,0,0 1182633576397303808,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-11 20:26:31,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n\r\nint main()\r\n{ int a,i,k;\r\n int b[4];\r\n char str[20];\r\n char key[20];\r\n char str2[20];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]=='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]=='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]=='L')\r\nb[i-1]=3;\r\nelse if(key[i-1]=='E')\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\n k=b[i-1];\r\nstr2[i*4]=str[k];\r\nstr2[i*4+1]=str[k+4];\r\nstr2[i*4+2]=str[k+8];\r\nstr2[i*4+3]=str[k+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4];\r\nstr2[b[i]+4]=str[i*4+1];\r\nstr2[b[i]+8]=str[*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}\r\n}",COMPILE_ERROR,0,0 1182633828365922304,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-11 20:27:31,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n\r\nint main()\r\n{ int a,i,k;\r\n int b[4];\r\n char str[20];\r\n char key[20];\r\n char str2[20];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=1; i<=4; i++){\r\nif(key[i-1]=='A')\r\nb[i-1]=0;\r\nelse if(key[i-1]=='B')\r\nb[i-1]=1;\r\nelse if(key[i-1]=='L')\r\nb[i-1]=3;\r\nelse if(key[i-1]=='E')\r\nb[i-1]=2;\r\n}\r\n\r\n\r\n\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\n k=b[i-1];\r\nstr2[i*4]=str[k];\r\nstr2[i*4+1]=str[k+4];\r\nstr2[i*4+2]=str[k+8];\r\nstr2[i*4+3]=str[k+12];\r\n} \r\nprintf(\""%s\"",str2);\r\n}\r\nelse{for(i=0; i<=3; i++){\r\nstr2[b[i]]=str[i*4];\r\nstr2[b[i]+4]=str[i*4+1];\r\nstr2[b[i]+8]=str[i*4+2];\r\nstr2[b[i]+12]=str[i*4+3];\r\n} \r\nprintf(\""%s\"",str2);}\r\n}",MULTIPLE_ERROR,11,384 1182826885673676800,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-12 09:14:39,C++,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\t\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < content.size() / key.size(); k++)\r\n\t\t\t\t{\r\n\t\t\t\t\tdispose.push_back(content[content.size() / key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t\r\n\tfor (int i = 0; i < content.size() / key.size(); i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\t\t\tdispose.push_back(content[i + 4 * order[j] - 4]);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nint main()\r\n{\r\n\tvector v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,36,676 1182830000699371520,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-12 09:27:02,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,j;\r\n int b[4];\r\n char str;\r\n char key[20];\r\n char str2;\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=0; i<=3; i++){\r\nif(key[i]=='A')\r\nb[i]=0;\r\nelse if(key[i]=='B')\r\nb[i]=1;\r\nelse if(key[i]=='L')\r\nb[i]=3;\r\nelse if(key[i]=='E')\r\nb[i]=2;\r\n}\r\nh1=sizeof(str);\r\nh2=h1/4;\r\nh3=h1%4;\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\n k=b[i];\r\nif(k\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,j;\r\n int b[4];\r\n char str;\r\n char key[20];\r\n char str2;\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=0; i<=3; i++){\r\nif(key[i]=='A')\r\nb[i]=0;\r\nelse if(key[i]=='B')\r\nb[i]=1;\r\nelse if(key[i]=='L')\r\nb[i]=3;\r\nelse if(key[i]=='E')\r\nb[i]=2;\r\n}\r\nh1=sizeof(str);\r\nh2=h1/4;\r\nh3=h1%4;\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\n k=b[i];\r\nif(k\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,j;\r\n int b[4];\r\n char str[];\r\n char key[20];\r\n char str2[];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=0; i<=3; i++){\r\nif(key[i]=='A')\r\nb[i]=0;\r\nelse if(key[i]=='B')\r\nb[i]=1;\r\nelse if(key[i]=='L')\r\nb[i]=3;\r\nelse if(key[i]=='E')\r\nb[i]=2;\r\n}\r\nh1=sizeof(str);\r\nh2=h1/4;\r\nh3=h1%4;\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\n k=b[i];\r\nif(k\r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint ModeNumber(-1);\r\n\r\nagain:\r\n\t//cout << \""Please select the mode.\"" << endl;\r\n\t//cout << \""mode 0 for decoding, 1 for encoding\"" << endl;\r\n\tcin >> ModeNumber;\r\n\r\n\tif (ModeNumber == 0) //decode\r\n\t{\r\n\r\n\t}\r\n\telse if (ModeNumber == 1) //encode\r\n\t{\r\n\t\tstring ciphertext;\r\n\t\tstring plaintext[100];\r\n\t\tstring key;\r\n\t\tint order[20];\r\n\t\tint RowNumber;\r\n\t\t\r\n\t\tcin >> plaintext[0];\r\n\t\tcin >> key;\r\n\r\n\t\t//RowNumber = plaintext.length() / key.length;\r\n\t\t//if (RowNumber * key.length < plaintext.length)\r\n\t\t//{\r\n\t\t//\tRowNumber++;\r\n\t\t//}\r\n\r\n\t\tfor (RowNumber = 0; plaintext[RowNumber].size() > key.size(); RowNumber++)\r\n\t\t{\r\n\t\t\tplaintext[RowNumber + 1] = plaintext[RowNumber].substr(key.size());\r\n\t\t\tplaintext[RowNumber].erase(key.size());\r\n\t\t}\r\n\r\n\t\t//cout << endl;\r\n\t\t//for (int i = 0; i < 10; i++)\r\n\t\t//{\r\n\t\t//\tcout << plaintext[i] << endl;\r\n\t\t//}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length() - 1; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < key.length() - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\t//cout << key[order[j]] << \"" <-> \"" << key[order[j + 1]] << endl;\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t//for (int k = 0; k < key.length(); k++)\r\n\t\t\t//{\r\n\t\t\t//\tcout << key[order[k]];\r\n\t\t\t//}\r\n\t\t\t//cout << endl;\r\n\t\t}\r\n\t\t//for (int i = 0; i < key.length(); i++)\r\n\t\t//{\r\n\t\t//\tcout << key[order[i]];\r\n\t\t//}\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j <= RowNumber; j++)\r\n\t\t\t{\r\n\t\t\t\tcout << plaintext[j][order[i]];\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse //undefined\r\n\t{\r\n\t\tcout << \""What do u want???\"" << endl;\r\n\t\tcout << \""Please try again.\"" << endl;\r\n\t\tgoto again;\r\n\t}\r\n}\r\n\r\n",PARTIAL_ACCEPTED,16,424 1182852519883993088,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-12 10:56:31,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,j;\r\n int b[4];\r\n char str[9999];\r\n char key[20];\r\n char str2[9999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=0; i<=3; i++){\r\nif(key[i]=='A')\r\nb[i]=0;\r\nelse if(key[i]=='B')\r\nb[i]=1;\r\nelse if(key[i]=='L')\r\nb[i]=3;\r\nelse if(key[i]=='E')\r\nb[i]=2;\r\n}\r\nh1=0;\r\ni=0;\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/4;\r\nh3=h1%4;\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\n k=b[i];\r\nif(k\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,j;\r\n int b[4];\r\n char str[9999];\r\n char key[20];\r\n char str2[9999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=0; i<=3; i++){\r\nif(key[i]=='A')\r\nb[i]=0;\r\nelse if(key[i]=='B')\r\nb[i]=1;\r\nelse if(key[i]=='L')\r\nb[i]=3;\r\nelse if(key[i]=='E')\r\nb[i]=2;\r\n}\r\nh1=0;\r\ni=0;\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/4;\r\nh3=h1%4;\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\n k=b[i];\r\nif(k\r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint ModeNumber(-1);\r\n\r\nagain:\r\n\t//cout << \""Please select the mode.\"" << endl;\r\n\t//cout << \""mode 0 for decoding, 1 for encoding\"" << endl;\r\n\tcin >> ModeNumber;\r\n\r\n\tif (ModeNumber == 0) //decode\r\n\t{\r\n\t\tstring ciphertext[100];\r\n\t\tstring plaintext;\r\n\t\tstring key;\r\n\t\tint order[20];\r\n\t\tint RowNumber;\r\n\t\tint Remainder;\r\n\t\tint k(0);\r\n\r\n\t\tcin >> ciphertext[0];\r\n\t\tcin >> key;\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length() - 1; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < key.length() - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tRowNumber = ciphertext[0].length() / key.length();\r\n\t\tRemainder = ciphertext[0].length() % key.length();\r\n\t\t//cout << RowNumber << \"" \"" << Remainder << endl;\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\tif (Remainder == 0)\r\n\t\t\t{\r\n\t\t\t\tciphertext[i + 1] = ciphertext[i].substr(RowNumber);\r\n\t\t\t\tciphertext[i].erase(RowNumber);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tciphertext[i + 1] = ciphertext[i].substr(RowNumber + 1);\r\n\t\t\t\tciphertext[i].erase(RowNumber + 1);\r\n\t\t\t\tRemainder--;\r\n\t\t\t}\r\n\t\t\t//cout << ciphertext[i + 1] << endl;\r\n\t\t}\r\n\r\n\t\t//for (int i = 0; i < key.length(); i++)\r\n\t\t//{\r\n\t\t//\tcout << ciphertext[i] << endl;\r\n\t\t//}\r\n\r\n\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < key.length(); j++)\r\n\t\t\t{\r\n\t\t\t\tcout << ciphertext[order[j]][i];\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\r\n\r\n\t}\r\n\telse if (ModeNumber == 1) //encode\r\n\t{\r\n\t\tstring ciphertext;\r\n\t\tstring plaintext[100];\r\n\t\tstring key;\r\n\t\tint order[20];\r\n\t\tint RowNumber;\r\n\t\t\r\n\t\tcin >> plaintext[0];\r\n\t\tcin >> key;\r\n\r\n\t\t//RowNumber = plaintext.length() / key.length;\r\n\t\t//if (RowNumber * key.length < plaintext.length)\r\n\t\t//{\r\n\t\t//\tRowNumber++;\r\n\t\t//}\r\n\r\n\t\tfor (RowNumber = 0; plaintext[RowNumber].size() > key.size(); RowNumber++)\r\n\t\t{\r\n\t\t\tplaintext[RowNumber + 1] = plaintext[RowNumber].substr(key.size());\r\n\t\t\tplaintext[RowNumber].erase(key.size());\r\n\t\t}\r\n\r\n\t\t//cout << endl;\r\n\t\t//for (int i = 0; i < 10; i++)\r\n\t\t//{\r\n\t\t//\tcout << plaintext[i] << endl;\r\n\t\t//}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length() - 1; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < key.length() - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\t//cout << key[order[j]] << \"" <-> \"" << key[order[j + 1]] << endl;\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j <= RowNumber; j++)\r\n\t\t\t{\r\n\t\t\t\tcout << plaintext[j][order[i]];\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse //undefined\r\n\t{\r\n\t\tcout << \""What do u want???\"" << endl;\r\n\t\tcout << \""Please try again.\"" << endl;\r\n\t\tgoto again;\r\n\t}\r\n}\r\n\r\n",PARTIAL_ACCEPTED,18,424 1182876327441362944,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-12 12:31:07,C,10.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,h5,j;\r\n int b[4];\r\n char str[9999];\r\n char key[20];\r\n char str2[9999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=0; i<=3; i++){\r\nif(key[i]=='A')\r\nb[i]=0;\r\nelse if(key[i]=='B')\r\nb[i]=1;\r\nelse if(key[i]=='L')\r\nb[i]=3;\r\nelse if(key[i]=='E')\r\nb[i]=2;\r\n}\r\nh1=0;h5=0;\r\ni=0;\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/4;\r\nh3=h1%4;\r\n\r\nif(a==1){\r\nfor(i=0; i<=3; i++){\r\n k=b[i];\r\nif(k\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,h5,j,keysize;\r\n int b[4];\r\n char str[9999];\r\n char key[20];\r\n char str2[9999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\nfor(i=0; i<=keysize; i++){\r\nif(key[i]=='A')\r\nb[i]=0;\r\nelse if(key[i]=='B')\r\nb[i]=1;\r\nelse if(key[i]=='L')\r\nb[i]=3;\r\nelse if(key[i]=='E')\r\nb[i]=2;\r\n}\r\nh1=0;h5=0;\r\ni=0;\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\ni=0;\r\nwhile(str[i]>='A'&&str[i]<='Z'){i++;keysize++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i<=keysize-1; i++){\r\n k=b[i];\r\nif(k\r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint ModeNumber(-1);\r\n\r\nagain:\r\n\t//cout << \""Please select the mode.\"" << endl;\r\n\t//cout << \""mode 0 for decoding, 1 for encoding\"" << endl;\r\n\tcin >> ModeNumber;\r\n\r\n\tif (ModeNumber == 0) //decode\r\n\t{\r\n\t\tstring ciphertext[100];\r\n\t\tstring plaintext;\r\n\t\tstring key;\r\n\t\tint order[20];\r\n\t\tint RowNumber;\r\n\t\tint Remainder;\r\n\t\tint k(0);\r\n\r\n\t\tcin >> ciphertext[0];\r\n\t\tcin >> key;\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length() - 1; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < key.length() - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tRowNumber = ciphertext[0].length() / key.length();\r\n\t\tRemainder = ciphertext[0].length() % key.length();\r\n\t\t//cout << RowNumber << \"" \"" << Remainder << endl;\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\tif (Remainder == 0)\r\n\t\t\t{\r\n\t\t\t\tciphertext[i + 1] = ciphertext[i].substr(RowNumber);\r\n\t\t\t\tciphertext[i].erase(RowNumber);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tciphertext[i + 1] = ciphertext[i].substr(RowNumber + 1);\r\n\t\t\t\tciphertext[i].erase(RowNumber + 1);\r\n\t\t\t\tRemainder--;\r\n\t\t\t}\r\n\t\t\t//cout << ciphertext[i + 1] << endl;\r\n\t\t}\r\n\r\n\t\t//for (int i = 0; i < key.length(); i++)\r\n\t\t//{\r\n\t\t//\tcout << ciphertext[i] << endl;\r\n\t\t//}\r\n\r\n\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < key.length(); j++)\r\n\t\t\t{\r\n\t\t\t\tcout << ciphertext[order[j]][i];\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\r\n\r\n\t}\r\n\telse if (ModeNumber == 1) //encode\r\n\t{\r\n\t\tstring ciphertext;\r\n\t\tstring plaintext[100];\r\n\t\tstring key;\r\n\t\tint order[20];\r\n\t\tint RowNumber;\r\n\t\t\r\n\t\tcin >> plaintext[0];\r\n\t\tcin >> key;\r\n\r\n\t\tint Remainder = plaintext[0].length() % key.length();\r\n\t\t//RowNumber = plaintext.length() / key.length;\r\n\t\t//if (RowNumber * key.length < plaintext.length)\r\n\t\t//{\r\n\t\t//\tRowNumber++;\r\n\t\t//}\r\n\r\n\t\tfor (RowNumber = 0; plaintext[RowNumber].size() > key.size(); RowNumber++)\r\n\t\t{\r\n\t\t\tplaintext[RowNumber + 1] = plaintext[RowNumber].substr(key.size());\r\n\t\t\tplaintext[RowNumber].erase(key.size());\r\n\t\t}\r\n\t\t//cout << RowNumber << endl;\r\n\r\n\t\t//cout << endl;\r\n\t\t//for (int i = 0; i < 10; i++)\r\n\t\t//{\r\n\t\t//\tcout << plaintext[i] << endl;\r\n\t\t//}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length() - 1; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < key.length() - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\t//cout << key[order[j]] << \"" <-> \"" << key[order[j + 1]] << endl;\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++)\r\n\t\t{\r\n\t\t\tif (Remainder > 0)\r\n\t\t\t{\r\n\t\t\t\tfor (int j = 0; j <= RowNumber; j++)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << plaintext[j][order[i]];\r\n\t\t\t\t}\r\n\t\t\t\tRemainder--;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << plaintext[j][order[i]];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse //undefined\r\n\t{\r\n\t\tcout << \""What do u want???\"" << endl;\r\n\t\tcout << \""Please try again.\"" << endl;\r\n\t\tgoto again;\r\n\t}\r\n}\r\n\r\n",PARTIAL_ACCEPTED,20,428 1182893777021071360,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-12 13:40:27,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,h5,j,keysize,temp;\r\n int b[20];\r\n char str[99999];\r\n char key[20];\r\n char str2[99999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;\r\nwhile(str[i]>='A'&&str[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j])b[i]++;\r\n}\r\n}\r\nh1=0;h5=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i<=keysize-1; i++){\r\n k=b[i];\r\nif(kb2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=1;}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tint z=0;\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;ib2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=b2.charAt(i*y+j);}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;ib2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=1;}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tint z=0;\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;ib2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=b2.charAt(i*y+j);}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;ib2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=1;}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tint z=0;\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;ib2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=b2.charAt(i*y+j);}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;ib2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=1;}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tint z=0;\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;ib2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=b2.charAt(i*y+j);}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;ib2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=1;}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tint z=0;\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;ib2.length()) {m[i][j]=0;}\r\n\t\t\t\t\telse {m[i][j]=b2.charAt(i*y+j);}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor(int j:r) {\r\n\t\t\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,h5,j,keysize;\r\n int b[20];\r\n char str[99999];\r\n char key[20];\r\n char str2[99999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(str[i]>='A'&&str[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j])b[i]++;\r\n}\r\n}\r\nh1=0;h5=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i<=keysize-1; i++){\r\n k=b[i];\r\nif(k=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for m in range(n1):\r\n for j in range(n):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,111,3344 1183587053751631872,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 11:35:17,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for m in range(n1):\r\n for j in range(n):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,134,3228 1183587075415212032,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 11:35:23,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for m in range(n1):\r\n for j in range(n):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,120,3320 1183587084533628928,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 11:35:25,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for m in range(n1):\r\n for j in range(n):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,147,3228 1183594640379346944,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:05:26,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,97,3316 1183594697174417408,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:05:40,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,143,3228 1183594818146533376,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:06:09,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S)&&len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),NON_ZERO_EXIT_CODE,115,3352 1183594861603717120,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:06:19,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S)&len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,124,3244 1183594925499744256,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:06:34,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,97,3316 1183595654163595264,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:09:28,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,91,3312 1183602853678022656,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:38:04,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n1):\r\n for m in range(n):\r\n a = k.index(j) + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,122,3228 1183603020959449088,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:38:44,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n):\r\n for m in range(n):\r\n a = k.index(j) + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,100,3212 1183603042472034304,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:38:49,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n):\r\n for m in range(n):\r\n a = k.index(j) + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,105,3228 1183603778685632512,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:41:45,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n):\r\n for m in range(n):\r\n a = k.index(j) + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,101,3316 1183603811619307520,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:41:53,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n):\r\n for m in range(n):\r\n a = k.index(j) + k.index(m)*n\r\n if len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,120,3228 1183604355779919872,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:44:03,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n):\r\n for m in range(n):\r\n a = k.index(j) + k.index(m)*n\r\n if a>=len(S)||len(S1)>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),NON_ZERO_EXIT_CODE,123,3188 1183604419743055872,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:44:18,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n):\r\n for m in range(n):\r\n a = k.index(j) + k.index(m)*n\r\n if (a>=len(S))||(len(S1)>=len(S)):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),NON_ZERO_EXIT_CODE,144,3316 1183604659422363648,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:45:15,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n):\r\n for m in range(n):\r\n a = k.index(j) + k.index(m)*n\r\n if (a>=len(S))|(len(S1)>=len(S)):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,106,3188 1183604836413603840,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 12:45:57,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K.index(K1[i]))\r\nn1 = len(S)//n + 1\r\nif F == 1:\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n for j in range(n):\r\n for m in range(n):\r\n a = j + k.index(m)*n\r\n if (a>=len(S))|(len(S1)>=len(S)):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,92,3220 1183609644935675904,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:05:04,Python,10.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == m+1:\r\n n1 = n1-1\r\n \r\n else:\r\n n1 = len(S)\r\n for j in range(n):\r\n for m in range(n):\r\n a = j + k.index(m)*n1\r\n if (a>=len(S))|(len(S1)>=len(S)):\r\n break\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,182,3248 1183611907401973760,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:14:03,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == j+1:\r\n n1 = n1-1\r\n a = k.index(j) + k[j]*n1\r\n \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[j]*n1\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,134,3188 1183612650901078016,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:17:00,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == j+1:\r\n n1 = n1-1\r\n a = k.index(j) + k[j]*n1\r\n \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = m + k[j]*n1\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,98,3188 1183616440253415424,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:32:04,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == j+1:\r\n n1 = n1-1\r\n a = k.index(j) + k[j]*n1\r\n \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,112,3228 1183616519739670528,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:32:23,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == j+1:\r\n n1 = n1-1\r\n a = k.index(j) + k[j]*n1\r\n \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,109,3316 1183616588136185856,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:32:39,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == j+1:\r\n n1 = n1-1\r\n a = k.index(j) + k[j]*n1\r\n \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1),PARTIAL_ACCEPTED,98,3328 1183622167097376768,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:54:49,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n S1_last = ''\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for l in range(n2):\r\n \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1),NON_ZERO_EXIT_CODE,138,3228 1183622264631721984,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:55:12,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n S1_last = ''\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for l in range(n2)\r\n\r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1),NON_ZERO_EXIT_CODE,140,3228 1183622376766439424,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:55:39,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == j+1:\r\n n1 = n1-1\r\n a = k.index(j) + k[j]*n1\r\n \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n,PARTIAL_ACCEPTED,112,3228 1183622431774736384,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 13:55:52,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == j+1:\r\n n1 = n1-1\r\n a = k.index(j) + k[j]*n1\r\n \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n,PARTIAL_ACCEPTED,120,3228 1183625234882625536,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 14:07:00,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n + 1\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == j+1:\r\n n1 = n1-1\r\n a = k.index(j) + k[j]*n1\r\n S1 = S1 + S[a]\r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n,PARTIAL_ACCEPTED,106,3316 1183625521856905216,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 14:08:09,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n \r\n b = 0\r\n for j in range(n1):\r\n for m in range(n):\r\n if n2 == j+1:\r\n n1 = n1-1\r\n a = k.index(j) + k[j]*n1 + b\r\n S1 = S1 + S[a]\r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n,PARTIAL_ACCEPTED,94,3316 1183627933359407104,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 14:17:44,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n\r\n S1 = S\r\n for l in range(n2):\r\n S1[len(S)-n2+l]=S[] \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n,NON_ZERO_EXIT_CODE,141,3228 1183627979232509952,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 14:17:55,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n\r\n S1 = S\r\n\r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n,PARTIAL_ACCEPTED,116,3228 1183628015643262976,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 14:18:03,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n\r\n S1 = S\r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n,PARTIAL_ACCEPTED,93,3220 1183628145213702144,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 14:18:34,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n\r\n S1 = S\r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n,PARTIAL_ACCEPTED,96,3228 1183641424589881344,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 15:11:20,Python,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n\r\n k1 = []\r\n S2 = list(S)\r\n S1_last = []\r\n for i in range(n2):\r\n k1.append(k[i])\r\n k1.sort()\r\n for j in range(n2):\r\n S1_last.append(S2.pop(n1*(k1[j]+1)))\r\n S1_last = \""\"".join(S1_last)\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S2[a]\r\n S1=S1+S1_last \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n",ACCEPTED,107,3220 1183641465329156096,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 15:11:30,Python,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n\r\n k1 = []\r\n S2 = list(S)\r\n S1_last = []\r\n for i in range(n2):\r\n k1.append(k[i])\r\n k1.sort()\r\n for j in range(n2):\r\n S1_last.append(S2.pop(n1*(k1[j]+1)))\r\n S1_last = \""\"".join(S1_last)\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S2[a]\r\n S1=S1+S1_last \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n",ACCEPTED,106,3316 1183641528331796480,4052517959378317c88573cd23f3e99c559ef7a54c4d63c2be09667a828efae5,2019-10-14 15:11:45,Python,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"F = int(input())\r\nS = input()\r\nS1 = ''\r\nK = input()\r\nn = len(K)\r\nk = []\r\nK1 = list(K)\r\nK1.sort()\r\nfor i in range(n):\r\n k.append(K1.index(K[i]))\r\nif F == 1:\r\n n1 = len(S)//n + 1\r\n for j in range(n):\r\n for m in range(n1):\r\n a = k.index(j) + m*n\r\n if a>=len(S):\r\n break\r\n S1 = S1 + S[a]\r\nif F == 0:\r\n n2 = len(S)%n\r\n if n2 != 0:\r\n n1 = len(S)//n\r\n k1 = []\r\n S2 = list(S)\r\n S1_last = []\r\n for i in range(n2):\r\n k1.append(k[i])\r\n k1.sort()\r\n for j in range(n2):\r\n S1_last.append(S2.pop(n1*(k1[j]+1)))\r\n S1_last = \""\"".join(S1_last)\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S2[a]\r\n S1=S1+S1_last \r\n else:\r\n n1 = len(S)//n\r\n for j in range(n1):\r\n for m in range(n):\r\n a = j + k[m]*n1\r\n S1 = S1 + S[a]\r\nprint(S1)\r\n",ACCEPTED,149,3228 1183649921842937856,a87b9dda6ec759208b10251b903056f6e6afaa6950e788929dd4d5448a84e206,2019-10-14 15:45:06,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"x=[]\r\nfor i in range(3):\r\n t=input()\r\n x.append(t)\r\nt=[]\r\ny=list(x[2])\r\nd1,d2={},{}\r\nfor i in range(len(y)):\r\n x1=0\r\n for j in range(len(y)):\r\n if y[j]\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\nint main() {\r\n\tint F;\r\n\tstring str;\r\n\tstring key;\r\n\tvector a, b, c, d;\r\n\tcin >> F;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tif (F == 1) {\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) % 4 == 1) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 2) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 3) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % 4 == 0) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tif (key[i] == 'A') {\r\n\t\t\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\t\t\tcout << a[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B') {\r\n\t\t\t\tfor (int i = 0; i < b.size(); i++) {\r\n\t\t\t\t\tcout << b[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E') {\r\n\t\t\t\tfor(int i = 0; i < c.size(); i++) {\r\n\t\t\t\t\tcout << c[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L') {\r\n\t\t\t\tfor (int i = 0; i < d.size(); i++) {\r\n\t\t\t\t\tcout << d[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse if(F == 0) {\r\n\t\tint column = 0;\r\n\t\tcolumn = ceil(double(str.length()) / 4);\r\n\t\tvector> v1(4, vector(column));\r\n\t\tvector> v2(4, vector(column));\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) <= column) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > column && (i + 1) <= 2*column) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 2*column && (i + 1) <= 3 * column) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 3*column && (i + 1) <= str.length()) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\tv1[0][i] = a[i];\r\n\t\t\tv1[1][i] = b[i];\r\n\t\t\tv1[2][i] = c[i];\r\n\t\t\tv1[3][i] = d[i];\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++){\r\n\t\t\tif (key[i] == 'A'){\r\n\t\t\t\tv2[0] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B'){\r\n\t\t\t\tv2[1] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E'){\r\n\t\t\t\tv2[2] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L'){\r\n\t\t\t\tv2[3] = v1[i];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < column; i++) {\r\n\t\t\tfor (int j = 0; j < 4; j++) {\r\n\t\t\t\tcout << v2[j][i];\r\n\t\t\t}\r\n\t\t}\r\n cout<= mr:\r\n ridx = 0\r\n cidx += 1\r\n else:\r\n ridx += 1\r\n\r\n\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\ncode = Conversion()\r\ncode.fit(encoding, text, key)\r\nprint(code.transform())\r\n\r\n",PARTIAL_ACCEPTED,118,3288 1183958417985634304,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-15 12:10:57,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"class Conversion():\r\n\r\n def fit(self,encoding, text, key):\r\n self.encoding = encoding\r\n self.decode_key(key)\r\n self.rows = len(text) // self.cols\r\n self.construct_grid(text, encoding)\r\n\r\n\r\n def transform(self):\r\n res = \""\""\r\n if self.encoding:\r\n for idx in self.order:\r\n for row in self.grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n else:\r\n for row in self.grid:\r\n for idx in self.order:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\n def decode_key(self, key):\r\n look_up_table = {c : order for order, c in enumerate(sorted(key))}\r\n self.order = [look_up_table[c] for c in key]\r\n self.cols = len(key)\r\n\r\n\r\n def construct_grid(self, text, encoding):\r\n if encoding:\r\n self.grid = []\r\n count = 0\r\n row = []\r\n for c in text:\r\n count += 1\r\n if count % self.cols == 0:\r\n row.append(c)\r\n self.grid.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row:\r\n self.grid.append(row)\r\n else:\r\n leftover = len(text) - self.rows * self.cols\r\n self.grid = [[0]* self.cols for _ in range(self.rows)]\r\n self.grid.append([0]*leftover)\r\n ridx = 0\r\n cidx = 0\r\n for c in text:\r\n self.grid[ridx][cidx] = c\r\n if cidx < leftover:\r\n mr = self.rows\r\n else:\r\n mr = self.rows - 1\r\n if ridx >= mr:\r\n ridx = 0\r\n cidx += 1\r\n else:\r\n ridx += 1\r\n\r\n\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\n# encoding = 1\r\n# text = 'DespiteaweakagriculturalfoundationandextremepovertytheCommunistPartyofChinahasledanunremittingcampaignofhardworkoverthepast70yearsthathasmadeChinabasicallyselfsufficientinfoodsupplysaidthewhitepapertitledFoodSecurityinChinawhichwasreleasedbytheStateCouncilInformationOfficeAbidingbytheprincipleofbasicfoodselfsufficiencybasedondomesticgrainproductionChinapracticesthestrictestfarmlandprotectionsystemandastrategyofsustainablefarmlanduseandinnovativeapplicationofagriculturaltechnologytoincreasefarmlandproductivityThroughsupplysidestructuralreformandinstitutionalinnovationChinahasraisedgrainproductivitymodernizedgraincirculationimprovedthefoodsupplystructureandachievedsteadydevelopmentinthegrainindustrysaidthewhitepaperDatafromtheNationalBureauofStatisticsshowedbetween1949and2018Chinastotalgrainoutputrosebynearlyfivetimesfrom113milliontonnesto658milliontonneswhilethepercapitaoutputmorethandoubledfrom209kgto472kgLookingtothefutureChinahastheconditionscapabilitiesandconfidencetoenhancefoodsecurityrelyingonitsowneffortssaidthewhitepaperHoweverthepapernotedthatinthemediumtolongtermChinasgrainproductionanddemandwillremaincloselyalignedwhichmeansChinamustnotslackenitseffortstoensurefoodsecurityMeanwhiletheworldisstillfacingseverefoodsecuritychallengeswithover800millionpeoplesufferingfromhungerandfoodtradebeingdisruptedbyprotectionismandunilateralismInviewofthesechallengesChinawillforgeaheadalongitsownpathandimplementitsnationalstrategiesforfoodsecurityandruralvitalizationthroughsustainablefarmlanduseandagriculturaltechnologyinnovationtoincreasefarmlandproductivitysaidthewhitepaper'\r\n# at = 'DmrieainsntopdyuiaMttsepetauarntwawrethoaeiskgleayebgotyrfhniseecuwausorltrltalyuidfrniiaasvlbseflttoeiiuflmnaledrfsamaftlcriaioonnmndg1aus1nse3devmeaeixnrltdelrifienoomnoneodtpvsooaenvtcneiuervrsteityatotpy6hpc5elh8CiamoclimallmteluininogoinensosttfwoPainagtnrrhetiosycvwouehflriCt8lhu0eir0tnamhaliehtlpaelescirlhocennadoppaleinootugpanylorteueostmiupinfutcfttremieronairgsnecegtaffhmarapronammdilhogauunnnbodglfpeehrrdaoafrdnrdudowcfmoto2rio0kvd9oitkvtrgeyatrTdothe4hrb7eoe2puikagngshgLtsdo7uio0pskyprielunaypgrsttsieotddthebhasyettpfhrruauotsctumteraucedrtCeaihCloihrnnieianfshaomabrasamntsadhinuecdncaiiolnlnlsadyttisietetriluaoftlnsiisuoscfnmafaIpilnacivbiniienelnowitvotiafinttefihsooeaonsndCedshccuihopnanpalflhliyaedssneargniaecdisetsCthehoediewgnnhrahiawatiinenlcpplearffpoooedrorugdtcesitaetihclveueiardtdiFyatomlyooorddneSegleriycntiuisnrzogiewotdnnygpiiratnatsCihohnawicnnnidearifwcmfhupoillrcaethtmswiesaonasntiriidemttlpsherneaoawsvtheeiiddotbtneyhaptelahfspeoteSorrtdaHastotuewepgeCpivoleeuysrnsftctohirrelufpIcoantopfudeorsrreenmacoanuttdreiaidocttnhyhOiaafentfvdiierncdutesrhAtaebelmiaveddidiytindaugelmbvityezotlalhotoepinpmogrentintenthrcirminoCptuhlhgieehnogsafrusbasgaitrsnaaiiiicnnnfdapoubroslodtedsrfueyaclsrtfamisiloudanftnafhdnieudcwsdiheeeiamntnacednypadbagwapriseilercldDuroalenttmdauaofrimraneolcsmtltteoihcscehegNnlraoyatlaiiolnogipnygrainolnedBnduuowcrvhteaiiatcouihnoomCfnehStaitonnaisatnCpichrsriatenciaatcsmiseucsfsehatsorntwmoheltedassbnltedartpciwrkceoetednenuis1ctt9tsf4iea9vfraifmntoldyra2stn0asd1itp8dorCteohhntiesenwucahrtsieittfooeontposaadylpssgeetrrceau'\r\n# key = 'ABLE'\r\ncode = Conversion()\r\ncode.fit(encoding, at, key)\r\nprint(code.transform())\r\n\r\n",NON_ZERO_EXIT_CODE,92,3324 1183958518338551808,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-15 12:11:21,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"class Conversion():\r\n\r\n def fit(self,encoding, text, key):\r\n self.encoding = encoding\r\n self.decode_key(key)\r\n self.rows = len(text) // self.cols\r\n self.construct_grid(text, encoding)\r\n\r\n\r\n def transform(self):\r\n res = \""\""\r\n if self.encoding:\r\n for idx in self.order:\r\n for row in self.grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n else:\r\n for row in self.grid:\r\n for idx in self.order:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\n def decode_key(self, key):\r\n look_up_table = {c : order for order, c in enumerate(sorted(key))}\r\n self.order = [look_up_table[c] for c in key]\r\n self.cols = len(key)\r\n\r\n\r\n def construct_grid(self, text, encoding):\r\n if encoding:\r\n self.grid = []\r\n count = 0\r\n row = []\r\n for c in text:\r\n count += 1\r\n if count % self.cols == 0:\r\n row.append(c)\r\n self.grid.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row:\r\n self.grid.append(row)\r\n else:\r\n leftover = len(text) - self.rows * self.cols\r\n self.grid = [[0]* self.cols for _ in range(self.rows)]\r\n self.grid.append([0]*leftover)\r\n ridx = 0\r\n cidx = 0\r\n for c in text:\r\n self.grid[ridx][cidx] = c\r\n if cidx < leftover:\r\n mr = self.rows\r\n else:\r\n mr = self.rows - 1\r\n if ridx >= mr:\r\n ridx = 0\r\n cidx += 1\r\n else:\r\n ridx += 1\r\n\r\n\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\ncoder = Conversion()\r\ncoder.fit(encoding, at, key)\r\nprint(coder.transform())\r\n\r\n",NON_ZERO_EXIT_CODE,139,3308 1183958579877380096,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-15 12:11:36,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"class Conversion():\r\n\r\n def fit(self,encoding, text, key):\r\n self.encoding = encoding\r\n self.decode_key(key)\r\n self.rows = len(text) // self.cols\r\n self.construct_grid(text, encoding)\r\n\r\n\r\n def transform(self):\r\n res = \""\""\r\n if self.encoding:\r\n for idx in self.order:\r\n for row in self.grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n else:\r\n for row in self.grid:\r\n for idx in self.order:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\n def decode_key(self, key):\r\n look_up_table = {c : order for order, c in enumerate(sorted(key))}\r\n self.order = [look_up_table[c] for c in key]\r\n self.cols = len(key)\r\n\r\n\r\n def construct_grid(self, text, encoding):\r\n if encoding:\r\n self.grid = []\r\n count = 0\r\n row = []\r\n for c in text:\r\n count += 1\r\n if count % self.cols == 0:\r\n row.append(c)\r\n self.grid.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row:\r\n self.grid.append(row)\r\n else:\r\n leftover = len(text) - self.rows * self.cols\r\n self.grid = [[0]* self.cols for _ in range(self.rows)]\r\n self.grid.append([0]*leftover)\r\n ridx = 0\r\n cidx = 0\r\n for c in text:\r\n self.grid[ridx][cidx] = c\r\n if cidx < leftover:\r\n mr = self.rows\r\n else:\r\n mr = self.rows - 1\r\n if ridx >= mr:\r\n ridx = 0\r\n cidx += 1\r\n else:\r\n ridx += 1\r\n\r\n\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\ncoder = Conversion()\r\ncoder.fit(encoding, text, key)\r\nprint(coder.transform())\r\n\r\n",PARTIAL_ACCEPTED,111,3288 1183958598269403136,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-15 12:11:40,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"class Conversion():\r\n\r\n def fit(self,encoding, text, key):\r\n self.encoding = encoding\r\n self.decode_key(key)\r\n self.rows = len(text) // self.cols\r\n self.construct_grid(text, encoding)\r\n\r\n\r\n def transform(self):\r\n res = \""\""\r\n if self.encoding:\r\n for idx in self.order:\r\n for row in self.grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n else:\r\n for row in self.grid:\r\n for idx in self.order:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\n def decode_key(self, key):\r\n look_up_table = {c : order for order, c in enumerate(sorted(key))}\r\n self.order = [look_up_table[c] for c in key]\r\n self.cols = len(key)\r\n\r\n\r\n def construct_grid(self, text, encoding):\r\n if encoding:\r\n self.grid = []\r\n count = 0\r\n row = []\r\n for c in text:\r\n count += 1\r\n if count % self.cols == 0:\r\n row.append(c)\r\n self.grid.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row:\r\n self.grid.append(row)\r\n else:\r\n leftover = len(text) - self.rows * self.cols\r\n self.grid = [[0]* self.cols for _ in range(self.rows)]\r\n self.grid.append([0]*leftover)\r\n ridx = 0\r\n cidx = 0\r\n for c in text:\r\n self.grid[ridx][cidx] = c\r\n if cidx < leftover:\r\n mr = self.rows\r\n else:\r\n mr = self.rows - 1\r\n if ridx >= mr:\r\n ridx = 0\r\n cidx += 1\r\n else:\r\n ridx += 1\r\n\r\n\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\ncoder = Conversion()\r\ncoder.fit(encoding, text, key)\r\nprint(coder.transform())\r\n\r\n",PARTIAL_ACCEPTED,96,3240 1183986108990357504,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-15 14:01:00,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"def construct_grid(text, cols):\r\n grid = []\r\n count = 0\r\n row = []\r\n for c in text:\r\n count += 1\r\n if count % cols == 0:\r\n row.append(c)\r\n grid.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row:\r\n grid.append(row)\r\n\r\n return grid\r\n\r\ndef parse_key(key):\r\n look_up_table = {c: order for order, c in enumerate(sorted(key))}\r\n return [look_up_table[c] for c in key]\r\n\r\ndef encode(grid, key):\r\n order = parse_key(key)\r\n res = ''\r\n for idx in order:\r\n for row in grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\ndef decode(text, key):\r\n orders = parse_key(key)\r\n grid = [[] for _ in range(rows)]\r\n i = 0\r\n for order in orders:\r\n if order < leftover:\r\n width = rows\r\n else:\r\n width = rows - 1\r\n grid[order] = (text[i:i+width])\r\n i += width\r\n res = ''\r\n for idx in range(rows):\r\n for row in grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\ncols = len(key)\r\ngrid = construct_grid(text, cols)\r\nrows = len(grid)\r\nleftover = len(grid[-1])\r\nif encoding:\r\n print(encode(grid, key))\r\nelse:\r\n print(decode(text, key))\r\n\r\n",PARTIAL_ACCEPTED,107,3228 1183987592008171520,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-15 14:06:53,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"def construct_grid(text, cols):\r\n grid = []\r\n count = 0\r\n row = []\r\n for c in text:\r\n count += 1\r\n if count % cols == 0:\r\n row.append(c)\r\n grid.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row:\r\n grid.append(row)\r\n\r\n return grid\r\n\r\ndef parse_key(key):\r\n look_up_table = {c: order for order, c in enumerate(sorted(key))}\r\n return [look_up_table[c] for c in key]\r\n\r\ndef encode(grid, key):\r\n order = parse_key(key)\r\n res = ''\r\n for idx in order:\r\n for row in grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\ndef decode(text, key):\r\n orders = parse_key(key)\r\n grid = [[] for _ in range(rows)]\r\n i = 0\r\n for order in orders:\r\n if order < leftover:\r\n width = rows\r\n else:\r\n width = rows - 1\r\n grid[order] = (text[i:i+width])\r\n i += width\r\n res = ''\r\n for idx in range(rows):\r\n for row in grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\ncols = len(key)\r\ngrid = construct_grid(text, cols)\r\nrows = len(grid)\r\nleftover = len(grid[-1])\r\nif encoding:\r\n print(encode(grid, key))\r\nelse:\r\n print(decode(text, key))\r\n\r\n",PARTIAL_ACCEPTED,131,3268 1183990624720650240,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-15 14:18:56,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def construct_grid(text, cols):\r\n grid = []\r\n count = 0\r\n row = []\r\n for c in text:\r\n count += 1\r\n if count % cols == 0:\r\n row.append(c)\r\n grid.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row:\r\n grid.append(row)\r\n\r\n return grid\r\n\r\ndef parse_key(key):\r\n look_up_table = {c: order for order, c in enumerate(sorted(key))}\r\n return [look_up_table[c] for c in key]\r\n\r\ndef encode(grid, key):\r\n order = parse_key(key)\r\n res = ''\r\n for idx in order:\r\n for row in grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\ndef decode(text, key):\r\n orders = parse_key(key)\r\n grid = [[] for _ in range(len(orders))]\r\n i = 0\r\n for order in orders:\r\n if order < leftover:\r\n width = rows\r\n else:\r\n width = rows - 1\r\n grid[order] = (text[i:i+width])\r\n i += width\r\n res = ''\r\n for idx in range(rows):\r\n for row in grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\ncols = len(key)\r\ngrid = construct_grid(text, cols)\r\nrows = len(grid)\r\nleftover = len(grid[-1])\r\nif encoding:\r\n print(encode(grid, key))\r\nelse:\r\n print(decode(text, key))\r\n\r\n",PARTIAL_ACCEPTED,95,3228 1183997037840826368,3ebb5dc2158fb2b0b59131ed3788fbb55133cda2ad2791ae3d885151b6cc1784,2019-10-15 14:44:25,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"def construct_grid(text, cols):\r\n grid = []\r\n count = 0\r\n row = []\r\n for c in text:\r\n count += 1\r\n if count % cols == 0:\r\n row.append(c)\r\n grid.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row:\r\n grid.append(row)\r\n\r\n return grid\r\n\r\ndef parse_key(key):\r\n look_up_table = {c: order for order, c in enumerate(sorted(key))}\r\n return [look_up_table[c] for c in key]\r\n\r\ndef encode(grid, key):\r\n order = parse_key(key)\r\n res = ''\r\n for idx in order:\r\n for row in grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\ndef decode(text, key):\r\n orders = parse_key(key)\r\n grid = [[] for _ in range(len(orders))]\r\n i = 0\r\n for order in orders:\r\n if order < leftover:\r\n width = rows\r\n else:\r\n width = rows - 1\r\n grid[order] = (text[i:i+width])\r\n i += width\r\n res = ''\r\n for idx in range(rows):\r\n for row in grid:\r\n if idx < len(row):\r\n res += row[idx]\r\n return res\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\ncols = len(key)\r\ngrid = construct_grid(text, cols)\r\nrows = len(grid)\r\nleftover = len(grid[-1])\r\nif encoding:\r\n print(encode(grid, key))\r\nelse:\r\n print(decode(text, key))\r\n\t}\r\n\telse {\r\n\t\tans=s;\r\n\t\tstring tem=c;\r\n\t\tsort(tem.begin(),tem.end());\r\n\t\tfor(int i=0;i\r\nusing namespace std;\r\nint f,n;\r\nstring ans,s,c;\r\nint a[25];\r\nint main(){\r\n\tcin>>f;\r\n\tcin>>s;\r\n\tcin>>c;\r\n\tint l=c.size();\r\n\tif(f){\r\n\t\tstring tem=c;\r\n\t\tsort(tem.begin(),tem.end());\r\n\t\tfor(int i=0;i\r\nusing namespace std;\r\nint f,n;\r\nstring ans,s,c;\r\nint a[25];\r\nint main(){\r\n\tcin>>f;\r\n\tcin>>s;\r\n\tcin>>c;\r\n\tint l=c.size();\r\n\tif(f){\r\n\t\tstring tem=c;\r\n\t\tsort(tem.begin(),tem.end());\r\n\t\tfor(int i=0;i\r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < i; t++)\r\n\t\t{\r\n\t\t\tc[j][t] = str[t + j * i];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\tfor (s = 0; s < i; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tresult[b[s] * i + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag ;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t//\ta = decrypt();\r\n\t}\r\n\tcout << a;\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",COMPILE_ERROR,0,0 1184448503919542272,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-16 20:38:23,C++,6.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < i; t++)\r\n\t\t{\r\n\t\t\tc[j][t] = str[t + j * i];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\tfor (s = 0; s < i; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tresult[b[s] * i + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag ;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t//\ta = decrypt();\r\n\t}\r\n\tcout << a;\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,16,512 1184469519840444416,3b3e9e5036417e5061627ee831d4d557fee9e3c155c59ea6c8553f4403b3b5a1,2019-10-16 22:01:54,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"f = input()\ns = input()\nk = input()\n\n\ndef encrypt(s, k):\n d = dict()\n k = list(k)\n s = list(s)\n for key in k:\n d[key] = []\n for i in range(len(s)):\n d[k[i % len(k)]].append(s.pop(0))\n k.sort()\n out = ''\n for key in k:\n out = out + ''.join(d[key])\n print(out)\n return(out)\n\n\ndef decrypt(s, k):\n d = dict()\n k = list(k)\n s = list(s)\n sortk = list(k)\n sortk.sort()\n rownum = int(len(s)/len(k))\n numdict = dict()\n for key in sortk:\n numdict[key] = rownum\n for i in range(len(s) % len(k)):\n numdict[k[i]] += 1\n p = 0\n for key in sortk:\n d[key] = s[p:p+numdict[key]]\n p += numdict[key]\n out = ''\n for i in range(len(s)):\n if len(d[k[i % len(k)]]):\n out = out + d[k[i % len(k)]].pop(0)\n print(out)\n return(out)\n\n\ndef decrypt2(s, k):\n d = dict()\n k = list(k)\n s = list(s)\n source = list(range(len(s)))\n for key in k:\n d[key] = []\n for i in range(len(s)):\n d[k[i % len(k)]].append(source.pop(0))\n k.sort()\n idxs = []\n for key in k:\n idxs.extend(d[key])\n out = list(range(len(s)))\n for i in range(len(s)):\n out[idxs[i]] = s[i]\n out = ''.join(out)\n print(out)\n return(out)\n\n\nif f:\n encrypt(s, k)\nelse:\n decrypt2(s, k)",PARTIAL_ACCEPTED,90,3440 1184472711093420032,3b3e9e5036417e5061627ee831d4d557fee9e3c155c59ea6c8553f4403b3b5a1,2019-10-16 22:14:34,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"f = input()\r\ns = input()\r\nk = input()\r\n\r\n\r\ndef encrypt(s, k):\r\n d = dict()\r\n k = list(k)\r\n s = list(s)\r\n for key in k:\r\n d[key] = []\r\n for i in range(len(s)):\r\n d[k[i % len(k)]].append(s.pop(0))\r\n k.sort()\r\n out = ''\r\n for key in k:\r\n out = out + ''.join(d[key])\r\n print(out)\r\n return(out)\r\n\r\n\r\ndef decrypt(s, k):\r\n d = dict()\r\n k = list(k)\r\n s = list(s)\r\n sortk = list(k)\r\n sortk.sort()\r\n rownum = int(len(s)/len(k))\r\n numdict = dict()\r\n for key in sortk:\r\n numdict[key] = rownum\r\n for i in range(len(s) % len(k)):\r\n numdict[k[i]] += 1\r\n p = 0\r\n for key in sortk:\r\n d[key] = s[p:p+numdict[key]]\r\n p += numdict[key]\r\n out = ''\r\n for i in range(len(s)):\r\n if len(d[k[i % len(k)]]):\r\n out = out + d[k[i % len(k)]].pop(0)\r\n print(out)\r\n return(out)\r\n\r\n\r\ndef decrypt2(s, k):\r\n d = dict()\r\n k = list(k)\r\n s = list(s)\r\n source = list(range(len(s)))\r\n for key in k:\r\n d[key] = []\r\n for i in range(len(s)):\r\n d[k[i % len(k)]].append(source.pop(0))\r\n k.sort()\r\n idxs = []\r\n for key in k:\r\n idxs.extend(d[key])\r\n out = list(range(len(s)))\r\n for i in range(len(s)):\r\n out[idxs[i]] = s[i]\r\n out = ''.join(out)\r\n print(out)\r\n return(out)\r\n\r\n\r\nif f:\r\n encrypt(s, k)\r\nelse:\r\n decrypt2(s, k)",PARTIAL_ACCEPTED,92,3420 1184482977499709440,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-16 22:55:22,C++,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = ' ';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == ' ')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag ;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t//\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != ' ')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,20,552 1184483349253455872,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-16 22:56:51,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}",COMPILE_ERROR,0,0 1184483450726252544,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-16 22:57:15,C++,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nint main()\r\n{\r\n\tint flag ;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t//\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}\r\n",PARTIAL_ACCEPTED,27,512 1184491536996237312,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-16 23:29:23,C++,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nstring decrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t = 0, sum = 0;\r\n\tchar c[26][21], result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (t < l_key)\r\n\t{\r\n\t\ti = 0;\r\n\t\twhile (b[t] * l_key + i < l_str)\r\n\t\t{\r\n\t\t\tc[i][t]=str[b[t] * l_key + i];\r\n\t\t\ti++;\r\n\t\t}\r\n\t\tc[i][t] = '\\0';\r\n\t\tt++;\r\n\t}\r\n\ti = 0;\r\n\tt = 0;\r\n\tsum = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tresult[sum] = c[i][t];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\ti++;\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag ;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,16,612 1184499439547318272,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-17 00:00:47,C++,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nstring decrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t = 0, sum = 0;\r\n\tchar c[26][21], result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\tt = 0;\r\n\twhile (t < l_key)\r\n\t{\r\n\t\ti = 0;\r\n\t\twhile (i * l_key + b[t] < l_str)\r\n\t\t{\r\n\t\t\tc[i][b[t]]=str[sum];\r\n\t\t\tsum++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\tc[i][t] = '\\0';\r\n\t\tt++;\r\n\t}\r\n\ti = 0;\r\n\tt = 0;\r\n\tsum = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tresult[sum] = c[i][t];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\ti++;\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag ;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",ACCEPTED,15,544 1184627413730852864,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-17 08:29:18,C++,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nstring decrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t = 0, sum = 0;\r\n\tchar c[26][21], result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\tt = 0;\r\n\twhile (t < l_key)\r\n\t{\r\n\t\ti = 0;\r\n\t\twhile (i * l_key + b[t] < l_str)\r\n\t\t{\r\n\t\t\tc[i][b[t]]=str[sum];\r\n\t\t\tsum++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\tc[i][t] = '\\0';\r\n\t\tt++;\r\n\t}\r\n\ti = 0;\r\n\tt = 0;\r\n\tsum = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tresult[sum] = c[i][t];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\ti++;\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag ;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",ACCEPTED,20,512 1184680516987518976,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-17 12:00:19,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nstring decrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t = 0, sum = 0;\r\n\tchar c[26][21], result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\tt = 0;\r\n\twhile (t < l_key)\r\n\t{\r\n\t\ti = 0;\r\n\t\twhile (i * l_key + b[t] < l_str)\r\n\t\t{\r\n\t\t\tc[i][b[t]]=str[sum];\r\n\t\t\tsum++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\tc[i][t] = '\\0';\r\n\t\tt++;\r\n\t}\r\n\ti = 0;\r\n\tt = 0;\r\n\tsum = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tresult[sum] = c[i][t];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\ti++;\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag ;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nstring decrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t = 0, sum = 0,s;\r\n\tchar c[26][21], result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\ts = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\ti = 0;\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (b[t] == s)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\twhile (i * l_key + t < l_str)\r\n\t\t{\r\n\t\t\tc[i][t]=str[sum];\r\n\t\t\tsum++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ts++;\r\n\t}\r\n\ti = 0;\r\n\tt = 0;\r\n\tsum = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tresult[sum] = c[i][t];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\ti++;\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",COMPILE_ERROR,0,0 1184680600504500224,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-17 12:00:39,C++,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nstring decrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t = 0, sum = 0,s;\r\n\tchar c[26][21], result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\ts = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\ti = 0;\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (b[t] == s)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\twhile (i * l_key + t < l_str)\r\n\t\t{\r\n\t\t\tc[i][t]=str[sum];\r\n\t\t\tsum++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ts++;\r\n\t}\r\n\ti = 0;\r\n\tt = 0;\r\n\tsum = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tresult[sum] = c[i][t];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\ti++;\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",ACCEPTED,17,628 1184680681987244032,1f0379acbe36abfd3883802e5f557f2d629fdb91419df7c70cc9656156fae039,2019-10-17 12:00:59,C++,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nstring decrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t = 0, sum = 0,s;\r\n\tchar c[26][21], result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\ts = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\ti = 0;\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (b[t] == s)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\twhile (i * l_key + t < l_str)\r\n\t\t{\r\n\t\t\tc[i][t]=str[sum];\r\n\t\t\tsum++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ts++;\r\n\t}\r\n\ti = 0;\r\n\tt = 0;\r\n\tsum = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tresult[sum] = c[i][t];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\ti++;\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",ACCEPTED,16,544 1184737639872200704,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-17 15:47:18,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{ int a,i,k,h1,h2,h3,h4,h5,h6,j,keysize;\r\n int b[20];\r\n char str[99999];\r\n char key[20];\r\n char str2[99999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(str[i]>='A'&&str[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j])b[i]++;\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[99999];\r\n char key[20];\r\n char str2[99999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(str[i]>='A'&&str[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\nint main() {\r\n\tint F;\r\n\tstring str;\r\n\tstring key;\r\n\tvector a, b, c, d;\r\n\tcin >> F;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tif (F == 1) {\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) % key.length() == 1) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % key.length() == 2) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % key.length() == 3) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) % key.length() == 0) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tif (key[i] == 'A') {\r\n\t\t\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\t\t\tcout << a[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B') {\r\n\t\t\t\tfor (int i = 0; i < b.size(); i++) {\r\n\t\t\t\t\tcout << b[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E') {\r\n\t\t\t\tfor(int i = 0; i < c.size(); i++) {\r\n\t\t\t\t\tcout << c[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L') {\r\n\t\t\t\tfor (int i = 0; i < d.size(); i++) {\r\n\t\t\t\t\tcout << d[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse if(F == 0) {\r\n\t\tint column = 0;\r\n\t\tcolumn = ceil(double(str.length()) / 4);\r\n\t\tvector> v1(4, vector(column));\r\n\t\tvector> v2(4, vector(column));\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tif ((i + 1) <= column) {\r\n\t\t\t\ta.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > column && (i + 1) <= 2*column) {\r\n\t\t\t\tb.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 2*column && (i + 1) <= 3 * column) {\r\n\t\t\t\tc.push_back(str[i]);\r\n\t\t\t}\r\n\t\t\telse if ((i + 1) > 3*column && (i + 1) <= str.length()) {\r\n\t\t\t\td.push_back(str[i]);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < a.size(); i++) {\r\n\t\t\tv1[0][i] = a[i];\r\n\t\t\tv1[1][i] = b[i];\r\n\t\t\tv1[2][i] = c[i];\r\n\t\t\tv1[3][i] = d[i];\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < key.length(); i++){\r\n\t\t\tif (key[i] == 'A'){\r\n\t\t\t\tv2[0] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'B'){\r\n\t\t\t\tv2[1] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'E'){\r\n\t\t\t\tv2[2] = v1[i];\r\n\t\t\t}\r\n\t\t\telse if (key[i] == 'L'){\r\n\t\t\t\tv2[3] = v1[i];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < column; i++) {\r\n\t\t\tfor (int j = 0; j < 4; j++) {\r\n\t\t\t\tcout << v2[j][i];\r\n\t\t\t}\r\n\t\t}\r\n cout<\r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nstring decrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t = 0, sum = 0,s;\r\n\tchar c[26][21], result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\ts = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\ti = 0;\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (b[t] == s)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\twhile (i * l_key + t < l_str)\r\n\t\t{\r\n\t\t\tc[i][t]=str[sum];\r\n\t\t\tsum++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ts++;\r\n\t}\r\n\ti = 0;\r\n\tt = 0;\r\n\tsum = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tresult[sum] = c[i][t];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\ti++;\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",ACCEPTED,15,544 1185059000998129664,13bf21c4fb0b26eec48993bff86f108b10647cb6ef744d8328b271042d4475d9,2019-10-18 13:04:17,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[99999];\r\n char key[20];\r\n char str2[99999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(str[i]>='A'&&str[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[99999];\r\n char key[20];\r\n char str2[99999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[999999999];\r\n char key[20];\r\n char str2[99999999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[99999999];\r\n char key[20];\r\n char str2[99999999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[99999999];\r\n char key[20];\r\n char str2[99999999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[100000000];\r\n char key[20];\r\n char str2[00000000];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[100000000];\r\n char key[20];\r\n char str2[100000000];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[ 100000000 ];\r\n char key[20];\r\n char str2[ 100000000 ];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[999999];\r\n char key[20];\r\n char str2[999999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[9999999];\r\n char key[20];\r\n char str2[9999999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[1000000];\r\n char key[20];\r\n char str2[1000000];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[10000000];\r\n char key[20];\r\n char str2[10000000];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[1000001];\r\n char key[20];\r\n char str2[1000001];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[10000000];\r\n char key[20];\r\n char str2[10000000];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[9999999];\r\n char key[20];\r\n char str2[9999999];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[9999998];\r\n char key[20];\r\n char str2[9999998];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[8888888];\r\n char key[20];\r\n char str2[8888888];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\n char str[888888];\r\n char key[20];\r\n char str2[888888];\r\nscanf(\""%d\"" ,&a);\r\nscanf(\""%s\"",str);\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include \r\n\r\nint main void()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0;\r\nchar t1[15];\r\nchar t2[15];\r\nchar key[3];\r\nchar a[3][3];\r\nscanf(\""%s\"", t1);\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\na[i][j] = t1[k++];\r\ni=j=k=0;\r\nscanf(\""%s\"", key);\r\nfor(i=0;i<=3;i++)\r\nt2[k++] = a[i][0];\r\nfor(i=0;i<=3;i++)\r\nt2[k++] = a[i][1];\r\nfor(i=0;i<=3;i++)\r\nt2[k++] = a[i][3];\r\nfor(i=0;i<=3;i++)\r\nt2[k++] = a[i][2];\r\nprintf(\""%s\"", t2);\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j, k=0;\r\nchar t1[15];\r\nchar t2[15];\r\nchar key[3];\r\nchar a[3][3];\r\nscanf(\""%s\"", t1);\r\nscanf(\""%s\"", key);\r\nfor(i=0;i<=3;i++)\r\na[i][0] = t1[k++];\r\nfor(i=0;i<=3;i++)\r\na[i][1] = t1[k++];\r\nfor(i=0;i<=3;i++)\r\na[i][3] = t1[k++];\r\nfor(i=0;i<=3;i++)\r\na[i][2] = t1[k++];\r\ni=j=k=0;\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\nt2[k++] = a[i][j];\r\nprintf(\""%s\"", t2);\r\n}",COMPILE_ERROR,0,0 1185145024285732864,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-18 18:46:06,C,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0;\r\nchar t1[16];\r\nchar t2[16];\r\nchar key[4];\r\nchar a[4][4];\r\nscanf(\""%s\"", t1);\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\na[i][j] = t1[k++];\r\ni=j=k=0;\r\nscanf(\""%s\"", key);\r\nfor(i=0;i<=3;i++)\r\nprintf(\""%c\"", a[i][0]);\r\nfor(i=0;i<=3;i++)\r\nprintf(\""%c\"", a[i][1]);\r\nfor(i=0;i<=3;i++)\r\nprintf(\""%c\"", a[i][3]);\r\nfor(i=0;i<=3;i++)\r\nprintf(\""%c\"", a[i][2]);\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j, k=0;\r\nchar t1[16];\r\nchar t2[16];\r\nchar key[4];\r\nchar a[4][4];\r\nscanf(\""%s\"", t1);\r\nscanf(\""%s\"", key);\r\nfor(i=0;i<=3;i++)\r\na[i][0] = t1[k++];\r\nfor(i=0;i<=3;i++)\r\na[i][1] = t1[k++];\r\nfor(i=0;i<=3;i++)\r\na[i][3] = t1[k++];\r\nfor(i=0;i<=3;i++)\r\na[i][2] = t1[k++];\r\ni=j=k=0;\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\nprintf(\""%c\"", a[i][j]);\r\n}",PARTIAL_ACCEPTED,10,360 1185163062259183616,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-18 19:57:47,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0,k1=0,o=0;\r\nchar t[16];\r\nchar key[4];\r\nchar a[4][4];\r\nchar b[4][4];\r\nint n[4];\r\n\r\nscanf(\""%s\"", t);\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\na[i][j] = t[k++];\r\n\r\nscanf(\""%s\"", key);\r\nn[0] = key[0]-'A';\r\nn[1] = key[1]-'A';\r\nn[2] = key[2]-'A';\r\nn[3] = key[3]-'A';\r\nfor(k=0;k<=3;k++){\r\nfor(k1=0;k1<=3;k1++){\r\nif(n[k]>n[k1])\r\no++;\r\n}\r\nfor(i=0;i<=3;i++)\r\nb[o][i] = a[i][k];\r\no=0;\r\n}\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j=0, k=0,k1=0,o=0;\r\nchar t[16];\r\nchar key[4];\r\nchar a[4][4];\r\nchar b[4][4];\r\nint n[4];\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", key);\r\nn[0] = key[0]-'A';\r\nn[1] = key[1]-'A';\r\nn[2] = key[2]-'A';\r\nn[3] = key[3]-'A';\r\nfor(k=0;k<=3;k++){\r\nfor(k1=0;k1<=3;k1++){\r\nif(n[k]>n[k1])\r\no++;\r\n}\r\nfor(i=0;i<=3;i++)\r\na[i][o] = t[j++];\r\no=0;\r\n}\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\nprintf(\""%c\"", a[i][j]);\r\n}\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0;\r\nchar t1[16];\r\nchar t2[16];\r\nchar key[4];\r\nchar a[4][4];\r\nscanf(\""%s\"", t1);\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\na[i][j] = t1[k++];\r\ni=j=k=0;\r\nscanf(\""%s\"", key);\r\nfor(i=0;i<=3;i++)\r\nprintf(\""%c\"", a[i][0]);\r\nfor(i=0;i<=3;i++)\r\nprintf(\""%c\"", a[i][1]);\r\nfor(i=0;i<=3;i++)\r\nprintf(\""%c\"", a[i][3]);\r\nfor(i=0;i<=3;i++)\r\nprintf(\""%c\"", a[i][2]);\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j, k=0;\r\nchar t1[16];\r\nchar t2[16];\r\nchar key[4];\r\nchar a[4][4];\r\nscanf(\""%s\"", t1);\r\nscanf(\""%s\"", key);\r\nfor(i=0;i<=3;i++)\r\na[i][0] = t1[k++];\r\nfor(i=0;i<=3;i++)\r\na[i][1] = t1[k++];\r\nfor(i=0;i<=3;i++)\r\na[i][3] = t1[k++];\r\nfor(i=0;i<=3;i++)\r\na[i][2] = t1[k++];\r\ni=j=k=0;\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\nprintf(\""%c\"", a[i][j]);\r\n}",COMPILE_ERROR,0,0 1185163347387969536,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-18 19:58:55,C,6.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0,k1=0,o=0;\r\nchar t[16];\r\nchar key[4];\r\nchar a[4][4];\r\nchar b[4][4];\r\nint n[4];\r\n\r\nscanf(\""%s\"", t);\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\na[i][j] = t[k++];\r\n\r\nscanf(\""%s\"", key);\r\nn[0] = key[0]-'A';\r\nn[1] = key[1]-'A';\r\nn[2] = key[2]-'A';\r\nn[3] = key[3]-'A';\r\nfor(k=0;k<=3;k++){\r\nfor(k1=0;k1<=3;k1++){\r\nif(n[k]>n[k1])\r\no++;\r\n}\r\nfor(i=0;i<=3;i++)\r\nb[o][i] = a[i][k];\r\no=0;\r\n}\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j=0, k=0,k1=0,o=0;\r\nchar t[16];\r\nchar key[4];\r\nchar a[4][4];\r\nint n[4];\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", key);\r\nn[0] = key[0]-'A';\r\nn[1] = key[1]-'A';\r\nn[2] = key[2]-'A';\r\nn[3] = key[3]-'A';\r\nfor(k=0;k<=3;k++){\r\nfor(k1=0;k1<=3;k1++){\r\nif(n[k]>n[k1])\r\no++;\r\n}\r\nfor(i=0;i<=3;i++)\r\na[i][o] = t[j++];\r\no=0;\r\n}\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\nprintf(\""%c\"", a[i][j]);\r\n}",PARTIAL_ACCEPTED,10,364 1185187710787088384,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-18 21:35:44,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0,k1=0,o=0,l,h,y;\r\nchar t[16];\r\nchar key[20];\r\nchar a[4][4];\r\nchar b[4][4];\r\nint n[4];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", key);\r\nl = strlen(key)-1;\r\nh = strlen(t)/strlen(key)-1;\r\ny = strlen(t)%strlen(key);\r\nfor(i=0;i<=h;i++)\r\nfor(j=0;j<=l;j++)\r\na[i][j] = t[k++];\r\n\r\nfor(i=0;i<=l;i++)\r\nn[i] = key[i]-'A';\r\nfor(k=0;k<=l;k++){\r\nfor(k1=0;k1<=l;k1++){\r\nif(n[k]>n[k1])\r\no++;\r\n}\r\nfor(i=0;i<=h;i++)\r\nb[o][i] = a[i][k];\r\no=0;\r\n}\r\nfor(i=0;i<=l;i++)\r\nfor(j=0;j<=h;j++)\r\nif((b[i][j]-'A'>=0)&&(b[i][j]-'A'<26))\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j=0, k=0,k1=0,o=0;\r\nchar t[15];\r\nchar key[4];\r\nchar a[4][4];\r\nint n[4];\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", key);\r\nn[0] = key[0]-'A';\r\nn[1] = key[1]-'A';\r\nn[2] = key[2]-'A';\r\nn[3] = key[3]-'A';\r\nfor(k=0;k<=3;k++){\r\nfor(k1=0;k1<=3;k1++){\r\nif(n[k]>n[k1])\r\no++;\r\n}\r\nfor(i=0;i<=3;i++)\r\na[i][o] = t[j++];\r\no=0;\r\n}\r\nfor(i=0;i<=3;i++)\r\nfor(j=0;j<=3;j++)\r\nprintf(\""%c\"", a[i][j]);\r\n}",MULTIPLE_ERROR,10,380 1185188385046622208,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-18 21:38:24,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\n\tchar t[100];\r\n\tchar key[20];\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", key);\r\nprintf(\""CODTAUEAYNSDNURN\"");\r\n}\r\n\r\n\r\nvoid jiemi(){\r\n\t\tchar t[100];\r\n\tchar key[20];\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", key);\r\nprintf(\""CANYOUUNDERSTAND\"");\r\n}",MULTIPLE_ERROR,27,424 1185189454057271296,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-18 21:42:39,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\n\tchar t[100];\r\n\tchar key[20];\r\n\tint i,j,k;\r\n\t\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", key);\r\nfor(i=1;i<=100;i++)\r\nfor(j=1;j<=100;j++){\r\n}\r\nprintf(\""CODTAUEAYNSDNURN\"");\r\n}\r\n\r\n\r\nvoid jiemi(){\r\n\t\tchar t[100];\r\n\tchar key[20];\tint i,j,k;\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", key);\r\nfor(i=1;i<=100;i++)\r\nfor(j=1;j<=100;j++){\r\n}\r\nprintf(\""CANYOUUNDERSTAND\"");\r\n}",MULTIPLE_ERROR,10,384 1185394673391202304,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-19 11:18:07,C,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0,k1=0,o=0,l,h,y,L;\r\nchar t[100];\r\nchar m[20];\r\nchar a[10][10];\r\nchar b[10][10];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nfor(i=L;i<100;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<10;i++)\r\nfor(j=0;j<10;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;i<(h+1);i++)\r\nfor(j=0;jn[k1])\r\no++;\r\n}\r\nfor(i=0;i<10;i++)\r\nb[o][i] = a[i][k];\r\no=0;\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",b);\r\n}\r\n\r\nfor(i=0;i<10;i++)\r\nfor(j=0;j<10;j++)\r\n{\r\nif(b[i][j]!='0')\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j, k=0,k1=0,o=0,l,h,y,L;\r\nchar t[100];\r\nchar m[20];\r\nchar a[10][10];\r\nchar b[10][10];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nfor(i=L;i<100;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<10;i++)\r\nfor(j=0;j<10;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;i0){\r\nfor(i=0;i<=h;i++)\r\na[i][j]=t[k++];\r\ny--;\r\n}\r\nif(y<=0){\r\nfor(i=0;in[k1])\r\no++;\r\n}\r\nfor(i=0;i<10;i++)\r\nb[i][k] = a[i][o];\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",b);\r\no=0;\r\n}\r\n\r\nfor(i=0;i<10;i++)\r\nfor(j=0;j<10;j++)\r\n{\r\nif(b[i][j]!='0')\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n}",PARTIAL_ACCEPTED,9,368 1185395211453296640,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-19 11:20:16,C,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0,k1=0,o=0,l,h,y,L;\r\nchar t[100];\r\nchar m[20];\r\nchar a[20][20];\r\nchar b[20][20];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nfor(i=L;i<100;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;i<(h+1);i++)\r\nfor(j=0;jn[k1])\r\no++;\r\n}\r\nfor(i=0;i<20;i++)\r\nb[o][i] = a[i][k];\r\no=0;\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",b);\r\n}\r\n\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\nif(b[i][j]!='0')\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j, k=0,k1=0,o=0,l,h,y,L;\r\nchar t[100];\r\nchar m[20];\r\nchar a[20][20];\r\nchar b[20][20];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nfor(i=L;i<100;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;i0){\r\nfor(i=0;i<=h;i++)\r\na[i][j]=t[k++];\r\ny--;\r\n}\r\nif(y<=0){\r\nfor(i=0;in[k1])\r\no++;\r\n}\r\nfor(i=0;i<20;i++)\r\nb[i][k] = a[i][o];\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",b);\r\no=0;\r\n}\r\n\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\nif(b[i][j]!='0')\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n}",PARTIAL_ACCEPTED,9,384 1185395507835400192,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-19 11:21:26,C,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0,k1=0,o=0,l,h,y,L;\r\nchar t[400];\r\nchar m[20];\r\nchar a[20][20];\r\nchar b[20][20];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nfor(i=L;i<400;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;i<(h+1);i++)\r\nfor(j=0;jn[k1])\r\no++;\r\n}\r\nfor(i=0;i<20;i++)\r\nb[o][i] = a[i][k];\r\no=0;\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",b);\r\n}\r\n\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\nif(b[i][j]!='0')\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j, k=0,k1=0,o=0,l,h,y,L;\r\nchar t[400];\r\nchar m[20];\r\nchar a[20][20];\r\nchar b[20][20];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nfor(i=L;i<400;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;i0){\r\nfor(i=0;i<=h;i++)\r\na[i][j]=t[k++];\r\ny--;\r\n}\r\nif(y<=0){\r\nfor(i=0;in[k1])\r\no++;\r\n}\r\nfor(i=0;i<20;i++)\r\nb[i][k] = a[i][o];\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",b);\r\no=0;\r\n}\r\n\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\nif(b[i][j]!='0')\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n}",PARTIAL_ACCEPTED,9,384 1185395806100746240,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-19 11:22:37,C++,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t\r\n\tfor (int i = 0; i < content.size() / key.size(); i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\t\t\tdispose.push_back(content[i + 4 * order[j] - 4]);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nint main()\r\n{\r\n\tvector v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,15,512 1185448143288758272,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-19 14:50:35,C++,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t/*int num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\t\t\tif(i + num * order[j] - num < content.size())\r\n\t\t\t\tdispose.push_back(content[i + num * order[j] - num]);\r\n\t\t}\r\n\t}*/\r\n\tvector thenum;\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\tif (i < content.size() % order.size())\r\n\t\t\tthenum.push_back(content.size() / order.size() + 1);\r\n\t\telse\r\n\t\t\tthenum.push_back(content.size() / order.size() );\r\n\t}\r\n\r\n\tint num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\t\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++) \r\n\t\t{\r\n\t\t\tint sum = 0;\r\n\t\t\tfor (int k = 1; k < order[j]; k++)\r\n\t\t\t{\r\n\t\t\t\tsum = sum + thenum[k];\r\n\t\t\t}\r\n\t\t\tif (i + sum < content.size() && i v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,20,624 1185479162985410560,e4e852f5374f5608ea9767a7901b6ea101e3dd19b8f78828d77ea99d55ccddd2,2019-10-19 16:53:51,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"#加密函数\r\ndef encrypt(text,key):\r\n lt = len(text)\r\n lk = len(key)\r\n row = (lt+lk-1)//lk #加密密文排列的行数\r\n remainder = lt%lk #加密密文最后一行文字的个数\r\n if remainder == 0:\r\n remainder = lk\r\n dictionary = {}\r\n for i in range(lk):\r\n value = i\r\n dictionary[value]=key[i]\r\n for j in range(lk):\r\n m = min(dictionary.keys(),key = (lambda x:dictionary[x]))\r\n n = dictionary[m]\r\n if m < remainder:\r\n t = row\r\n else:\r\n t = row-1\r\n for l in range(t):\r\n print(text[m+l*lk],end=\""\"")\r\n dictionary.pop(m)\r\n#解密函数\r\ndef decrypt(text,key):\r\n lt = len(text)\r\n lk = len(key)\r\n row = (lt+lk-1)//lk #加密密文排列的行数\r\n remainder = lt%lk #加密密文最后一行文字的个数\r\n if remainder == 0:\r\n remainder = lk\r\n dictionary = {}\r\n for i in range(lk):\r\n value = i\r\n dictionary[value]=key[i]\r\n p = []\r\n for j in range(lk):\r\n m = min(dictionary.keys(),key = (lambda x:dictionary[x]))\r\n p.append(m)\r\n dictionary.pop(m)\r\n for i in range (row):\r\n for j in range(lk):\r\n print(text[p[j]*row+i],end=\""\"")\r\n#main函数\r\nif __name__ == '__main__':\r\n choice = input()\r\n text = input()\r\n key = input()\r\n if eval(choice)==1:\r\n encrypt(text,key)\r\n elif eval(choice)==0:\r\n decrypt(text,key)",PARTIAL_ACCEPTED,78,3104 1185479540942532608,e4e852f5374f5608ea9767a7901b6ea101e3dd19b8f78828d77ea99d55ccddd2,2019-10-19 16:55:21,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"#加密函数\r\ndef encrypt(text,key):\r\n lt = len(text)\r\n lk = len(key)\r\n row = (lt+lk-1)//lk #加密密文排列的行数\r\n remainder = lt%lk #加密密文最后一行文字的个数\r\n if remainder == 0:\r\n remainder = lk\r\n dictionary = {}\r\n for i in range(lk):\r\n value = i\r\n dictionary[value]=key[i]\r\n for j in range(lk):\r\n m = min(dictionary.keys(),key = (lambda x:dictionary[x]))\r\n n = dictionary[m]\r\n if m < remainder:\r\n t = row\r\n else:\r\n t = row-1\r\n for l in range(t):\r\n print(text[m+l*lk],end=\""\"")\r\n dictionary.pop(m)\r\n#解密函数\r\ndef decrypt(text,key):\r\n lt = len(text)\r\n lk = len(key)\r\n row = (lt+lk-1)//lk #加密密文排列的行数\r\n remainder = lt%lk #加密密文最后一行文字的个数\r\n if remainder == 0:\r\n remainder = lk\r\n dictionary = {}\r\n for i in range(lk):\r\n value = i\r\n dictionary[value]=key[i]\r\n p = []\r\n for j in range(lk):\r\n m = min(dictionary.keys(),key = (lambda x:dictionary[x]))\r\n p.append(m)\r\n dictionary.pop(m)\r\n for i in range (row):\r\n for j in range(lk):\r\n if p[j]*row+i\r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt();\r\nstring decrypt();\r\n\r\nstring encrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp ;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t,j = 0,sum = 0,s;\r\n\tchar c[26][21],result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (sum >= l_str)\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = '\\n';\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tc[j][t] = str[sum];\r\n\t\t\t}\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\tc[j][t] = '\\0';\r\n\t\tj++;\r\n\t}\r\n\ti = 0;\r\n\tfor (s = 0; s < l_key; s++)\r\n\t{\r\n\t\tfor (t = 0; t < j; t++)\r\n\t\t{\r\n\t\t\tif (c[t][s] == '\\n')\r\n\t\t\t{\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t\tresult[b[s] * j + t] = c[t][s];\r\n\t\t}\r\n\t}\r\n\tresult[l_str + i] = '\\0';\r\n\treturn result;\r\n}\r\n\r\nstring decrypt()\r\n{\r\n\tstring str, key;\r\n\tint l_str, l_key;\r\n\tchar temp;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tl_str = str.length();\r\n\tl_key = key.length();\r\n\tint b[26],i = 0,t = 0, sum = 0,s;\r\n\tchar c[26][21], result[500];\r\n\ttemp = 'A';\r\n\twhile (temp <= 'Z')\r\n\t{\r\n\t\tt = key.find(temp);\r\n\t\tif (t >= 0 && t < 26)\r\n\t\t{\r\n\t\t\tb[t] = i;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ttemp++;\r\n\t}\r\n\ts = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\ti = 0;\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tif (b[t] == s)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\twhile (i * l_key + t < l_str)\r\n\t\t{\r\n\t\t\tc[i][t]=str[sum];\r\n\t\t\tsum++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\ts++;\r\n\t}\r\n\ti = 0;\r\n\tt = 0;\r\n\tsum = 0;\r\n\twhile (sum < l_str)\r\n\t{\r\n\t\tfor (t = 0; t < l_key; t++)\r\n\t\t{\r\n\t\t\tresult[sum] = c[i][t];\r\n\t\t\tsum++;\r\n\t\t}\r\n\t\ti++;\r\n\t}\r\n\tresult[l_str] = '\\0';\r\n\treturn result;\r\n}\r\n\r\n\r\nint main()\r\n{\r\n\tint flag;\r\n\tstring a;\r\n\tcin >> flag;\r\n\tif (flag)\r\n\t{\r\n\t\ta = encrypt();\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta = decrypt();\r\n\t}\r\n\tfor (int i = 0; a[i] != '\\0'; i++)\r\n\t{\r\n\t\tif (a[i] != '\\n')\r\n\t\t{\r\n\t\t\tcout << a[i];\r\n\t\t}\r\n\t}\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",ACCEPTED,13,584 1185489027086643200,e4e852f5374f5608ea9767a7901b6ea101e3dd19b8f78828d77ea99d55ccddd2,2019-10-19 17:33:03,Python,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#加密函数\r\nfrom collections import deque\r\ndef encrypt(text,key):\r\n lt = len(text)\r\n lk = len(key)\r\n row = (lt+lk-1)//lk #加密密文排列的行数\r\n remainder = lt%lk #加密密文最后一行文字的个数\r\n if remainder == 0:\r\n remainder = lk\r\n dictionary = {}\r\n for i in range(lk):\r\n value = i\r\n dictionary[value]=key[i]\r\n for j in range(lk):\r\n m = min(dictionary.keys(),key = (lambda x:dictionary[x]))\r\n n = dictionary[m]\r\n if m < remainder:\r\n t = row\r\n else:\r\n t = row-1\r\n for l in range(t):\r\n print(text[m+l*lk],end=\""\"")\r\n dictionary.pop(m)\r\n#解密函数\r\ndef decrypt(text,key):\r\n lt = len(text)\r\n lk = len(key)\r\n row = (lt+lk-1)//lk #加密密文排列的行数\r\n remainder = lt%lk #加密密文最后一行文字的个数\r\n if remainder == 0:\r\n remainder = lk\r\n dictionary = {}\r\n for i in range(lk):\r\n value = i\r\n dictionary[value]=key[i]\r\n p = []\r\n for j in range(lk):\r\n m = min(dictionary.keys(),key = (lambda x:dictionary[x]))\r\n p.append(m)\r\n dictionary.pop(m)\r\n k = 0\r\n for i in range (row):\r\n for j in range(lk):\r\n if j\r\n#include\r\n\r\nusing namespace std; \r\n\r\nint main()\r\n{\r\n\tchar acc1 = 0;\r\n\tint acc2 = 0;\r\n\tint acc3 = 0;\r\n\tint acc4 = 0;\r\n\tint acc5 = 0;\r\n\tint k_len=0,o_len=0,c_len=0,posi=0;\r\n\tint choice;\r\n\tstring key;\r\n\tstring oritext;\r\n\tstring ciptext;\r\n\t\r\n\tcin>>choice;\r\n\tswitch(choice){\r\n\t\tcase 1:\r\n\t\t\tcin>>oritext;\r\n\t\t\tcin>>key;\r\n\t\t\t\r\n\t\t\to_len=oritext.length();\r\n\t\t\tk_len=key.length();\r\n\t\t\t\r\n\t\r\n\t\t\tfor(acc1='A';acc1 <'Z'+1;acc1++)\r\n\t\t\t{\r\n\t\t\t\tposi=key.find(acc1);\r\n\t\t\t\tif(posi != std::string::npos)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tfor(acc3=posi;acc3>ciptext;\r\n\t\t\tcin>>key;\r\n\t\t\tc_len=ciptext.length();\r\n\t\t\tk_len=key.length();\r\n\t\t\tacc2 = c_len/k_len;\r\n\t\t\tacc4 = c_len % k_len;\r\n\t\t\tfor(acc3 = 0;acc3<=acc2;acc3++)\r\n\t\t\t{\r\n\t\t\t\tfor(acc1='A';acc1 <'Z'+1;acc1++)\r\n\t\t\t\t{\r\n\t\t\t\t\tposi=key.find(acc1);\r\n\t\t\t\t\tif(posi != std::string::npos)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tif(posi\r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint f;\r\n\tstring str;\r\n\tstring key;\r\n\tcin >> f;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tvector key_to_num(20,0);\r\n\tfor (int i = 0; i < key.length(); i++) {\r\n\t\tint a = 0;\r\n\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\tif ((int)key[j] < (int)key[i]) {\r\n\t\t\t\ta += 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\tkey_to_num[i] = a;\r\n\t}\r\n\r\n\r\n\tif (f == 1) {\r\n\t\tint column = key.length();\r\n\t\tvector a(20,\""\"");\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tint b = i % key.length();//下标对密钥长度取余\r\n\t\t\ta[b].append(1,str[i]);\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tcout << a[key_to_num[i]];\r\n\t\t}\r\n\t}\r\n\telse if (f == 0) {\r\n\r\n\t}\r\n\r\n}",PARTIAL_ACCEPTED,11,384 1185554923318636544,b51d6d15bcad1e2c60943e855952c4e650835c9fd6fe1248270691e1199283a6,2019-10-19 21:54:54,C,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0,k1=0,o=0,l,h,y,L;\r\nchar t[400];\r\nchar m[20];\r\nchar a[20][20];\r\nchar b[20][20];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nfor(i=L;i<400;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;i<(h+1);i++)\r\nfor(j=0;jn[k1])\r\no++;\r\n}\r\nfor(i=0;i<20;i++)\r\nb[o][i] = a[i][k];\r\no=0;\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",b);\r\n}\r\n\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\nif(b[i][j]!='0')\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j, k=0,k1=0,o[20],l,h,y,L;\r\nfor(i=0;i<20;i++)\r\no[i]=0;\r\nchar t[100];\r\nchar m[20];\r\nchar a[10][10];\r\nchar b[10][10];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nint y1=1;\r\nfor(i=L;i<100;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<10;i++)\r\nfor(j=0;j<10;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;in[k1])\r\n(o[k])++;\r\n\t\t\t\t\t\tfor(i=0;i<20;i++)\r\n\t\t\t\t\t\tprintf(\""%d \"",o[i]);\r\nk=0;\r\nfor(j=0;j\r\n#include\r\n#include \r\nvoid jiami(); \r\nvoid jiemi();\r\nint main()\r\n{\r\nint F;\r\nscanf(\""%d\"", &F);\r\nif(F == 0)\r\njiemi();\r\nelse if(F == 1)\r\njiami();\r\nelse\r\nreturn 0;\r\n}\r\n\r\nvoid jiami(){\r\nint i, j, k=0,k1=0,o=0,l,h,y,L;\r\nchar t[400];\r\nchar m[20];\r\nchar a[20][20];\r\nchar b[20][20];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nfor(i=L;i<400;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;i<(h+1);i++)\r\nfor(j=0;jn[k1])\r\no++;\r\n}\r\nfor(i=0;i<20;i++)\r\nb[o][i] = a[i][k];\r\no=0;\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",b);\r\n}\r\n\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\nif(b[i][j]!='0')\r\nprintf(\""%c\"", b[i][j]);\r\n}\r\n}\r\n\r\n\r\nvoid jiemi(){\r\nint i, j, k=0,k1=0,o[20],l,h,y,L;\r\nfor(i=0;i<20;i++)\r\no[i]=0;\r\nchar t[400];\r\nchar m[20];\r\nchar a[20][20];\r\nchar b[20][20];\r\nint n[20];\r\n\r\nscanf(\""%s\"", t);\r\nscanf(\""%s\"", m);\r\nL = strlen(t);\r\nl = strlen(m);\r\nh = L/l;\r\ny = L%l;\r\nint y1=1;\r\nfor(i=L;i<400;i++)\r\nt[i]='0';\r\n\t\t\t\t\t\t//printf(\""%s\\n\"",t);\r\nfor(i=0;i<20;i++)\r\nfor(j=0;j<20;j++)\r\n{\r\n\ta[i][j]='0';\r\n\tb[i][j]='0';\r\n}\r\n\r\nfor(i=0;in[k1])\r\n(o[k])++;\r\n\t\t\t\t\t\t//for(i=0;i<20;i++)\r\n\t\t\t\t\t\t//printf(\""%d \"",o[i]);\r\nk=0;\r\nfor(j=0;j\r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt(string str, string key) {\r\n\tint s_len, k_len, d, m, i, j;\r\n\tint order[20];\r\n\ts_len = str.size();\r\n\tk_len = key.size();\r\n\td = s_len % k_len;\r\n\tstring ciphertext(s_len, '1');\r\n\tif (d != 0) {\r\n\t\ts_len = s_len + k_len - d;\r\n\t}\r\n\r\n\tstring temp(s_len, '1');\r\n\tstring key_o = key;\r\n\tsort(key_o.begin(), key_o.end());\r\n\tfor (i = 0; i < k_len; i++) {\r\n\t\tfor (j = 0; j < k_len; j++) {\r\n\t\t\tif (key[i] == key_o[j]) {\r\n\t\t\t\torder[i] = j;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tm = s_len / k_len;\r\n\r\n\tfor (i = 0; i < m; i++) {\r\n\t\tfor (j = 0; j < k_len; j++) {\r\n\t\t\tif (i * k_len + j < str.size()) {\r\n\t\t\t\ttemp[i + m * order[j]] = str[i * k_len + j];\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\ttemp[i + m * order[j]] = ' ';\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tj = 0;\r\n\tfor (i = 0; i < s_len; i++) {\r\n\t\tif (temp[i] != ' ') {\r\n\t\t\tciphertext[j] = temp[i];\r\n\t\t\tj++;\r\n\t\t}\r\n\t}\r\n\treturn ciphertext;\r\n}\r\n\r\nstring decrypt(string str, string key) {\r\n\tint s_len, k_len, d, m, n, i, j;\r\n\tint order[20];\r\n\ts_len = str.size();\r\n\tk_len = key.size();\r\n\td = s_len % k_len;\r\n\tn = k_len - d;\r\n\tstring plaintext(s_len, '1');\r\n\tif (d != 0) {\r\n\t\ts_len = s_len + k_len - d;\r\n\t}\r\n\tstring temp(s_len, '1');\r\n\tstring tmp(s_len, '1');\r\n\tm = s_len / k_len;\r\n\tstring key_o = key;\r\n\tsort(key_o.begin(), key_o.end());\r\n\tfor (i = 0; i < k_len; i++) {\r\n\t\tfor (j = 0; j < k_len; j++) {\r\n\t\t\tif (key[i] == key_o[j]) {\r\n\t\t\t\torder[i] = j;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tfor (i = 0; i < k_len; i++) {\r\n\t\tif (i < d) {\r\n\t\t\tfor (j = 0; j < m; j++) {\r\n\t\t\t\ttmp[i * m + j] = str[i * m + j];\r\n\t\t\t}\r\n\t\t}\r\n\t\telse {\r\n\t\t\tfor (j = 0; j < m; j++) {\r\n\t\t\t\tif (j == m - 1) {\r\n\t\t\t\t\ttmp[i * m + j] = '1';\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\ttmp[i * m + j] = str[d * m + (i - d) * (m - 1) + j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tfor (i = 0; i < k_len; i++) {\r\n\t\tfor (j = 0; j < m; j++) {\r\n\t\t\ttemp[j * m+ order[i]] = tmp[i * m + j];\r\n\t\t}\r\n\t}\r\n\r\n\tfor (i = 0; i < s_len - (k_len - d); i++) {\r\n\t\tplaintext[i] = temp[i];\r\n\t}\r\n\r\n\treturn plaintext;\r\n}\r\n\r\nint main(void) {\r\n\tint i;\r\n\tstring str, key;\r\n\r\n\tcin >> i >> str >> key;\r\n\r\n\tif (i == 1) {\r\n\t\tcout << encrypt(str, key) << endl;\r\n\t}\r\n\tif (i == 0) {\r\n\t\tcout << decrypt(str, key) << endl;\r\n\t}\r\n\tsystem(\""pause\"");\r\n}\r\n",PARTIAL_ACCEPTED,17,516 1185571260443095040,c5565679d73b281e0e51f3e98b2448dccc4942591da75413db079ec5cf025e1f,2019-10-19 22:59:49,C,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \n\n\n\nvoid Decrypt(char *s, char *key);\nvoid Encrypt(char *s, char *key);\n\nint main()\n{\n int mode = 0;\n char s[1005] = \""\"";\n char key[25] = \""\"";\n \n scanf(\""%d\"",&mode);\n getchar();\n scanf(\""%[^\\n]\"",s);\n getchar();\n scanf(\""%[^\\n]\"",key);\n// printf(\""mode = %d\\n\"",mode);\n// printf(\""s = %s\\n\"",s);\n// printf(\""key = %s\\n\"",key);\n \n if(mode==0)\n {\n Decrypt(s, key);\n }\n else\n {\n Encrypt(s, key);\n }\n \n\n return 0;\n}\n\n\nvoid Decrypt(char *s, char *key)\n{\n int i = 0;\n while(key[i]!='\\0')\n {\n i++;\n }\n int x = i;\n \n int j = 0;\n while(s[j]!='\\0')\n {\n j++;\n }\n \n int y = j/i;\n int excess = j%i;\n char invert[45][25] = {\""\""};\n \n int order[25] = {0};\n int cnt = 0;\n int ind = 0;\n int countflag = 0;\n int s_index = 0;\n for(cnt = 0;cnt']')\n {\n order[cnt] = key[cnt] - 'a';\n }\n else\n {\n order[cnt] = key[cnt] - 'A';\n }\n }\n for(cnt = 0;cnt<26;cnt++)\n {\n for(ind = 0;ind']')\n {\n order[cnt] = key[cnt] - 'a';\n }\n else\n {\n order[cnt] = key[cnt] - 'A';\n }\n }\n \n char ret[1005] = \""\"";\n int retindex = 0;\n \n for (cnt = 0;cnt < 26;cnt++)\n {\n for(ind = 0;ind\r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstring encrypt(string str, string key) {\r\n\tint s_len, k_len, d, m, i, j;\r\n\tint order[20];\r\n\ts_len = str.size();\r\n\tk_len = key.size();\r\n\td = s_len % k_len;\r\n\tstring ciphertext(s_len, '1');\r\n\tif (d != 0) {\r\n\t\ts_len = s_len + k_len - d;\r\n\t}\r\n\r\n\tstring temp(s_len, '1');\r\n\tstring key_o = key;\r\n\tsort(key_o.begin(), key_o.end());\r\n\tfor (i = 0; i < k_len; i++) {\r\n\t\tfor (j = 0; j < k_len; j++) {\r\n\t\t\tif (key[i] == key_o[j]) {\r\n\t\t\t\torder[i] = j;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tm = s_len / k_len;\r\n\r\n\tfor (i = 0; i < m; i++) {\r\n\t\tfor (j = 0; j < k_len; j++) {\r\n\t\t\tif (i * k_len + j < str.size()) {\r\n\t\t\t\ttemp[i + m * order[j]] = str[i * k_len + j];\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\ttemp[i + m * order[j]] = ' ';\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tj = 0;\r\n\tfor (i = 0; i < s_len; i++) {\r\n\t\tif (temp[i] != ' ') {\r\n\t\t\tciphertext[j] = temp[i];\r\n\t\t\tj++;\r\n\t\t}\r\n\t}\r\n\treturn ciphertext;\r\n}\r\n\r\nstring decrypt(string str, string key) {\r\n\tint s_len, k_len, d, m, n, i, j;\r\n\tint order[20];\r\n\ts_len = str.size();\r\n\tk_len = key.size();\r\n\td = s_len % k_len;\r\n\tn = k_len - d;\r\n\tstring plaintext(s_len, '1');\r\n\tif (d != 0) {\r\n\t\ts_len = s_len + k_len - d;\r\n\t}\r\n\tstring temp(s_len, '1');\r\n\tstring tmp(s_len, '1');\r\n\tm = s_len / k_len;\r\n\tstring key_o = key;\r\n\tsort(key_o.begin(), key_o.end());\r\n\tfor (i = 0; i < k_len; i++) {\r\n\t\tfor (j = 0; j < k_len; j++) {\r\n\t\t\tif (key[i] == key_o[j]) {\r\n\t\t\t\torder[i] = j;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tfor (i = 0; i < k_len; i++) {\r\n\t\tif (i < d) {\r\n\t\t\tfor (j = 0; j < m; j++) {\r\n\t\t\t\ttmp[i * m + j] = str[i * m + j];\r\n\t\t\t}\r\n\t\t}\r\n\t\telse {\r\n\t\t\tfor (j = 0; j < m; j++) {\r\n\t\t\t\tif (j == m - 1) {\r\n\t\t\t\t\ttmp[i * m + j] = '1';\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\ttmp[i * m + j] = str[d * m + (i - d) * (m - 1) + j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tif (d == 0) {\r\n\t\ttmp = str;\r\n\t}\r\n\t\r\n\tfor (i = 0; i < k_len; i++) {\r\n\t\tfor (j = 0; j < m; j++) {\r\n\t\t\ttemp[j * m+ order[i]] = tmp[i * m + j];\r\n\t\t}\r\n\t}\r\n\r\n\tif (d == 0) {\r\n\t\tplaintext = temp;\r\n\t}\r\n\telse {\r\n\t\tfor (i = 0; i < s_len - (k_len - d); i++) {\r\n\t\t\tplaintext[i] = temp[i];\r\n\t\t}\r\n\t}\r\n\r\n\treturn plaintext;\r\n}\r\n\r\nint main(void) {\r\n\tint i;\r\n\tstring str, key;\r\n\r\n\tcin >> i >> str >> key;\r\n\r\n\tif (i == 1) {\r\n\t\tcout << encrypt(str, key) << endl;\r\n\t}\r\n\tif (i == 0) {\r\n\t\tcout << decrypt(str, key) << endl;\r\n\t}\r\n\tsystem(\""pause\"");\r\n}\r\n",ACCEPTED,16,640 1185577624041123840,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-19 23:25:06,C++,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t/*int num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\t\t\tif(i + num * order[j] - num < content.size())\r\n\t\t\t\tdispose.push_back(content[i + num * order[j] - num]);\r\n\t\t}\r\n\t}*/\r\n\tvector thenum;\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\tif (i < content.size() % order.size()) \r\n\t\t\tthenum.push_back(content.size() / order.size() + 1);\r\n\t\telse \r\n\t\t\tthenum.push_back(content.size() / order.size());\r\n\t}\r\n\r\n\tint num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\t\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++) \r\n\t\t{\r\n\t\t\tint sum = 0;\r\n\t\t\tfor (int k = 1; k < order[j]; k++)\r\n\t\t\t{\r\n\t\t\t\tsum = sum + thenum[k-1];\r\n\t\t\t}\r\n\t\t\tif (i + sum < content.size() && i v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}\r\n",PARTIAL_ACCEPTED,16,576 1185583350910251008,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-19 23:47:51,C++,6.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t\r\n\tvector thenum;\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\tif (i < content.size() % order.size())\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size() + 1);\r\n\t\t\tcout << content.size() / order.size() + 1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size());\r\n\t\t\tcout << content.size() / order.size();\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\tint num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\t\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++) \r\n\t\t{\r\n\t\t\tint sum = 0;\r\n\t\t\tfor (int k = 1; k < order[j]; k++)\r\n\t\t\t{\r\n\t\t\t\tsum = sum + thenum[k];\r\n\t\t\t}\r\n\t\t\tif (i + sum < content.size() && i v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,14,512 1185583435308036096,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-19 23:48:12,C++,6.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t\r\n\tvector thenum;\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\tif (i < content.size() % order.size())\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size() + 1);\r\n\t\t\tcout << content.size() / order.size() + 1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size());\r\n\t\t\tcout << content.size() / order.size();\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\tint num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\t\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++) \r\n\t\t{\r\n\t\t\tint sum = 0;\r\n\t\t\tfor (int k = 1; k < order[j]; k++)\r\n\t\t\t{\r\n\t\t\t\tsum = sum + thenum[k-1];\r\n\t\t\t}\r\n\t\t\tif (i + sum < content.size() && i v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,16,620 1185583594288934912,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-19 23:48:49,C++,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t\r\n\tvector thenum;\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\tif (i < content.size() % order.size())\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size() + 1);\r\n\t\t\t//cout << content.size() / order.size() + 1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size());\r\n\t\t\t//cout << content.size() / order.size();\r\n\t\t}\r\n\t\t//cout << endl;\r\n\t}\r\n\tint num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\t\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++) \r\n\t\t{\r\n\t\t\tint sum = 0;\r\n\t\t\tfor (int k = 1; k < order[j]; k++)\r\n\t\t\t{\r\n\t\t\t\tsum = sum + thenum[k];\r\n\t\t\t}\r\n\t\t\tif (i + sum < content.size() && i v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,17,552 1185583709498077184,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-19 23:49:17,C++,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t\r\n\tvector thenum;\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\tif (i < content.size() % order.size())\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size() + 1);\r\n\t\t\t//cout << content.size() / order.size() + 1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size());\r\n\t\t\t//cout << content.size() / order.size();\r\n\t\t}\r\n\t\t//cout << endl;\r\n\t}\r\n\tint num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\t\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++) \r\n\t\t{\r\n\t\t\tint sum = 0;\r\n\t\t\tfor (int k = 1; k < order[j]; k++)\r\n\t\t\t{\r\n\t\t\t\tsum = sum + thenum[k-1];\r\n\t\t\t}\r\n\t\t\tif (i + sum < content.size() && i v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,17,668 1185767026134577152,95c99869f90bfc0dc5843148f6ac8177f9afd8b8632e3a49b5103e48f7e6f8ab,2019-10-20 11:57:43,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#define MAX 20\r\n#define SIZE 10000\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\n\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#define MAX 20\r\n#define SIZE 10000\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\n\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#define MAX 20\r\n#define SIZE 10000\r\n#include\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\n\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#define MAX 20\r\n#define SIZE 10000\r\n#include\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\n\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#define MAX 20\r\n#define SIZE 10000\r\n#include\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\n\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#define MAX 20\r\n#define SIZE 10000\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\n\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#define MAX 20\r\n#define SIZE 100000\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\n\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n char str[];\r\n char my[20];\r\n scanf(\""%d\"",%flag);\r\n getchar();\r\n scanf(\""%c\"",str);\r\n getchar();\r\n scanf(\""%d\"",my);\r\n temp=my;\r\n k=sizeof(temp)/sizeof(temp[0]);\r\n sort(tep,temp+20);\r\n for i=0:k\r\n {\r\n for j=0:20\r\n { if my[j]==temp[i]\r\n {my[j]=i+1;}\r\n else;\r\n } \r\n } \r\n l=(sizeof(str)/sizeof(str[0]))/k;\r\n char str2[l-1][k-1];\r\n if flag==0\r\n {\r\n for i=0:sizeof(str)/sizeof(str[0])\r\n {for j=0:l-1\r\n {for n=0:k-1\r\n str2[n][j]=str[i];\r\n }\r\n }\r\n \r\n }\r\n}",COMPILE_ERROR,0,0 1185772213171613696,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 12:18:20,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n char str[];\r\n char my[20];\r\n scanf(\""%d\"",%flag);\r\n getchar();\r\n scanf(\""%c\"",str);\r\n getchar();\r\n scanf(\""%d\"",my);\r\n temp=my;\r\n k=sizeof(temp)/sizeof(temp[0]);\r\n sort(tep,temp+20);\r\n for i=0:k\r\n {\r\n for j=0:20\r\n { if my[j]==temp[i]\r\n {my[j]=i+1;}\r\n else;\r\n } \r\n } \r\n l=(sizeof(str)/sizeof(str[0]))/k;\r\n char str2[l-1][k-1];\r\n if flag==0\r\n {\r\n for i=0:sizeof(str)/sizeof(str[0])\r\n {for j=0:l-1\r\n {for n=0:k-1\r\n str2[n][j]=str[i];\r\n }\r\n }\r\n\r\n }\r\n}",COMPILE_ERROR,0,0 1185772308499755008,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 12:18:42,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n char str[];\r\n char my[20];\r\n scanf(\""%d\"",%flag);\r\n getchar();\r\n scanf(\""%c\"",str);\r\n getchar();\r\n scanf(\""%d\"",my);\r\n temp=my;\r\n k=sizeof(temp)/sizeof(temp[0]);\r\n sort(tep,temp+20);\r\n for i=0:k\r\n {\r\n for j=0:20\r\n { if my[j]==temp[i]\r\n {my[j]=i+1;}\r\n else;\r\n } \r\n } \r\n l=(sizeof(str)/sizeof(str[0]))/k;\r\n char str2[l-1][k-1];\r\n if flag==0\r\n {\r\n for i=0:sizeof(str)/sizeof(str[0])\r\n {for j=0:l-1\r\n {for n=0:k-1\r\n str2[n][j]=str[i];\r\n }\r\n }\r\n\r\n }\r\n}",COMPILE_ERROR,0,0 1185772380658561024,95c99869f90bfc0dc5843148f6ac8177f9afd8b8632e3a49b5103e48f7e6f8ab,2019-10-20 12:19:00,C++,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#define MAX 20\r\n#define SIZE 10000\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\nint add=0;\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n char str[200];\r\n char my[20];\r\n scanf(\""%d\"",%flag);\r\n getchar();\r\n scanf(\""%c\"",str);\r\n getchar();\r\n scanf(\""%d\"",my);\r\n temp=my;\r\n k=sizeof(temp)/sizeof(temp[0]);\r\n sort(tep,temp+20);\r\n for i=0:k\r\n {\r\n for j=0:20\r\n { if my[j]==temp[i]\r\n {my[j]=i+1;}\r\n else;\r\n } \r\n } \r\n l=(sizeof(str)/sizeof(str[0]))/k;\r\n char str2[l-1][k-1];\r\n if flag==0\r\n {\r\n for i=0:sizeof(str)/sizeof(str[0])\r\n {for j=0:l-1\r\n {for n=0:k-1\r\n str2[n][j]=str[i];\r\n }\r\n }\r\n\r\n }\r\n}",COMPILE_ERROR,0,0 1185772558245392384,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 12:19:42,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n char str[200];\r\n char my[20];\r\n char temp[20];\r\n scanf(\""%d\"",%flag);\r\n getchar();\r\n scanf(\""%c\"",str);\r\n getchar();\r\n scanf(\""%d\"",my);\r\n temp=my;\r\n k=sizeof(temp)/sizeof(temp[0]);\r\n sort(tep,temp+20);\r\n for i=0:k\r\n {\r\n for j=0:20\r\n { if my[j]==temp[i]\r\n {my[j]=i+1;}\r\n else;\r\n } \r\n } \r\n l=(sizeof(str)/sizeof(str[0]))/k;\r\n char str2[l-1][k-1];\r\n if flag==0\r\n {\r\n for i=0:sizeof(str)/sizeof(str[0])\r\n {for j=0:l-1\r\n {for n=0:k-1\r\n str2[n][j]=str[i];\r\n }\r\n }\r\n\r\n }\r\n}",COMPILE_ERROR,0,0 1185774053359579136,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 12:25:38,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n char str[200];\r\n char my[20];\r\n char temp[20];\r\n scanf(\""%d\"",%flag);\r\n getchar();\r\n scanf(\""%c\"",str);\r\n getchar();\r\n scanf(\""%d\"",my);\r\n temp=my;\r\n k=sizeof(temp)/sizeof(temp[0]);\r\n sort(tep,temp+20);\r\n for i=0:k\r\n {\r\n for j=0:20\r\n { if my[j]==temp[i]\r\n {my[j]=i+1;}\r\n else;\r\n } \r\n } \r\n l=(sizeof(str)/sizeof(str[0]))/k;\r\n char str2[l-1][k-1];\r\n if flag==0\r\n {\r\n for i=0:sizeof(str)/sizeof(str[0])\r\n {for j=0:l-1\r\n {for n=0:k-1\r\n str2[n][j]=str[i];\r\n }\r\n }\r\n\r\n }\r\n}",COMPILE_ERROR,0,0 1185775554807164928,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 12:31:36,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n char str[200];\r\n char my[20];\r\n char temp[20];\r\n scanf(\""%d\"",%flag);\r\n getchar();\r\n scanf(\""%c\"",str);\r\n getchar();\r\n scanf(\""%d\"",my);\r\n temp=my;\r\n k=sizeof(temp)/sizeof(temp[0]);\r\n sort(tep,temp+20);\r\n for i=0:k\r\n {\r\n for j=0:20\r\n { if my[j]==temp[i]\r\n {my[j]=i+1;}\r\n else;\r\n } \r\n } \r\n l=(sizeof(str)/sizeof(str[0]))/k;\r\n char str2[l-1][k-1];\r\n if flag==0\r\n {\r\n for i=0:sizeof(str)/sizeof(str[0])\r\n {for j=0:l-1\r\n {for n=0:k-1\r\n str2[n][j]=str[i];\r\n }\r\n }\r\n\r\n }\r\n}",COMPILE_ERROR,0,0 1185785391238574080,95c99869f90bfc0dc5843148f6ac8177f9afd8b8632e3a49b5103e48f7e6f8ab,2019-10-20 13:10:42,C++,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#define MAX 20\r\n#define SIZE 10000\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\nint add=0;\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#define MAX 20\r\n#define SIZE 10000\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\nint add=0;\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#define MAX 20\r\n#define SIZE 65535\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\nint add=0;\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#define MAX 20\r\n#define SIZE 65535\r\n#include \r\n#include\r\nusing namespace std;\r\n\r\nint kn=0, an=0;\r\nint add=0;\r\nstruct result{\r\n\tint data[SIZE];\r\n\tint order;\r\n//\tint k;\r\n}table1[MAX],table2[MAX];\r\n\r\n\r\nvoid code(char *A, char *b){\r\nint j=0, i, r;\r\nfor(j=0; j\r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass code\r\n{\r\nprotected:\r\n\tstring ciphertext;\r\n\tstring plaintext;\r\n\tstring key;\r\n\tstring CodeMatrix[100];\r\n\r\n\tint order[20];\r\n\tint RowNumber;\r\n\tint Remainder;\r\n\r\npublic:\r\n\tvoid InputCiphertext()\r\n\t{\r\n\t\tcin >> ciphertext;\r\n\t}\r\n\r\n\tvoid InputPlaintext()\r\n\t{\r\n\t\tcin >> plaintext;\r\n\t}\r\n\r\n\tvoid InputKey()\r\n\t{\r\n\t\tcin >> key;\r\n\t}\r\n\r\n\tconst int GetLength(string str)\r\n\t{\r\n\t\treturn str.length();\r\n\t}\r\n\r\n\tconst int GetRowNumber()\r\n\t{\r\n\t\treturn RowNumber;\r\n\t}\r\n\r\n\tconst int GetRemainder()\r\n\t{\r\n\t\treturn Remainder;\r\n\t}\r\n\r\n\tvoid CalculateOrder()\r\n\t{\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key) - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass encode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[0] = plaintext;\r\n\t\tfor (int i = 0; i < RowNumber - 1; i++)\r\n\t\t{\r\n\t\t\tCodeMatrix[i + 1] = CodeMatrix[i].substr(GetLength(key));\r\n\t\t\tCodeMatrix[i].erase(GetLength(key));\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(plaintext) / GetLength(key);\r\n\t\tRemainder = GetLength(plaintext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << endl;\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintCiphertext()\r\n\t{\r\n\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][order[j]];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass decode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[order[0]] = ciphertext;\r\n\t\tfor (int i = 0; i < GetLength(key) - 1; i++)\r\n\t\t{\r\n\t\t\tif (Remainder > 0 && order[i] < Remainder || Remainder == 0)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber);\r\n\t\t\t}\r\n\t\t\telse if (Remainder > 0 && order[i] >= Remainder)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber - 1);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber - 1);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(ciphertext) / GetLength(key);\r\n\t\tRemainder = GetLength(ciphertext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t\t{\r\n\t\t\t\t//cout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\tif (j < RowNumber || order[i] < Remainder && Remainder > 0 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintPlaintext()\r\n\t{\r\n\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t\t{\r\n\t\t\t\tif (j == RowNumber - 1 && Remainder > 0 || j < RowNumber - 1 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nint main()\r\n{\r\n\tint ModeNumber(-1);\r\n\r\nFIRST:\r\n\r\n\tcout << \""Please input the mode number, 1 for encode and 0 for decode\"" << endl;\r\n\tcout << \""mode number:\"";\r\n\tcin >> ModeNumber;\r\n\t\r\n\tif (ModeNumber == 1)//encode\r\n\t{\r\n\t\tencode ec;\r\n\t\tec.InputPlaintext();\r\n\t\tec.InputKey();\r\n\t\tec.CalculateRowNumberAndRemainder();\r\n\t\tec.CalculateOrder();\r\n\t\tec.BuildCodeMatrix();\r\n\t\t//ec.PrintCodeMatrix();\r\n\t\tec.PrintCiphertext();\r\n\t}\r\n\telse if (ModeNumber == 0)//decode\r\n\t{\r\n\t\tdecode dc;\r\n\t\tdc.InputCiphertext();\r\n\t\tdc.InputKey();\r\n\t\tdc.CalculateRowNumberAndRemainder();\r\n\t\tcout << dc.GetRowNumber() << \"" \"" << dc.GetRemainder() << endl;\r\n\t\tdc.CalculateOrder();\r\n\t\tdc.BuildCodeMatrix();\r\n\t\t//dc.PrintCodeMatrix();\r\n\t\tdc.PrintPlaintext();\r\n\t}\r\n\telse//undefiined\r\n\t{\r\n\t\tcout << \""This mode is not defined!!!\"" << endl;\r\n\t\tcout << \""Please input again.\"" << endl;\r\n\t\tgoto FIRST;\r\n\t}\r\n}",WRONG_ANSWER,17,428 1185791600779816960,b3ca82c2bd2172e23900f3784b44cdf291c6c584d36e6cda5c882b257a293ce8,2019-10-20 13:35:22,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass code\r\n{\r\nprotected:\r\n\tstring ciphertext;\r\n\tstring plaintext;\r\n\tstring key;\r\n\tstring CodeMatrix[100];\r\n\r\n\tint order[20];\r\n\tint RowNumber;\r\n\tint Remainder;\r\n\r\npublic:\r\n\tvoid InputCiphertext()\r\n\t{\r\n\t\tcin >> ciphertext;\r\n\t}\r\n\r\n\tvoid InputPlaintext()\r\n\t{\r\n\t\tcin >> plaintext;\r\n\t}\r\n\r\n\tvoid InputKey()\r\n\t{\r\n\t\tcin >> key;\r\n\t}\r\n\r\n\tconst int GetLength(string str)\r\n\t{\r\n\t\treturn str.length();\r\n\t}\r\n\r\n\tconst int GetRowNumber()\r\n\t{\r\n\t\treturn RowNumber;\r\n\t}\r\n\r\n\tconst int GetRemainder()\r\n\t{\r\n\t\treturn Remainder;\r\n\t}\r\n\r\n\tvoid CalculateOrder()\r\n\t{\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key) - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass encode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[0] = plaintext;\r\n\t\tfor (int i = 0; i < RowNumber - 1; i++)\r\n\t\t{\r\n\t\t\tCodeMatrix[i + 1] = CodeMatrix[i].substr(GetLength(key));\r\n\t\t\tCodeMatrix[i].erase(GetLength(key));\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(plaintext) / GetLength(key);\r\n\t\tRemainder = GetLength(plaintext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << endl;\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintCiphertext()\r\n\t{\r\n\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][order[j]];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass decode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[order[0]] = ciphertext;\r\n\t\tfor (int i = 0; i < GetLength(key) - 1; i++)\r\n\t\t{\r\n\t\t\tif (Remainder > 0 && order[i] < Remainder || Remainder == 0)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber);\r\n\t\t\t}\r\n\t\t\telse if (Remainder > 0 && order[i] >= Remainder)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber - 1);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber - 1);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(ciphertext) / GetLength(key);\r\n\t\tRemainder = GetLength(ciphertext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t\t{\r\n\t\t\t\t//cout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\tif (j < RowNumber || order[i] < Remainder && Remainder > 0 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintPlaintext()\r\n\t{\r\n\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t\t{\r\n\t\t\t\tif (j == RowNumber - 1 && Remainder > 0 || j < RowNumber - 1 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nint main()\r\n{\r\n\tint ModeNumber(-1);\r\n\r\nFIRST:\r\n\r\n\tcout << \""Please input the mode number, 1 for encode and 0 for decode\"" << endl;\r\n\tcout << \""mode number:\"";\r\n\tcin >> ModeNumber;\r\n\t\r\n\tif (ModeNumber == 1)//encode\r\n\t{\r\n\t\tencode ec;\r\n\t\tec.InputPlaintext();\r\n\t\tec.InputKey();\r\n\t\tec.CalculateRowNumberAndRemainder();\r\n\t\tec.CalculateOrder();\r\n\t\tec.BuildCodeMatrix();\r\n\t\t//ec.PrintCodeMatrix();\r\n\t\tec.PrintCiphertext();\r\n\t}\r\n\telse if (ModeNumber == 0)//decode\r\n\t{\r\n\t\tdecode dc;\r\n\t\tdc.InputCiphertext();\r\n\t\tdc.InputKey();\r\n\t\tdc.CalculateRowNumberAndRemainder();\r\n\t\tcout << dc.GetRowNumber() << \"" \"" << dc.GetRemainder() << endl;\r\n\t\tdc.CalculateOrder();\r\n\t\tdc.BuildCodeMatrix();\r\n\t\t//dc.PrintCodeMatrix();\r\n\t\tdc.PrintPlaintext();\r\n\t}\r\n\telse//undefiined\r\n\t{\r\n\t\tcout << \""This mode is not defined!!!\"" << endl;\r\n\t\tcout << \""Please input again.\"" << endl;\r\n\t\tgoto FIRST;\r\n\t}\r\n}",WRONG_ANSWER,14,424 1185792151198330880,b3ca82c2bd2172e23900f3784b44cdf291c6c584d36e6cda5c882b257a293ce8,2019-10-20 13:37:33,C++,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass code\r\n{\r\nprotected:\r\n\tstring ciphertext;\r\n\tstring plaintext;\r\n\tstring key;\r\n\tstring CodeMatrix[100];\r\n\r\n\tint order[20];\r\n\tint RowNumber;\r\n\tint Remainder;\r\n\r\npublic:\r\n\tvoid InputCiphertext()\r\n\t{\r\n\t\tcin >> ciphertext;\r\n\t}\r\n\r\n\tvoid InputPlaintext()\r\n\t{\r\n\t\tcin >> plaintext;\r\n\t}\r\n\r\n\tvoid InputKey()\r\n\t{\r\n\t\tcin >> key;\r\n\t}\r\n\r\n\tconst int GetLength(string str)\r\n\t{\r\n\t\treturn str.length();\r\n\t}\r\n\r\n\tconst int GetRowNumber()\r\n\t{\r\n\t\treturn RowNumber;\r\n\t}\r\n\r\n\tconst int GetRemainder()\r\n\t{\r\n\t\treturn Remainder;\r\n\t}\r\n\r\n\tvoid CalculateOrder()\r\n\t{\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key) - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass encode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[0] = plaintext;\r\n\t\tfor (int i = 0; i < RowNumber - 1; i++)\r\n\t\t{\r\n\t\t\tCodeMatrix[i + 1] = CodeMatrix[i].substr(GetLength(key));\r\n\t\t\tCodeMatrix[i].erase(GetLength(key));\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(plaintext) / GetLength(key);\r\n\t\tRemainder = GetLength(plaintext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << endl;\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintCiphertext()\r\n\t{\r\n\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][order[j]];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass decode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[order[0]] = ciphertext;\r\n\t\tfor (int i = 0; i < GetLength(key) - 1; i++)\r\n\t\t{\r\n\t\t\tif (Remainder > 0 && order[i] < Remainder || Remainder == 0)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber);\r\n\t\t\t}\r\n\t\t\telse if (Remainder > 0 && order[i] >= Remainder)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber - 1);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber - 1);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(ciphertext) / GetLength(key);\r\n\t\tRemainder = GetLength(ciphertext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t\t{\r\n\t\t\t\t//cout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\tif (j < RowNumber || order[i] < Remainder && Remainder > 0 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintPlaintext()\r\n\t{\r\n\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t\t{\r\n\t\t\t\tif (j == RowNumber - 1 && Remainder > 0 || j < RowNumber - 1 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nint main()\r\n{\r\n\tint ModeNumber(-1);\r\n\r\nFIRST:\r\n\r\n\t//cout << \""Please input the mode number, 1 for encode and 0 for decode\"" << endl;\r\n\t//cout << \""mode number:\"";\r\n\tcin >> ModeNumber;\r\n\t\r\n\tif (ModeNumber == 1)//encode\r\n\t{\r\n\t\tencode ec;\r\n\t\tec.InputPlaintext();\r\n\t\tec.InputKey();\r\n\t\tec.CalculateRowNumberAndRemainder();\r\n\t\tec.CalculateOrder();\r\n\t\tec.BuildCodeMatrix();\r\n\t\t//ec.PrintCodeMatrix();\r\n\t\tec.PrintCiphertext();\r\n\t}\r\n\telse if (ModeNumber == 0)//decode\r\n\t{\r\n\t\tdecode dc;\r\n\t\tdc.InputCiphertext();\r\n\t\tdc.InputKey();\r\n\t\tdc.CalculateRowNumberAndRemainder();\r\n\t\tdc.CalculateOrder();\r\n\t\tdc.BuildCodeMatrix();\r\n\t\t//dc.PrintCodeMatrix();\r\n\t\tdc.PrintPlaintext();\r\n\t}\r\n\telse//undefiined\r\n\t{\r\n\t\tcout << \""This mode is not defined!!!\"" << endl;\r\n\t\tcout << \""Please input again.\"" << endl;\r\n\t\tgoto FIRST;\r\n\t}\r\n}",PARTIAL_ACCEPTED,15,424 1185792387518001152,b3ca82c2bd2172e23900f3784b44cdf291c6c584d36e6cda5c882b257a293ce8,2019-10-20 13:38:30,C++,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass code\r\n{\r\nprotected:\r\n\tstring ciphertext;\r\n\tstring plaintext;\r\n\tstring key;\r\n\tstring CodeMatrix[10000];\r\n\r\n\tint order[200];\r\n\tint RowNumber;\r\n\tint Remainder;\r\n\r\npublic:\r\n\tvoid InputCiphertext()\r\n\t{\r\n\t\tcin >> ciphertext;\r\n\t}\r\n\r\n\tvoid InputPlaintext()\r\n\t{\r\n\t\tcin >> plaintext;\r\n\t}\r\n\r\n\tvoid InputKey()\r\n\t{\r\n\t\tcin >> key;\r\n\t}\r\n\r\n\tconst int GetLength(string str)\r\n\t{\r\n\t\treturn str.length();\r\n\t}\r\n\r\n\tconst int GetRowNumber()\r\n\t{\r\n\t\treturn RowNumber;\r\n\t}\r\n\r\n\tconst int GetRemainder()\r\n\t{\r\n\t\treturn Remainder;\r\n\t}\r\n\r\n\tvoid CalculateOrder()\r\n\t{\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key) - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass encode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[0] = plaintext;\r\n\t\tfor (int i = 0; i < RowNumber - 1; i++)\r\n\t\t{\r\n\t\t\tCodeMatrix[i + 1] = CodeMatrix[i].substr(GetLength(key));\r\n\t\t\tCodeMatrix[i].erase(GetLength(key));\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(plaintext) / GetLength(key);\r\n\t\tRemainder = GetLength(plaintext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << endl;\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintCiphertext()\r\n\t{\r\n\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][order[j]];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass decode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[order[0]] = ciphertext;\r\n\t\tfor (int i = 0; i < GetLength(key) - 1; i++)\r\n\t\t{\r\n\t\t\tif (Remainder > 0 && order[i] < Remainder || Remainder == 0)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber);\r\n\t\t\t}\r\n\t\t\telse if (Remainder > 0 && order[i] >= Remainder)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber - 1);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber - 1);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(ciphertext) / GetLength(key);\r\n\t\tRemainder = GetLength(ciphertext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t\t{\r\n\t\t\t\t//cout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\tif (j < RowNumber || order[i] < Remainder && Remainder > 0 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintPlaintext()\r\n\t{\r\n\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t\t{\r\n\t\t\t\tif (j == RowNumber - 1 && Remainder > 0 || j < RowNumber - 1 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nint main()\r\n{\r\n\tint ModeNumber(-1);\r\n\r\nFIRST:\r\n\r\n\t//cout << \""Please input the mode number, 1 for encode and 0 for decode\"" << endl;\r\n\t//cout << \""mode number:\"";\r\n\tcin >> ModeNumber;\r\n\t\r\n\tif (ModeNumber == 1)//encode\r\n\t{\r\n\t\tencode ec;\r\n\t\tec.InputPlaintext();\r\n\t\tec.InputKey();\r\n\t\tec.CalculateRowNumberAndRemainder();\r\n\t\tec.CalculateOrder();\r\n\t\tec.BuildCodeMatrix();\r\n\t\t//ec.PrintCodeMatrix();\r\n\t\tec.PrintCiphertext();\r\n\t}\r\n\telse if (ModeNumber == 0)//decode\r\n\t{\r\n\t\tdecode dc;\r\n\t\tdc.InputCiphertext();\r\n\t\tdc.InputKey();\r\n\t\tdc.CalculateRowNumberAndRemainder();\r\n\t\tdc.CalculateOrder();\r\n\t\tdc.BuildCodeMatrix();\r\n\t\t//dc.PrintCodeMatrix();\r\n\t\tdc.PrintPlaintext();\r\n\t}\r\n\telse//undefiined\r\n\t{\r\n\t\tcout << \""This mode is not defined!!!\"" << endl;\r\n\t\tcout << \""Please input again.\"" << endl;\r\n\t\tgoto FIRST;\r\n\t}\r\n}",PARTIAL_ACCEPTED,16,648 1185792697338654720,b3ca82c2bd2172e23900f3784b44cdf291c6c584d36e6cda5c882b257a293ce8,2019-10-20 13:39:43,C++,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass code\r\n{\r\nprotected:\r\n\tstring ciphertext;\r\n\tstring plaintext;\r\n\tstring key;\r\n\tstring CodeMatrix[10000];\r\n\r\n\tint order[200];\r\n\tint RowNumber;\r\n\tint Remainder;\r\n\r\npublic:\r\n\tvoid InputCiphertext()\r\n\t{\r\n\t\tcin >> ciphertext;\r\n\t}\r\n\r\n\tvoid InputPlaintext()\r\n\t{\r\n\t\tcin >> plaintext;\r\n\t}\r\n\r\n\tvoid InputKey()\r\n\t{\r\n\t\tcin >> key;\r\n\t}\r\n\r\n\tconst int GetLength(string str)\r\n\t{\r\n\t\treturn str.length();\r\n\t}\r\n\r\n\tconst int GetRowNumber()\r\n\t{\r\n\t\treturn RowNumber;\r\n\t}\r\n\r\n\tconst int GetRemainder()\r\n\t{\r\n\t\treturn Remainder;\r\n\t}\r\n\r\n\tvoid CalculateOrder()\r\n\t{\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key) - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass encode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[0] = plaintext;\r\n\t\tfor (int i = 0; i < RowNumber - 1; i++)\r\n\t\t{\r\n\t\t\tCodeMatrix[i + 1] = CodeMatrix[i].substr(GetLength(key));\r\n\t\t\tCodeMatrix[i].erase(GetLength(key));\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(plaintext) / GetLength(key);\r\n\t\tRemainder = GetLength(plaintext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << endl;\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintCiphertext()\r\n\t{\r\n\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][order[j]];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass decode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[order[0]] = ciphertext;\r\n\t\tfor (int i = 0; i < GetLength(key) - 1; i++)\r\n\t\t{\r\n\t\t\tif (Remainder > 0 && order[i] < Remainder || Remainder == 0)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber);\r\n\t\t\t}\r\n\t\t\telse if (Remainder > 0 && order[i] >= Remainder)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber - 1);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber - 1);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(ciphertext) / GetLength(key);\r\n\t\tRemainder = GetLength(ciphertext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t\t{\r\n\t\t\t\t//cout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\tif (j < RowNumber || order[i] < Remainder && Remainder > 0 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintPlaintext()\r\n\t{\r\n\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t\t{\r\n\t\t\t\tif (j == RowNumber - 1 && Remainder > 0 || j < RowNumber - 1 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nint main()\r\n{\r\n\tint ModeNumber(-1);\r\n\r\nFIRST:\r\n\r\n\t//cout << \""Please input the mode number, 1 for encode and 0 for decode\"" << endl;\r\n\t//cout << \""mode number:\"";\r\n\tcin >> ModeNumber;\r\n\t\r\n\tif (ModeNumber == 1)//encode\r\n\t{\r\n\t\tencode ec;\r\n\t\tec.InputPlaintext();\r\n\t\tec.InputKey();\r\n\t\tec.CalculateRowNumberAndRemainder();\r\n\t\tec.CalculateOrder();\r\n\t\tec.BuildCodeMatrix();\r\n\t\t//ec.PrintCodeMatrix();\r\n\t\tec.PrintCiphertext();\r\n\t}\r\n\telse if (ModeNumber == 0)//decode\r\n\t{\r\n\t\tdecode dc;\r\n\t\tdc.InputCiphertext();\r\n\t\tdc.InputKey();\r\n\t\tdc.CalculateRowNumberAndRemainder();\r\n\t\tdc.CalculateOrder();\r\n\t\tdc.BuildCodeMatrix();\r\n\t\t//dc.PrintCodeMatrix();\r\n\t\tdc.PrintPlaintext();\r\n\t}\r\n\telse//undefiined\r\n\t{\r\n\t\tcout << \""This mode is not defined!!!\"" << endl;\r\n\t\tcout << \""Please input again.\"" << endl;\r\n\t\tgoto FIRST;\r\n\t}\r\n}",PARTIAL_ACCEPTED,17,680 1185797308929765376,d37501f503b8448853e79ecc0908355c26d774d4cb9cad9e3b4ab45df9276da3,2019-10-20 13:58:03,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0;\r\n printf(\""Input F:\"");\r\n scanf(\""%d\"",&F);\r\n\tprintf(\""Input wen: \"");\r\n scanf(\""%s\"", wen);\r\n printf(\""Input miyao: \"");\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==0)\r\n\t{\r\n\t\tfor (int j = 0; j < row+1; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < row + 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (temp[j][i])\r\n\t\t\t\t{\r\n\t\t\t\t\toutwen[count] = temp[j][i];\r\n\t\t\t\t\tcount++;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tprintf(\""%s\"",outwen);\r\n\t}\r\n return 0;\r\n}",WRONG_ANSWER,18,376 1185797602065477632,d37501f503b8448853e79ecc0908355c26d774d4cb9cad9e3b4ab45df9276da3,2019-10-20 13:59:13,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0;\r\n printf(\""Input F:\"");\r\n scanf(\""%d\"",&F);\r\n\tprintf(\""Input wen: \"");\r\n scanf(\""%s\"", wen);\r\n printf(\""Input miyao: \"");\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row+1; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < row + 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (temp[j][i])\r\n\t\t\t\t{\r\n\t\t\t\t\toutwen[count] = temp[j][i];\r\n\t\t\t\t\tcount++;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tprintf(\""%s\"",outwen);\r\n\t}\r\n return 0;\r\n}",WRONG_ANSWER,11,380 1185804124938006528,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 14:25:08,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n scanf(\""%d\"",%flag);\r\n\r\n if flag==0\r\n printf(\""CANYOUUNDERSTAND\"");\r\n else\r\n printf(\""CODTAUEAYNSDNURN\"");\r\n return 0;\r\n}",COMPILE_ERROR,0,0 1185804211768487936,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 14:25:29,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\nint main(void)\r\n{\r\n int a;\r\n scanf(\""%d\"",%a);\r\n\r\n if a==0\r\n printf(\""CANYOUUNDERSTAND\"");\r\n else\r\n printf(\""CODTAUEAYNSDNURN\"");\r\n return 0;\r\n}",COMPILE_ERROR,0,0 1185804369222660096,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 14:26:06,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\nint main(void)\r\n{\r\n int a;\r\n scanf(\""%d\"",&a);\r\n\r\n if (a==0)\r\n printf(\""CANYOUUNDERSTAND\"");\r\n else\r\n printf(\""CODTAUEAYNSDNURN\"");\r\n return 0;\r\n}",WRONG_ANSWER,10,384 1185804562089340928,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 14:26:52,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n char str[200];\r\n char my[20];\r\n char temp[20];\r\n scanf(\""%d\"",&flag);\r\n getchar();\r\n scanf(\""%c\"",str);\r\n getchar();\r\n scanf(\""%d\"",my);\r\n temp=my;\r\n k=sizeof(temp)/sizeof(temp[0]);\r\n sort(tep,temp+20);\r\n for i=0:k\r\n {\r\n for j=0:20\r\n { if my[j]==temp[i]\r\n {my[j]=i+1;}\r\n else;\r\n } \r\n } \r\n l=(sizeof(str)/sizeof(str[0]))/k;\r\n char str2[l-1][k-1];\r\n if flag==0\r\n {\r\n for i=0:sizeof(str)/sizeof(str[0])\r\n {for j=0:l-1\r\n {for n=0:k-1\r\n str2[n][j]=str[i];\r\n }\r\n }\r\n\r\n }\r\n}",COMPILE_ERROR,0,0 1185804708135006208,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-20 14:27:27,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nint main(void)\r\n{\r\n int flag,i,j,n,k,l;\r\n char str[200];\r\n char my[20];\r\n char temp[20];\r\n scanf(\""%d\"",&flag);\r\n getchar();\r\n scanf(\""%c\"",str);\r\n getchar();\r\n scanf(\""%d\"",my);\r\n temp[]=my[];\r\n k=sizeof(temp)/sizeof(temp[0]);\r\n sort(temp,temp+20);\r\n for i=0:k\r\n {\r\n for j=0:20\r\n { if my[j]==temp[i]\r\n {my[j]=i+1;}\r\n else;\r\n } \r\n } \r\n l=(sizeof(str)/sizeof(str[0]))/k;\r\n char str2[l-1][k-1];\r\n if flag==0\r\n {\r\n for i=0:sizeof(str)/sizeof(str[0])\r\n {for j=0:l-1\r\n {for n=0:k-1\r\n str2[n][j]=str[i];\r\n }\r\n }\r\n\r\n }\r\n}",COMPILE_ERROR,0,0 1185806911889436672,d37501f503b8448853e79ecc0908355c26d774d4cb9cad9e3b4ab45df9276da3,2019-10-20 14:36:12,C,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0;\r\n printf(\""Input F:\"");\r\n scanf(\""%d\"",&F);\r\n\tprintf(\""Input wen: \"");\r\n scanf(\""%s\"", wen);\r\n printf(\""Input miyao: \"");\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0;\r\n printf(\""Input F:\"");\r\n scanf(\""%d\"",&F);\r\n\tprintf(\""Input wen: \"");\r\n scanf(\""%s\"", wen);\r\n printf(\""Input miyao: \"");\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t\r\n\tvector thenum;\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\tif (i < content.size() % order.size())\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size() + 1);\r\n\t\t\t//cout << content.size() / order.size() + 1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size());\r\n\t\t\t//cout << content.size() / order.size();\r\n\t\t}\r\n\t\t//cout << endl;\r\n\t}\r\n\tint num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\t\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++) \r\n\t\t{\r\n\t\t\tint sum = 0;\r\n\t\t\tfor (int k = 0; k < order.size(); k++)\r\n\t\t\t{\r\n\t\t\t\tif (order[k] < order[j])\r\n\t\t\t\t{\r\n\t\t\t\t\tsum = sum + thenum[k];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t/*for (int k = 1; k < order[j]; k++)\r\n\t\t\t{\r\n\t\t\t\tsum = sum + thenum[order[k-1]-1];\r\n\t\t\t}*/\r\n\t\t\tif (i + sum < content.size() && i v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,13,604 1185819857227051008,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-20 15:27:39,C++,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t\r\n\tvector thenum;\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\tif (i < content.size() % order.size())\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size() + 1);\r\n\t\t\t//cout << content.size() / order.size() + 1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size());\r\n\t\t\t//cout << content.size() / order.size();\r\n\t\t}\r\n\t\t//cout << endl;\r\n\t}\r\n\tint num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\t\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++) \r\n\t\t{\r\n\t\t\tint sum = 0;\r\n\t\t\tfor (int k = 0; k < order.size(); k++)\r\n\t\t\t{\r\n\t\t\t\tif (order[k] < order[j])\r\n\t\t\t\t{\r\n\t\t\t\t\tsum = sum + thenum[k];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t/*for (int k = 1; k < order[j]; k++)\r\n\t\t\t{\r\n\t\t\t\tsum = sum + thenum[order[k-1]-1];\r\n\t\t\t}*/\r\n\t\t\tif (i + sum < content.size() && i v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,32,552 1185821340949508096,ce000615d057f517e7feb7a25412a4c5f4c5069f8bbde4f0a1d90b56cc498b1d,2019-10-20 15:33:33,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"def hl(ch,col):\r\n row = []\r\n m = []\r\n cc = 0\r\n for c in ch:\r\n cc = cc + 1\r\n if cc % col == 0:\r\n row.append(c)\r\n m.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row: m.append(row)\r\n return m\r\n\r\ndef parse(k):\r\n lt = {c: order for order, c in enumerate(sorted(k))}\r\n return [lt[c] for c in k]\r\n\r\ndef encode(m,k):\r\n ans = ''\r\n o = parse(k)\r\n for num in parse(k):\r\n for row in m:\r\n if num < len(row): ans += row[num]\r\n return ans\r\n\r\ndef decode(ch,k):\r\n m = [[] for _ in range(x)]\r\n y = 0\r\n ans = ''\r\n for o in parse(k):\r\n if o < x:\r\n width = roww\r\n else:\r\n width = roww - 1\r\n m[o] = (ch[y:y+width])\r\n y += width\r\n for num in range(roww):\r\n for row in m:\r\n if num < len(row): ans += row[num]\r\n return ans\r\n\r\nss = int(input())\r\nch = input()\r\nk = input()\r\ncol = len(k)\r\nm = hl(ch,col)\r\nroww = len(m)\r\nx = len(m[-1])\r\nif ss: print(encode(m,k))\r\nelse: print(decode(ch,k))\r\n",PARTIAL_ACCEPTED,103,2984 1185821976902463488,ce000615d057f517e7feb7a25412a4c5f4c5069f8bbde4f0a1d90b56cc498b1d,2019-10-20 15:36:04,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def hl(ch,col):\r\n row = []\r\n m = []\r\n cc = 0\r\n for c in ch:\r\n cc = cc + 1\r\n if cc % col == 0:\r\n row.append(c)\r\n m.append(row)\r\n row = []\r\n else:\r\n row.append(c)\r\n if row: m.append(row)\r\n return m\r\n\r\ndef parse(k):\r\n lt = {c: order for order, c in enumerate(sorted(k))}\r\n return [lt[c] for c in k]\r\n\r\ndef encode(m,k):\r\n ans = ''\r\n o = parse(k)\r\n for num in parse(k):\r\n for row in m:\r\n if num < len(row): ans += row[num]\r\n return ans\r\n\r\ndef decode(ch,k):\r\n m = [[] for _ in range(len(parse(k)))]\r\n y = 0\r\n ans = ''\r\n for o in parse(k):\r\n if o < x:\r\n width = roww\r\n else:\r\n width = roww - 1\r\n m[o] = (ch[y:y+width])\r\n y += width\r\n for num in range(roww):\r\n for row in m:\r\n if num < len(row): ans += row[num]\r\n return ans\r\n\r\nss = int(input())\r\nch = input()\r\nk = input()\r\ncol = len(k)\r\nm = hl(ch,col)\r\nroww = len(m)\r\nx = len(m[-1])\r\nif ss: print(encode(m,k))\r\nelse: print(decode(ch,k))\r\n",PARTIAL_ACCEPTED,107,2984 1185823436729970688,d37501f503b8448853e79ecc0908355c26d774d4cb9cad9e3b4ab45df9276da3,2019-10-20 15:41:52,C,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint f;\r\n\tstring str;\r\n\tstring key;\r\n\tcin >> f;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tvector key_to_num(20,0);\r\n\tfor (int i = 0; i < key.length(); i++) {\r\n\t\tint a = 0;\r\n\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\tif ((int)key[j] < (int)key[i]) {\r\n\t\t\t\ta += 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\tkey_to_num[i] = a;\r\n\t}\r\n\r\n\tif (f == 1) {\r\n\t\tint column = key.length();\r\n\t\tvector a(20,\""\"");\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tint b = i % key.length();//下标对密钥长度取余\r\n\t\t\ta[b].append(1,str[i]);\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tcout << a[key_to_num[i]];\r\n\t\t}\r\n\t}\r\n\telse if (f == 0) {\r\n cout<<\""CANYOUUNDERSTAND\"";\r\n\t}\r\n\r\n}",PARTIAL_ACCEPTED,15,512 1185867573873307648,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-20 18:37:15,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tvector v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\t\r\n\r\n\tif (F == 1)\r\n\t\tcout << \""CODTAUEAYNSDNURN\"";\r\n\telse\r\n\t\tcout << \""CANYOUUNDERSTAND\"";\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",WRONG_ANSWER,27,584 1185867679783677952,742109c538cc1756da6f6e80dd0ca686a758173618c908edc2a72829bf5eca16,2019-10-20 18:37:41,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tvector v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\t\r\n\r\n\tif (F == 1)\r\n\t\tcout << \""CODTAUEAYNSDNURN\""<\r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass Passward {\r\nprivate:\r\n\tvector content;//原文\r\n\tvector key;//密码\r\n\tvector order;//顺序\r\n\tvector dispose;//处理后\r\npublic:\r\n\tPassward(vector content_, vector key_)\r\n\t{\r\n\t\tint i;\r\n\r\n\t\tfor (i = 0; i < content_.size(); i++) {\r\n\t\t\t\r\n\t\t\tcontent.push_back(content_[i]);\r\n\t\t}\r\n\r\n\t\r\n\t\tfor (i = 0; i < key_.size(); i++) {\r\n\t\t\tkey.push_back(key_[i]);\r\n\t\t};\r\n\r\n\r\n\t\t\r\n\t\tget_order();\r\n\r\n\t}\r\n\r\n\tvoid get_order();\r\n\r\n\tvoid encrypt();//加密\r\n\tvoid decode();//解密\r\n\r\n\tvoid show();\r\n\r\n};\r\n\r\nvoid Passward::get_order()\r\n{\r\n\tchar temp;\r\n\tvector key_;\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\tkey_.push_back(key[i]);\r\n\t};\r\n\tfor (int i = 0; i < key_.size() - 1; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < key_.size() - 1 - i; j++)\r\n\t\t{\r\n\t\t\tif (key_[j] > key_[j + 1])\r\n\t\t\t{\r\n\t\t\t\ttemp = key_[j + 1];\r\n\t\t\t\tkey_[j + 1] = key_[j];\r\n\t\t\t\tkey_[j] = temp;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\r\n\r\n\t\r\n\tfor (int i = 0; i < key.size(); i++)\r\n\t{\r\n\t\ttemp = key[i];\r\n\t\tfor (int j = 0; j < key_.size(); j++)\r\n\t\t{\r\n\t\t\tif (temp == key_[j])\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\torder.push_back(j + 1);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nvoid Passward::show()\r\n{\r\n\tchar i;\r\n\r\n\tfor (i = 0; i < dispose.size(); i++) {\r\n\t\tcout << dispose[i];\r\n\t}\r\n\tcout << endl;\r\n}\r\n\r\nvoid Passward::encrypt()\r\n{\r\n\tint num = 0;\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum=num + 1;\r\n\tnum = num + content.size() / key.size();\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\t\r\n\t\tfor (int j = 0; j < order.size(); j++)\r\n\t\t{\r\n\r\n\t\t\tif (order[j] == i + 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tfor (int k = 0; k < num; k++)\r\n\t\t\t\t{\t\r\n\r\n\t\t\t\t\tif(key.size() * k + j < content.size() )\r\n\t\t\t\t\t\tdispose.push_back(content[key.size() * k + j]);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n}\r\n\r\nvoid Passward::decode()\r\n{\r\n\t\r\n\tvector thenum;\r\n\tfor (int i = 0; i < order.size(); i++)\r\n\t{\r\n\t\tif (i < content.size() % order.size())\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size() + 1);\r\n\t\t\t//cout << content.size() / order.size() + 1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tthenum.push_back(content.size() / order.size());\r\n\t\t\t//cout << content.size() / order.size();\r\n\t\t}\r\n\t\t//cout << endl;\r\n\t}\r\n\tint num = content.size() / key.size();\r\n\tif (content.size() % key.size() != 0)\r\n\t\tnum = num + 1;\r\n\t\r\n\tfor (int i = 0; i < num; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < order.size(); j++) \r\n\t\t{\r\n\t\t\tint sum = 0;\r\n\t\t\tfor (int k = 0; k < order.size(); k++)\r\n\t\t\t{\r\n\t\t\t\tif (order[k] < order[j])\r\n\t\t\t\t{\r\n\t\t\t\t\tsum = sum + thenum[k];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t/*for (int k = 1; k < order[j]; k++)\r\n\t\t\t{\r\n\t\t\t\tsum = sum + thenum[order[k-1]-1];\r\n\t\t\t}*/\r\n\t\t\tif (i + sum < content.size() && i v;\r\n\tvector key;\r\n\tstring line;\r\n\r\n\tint F;\r\n\tgetline(cin, line);\r\n\tistringstream isss(line);\r\n\tfor (int d; isss >> d; F = d) {}\r\n\r\n\r\n\tgetline(cin, line);\r\n\tistringstream iss(line);\r\n\tfor (char d; iss >> d; v.push_back(d)) {}\r\n\r\n\t\r\n\r\n\tgetline(cin, line);\r\n\tistringstream is(line);\r\n\tfor (char d; is >> d; key.push_back(d)) {}\r\n\r\n\r\n\r\n\tPassward passward(v, key);\r\n\r\n\tif (F == 1)\r\n\t\tpassward.encrypt();\r\n\telse if (F == 0)\r\n\t\tpassward.decode();\r\n\r\n\tpassward.show();\r\n\r\n\tsystem(\""pause\"");\r\n\treturn 0;\r\n}",PARTIAL_ACCEPTED,17,552 1185870716921147392,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-20 18:49:45,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def parse_key(key):\r\n s = sorted(key)\r\n order = []\r\n for k in key:\r\n order.append(s.index(k))\r\n return order\r\n\r\ndef encode(text, key):\r\n res = ''\r\n interval = len(key)\r\n order = parse_key(key)\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res += text[i]\r\n i += interval\r\n return res\r\n\r\ndef decode(text, key):\r\n res = [''] * len(text)\r\n interval = len(key)\r\n order = parse_key(key)\r\n ti = 0\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res[i] = text[ti]\r\n ti += 1\r\n i += interval\r\n return ''.join(res)\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\n\r\nif encoding:\r\n print(encode(text, key))\r\nelse:\r\n print(decode(text, key))",PARTIAL_ACCEPTED,181,2984 1185870846793576448,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-20 18:50:16,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def parse_key(key):\r\n s = sorted(key)\r\n order = []\r\n for k in key:\r\n order.append(s.index(k))\r\n return order\r\n\r\ndef encode(text, key):\r\n res = ''\r\n interval = len(key)\r\n order = parse_key(key)\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res += text[i]\r\n i += interval\r\n return res\r\n\r\ndef decode(text, key):\r\n res = [''] * len(text)\r\n interval = len(key)\r\n order = parse_key(key)\r\n ti = 0\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res[i] = text[ti]\r\n ti += 1\r\n i += interval\r\n return ''.join(res)\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\n\r\nif encoding == 1:\r\n print(encode(text, key))\r\nelif encoding == 0:\r\n print(decode(text, key))",PARTIAL_ACCEPTED,167,3048 1185871512920354816,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-20 18:52:55,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def parse_key(key):\r\n s = sorted(key)\r\n order = []\r\n for k in key:\r\n order.append(s.index(k))\r\n return order\r\n\r\ndef encode(text, key):\r\n res = ''\r\n interval = len(key)\r\n order = parse_key(key)\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res += text[i]\r\n i += interval\r\n return res\r\n\r\ndef decode(text, key):\r\n res = [''] * len(text)\r\n interval = len(key)\r\n order = parse_key(key)\r\n ti = 0\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res[i] = text[ti]\r\n ti += 1\r\n i += interval\r\n s = ''\r\n for c in res:\r\n s += c\r\n return s\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\n\r\nif encoding:\r\n print(encode(text, key))\r\nelse:\r\n print(decode(text, key))",PARTIAL_ACCEPTED,129,2984 1185871793523486720,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-20 18:54:01,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def parse_key(key):\r\n s = sorted(key)\r\n order = []\r\n for k in key:\r\n order.append(s.index(k))\r\n return order\r\n\r\ndef encode(text, key):\r\n res = ''\r\n interval = len(key)\r\n order = parse_key(key)\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res += text[i]\r\n i += interval\r\n return res\r\n\r\ndef decode(text, key):\r\n res = [''] * len(text)\r\n interval = len(key)\r\n order = parse_key(key)\r\n ti = 0\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res[i] = text[ti]\r\n ti += 1\r\n i += interval\r\n return ''.join(res)\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\n\r\nif encoding:\r\n print(encode(text, key))\r\nelse:\r\n print(decode(text, key))",PARTIAL_ACCEPTED,95,2944 1185873079518064640,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-20 18:59:08,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def parse_key(key):\r\n s = sorted(key)\r\n order = []\r\n for k in key:\r\n order.append(s.index(k))\r\n return order\r\n\r\ndef encode(text, key):\r\n res = ''\r\n interval = len(key)\r\n order = parse_key(key)\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res += text[i]\r\n i += interval\r\n return res\r\n\r\ndef decode(text, key):\r\n res = [''] * len(text)\r\n interval = len(key)\r\n order = parse_key(key)\r\n ti = 0\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res[i] = text[ti]\r\n ti += 1\r\n i += interval\r\n return ''.join(res)\r\n\r\n\r\nencoding = int(input())\r\ntext = input().strip()\r\nkey = input().strip()\r\n\r\nif encoding:\r\n print(encode(text, key))\r\nelse:\r\n print(decode(text, key))",PARTIAL_ACCEPTED,121,3112 1185873445756301312,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-20 19:00:35,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def parse_key(key):\r\n s = sorted(key)\r\n order = []\r\n for k in key:\r\n order.append(s.index(k))\r\n return order\r\n\r\ndef encode(text, key):\r\n res = ''\r\n interval = len(key)\r\n order = parse_key(key)\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res += text[i]\r\n i += interval\r\n return res.strip()\r\n\r\ndef decode(text, key):\r\n res = [''] * len(text)\r\n interval = len(key)\r\n order = parse_key(key)\r\n ti = 0\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res[i] = text[ti]\r\n ti += 1\r\n i += interval\r\n return ''.join(res).strip()\r\n\r\n\r\nencoding = int(input())\r\ntext = input().strip()\r\nkey = input().strip()\r\n\r\nif encoding:\r\n print(encode(text, key))\r\nelse:\r\n print(decode(text, key))",PARTIAL_ACCEPTED,105,3072 1185874763489177600,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-20 19:05:50,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def parse_key(key):\r\n s = sorted(key)\r\n order = []\r\n for k in key:\r\n order.append(s.index(k))\r\n return order\r\n\r\ndef encode(text, key):\r\n res = ''\r\n interval = len(key)\r\n order = parse_key(key)\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res += text[i]\r\n i += interval\r\n return res\r\n\r\ndef decode(text, key):\r\n res = [''] * (len(text)+1)\r\n interval = len(key)\r\n order = parse_key(key)\r\n ti = 0\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res[i] = text[ti]\r\n ti += 1\r\n i += interval\r\n return ''.join(res)\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\n\r\nif encoding:\r\n print(encode(text, key))\r\nelse:\r\n print(decode(text, key))",PARTIAL_ACCEPTED,87,2984 1185874864085364736,aa9fe7e0a38ba47d42e321bf5028248499f9b5b5ed843e560a685c2157f13d6c,2019-10-20 19:06:14,Python,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"def parse_key(key):\r\n s = sorted(key)\r\n order = []\r\n for k in key:\r\n order.append(s.index(k))\r\n return order\r\n\r\ndef encode(text, key):\r\n res = ''\r\n interval = len(key)\r\n order = parse_key(key)\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res += text[i]\r\n i += interval\r\n return res\r\n\r\ndef decode(text, key):\r\n res = [''] * len(text)\r\n interval = len(key)\r\n order = parse_key(key)\r\n ti = 0\r\n for start in order:\r\n i = start\r\n while i < len(text):\r\n res[i] = text[ti]\r\n ti += 1\r\n i += interval\r\n return ''.join(res)\r\n\r\n\r\nencoding = int(input())\r\ntext = input()\r\nkey = input()\r\n\r\nif encoding:\r\n print(encode(text, key))\r\nelse:\r\n print(decode(text, key))",PARTIAL_ACCEPTED,134,3072 1185893357614755840,582b5cf1d973e417960d17a24008f6bcd108acac979860ec07891007fae69bdb,2019-10-20 20:19:43,C++,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint f;\r\n\tstring str;\r\n\tstring key;\r\n\tcin >> f;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tvector key_to_num(20,0);\r\n\tfor (int i = 0; i < key.length(); i++) {\r\n\t\tint a = 0;\r\n\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\tif ((int)key[j] < (int)key[i]) {\r\n\t\t\t\ta += 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\tkey_to_num[i] = a;\r\n\t}\r\n\r\n\r\n\tif (f == 1) {\r\n\t\tint column = key.length();\r\n\t\tvector a(20,\""\"");\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tint b = i % key.length();//下标对密钥长度取余\r\n\t\t\ta[b].append(1,str[i]);\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tcout << a[key_to_num[i]];\r\n\t\t}\r\n\t}\r\n\telse if (f == 0) {\r\n\t\tint column = key.length();\r\n\t\tint min = str.length() / key.length();//假设min是4\r\n\t\tvector a(20, \""\"");\r\n\r\n\r\n\t\tif (str.length() % key.length() != 0) {\r\n\t\t\tint max = min + 1;//假设max是5\r\n\t\t\tint remainder = str.length() % key.length();\r\n\t\t\tint x = 0;//记录切片位置\r\n\t\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\t\tif (key_to_num[i] + 1 <= remainder) {\r\n\t\t\t\t\tstring p = str.substr(x, max);\r\n\t\t\t\t\ta[key_to_num[i]] = p;\r\n\t\t\t\t\tx += max;\r\n\t\t\t\t}\r\n\t\t\t\telse if (key_to_num[i] + 1 > remainder) {//片段数为4\r\n\t\t\t\t\tstring p = str.substr(x, min);\r\n\t\t\t\t\ta[key_to_num[i]] = p;\r\n\t\t\t\t\tx += min;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < min; i++) {\r\n\t\t\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\t\t\tcout << a[j][i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < str.length() % key.length(); i++) {\r\n\t\t\t\tcout << a[i][min];\r\n\t\t\t}\r\n\t\t}\r\n\t\telse if(str.length() % key.length() == 0){\r\n\t\t\tint x = 0;\r\n\t\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\t\tstring p = str.substr(x, min);\r\n\t\t\t\ta[key_to_num[i]] = p;\r\n\t\t\t\tx += min;\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < min; i++) {\r\n\t\t\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\t\t\tcout << a[j][i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}",PARTIAL_ACCEPTED,15,592 1185905119365918720,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:06:27,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\nprint(\""CODTAUEAYNSDNURN\"")",WRONG_ANSWER,96,2984 1185912288530362368,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:34:56,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nL = [\""\"" for _ in range(l)]\r\nif typ == 1:\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)",PARTIAL_ACCEPTED,113,2984 1185913623422136320,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:40:14,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n print(u)\r\n print(p)\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",PARTIAL_ACCEPTED,81,3072 1185913859779555328,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:41:11,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",PARTIAL_ACCEPTED,85,3184 1185915315777662976,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:46:58,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n if rem != 0:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\n else:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n print(u)\r\n print(p)\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",PARTIAL_ACCEPTED,77,3180 1185915404956954624,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:47:19,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",PARTIAL_ACCEPTED,97,3072 1185915512926728192,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:47:45,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n if rem != 0:\r\n return\r\n \r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",NON_ZERO_EXIT_CODE,85,3072 1185915543771639808,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:47:52,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n if rem != 0:\r\n break\r\n\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",NON_ZERO_EXIT_CODE,102,3072 1185915577800028160,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:48:00,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n if rem != 0:\r\n print(\""error\"")\r\n\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",PARTIAL_ACCEPTED,108,3052 1185915709731860480,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:48:32,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n if rem != 0:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n else:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",PARTIAL_ACCEPTED,100,3116 1185916675407441920,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:52:22,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n if rem != 0:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n else:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n if len(s) < len(k):\r\n print(s)\r\n else:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",PARTIAL_ACCEPTED,78,3112 1185916858430091264,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 21:53:06,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n if rem != 0:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n else:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n if len(s) < len(k):\r\n print(s)\r\n elif rem == 0:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",PARTIAL_ACCEPTED,91,3200 1185918143585808384,582b5cf1d973e417960d17a24008f6bcd108acac979860ec07891007fae69bdb,2019-10-20 21:58:12,C++,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint f;\r\n\tstring str;\r\n\tstring key;\r\n\tcin >> f;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tvector key_to_num(20,0);\r\n\tfor (int i = 0; i < key.length(); i++) {\r\n\t\tint a = 0;\r\n\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\tif ((int)key[j] < (int)key[i]) {\r\n\t\t\t\ta += 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\tkey_to_num[i] = a;\r\n\t}\r\n\r\n\r\n\tif (f == 1) {\r\n\t\tint column = key.length();\r\n\t\tvector a(20,\""\"");\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tint b = i % key.length();//下标对密钥长度取余\r\n\t\t\ta[b].append(1,str[i]);\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tcout << a[key_to_num[i]];\r\n\t\t}\r\n\t}\r\n\telse if (f == 0) {\r\n\t\tint column = key.length();\r\n\t\tint min = str.length() / key.length();//假设min是4\r\n\t\tvector a(100, \""\"");\r\n\r\n\r\n\t\tif (str.length() % key.length() != 0) {\r\n\t\t\tint max = min + 1;//假设max是5\r\n\t\t\tint remainder = str.length() % key.length();\r\n\t\t\tint x = 0;//记录切片位置\r\n\t\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\t\tif (key_to_num[i] + 1 <= remainder) {\r\n\t\t\t\t\tstring p = str.substr(x, max);\r\n\t\t\t\t\ta[key_to_num[i]] = p;\r\n\t\t\t\t\tx += max;\r\n\t\t\t\t}\r\n\t\t\t\telse if (key_to_num[i] + 1 > remainder) {//片段数为4\r\n\t\t\t\t\tstring p = str.substr(x, min);\r\n\t\t\t\t\ta[key_to_num[i]] = p;\r\n\t\t\t\t\tx += min;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < min; i++) {\r\n\t\t\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\t\t\tcout << a[j][i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < str.length() % key.length(); i++) {\r\n\t\t\t\tcout << a[i][min];\r\n\t\t\t}\r\n\t\t}\r\n\t\telse if(str.length() % key.length() == 0){\r\n\t\t\tint x = 0;\r\n\t\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\t\tstring p = str.substr(x, min);\r\n\t\t\t\ta[key_to_num[i]] = p;\r\n\t\t\t\tx += min;\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < min; i++) {\r\n\t\t\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\t\t\tcout << a[j][i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}",PARTIAL_ACCEPTED,16,496 1185918218965839872,582b5cf1d973e417960d17a24008f6bcd108acac979860ec07891007fae69bdb,2019-10-20 21:58:30,C++,18.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint f;\r\n\tstring str;\r\n\tstring key;\r\n\tcin >> f;\r\n\tcin >> str;\r\n\tcin >> key;\r\n\tvector key_to_num(20,0);\r\n\tfor (int i = 0; i < key.length(); i++) {\r\n\t\tint a = 0;\r\n\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\tif ((int)key[j] < (int)key[i]) {\r\n\t\t\t\ta += 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\tkey_to_num[i] = a;\r\n\t}\r\n\r\n\r\n\tif (f == 1) {\r\n\t\tint column = key.length();\r\n\t\tvector a(20,\""\"");\r\n\t\tfor (int i = 0; i < str.length(); i++) {\r\n\t\t\tint b = i % key.length();//下标对密钥长度取余\r\n\t\t\ta[b].append(1,str[i]);\r\n\t\t}\r\n\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\tcout << a[key_to_num[i]];\r\n\t\t}\r\n\t}\r\n\telse if (f == 0) {\r\n\t\tint column = key.length();\r\n\t\tint min = str.length() / key.length();//假设min是4\r\n\t\tvector a(20, \""\"");\r\n\r\n\r\n\t\tif (str.length() % key.length() != 0) {\r\n\t\t\tint max = min + 1;//假设max是5\r\n\t\t\tint remainder = str.length() % key.length();\r\n\t\t\tint x = 0;//记录切片位置\r\n\t\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\t\tif (key_to_num[i] + 1 <= remainder) {\r\n\t\t\t\t\tstring p = str.substr(x, max);\r\n\t\t\t\t\ta[key_to_num[i]] = p;\r\n\t\t\t\t\tx += max;\r\n\t\t\t\t}\r\n\t\t\t\telse if (key_to_num[i] + 1 > remainder) {//片段数为4\r\n\t\t\t\t\tstring p = str.substr(x, min);\r\n\t\t\t\t\ta[key_to_num[i]] = p;\r\n\t\t\t\t\tx += min;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < min; i++) {\r\n\t\t\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\t\t\tcout << a[j][i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < str.length() % key.length(); i++) {\r\n\t\t\t\tcout << a[i][min];\r\n\t\t\t}\r\n\t\t}\r\n\t\telse if(str.length() % key.length() == 0){\r\n\t\t\tint x = 0;\r\n\t\t\tfor (int i = 0; i < key.length(); i++) {\r\n\t\t\t\tstring p = str.substr(x, min);\r\n\t\t\t\ta[key_to_num[i]] = p;\r\n\t\t\t\tx += min;\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < min; i++) {\r\n\t\t\t\tfor (int j = 0; j < key.length(); j++) {\r\n\t\t\t\t\tcout << a[j][i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}",PARTIAL_ACCEPTED,15,508 1185922502117781504,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 22:15:31,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\n\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n if len(s) < len(k):\r\n print(s)\r\n elif rem == 0:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))\r\n else:\r\n q = [nrow+1 for _ in range(rem)] + [nrow for _ in range(l-rem)]\r\n d = dict(zip(p, q))\r\n def S(j):\r\n return sum([v for k, v in d.items() if k < j])\r\n\r\n L = []\r\n for i, v in enumerate(p):\r\n # print(i, v, d[v], s[S(v):S(v)+d[v]])\r\n L.append(s[S(v):S(v)+d[v]])\r\n \r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",PARTIAL_ACCEPTED,89,3184 1185922870914543616,1252c30f793e5370031c9b236545bb1e37dd84dc8a6f94b026bf140a3ece3d91,2019-10-20 22:16:59,Python,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"typ = int(input())\r\ns = input().strip()\r\nk = input().strip()\r\np = [i[0] for i in sorted(enumerate(k), key=lambda x:x[1])]\r\nl = len(p)\r\nu = [s[i:i+l] for i in range(0, len(s), l)]\r\n\r\nnrow = len(s) // l\r\nrem = len(s) % l\r\n\r\nif typ == 1:\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n\r\n L = \""\"".join([L[i] for i in p])\r\n print(L)\r\n\r\nelse:\r\n if len(s) < len(k):\r\n print(s)\r\n elif rem == 0:\r\n u = [u[i] for i in p]\r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))\r\n else:\r\n q = [nrow+1 for _ in range(rem)] + [nrow for _ in range(l-rem)]\r\n d = dict(zip(p, q))\r\n def S(j):\r\n return sum([v for k, v in d.items() if k < j])\r\n\r\n u = []\r\n for i, v in enumerate(p):\r\n # print(i, v, d[v], s[S(v):S(v)+d[v]])\r\n u.append(s[S(v):S(v)+d[v]])\r\n \r\n L = [\""\"" for _ in range(l)]\r\n for i in range(l+1):\r\n for j in range(nrow+1):\r\n try:\r\n L[i] += u[j][i]\r\n except:\r\n pass\r\n print(\""\"".join(L))",ACCEPTED,87,3160 1185946490747449344,f85ea0d2a676802f56925511990b9da9d3c0fdf3f3d8a9695ef53425b553839f,2019-10-20 23:50:51,Python,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"def main1():\r\n message1 = input()\r\n key1 = 4\r\n ciphertext = encrypt(key1,message1)\r\n print(ciphertext)\r\n\r\ndef encrypt(key,message):\r\n ciphertext = [''] * key\r\n for col in range(key):\r\n pointer = col\r\n \r\n while pointer < len(message):\r\n ciphertext[col] += message[pointer]\r\n pointer += key\r\n\r\n return ''.join(ciphertext)\r\n\r\ndef main0():\r\n message0 = input()\r\n key0 = 4\r\n\r\n\r\n\r\n",WRONG_ANSWER,77,2984 1186093984642985984,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 09:36:56,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"int a;\r\nstring s1,s2;\r\nscanf(\""%d\"",a);\r\nscanf(\""%f%f\"",s1,s2);\r\nif(a == 1)\r\nprintf(\""CODTAUEAYNSDNURN\"");\r\nelse printf(\""CANYOUUNDERSTAND\"");",COMPILE_ERROR,0,0 1186094225366675456,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 09:37:53,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint a;\r\nstring s1,s2;\r\nscanf(\""%d\"",a);\r\nscanf(\""%f%f\"",s1,s2);\r\nif(a == 1)\r\nprintf(\""CODTAUEAYNSDNURN\"");\r\nelse printf(\""CANYOUUNDERSTAND\"");",COMPILE_ERROR,0,0 1186094332493393920,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 09:38:19,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nstring s1,s2;\r\nscanf(\""%d\"",a);\r\nscanf(\""%f%f\"",s1,s2);\r\nif(a == 1)\r\nprintf(\""CODTAUEAYNSDNURN\"");\r\nelse printf(\""CANYOUUNDERSTAND\"");\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186096917300342784,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 09:48:35,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nstring s1,s2;\r\nscanf(\""%d\"",&a);\r\nscanf(\""%f%f\"",s1,s2);\r\nif(a == 1)\r\nprintf(\""CODTAUEAYNSDNURN\"");\r\nelse printf(\""CANYOUUNDERSTAND\"");\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186097081469595648,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 09:49:14,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nstring s1,s2;\r\nscanf(\""%d\"",&a);\r\nscanf(\""%f\"",&s1);\r\nscanf(\""%f\"",&s2);\r\nif(a == 1)\r\nprintf(\""CODTAUEAYNSDNURN\"");\r\nelse printf(\""CANYOUUNDERSTAND\"");\r\nreturn 0;\r\n}",WRONG_ANSWER,13,512 1186098618543599616,95a784313d117f319ab51c3a15f9ea92adbca232832df1383ea8fda928a54f0c,2019-10-21 09:55:21,C++,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\nbool flag = 0;\r\nint main() {\r\n int i, keylen, totallen, len;\r\n string input, key, newkey;\r\n string buf = \""\"";\r\n string debuf = \""\"";\r\n\r\n cin >> i >> input >> key;\r\n newkey = key;\r\n sort(newkey.begin(), newkey.end());\r\n keylen = key.length();\r\n totallen = input.length();\r\n len = ceil(totallen / keylen);\r\n bool flag = (i == 0);\r\n string *s = new string[keylen];\r\n string *r = new string[len];\r\n if (flag) {\r\n for (int i = 0; i < len; i++) {\r\n r[i] = \""\"";\r\n r[i] = input.substr(i * keylen, keylen);\r\n // std::cout << r[i] << endl;\r\n }\r\n for (int i = 0; i < len; i++) {\r\n int index = key.find(newkey.at(i));\r\n debuf.append(r[index]);\r\n }\r\n // std::cout << debuf << endl;\r\n }\r\n for (int i = 0; i < keylen; i++) {\r\n s[i] = \""\"";\r\n string::iterator it = !flag ? input.begin() : debuf.begin();\r\n for (int j = 0; j < len; j++) {\r\n s[i] += *(it + i + j * keylen);\r\n }\r\n // std::cout << s[i] << endl;\r\n }\r\n\r\n for (int i = 0; i < keylen; i++) {\r\n int index;\r\n index = key.find(newkey.at(i));\r\n if (!flag)\r\n buf.append(s[index]);\r\n else\r\n buf.append(s[i]);\r\n }\r\n cout << buf << endl;\r\n}",PARTIAL_ACCEPTED,13,512 1186100360467410944,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 10:02:16,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nint length; \r\nstring s1,s2,s3;\r\nscanf(\""%d\"",&a);\r\nscanf(\""%f\"",&s1);\r\nscanf(\""%f\"",&s2);\r\nl1 = s1.length();\r\nl2 = s2.length();\r\ns3 = sort(s1.begin(),s1.end);\r\nif(a == 1)\r\n\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186100476481859584,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 10:02:44,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nint length; \r\nstring s1,s2,s3;\r\nscanf(\""%d\"",&a);\r\nscanf(\""%f\"",&s1);\r\nscanf(\""%f\"",&s2);\r\nl1 = s1.length();\r\nl2 = s2.length();\r\ns3 = sort(s1.begin(),s1.end());\r\nif(a == 1)\r\n\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186100588834680832,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 10:03:10,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nint length; \r\nstring s1,s2,s3;\r\nscanf(\""%d\"",&a);\r\nscanf(\""%s\"",&s1);\r\nscanf(\""%s\"",&s2);\r\nl1 = s1.length();\r\nl2 = s2.length();\r\ns3 = sort(s1.begin(),s1.end());\r\nif(a == 1)\r\n\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186101471442071552,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 10:06:41,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nint length; \r\nstring s1,s2,s3;\r\nscanf(\""%d\"",&a);\r\nscanf(\""%s\"",&s1);\r\ngetline (cin, s1);\r\ngetline (cin, s2); \r\nl1 = s1.length();\r\nl2 = s2.length();\r\ns3 = sort(s1.begin(),s1.end());\r\nif(a == 1)\r\n\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186101515905888256,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 10:06:51,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nint length; \r\nstring s1,s2,s3;\r\nscanf(\""%d\"",&a);\r\ngetline (cin, s1);\r\ngetline (cin, s2); \r\nl1 = s1.length();\r\nl2 = s2.length();\r\ns3 = sort(s1.begin(),s1.end());\r\nif(a == 1)\r\n\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186101605236174848,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 10:07:13,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nint length,l1,l2; \r\nstring s1,s2,s3;\r\nscanf(\""%d\"",&a);\r\ngetline (cin, s1);\r\ngetline (cin, s2); \r\nl1 = s1.length();\r\nl2 = s2.length();\r\ns3 = sort(s1.begin(),s1.end());\r\nif(a == 1)\r\n\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186101676983939072,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 10:07:30,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include\r\n#include\r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nint length,l1,l2; \r\nstring s1,s2,s3;\r\nscanf(\""%d\"",&a);\r\ngetline (cin, s1);\r\ngetline (cin, s2); \r\nl1 = s1.length();\r\nl2 = s2.length();\r\ns3 = sort(s1.begin(),s1.end());\r\nif(a == 1)\r\n\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186102026738561024,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 10:08:53,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include \r\n#include \r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nint length,l1,l2; \r\nstring s1,s2,s3;\r\nscanf(\""%d\"",&a);\r\ngetline (cin, s1);\r\ngetline (cin, s2); \r\nl1 = s1.length();\r\nl2 = s2.length();\r\ns3 = sort(s1.begin(),s1.end());\r\nif(a == 1)\r\n\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186102874310930432,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 10:12:15,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\n#include \r\n#include \r\nusing namespace std;\r\nint main()\r\n{\r\nint a;\r\nint length,l1,l2; \r\nstring s1,s2,s3;\r\nscanf(\""%d\"",&a);\r\ngetline (cin, s1);\r\ngetline (cin, s2); \r\nl1 = s1.length();\r\nl2 = s2.length();\r\ns3 = sort(s1.begin(),s1.end()).copy;\r\nif(a == 1)\r\n\r\nreturn 0;\r\n}",COMPILE_ERROR,0,0 1186109560006340608,95a784313d117f319ab51c3a15f9ea92adbca232832df1383ea8fda928a54f0c,2019-10-21 10:38:49,C++,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\nbool flag = 0;\r\nint main() {\r\n int i, keylen, totallen, len;\r\n string input, key, newkey;\r\n string buf = \""\"";\r\n string debuf = \""\"";\r\n cin >> i >> input >> key;\r\n newkey = key;\r\n sort(newkey.begin(), newkey.end());\r\n keylen = key.length();\r\n totallen = input.length();\r\n len = ceil((double)totallen / keylen);\r\n bool flag = (i == 0);\r\n string *s = new string[keylen];\r\n string *r = new string[len];\r\n if (flag) {\r\n for (int i = 0; i < len; i++) {\r\n r[i] = \""\"";\r\n r[i] = input.substr(i * keylen, keylen);\r\n // std::cout << r[i] << endl;\r\n }\r\n for (int i = 0; i < len; i++) {\r\n int index = key.find(newkey.at(i));\r\n debuf.append(r[index]);\r\n }\r\n // std::cout << debuf << endl;\r\n }\r\n for (int i = 0; i < keylen; i++) {\r\n s[i] = \""\"";\r\n string::iterator it = !flag ? input.begin() : debuf.begin();\r\n for (int j = 0; (i + j * keylen) < totallen && j < len; j++) {\r\n s[i] += *(it + i + j * keylen);\r\n }\r\n // std::cout << s[i] << endl;\r\n }\r\n\r\n for (int i = 0; i < keylen; i++) {\r\n int index;\r\n index = key.find(newkey.at(i));\r\n if (!flag)\r\n buf.append(s[index]);\r\n else\r\n buf.append(s[i]);\r\n }\r\n cout << buf << endl;\r\n}",PARTIAL_ACCEPTED,16,424 1186150719235780608,95a784313d117f319ab51c3a15f9ea92adbca232832df1383ea8fda928a54f0c,2019-10-21 13:22:22,C++,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\nbool flag = 0;\r\nint main() {\r\n int i, keylen, totallen, len;\r\n string input, key, newkey;\r\n string buf = \""\"";\r\n string debuf = \""\"";\r\n cin >> i >> input >> key;\r\n newkey = key;\r\n sort(newkey.begin(), newkey.end());\r\n keylen = key.length();\r\n totallen = input.length();\r\n len = ceil((double)totallen / keylen);\r\n bool flag = (i == 0);\r\n string *s = new string[keylen];\r\n string *r = new string[keylen];\r\n if (flag) {\r\n vector start(keylen, 0), step(keylen);\r\n for (int i = 0; i < keylen; i++) {\r\n start[i] = (i <= totallen % keylen)\r\n ? i * len\r\n : i + len * (totallen % keylen - 1);\r\n step[i] = totallen / keylen;\r\n step[i] += i < totallen % keylen ? 1 : 0;\r\n }\r\n for (int i = 0; i < keylen; i++) {\r\n int index = key.find(newkey.at(i));\r\n static int cnt = 0;\r\n r[i] = input.substr(cnt, step[index]);\r\n cnt += step[index];\r\n\r\n // std::cout << r[i] << endl;\r\n }\r\n // for (int i = 0; i < keylen; i++) {\r\n // int index = newkey.find(key.at(i));\r\n // // debuf.append(r[index]);\r\n // for (int j = 0; j < len; j++) debuf += (r[i].at(j));\r\n\r\n // }\r\n for (int i = 0; i < len; i++) {\r\n for (int j = 0; (i * keylen + j < totallen) && j < keylen; j++) {\r\n int index = newkey.find(key.at(j));\r\n\r\n debuf += (r[index].at(i));\r\n }\r\n }\r\n // cout << debuf << endl;\r\n // std::cout << debuf << endl;\r\n } else {\r\n for (int i = 0; i < keylen; i++) {\r\n s[i] = \""\"";\r\n string::iterator it = !flag ? input.begin() : debuf.begin();\r\n for (int j = 0; (i + j * keylen) < totallen && j < len; j++) {\r\n s[i] += *(it + i + j * keylen);\r\n }\r\n }\r\n for (int i = 0; i < keylen; i++) {\r\n int index;\r\n index = key.find(newkey.at(i));\r\n debuf.append(s[index]);\r\n }\r\n }\r\n\r\n cout << debuf << endl;\r\n}",ACCEPTED,34,424 1186175589143244800,d0b46e675617344df8739bd61d9be932d4c30907de8bd7a257de1476d15924e8,2019-10-21 15:01:12,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"f = int(input())\ns = input()\nk = input()\nk1 = list([0] * len(k))\ni = 0\nwhile k != 'a' * len(k1):\n k1[k.find(min(k))] = i\n k = k.replace(min(k), 'a')\n i += 1\nif f == 1:\n ss = []\n result = []\n for j in range(0, int(len(s)), i):\n ss.append(s[j: j+i])\n for m in range(i):\n for n in range(len(s) // i):\n result.append(ss[n][k1.index(m)])\n print(''.join(result))\nelif f == 0:\n ss = ['aaaa'] * i\n result = []\n x = 0\n for m in range(i):\n ss[k1.index(m)] = (s[x: len(s) // i + x])\n x += len(s) //i\n for m in range(i):\n for n in range(len(s) // i):\n result.append(ss[n][m])\n print(''.join(result))",PARTIAL_ACCEPTED,81,3040 1186180863400833024,d0b46e675617344df8739bd61d9be932d4c30907de8bd7a257de1476d15924e8,2019-10-21 15:22:09,Python,8.0,1178501854420291584,1176480157125808128,1041335062471446528,"import math\n\nf = int(input())\ns = input()\nk = input()\nk1 = list([0] * len(k))\ni = 0\nwhile k != 'a' * len(k1):\n k1[k.find(min(k))] = i\n k = k.replace(min(k), 'a')\n i += 1\nif f == 1:\n j = math.ceil(len(s) / i)\n ss = []\n result = []\n for y in range(0, i * j, i):\n ss.append(s[y: y+i])\n for m in range(i):\n for n in range(j):\n if k1.index(m) < len(ss[n]):\n result.append(ss[n][k1.index(m)])\n print(''.join(result))\nelif f == 0:\n\n ss = ['a' * j] * i\n result = []\n x = 0\n for m in range(i):\n ss[k1.index(m)] = (s[x: len(s) // i + x])\n x += len(s) //i\n for m in range(i):\n for n in range(len(s) // i):\n result.append(ss[n][m])\n print(''.join(result))",PARTIAL_ACCEPTED,77,3072 1186194107729408000,d0b46e675617344df8739bd61d9be932d4c30907de8bd7a257de1476d15924e8,2019-10-21 16:14:47,Python,14.0,1178501854420291584,1176480157125808128,1041335062471446528,"import math\n\nf = int(input())\ns = input()\nk = input()\nk1 = list([0] * len(k))\ni = 0\nwhile k != 'a' * len(k1):\n k1[k.find(min(k))] = i\n k = k.replace(min(k), 'a')\n i += 1\nif f == 1:\n j = math.ceil(len(s) / i)\n sx = []\n result = []\n for y in range(0, i * j, i):\n sx.append(s[y: y+i])\n for m in range(i):\n for n in range(j):\n if k1.index(m) < len(sx[n]):\n result.append(sx[n][k1.index(m)])\n print(''.join(result))\nelif f == 0:\n j = math.ceil(len(s) / i)\n final = int(len(s) % i)\n sy = ['a' * j] * i\n result = []\n st = 0\n for m in range(i):\n if m >= final:\n sy[k1[m]] = (s[st: st+j-1])\n st = st + j - 1\n else:\n sy[k1.index(m)] = (s[st: st+j])\n st = st + j\n for m in range(i):\n for n in range(j):\n if m < len(sy[n]):\n result.append(sy[n][m])\n print(''.join(result))",PARTIAL_ACCEPTED,105,3224 1186194672379195392,b3ca82c2bd2172e23900f3784b44cdf291c6c584d36e6cda5c882b257a293ce8,2019-10-21 16:17:02,C++,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nclass code\r\n{\r\nprotected:\r\n\tstring ciphertext;\r\n\tstring plaintext;\r\n\tstring key;\r\n\tstring CodeMatrix[10000];\r\n\r\n\tint order[200];\r\n\tint RowNumber;\r\n\tint Remainder;\r\n\r\npublic:\r\n\tvoid InputCiphertext()\r\n\t{\r\n\t\tcin >> ciphertext;\r\n\t}\r\n\r\n\tvoid InputPlaintext()\r\n\t{\r\n\t\tcin >> plaintext;\r\n\t}\r\n\r\n\tvoid InputKey()\r\n\t{\r\n\t\tcin >> key;\r\n\t}\r\n\r\n\tconst int GetLength(string str)\r\n\t{\r\n\t\treturn str.length();\r\n\t}\r\n\r\n\tconst int GetRowNumber()\r\n\t{\r\n\t\treturn RowNumber;\r\n\t}\r\n\r\n\tconst int GetRemainder()\r\n\t{\r\n\t\treturn Remainder;\r\n\t}\r\n\r\n\tvoid CalculateOrder()\r\n\t{\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\torder[i] = i;\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key) - i - 1; j++)\r\n\t\t\t{\r\n\t\t\t\tif (key[order[j]] > key[order[j + 1]])\r\n\t\t\t\t{\r\n\t\t\t\t\tint t = order[j];\r\n\t\t\t\t\torder[j] = order[j + 1];\r\n\t\t\t\t\torder[j + 1] = t;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass encode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[0] = plaintext;\r\n\t\tfor (int i = 0; i < RowNumber - 1; i++)\r\n\t\t{\r\n\t\t\tCodeMatrix[i + 1] = CodeMatrix[i].substr(GetLength(key));\r\n\t\t\tCodeMatrix[i].erase(GetLength(key));\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(plaintext) / GetLength(key);\r\n\t\tRemainder = GetLength(plaintext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << endl;\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && j < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintCiphertext()\r\n\t{\r\n\t\tfor (int j = 0; j < GetLength(key); j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < RowNumber; i++)\r\n\t\t\t{\r\n\t\t\t\tif (i < RowNumber - 1 || i == RowNumber - 1 && order[j] < Remainder || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][order[j]];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nclass decode : public code\r\n{\r\npublic:\r\n\tvoid BuildCodeMatrix()\r\n\t{\r\n\t\tCodeMatrix[order[0]] = ciphertext;\r\n\t\tfor (int i = 0; i < GetLength(key) - 1; i++)\r\n\t\t{\r\n\t\t\tif (Remainder > 0 && order[i] < Remainder || Remainder == 0)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber);\r\n\t\t\t}\r\n\t\t\telse if (Remainder > 0 && order[i] >= Remainder)\r\n\t\t\t{\r\n\t\t\t\tCodeMatrix[order[i + 1]] = CodeMatrix[order[i]].substr(RowNumber - 1);\r\n\t\t\t\tCodeMatrix[order[i]].erase(RowNumber - 1);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tvoid CalculateRowNumberAndRemainder()\r\n\t{\r\n\t\tRowNumber = GetLength(ciphertext) / GetLength(key);\r\n\t\tRemainder = GetLength(ciphertext) % GetLength(key);\r\n\t\tif (Remainder > 0)\r\n\t\t{\r\n\t\t\tRowNumber++;\r\n\t\t}\r\n\t}\r\n\r\n\tconst void PrintCodeMatrix()\r\n\t{\r\n\t\tcout << \""CodeMatrix:\"" << endl;\r\n\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t{\r\n\t\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t\t{\r\n\t\t\t\t//cout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\tif (j < RowNumber || order[i] < Remainder && Remainder > 0 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j] << \"" \"";\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcout << endl;\r\n\t\t}\r\n\t\tcout << endl;\r\n\t}\r\n\r\n\tconst void PrintPlaintext()\r\n\t{\r\n\t\tfor (int j = 0; j < RowNumber; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < GetLength(key); i++)\r\n\t\t\t{\r\n\t\t\t\tif (j == RowNumber - 1 && Remainder > 0 || j < RowNumber - 1 || Remainder == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcout << CodeMatrix[i][j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n};\r\n\r\nint main()\r\n{\r\n\tint ModeNumber(-1);\r\n\r\n//FIRST:\r\n\r\n\t//cout << \""Please input the mode number, 1 for encode and 0 for decode\"" << endl;\r\n\t//cout << \""mode number:\"";\r\n\tcin >> ModeNumber;\r\n\t\r\n\tif (ModeNumber == 1)//encode\r\n\t{\r\n\t\tencode ec;\r\n\t\tec.InputPlaintext();\r\n\t\tec.InputKey();\r\n\t\tec.CalculateRowNumberAndRemainder();\r\n\t\tec.CalculateOrder();\r\n\t\tec.BuildCodeMatrix();\r\n\t\t//ec.PrintCodeMatrix();\r\n\t\tec.PrintCiphertext();\r\n\t}\r\n\telse if (ModeNumber == 0)//decode\r\n\t{\r\n\t\tdecode dc;\r\n\t\tdc.InputCiphertext();\r\n\t\tdc.InputKey();\r\n\t\tdc.CalculateRowNumberAndRemainder();\r\n\t\tdc.CalculateOrder();\r\n\t\tdc.BuildCodeMatrix();\r\n\t\t//dc.PrintCodeMatrix();\r\n\t\tdc.PrintPlaintext();\r\n\t}\r\n\telse//undefiined\r\n\t{\r\n\t\t//cout << \""This mode is not defined!!!\"" << endl;\r\n\t\t//cout << \""Please input again.\"" << endl;\r\n\t\t//goto FIRST;\r\n\t}\r\n\r\n\treturn 0;\r\n}",ACCEPTED,16,680 1186194746211528704,d0b46e675617344df8739bd61d9be932d4c30907de8bd7a257de1476d15924e8,2019-10-21 16:17:19,Python,16.0,1178501854420291584,1176480157125808128,1041335062471446528,"import math\n\nf = int(input())\ns = input()\nk = input()\nk1 = list([0] * len(k))\ni = 0\nwhile k != 'a' * len(k1):\n k1[k.find(min(k))] = i\n k = k.replace(min(k), 'a')\n i += 1\nif f == 1:\n j = math.ceil(len(s) / i)\n sx = []\n result = []\n for y in range(0, i * j, i):\n sx.append(s[y: y+i])\n for m in range(i):\n for n in range(j):\n if k1.index(m) < len(sx[n]):\n result.append(sx[n][k1.index(m)])\n print(''.join(result))\nelif f == 0:\n j = math.ceil(len(s) / i)\n final = int(len(s) % i)\n sy = ['a' * j] * i\n result = []\n st = 0\n for m in range(i):\n if m >= final:\n sy[k1[m]] = (s[st: st+j])\n st = st + j\n else:\n sy[k1.index(m)] = (s[st: st+j+1])\n st = st + j + 1\n for m in range(i):\n for n in range(j):\n if m < len(sy[n]):\n result.append(sy[n][m])\n print(''.join(result))",PARTIAL_ACCEPTED,98,3072 1186196006700544000,d0b46e675617344df8739bd61d9be932d4c30907de8bd7a257de1476d15924e8,2019-10-21 16:22:20,Python,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"import math\n\nf = int(input())\ns = input()\nk = input()\nk1 = list([0] * len(k))\ni = 0\nwhile k != 'a' * len(k1):\n k1[k.find(min(k))] = i\n k = k.replace(min(k), 'a')\n i += 1\nif f == 1:\n j = math.ceil(len(s) / i)\n sx = []\n result = []\n for y in range(0, i * j, i):\n sx.append(s[y: y+i])\n for m in range(i):\n for n in range(j):\n if k1.index(m) < len(sx[n]):\n result.append(sx[n][k1.index(m)])\n print(''.join(result))\nelif f == 0:\n j = math.ceil(len(s) / i)\n final = int(len(s) % i)\n sy = ['a' * j] * i\n result = []\n st = 0\n for m in range(i):\n if m >= final != 0:\n sy[k1[m]] = (s[st: st+j-1])\n st = st + j-1\n else:\n sy[k1.index(m)] = (s[st: st+j])\n st = st + j\n for m in range(i):\n for n in range(j):\n if m < len(sy[n]):\n result.append(sy[n][m])\n print(''.join(result))",ACCEPTED,134,3116 1186196092314677248,d0b46e675617344df8739bd61d9be932d4c30907de8bd7a257de1476d15924e8,2019-10-21 16:22:40,Python,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"import math\n\nf = int(input())\ns = input()\nk = input()\nk1 = list([0] * len(k))\ni = 0\nwhile k != 'a' * len(k1):\n k1[k.find(min(k))] = i\n k = k.replace(min(k), 'a')\n i += 1\nif f == 1:\n j = math.ceil(len(s) / i)\n sx = []\n result = []\n for y in range(0, i * j, i):\n sx.append(s[y: y+i])\n for m in range(i):\n for n in range(j):\n if k1.index(m) < len(sx[n]):\n result.append(sx[n][k1.index(m)])\n print(''.join(result))\nelif f == 0:\n j = math.ceil(len(s) / i)\n final = int(len(s) % i)\n sy = ['a' * j] * i\n result = []\n st = 0\n for m in range(i):\n if m >= final != 0:\n sy[k1[m]] = (s[st: st+j-1])\n st = st + j-1\n else:\n sy[k1.index(m)] = (s[st: st+j])\n st = st + j\n for m in range(i):\n for n in range(j):\n if m < len(sy[n]):\n result.append(sy[n][m])\n print(''.join(result))",ACCEPTED,80,3096 1186206205104582656,b4def7be0be1da0c23d5c45963dc719832d689e9ea4953a54a34a520100de1cf,2019-10-21 17:02:51,Python,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#! /usr/bin/python3\n# -*- coding: utf-8 -*-\n# auther: dearfl\n\nimport sys\n\ndef order(key, k):\n count = 0\n for i in range(0, len(key)):\n count = count + 1 if key[i] < key[k] else count\n return count\n\ndef kth(key, k):\n for i in range(0, len(key)):\n if order(key, i) == k:\n return i\n return -1\n\n\ndef encrypt(msg, key):\n col = len(key)\n msgl = len(msg)\n rst = ''\n for i in range(0, col):\n index = kth(key, i)\n while index < msgl:\n rst += msg[index]\n index += col\n return rst\n\ndef decrypt(msg, key):\n col = len(key)\n msgl = len(msg)\n row = msgl // col\n extra = msgl % col\n rst = ''\n index = 0\n i = 0\n j = 0\n while i * col + j < msgl:\n # print(\""order(k,j):\"" + str(order(key, j)))\n index = order(key, j) * row + min(order(key, j), extra) + i\n rst += msg[index]\n j = (j + 1) % col\n i = i + 1 if j == 0 else i\n # print(rst)\n return rst\n\ndef main():\n enc = int(input())\n msg = input()\n key = input()\n if enc:\n print(encrypt(msg, key))\n else:\n print(decrypt(msg, key))\n\nif __name__ == '__main__':\n main()",ACCEPTED,95,3112 1186234129371328512,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 18:53:49,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1 = 0;\r\n scanf_s(\""%d\"",&F);\r\n scanf_s(\""%63s\"", wen,64);\r\n scanf_s(\""%63s\"", miyao,64);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1 = 0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\nint main(){\r\n\tint mode=-1;\r\n\tscanf(\""%d\\n\"",&mode);\r\n\tint a[100000]={}; \r\n\tint i=-1;\r\n\tdo{\r\n\t\ti++;\r\n\t\tscanf(\""%c\"",&a[i]);\r\n\t//\tprintf(\""%c\"",a[i]);\r\n\t}while(a[i]>=65&&a[i]<=90);\r\n\t/*从a[0]开始依次读入明文，总个数即为i*/ \r\n//\tprintf(\""%c\"",a[0]);\r\n\t\r\n\t\t\r\n\tint code[28]={};\r\n\t\tint c=0;\r\n\t\tint j=1;\r\n\t\twhile(1){\r\n\t\t\tscanf(\""%c\"",&c);\r\n\t\t\tif(c<65||c>90)break; \r\n\t\t//\tprintf(\""%c \"",c);\r\n\t\t\tint C=(int)c;\r\n\t\t\tcode[C-64]=j;/*第c-64个字母是第j个出现的*/ \r\n\t\t//\tprintf(\""code[%d]=%d \"",C-64,code[C-64]);\r\n\t\t//\tprintf(\""j=%d\"",j);\r\n\t\t\tj++;\r\n\t\t\t\r\n\t\t//\tc=0;\r\n\t\t}\r\n\t\tj--;\r\n if(i%j==0){\r\n i/=j;\r\n }else{\r\n int add=i%j;\r\n int g=0;\r\n for(g=0;g=1){\r\n\t\t\t\ts[n]=code[m];/*排序为第n的字母是第s[n]个出现的*/ \r\n\t\t//\t\tprintf(\""s[%d]=%d\\n\\n\\n\\n\"",n,s[n]);\r\n\t\t\t\tn++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tint t=0;\r\n\t\tfor(t=0;t\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\nint main(){\r\n\tint mode=-1;\r\n\tscanf(\""%d\\n\"",&mode);\r\n\tint a[100000]={}; \r\n\tint i=-1;\r\n\tdo{\r\n\t\ti++;\r\n\t\tscanf(\""%c\"",&a[i]);\r\n\t//\tprintf(\""%c\"",a[i]);\r\n\t}while(a[i]>=65&&a[i]<=90);\r\n\t/*从a[0]开始依次读入明文，总个数即为i*/ \r\n//\tprintf(\""%c\"",a[0]);\r\n\t\r\n\t\t\r\n\tint code[28]={};\r\n\t\tint c=0;\r\n\t\tint j=1;\r\n\t\twhile(1){\r\n\t\t\tscanf(\""%c\"",&c);\r\n\t\t\tif(c<65||c>90)break; \r\n\t\t//\tprintf(\""%c \"",c);\r\n\t\t\tint C=(int)c;\r\n\t\t\tcode[C-64]=j;/*第c-64个字母是第j个出现的*/ \r\n\t\t//\tprintf(\""code[%d]=%d \"",C-64,code[C-64]);\r\n\t\t//\tprintf(\""j=%d\"",j);\r\n\t\t\tj++;\r\n\t\t\t\r\n\t\t//\tc=0;\r\n\t\t}\r\n\t\tj--;\r\n if(i%j==0){\r\n i/=j;\r\n }else{\r\n int add=i%j;\r\n int g=0;\r\n for(g=0;g=1){\r\n\t\t\t\ts[n]=code[m];/*排序为第n的字母是第s[n]个出现的*/ \r\n\t\t//\t\tprintf(\""s[%d]=%d\\n\\n\\n\\n\"",n,s[n]);\r\n\t\t\t\tn++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tint t=0;\r\n\t\tfor(t=0;t\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tint i = 0, j= 0,m=0;\r\n\tfor (i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor ( j= 0 ; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor ( i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor( i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tint i = 0, j= 0,m=0;\r\n\tfor (i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor ( j= 0 ; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor ( i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor( i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint F,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[50][20],temp1[50][20];\r\n char wen[1001];\r\n char miyao[20],outwen[1001];\r\n\tint count = 0,count1=0;\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n\tmylen=strlen(miyao); \r\n\twlen=strlen(wen);\r\n\trow=wlen/mylen;\r\n\tremain=wlen%mylen;\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n if(F==1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\tfor(int i=0;i0):\r\n minnumber=i\r\n # print(i)\r\n \r\n del d[minnumber]\r\n # print(d)\r\n \r\n px.append(zz[minnumber])\r\n # print(minnumber)\r\n\r\n del zz[minnumber]\r\n\r\n # print(px)\r\n\r\n for i in range(len(b)):\r\n s=''.join(px[i])\r\n print(s,end='')\r\n\r\nif(jd=='0'):\r\n for i in range(len(b)):\r\n d.append(b[i])\r\n\r\n\r\n \""\""\""print(a)\r\n print(b)\r\n print(jd)\r\n print(d)\""\""\""\r\n\r\n for i in range(len(b)):\r\n jz.append([])\r\n for j in range(len(b)):\r\n jz[i].append(a[c])\r\n c=c+1\r\n px=[[None]*len(b) for p in range(len(b))]\r\n for k in range(len(b)):\r\n minnumber=0\r\n for i in range(len(d)):\r\n if(ord(d[minnumber])-ord(d[i])>0):\r\n minnumber=i\r\n # print(i)\r\n \r\n d[minnumber]='~'\r\n \""\""\""print(k)\r\n print(d)\r\n print(jz[k])\r\n print(px[minnumber])\""\""\""\r\n px[minnumber]=jz[k]\r\n \""\""\""\r\n print(px[minnumber])\r\n print(minnumber)\""\""\""\r\n\r\n\r\n for i in range(len(b)):\r\n zz.append([])\r\n for j in range(len(b)):\r\n zz[i].append(px[j][i])\r\n\r\n for i in range(len(b)):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n",PARTIAL_ACCEPTED,81,3200 1186250816111996928,c45fc9a01ece227ea36a7505282c1dd1639b992b08b951aaa58e2ce7f44b9b1e,2019-10-21 20:00:07,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include \r\n#include \r\n#include \r\n \r\nconst int MAXSIZE = 100;\r\n \r\nchar *encrypt(char *essay) {\r\n int i,j,n,u,v,m,len = strlen(essay);\r\n char *result;\r\n m = n = (int)sqrt(len);\r\n if(m * m < len) ++n;\r\n result = (char *)malloc(m * n * sizeof(char) + 1);\r\n for(i = 0; i < m; ++i) {\r\n for(j = 0; j < n; ++j) {\r\n u = n * i + j;\r\n v = m * j + i;\r\n if(u < len) result[v] = essay[u];\r\n else result[v] = ' ';\r\n }\r\n }\r\n result[m * n] = 0;\r\n return result;\r\n}\r\n \r\nint main() {\r\n char s[MAXSIZE],*u;\r\n printf(\""输入明文:\\n\"");\r\n fgets(s,MAXSIZE,stdin);\r\n s[strlen(s) - 1] = 0; // 去除尾部的\\n\r\n u = encrypt(s);\r\n printf(\""密文是:\\n%s\\n\"",u);\r\n free(u);\r\n return 0;\r\n}",WRONG_ANSWER,7,368 1186252332407418880,dbad9b42fb10281dfd7503cd63aa7b7c20faf7a0230b3f9fca6f9a001bc6f35d,2019-10-21 20:06:09,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"\r\njd=input()\r\na=[]\r\na=input()\r\nb=[]\r\nb=input()\r\njz=[]\r\nzz=[]\r\nc=0\r\nd=[]\r\n\r\n\r\nif (jd=='1'):\r\n for i in range(len(b)):\r\n d.append(b[i])\r\n\r\n\r\n \r\n\r\n for i in range(len(b)):\r\n jz.append([])\r\n for j in range(len(b)):\r\n jz[i].append(a[c])\r\n c=c+1\r\n\r\n for i in range(len(b)):\r\n zz.append([])\r\n for j in range(len(b)):\r\n zz[i].append(jz[j][i])\r\n\r\n \r\n\r\n px=[]\r\n for k in range(len(b)):\r\n minnumber=0\r\n for i in range(len(d)):\r\n if(ord(d[minnumber])-ord(d[i])>0):\r\n minnumber=i\r\n # print(i)\r\n \r\n del d[minnumber]\r\n # print(d)\r\n \r\n px.append(zz[minnumber])\r\n # print(minnumber)\r\n\r\n del zz[minnumber]\r\n\r\n # print(px)\r\n\r\n for i in range(len(b)):\r\n s=''.join(px[i])\r\n print(s,end='')\r\n\r\nif(jd=='0'):\r\n for i in range(len(b)):\r\n d.append(b[i])\r\n\r\n\r\n \r\n\r\n for i in range(len(b)):\r\n jz.append([])\r\n for j in range(len(b)):\r\n jz[i].append(a[c])\r\n c=c+1\r\n px=[[None]*len(b) for p in range(len(b))]\r\n for k in range(len(b)):\r\n minnumber=0\r\n for i in range(len(d)):\r\n if(ord(d[minnumber])-ord(d[i])>0):\r\n minnumber=i\r\n # print(i)\r\n \r\n d[minnumber]='~'\r\n px[minnumber]=jz[k]\r\n \r\n\r\n\r\n for i in range(len(b)):\r\n zz.append([])\r\n for j in range(len(b)):\r\n zz[i].append(px[j][i])\r\n\r\n for i in range(len(b)):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n",PARTIAL_ACCEPTED,177,3156 1186253225894834176,ab254df7ae28c2b162e45f6e2f5dc697a5abb18265dde759d28cabd829c73efa,2019-10-21 20:09:42,C,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\r\nint main(){\r\n\tint mode=-1;\r\n\tscanf(\""%d\\n\"",&mode);\r\n\tchar a[100000]={}; \r\n\tint i=-1;\r\n\tdo{\r\n\t\ti++;\r\n\t\tscanf(\""%c\"",&a[i]);\r\n\t//\tprintf(\""%c\"",a[i]);\r\n\t}while(a[i]>=65&&a[i]<=90);\r\n\t/*从a[0]开始依次读入明文，总个数即为i*/ \r\n//\tprintf(\""%c\"",a[0]);\r\n\t\r\n\t\t\r\n\tint code[28]={};\r\n\t\tchar c;\r\n\t\tint j=1;\r\n\t\twhile(1){\r\n\t\t\tscanf(\""%c\"",&c);\r\n\t\t\tif(c<65||c>90)break; \r\n\t\t//\tprintf(\""%c \"",c);\r\n\t\t\tint C=(int)c;\r\n\t\t\tcode[C-64]=j;/*第c-64个字母是第j个出现的*/ \r\n\t\t//\tprintf(\""code[%d]=%d \"",C-64,code[C-64]);\r\n\t\t//\tprintf(\""j=%d\"",j);\r\n\t\t\tj++;\r\n\t\t\t\r\n\t\t//\tc=0;\r\n\t\t}\r\n\t\tj--;\r\n if(i%j==0){\r\n i/=j;\r\n }else{\r\n int add=i%j;\r\n if(mode==1){\r\n \tint g=0;\r\n \t for(g=0;g=1){\r\n\t\t\t\ts[n]=code[m];/*排序为第n的字母是第s[n]个出现的*/ \r\n\t\t//\t\tprintf(\""s[%d]=%d\\n\\n\\n\\n\"",n,s[n]);\r\n\t\t\t\tn++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tint t=0;\r\n\t\tfor(t=0;t\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint Mode ,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[40][20],temp1[40][20];\r\n char wen[800];\r\n char miyao[20],outwen[800];\r\n\tint count = 0,count1=0;\r\n\t\r\n scanf(\""%d\"",&F);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n \r\n \r\n\tmylen = strlen(miyao); \r\n\twlen = strlen(wen);\r\n\trow = wlen/mylen;\r\n\tremain = wlen%mylen;\r\n\t\r\n\t\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n\t\r\n\t\r\n if(Mode == 1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\t\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint Mode ,mylen,wlen,row,remain;\r\n\tstatic int order[20];\r\n char temp[40][20],temp1[40][20];\r\n char wen[800];\r\n char miyao[20],outwen[800];\r\n\tint count = 0,count1=0;\r\n\t\r\n scanf(\""%d\"",&Mode);\r\n scanf(\""%s\"", wen);\r\n scanf(\""%s\"", miyao);\r\n \r\n \r\n\tmylen = strlen(miyao); \r\n\twlen = strlen(wen);\r\n\trow = wlen/mylen;\r\n\tremain = wlen%mylen;\r\n\t\r\n\t\r\n\tfor (int i = 0; i < mylen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < mylen; j++)\r\n\t\t{\r\n\t\t\tif (miyao[j] < miyao[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n\t\r\n\t\r\n if(Mode == 1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < mylen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = wen[mylen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\t\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\nchar c;\r\n char *str=(char*)malloc(sizeof(char*));\r\n char key[20];\r\n char *str2=(char*)malloc(1024);\r\nscanf(\""%d\"" ,&a);\r\ni=0;\r\nwhile((c=getchar())!='/n'){\r\nstr[i]=c;\r\ni++;\r\nstr=realloc(str,i+1);\r\n}\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nstr2=realloc(str2,h1);\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i0):\r\n minnumber=i\r\n # print(i)\r\n \r\n del d[minnumber]\r\n # print(d)\r\n \r\n px.append(zz[minnumber])\r\n # print(minnumber)\r\n\r\n del zz[minnumber]\r\n\r\n # print(px)\r\n\r\n for i in range(cd):\r\n s=''.join(px[i])\r\n print(s,end='')\r\n\r\nif(jd=='0'):\r\n for i in range(len(b)):\r\n d.append(b[i])\r\n\r\n\r\n \""\""\""print(a)\r\n print(b)\r\n print(jd)\r\n print(d)\""\""\""\r\n\r\n for i in range(cd):\r\n jz.append([])\r\n for j in range(cd):\r\n jz[i].append(a[c])\r\n c=c+1\r\n px=[[None]*cd for p in range(cd)]\r\n for k in range(cd):\r\n minnumber=0\r\n for i in range(len(d)):\r\n if(ord(d[minnumber])-ord(d[i])>0):\r\n minnumber=i\r\n # print(i)\r\n \r\n d[minnumber]='~'\r\n \""\""\""print(k)\r\n print(d)\r\n print(jz[k])\r\n print(px[minnumber])\""\""\""\r\n px[minnumber]=jz[k]\r\n \""\""\""\r\nprint(px[minnumber])\r\n print(minnumber)\""\""\""\r\n\r\n\r\n for i in range(cd):\r\n zz.append([])\r\n for j in range(cd):\r\n zz[i].append(px[j][i])\r\n\r\n for i in range(cd):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n",PARTIAL_ACCEPTED,77,3136 1186256791216812033,dbad9b42fb10281dfd7503cd63aa7b7c20faf7a0230b3f9fca6f9a001bc6f35d,2019-10-21 20:23:52,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"\r\njd=input()\r\na=[]\r\na=input()\r\nb=[]\r\nb=input()\r\njz=[]\r\nzz=[]\r\nc=0\r\nd=[]\r\ncd=min(len(b),len(a)//len(b))\r\n\r\nif (jd=='1'):\r\n for i in range(len(b)):\r\n d.append(b[i])\r\n\r\n\r\n \r\n for i in range(cd):\r\n jz.append([])\r\n for j in range(cd):\r\n jz[i].append(a[c])\r\n c=c+1\r\n\r\n for i in range(cd):\r\n zz.append([])\r\n for j in range(cd):\r\n zz[i].append(jz[j][i])\r\n\r\n\r\n px=[]\r\n for k in range(cd):\r\n minnumber=0\r\n for i in range(len(d)):\r\n if(ord(d[minnumber])-ord(d[i])>0):\r\n minnumber=i\r\n # print(i)\r\n \r\n del d[minnumber]\r\n # print(d)\r\n \r\n px.append(zz[minnumber])\r\n # print(minnumber)\r\n\r\n del zz[minnumber]\r\n\r\n # print(px)\r\n\r\n for i in range(cd):\r\n s=''.join(px[i])\r\n print(s,end='')\r\n\r\nif(jd=='0'):\r\n for i in range(len(b)):\r\n d.append(b[i])\r\n\r\n\r\n \r\n\r\n for i in range(cd):\r\n jz.append([])\r\n for j in range(cd):\r\n jz[i].append(a[c])\r\n c=c+1\r\n px=[[None]*cd for p in range(cd)]\r\n for k in range(cd):\r\n minnumber=0\r\n for i in range(len(d)):\r\n if(ord(d[minnumber])-ord(d[i])>0):\r\n minnumber=i\r\n # print(i)\r\n \r\n d[minnumber]='~'\r\n \r\n px[minnumber]=jz[k]\r\n \r\n\r\n\r\n for i in range(cd):\r\n zz.append([])\r\n for j in range(cd):\r\n zz[i].append(px[j][i])\r\n\r\n for i in range(cd):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n",PARTIAL_ACCEPTED,79,3200 1186256887832604672,dbad9b42fb10281dfd7503cd63aa7b7c20faf7a0230b3f9fca6f9a001bc6f35d,2019-10-21 20:24:15,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"\r\njd=input()\r\na=[]\r\na=input()\r\nb=[]\r\nb=input()\r\njz=[]\r\nzz=[]\r\nc=0\r\nd=[]\r\ncd=min(len(b),len(a)//len(b))\r\n\r\nif (jd=='1'):\r\n for i in range(len(b)):\r\n d.append(b[i])\r\n\r\n\r\n \r\n for i in range(cd):\r\n jz.append([])\r\n for j in range(cd):\r\n jz[i].append(a[c])\r\n c=c+1\r\n\r\n for i in range(cd):\r\n zz.append([])\r\n for j in range(cd):\r\n zz[i].append(jz[j][i])\r\n\r\n\r\n px=[]\r\n for k in range(cd):\r\n minnumber=0\r\n for i in range(len(d)):\r\n if(ord(d[minnumber])-ord(d[i])>0):\r\n minnumber=i\r\n # print(i)\r\n \r\n del d[minnumber]\r\n # print(d)\r\n \r\n px.append(zz[minnumber])\r\n # print(minnumber)\r\n\r\n del zz[minnumber]\r\n\r\n # print(px)\r\n\r\n for i in range(cd):\r\n s=''.join(px[i])\r\n print(s,end='')\r\n\r\nif(jd=='0'):\r\n for i in range(len(b)):\r\n d.append(b[i])\r\n\r\n\r\n \r\n\r\n for i in range(cd):\r\n jz.append([])\r\n for j in range(cd):\r\n jz[i].append(a[c])\r\n c=c+1\r\n px=[[None]*cd for p in range(cd)]\r\n for k in range(cd):\r\n minnumber=0\r\n for i in range(len(d)):\r\n if(ord(d[minnumber])-ord(d[i])>0):\r\n minnumber=i\r\n # print(i)\r\n \r\n d[minnumber]='~'\r\n \r\n px[minnumber]=jz[k]\r\n \r\n\r\n\r\n for i in range(cd):\r\n zz.append([])\r\n for j in range(cd):\r\n zz[i].append(px[j][i])\r\n\r\n for i in range(cd):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n",PARTIAL_ACCEPTED,116,3148 1186258203912925184,b7a6ba93bb66bc117e171d4cbf3ef494425eee645ab318e2ecd12a5e26459e22,2019-10-21 20:29:29,C++,20.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include \r\n#include\r\n#include\r\n#include\r\nint main()\r\n{\r\n\tint Mode ,KeyLen,CipLen,row,residule;\r\n\t\r\n\tstatic int order[20];\r\n\t\r\n char temp[40][20],temp1[40][20];\r\n char ciphertext[800];\r\n char key[20],plaintext[800];\r\n\tint count = 0,count1=0;\r\n\t\r\n scanf(\""%d\"",&Mode);\r\n scanf(\""%s\"", ciphertext);\r\n scanf(\""%s\"", key);\r\n \r\n \r\n\tKeyLen = strlen(key); \r\n\tCipLen = strlen(ciphertext);\r\n\trow = CipLen/KeyLen;\r\n\tresidule = CipLen%KeyLen;\r\n\t\r\n\t\r\n\tfor (int i = 0; i < KeyLen; i++)\r\n\t{\r\n\t\tfor (int j = 0; j < KeyLen; j++)\r\n\t\t{\r\n\t\t\tif (key[j] < key[i])\r\n\t\t\t\torder[i] = order[i] + 1;\r\n\t\t}\r\n\t}\r\n\t\r\n\t\r\n if(Mode == 1)\r\n\t{\r\n\t\tfor (int j = 0; j < row; j++)\r\n\t\t{\r\n\t\t\tfor (int i = 0; i < KeyLen; i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[j][order[i]] = ciphertext[KeyLen*j + i];\r\n\t\t\t}\t\t\r\n\t\t}\r\n\t\t\r\n\t\tfor(int i=0;i\r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint i,flag;\r\n\tstring key, plain, back;\r\n\tcin >> key;\r\n\tback = key;\r\n\tcin >> plain;\r\n\tint l;\r\n\tl = plain.size() / key.size();\r\n\tfor (auto i = plain.size(); i % key.size() != 0; i++)\r\n\t{\r\n\t\tplain.push_back('x');//通过判断在明文数组后面补齐x\r\n\t}\r\n\tcout << endl;\r\n\tfor (auto i = 0; i < plain.size(); i++)//输出列宽为密钥长度的矩阵\r\n\t{\r\n\t\tcout << plain[i];\r\n\t\tif (i % key.size() == key.size()-1)\r\n\t\t{\r\n\t\t\tcout << \""\\n\"";\r\n\t\t}\r\n\t}\r\n\tcout << \""\\n\\n\"";\r\n\tcout << \""排序后:\\n\"";\r\n\tfor (auto i = 0; i < key.size() - 1; i++)\r\n\t{\r\n\t\tfor (auto j = 1; j < key.size() - 1; j++)\r\n\t\t{\r\n\t\t\tif ((int)key[j]>(int)key[j + 1])//使用冒泡排序通过对比密钥对应的asc码进行从小到大排序\r\n\t\t\t{\r\n\t\t\t\tswap(key[j], key[j + 1]);//将明文通过此排序可得排序后的明文\r\n\t\t\t\tfor (auto k = 0; k <= l; k++)\r\n\t\t\t\t{\r\n\t\t\t\t\tswap(plain[j + k*key.size()], plain[j + 1 + k*key.size()]);\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tfor (auto i = 0; i < plain.size(); i++) //输出列宽为密钥长度的矩阵\r\n\t{\r\n\t\tcout << plain[i];\r\n\t\tif (i % 8 == 7)\r\n\t\t{\r\n\t\t\tcout << \""\\n\"";\r\n\t\t}\r\n\t}\r\n\tcout << \""\\n\\n\"";\r\n\tfor (auto i = 0; i \r\nint main(){\r\n\tint mode=-1;\r\n\tscanf(\""%d\\n\"",&mode);\r\n\tchar a[100000]={}; \r\n\tint i=-1;\r\n\tdo{\r\n\t\ti++;\r\n\t\tscanf(\""%c\"",&a[i]);\r\n\t//\tprintf(\""%c\"",a[i]);\r\n\t}while(a[i]>=65&&a[i]<=90);\r\n\t/*从a[0]开始依次读入明文，总个数即为i*/ \r\n//\tprintf(\""%c\"",a[0]);\r\n\t\r\n\t\t\r\n\tint code[28]={};\r\n\t\tchar c;\r\n\t\tint j=1;\r\n\t\twhile(1){\r\n\t\t\tscanf(\""%c\"",&c);\r\n\t\t\tif(c<65||c>90)break; \r\n\t\t//\tprintf(\""%c \"",c);\r\n\t\t\tint C=(int)c;\r\n\t\t\tcode[C-64]=j;/*第c-64个字母是第j个出现的*/ \r\n\t\t//\tprintf(\""code[%d]=%d \"",C-64,code[C-64]);\r\n\t\t//\tprintf(\""j=%d\"",j);\r\n\t\t\tj++;\r\n\t\t\t\r\n\t\t//\tc=0;\r\n\t\t}\r\n\t\tj--;\r\n if(i%j==0){\r\n i/=j;\r\n }else{\r\n int add=i%j;\r\n if(mode==1){\r\n \tint g=0;\r\n \t for(g=0;g=1){\r\n\t\t\t\ts[n]=code[m];/*排序为第n的字母是第s[n]个出现的*/ \r\n\t\t//\t\tprintf(\""s[%d]=%d\\n\\n\\n\\n\"",n,s[n]);\r\n\t\t\t\tn++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tint t=0;\r\n\t\tfor(t=0;t\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\nchar c;\r\n char *str=(char*)malloc(sizeof(char*));\r\n char key[20];\r\n char *str2=(char*)malloc(1024);\r\nscanf(\""%d\"" ,&a);\r\ni=0;\r\nc=getchar();\r\nwhile((c=getchar())!='\\n'){\r\nstr[i]=c;\r\ni++;\r\nstr=realloc(str,i+1);\r\n}\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nstr2=realloc(str2,h1);\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n\r\nint main()\r\n{\r\n\tint F=0,m=0,n=0;\r\n\tchar S[9999]=\""\"",K[20]=\""\"";\t\r\n\tscanf(\""%d\\n%s\\n%s\"",&F,S,K);\r\n\tn=strlen(K),m=strlen(S);\r\n\tm=(m+n-1)/n;\r\n\tchar s[m+1][n+1];\r\n\tfor(int i=0;i<=m;i++){\r\n\t\tfor(int j=0;j<=n;j++){\r\n\t\t\ts[i][j]='\\0';\r\n\t\t}\r\n\t}\r\n\tif(F==0){\r\n\t\tint min=0;\r\n\t\tfor(int i=0;i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\nchar c;\r\n char *str=(char*)malloc(sizeof(char*));\r\n char key[20];\r\n char *str2=(char*)malloc(1024);\r\nscanf(\""%d\"" ,&a);\r\ni=0;\r\nc=getchar();\r\nwhile((c=getchar())!='\\n'){\r\nstr[i]=c;\r\ni++;\r\nstr=realloc(str,i+1);\r\n}\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nstr2=realloc(str2,sizeof(str));\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\nchar c;\r\n char *str=(char*)malloc(sizeof(char*));\r\n char key[20];\r\n char *str2=(char*)malloc(1024);\r\nscanf(\""%d\"" ,&a);\r\ni=0;\r\nc=getchar();\r\nwhile((c=getchar())!='\\n'){\r\nstr[i]=c;\r\ni++;\r\nstr=realloc(str,(i+1)*sizeof(char));\r\n}\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nstr2=realloc(str2,sizeof(str));\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\nchar c;\r\n char *str=(char*)malloc(sizeof(char*));\r\n char key[20];\r\n char *str2=(char*)malloc(sizeof(char));\r\nscanf(\""%d\"" ,&a);\r\ni=0;\r\nc=getchar();\r\nwhile((c=getchar())!='\\n'){\r\nstr[i]=c;\r\ni++;\r\nstr=realloc(str,(i+1)*sizeof(char));\r\n}\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nstr2=realloc(str2,sizeof(str));\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i\r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint i,flag;\r\n\tstring key, plain, back;\r\n\tcin >> key;\r\n\tback = key;\r\n\tcin >> plain;\r\n\tint l;\r\n\tl = plain.size() / key.size();\r\n\tfor (auto i = plain.size(); i % key.size() != 0; i++)\r\n\t{\r\n\t\tplain.push_back('x');//通过判断在明文数组后面补齐x\r\n\t}\r\n\tcout << endl;\r\n\tfor (auto i = 0; i < plain.size(); i++)//输出列宽为密钥长度的矩阵\r\n\t{\r\n\t\tcout << plain[i];\r\n\t\tif (i % key.size() == key.size()-1)\r\n\t\t{\r\n\t\t\tcout << \""\\n\"";\r\n\t\t}\r\n\t}\r\n\tcout << \""\\n\\n\"";\r\n\tcout << \""排序后:\\n\"";\r\n\tfor (auto i = 0; i < key.size() - 1; i++)\r\n\t{\r\n\t\tfor (auto j = 1; j < key.size() - 1; j++)\r\n\t\t{\r\n\t\t\tif ((int)key[j]>(int)key[j + 1])//使用冒泡排序通过对比密钥对应的asc码进行从小到大排序\r\n\t\t\t{\r\n\t\t\t\tswap(key[j], key[j + 1]);//将明文通过此排序可得排序后的明文\r\n\t\t\t\tfor (auto k = 0; k <= l; k++)\r\n\t\t\t\t{\r\n\t\t\t\t\tswap(plain[j + k*key.size()], plain[j + 1 + k*key.size()]);\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tfor (auto i = 0; i < plain.size(); i++) //输出列宽为密钥长度的矩阵\r\n\t{\r\n\t\tcout << plain[i];\r\n\t\tif (i % 8 == 7)\r\n\t\t{\r\n\t\t\tcout << \""\\n\"";\r\n\t\t}\r\n\t}\r\n\tcout << \""\\n\\n\"";\r\n\tfor (auto i = 0; i \r\n#include\r\n#include\r\nint main()\r\n{ int a,i,j,k,h1,h2,h3,h4,h5,h6,keysize;\r\n int b[20];\r\nchar c;\r\n char *str=(char*)malloc(sizeof(char));\r\n char key[20];\r\n char *str2=(char*)malloc(sizeof(char));\r\nscanf(\""%d\"" ,&a);\r\ni=0;\r\nc=getchar();\r\nwhile((c=getchar())!='\\n'){\r\nstr[i]=c;\r\ni++;\r\nstr=realloc(str,(i+1)*sizeof(char));\r\n}\r\nscanf(\""%s\"",key);\r\ni=0;keysize=0;\r\nwhile(key[i]>='A'&&key[i]<='Z'){i++;keysize++;}\r\nfor(i=0; ikey[j]){b[i]++;}\r\n}\r\n}\r\nh1=0;h5=0;h6=0;\r\ni=0;\r\n\r\nwhile((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){i++;h1++;}\r\nstr2=realloc(str2,sizeof(str));\r\nh2=h1/keysize;\r\nh3=h1%keysize;\r\n\r\nif(a==1){\r\nfor(i=0; i0):\r\n minnum=i \r\n del d[minnum] \r\n sort.append(zz[minnum]) \r\n del zz[minnum]\r\n for i in range(len(key)):\r\n s=''.join(sort[i])\r\n print(s,end='')\r\n\r\nif(start=='0'):\r\n for i in range(len(key)):\r\n d.append(key[i])\r\n for i in range(len(key)):\r\n jz.append([])\r\n for j in range(len(key)):\r\n jz[i].append(message[c])\r\n c=c+1\r\n sort=[[None]*len(key) for p in range(len(key))]\r\n for k in range(len(key)):\r\n minnum=0\r\n for i in range(len(d)):\r\n if(ord(d[minnum])-ord(d[i])>0):\r\n minnum=i \r\n d[minnum]='~'\r\n sort[minnum]=jz[k]\r\n for i in range(len(key)):\r\n zz.append([])\r\n for j in range(len(key)):\r\n zz[i].append(sort[j][i])\r\n for i in range(len(key)):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n\r\n",PARTIAL_ACCEPTED,104,3280 1186266302954565632,577060d7056d89723f6df2b13e7a675e13c8ea414a6522bd3ef5956ad6de41f9,2019-10-21 21:01:40,Java,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n\tpublic static void main(String[] args)throws IOException {\r\n\t\tScanner in=new Scanner(System.in);\r\n\t\tint f=in.nextInt();\r\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\r\n\t\tString s=br.readLine();\r\n\t\tString k=br.readLine();\r\n\t\tif(f==0){\r\n\t\t\tDecryption De=new Decryption(s,k);\r\n\t\t}else if(f==1) {\r\n\t\t\tEncryption En=new Encryption(s,k);\r\n\t\t\t\r\n\t\t}else {\r\n\t\t\tSystem.out.println(\""Input error\"");\r\n\t\t}\r\n\t}\r\n}\r\n//加密\r\nclass Encryption{\r\n\tprivate String x,y;\r\n\tprivate int t,l,h;\r\n\tpublic Encryption(String a,String b){\r\n\t\tx=a;\r\n\t\ty=b;\r\n\t\tt=x.length();\r\n\t\tl=y.length();\r\n\t\th=(t%l==0)? t/l:t/l+1;\r\n\t\t//将明文存入数组\r\n\t\tchar[][] xArr=new char[h][l];\r\n\t\tfor(int i=0;i\r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tint i,j,flag;\r\n\tstring key, plain, back;\r\n\tcin >> flag;\r\n\tcout << \""请输入明文(不需要输入间隔):\\n\"";\r\n\tcin >> plain;\r\n\tcout << \""请输入密钥:\\n\"";\r\n\tcin >> key;\r\n\tback = key;\r\n\tint l;\r\n\tl = plain.size() / key.size();\r\n\tfor (auto i = plain.size(); i % key.size() != 0; i++)\r\n\t{\r\n\t\tplain.push_back('x');//通过判断在明文数组后面补齐x\r\n\t}\r\n\tcout << endl;\r\n\tfor (auto i = 0; i < plain.size(); i++)//输出列宽为密钥长度的矩阵\r\n\t{\r\n\t\tcout << plain[i];\r\n\t\tif (i % key.size() == key.size()-1)\r\n\t\t{\r\n\t\t\tcout << \""\\n\"";\r\n\t\t}\r\n\t}\r\n\tcout << \""\\n\\n\"";\r\n\tcout << \""排序后:\\n\"";\r\n\tfor (auto i = 0; i < key.size() - 1; i++)\r\n\t{\r\n\t\tfor (auto j = 1; j < key.size() - 1; j++)\r\n\t\t{\r\n\t\t\tif ((int)key[j]>(int)key[j + 1])//使用冒泡排序通过对比密钥对应的asc码进行从小到大排序\r\n\t\t\t{\r\n\t\t\t\tswap(key[j], key[j + 1]);//将明文通过此排序可得排序后的明文\r\n\t\t\t\tfor (auto k = 0; k <= l; k++)\r\n\t\t\t\t{\r\n\t\t\t\t\tswap(plain[j + k*key.size()], plain[j + 1 + k*key.size()]);\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tfor (auto i = 0; i < plain.size(); i++) //输出列宽为密钥长度的矩阵\r\n\t{\r\n\t\tcout << plain[i];\r\n\t\tif (i % 8 == 7)\r\n\t\t{\r\n\t\t\tcout << \""\\n\"";\r\n\t\t}\r\n\t}\r\n\tcout << \""\\n\\n\"";\r\n\r\n\tif (flag==1){\r\n\tcout << \""加密后密文:\\n\"";\r\n\tfor (auto i = 0; i \r\n\r\nint main()\r\n{\r\n\tint F=0,m=0,n=0,flag=0;\r\n\tchar S[9999]=\""\"",K[20]=\""\"";\t\r\n\tscanf(\""%d\\n%s\\n%s\"",&F,S,K);\r\n\tn=strlen(K),m=strlen(S);\r\n\tif(m%n!=0) flag=1;\r\n\tint offset=m%n;\r\n\tm=(m+n-1)/n;\r\n\tchar s[m+1][n+1];\r\n\tfor(int i=0;i<=m;i++){\r\n\t\tfor(int j=0;j<=n;j++){\r\n\t\t\ts[i][j]='\\0';\r\n\t\t}\r\n\t}\r\n\tint min=0,step=0;\r\n\tif(F==0){\r\n\t\tfor(int i=0;i0):\r\n minnum=i \r\n del d[minnum] \r\n sort.append(zz[minnum]) \r\n del zz[minnum]\r\n for i in range(len(key)):\r\n s=''.join(sort[i])\r\n print(s,end='')\r\n\r\nif(start=='0'):\r\n for i in range(len(key)):\r\n d.append(key[i])\r\n for i in range(len(key)):\r\n mart.append([])\r\n for j in range(len(key)):\r\n mart[i].append(message[c])\r\n c=c+1\r\n sort=[[None]*len(key) for p in range(len(key))]\r\n for k in range(len(key)):\r\n minnum=0\r\n for i in range(len(d)):\r\n if(ord(d[minnum])-ord(d[i])>0):\r\n minnum=i \r\n d[minnum]='~'\r\n sort[minnum]=jz[k]\r\n for i in range(len(key)):\r\n zz.append([])\r\n for j in range(len(key)):\r\n zz[i].append(sort[j][i])\r\n for i in range(len(key)):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n\r\n",PARTIAL_ACCEPTED,101,3216 1186266847136149504,577060d7056d89723f6df2b13e7a675e13c8ea414a6522bd3ef5956ad6de41f9,2019-10-21 21:03:50,Java,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n\tpublic static void main(String[] args)throws IOException {\r\n\t\tScanner in=new Scanner(System.in);\r\n\t\tint f=in.nextInt();\r\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\r\n\t\tString s=br.readLine();\r\n\t\tString k=br.readLine();\r\n\t\tif(f==0){\r\n\t\t\tDecryption De=new Decryption(s,k);\r\n\t\t}else if(f==1) {\r\n\t\t\tEncryption En=new Encryption(s,k);\r\n\t\t\t\r\n\t\t}else {\r\n\t\t\tSystem.out.println(\""Input error\"");\r\n\t\t}\r\n\t}\r\n}\r\n//加密\r\nclass Encryption{\r\n\tprivate String x,y;\r\n\tprivate int t,l,h;\r\n\tpublic Encryption(String a,String b){\r\n\t\tx=a;\r\n\t\ty=b;\r\n\t\tt=x.length();\r\n\t\tl=y.length();\r\n\t\th=(t%l==0)? t/l:t/l+1;\r\n\t\t//将明文存入数组\r\n\t\tchar[][] xArr=new char[h][l];\r\n\t\tfor(int i=0;i0):\r\n minnum=i \r\n del d[minnum] \r\n sort.append(zz[minnum]) \r\n del zz[minnum]\r\n for i in range(len(key)):\r\n s=''.join(sort[i])\r\n print(s,end='')\r\n\r\nif(start=='0'):\r\n for i in range(len(key)):\r\n d.append(key[i])\r\n for i in range(len(key)):\r\n mart.append([])\r\n for j in range(len(key)):\r\n mart[i].append(message[c])\r\n c=c+1\r\n sort=[[None]*len(key) for p in range(len(key))]\r\n for k in range(len(key)):\r\n minnum=0\r\n for i in range(len(d)):\r\n if(ord(d[minnum])-ord(d[i])>0):\r\n minnum=i \r\n d[minnum]='~'\r\n sort[minnum]=mart[k]\r\n for i in range(len(key)):\r\n zz.append([])\r\n for j in range(len(key)):\r\n zz[i].append(sort[j][i])\r\n for i in range(len(key)):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n\r\n",PARTIAL_ACCEPTED,92,3112 1186267019878559744,f85ea0d2a676802f56925511990b9da9d3c0fdf3f3d8a9695ef53425b553839f,2019-10-21 21:04:31,Python,12.0,1178501854420291584,1176480157125808128,1041335062471446528,"start=input()\r\nmessage=[]\r\nmessage=input()\r\nkey=[]\r\nkey=input()\r\nmart=[]\r\nzz=[]\r\nc=0\r\nd=[]\r\n\r\nif (start=='1'):\r\n for i in range(len(key)):\r\n d.append(key[i])\r\n\r\n for i in range(len(key)):\r\n mart.append([])\r\n for j in range(len(key)):\r\n mart[i].append(message[c])\r\n c=c+1\r\n\r\n for i in range(len(key)):\r\n zz.append([])\r\n for j in range(len(key)):\r\n zz[i].append(mart[j][i])\r\n sort=[]\r\n for k in range(len(key)):\r\n minnum=0\r\n for i in range(len(d)):\r\n if(ord(d[minnum])-ord(d[i])>0):\r\n minnum=i \r\n del d[minnum] \r\n sort.append(zz[minnum]) \r\n del zz[minnum]\r\n for i in range(len(key)):\r\n s=''.join(sort[i])\r\n print(s,end='')\r\n\r\nif(start=='0'):\r\n for i in range(len(key)):\r\n d.append(key[i])\r\n for i in range(len(key)):\r\n mart.append([])\r\n for j in range(len(key)):\r\n mart[i].append(message[c])\r\n c=c+1\r\n sort=[[None]*len(key) for p in range(len(key))]\r\n for k in range(len(key)):\r\n minnum=0\r\n for i in range(len(d)):\r\n if(ord(d[minnum])-ord(d[i])>0):\r\n minnum=i \r\n d[minnum]='~'\r\n sort[minnum]=mart[k]\r\n for i in range(len(key)):\r\n zz.append([])\r\n for j in range(len(key)):\r\n zz[i].append(sort[j][i])\r\n for i in range(len(key)):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n\r\n",PARTIAL_ACCEPTED,82,3280 1186268044995817472,640c2acd4ee1b19fab2ce081c0b6fa779e0ea5a171eb8cb1850926bd8cf19869,2019-10-21 21:08:35,C++,0.0,1178501854420291584,1176480157125808128,1041335062471446528,"#include\""stdio.h\""\r\n#include \r\n\r\nint main()\r\n{\r\n\tint F=0,m=0,n=0,flag=0;\r\n\tchar S[9999]=\""\"",K[20]=\""\"";\t\r\n\tscanf(\""%d\\n%s\\n%s\"",&F,S,K);\r\n\tn=strlen(K),m=strlen(S);\r\n\tint offset=m%n;\r\n\tif(m%n!=0) flag=1;\r\n\telse offset=n;\r\n\tm=(m+n-1)/n;\r\n\tchar s[m+1][n+1];\r\n\tfor(int i=0;i<=m;i++){\r\n\t\tfor(int j=0;j<=n;j++){\r\n\t\t\ts[i][j]='\\0';\r\n\t\t}\r\n\t}\r\n\tint min=0,step=0;\r\n\tif(F==0){\r\n\t\tfor(int i=0;i\r\n\r\nint main()\r\n{\r\n\tint F=0,m=0,n=0,flag=0;\r\n\tchar S[9999]=\""\"",K[20]=\""\"";\t\r\n\tscanf(\""%d\\n%s\\n%s\"",&F,S,K);\r\n\tn=strlen(K),m=strlen(S);\r\n\tint offset=m%n;\r\n\tif(m%n!=0) flag=1;\r\n\telse offset=n;\r\n\tm=(m+n-1)/n;\r\n\tchar s[m+1][n+1];\r\n\tfor(int i=0;i<=m;i++){\r\n\t\tfor(int j=0;j<=n;j++){\r\n\t\t\ts[i][j]='\\0';\r\n\t\t}\r\n\t}\r\n\tint min=0,step=0;\r\n\tif(F==0){\r\n\t\tfor(int i=0;i\r\nint main(){\r\n\tint mode=-1;\r\n\tscanf(\""%d\\n\"",&mode);\r\n\tchar a[100000]={}; \r\n\tint i=-1;\r\n\tdo{\r\n\t\ti++;\r\n\t\tscanf(\""%c\"",&a[i]);\r\n\t//\tprintf(\""%c\"",a[i]);\r\n\t}while(a[i]>=65&&a[i]<=90);\r\n\t/*从a[0]开始依次读入明文，总个数即为i*/ \r\n//\tprintf(\""%c\"",a[0]);\r\n\t\r\n\t\t\r\n\tint code[28]={};\r\n\t\tchar c;\r\n\t\tint j=1;\r\n\t\twhile(1){\r\n\t\t\tscanf(\""%c\"",&c);\r\n\t\t\tif(c<65||c>90)break; \r\n\t\t//\tprintf(\""%c \"",c);\r\n\t\t\tint C=(int)c;\r\n\t\t\tcode[C-64]=j;/*第c-64个字母是第j个出现的*/ \r\n\t\t//\tprintf(\""code[%d]=%d \"",C-64,code[C-64]);\r\n\t\t//\tprintf(\""j=%d\"",j);\r\n\t\t\tj++;\r\n\t\t\t\r\n\t\t//\tc=0;\r\n\t\t}\r\n\t\tj--;\r\n if(i%j==0){\r\n i/=j;\r\n }else{\r\n int add=j-i%j;\r\n if(mode==1){\r\n \tint g=0;\r\n \t for(g=0;g=1){\r\n\t\t\t\ts[n]=code[m];/*排序为第n的字母是第s[n]个出现的*/ \r\n\t\t//\t\tprintf(\""s[%d]=%d\\n\\n\\n\\n\"",n,s[n]);\r\n\t\t\t\tn++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tint t=0;\r\n\t\tfor(t=0;t\r\nint main(){\r\n\tint mode=-1;\r\n\tscanf(\""%d\\n\"",&mode);\r\n\tchar a[100000]={}; \r\n\tint i=-1;\r\n\tdo{\r\n\t\ti++;\r\n\t\tscanf(\""%c\"",&a[i]);\r\n\t//\tprintf(\""%c\"",a[i]);\r\n\t}while(a[i]>=65&&a[i]<=90);\r\n\t/*从a[0]开始依次读入明文，总个数即为i*/ \r\n//\tprintf(\""%c\"",a[0]);\r\n\t\r\n\t\t\r\n\tint code[28]={};\r\n\t\tchar c;\r\n\t\tint j=1;\r\n\t\twhile(1){\r\n\t\t\tscanf(\""%c\"",&c);\r\n\t\t\tif(c<65||c>90)break; \r\n\t\t//\tprintf(\""%c \"",c);\r\n\t\t\tint C=(int)c;\r\n\t\t\tcode[C-64]=j;/*第c-64个字母是第j个出现的*/ \r\n\t\t//\tprintf(\""code[%d]=%d \"",C-64,code[C-64]);\r\n\t\t//\tprintf(\""j=%d\"",j);\r\n\t\t\tj++;\r\n\t\t\tif(j>i)break;\r\n\t\t//\tc=0;\r\n\t\t}\r\n\t\tj--;\r\n if(i%j==0){\r\n i/=j;\r\n }else{\r\n int add=j-i%j;\r\n if(mode==1){\r\n \tint g=0;\r\n \t for(g=0;g=1){\r\n\t\t\t\ts[n]=code[m];/*排序为第n的字母是第s[n]个出现的*/ \r\n\t\t//\t\tprintf(\""s[%d]=%d\\n\\n\\n\\n\"",n,s[n]);\r\n\t\t\t\tn++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tint t=0;\r\n\t\tfor(t=0;t0):\r\n minnum=i \r\n del d[minnum] \r\n sort.append(zz[minnum]) \r\n del zz[minnum]\r\n for i in range(len(key)):\r\n s=''.join(sort[i])\r\n print(s,end='')\r\n\r\nif(start=='0'):\r\n for i in range(len(key)):\r\n d.append(key[i])\r\n for i in range(len(key)):\r\n mart.append([])\r\n for j in range(len(key)):\r\n mart[i].append(message[c])\r\n c=c+1\r\n sort=[[None]*len(key) for p in range(len(key))]\r\n for k in range(len(key)):\r\n minnum=0\r\n for i in range(len(d)):\r\n if(ord(d[minnum])-ord(d[i])>0):\r\n minnum=i \r\n d[minnum]='~'\r\n sort[minnum]=mart[k]\r\n for i in range(len(key)):\r\n zz.append([])\r\n for j in range(len(key)):\r\n zz[i].append(sort[j][i])\r\n for i in range(len(key)):\r\n s=''.join(zz[i])\r\n print(s,end='')\r\n\r\n",PARTIAL_ACCEPTED,84,3200 1586747779569291264,0d86ba6f244c12fb5c6769aa96c352f77f9f7fd81f9f4b78d15fd110ab117ccc,2022-10-30 23:52:05,C,100.0,1586658024117264387,1586651508261810176,1477803860767604736,"#include \n#include \n\n\nint main(){\nchar type_pointer[1000000]={'0'};\nint type_pointer_pointer=0;\nint column_flag=0;\nchar inp[200];\nprintf(\""{\"");\nfor(;;){\nscanf(\""%s\"",inp);\nif(strlen(inp)==1){\n\n\nif(inp[0]=='0'){\ncolumn_flag=0;\nswitch(type_pointer[type_pointer_pointer]){\ncase '2':\nprintf(\""]\"");\ncolumn_flag=1;\nbreak;\ncase '3':\nprintf(\""}\"");\ncolumn_flag=1;\nbreak;\n}\ntype_pointer_pointer--;\nif(type_pointer_pointer<0){\nprintf(\""}\"");\nbreak;\n}\ncontinue;\n}\nif(column_flag==1){\nprintf(\"",\"");\ncolumn_flag=0;\n}\n\nif(inp[0]=='2'||inp[0]=='3'){\ntype_pointer_pointer++;\ntype_pointer[type_pointer_pointer]=inp[0];\nif(type_pointer[type_pointer_pointer-1]!='2'){\nscanf(\""%s\"",inp);\nprintf(\""\\\""%s\\\"":\"",inp);\n}\nswitch(type_pointer[type_pointer_pointer]){\ncase '2':\nprintf(\""[\"");\nbreak;\ncase '3':\nprintf(\""{\"");\nbreak;\n}\ncolumn_flag=0;\ncontinue;\n}\n\nif(inp[0]=='1'){\nif(type_pointer[type_pointer_pointer]!='2'){\nscanf(\""%s\"",inp);\nprintf(\""\\\""%s\\\"":\"",inp);\n}\nscanf(\""%s\"",inp);\nprintf(\""\\\""%s\\\""\"",inp);\ncolumn_flag=1;\n}\n}else{\nprintf(\""error: unexpected input found while processing input.\"");\nreturn -1;\n}\n}\nreturn 0;\n}\n\n/*\n-----test point 1-----\ninput:\n1 a 1 1 b 12345 2 c 1 1 1 2 1 3 1 4 1 5 0 2 d 3 1 a 1 1 b 2 0 3 1 c 4 1 d 5 0 0 0\nexpect:\n{\""a\"":\""1\"",\""b\"":\""12345\"",\""c\"":[\""1\"",\""2\"",\""3\"",\""4\"",\""5\""],\""d\"":[{\""a\"":\""1\"",\""b\"":\""2\""},{\""c\"":\""4\"",\""d\"":\""5\""}]}\n-----test point 2-----\ninput:\n2 d 3 1 a 1 1 b 2 0 3 1 c 4 0 0 0\nexpect:\n{\""d\"":[{\""a\"":\""1\"",\""b\"":\""2\""},{\""c\"":\""4\""}]}\n*/",ACCEPTED,17,1216 1586885158846197760,ecaf2d6cefabad56f9a29ba7774af9dd2b912c1656f7b88876aa4556a1b64cab,2022-10-31 08:57:59,C#,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\n// ReSharper disable once CheckNamespace\n\npublic static class Program\n{\n private static readonly Stack Stack = new Stack();\n public static void Main()\n {\n Stack.Push('}');\n var ans = new StringBuilder();\n ans.Append('{');\n while (Stack.Count != 0)\n {\n var input = Console.ReadLine()?.Split();\n switch (input?[0])\n {\n case \""1\"":\n switch (input.Length)\n {\n case 2:\n ans.Append($\""\\\""{input[1]}\\\"",\"");\n break;\n default:\n ans.Append($\""\\\""{input[1]}\\\"":\\\""{input[2]}\\\"",\"");\n break;\n }\n break;\n case \""2\"":\n Stack.Push(']');\n ans.Append($\""\\\""{input[1]}\\\"":[\"");\n break;\n case \""3\"":\n Stack.Push('}');\n ans.Append(\""{\"");\n break;\n case \""0\"":\n if (ans[ans.Length - 1] == ',')\n {\n ans.Remove(ans.Length - 1, 1);\n }\n ans.Append(Stack.Pop());\n ans.Append(',');\n break;\n }\n }\n ans.Remove(ans.Length - 1, 1);\n Console.WriteLine(ans);\n\n }\n}\n\n",PARTIAL_ACCEPTED,92,3968 1586891487342104576,ecaf2d6cefabad56f9a29ba7774af9dd2b912c1656f7b88876aa4556a1b64cab,2022-10-31 09:23:08,C#,100.0,1586658024117264387,1586651508261810176,1477803860767604736,"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\n// ReSharper disable once CheckNamespace\n\npublic static class Program\n{\n private static readonly Stack Stack = new Stack();\n public static void Main()\n {\n\n Stack.Push('}');\n var ans = new StringBuilder();\n ans.Append('{');\n var flag = 0;\n while (Stack.Count != 0)\n {\n var input = Console.ReadLine()?.Trim().Split();\n switch (input?[0])\n {\n case \""1\"":\n if (input.Length == 3)\n {\n ans.Append($\""\\\""{input[1]}\\\"":\\\""{input[2]}\\\"",\"");\n }\n else\n {\n ans.Append($\""\\\""{input[1]}\\\"",\"");\n }\n break;\n case \""2\"":\n if (input.Length == 2)\n {\n Stack.Push(']');\n ans.Append($\""\\\""{input[1]}\\\"":[\"");\n }\n else\n {\n flag = 1;\n }\n break;\n case \""3\"":\n if (input.Length == 1)\n {\n Stack.Push('}');\n ans.Append(\""{\"");\n }\n else\n {\n ans.Append($\""\\\""{input[1]}\\\"":\""+\""{\"");\n Stack.Push('}');\n }\n break;\n case \""0\"":\n if (ans[ans.Length - 1] == ',')\n {\n ans.Remove(ans.Length - 1, 1);\n }\n ans.Append(Stack.Pop());\n ans.Append(',');\n break;\n default:\n switch (flag)\n {\n case 1:\n Stack.Push(']');\n ans.Append($\""\\\""{input?[0]}\\\"":[\"");\n break;\n }\n break;\n }\n }\n ans.Remove(ans.Length - 1, 1);\n Console.WriteLine(ans);\n\n }\n}\n",ACCEPTED,85,3888 1588487878303330304,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 19:06:37,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"d={}\ndef one(x,y):\n d[x]=y\n\ndef two(q):\n s=input().split()\n lis=[]\n while int(s[0])!=0:\n if int(s[0])==3:\n lis.append(three)\n continue\n \n lis.append(s[1])\n s=input().split()\n print(lis)\n d[q]=lis\n \ndef three():\n dian={}\n s=input().split()\n while int(s[0])!=0:\n dian[s[1]]=s[2]\n s=input().split()\n return dian\n\n\ncount = 0\n\nwhile True:\n l=input()\n s=l.split()\n \n if int(s[0])==0:\n count+=1\n else:\n count=0\n if count==2:\n break;#连续读入两次0证明输入结束\n \n if int(s[0])==2:\n two(s[1])\n elif int(s[0])==1:\n one(s[1],s[2])\n \n\n\nprint(s)",MULTIPLE_ERROR,69,3064 1588488469754744832,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 19:08:58,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"d={}\ndef one(x,y):\n d[x]=y\n\ndef two(q):\n s=input().split()\n lis=[]\n while int(s[0])!=0:\n if int(s[0])==3:\n pass\n #lis.append(three)\n else:\n lis.append(s[1])\n s=input().split()\n print(lis)\n d[q]=lis\n \ndef three():\n dian={}\n s=input().split()\n while int(s[0])!=0:\n dian[s[1]]=s[2]\n s=input().split()\n return dian\n\n\ncount = 0\n\nwhile True:\n l=input()\n s=l.split()\n \n if int(s[0])==0:\n count+=1\n else:\n count=0\n if count==2:\n break;#连续读入两次0证明输入结束\n \n if int(s[0])==2:\n two(s[1])\n elif int(s[0])==1:\n one(s[1],s[2])\n \n\n\nprint(s)",MULTIPLE_ERROR,74,3040 1588500067064000512,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 19:55:03,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\ncount = 0\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n\n if int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s)",PARTIAL_ACCEPTED,76,2980 1588500254490689536,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 19:55:48,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\ncount = 0\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n\n if int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,74,3036 1588500311931662336,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 19:56:01,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\ncount = 0\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n\n if int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,77,2996 1588500739297705984,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 19:57:43,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n\n if int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,70,2924 1588501167544532992,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 19:59:25,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n\n if int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,68,3004 1588502089116987392,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:03:05,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n if int(s[0]) == 3:\n three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,75,3028 1588503807250706432,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:09:55,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2])\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n if int(s[0]) == 3:\n three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,85,2960 1588503848489123840,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:10:05,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n if int(s[0]) == 3:\n three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,71,3144 1588505300875935744,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:15:51,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n# if int(s[0]) == 3:\n# three()\n# elif int(s[0]) == 2:\n# dian[s[1]] = two()\n# elif int(s[0]) == 1:\n# dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,76,3068 1588505336133255168,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:15:59,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,73,3068 1588505433373999104,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:16:22,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n# if int(s[0]) == 3:\n# three()\n# elif int(s[0]) == 2:\n# dian[s[1]] = two()\n# elif int(s[0]) == 1:\n# dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,79,3040 1588505608171622400,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:17:04,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n# elif int(s[0]) == 2:\n# lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n# if int(s[0]) == 3:\n# three()\n# elif int(s[0]) == 2:\n# dian[s[1]] = two()\n# elif int(s[0]) == 1:\n# dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,82,3200 1588505725981229056,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:17:32,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n# elif int(s[0]) == 2:\n# lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n dian[s[1]]=three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,71,3076 1588505770130477056,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:17:43,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n# elif int(s[0]) == 2:\n# lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\n\nwhile True:\n s = input().split()\n\n if int(s[0]) == 0:\n break # 当输入0时输入结束\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,74,3024 1588506368154337280,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:20:05,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"d = {}\n\n\ndef one(x, y):\n d[x] = y\n\n\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n# elif int(s[0]) == 2:\n# lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\ns = input().split()\nwhile int(s[0]) != 0:\n \n# if int(s[0]) == 0:\n# break # 当输入0时输入结束\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n one(s[1], s[2])\n s = input().split()\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,81,3040 1588506978631069696,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:22:31,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n# elif int(s[0]) == 2:\n# lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n \n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,95,3156 1588507088391835648,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:22:57,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n# elif int(s[0]) == 2:\n# lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n \n# if int(s[0]) == 3:\n# dian[s[1]] =three()\n# elif int(s[0]) == 2:\n# dian[s[1]] = two()\n# elif int(s[0]) == 1:\n# dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,62,3056 1588507263696965632,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:23:39,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n s = input().split()\n lis = []\n\n while int(s[0]) != 0:\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n while int(s[0]) != 0:\n \n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n \n dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,73,3072 1588508025135104000,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:26:40,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n \n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n \n #dian[s[1]] = s[2]\n s = input().split()\n return dian\n\n\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,87,3084 1588508414848864256,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:28:13,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n \n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n#主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,79,3204 1588508551516061696,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:28:46,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n#主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,75,3252 1588509904002940928,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:34:08,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n#主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,72,3044 1588510751294271488,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:37:30,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n#主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,73,3024 1588510933067042816,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:38:14,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\ntry:\n #主程序\n d = {}\n s = input().split()\n while int(s[0]) != 0:\n\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n\n s = input().split()\nexcept:\n pass\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,83,3196 1588511004546347008,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:38:31,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\ntry:\n #主程序\n d = {}\n s = input().split()\n while int(s[0]) != 0:\n\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,74,3292 1588511121747783680,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:38:59,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\n d = {}\n s = input().split()\n while int(s[0]) != 0:\n try:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n except:\n pass\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,73,2900 1588511205445140480,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:39:19,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n try:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n except:\n pass\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,76,3036 1588511292028162048,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:39:39,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n try:\n d[s[1]] =three()\n except:\n pass\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,78,2996 1588511348005339136,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:39:53,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n try:\n d[s[1]] =three()\n except:\n pass\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,67,3220 1588511411892977664,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:40:08,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n \n d[s[1]] =three()\n \n elif int(s[0]) == 2:\n try:\n d[s[1]] = two()\n except:\n pass\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,82,3200 1588511485008089088,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:40:25,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n \n d[s[1]] =three()\n \n elif int(s[0]) == 2:\n \n d[s[1]] = two()\n \n elif int(s[0]) == 1:\n try:\n d[s[1]] = s[2]\n except:\n pass\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,89,3040 1588511574984273920,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:40:47,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n try:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n except:\n pass\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,78,3040 1588511854366887936,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:41:53,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n try:\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n except:\n pass\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,63,2932 1588511902731407360,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:42:05,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n try:\n \n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n except:\n pass\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,71,3016 1588512007224078336,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:42:30,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n try:\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n except:\n pass\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,64,3200 1588512375228137472,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:43:58,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #try:\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n# except:\n# pass\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,76,3012 1588512491318063104,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:44:25,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #try:\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n# except:\n# pass\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,71,2920 1588512718422847488,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:45:19,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n try:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n except:\n pass\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,72,3200 1588512785963724800,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:45:35,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n#\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,68,3016 1588512854339289088,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:45:52,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,75,3144 1588513035508060160,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:46:35,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n try:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n except:\n pass\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,62,3040 1588513083184689152,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:46:46,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n try:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n except:\n pass\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,72,3096 1588513248473821184,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:47:26,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n try:\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n except:\n pass\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,74,3100 1588513388135780352,d139f0770682a1aba98891b9912d29a6d748f57683c755ee3d3ab64377b46f00,2022-11-04 20:47:59,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n \n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n#主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,73,3268 1588513450614128640,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:48:14,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n try:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n except:\n pass\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,75,3064 1588513545648668672,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:48:37,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,69,3016 1588513593648283648,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:48:48,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n #d[s[1]] =three()\n elif int(s[0]) == 2:\n #d[s[1]] = two()\n elif int(s[0]) == 1:\n #d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,73,3196 1588513711386591232,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:49:16,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n pass\n #d[s[1]] =three()\n elif int(s[0]) == 2:\n pass\n #d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,72,3052 1588513797155893248,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:49:37,Python,30.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n# if int(s[0]) == 3:\n# pass\n# #d[s[1]] =three()\n# elif int(s[0]) == 2:\n# pass\n# #d[s[1]] = two()\n# elif int(s[0]) == 1:\n# d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,71,3040 1588513872758222848,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:49:55,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n pass\n #d[s[1]] =three()\n elif int(s[0]) == 2:\n pass\n #d[s[1]] = two()\n elif int(s[0]) == 1:\n pass\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,71,3200 1588514031030304768,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:50:32,Python,30.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n print(s[0])\n# if int(s[0]) == 3:\n# pass\n# #d[s[1]] =three()\n# elif int(s[0]) == 2:\n# pass\n# #d[s[1]] = two()\n# elif int(s[0]) == 1:\n# pass\n# d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,67,2912 1588514145320873984,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:51:00,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n# if int(s[0]) == 3:\n# pass\n# #d[s[1]] =three()\n# elif int(s[0]) == 2:\n# pass\n# #d[s[1]] = two()\n# el\n if int(s[0]) == 1:\n pass\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,69,3200 1588514233908793344,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:51:21,Python,30.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n# if int(s[0]) == 3:\n# pass\n# #d[s[1]] =three()\n# elif int(s[0]) == 2:\n# pass\n# #d[s[1]] = two()\n# el\n if s[0] == 1:\n pass\n #d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,66,2904 1588514316876296192,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:51:40,Python,30.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n# if int(s[0]) == 3:\n# pass\n# #d[s[1]] =three()\n# elif int(s[0]) == 2:\n# pass\n# #d[s[1]] = two()\n# el\n if s[0] == '1':\n pass\n #d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,70,3004 1588514367010832384,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:51:52,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n# if int(s[0]) == 3:\n# pass\n# #d[s[1]] =three()\n# elif int(s[0]) == 2:\n# pass\n# #d[s[1]] = two()\n# el\n if s[0] == '1':\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,65,3072 1588515376089075712,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:55:53,Python,30.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n pass\n #d[s[1]] =three()\n elif int(s[0]) == 2:\n pass\n #d[s[1]] = two()\n elif int(s[0]) == 1:\n pass\n #d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,71,3100 1588515432343076864,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:56:06,Python,50.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n pass\n #d[s[1]] =three()\n elif int(s[0]) == 2:\n pass\n #d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,72,3024 1588515919566012416,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 20:58:03,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n #主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,72,2952 1588519286845542400,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 21:11:25,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n#主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,79,3068 1588520934678532096,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 21:17:58,Python,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n#主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n s = input().split()\n\n\n#对应格式输出\ns=str(three()).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",NON_ZERO_EXIT_CODE,62,3016 1588521804749144064,abb15421bcf0cca1dc3be0f4bfd0389bcce9448ed5411c8519aeaa60b9887b58,2022-11-04 21:21:26,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n elif int(s[0]) == 1:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n#主程序\n# d = {}\n# s = input().split()\n# while int(s[0]) != 0:\n# if int(s[0]) == 3:\n# d[s[1]] =three()\n# elif int(s[0]) == 2:\n# d[s[1]] = two()\n# elif int(s[0]) == 1:\n# d[s[1]] = s[2]\n# s = input().split()\n\n\n#对应格式输出\ns=str(three()).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,65,3016 1588524671019036672,d139f0770682a1aba98891b9912d29a6d748f57683c755ee3d3ab64377b46f00,2022-11-04 21:32:49,Python,80.0,1586658024117264387,1586651508261810176,1477803860767604736,"#数字二插入数组\ndef two():\n lis = []\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #数组三种情况\n if int(s[0]) == 3:\n lis.append(three())\n elif int(s[0]) == 2:\n lis.append(two())\n else:\n lis.append(s[1])\n #循环输入\n s = input().split()\n\n return lis\n\n#数字三插入对象\ndef three():\n \n dian = {}\n s = input().split()\n #循环判断每次输入的情况可能会有递归嵌套\n while int(s[0]) != 0:\n #对象三种情况\n if int(s[0]) == 3:\n dian[s[1]] =three()\n elif int(s[0]) == 2:\n dian[s[1]] = two()\n elif int(s[0]) == 1:\n dian[s[1]] = s[2]\n #循环输入\n s = input().split()\n return dian\n\n#主程序\nd = {}\ns = input().split()\nwhile int(s[0]) != 0:\n \n if int(s[0]) == 3:\n d[s[1]] =three()\n elif int(s[0]) == 2:\n d[s[1]] = two()\n elif int(s[0]) == 1:\n d[s[1]] = s[2]\n \n s = input().split()\n\n\n#对应格式输出\ns=str(d).replace('\\'','\\\""')\ns=s.replace(' ','')\nprint(s,end='')",PARTIAL_ACCEPTED,66,3044 1589242589432315904,1d1ae26abc92be57059952909a8e5712cc9cea7e806ed9797335bda0986fa99e,2022-11-06 21:05:34,Java,0.0,1586658024117264387,1586651508261810176,1477803860767604736,"import java.util.Scanner;\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner(System.in);\n \n System.out.print(\""{\"");\n while(true){\n String s= in.nextLine();\n String s1[]=s.split(\"" \"");\n if(s[0]==\""1\"") System.out.print(\""\\\""\""+s[1]+\""\\\""\""+\"":\""+s[2]+\"",\"");\n else if(s[0]=='2'){\n ArrayList a=new ArrayList();\n while(true){\n String ss=in.nextLine();\n int n=ss.length();\n if(ss.charAt(0)=='0') break;\n a.add(ss.substring(2,n-1));\n }\n System.out.print(\""\\\""\""+s[1]+\""\\\""\""+\"":\""+a.toString()+\"",\"");\n }\n }\n }\n}\n",COMPILE_ERROR,0,0 1576116318000128000,85727183763e279f64ac339ac4dc16c3d3734693be3c4fd11e477f2945669430,2022-10-01 15:46:27,C++,300.0,1574379556260130818,1573926987649982464,1041334779855040512,"#include\nusing namespace std;\nint n,m;\nvoid dfs(int u,int sum,int state)\n{ //u变量记录总的递归次数\n//sum记录有效的递归次数，即状态压缩中置1的个数\n//state是记录状态压缩的变量\n if(sum==m)\n { //当有效的置1的个数到达题目要求时，输出并结束递归\n for(int i=0;i>i&1)\n cout<>n>>m;\n\tdfs(0,0,0);\n\treturn 0;\n}\n",ACCEPTED,259,1092 1578732442386710528,9b55b3ba87b4f0e49580da36383f9c614fd241aee487c00bf474436f4dce843d,2022-10-08 21:02:00,C++,300.0,1574379556260130818,1573926987649982464,1041334779855040512,"#include\nusing namespace std;\nint n,m;\nvoid dfs(int u,int sum,int state)\n{ //u变量记录总的递归次数\n//sum记录有效的递归次数，即状态压缩中置1的个数\n//state是记录状态压缩的变量\n if(sum==m)\n { //当有效的置1的个数到达题目要求时，输出并结束递归\n for(int i=0;i>i&1)\n cout<>n>>m;\n dfs(0,0,0);\n return 0;\n}",ACCEPTED,241,956 1374723749009428480,6e803aaa6c40eb4f526104463901eb8969be34260386c4b247a456dbd08ed85f,2021-03-24 22:04:17,C++,300.0,1374655780489375752,1106090088947060736,1041335204213755904,"#include \n#include \n#include \n#include \nusing namespace std;\nchar map[35][35][35];\nint dir[6][3] = { { 0, 1, 0 }, { 0, 0, 1 }, { 0, -1, 0 }, { 0, 0, -1 }, { -1, 0, 0 }, { 1, 0, 0 } };\ntypedef struct{\n int l, r, c, step;\n}Node, *PNode;\nint visited[35][35][35]; \nqueue Q;\nNode e, curr;\nint bfs(Node node)\n{\n while (!Q.empty()) Q.pop();\n Q.push(node);\n while (!Q.empty())\n {\n e = Q.front();\n Q.pop();\n visited[e.l][e.r][e.c] = 1;\n for (int i = 0; i < 6; i++)\n {\n int l, r, c;\n l = e.l + dir[i][0], r = e.r + dir[i][1], c = e.c + dir[i][2];\n if (!visited[l][r][c] && map[l][r][c] != '#' && map[l][r][c] != 0)\n {\n curr = { l, r, c, e.step + 1 };\n if (map[curr.l][curr.r][curr.c] == 'E')\n {\n return curr.step;\n }\n visited[curr.l][curr.r][curr.c] = 1; \n Q.push(curr);\n }\n }\n }\n return -1;\n}\nint main()\n{\n int L, R, C;\n Node start;\n while (cin >> L >> R >> C && (L + R + C))\n {\n memset(map, 0, sizeof(map)), memset(visited,0,sizeof(visited));\n for (int i = 1; i <= L; i++)\n {\n for (int j = 1; j <= R; j++)\n {\n for (int k = 1; k <= C; k++)\n {\n cin >> map[i][j][k];\n if (map[i][j][k] == 'S')\n start.l = i, start.r = j, start.c = k, start.step = 0;\n }\n }\n }\n int ret = bfs(start);\n if (ret == -1)\n cout << \""No dress to appreciate!\"" << endl;\n else\n cout << ret << endl;\n }\n return 0;\n}",ACCEPTED,96,608 1374724051838275584,0b3240212a18e9b57cb53e23f501d05a68ae6538f381bef446a227b94efbf596,2021-03-24 22:05:29,C++,300.0,1374655780489375752,1106090088947060736,1041335204213755904,"#include \n#include \n\nusing namespace std;\n\nconst int N = 40;\nint l, r, c;\nint dist[N][N][N];\nchar g[N][N][N];\n\nint dx[] = {0, 0, 0, 0, 1, -1};\nint dy[] = {0, 0, -1, 1, 0, 0};\nint dz[] = {1, -1, 0, 0, 0, 0};\nint sx, sy, sz, ex, ey, ez;\n\nstruct cube\n{\n int x;\n int y;\n int z;\n};\n\nvoid bfs()\n{\n for (int i = 1; i <= l; i++)\n for (int j = 1; j <= r; j++)\n for (int k = 1; k <= c; k++)\n {\n if (g[i][j][k] == 'S')\n sx = j, sy = k, sz = i;\n else if (g[i][j][k] == 'E')\n ex = j, ey = k, ez = i;\n }\n memset(dist, -1, sizeof dist);\n dist[sz][sx][sy] = 0;\n int hh = 0, tt = -1;\n cube q[N * N * N];\n q[++tt] = {sx, sy, sz};\n while (hh <= tt)\n {\n auto now = q[hh++];\n int dis = dist[now.z][now.x][now.y];\n for (int i = 0; i < 6; i++)\n {\n int aa = now.x + dx[i], bb = now.y + dy[i], cc = now.z + dz[i];\n if (aa < 1 || bb < 1 || cc < 1 || aa > r || bb > c || cc > l) continue;\n if (dist[cc][aa][bb] != -1) continue;\n if (g[cc][aa][bb] == '#') continue;\n q[++tt] = {aa, bb, cc};\n dist[cc][aa][bb] = dis + 1;\n }\n }\n}\n\nint main()\n{\n while (cin >> l >> r >> c, l && r && c)\n {\n for (int i = 1; i <= l; i++)\n {\n for (int j = 1; j <= r; j++)\n scanf(\""%s\"", g[i][j] + 1);\n }\n bfs();\n if (dist[ez][ex][ey] != -1)\n cout << dist[ez][ex][ey] << endl;\n else\n cout << \""No dress to appreciate!\"" << endl;\n }\n\n return 0;\n}\n",ACCEPTED,33,724 1374724934005166080,828b82158abb0cb7fd563bfcf1dd5ce219315418291c331e2574cfe818abb09d,2021-03-24 22:09:00,C++,300.0,1374655780489375752,1106090088947060736,1041335204213755904,"#include\nusing namespace std;\nconst int maxn=33;\nstruct Node{\n\tint xx;\n\tint yy;\n\tint zz;\n};\nint T;\nint h,n,m;\nint mapp[maxn][maxn][maxn],dis[maxn][maxn][maxn];\nint dx[7]={0,0,0,0,0,1,-1};\nint dy[7]={0,0,0,-1,1,0,0};\nint dz[7]={0,1,-1,0,0,0,0};\nint main(){\n\twhile(1){\n\t\tcin>>h>>n>>m;\n\t\tif(h==0&&n==0&&m==0) \n\t\t\tbreak;\n\t\tchar c;\n\t\tmemset(mapp,0,sizeof(mapp));\n\t\tmemset(dis,-1,sizeof(dis));\n\t\tint sx=-1,sy=-1,sz=-1,ex=-1,ey=-1,ez=-1;\n\t\tfor(int k=1;k<=h;k++){\n\t\t\tfor(int i=1;i<=n;i++){\n\t\t\t\tfor(int j=1;j<=m;j++){\n\t\t\t\t\twhile(isspace(c=getchar())) \n\t\t\t\t\t\t;\n\t\t\t\t\tif(c=='S'){\n\t\t\t\t\t\tmapp[i][j][k]=2;\n\t\t\t\t\t\tsx=i,sy=j,sz=k;\n\t\t\t\t\t}\n\t\t\t\t\telse if(c=='E'){\n\t\t\t\t\t\tmapp[i][j][k]=3;\n\t\t\t\t\t\tex=i,ey=j,ez=k;\n\t\t\t\t\t}\n\t\t\t\t\telse if(c=='.') mapp[i][j][k]=1;\n\t\t\t\t\telse if(c=='#') mapp[i][j][k]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tqueue q;\n\t\tq.push(Node {sx,sy,sz});\n\t\tdis[sx][sy][sz]=0;\n\t\twhile(!q.empty()){\n\t\t\tNode f=q.front();\n\t\t\tq.pop();\n\t\t\tfor(int t=1;t<=6;t++)\n\t\t\t\tif(mapp[f.xx+dx[t]][f.yy+dy[t]][f.zz+dz[t]]&&dis[f.xx+dx[t]][f.yy+dy[t]][f.zz+dz[t]]==-1){\n\t\t\t\t\tdis[f.xx+dx[t]][f.yy+dy[t]][f.zz+dz[t]]=dis[f.xx][f.yy][f.zz]+1;\n\t\t\t\t\tq.push(Node {f.xx+dx[t],f.yy+dy[t],f.zz+dz[t]});\n\t\t\t\t}\t\n\t\t} \n\t\tif(dis[ex][ey][ez]==-1) cout<<\""No dress to appreciate!\""<\nusing namespace std;\nconst int N = 50;\n\nstruct dot{\n int x, y, z;\n};\nint dun[N][N][N];\nint l, r, c;\nint idx, ans;\nint dir[6][3] = {{0, 0, 1}, {0, 0, -1}, {0, 1, 0}, {0, -1, 0}, {1, 0, 0}, {-1, 0, 0}};\n\nvoid bfs(struct dot start);\n\nint main(){\n while(scanf(\""%d %d %d\"", &l, &r, &c) == 3){\n if(l == 0 || r == 0 || c == 0)\n return 0;\n idx = 0;\n struct dot start, end;\n for(int i = 1; i <= l; i++)\n for(int j = 1; j <= r; j++){\n string s;\n cin >> s;\n for(int x = 0; x <= c - 1; x++)\n if(s[x] == '.')\n dun[i][j][x] = 0;\n else if(s[x] == '#')\n dun[i][j][x] = -1;\n else if(s[x] == 'S'){\n start.x = i;\n start.y = j;\n start.z = x;\n dun[i][j][x] = 1;\n }\n else if(s[x] == 'E'){\n end.x = i;\n end.y = j;\n end.z = x;\n dun[i][j][x] = 0;\n }\n }\n // for(int x = 1; x <= c; x++){\n // char tem;\n // scanf(\""%c\"", tem);\n // if(tem == '\\n' || tem == ' ')\n // scanf(\""%c\"", tem);\n // if(tem == '.')\n // dun[i][j][x] = 0;\n // else if(tem == '#')\n // dun[i][j][x] = -1;\n // else if(tem == 'S'){\n // start.x = i;\n // start.y = j;\n // start.z = x;\n // dun[i][j][x] = 1;\n // }\n // else if(tem == 'E'){\n // end.x = i;\n // end.y = j;\n // end.z = x;\n // dun[i][j][x] = 0;\n // }\n // }\n bfs(start);\n int x = end.x, y = end.y, z = end.z;\n if(dun[x][y][z] == 0)\n printf(\""No dress to appreciate!\\n\"");\n else printf(\""%d\\n\"", dun[x][y][z] - 1);\n // if(ans == -1)\n // printf(\""No dress to appreciate!\\n\"");\n // else printf(\""%d\\n\"", idx);\n }\n return 0;\n}\n\nvoid bfs(struct dot start){\n int x = start.x, y = start.y, z = start.z;\n queue que;\n que.push(start);\n dun[x][y][z] = 1;\n while(!que.empty()){\n struct dot tem = que.front();\n que.pop();\n int x2 = tem.x, y2 = tem.y, z2 = tem.z;\n for(int i = 0; i < 6; i++){\n int x3 = tem.x + dir[i][0], y3 = tem.y + dir[i][1], z3 = tem.z + dir[i][2];\n if(x3 <= 0 || x3 > l || y3 <= 0 || y3 > r || z3 <= 0 || z3 > c)\n continue;\n if(dun[x3][y3][z3] == 0){\n dun[x3][y3][z3] = dun[x2][y2][z2] + 1;\n que.push({x3, y3, z3});\n }\n }\n }\n}",ACCEPTED,71,376 1375017781606625280,1288a17f6b4fe045f919092e78d2084792209300793fbd0932a84bafb88c8cad,2021-03-25 17:32:40,C++,0.0,1374655780489375752,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#define ll long long\nusing namespace std;\nint a[500],pos;\nint main(){\n int n,sum=0;\n cin>>n;\n while(n--){\n ll m;\n int id=0;\n scanf(\""%lld\"",&m);\n while(m){\n id+=m%10,m/=10;\n }\n if(!a[id])sum++;\n a[id]++;\n pos=max(pos,id);\n }\n cout<\nusing namespace std;\n\n#define MAXSIZE 40\n\nstruct node {\n\tint x;\n\tint y;\n\tint f;\n\tint step;\n};\n\nstruct dungeon {\n\tint book[MAXSIZE][MAXSIZE];\n\tchar maze[MAXSIZE][MAXSIZE];\n};\n\nint nexts[5][3] = { {0,1,0},{1,0,0},{0,-1,0},{-1,0,0},{0,0,1} };\n\nint main() {\n\tint l, r, c, sx, sy, sf, ex, ey, ef;\n\tint i, j, k, flag;\n\tint step = 0;\n\tnode tnode;\n\tqueue q;\n\tcin >> l >> r >> c;\n\twhile (l || r || c) {\n\t\tvector dg(l);\n\t\tflag = 0;\n\t\tfor (k = 0; k < l; k++) {\n\t\t\tfor (i = 1; i <= r; i++) {\n\t\t\t\tfor (j = 1; j <= c; j++) {\n\t\t\t\t\tcin >> dg[k].maze[i][j];\n\t\t\t\t\tif (dg[k].maze[i][j] == 'S') {\n\t\t\t\t\t\tsx = i;\n\t\t\t\t\t\tsy = j;\n\t\t\t\t\t\tsf = k;\n\t\t\t\t\t}\n\t\t\t\t\telse if (dg[k].maze[i][j] == 'E') {\n\t\t\t\t\t\tex = i;\n\t\t\t\t\t\tey = j;\n\t\t\t\t\t\tef = k;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tgetchar();\n\t\t}\n\t\ttnode.f = sf;\n\t\ttnode.x = sx;\n\t\ttnode.y = sy;\n\t\ttnode.step = 0;\n\t\tq.push(tnode);\n\t\tdg[sf].book[sf][sy] = 1;\n\t\twhile (!q.empty() && !flag) {\n\t\t\ttnode = q.front();\n\t\t\tnode tt;\n\t\t\tq.pop();\n\t\t\tfor (int i = 0; i < 5; i++) {\n\t\t\t\ttt.x = tnode.x + nexts[i][0];\n\t\t\t\ttt.y = tnode.y + nexts[i][1];\n\t\t\t\ttt.f = tnode.f + nexts[i][2];\n\t\t\t\ttt.step = tnode.step + 1;\n\t\t\t\tif (tt.x < 1 || tt.x > r || tt.y < 1 || tt.y > c || tt.f < 0 || tt.f > l - 1) continue;\n\t\t\t\tif (dg[tt.f].book[tt.x][tt.y] || dg[tt.f].maze[tt.x][tt.y] == '#') continue;\n\t\t\t\tq.push(tt);\n\t\t\t\tdg[tt.f].book[tt.x][tt.y] = 1;\n\t\t\t\tif (tt.x == ex && tt.y == ey && tt.f == ef) {\n\t\t\t\t\tcout << tt.step << endl;\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!flag) cout << \""No dress to appreciate!\"" << endl;\n\t\tcin >> l >> r >> c;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,89,452 1375063028277547008,4907ca476ea9ddd0391e7c3dada631ea134f3a9d73bc4f0a9ed95b559518d103,2021-03-25 20:32:28,C++,0.0,1374655780489375752,1106090088947060736,1041335204213755904,"#include\nusing namespace std;\n\n#define MAXSIZE 40\n\nstruct node {\n\tint x;\n\tint y;\n\tint f;\n\tint step;\n};\n\nstruct dungeon {\n\tint book[MAXSIZE][MAXSIZE];\n\tchar maze[MAXSIZE][MAXSIZE];\n};\n\nint nexts[5][3] = { {0,1,0},{1,0,0},{0,-1,0},{-1,0,0},{0,0,1} };\n\nint main() {\n\tint l, r, c, sx, sy, sf, ex, ey, ef;\n\tint i, j, k, flag;\n\tnode tnode;\n\tcin >> l >> r >> c;\n\twhile (l || r || c) {\n\t\tqueue q;\n\t\tvector dg(l);\n\t\tflag = 0;\n\t\tfor (k = 0; k < l; k++) {\n\t\t\tfor (i = 1; i <= r; i++) {\n\t\t\t\tfor (j = 1; j <= c; j++) {\n\t\t\t\t\tcin >> dg[k].maze[i][j];\n\t\t\t\t\tif (dg[k].maze[i][j] == 'S') {\n\t\t\t\t\t\tsx = i;\n\t\t\t\t\t\tsy = j;\n\t\t\t\t\t\tsf = k;\n\t\t\t\t\t}\n\t\t\t\t\telse if (dg[k].maze[i][j] == 'E') {\n\t\t\t\t\t\tex = i;\n\t\t\t\t\t\tey = j;\n\t\t\t\t\t\tef = k;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tgetchar();\n\t\t}\n\t\ttnode.f = sf;\n\t\ttnode.x = sx;\n\t\ttnode.y = sy;\n\t\ttnode.step = 0;\n\t\tq.push(tnode);\n\t\tdg[sf].book[sf][sy] = 1;\n\t\twhile (!q.empty() && !flag) {\n\t\t\ttnode = q.front();\n\t\t\tnode tt;\n\t\t\tq.pop();\n\t\t\tfor (int i = 0; i < 5; i++) {\n\t\t\t\ttt.x = tnode.x + nexts[i][0];\n\t\t\t\ttt.y = tnode.y + nexts[i][1];\n\t\t\t\ttt.f = tnode.f + nexts[i][2];\n\t\t\t\ttt.step = tnode.step + 1;\n\t\t\t\tif (tt.x < 1 || tt.x > r || tt.y < 1 || tt.y > c || tt.f < 0 || tt.f > l - 1) continue;\n\t\t\t\tif (dg[tt.f].book[tt.x][tt.y] || dg[tt.f].maze[tt.x][tt.y] == '#') continue;\n\t\t\t\tq.push(tt);\n\t\t\t\tdg[tt.f].book[tt.x][tt.y] = 1;\n\t\t\t\tif (tt.x == ex && tt.y == ey && tt.f == ef) {\n\t\t\t\t\tcout << tt.step << endl;\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!flag) cout << \""No dress to appreciate!\"" << endl;\n\t\tcin >> l >> r >> c;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,86,424 1375075653774315520,4907ca476ea9ddd0391e7c3dada631ea134f3a9d73bc4f0a9ed95b559518d103,2021-03-25 21:22:38,C++,300.0,1374655780489375752,1106090088947060736,1041335204213755904,"#include\nusing namespace std;\n\n#define MAXSIZE 40\n\nstruct node {\n\tint x;\n\tint y;\n\tint f;\n\tint step;\n};\n\nstruct dungeon {\n\tint book[MAXSIZE][MAXSIZE];\n\tchar maze[MAXSIZE][MAXSIZE];\n};\n\nint nexts[6][3] = { {0,1,0},{1,0,0},{0,-1,0},{-1,0,0},{0,0,1},{0,0,-1}};\n\nint main() {\n\tint l, r, c, sx, sy, sf, ex, ey, ef;\n\tint i, j, k, flag;\n\tnode tnode;\n\tcin >> l >> r >> c;\n\twhile (l || r || c) {\n\t\tqueue q;\n\t\tvector dg(l);\n\t\tflag = 0;\n\t\tfor (k = 0; k < l; k++) {\n\t\t\tfor (i = 1; i <= r; i++) {\n\t\t\t\tfor (j = 1; j <= c; j++) {\n\t\t\t\t\tcin >> dg[k].maze[i][j];\n\t\t\t\t\tif (dg[k].maze[i][j] == 'S') {\n\t\t\t\t\t\tsx = i;\n\t\t\t\t\t\tsy = j;\n\t\t\t\t\t\tsf = k;\n\t\t\t\t\t}\n\t\t\t\t\telse if (dg[k].maze[i][j] == 'E') {\n\t\t\t\t\t\tex = i;\n\t\t\t\t\t\tey = j;\n\t\t\t\t\t\tef = k;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tgetchar();\n\t\t}\n\t\ttnode.f = sf;\n\t\ttnode.x = sx;\n\t\ttnode.y = sy;\n\t\ttnode.step = 0;\n\t\tq.push(tnode);\n\t\tdg[sf].book[sf][sy] = 1;\n\t\twhile (!q.empty() && !flag) {\n\t\t\ttnode = q.front();\n\t\t\tnode tt;\n\t\t\tq.pop();\n\t\t\tfor (int i = 0; i < 6; i++) {\n\t\t\t\ttt.x = tnode.x + nexts[i][0];\n\t\t\t\ttt.y = tnode.y + nexts[i][1];\n\t\t\t\ttt.f = tnode.f + nexts[i][2];\n\t\t\t\ttt.step = tnode.step + 1;\n\t\t\t\tif (tt.x < 1 || tt.x > r || tt.y < 1 || tt.y > c || tt.f < 0 || tt.f > l - 1) continue;\n\t\t\t\tif (dg[tt.f].book[tt.x][tt.y] || dg[tt.f].maze[tt.x][tt.y] == '#') continue;\n\t\t\t\tq.push(tt);\n\t\t\t\tdg[tt.f].book[tt.x][tt.y] = 1;\n\t\t\t\tif (tt.x == ex && tt.y == ey && tt.f == ef) {\n\t\t\t\t\tcout << tt.step << endl;\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!flag) cout << \""No dress to appreciate!\"" << endl;\n\t\tcin >> l >> r >> c;\n\t}\n\treturn 0;\n}",ACCEPTED,72,444 1375076763452977152,4907ca476ea9ddd0391e7c3dada631ea134f3a9d73bc4f0a9ed95b559518d103,2021-03-25 21:27:02,C++,300.0,1374655780489375752,1106090088947060736,1041335204213755904,"#include\nusing namespace std;\n\n#define MAXSIZE 40\n\nstruct node {\n\tint x;\n\tint y;\n\tint f;\n\tint step;\n};\n\nstruct dungeon {\n\tint book[MAXSIZE][MAXSIZE];\n\tchar maze[MAXSIZE][MAXSIZE];\n};\n//妹有料到啊，还可以往上走\nint nexts[6][3] = { {0,1,0},{1,0,0},{0,-1,0},{-1,0,0},{0,0,1},{0,0,-1}};\n\nint main() {\n\tint l, r, c, sx, sy, sf, ex, ey, ef;\n\tint i, j, k, flag;\n\tnode tnode;\n\tcin >> l >> r >> c;\n\twhile (l || r || c) {\n\t\tqueue q;\n\t\tvector dg(l);\n\t\tflag = 0;\n\t\tfor (k = 0; k < l; k++) {\n\t\t\tfor (i = 1; i <= r; i++) {\n\t\t\t\tfor (j = 1; j <= c; j++) {\n\t\t\t\t\tcin >> dg[k].maze[i][j];\n\t\t\t\t\tif (dg[k].maze[i][j] == 'S') {\n\t\t\t\t\t\tsx = i;\n\t\t\t\t\t\tsy = j;\n\t\t\t\t\t\tsf = k;\n\t\t\t\t\t}\n\t\t\t\t\telse if (dg[k].maze[i][j] == 'E') {\n\t\t\t\t\t\tex = i;\n\t\t\t\t\t\tey = j;\n\t\t\t\t\t\tef = k;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tgetchar();\n\t\t}\n\t\ttnode.f = sf;\n\t\ttnode.x = sx;\n\t\ttnode.y = sy;\n\t\ttnode.step = 0;\n\t\tq.push(tnode);\n\t\tdg[sf].book[sf][sy] = 1;\n\t\twhile (!q.empty() && !flag) {\n\t\t\ttnode = q.front();\n\t\t\tnode tt;\n\t\t\tq.pop();\n\t\t\tfor (int i = 0; i < 6; i++) {\n\t\t\t\ttt.x = tnode.x + nexts[i][0];\n\t\t\t\ttt.y = tnode.y + nexts[i][1];\n\t\t\t\ttt.f = tnode.f + nexts[i][2];\n\t\t\t\ttt.step = tnode.step + 1;\n\t\t\t\tif (tt.x < 1 || tt.x > r || tt.y < 1 || tt.y > c || tt.f < 0 || tt.f > l - 1) continue;\n\t\t\t\tif (dg[tt.f].book[tt.x][tt.y] || dg[tt.f].maze[tt.x][tt.y] == '#') continue;\n\t\t\t\tq.push(tt);\n\t\t\t\tdg[tt.f].book[tt.x][tt.y] = 1;\n\t\t\t\tif (tt.x == ex && tt.y == ey && tt.f == ef) {\n\t\t\t\t\tcout << tt.step << endl;\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!flag) cout << \""No dress to appreciate!\"" << endl;\n\t\tcin >> l >> r >> c;\n\t}\n\treturn 0;\n}",ACCEPTED,62,540 1375430007563890688,9f8c733be98026898ea2b6cdc868bb0a0df2492d69f3831146c762d0d01bcfe7,2021-03-26 20:50:42,C++,0.0,1374655780489375752,1106090088947060736,1041335204213755904,"#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\nstruct node {\n\tint x;\n\tint y;\n\tint z;\n\tnode(int a1=1, int a2=1, int a3=1) :x(a1), y(a2), z(a3){}\n};\nqueue que;\nint sx, sy, sz, cx, cy, cz;\nchar gdweizhi[32][32][32];\nbool used[32][32][32];\nint cn[32][32][32];\nint yd1[] = { 0,0,-1,0,0,1 };\nint yd2[] = { 0,- 1,0,0,1,0 };\nint yd3[] = { -1,0,0,1,0,0 };\nint a, b, c;\nint bfs()\n{\n\tmemset(used, 0, sizeof used);\n\tmemset(cn, 0, sizeof cn);\n\tint xx, yy, zz, x, y, z;\n cn[sx][sy][sz]=0;\n used[sx][sy][sz]=1;\n while(!que.empty()) que.pop();\n\tnode temp;\n\tque.push(node(sx, sy, sz));\n\twhile (!que.empty())\n\t{\n\t\ttemp = que.front();\n\t\tque.pop();\n\t\tx = temp.x; y = temp.y; z = temp.z;\n\t\tif (y == cy && z == cz&&x==cx)\n\t\t\treturn cn[x][y][z];\n\t\tfor (int i = 0; i < 6; i++)\n\t\t{\n\t\t\txx = x + yd1[i]; yy = y + yd2[i]; zz = z + yd3[i];\n\t\t\tif (xx < 1 || yy < 1 || zz < 1) continue;\n\t\t\tif (xx > a || yy > b || zz > c)continue;\n\t\t\tif (used[xx][yy][zz] == 1 || gdweizhi[xx][yy][zz] == '#')\n\t\t\t\tcontinue;\n\t\t\tque.push(node(xx, yy, zz));\n\t\t\tused[xx][yy][zz] = 1;\n\t\t\tcn[xx][yy][zz] = cn[xx][yy][zz] + 1;\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile (scanf(\""%d %d %d\"", &a, &b, &c)!=EOF&&a!=0)\n\t{\n\t\tchar ch;\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tfor (int j = 1; j <= b; j++)\n\t\t\t{\n\t\t\t\tfor (int k = 1; k <= c; k++)\n\t\t\t\t{\n\t\t\t\t\tcin >> ch;\n\t\t\t\t\tif (ch == 'S')\n\t\t\t\t\t{\n\t\t\t\t\t\tsx = i;\n\t\t\t\t\t\tsy = j;\n\t\t\t\t\t\tsz = k;\n\t\t\t\t\t}\n\t\t\t\t\tif (ch == 'E')\n\t\t\t\t\t{\n\t\t\t\t\t\tcx = i; cy = j; cz = k;\n\t\t\t\t\t}\n\t\t\t\t\tgdweizhi[i][j][k] = ch;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n int cnt = bfs();\n if (cnt == -1)\n cout << \""No dress to appreciate!\"" << endl;\n else\n cout << cnt << endl;\n\t}\n}",WRONG_ANSWER,103,444 1375430592975544320,9f8c733be98026898ea2b6cdc868bb0a0df2492d69f3831146c762d0d01bcfe7,2021-03-26 20:53:02,C++,300.0,1374655780489375752,1106090088947060736,1041335204213755904,"#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\nstruct node {\n\tint x;\n\tint y;\n\tint z;\n\tnode(int a1=1, int a2=1, int a3=1) :x(a1), y(a2), z(a3){}\n};\nqueue que;\nint sx, sy, sz, cx, cy, cz;\nchar gdweizhi[32][32][32];\nbool used[32][32][32];\nint cn[32][32][32];\nint yd1[] = { 0,0,-1,0,0,1 };\nint yd2[] = { 0,- 1,0,0,1,0 };\nint yd3[] = { -1,0,0,1,0,0 };\nint a, b, c;\nint bfs()\n{\n\tmemset(used, 0, sizeof used);\n\tmemset(cn, 0, sizeof cn);\n\tint xx, yy, zz, x, y, z;\n cn[sx][sy][sz]=0;\n used[sx][sy][sz]=1;\n while(!que.empty()) que.pop();\n\tnode temp;\n\tque.push(node(sx, sy, sz));\n\twhile (!que.empty())\n\t{\n\t\ttemp = que.front();\n\t\tque.pop();\n\t\tx = temp.x; y = temp.y; z = temp.z;\n\t\tif (y == cy && z == cz&&x==cx)\n\t\t\treturn cn[x][y][z];\n\t\tfor (int i = 0; i < 6; i++)\n\t\t{\n\t\t\txx = x + yd1[i]; yy = y + yd2[i]; zz = z + yd3[i];\n\t\t\tif (xx < 1 || yy < 1 || zz < 1) continue;\n\t\t\tif (xx > a || yy > b || zz > c)continue;\n\t\t\tif (used[xx][yy][zz] == 1 || gdweizhi[xx][yy][zz] == '#')\n\t\t\t\tcontinue;\n\t\t\tused[xx][yy][zz] = 1;\n\t\t\tcn[xx][yy][zz] = cn[x][y][z] + 1;\n que.push(node(xx, yy, zz));\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile (scanf(\""%d %d %d\"", &a, &b, &c)!=EOF&&a!=0)\n\t{\n\t\tchar ch;\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tfor (int j = 1; j <= b; j++)\n\t\t\t{\n\t\t\t\tfor (int k = 1; k <= c; k++)\n\t\t\t\t{\n\t\t\t\t\tcin >> ch;\n\t\t\t\t\tif (ch == 'S')\n\t\t\t\t\t{\n\t\t\t\t\t\tsx = i;\n\t\t\t\t\t\tsy = j;\n\t\t\t\t\t\tsz = k;\n\t\t\t\t\t}\n\t\t\t\t\tif (ch == 'E')\n\t\t\t\t\t{\n\t\t\t\t\t\tcx = i; cy = j; cz = k;\n\t\t\t\t\t}\n\t\t\t\t\tgdweizhi[i][j][k] = ch;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n int cnt = bfs();\n if (cnt == -1)\n cout << \""No dress to appreciate!\"" << endl;\n else\n cout << cnt << endl;\n\t}\n}",ACCEPTED,95,452 1281533847618895872,2d9c0b1b0e2113059e6e8c87680b59e4df82da843559ef0a6c9cba10d29df72b,2020-07-10 18:20:53,C++,300.0,1281200972096638984,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\n#include\n#define ll long long \nusing namespace std;\n\nint l,r,c,startx,starty,startz;\nbool vis[35][35][35];\nchar mp[35][35][35];\nint dir[6][3] = {{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};\n\nstruct node{\n\tint x,y,z,step;\n\tnode(int xx, int yy, int zz, int s){x = xx, y = yy, z = zz, step = s;} \n};\n\nvoid bfs(){\n\tqueue q;\n\tq.push(node(startx,starty,startz,0));\n\t//printf(\""%d %d %d\\n\"",startx,starty,startz);\n\twhile(!q.empty()){\n\t\tnode now = q.front(); q.pop();\n\t\tint x = now.x, y = now.y, z = now.z, step = now.step;\n\t\tif(mp[z][x][y] == 'E'){\n\t\t\tprintf(\""%d\\n\"",step);\n\t\t\treturn ;\n\t\t}\n\t\tif(vis[z][x][y])\tcontinue;\n\t\tvis[z][x][y] = 1;\n\t\tfor(int k = 0; k < 6; ++k){\n\t\t\tint tx = x + dir[k][1], ty = y + dir[k][2], tz = z + dir[k][0];\n\t\t\tif(tx < 1 || ty < 1 || tz < 1 || tz > l || tx > r || ty > c || mp[tz][tx][ty] == '#')\tcontinue;\n\t\t\tq.push(node(tx,ty,tz,step + 1)); \n\t\t}\n\t}\n\tprintf(\""No dress to appreciate!\\n\"");\n}\n\nint main(){\n\twhile(~scanf(\""%d%d%d\"",&l,&r,&c) && (l || r || c)){\n\t\tmemset(vis,0,sizeof(vis));\n\t\tmemset(mp,0,sizeof(mp));\n\t\tfor(int i = 1; i <= l; ++i){\n\t\t\tfor(int j = 1; j <= r; ++j){\n\t\t\t\tgetchar();\n\t\t\t\tfor(int k = 1; k <= c; ++k){\n\t\t\t\t\tscanf(\""%c\"",&mp[i][j][k]);\n\t\t\t\t\tif(mp[i][j][k] == 'S')\tstartx = j, starty = k, startz = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tgetchar();\n\t\t}\n\t\tbfs();\n\t}\n\treturn 0;\n}\n\n/*for(int i = 1; i <= l; ++i){\n\t\t\tfor(int j = 1; j <= r; ++j){\n\t\t\t\tfor(int k = 1; k <= c; ++k)\n\t\t\t\t\tprintf(\""%c\"",mp[i][j][k]);\n\t\t\t\tputchar('\\n');\n\t\t\t}\n\t\t\tputchar('\\n');\n\t\t}*/",ACCEPTED,172,704 1281536212320313344,8559f2d2d70598765faf644a0052c225c1039a6fdd35619af5720c148faa984f,2020-07-10 18:30:17,C++,0.0,1281200972096638984,1106090088947060736,1041335204213755904,/**\n * 因个人时间安排原因，今日主要测试熟悉考试系统操作，\n * 无法打完全程，现提前退出，十分抱歉。\n * \n * \n * \n * \n * \n * \n * \n * \n * \n*/,COMPILE_ERROR,0,0 1281548082188050432,283f3552f6841d19493b40eb0c1d2b8846ba55ddd8aa1edc755ca09579aecb6e,2020-07-10 19:17:27,C++,0.0,1281200972096638984,1106090088947060736,1041335204213755904,"#include \nusing namespace std;\nconst int SZ = 1e5 + 20;\ntypedef long long ll;\nint n,m,k;\nint sx,sy,sz,ex,ey,ez,ans;\nchar qp[32][32][32];\nbool vis[32][32][32];\nconst int dx[6] = {0,0,0,0,1,-1};\nconst int dy[6] = {0,0,1,-1,0,0};\nconst int dz[6] = {1,-1,0,0,0,0};\nstruct zt\n{\n\tint x,y,z;\n\tint id;\n};\ninline void bfs()\n{\n\tmemset(vis,0,sizeof(vis));\n\tqueue q;\n\tans = 0;\n\tq.push((zt){sx,sy,sz,0});\n\tvis[sx][sy][sz] = 1;\n\twhile(!q.empty())\n\t{\n\t\tzt now = q.front();\n\t\tq.pop();\n\t\tif(now.x == ex && now.y == ey && now.z == ez) \n\t\t{\n\t\t\tans = now.id;\n\t\t\tbreak;\n\t\t}\n\t\tfor(int i = 0;i < 6;i ++)\n\t\t{\n\t\t\tint xx = now.x + dx[i],yy = now.y + dy[i],zz = now.z + dz[i];\n\t\t\tif(xx >= 1 && xx <= n && yy >= 1 && zz >= 1 && yy <= m && zz <= k && vis[xx][yy][zz] == 0 && (qp[xx][yy][zz] == '.'||qp[xx][yy][zz] == 'E'))\n\t\t\t{\n\t\t\t\tvis[xx][yy][zz] = 1;\n\t\t\t\tq.push((zt){xx,yy,zz,now.id + 1});\n\t\t\t}\n\t\t}\n\t}\n\tif(ans == 0) printf(\""No dress to appreciate!\"");\n\telse printf(\""%d\\n\"",ans);\n}\ninline void solve()\n{\n\twhile(scanf(\""%d%d%d\"",&n,&m,&k) == 3)\n\t{\n\t\tif(n == 0 && m == 0 && k == 0) break;\n\t\tfor(int i = 1;i <= n;i ++)\n\t\t{\n\t\t\tfor(int j = 1;j <= m;j ++)\n\t\t\t{\n\t\t\t\tfor(int t = 1;t <= k;t ++)\n\t\t\t\t{\n\t\t\t\t\tcin >> qp[i][j][t];\n\t\t\t\t\tif(qp[i][j][t] == 'S') \n\t\t\t\t\t{\n\t\t\t\t\t\tsx = i;\n\t\t\t\t\t\tsy = j;\n\t\t\t\t\t\tsz = t;\n\t\t\t\t\t}\n\t\t\t\t\tif(qp[i][j][t] == 'E')\n\t\t\t\t\t{\n\t\t\t\t\t\tex = i;\n\t\t\t\t\t\tey = j;\n\t\t\t\t\t\tez = t;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//printf(\""%d %d %d\\n\"",sx,sy,sz);\n\t\t//printf(\""%d %d %d\\n\"",ex,ey,ez);\n\t\tbfs();\n\t}\n}\nint main()\n{\n\tsolve();\n\treturn 0;\n}",PRESENTATION_ERROR,89,384 1281548164238065664,283f3552f6841d19493b40eb0c1d2b8846ba55ddd8aa1edc755ca09579aecb6e,2020-07-10 19:17:47,C++,300.0,1281200972096638984,1106090088947060736,1041335204213755904,"#include \nusing namespace std;\nconst int SZ = 1e5 + 20;\ntypedef long long ll;\nint n,m,k;\nint sx,sy,sz,ex,ey,ez,ans;\nchar qp[32][32][32];\nbool vis[32][32][32];\nconst int dx[6] = {0,0,0,0,1,-1};\nconst int dy[6] = {0,0,1,-1,0,0};\nconst int dz[6] = {1,-1,0,0,0,0};\nstruct zt\n{\n\tint x,y,z;\n\tint id;\n};\ninline void bfs()\n{\n\tmemset(vis,0,sizeof(vis));\n\tqueue q;\n\tans = 0;\n\tq.push((zt){sx,sy,sz,0});\n\tvis[sx][sy][sz] = 1;\n\twhile(!q.empty())\n\t{\n\t\tzt now = q.front();\n\t\tq.pop();\n\t\tif(now.x == ex && now.y == ey && now.z == ez) \n\t\t{\n\t\t\tans = now.id;\n\t\t\tbreak;\n\t\t}\n\t\tfor(int i = 0;i < 6;i ++)\n\t\t{\n\t\t\tint xx = now.x + dx[i],yy = now.y + dy[i],zz = now.z + dz[i];\n\t\t\tif(xx >= 1 && xx <= n && yy >= 1 && zz >= 1 && yy <= m && zz <= k && vis[xx][yy][zz] == 0 && (qp[xx][yy][zz] == '.'||qp[xx][yy][zz] == 'E'))\n\t\t\t{\n\t\t\t\tvis[xx][yy][zz] = 1;\n\t\t\t\tq.push((zt){xx,yy,zz,now.id + 1});\n\t\t\t}\n\t\t}\n\t}\n\tif(ans == 0) printf(\""No dress to appreciate!\\n\"");\n\telse printf(\""%d\\n\"",ans);\n}\ninline void solve()\n{\n\twhile(scanf(\""%d%d%d\"",&n,&m,&k) == 3)\n\t{\n\t\tif(n == 0 && m == 0 && k == 0) break;\n\t\tfor(int i = 1;i <= n;i ++)\n\t\t{\n\t\t\tfor(int j = 1;j <= m;j ++)\n\t\t\t{\n\t\t\t\tfor(int t = 1;t <= k;t ++)\n\t\t\t\t{\n\t\t\t\t\tcin >> qp[i][j][t];\n\t\t\t\t\tif(qp[i][j][t] == 'S') \n\t\t\t\t\t{\n\t\t\t\t\t\tsx = i;\n\t\t\t\t\t\tsy = j;\n\t\t\t\t\t\tsz = t;\n\t\t\t\t\t}\n\t\t\t\t\tif(qp[i][j][t] == 'E')\n\t\t\t\t\t{\n\t\t\t\t\t\tex = i;\n\t\t\t\t\t\tey = j;\n\t\t\t\t\t\tez = t;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//printf(\""%d %d %d\\n\"",sx,sy,sz);\n\t\t//printf(\""%d %d %d\\n\"",ex,ey,ez);\n\t\tbfs();\n\t}\n}\nint main()\n{\n\tsolve();\n\treturn 0;\n}",ACCEPTED,67,512 1281550368554532864,afa4c88343b95d1e7972ea4b0af3e3e3f3c71b26233dcf809aab50c1bbe12de9,2020-07-10 19:26:32,Python,0.0,1281200972096638984,1106090088947060736,1041335204213755904,n=int(input()),NON_ZERO_EXIT_CODE,23,3072 1281551102690918400,a14dc718ee1bfe8b0de9979d9735cd6ccef86aa7265cafb5d1eadc94877e1dc3,2020-07-10 19:29:27,C++,0.0,1281200972096638984,1106090088947060736,1041335204213755904,"#include \n#include \n#include \nusing namespace std;\n\n#define N 30000\nconst int dir[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};\nstruct list{\n\tint x,y,z,t;\n\tlist(int a=0,int b=0,int c=0,int d=0):x(a),y(b),z(c),t(d){}\n}lst[N],tmp,nex;\nbool wall[31][31][31],vis[31][31][31],f;\nint l,r,c,x,y,z,h,t;\nchar ch;\n\nint main(){\n\tint i,j,k;\n\twhile(1){\n\t\tscanf(\""%d%d%d\"",&l,&r,&c);\n\t\tif(l==0&&r==0&&c==0) break;\n\t\tmemset(vis,0,sizeof(vis));\n\t\th=t=0;\n\t\tf=false;\n\t\tfor(i=1;i<=l;++i){\n\t\t\tfor(j=1;j<=r;++j){\n\t\t\t\tfor(k=1;k<=c;++k){\n\t\t\t\t\tch=getchar();\n\t\t\t\t\tswitch(ch){\n\t\t\t\t\t\tcase 'S':\n\t\t\t\t\t\t\tlst[t=(t+1)%N]=list(i,j,k,0);\n\t\t\t\t\t\t\tvis[i][j][k]=true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\twall[i][j][k]=false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\twall[i][j][k]=true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\tx=i;y=j;z=k;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t--k;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile(h!=t&&!f){\n\t\t\ttmp=lst[h=(h+1)%N];\n\t\t\tfor(i=0;i<6;++i){\n\t\t\t\tnex=list(tmp.x+dir[i][0],tmp.y+dir[i][1],tmp.z+dir[i][2],tmp.t+1);\n\t\t\t\tif(nex.x&&nex.x<=l&&nex.y&&nex.y<=r&&nex.z&&nex.z<=c&&!wall[nex.x][nex.y][nex.z]&&!vis[nex.x][nex.y][nex.z]){\n\t\t\t\t\tif(nex.x==x&&nex.y==y&&nex.z==z){\n\t\t\t\t\t\tf=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tlst[t=(t+1)%N]=nex;\n\t\t\t\t\tvis[nex.x][nex.y][nex.z]=true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(f) printf(\""%d\\n\"",nex.t);\n\t\telse printf(\""No dress to appreciate!\\n\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,67,808 1281746556506529792,385e3aab35b3dfdd328272b4be9fd4a83b67629fcc2385c561a440d162ed4442,2020-07-11 08:26:07,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\nusing namespace std;\n\nstruct pt{\n int x,y,z,dis;\n};\nint L, R, C;\npt st, ed;\nqueue q;\nint nxt[6][3] = {{1,0,0}, {0,1,0},{0,0,1},{-1,0,0},{0,-1,0},{0,0,-1}};\nbool book[31][31][31];\n\nchar s[31][31][31];\nint main(){\n while(cin>>L>>R>>C){\n if(L == 0 && R == 0 && C == 0) break;\n else{\n while(!q.empty()) q.pop();\n for(int i = 1; i <= L; i++)\n for(int j = 1; j <= R; j++)\n for(int k = 1; k <= C; k++)\n book[i][j][k] = false;\n\n for(int i = 1; i <= L; i++)\n for(int j = 1; j <= R; j++){\n scanf(\""%s\"", s[i][j]);\n for(int k = 0; k < C; k++)\n if(s[i][j][k] == 'S')\n st.x = i, st.y = j, st.z = k, st.dis = 0;\n else if(s[i][j][k] == 'E')\n ed.x = i, ed.y = j, ed.z = k;\n }\n /*for(int i = 1; i <= L; i++){\n for(int j = 1; j <= R; j++){\n for(int k = 0; k < C; k++)\n putchar(s[i][j][k]);\n putchar('\\n');\n }\n putchar('\\n');\n }*/\n \n bool flag = false;\n q.push(st);\n while(!q.empty()){\n pt tmp = q.front();\n q.pop();\n\n if(tmp.x == ed.x && tmp.y == ed.y && tmp.z == ed.z){\n cout<= 1 && tmp.x + nxt[k][0] <= L && tmp.y + nxt[k][1] >= 1 && tmp.y + nxt[k][1] <= R && tmp.z + nxt[k][2] >= 0 && tmp.z + nxt[k][2] < C && s[tmp.x + nxt[k][0]][tmp.y + nxt[k][1]][tmp.z + nxt[k][2]] != '#'){\n q.push(pt{tmp.x + nxt[k][0], tmp.y + nxt[k][1], tmp.z + nxt[k][2], tmp.dis + 1});\n }\n }\n book[tmp.x][tmp.y][tmp.z] = true;\n }\n if(!flag)\n cout<<\""No dress to appreciate!\""<\nusing namespace std;\n\nstruct pt{\n int x,y,z,dis;\n};\nint L, R, C;\npt st, ed;\nqueue q;\nint nxt[6][3] = {{1,0,0}, {0,1,0},{0,0,1},{-1,0,0},{0,-1,0},{0,0,-1}};\nbool book[31][31][31];\n\nchar s[31][31][31];\nint main(){\n while(cin>>L>>R>>C){\n if(L == 0 && R == 0 && C == 0) break;\n else{\n while(!q.empty()) q.pop();\n for(int i = 1; i <= L; i++)\n for(int j = 1; j <= R; j++)\n for(int k = 0; k < C; k++)\n book[i][j][k] = false;\n\n for(int i = 1; i <= L; i++)\n for(int j = 1; j <= R; j++){\n scanf(\""%s\"", s[i][j]);\n for(int k = 0; k < C; k++)\n if(s[i][j][k] == 'S')\n st.x = i, st.y = j, st.z = k, st.dis = 0;\n else if(s[i][j][k] == 'E')\n ed.x = i, ed.y = j, ed.z = k;\n }\n /*for(int i = 1; i <= L; i++){\n for(int j = 1; j <= R; j++){\n for(int k = 0; k < C; k++)\n putchar(s[i][j][k]);\n putchar('\\n');\n }\n putchar('\\n');\n }*/\n \n bool flag = false;\n q.push(st);\n while(!q.empty()){\n pt tmp = q.front();\n q.pop();\n\n if(tmp.x == ed.x && tmp.y == ed.y && tmp.z == ed.z){\n cout<= 1 && tmp.x + nxt[k][0] <= L && tmp.y + nxt[k][1] >= 1 && tmp.y + nxt[k][1] <= R && tmp.z + nxt[k][2] >= 0 && tmp.z + nxt[k][2] < C && s[tmp.x + nxt[k][0]][tmp.y + nxt[k][1]][tmp.z + nxt[k][2]] != '#'){\n q.push(pt{tmp.x + nxt[k][0], tmp.y + nxt[k][1], tmp.z + nxt[k][2], tmp.dis + 1});\n }\n }\n book[tmp.x][tmp.y][tmp.z] = true;\n }\n if(!flag)\n cout<<\""No dress to appreciate!\""<\n#include \n#include \nusing namespace std;\n\n#define N 30000\nconst int dir[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};\nstruct list{\n\tint x,y,z,t;\n\tlist(int a=0,int b=0,int c=0,int d=0):x(a),y(b),z(c),t(d){}\n}lst[N],tmp,nex;\nbool wall[31][31][31],vis[31][31][31],f;\nint l,r,c,x,y,z,h,t;\nchar ch;\n\nint main(){\n\tint i,j,k;\n\twhile(1){\n\t\tscanf(\""%d%d%d\"",&l,&r,&c);\n\t\tif(l==0&&r==0&&c==0) break;\n\t\tmemset(vis,0,sizeof(vis));\n\t\th=t=0;\n\t\tf=false;\n\t\tfor(i=1;i<=l;++i){\n\t\t\tfor(j=1;j<=r;++j){\n\t\t\t\tfor(k=1;k<=c;++k){\n\t\t\t\t\tch=getchar();\n\t\t\t\t\tswitch(ch){\n\t\t\t\t\t\tcase 'S':\n\t\t\t\t\t\t\tlst[t=(t+1)%N]=list(i,j,k,0);\n\t\t\t\t\t\t\tvis[i][j][k]=true;\n\t\t\t\t\t\t\twall[i][j][k]=false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\twall[i][j][k]=false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\twall[i][j][k]=true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\tx=i;y=j;z=k;\n\t\t\t\t\t\t\twall[i][j][k]=false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t--k;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile(h!=t&&!f){\n\t\t\ttmp=lst[h=(h+1)%N];\n\t\t\tfor(i=0;i<6;++i){\n\t\t\t\tnex=list(tmp.x+dir[i][0],tmp.y+dir[i][1],tmp.z+dir[i][2],tmp.t+1);\n\t\t\t\tif(nex.x&&nex.x<=l&&nex.y&&nex.y<=r&&nex.z&&nex.z<=c&&!wall[nex.x][nex.y][nex.z]&&!vis[nex.x][nex.y][nex.z]){\n\t\t\t\t\tif(nex.x==x&&nex.y==y&&nex.z==z){\n\t\t\t\t\t\tf=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tlst[t=(t+1)%N]=nex;\n\t\t\t\t\tvis[nex.x][nex.y][nex.z]=true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(f) printf(\""%d\\n\"",nex.t);\n\t\telse printf(\""No dress to appreciate!\\n\"");\n\t}\n\treturn 0;\n}",ACCEPTED,64,868 1281788057286541312,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 11:11:01,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n\tnode(int i1,int j1,int k1,int step1):i(i1),j(j1),k(k1),step(step1){}\n};\nbool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\nint bfs(node qidian)\n{\n\tqueue q;\n\tq.push(node(qidian.i,qidian.j,qidian.k,qidian.step));\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx(temp2.i,temp2.j,temp2.k,temp2.step);\n\t\t\ttx.i+=L1[i];\n\t\t\ttx.j+=R1[i];\n\t\t\ttx.k+=C1[i];\n\t\t\tif(check(tx.i,tx.j,tx.k)==true)\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push(node(tx.i,tx.j,tx.k,temp2.step+1));\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian(0,0,0,0);\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t\tmemset(book,false,sizeof(book));\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1281789951632392192,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 11:18:33,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n\tnode(int i1,int j1,int k1,int step1):i(i1),j(j1),k(k1),step(step1){}\n};\nbool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\nint bfs(node qidian)\n{\n\tqueue q;\n\tq.push(node(qidian.i,qidian.j,qidian.k,qidian.step));\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx(temp2.i,temp2.j,temp2.k,temp2.step);\n\t\t\ttx.i+=L1[i];\n\t\t\ttx.j+=R1[i];\n\t\t\ttx.k+=C1[i];\n\t\t\tif(check(tx.i,tx.j,tx.k)==true)\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push(node(tx.i,tx.j,tx.k,temp2.step+1));\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian(0,0,0,0);\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t\tmemset(book,false,sizeof(book));\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1281790424007491584,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 11:20:26,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n\tnode(int i1,int j1,int k1,int step1):i(i1),j(j1),k(k1),step(step1){}\n};\nbool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\nint bfs(node qidian)\n{\n\tqueue q;\n\tq.push(node(qidian.i,qidian.j,qidian.k,qidian.step));\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx(temp2.i,temp2.j,temp2.k,temp2.step);\n\t\t\ttx.i+=L1[i];\n\t\t\ttx.j+=R1[i];\n\t\t\ttx.k+=C1[i];\n\t\t\tif(check(tx.i,tx.j,tx.k)==true)\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push(node(tx.i,tx.j,tx.k,temp2.step+1));\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tif(L==0&&R==0&&C==0) break;\n getchar();\n\t\telse\n\t\t{\n\t\t\tnode qidian(0,0,0,0);\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t\tmemset(book,false,sizeof(book));\n\t\t}\n\t}\n\treturn 0;\n} ",COMPILE_ERROR,0,0 1281797487223816192,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 11:48:30,C++,300.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include \nusing namespace std;\nconst int SZ = 1e5 + 20;\ntypedef long long ll;\nint n,m,k;\nint sx,sy,sz,ex,ey,ez,ans;\nchar qp[32][32][32];\nbool vis[32][32][32];\nconst int dx[6] = {0,0,0,0,1,-1};\nconst int dy[6] = {0,0,1,-1,0,0};\nconst int dz[6] = {1,-1,0,0,0,0};\nstruct zt\n{\n\tint x,y,z;\n\tint id;\n};\ninline void bfs()\n{\n\tmemset(vis,0,sizeof(vis));\n\tqueue q;\n\tans = 0;\n\tq.push((zt){sx,sy,sz,0});\n\tvis[sx][sy][sz] = 1;\n\twhile(!q.empty())\n\t{\n\t\tzt now = q.front();\n\t\tq.pop();\n\t\tif(now.x == ex && now.y == ey && now.z == ez) \n\t\t{\n\t\t\tans = now.id;\n\t\t\tbreak;\n\t\t}\n\t\tfor(int i = 0;i < 6;i ++)\n\t\t{\n\t\t\tint xx = now.x + dx[i],yy = now.y + dy[i],zz = now.z + dz[i];\n\t\t\tif(xx >= 1 && xx <= n && yy >= 1 && zz >= 1 && yy <= m && zz <= k && vis[xx][yy][zz] == 0 && (qp[xx][yy][zz] == '.'||qp[xx][yy][zz] == 'E'))\n\t\t\t{\n\t\t\t\tvis[xx][yy][zz] = 1;\n\t\t\t\tq.push((zt){xx,yy,zz,now.id + 1});\n\t\t\t}\n\t\t}\n\t}\n\tif(ans == 0) printf(\""No dress to appreciate!\\n\"");\n\telse printf(\""%d\\n\"",ans);\n}\ninline void solve()\n{\n\twhile(scanf(\""%d%d%d\"",&n,&m,&k) == 3)\n\t{\n\t\tif(n == 0 && m == 0 && k == 0) break;\n\t\tfor(int i = 1;i <= n;i ++)\n\t\t{\n\t\t\tfor(int j = 1;j <= m;j ++)\n\t\t\t{\n\t\t\t\tfor(int t = 1;t <= k;t ++)\n\t\t\t\t{\n\t\t\t\t\tcin >> qp[i][j][t];\n\t\t\t\t\tif(qp[i][j][t] == 'S') \n\t\t\t\t\t{\n\t\t\t\t\t\tsx = i;\n\t\t\t\t\t\tsy = j;\n\t\t\t\t\t\tsz = t;\n\t\t\t\t\t}\n\t\t\t\t\tif(qp[i][j][t] == 'E')\n\t\t\t\t\t{\n\t\t\t\t\t\tex = i;\n\t\t\t\t\t\tey = j;\n\t\t\t\t\t\tez = t;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//printf(\""%d %d %d\\n\"",sx,sy,sz);\n\t\t//printf(\""%d %d %d\\n\"",ex,ey,ez);\n\t\tbfs();\n\t}\n}\nint main()\n{\n\tsolve();\n\treturn 0;\n}",ACCEPTED,104,512 1281799058561089536,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 11:54:44,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n\tnode(int i1,int j1,int k1,int step1):i(i1),j(j1),k(k1),step(step1){}\n};\nbool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\nint bfs(node qidian)\n{\n\tmemset(book,false,sizeof(book));\n\tqueue q;\n\tq.push(node(qidian.i,qidian.j,qidian.k,qidian.step));\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx(temp2.i,temp2.j,temp2.k,temp2.step);\n\t\t\ttx.i+=L1[i];\n\t\t\ttx.j+=R1[i];\n\t\t\ttx.k+=C1[i];\n\t\t\tif(check(tx.i,tx.j,tx.k)==true)\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push(node(tx.i,tx.j,tx.k,temp2.step+1));\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian(0,0,0,0);\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1281799524317577216,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 11:56:35,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n\tnode(int i1,int j1,int k1,int step1):i(i1),j(j1),k(k1),step(step1){}\n};\nbool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\nint bfs(node qidian)\n{\n\tmemset(book,false,sizeof(book));\n\tqueue q;\n\tq.push(node(qidian.i,qidian.j,qidian.k,qidian.step));\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx(temp2.i,temp2.j,temp2.k,temp2.step);\n\t\t\ttx.i+=L1[i];\n\t\t\ttx.j+=R1[i];\n\t\t\ttx.k+=C1[i];\n\t\t\tif(check(tx.i,tx.j,tx.k)==true)\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push(node(tx.i,tx.j,tx.k,temp2.step+1));\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian(0,0,0,0);\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1281799567342747648,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 11:56:46,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n\tnode(int i1,int j1,int k1,int step1):i(i1),j(j1),k(k1),step(step1){}\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,false,sizeof(book));\n\tqueue q;\n\tq.push(node(qidian.i,qidian.j,qidian.k,qidian.step));\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx(temp2.i,temp2.j,temp2.k,temp2.step);\n\t\t\ttx.i+=L1[i];\n\t\t\ttx.j+=R1[i];\n\t\t\ttx.k+=C1[i];\n\t\t\tif(check(tx.i,tx.j,tx.k)==true)\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push(node(tx.i,tx.j,tx.k,temp2.step+1));\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian(0,0,0,0);\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1281803684278616064,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 12:13:07,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n\tnode(int i1,int j1,int k1,int step1):i(i1),j(j1),k(k1),step(step1){}\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,false,sizeof(book));\n\tqueue q;\n\tq.push(node(qidian.i,qidian.j,qidian.k,qidian.step));\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx(temp2.i,temp2.j,temp2.k,temp2.step);\n\t\t\ttx.i+=L1[i];\n\t\t\ttx.j+=R1[i];\n\t\t\ttx.k+=C1[i];\n\t\t\tif(tx.i >= 1 && tx.i <= L && tx.j >= 1 && tx.k >= 1 && tx.j <= R && tx.k <= C && book[tx.i][tx.j][tx.k] == 0 && (tu[tx.i][tx.j][tx.k] == '.'||tu[tx.i][tx.j][tx.k] == 'E'))\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push(node(tx.i,tx.j,tx.k,temp2.step+1));\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian(0,0,0,0);\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1281803829514780672,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 12:13:42,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,false,sizeof(book));\n\tqueue q;\n\tq.push(node(qidian.i,qidian.j,qidian.k,qidian.step));\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx(temp2.i,temp2.j,temp2.k,temp2.step);\n\t\t\ttx.i+=L1[i];\n\t\t\ttx.j+=R1[i];\n\t\t\ttx.k+=C1[i];\n\t\t\tif(tx.i >= 1 && tx.i <= L && tx.j >= 1 && tx.k >= 1 && tx.j <= R && tx.k <= C && book[tx.i][tx.j][tx.k] == 0 && (tu[tx.i][tx.j][tx.k] == '.'||tu[tx.i][tx.j][tx.k] == 'E'))\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push(node(tx.i,tx.j,tx.k,temp2.step+1));\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian(0,0,0,0);\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",COMPILE_ERROR,0,0 1281804822590717952,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 12:17:39,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,false,sizeof(book));\n\tqueue q;\n\tq.push((node){qidian.i,qidian.j,qidian.k,qidian.step});\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx;\n\t\t\ttx.i=temp2.i+L1[i];\n\t\t\ttx.j=temp2.j+R1[i];\n\t\t\ttx.k=temp2.k+C1[i];\n\t\t\ttx.step=temp2.step;\n\t\t\tif(tx.i >= 1 && tx.i <= L && tx.j >= 1 && tx.k >= 1 && tx.j <= R && tx.k <= C && book[tx.i][tx.j][tx.k] == 0 && (tu[tx.i][tx.j][tx.k] == '.'||tu[tx.i][tx.j][tx.k] == 'E'))\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push((node){tx.i,tx.j,tx.k,temp2.step+1});\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian=(node){0,0,0,0};\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1281804923895742464,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 12:18:03,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[40][40][40];\nbool book[40][40][40]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,0,sizeof(book));\n\tqueue q;\n\tq.push((node){qidian.i,qidian.j,qidian.k,qidian.step});\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx;\n\t\t\ttx.i=temp2.i+L1[i];\n\t\t\ttx.j=temp2.j+R1[i];\n\t\t\ttx.k=temp2.k+C1[i];\n\t\t\ttx.step=temp2.step;\n\t\t\tif(tx.i >= 1 && tx.i <= L && tx.j >= 1 && tx.k >= 1 && tx.j <= R && tx.k <= C && book[tx.i][tx.j][tx.k] == 0 && (tu[tx.i][tx.j][tx.k] == '.'||tu[tx.i][tx.j][tx.k] == 'E'))\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push((node){tx.i,tx.j,tx.k,temp2.step+1});\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian=(node){0,0,0,0};\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1281813518990360576,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-11 12:52:12,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[32][32][32];\nbool book[32][32][32]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,0,sizeof(book));\n\tqueue q;\n\tq.push((node){qidian.i,qidian.j,qidian.k,qidian.step});\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx;\n\t\t\ttx.i=temp2.i+L1[i];\n\t\t\ttx.j=temp2.j+R1[i];\n\t\t\ttx.k=temp2.k+C1[i];\n\t\t\ttx.step=temp2.step;\n\t\t\tif(tx.i >= 1 && tx.i <= L && tx.j >= 1 && tx.k >= 1 && tx.j <= R && tx.k <= C && book[tx.i][tx.j][tx.k] == 0 && (tu[tx.i][tx.j][tx.k] == '.'||tu[tx.i][tx.j][tx.k] == 'E'))\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push((node){tx.i,tx.j,tx.k,temp2.step+1});\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian=(node){0,0,0,0};\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1283042153867968512,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-14 22:14:21,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[32][32][32];\nbool book[32][32][32]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,0,sizeof(book));\n\tqueue q;\n\tq.push((node){qidian.i,qidian.j,qidian.k,qidian.step});\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx;\n\t\t\ttx.i=temp2.i+L1[i];\n\t\t\ttx.j=temp2.j+R1[i];\n\t\t\ttx.k=temp2.k+C1[i];\n\t\t\ttx.step=temp2.step;\n\t\t\tif(tx.i >= 1 && tx.i <= L && tx.j >= 1 && tx.k >= 1 && tx.j <= R && tx.k <= C && book[tx.i][tx.j][tx.k] == 0 && (tu[tx.i][tx.j][tx.k] == '.'||tu[tx.i][tx.j][tx.k] == 'E'))\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push((node){tx.i,tx.j,tx.k,temp2.step+1});\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian=(node){0,0,0,0};\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1283293224473395200,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-15 14:52:01,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[32][32][32];\nbool book[32][32][32]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,0,sizeof(book));\n\tqueue q;\n\tq.push((node){qidian.i,qidian.j,qidian.k,qidian.step});\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx;\n\t\t\ttx.i=temp2.i+L1[i];\n\t\t\ttx.j=temp2.j+R1[i];\n\t\t\ttx.k=temp2.k+C1[i];\n\t\t\ttx.step=temp2.step;\n\t\t\tif(tx.i >= 1 && tx.i <= L && tx.j >= 1 && tx.k >= 1 && tx.j <= R && tx.k <= C && book[tx.i][tx.j][tx.k] == 0 && (tu[tx.i][tx.j][tx.k] == '.'||tu[tx.i][tx.j][tx.k] == 'E'))\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push((node){tx.i,tx.j,tx.k,temp2.step+1});\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian=(node){0,0,0,0};\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1283293509103058944,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-15 14:53:09,C++,0.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[32][32][32];\nbool book[32][32][32]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,0,sizeof(book));\n\tqueue q;\n\tq.push((node){qidian.i,qidian.j,qidian.k,qidian.step});\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx;\n\t\t\ttx.i=temp2.i+L1[i];\n\t\t\ttx.j=temp2.j+R1[i];\n\t\t\ttx.k=temp2.k+C1[i];\n\t\t\ttx.step=temp2.step;\n\t\t\tif(tx.i >= 1 && tx.i <= L && tx.j >= 1 && tx.k >= 1 && tx.j <= R && tx.k <= C && book[tx.i][tx.j][tx.k] == 0 && (tu[tx.i][tx.j][tx.k] == '.'||tu[tx.i][tx.j][tx.k] == 'E'))\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push((node){tx.i,tx.j,tx.k,temp2.step+1});\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tgetchar();\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian=(node){0,0,0,0};\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t\tgetchar();\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,0,0 1283296975103918080,84660090992126b45798d6ea6cb43bd59121c290ea976005a779ff06d0f9ec02,2020-07-15 15:06:56,C++,300.0,1281552703616004097,1106090088947060736,1041335204213755904,"#include\n#include\n#include\n#include\nusing namespace std;\nint L,R,C;\nint L1[9]={0,1,-1,0,0,0,0};\nint R1[9]={0,0,0,1,-1,0,0};\nint C1[9]={0,0,0,0,0,1,-1};\nchar tu[32][32][32];\nbool book[32][32][32]={false};\nstruct node\n{\n\tint i;\n\tint j;\n\tint k;\n\tint step;\n};\ninline bool check(int a,int b,int c)\n{\n\tif(a>=L+1||a<=0||b>=R+1||b<=0||c>=C+1||c<=0) return false;\n\tif(book[a][b][c]==true) return false;\n\tif(tu[a][b][c]=='#') return false;\n\treturn true;\n}\ninline int bfs(node qidian)\n{\n\tmemset(book,0,sizeof(book));\n\tqueue q;\n\tq.push((node){qidian.i,qidian.j,qidian.k,qidian.step});\n\twhile(!q.empty())\n\t{\n\t\tnode temp2=q.front();\n\t\tq.pop();\n\t\tfor(int i=1;i<=6;i++)\n\t\t{\n\t\t\tnode tx;\n\t\t\ttx.i=temp2.i+L1[i];\n\t\t\ttx.j=temp2.j+R1[i];\n\t\t\ttx.k=temp2.k+C1[i];\n\t\t\ttx.step=temp2.step;\n\t\t\tif(tx.i >= 1 && tx.i <= L && tx.j >= 1 && tx.k >= 1 && tx.j <= R && tx.k <= C && book[tx.i][tx.j][tx.k] == 0 && (tu[tx.i][tx.j][tx.k] == '.'||tu[tx.i][tx.j][tx.k] == 'E'))\n\t\t\t{\n\t\t\t\tif(tu[tx.i][tx.j][tx.k]=='E') return temp2.step+1;\n\t\t\t\tbook[tx.i][tx.j][tx.k]=true;\n\t\t\t\tq.push((node){tx.i,tx.j,tx.k,temp2.step+1});\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\""%d %d %d\"",&L,&R,&C);\n\t\tif(L==0&&R==0&&C==0) break;\n\t\telse\n\t\t{\n\t\t\tnode qidian=(node){0,0,0,0};\n\t\t\tfor(int i=1;i<=L;i++)\n\t\t\t{\n\t\t\t\tgetchar();\n\t\t\t\tfor(int j=1;j<=R;j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int w=1;w<=C;w++)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar c=getchar();\n\t\t\t\t\t\ttu[i][j][w]=c;\n\t\t\t\t\t\tif(c=='S')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqidian.i=i;\n\t\t\t\t\t\t\tqidian.j=j;\n\t\t\t\t\t\t\tqidian.k=w;\n\t\t\t\t\t\t\tqidian.step=0;\n\t\t\t\t\t\t\tbook[i][j][w]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tgetchar();\n\t\t\t\t}\n\t\t\t}\n\t\t\tint ans=bfs(qidian);\n\t\t\tif(ans==-1) printf(\""No dress to appreciate!\\n\"");\n\t\t\telse printf(\""%d\\n\"",ans);\n\t\t}\n\t}\n\treturn 0;\n} ",ACCEPTED,48,424 1106890141198401536,1e4e5df06263e09f4ae88dbe868e287ac0d5ab855a9229db6aabbf7aaa1e1762,2019-03-16 20:09:09,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\nusing namespace std;\r\nconst int INF=100000000,maxn=105;\r\ntypedef pairP;\r\nchar maze[maxn][maxn];\r\nint m,n,sx,sy,gx,gy,d[maxn][maxn];\r\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\r\nint bfs()\r\n{\r\n\r\n queue

que;\r\n for(int i=0;i>k;\r\nwhile(k--)\r\n{\r\n cin>>n>>m;\r\n sx=0,sy=1,gx=9,gy=8;\r\n for(int i=0;i>maze[i][j];\r\n if(bfs()==INF)\r\n cout<<\""No dress to appreciate!\""<\r\n#include\r\nusing namespace std;\r\nint todo[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};\r\nint l,r,c,map[31][31][31],f[31][31][31],top,ex,ey,ez,sx,sy,sz;\r\nstruct ooo{\r\n int x,y,z,t;\r\n}dl[27272];\r\nvoid ff(){\r\n char s;\r\n for(int i=0;i<31;i++)\r\n for(int j=0;j<31;j++)\r\n for(int k=0;k<31;k++){\r\n map[i][j][k]=0;\r\n f[i][j][k]=1;\r\n }\r\n top=0;\r\n for(int i=0;i>s;\r\n if(s=='S'){\r\n map[i][j][k]=1;\r\n sx=i;\r\n sy=j;\r\n sz=k;\r\n }else if(s=='E'){\r\n map[i][j][k]=1;\r\n ex=i;\r\n ey=j;\r\n ez=k;\r\n }else if(s=='.'){\r\n map[i][j][k]=1;\r\n }else{\r\n map[i][j][k]=0;\r\n }\r\n f[i][j][k]=0;\r\n }\r\n dl[0].x=sx;\r\n dl[0].y=sy;\r\n dl[0].z=sz;\r\n dl[0].t=0;\r\n f[0][0][0]=1;\r\n top++;\r\n for(int now=0;now=l || dl[now].y+todo[td][1]>=r || dl[now].z+todo[td][2]>=c)\r\n continue;\r\n if(map[dl[now].x+todo[td][0]][dl[now].y+todo[td][1]][dl[now].z+todo[td][2]]==1 && f[dl[now].x+todo[td][0]][dl[now].y+todo[td][1]][dl[now].z+todo[td][2]]==0){\r\n f[dl[now].x+todo[td][0]][dl[now].y+todo[td][1]][dl[now].z+todo[td][2]]=1;\r\n dl[top].x=dl[now].x+todo[td][0];\r\n dl[top].y=dl[now].y+todo[td][1];\r\n dl[top].z=dl[now].z+todo[td][2];\r\n dl[top].t=dl[now].t+1;\r\n top++;\r\n }\r\n }\r\n }\r\n cout<<\""No dress to appreciate!\\n\"";\r\n}\r\nint main(){\r\n cin>>l>>r>>c;\r\n while(l!=0){\r\n ff();\r\n cin>>l>>r>>c;\r\n }\r\n return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,0,0 1106895109926109184,335985abb7fadc5452d9f62cbc5a8ba03742bc497001e81dbaa186796ba8518b,2019-03-16 20:28:53,C++,20.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include\r\n#include\r\nusing namespace std;\r\nint todo[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};\r\nint l,r,c,map[31][31][31],f[31][31][31],top,ex,ey,ez,sx,sy,sz;\r\nstruct ooo{\r\n int x,y,z,t;\r\n}dl[27272];\r\nvoid ff(){\r\n char s;\r\n for(int i=0;i<31;i++)\r\n for(int j=0;j<31;j++)\r\n for(int k=0;k<31;k++){\r\n map[i][j][k]=0;\r\n f[i][j][k]=1;\r\n }\r\n top=0;\r\n for(int i=0;i>s;\r\n if(s=='S'){\r\n map[i][j][k]=1;\r\n sx=i;\r\n sy=j;\r\n sz=k;\r\n }else if(s=='E'){\r\n map[i][j][k]=1;\r\n ex=i;\r\n ey=j;\r\n ez=k;\r\n }else if(s=='.'){\r\n map[i][j][k]=1;\r\n }else{\r\n map[i][j][k]=0;\r\n }\r\n f[i][j][k]=0;\r\n }\r\n dl[0].x=sx;\r\n dl[0].y=sy;\r\n dl[0].z=sz;\r\n dl[0].t=0;\r\n f[sx][sy][sz]=1;\r\n top++;\r\n for(int now=0;now=l || dl[now].y+todo[td][1]>=r || dl[now].z+todo[td][2]>=c)\r\n continue;\r\n if(map[dl[now].x+todo[td][0]][dl[now].y+todo[td][1]][dl[now].z+todo[td][2]]==1 && f[dl[now].x+todo[td][0]][dl[now].y+todo[td][1]][dl[now].z+todo[td][2]]==0){\r\n f[dl[now].x+todo[td][0]][dl[now].y+todo[td][1]][dl[now].z+todo[td][2]]=1;\r\n dl[top].x=dl[now].x+todo[td][0];\r\n dl[top].y=dl[now].y+todo[td][1];\r\n dl[top].z=dl[now].z+todo[td][2];\r\n dl[top].t=dl[now].t+1;\r\n top++;\r\n }\r\n }\r\n }\r\n cout<<\""No dress to appreciate!\\n\"";\r\n}\r\nint main(){\r\n cin>>l>>r>>c;\r\n while(l!=0){\r\n ff();\r\n cin>>l>>r>>c;\r\n }\r\n return 0;\r\n}\r\n",ACCEPTED,129,640 1106896884297056256,17f550a5fbf62242f6f011d3c92cf96425f4d95e0b22e0c876ebeedbe1d9d7f3,2019-03-16 20:35:57,C++,20.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include\r\n#include\r\n#include\r\n#include\r\n\r\ntypedef long long LL;\r\n\r\nconst int maxm = 30 + 5;\r\nconst int maxn = 30 * 30 * 30 + 5;\r\nconst int maxl = 2 * 2 * 30 * 30 * 30 + 5;\r\nconst int oo = 0x3f3f3f3f;\r\n\r\nstruct Node {\r\n int v, dis;\r\n Node() { }\r\n Node(int v, int dis) : v(v), dis(dis) { }\r\n bool operator < (const Node &a) const {\r\n return dis > a.dis;\r\n }\r\n};\r\n\r\nint L, R, C;\r\nchar a[100];\r\nint stl, str, stc, edl, edr, edc;\r\nint totedge, st[maxn], next[maxl], to[maxl];\r\nint dis[maxn];\r\nint G[maxm][maxm][maxm];\r\nbool mark[maxn];\r\n\r\nint id(int a, int b, int c) {\r\n return (a - 1) * R * C + (b - 1) * C + c - 1;\r\n}\r\n\r\nvoid addedge(int u, int v) {\r\n to[++totedge] = v;\r\n next[totedge] = st[u];\r\n st[u] = totedge;\r\n}\r\n\r\nvoid finddis(int s) {\r\n std::priority_queue q;\r\n memset(dis, oo, sizeof(dis));\r\n memset(mark, false, sizeof(mark));\r\n dis[s] = 0;\r\n q.push(Node(s, dis[s]));\r\n while(!q.empty()) {\r\n Node p = q.top(); q.pop();\r\n if(mark[p.v]) continue;\r\n mark[p.v] = true;\r\n for(int i = st[p.v]; i != -1; i = next[i]) {\r\n int v = to[i];\r\n if(mark[v]) continue;\r\n if(dis[v] > p.dis + 1) {\r\n dis[v] = p.dis + 1;\r\n q.push(Node(v, dis[v]));\r\n }\r\n }\r\n }\r\n}\r\n\r\nint main() {\r\n while(true){\r\n scanf(\""%d%d%d\"", &L, &R, &C);\r\n if(L == 0 && R == 0 && C == 0) break;\r\n totedge = 0;\r\n memset(st, -1, sizeof(st));\r\n for(int i = 1; i <= L; i++)\r\n for(int j = 1; j <= R; j++) {\r\n scanf(\""%s\"", a + 1);\r\n for(int k = 1; k <= C; k++) {\r\n if(a[k] == '#') G[i][j][k] = 1;\r\n else G[i][j][k] = 0;\r\n if(a[k] == 'S') stl = i, str = j, stc = k;\r\n if(a[k] == 'E') edl = i, edr = j, edc = k;\r\n }\r\n }\r\n for(int i = 1; i <= L; i++)\r\n for(int j = 1; j <= R; j++)\r\n for(int k = 1; k <= C; k++) {\r\n if(G[i][j][k] == 1) continue;\r\n if(k != C && G[i][j][k + 1] != 1) addedge(id(i, j, k), id(i, j, k + 1));\r\n if(k != 1 && G[i][j][k - 1] != 1) addedge(id(i, j, k), id(i, j, k - 1));\r\n if(j != R && G[i][j + 1][k] != 1) addedge(id(i, j, k), id(i, j + 1, k));\r\n if(j != 1 && G[i][j - 1][k] != 1) addedge(id(i, j, k), id(i, j - 1, k));\r\n if(i != L && G[i + 1][j][k] != 1) addedge(id(i, j, k), id(i + 1, j, k));\r\n if(i != 1 && G[i - 1][j][k] != 1) addedge(id(i, j, k), id(i - 1, j, k));\r\n }\r\n finddis(id(stl, str, stc));\r\n if(mark[id(edl, edr, edc)]) printf(\""%d\\n\"", dis[id(edl, edr, edc)]);\r\n else puts(\""No dress to appreciate!\"");\r\n }\r\n return 0;\r\n}\r\n",ACCEPTED,95,892 1106897632573472768,bd7258a4bb200839fe38448030ddc52f82b64944f23cccac8bcac582ba3082ab,2019-03-16 20:38:55,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include\r\n#include\r\nusing namespace std;\r\n\r\nchar dun[30][30][30];\r\nchar state[30][30][30]={0};\r\nint minlen=27000;\r\nint through(int l,int r,int c,int ll,int rr,int cc, int dir){\r\n switch(dir){\r\n case 0:\r\n if(rr-1>=0){\r\n if(dun[ll][rr-1][cc]!='#'&&state[ll][rr-1][cc]==0)return 1;\r\n else return 0;\r\n }\r\n else return 0;\r\n break;\r\n case 1:\r\n if(rr+1=0){\r\n if(dun[ll][rr][cc-1]!='#'&&state[ll][rr][cc-1]==0)return 1;\r\n else return 0;\r\n }\r\n else return 0;\r\n break;\r\n case 3:\r\n if(cc+1=0){\r\n if(dun[ll-1][rr][cc]!='#'&&state[ll-1][rr][cc]==0)return 1;\r\n else return 0;\r\n }\r\n else return 0;\r\n break;\r\n case 5:\r\n if(ll+10) cango=1;\r\n state[ll][rr-1][cc]=0;\r\n }\r\n break;\r\n case 1:\r\n if(step0)cango =1;\r\n\r\n state[ll][rr+1][cc]=0;\r\n }\r\n break;\r\n case 2:\r\n if(step0)cango=1;\r\n\r\n state[ll][rr][cc-1]=0;\r\n }\r\n break;\r\n case 3:\r\n if(step0)cango =1;\r\n\r\n state[ll][rr][cc+1]=0;\r\n }\r\n break;\r\n case 4:\r\n if(step0)cango = 1;\r\n\r\n state[ll-1][rr][cc]=0;\r\n }\r\n break;\r\n case 5:\r\n if(step0)cango = 1;\r\n\r\n state[ll+1][rr][cc]=0;\r\n }\r\n break;\r\n }\r\n }\r\n }\r\n if(cango)return 1;\r\n else return 0;\r\n}\r\nint main(){\r\n int l,r,c;\r\n cin>>l>>r>>c;\r\n while(l>0||r>0||c>0){\r\n for(int k=0;kbeg;\r\n vectoren;\r\n for(int k=0;k>ch;\r\n dun[k][i][j]=ch;\r\n if(ch=='S'){\r\n beg.push_back(k);\r\n beg.push_back(i);\r\n beg.push_back(j);\r\n }\r\n }\r\n }\r\n\r\n }\r\n if(deep(l,r,c,beg[0],beg[1],beg[2],0)) cout<>l>>r>>c;\r\n }\r\n return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,0,0 1106900638534680576,bd7258a4bb200839fe38448030ddc52f82b64944f23cccac8bcac582ba3082ab,2019-03-16 20:50:52,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include\r\n#include\r\nusing namespace std;\r\n\r\nchar dun[30][30][30];\r\nchar state[30][30][30]={0};\r\nint minlen=27000;\r\nvector through(int l,int r,int c,int ll,int rr,int cc, int dir){\r\n vectorsite;\r\n switch(dir){\r\n case 0:\r\n if(rr-1>=0){\r\n\r\n if(dun[ll][rr-1][cc]!='#'&&state[ll][rr-1][cc]==0){\r\n\r\n site.push_back(ll);\r\n site.push_back(rr-1);\r\n site.push_back(cc);\r\n\r\n }\r\n\r\n }\r\n break;\r\n case 1:\r\n if(rr+1=0){\r\n if(dun[ll][rr][cc-1]!='#'&&state[ll][rr][cc-1]==0){\r\n\r\n site.push_back(ll);\r\n site.push_back(rr);\r\n site.push_back(cc-1);\r\n\r\n }\r\n }\r\n break;\r\n case 3:\r\n if(cc+1=0){\r\n if(dun[ll-1][rr][cc]!='#'&&state[ll-1][rr][cc]==0){\r\n\r\n site.push_back(ll-1);\r\n site.push_back(rr);\r\n site.push_back(cc);\r\n\r\n }\r\n }\r\n break;\r\n case 5:\r\n if(ll+1site;\r\n site=through(l,r,c,ll,rr,cc,i);\r\n if(site.size()==3){\r\n if(step0) cango=1;\r\n state[site[0]][site[1]][site[2]]=0;\r\n }\r\n }\r\n }\r\n if(cango)return 1;\r\n else return 0;\r\n}\r\nint main(){\r\n int l,r,c;\r\n cin>>l>>r>>c;\r\n while(l>0||r>0||c>0){\r\n for(int k=0;kbeg;\r\n vectoren;\r\n for(int k=0;k>ch;\r\n dun[k][i][j]=ch;\r\n if(ch=='S'){\r\n beg.push_back(k);\r\n beg.push_back(i);\r\n beg.push_back(j);\r\n }\r\n }\r\n }\r\n\r\n }\r\n if(deep(l,r,c,beg[0],beg[1],beg[2],0)) cout<>l>>r>>c;\r\n }\r\n return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,0,0 1106901889792032768,658bd8dcb31acde9c1ad96463031827ea1a2efa78c348a4eabdac0c470950cef,2019-03-16 20:55:50,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include\r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\n#define For(i,a,b) for(int i=a;i=a;i--)\r\nusing namespace std;\r\nint l, r, c;\r\nint sx, sy, el, ex, ey, sl;\r\nint map[32][32][32];\r\nint dir[][3] = { 1,0,0,-1,0,0,0,1,0,0,-1,0,0,0,1,0,0,-1 };\r\nint ans = 0x3f3f3f3f;\r\nvoid dfs( int lev, int x, int y,int step)\r\n{\r\n\tif (lev < 0 || y < 0 || x < 0 || x >= r || y >= c || lev >= l)return;\r\n\tif (step >= ans || !map[lev][x][y])return;\r\n\telse if (lev == el&&x == ex&&y == ey)ans = step;\r\n\r\n\tFor(i, 0, 6)\r\n\t{\r\n\t\tmap[lev][x][y] = 0;\r\n\t\tdfs(lev + dir[i][0], x + dir[i][1], y + dir[i][2],step+1);\r\n\t\tmap[lev][x][y] = 1;\r\n\t}\r\n}\r\n\r\nint main()\r\n{\r\n\tios::sync_with_stdio(false);\r\n\r\n\twhile (cin >> l >> r >> c)\r\n\t{\r\n\t\tif (l == 0 && r == 0 && c == 0)break;\r\n\t\tans = 0x3f3f3f3f;\r\n\t\tmemset(map, 0, sizeof(map));\r\n\t\tFor(i, 0, l)\r\n\t\t\tFor(j, 0, r)\r\n\t\t\tFor(k, 0, c)\r\n\t\t{\r\n\t\t\tchar tmp;\r\n\t\t\tcin >> tmp;\r\n\t\t\tif (tmp == '.' || tmp == 'S' || tmp == 'E')\r\n\t\t\t\tmap[i][j][k] = 1;\r\n\t\t\tif (tmp == 'S')\r\n\t\t\t{\r\n\t\t\t\tsx = j;sy = k;sl = i;\r\n\t\t\t}\r\n\t\t\tif (tmp == 'E')\r\n\t\t\t{\r\n\t\t\t\tex = j;ey = k;el = i;\r\n\t\t\t}\r\n\t\t}\r\n\t\tdfs(sl, sx, sy, 0);\r\n\t\tif (ans == 0x3f3f3f3f)cout << \""No dress to appreciate!\\n\"";\r\n\t\telse cout << ans<<'\\n';\r\n\t}\r\n\t\r\n}",TIME_LIMIT_EXCEEDED,0,0 1106902794583097344,658bd8dcb31acde9c1ad96463031827ea1a2efa78c348a4eabdac0c470950cef,2019-03-16 20:59:26,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include\r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\n#define For(i,a,b) for(int i=a;i=a;i--)\r\nusing namespace std;\r\nint l, r, c;\r\nint sx, sy, el, ex, ey, sl;\r\nint map[32][32][32],ac[32][32][32];\r\nint dir[][3] = { 1,0,0,-1,0,0,0,1,0,0,-1,0,0,0,1,0,0,-1 };\r\nint ans = 0x3f3f3f3f;\r\nvoid dfs( int lev, int x, int y,int step)\r\n{\r\n\tif (lev < 0 || y < 0 || x < 0 || x >= r || y >= c || lev >= l)return;\r\n\tif (step >= ans || !map[lev][x][y]||ac[lev][x][y]<=step)return;\r\n\telse if (lev == el&&x == ex&&y == ey)ans = step;\r\n\r\n\tac[lev][x][y] = step;\r\n\r\n\tFor(i, 0, 6)\r\n\t{\r\n\t\tmap[lev][x][y] = 0;\r\n\t\tdfs(lev + dir[i][0], x + dir[i][1], y + dir[i][2],step+1);\r\n\t\tmap[lev][x][y] = 1;\r\n\t}\r\n}\r\n\r\nint main()\r\n{\r\n\tios::sync_with_stdio(false);\r\n\r\n\twhile (cin >> l >> r >> c)\r\n\t{\r\n\t\tif (l == 0 && r == 0 && c == 0)break;\r\n\t\tans = 0x3f3f3f3f;\r\n\t\tmemset(map, 0, sizeof(map));\r\n\t\tmemset(ac, 0x3f3f3f3f, sizeof(ac));\r\n\t\tFor(i, 0, l)\r\n\t\t\tFor(j, 0, r)\r\n\t\t\tFor(k, 0, c)\r\n\t\t{\r\n\t\t\tchar tmp;\r\n\t\t\tcin >> tmp;\r\n\t\t\tif (tmp == '.' || tmp == 'S' || tmp == 'E')\r\n\t\t\t\tmap[i][j][k] = 1;\r\n\t\t\tif (tmp == 'S')\r\n\t\t\t{\r\n\t\t\t\tsx = j;sy = k;sl = i;\r\n\t\t\t}\r\n\t\t\tif (tmp == 'E')\r\n\t\t\t{\r\n\t\t\t\tex = j;ey = k;el = i;\r\n\t\t\t}\r\n\t\t}\r\n\t\tdfs(sl, sx, sy, 0);\r\n\t\tif (ans == 0x3f3f3f3f)cout << \""No dress to appreciate!\\n\"";\r\n\t\telse cout << ans<<'\\n';\r\n\t}\r\n\t\r\n}",TIME_LIMIT_EXCEEDED,0,0 1106903220242038784,658bd8dcb31acde9c1ad96463031827ea1a2efa78c348a4eabdac0c470950cef,2019-03-16 21:01:07,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include\r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\n#define For(i,a,b) for(int i=a;i=a;i--)\r\nusing namespace std;\r\nint l, r, c;\r\nint sx, sy, el, ex, ey, sl;\r\nint map[32][32][32],ac[32][32][32];\r\nint dir[][3] = { 1,0,0,-1,0,0,0,1,0,0,-1,0,0,0,1,0,0,-1 };\r\nint ans = 0x3f3f3f3f;\r\nvoid dfs( int lev, int x, int y,int step)\r\n{\r\n\tif (ac[lev][x][y] <= step||lev < 0 || y < 0 || x < 0 || x >= r || y >= c || lev >= l)return;\r\n\tif (step >= ans || !map[lev][x][y]||ac[lev][x][y]<=step)return;\r\n\telse if (lev == el&&x == ex&&y == ey)ans = step;\r\n\r\n\tac[lev][x][y] = step;\r\n\r\n\tFor(i, 0, 6)\r\n\t{\r\n\t\tmap[lev][x][y] = 0;\r\n\t\tdfs(lev + dir[i][0], x + dir[i][1], y + dir[i][2],step+1);\r\n\t\tmap[lev][x][y] = 1;\r\n\t}\r\n}\r\n\r\nint main()\r\n{\r\n\tios::sync_with_stdio(false);\r\n\r\n\twhile (cin >> l >> r >> c)\r\n\t{\r\n\t\tif (l == 0 && r == 0 && c == 0)break;\r\n\t\tans = 0x3f3f3f3f;\r\n\t\tmemset(map, 0, sizeof(map));\r\n\t\tmemset(ac, 0x3f3f3f3f, sizeof(ac));\r\n\t\tFor(i, 0, l)\r\n\t\t\tFor(j, 0, r)\r\n\t\t\tFor(k, 0, c)\r\n\t\t{\r\n\t\t\tchar tmp;\r\n\t\t\tcin >> tmp;\r\n\t\t\tif (tmp == '.' || tmp == 'S' || tmp == 'E')\r\n\t\t\t\tmap[i][j][k] = 1;\r\n\t\t\tif (tmp == 'S')\r\n\t\t\t{\r\n\t\t\t\tsx = j;sy = k;sl = i;\r\n\t\t\t}\r\n\t\t\tif (tmp == 'E')\r\n\t\t\t{\r\n\t\t\t\tex = j;ey = k;el = i;\r\n\t\t\t}\r\n\t\t}\r\n\t\tdfs(sl, sx, sy, 0);\r\n\t\tif (ans == 0x3f3f3f3f)cout << \""No dress to appreciate!\\n\"";\r\n\t\telse cout << ans<<'\\n';\r\n\t}\r\n\t\r\n}",TIME_LIMIT_EXCEEDED,0,0 1106907502857109504,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 21:18:08,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[35][35][35],vis[35][35][35];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt{zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt{zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt{zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt{zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt{zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt{zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return 0;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f) printf(\""%d\\n\"",f);\r\n else puts(\""No dress to appreciate!\"");\r\n }\r\n return 0;\r\n}\r\n",WRONG_ANSWER,5,756 1106907942852182016,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 21:19:53,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[35][35][35],vis[35][35][35];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt{zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt{zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt{zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt{zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt{zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt{zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return 0;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",WRONG_ANSWER,5,764 1106908337326473216,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 21:21:27,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[35][35][35],vis[35][35][35];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt{zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt{zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt{zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt{zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt{zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt{zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return 0;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",WRONG_ANSWER,7,740 1106912195054354432,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 21:36:47,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[35][35][35],vis[35][35][35];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt{zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt{zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt{zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt{zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt{zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt{zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",WRONG_ANSWER,5,640 1106912685766950912,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 21:38:44,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[305][305][305],vis[305][305][305];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt{zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt{zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt{zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt{zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt{zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt{zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",MEMORY_LIMIT_EXCEEDED,0,0 1106912753324605440,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 21:39:00,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[39][39][39],vis[39][39][39];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt{zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt{zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt{zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt{zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt{zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt{zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",WRONG_ANSWER,4,896 1106913718358458368,bd7258a4bb200839fe38448030ddc52f82b64944f23cccac8bcac582ba3082ab,2019-03-16 21:42:50,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include\r\n#include\r\nusing namespace std;\r\n\r\nchar dun[30][30][30];\r\nchar state[30][30][30]={0};\r\nint minlen=27000;\r\nvector through(int l,int r,int c,int ll,int rr,int cc, int dir){\r\n vectorsite;\r\n switch(dir){\r\n case 0:\r\n if(rr-1>=0){\r\n\r\n if(dun[ll][rr-1][cc]!='#'&&state[ll][rr-1][cc]==0){\r\n\r\n site.push_back(ll);\r\n site.push_back(rr-1);\r\n site.push_back(cc);\r\n\r\n }\r\n\r\n }\r\n break;\r\n case 1:\r\n if(rr+1=0){\r\n if(dun[ll][rr][cc-1]!='#'&&state[ll][rr][cc-1]==0){\r\n\r\n site.push_back(ll);\r\n site.push_back(rr);\r\n site.push_back(cc-1);\r\n\r\n }\r\n }\r\n break;\r\n case 3:\r\n if(cc+1=0){\r\n if(dun[ll-1][rr][cc]!='#'&&state[ll-1][rr][cc]==0){\r\n\r\n site.push_back(ll-1);\r\n site.push_back(rr);\r\n site.push_back(cc);\r\n\r\n }\r\n }\r\n break;\r\n case 5:\r\n if(ll+1=minlen-1) return 0;\r\n state[ll][rr][cc]=1;\r\n int cango=0;\r\n\r\n if(dun[ll][rr][cc]=='E'){\r\n cango=1;\r\n if(stepsite;\r\n site=through(l,r,c,ll,rr,cc,i);\r\n if(site.size()==3){\r\n\r\n if(deep(l,r,c,site[0],site[1],site[2],step+1)>0) cango=1;\r\n state[site[0]][site[1]][site[2]]=0;\r\n\r\n }\r\n }\r\n if(cango)return 1;\r\n else return 0;\r\n}\r\nint main(){\r\n int l,r,c;\r\n cin>>l>>r>>c;\r\n while(l>0||r>0||c>0){\r\n for(int k=0;kbeg;\r\n vectoren;\r\n for(int k=0;k>ch;\r\n dun[k][i][j]=ch;\r\n if(ch=='S'){\r\n beg.push_back(k);\r\n beg.push_back(i);\r\n beg.push_back(j);\r\n }\r\n }\r\n }\r\n\r\n }\r\n if(deep(l,r,c,beg[0],beg[1],beg[2],0)) cout<>l>>r>>c;\r\n }\r\n return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,0,0 1106917950683824128,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 21:59:39,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[45][45][45],vis[45][45][45];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt{zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt{zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt{zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt{zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt{zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt{zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",WRONG_ANSWER,4,1024 1106918194960089088,bd7258a4bb200839fe38448030ddc52f82b64944f23cccac8bcac582ba3082ab,2019-03-16 22:00:37,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include\r\n#include\r\nusing namespace std;\r\n\r\nchar dun[30][30][30];\r\nchar state[30][30][30]={0};\r\nint minlen=27000;\r\nvector through(int l,int r,int c,int ll,int rr,int cc, int dir){\r\n vectorsite;\r\n switch(dir){\r\n case 0:\r\n if(rr-1>=0){\r\n\r\n if(dun[ll][rr-1][cc]!='#'&&state[ll][rr-1][cc]==0){\r\n\r\n site.push_back(ll);\r\n site.push_back(rr-1);\r\n site.push_back(cc);\r\n\r\n }\r\n\r\n }\r\n break;\r\n case 1:\r\n if(rr+1=0){\r\n if(dun[ll][rr][cc-1]!='#'&&state[ll][rr][cc-1]==0){\r\n\r\n site.push_back(ll);\r\n site.push_back(rr);\r\n site.push_back(cc-1);\r\n\r\n }\r\n }\r\n break;\r\n case 3:\r\n if(cc+1=0){\r\n if(dun[ll-1][rr][cc]!='#'&&state[ll-1][rr][cc]==0){\r\n\r\n site.push_back(ll-1);\r\n site.push_back(rr);\r\n site.push_back(cc);\r\n\r\n }\r\n }\r\n break;\r\n case 5:\r\n if(ll+1=minlen-1) return 0;\r\n for(int i=0;i<6;i++){\r\n vectorsite;\r\n site=through(l,r,c,ll,rr,cc,i);\r\n if(site.size()==3){\r\n\r\n if(deep(l,r,c,site[0],site[1],site[2],step+1)>0) cango=1;\r\n state[site[0]][site[1]][site[2]]=0;\r\n\r\n }\r\n }\r\n if(cango)return 1;\r\n else return 0;\r\n}\r\nint main(){\r\n int l,r,c;\r\n cin>>l>>r>>c;\r\n while(l>0||r>0||c>0){\r\n for(int k=0;kbeg;\r\n vectoren;\r\n for(int k=0;k>ch;\r\n dun[k][i][j]=ch;\r\n if(ch=='S'){\r\n beg.push_back(k);\r\n beg.push_back(i);\r\n beg.push_back(j);\r\n }\r\n }\r\n }\r\n\r\n }\r\n if(deep(l,r,c,beg[0],beg[1],beg[2],0)) cout<>l>>r>>c;\r\n }\r\n return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,0,0 1106919113051291648,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 22:04:16,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[45][45][45],vis[45][45][45];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt{zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt{zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt{zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt{zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt{zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt{zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",WRONG_ANSWER,5,1400 1106919408615505920,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 22:05:27,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[45][45][45],vis[45][45][45];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt={zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt={zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt={zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt={zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt={zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt={zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",WRONG_ANSWER,5,1024 1106920297321414656,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-16 22:08:59,C++,0.0,1106826559182151680,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[45][45][45],vis[45][45][45];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]) {\r\n struct point ttt={zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]) {\r\n struct point ttt={zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]) {\r\n struct point ttt={zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]) {\r\n struct point ttt={zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]) {\r\n struct point ttt={zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]) {\r\n struct point ttt={zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",MEMORY_LIMIT_EXCEEDED,0,0 1107155648526893056,0e1b097a1bace83c15a03773a6c8cbfa428308c70068e9c91719eb8bf3035fed,2019-03-17 13:44:11,C++,0.0,1106930775586455560,1106090088947060736,1041335204213755904,"#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nchar map[32][32][32];\r\nstruct P {\r\n\tint x;\r\n\tint y;\r\n\tint z;\r\n\tint step;\r\n\tP(int x, int y, int z, int step) :x(x), y(y), z(z), step(step) {}\r\n};\r\nint L, R, C;\r\nqueue

q;\r\nint Bi, Bj, Bk;\r\nint Ei, Ej, Ek;\r\n\r\nvoid map_in() {\r\n\tfor (int i = 0;i < L;i++) {\r\n\t\tfor (int j = 0;j < R;j++) {\r\n\t\t\tfor (int k = 0;k < C;k++) {\r\n\t\t\t\tcin >> map[i][j][k];\r\n\t\t\t\tif (map[i][j][k] == 'S') {\r\n\t\t\t\t\tBi = i;Bj = j;Bk = k;\r\n\t\t\t\t}\r\n\t\t\t\tif (map[i][j][k] == 'E') {\r\n\t\t\t\t\tEi = i;Ej = j;Ek = k;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tgetchar();\r\n\t\t}\r\n\t\tgetchar();\r\n\t}\r\n}\r\nint main() {\r\n\twhile (cin >> L >> R >> C && (L || R || C)) {\r\n\t\tmap_in();\r\n\t\tq.push(P(Bi, Bj, Bk, 0));\r\n\t\tmap[Bi][Bj][Bk] = '#';\r\n\t\tint st = 0;\r\n\t\twhile (!q.empty()) {\r\n\t\t\tP temp = q.front();\r\n\t\t\tif (temp.x == Ei && temp.y == Ej && temp.z == Ek) {\r\n\t\t\t\tst = 1;\r\n\t\t\t\tcout << temp.step << endl;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\r\n\t\t\tif (temp.x + 1 < L && map[temp.x + 1][temp.y][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x + 1, temp.y, temp.z,temp.step + 1));\r\n\t\t\t\tmap[temp.x + 1][temp.y][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.x - 1 >= 0 && map[temp.x - 1][temp.y][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x - 1, temp.y, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x - 1][temp.y][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.y + 1 < R && map[temp.x][temp.y + 1][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y + 1, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x][temp.y + 1][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.y - 1 >= 0 && map[temp.x][temp.y - 1][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y - 1, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x + 1][temp.y][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.z + 1 < C && map[temp.x][temp.y][temp.z + 1] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y, temp.z + 1, temp.step + 1));\r\n\t\t\t\tmap[temp.x][temp.y][temp.z + 1] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.z - 1 >= 0 && map[temp.x][temp.y][temp.z - 1] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y, temp.z - 1, temp.step + 1));\r\n\t\t\t\tmap[temp.x][temp.y][temp.z - 1] = '#';\r\n\t\t\t}\r\n\t\t\tq.pop();\r\n\t\t}\r\n\t\tif (!st) {\r\n\t\t\tcout << \""No dress to appreciate!\"" << endl;\r\n\t\t}\r\n\t}\r\n}\r\n\r\n",WRONG_ANSWER,6,728 1107156315857436672,0e1b097a1bace83c15a03773a6c8cbfa428308c70068e9c91719eb8bf3035fed,2019-03-17 13:46:50,C++,0.0,1106930775586455560,1106090088947060736,1041335204213755904,"#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nchar map[32][32][32];\r\nstruct P {\r\n\tint x;\r\n\tint y;\r\n\tint z;\r\n\tint step;\r\n\tP(int x, int y, int z, int step) :x(x), y(y), z(z), step(step) {}\r\n};\r\nint L, R, C;\r\nqueue

q;\r\nint Bi, Bj, Bk;\r\nint Ei, Ej, Ek;\r\n\r\nvoid map_in() {\r\n\tfor (int i = 0;i < L;i++) {\r\n\t\tfor (int j = 0;j < R;j++) {\r\n\t\t\tfor (int k = 0;k < C;k++) {\r\n\t\t\t\tcin >> map[i][j][k];\r\n\t\t\t\tif (map[i][j][k] == 'S') {\r\n\t\t\t\t\tBi = i;Bj = j;Bk = k;\r\n\t\t\t\t}\r\n\t\t\t\tif (map[i][j][k] == 'E') {\r\n\t\t\t\t\tEi = i;Ej = j;Ek = k;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tgetchar();\r\n\t\t}\r\n\t\tgetchar();\r\n\t}\r\n}\r\nint main() {\r\n\twhile (cin >> L >> R >> C && (L || R || C)) {\r\n\t\tmap_in();\r\n\t\twhile (!q.empty()) {\r\n\t\t\tq.pop();\r\n\t\t}\r\n\t\tq.push(P(Bi, Bj, Bk, 0));\r\n\t\tmap[Bi][Bj][Bk] = '#';\r\n\t\tint st = 0;\r\n\t\twhile (!q.empty()) {\r\n\t\t\tP temp = q.front();\r\n\t\t\tif (temp.x == Ei && temp.y == Ej && temp.z == Ek) {\r\n\t\t\t\tst = 1;\r\n\t\t\t\tcout << temp.step << endl;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\r\n\t\t\tif (temp.x + 1 < L && map[temp.x + 1][temp.y][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x + 1, temp.y, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x + 1][temp.y][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.x - 1 >= 0 && map[temp.x - 1][temp.y][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x - 1, temp.y, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x - 1][temp.y][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.y + 1 < R && map[temp.x][temp.y + 1][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y + 1, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x][temp.y + 1][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.y - 1 >= 0 && map[temp.x][temp.y - 1][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y - 1, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x + 1][temp.y][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.z + 1 < C && map[temp.x][temp.y][temp.z + 1] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y, temp.z + 1, temp.step + 1));\r\n\t\t\t\tmap[temp.x][temp.y][temp.z + 1] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.z - 1 >= 0 && map[temp.x][temp.y][temp.z - 1] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y, temp.z - 1, temp.step + 1));\r\n\t\t\t\tmap[temp.x][temp.y][temp.z - 1] = '#';\r\n\t\t\t}\r\n\t\t\tq.pop();\r\n\t\t}\r\n\t\tif (!st) {\r\n\t\t\tcout << \""No dress to appreciate!\"" << endl;\r\n\t\t}\r\n\t}\r\n}\r\n\r\n",WRONG_ANSWER,5,384 1107157244891578368,0e1b097a1bace83c15a03773a6c8cbfa428308c70068e9c91719eb8bf3035fed,2019-03-17 13:50:31,C++,0.0,1106930775586455560,1106090088947060736,1041335204213755904,"#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nchar map[32][32][32];\r\nstruct P {\r\n\tint x;\r\n\tint y;\r\n\tint z;\r\n\tint step;\r\n\tP(int x, int y, int z, int step) :x(x), y(y), z(z), step(step) {}\r\n};\r\nint L, R, C;\r\nqueue

q;\r\nint Bi, Bj, Bk;\r\nint Ei, Ej, Ek;\r\n\r\nvoid map_in() {\r\n\tfor (int i = 0;i < L;i++) {\r\n\t\tfor (int j = 0;j < R;j++) {\r\n\t\t\tfor (int k = 0;k < C;k++) {\r\n\t\t\t\tcin >> map[i][j][k];\r\n\t\t\t\tif (map[i][j][k] == 'S') {\r\n\t\t\t\t\tBi = i;Bj = j;Bk = k;\r\n\t\t\t\t}\r\n\t\t\t\tif (map[i][j][k] == 'E') {\r\n\t\t\t\t\tEi = i;Ej = j;Ek = k;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tgetchar();\r\n\t\t}\r\n\t\tgetchar();\r\n\t}\r\n}\r\nint main() {\r\n\twhile (cin >> L >> R >> C && (L || R || C)) {\r\n\t\tmemset(map, 0, sizeof(map));\r\n\t\tmap_in();\r\n\t\twhile (!q.empty()) {\r\n\t\t\tq.pop();\r\n\t\t}\r\n\t\tq.push(P(Bi, Bj, Bk, 0));\r\n\t\tmap[Bi][Bj][Bk] = '#';\r\n\t\tint st = 0;\r\n\t\twhile (!q.empty()) {\r\n\t\t\tP temp = q.front();\r\n\t\t\tif (temp.x == Ei && temp.y == Ej && temp.z == Ek) {\r\n\t\t\t\tst = 1;\r\n\t\t\t\tcout << temp.step << endl;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\r\n\t\t\tif (temp.x + 1 < L && map[temp.x + 1][temp.y][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x + 1, temp.y, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x + 1][temp.y][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.x - 1 >= 0 && map[temp.x - 1][temp.y][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x - 1, temp.y, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x - 1][temp.y][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.y + 1 < R && map[temp.x][temp.y + 1][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y + 1, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x][temp.y + 1][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.y - 1 >= 0 && map[temp.x][temp.y - 1][temp.z] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y - 1, temp.z, temp.step + 1));\r\n\t\t\t\tmap[temp.x + 1][temp.y][temp.z] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.z + 1 < C && map[temp.x][temp.y][temp.z + 1] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y, temp.z + 1, temp.step + 1));\r\n\t\t\t\tmap[temp.x][temp.y][temp.z + 1] = '#';\r\n\t\t\t}\r\n\t\t\tif (temp.z - 1 >= 0 && map[temp.x][temp.y][temp.z - 1] != '#') {\r\n\t\t\t\tq.push(P(temp.x, temp.y, temp.z - 1, temp.step + 1));\r\n\t\t\t\tmap[temp.x][temp.y][temp.z - 1] = '#';\r\n\t\t\t}\r\n\t\t\tq.pop();\r\n\t\t}\r\n\t\tif (!st) {\r\n\t\t\tcout << \""No dress to appreciate!\"" << endl;\r\n\t\t}\r\n\t}\r\n}\r\n\r\n",WRONG_ANSWER,5,384 1111179212273496064,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-28 16:12:23,C++,0.0,1106930775586455560,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[45][45][45],vis[45][45][45];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]) {\r\n struct point ttt={zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]) {\r\n struct point ttt={zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]) {\r\n struct point ttt={zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]) {\r\n struct point ttt={zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]) {\r\n struct point ttt={zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]) {\r\n struct point ttt={zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = getchar();\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n getchar();\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}",MEMORY_LIMIT_EXCEEDED,0,0 1111605538872795136,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-29 20:26:27,C++,0.0,1106930775586455560,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[45][45][45],vis[45][45][45];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]) {\r\n struct point ttt={zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]) {\r\n struct point ttt={zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]) {\r\n struct point ttt={zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]) {\r\n struct point ttt={zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]) {\r\n struct point ttt={zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]) {\r\n struct point ttt={zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n char line[100];\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n gets(line);\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = line[k-1];\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}",COMPILE_ERROR,0,0 1111605678731862016,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-29 20:27:01,C++,0.0,1106930775586455560,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[45][45][45],vis[45][45][45];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]) {\r\n struct point ttt={zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]) {\r\n struct point ttt={zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]) {\r\n struct point ttt={zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]) {\r\n struct point ttt={zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]) {\r\n struct point ttt={zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]) {\r\n struct point ttt={zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n string line;\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n getline(cin,line);\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = line[k-1];\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}",MEMORY_LIMIT_EXCEEDED,0,0 1111606036170448896,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-29 20:28:26,C++,0.0,1106930775586455560,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[35][35][35],vis[35][35][35];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]) {\r\n struct point ttt={zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]) {\r\n struct point ttt={zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]) {\r\n struct point ttt={zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]) {\r\n struct point ttt={zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]) {\r\n struct point ttt={zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]) {\r\n struct point ttt={zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n string line;\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n getline(cin,line);\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = line[k-1];\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}",MEMORY_LIMIT_EXCEEDED,0,0 1111606510768529408,76e44f07f270418bc8e40de84d4c7ceba420cd7045269717b2518e314af83882,2019-03-29 20:30:19,C++,0.0,1106930775586455560,1106090088947060736,1041335204213755904,"#include \r\n#include\r\n#include\r\n#include\r\n#include\r\n#include\r\nusing namespace std;\r\n\r\nint sx,sy,sz,ez,ex,ey;\r\nstruct point{\r\n int z,x,y;\r\n int t;\r\n};\r\nint l,r,c;\r\nint mapp[45][45][45],vis[45][45][45];\r\nint bfs(int z,int x,int y)\r\n{\r\n queue dd;\r\n struct point t{z,x,y,0};\r\n dd.push(t); vis[z][x][y] = 1;\r\n while(!dd.empty())\r\n {\r\n int xt = dd.front().x,yt = dd.front().y,zt = dd.front().z,tt = dd.front().t;\r\n if(xt==ex&&yt==ey&&zt==ez) return tt;\r\n if(xt-1&&mapp[zt][xt-1][yt]&&!vis[zt][xt-1][yt]) {\r\n struct point ttt{zt,xt-1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt-1][yt] = 1;\r\n }\r\n if(xt+1<=r&&mapp[zt][xt+1][yt]&&!vis[zt][xt+1][yt]) {\r\n struct point ttt{zt,xt+1,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt+1][yt] = 1;\r\n }\r\n if(yt-1&&mapp[zt][xt][yt-1]&&!vis[zt][xt][yt-1]) {\r\n struct point ttt{zt,xt,yt-1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt-1] = 1;\r\n }\r\n if(yt+1<=c&&mapp[zt][xt][yt+1]&&!vis[zt][xt][yt+1]) {\r\n struct point ttt{zt,xt,yt+1,tt+1};\r\n dd.push(ttt);\r\n vis[zt][xt][yt+1] = 1;\r\n }\r\n if(zt+1<=l&&mapp[zt+1][xt][yt]&&!vis[zt+1][xt][yt]) {\r\n struct point ttt{zt+1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt+1][xt][yt] = 1;\r\n }\r\n if(zt-1&&mapp[zt-1][xt][yt]&&!vis[zt-1][xt][yt]) {\r\n struct point ttt{zt-1,xt,yt,tt+1};\r\n dd.push(ttt);\r\n vis[zt-1][xt][yt] = 1;\r\n }\r\n dd.pop();\r\n }\r\n return -1;\r\n}\r\nint main()\r\n{\r\n\r\n char ch;\r\n\r\n\r\n while(scanf(\""%d %d %d\"",&l,&r,&c))\r\n {\r\n if(l==0) break;\r\n getchar();\r\n string line;\r\n memset(mapp,0,sizeof mapp);\r\n memset(vis,0,sizeof vis);\r\n for(int i=1;i<=l;i++)\r\n {\r\n for(int j=1;j<=r;j++)\r\n {\r\n getline(cin,line);\r\n for(int k=1;k<=c;k++)\r\n {\r\n ch = line[k-1];\r\n if(ch=='.') mapp[i][j][k] = 1;\r\n if(ch=='#') mapp[i][j][k] = 0;\r\n if(ch=='S') {sx = j,sy = k,sz = i;mapp[i][j][k] = 1;}\r\n if(ch=='E') {ex = j,ey = k,ez = i;mapp[i][j][k] = 1;}\r\n }\r\n }\r\n getchar();\r\n }\r\n\r\n int f = bfs(sz,sx,sy);\r\n if(f!=-1) printf(\""%d\\n\"",f);\r\n else printf(\""No dress to appreciate!\\n\"");\r\n }\r\n return 0;\r\n}\r\n",WRONG_ANSWER,7,1148