{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Genographic项目是IBM与国家地理学会之间的研究合作伙伴关系,该合作伙伴正在分析数十万贡献者的DNA,以绘制地球的分布图。\n\n作为IBM研究人员,您的任务是编写一个程序,该程序将在给定的DNA片段之间找到共同点,这些片段可以与单个调查信息相关联以识别新的遗传标记。\n\n通过在分子中发现氮碱基的顺序列出DNA碱基序列,可以注意到DNA碱基序列。有四个碱基:腺嘌呤(A),胸腺嘧啶(T),鸟嘌呤(G)和胞嘧啶(C)。6个碱基的DNA序列可以表示为TAGACC。\n\n给定一组DNA碱基序列,请确定出现在所有序列中的最长碱基序列。"}},{"title":"Input","value":{"format":"MD","content":"该问题的输入将从包含单个整数n的行开始,该整数指示数据集的数量。每个数据集都包含以下数据:\n- 单个正整数m(2 \u003c\u003d m \u003c\u003d 10)指示此数据集中的碱基序列数。\n- m行,每个行包含一个由60个碱基组成的单个碱基序列。"}},{"title":"Output","value":{"format":"MD","content":"对于输入中的每个数据集,输出所有给定碱基序列共有的最长碱基子序列。如果最长的公共子序列的长度小于3个碱基,则显示字符串“no significant commonalities”。如果存在多个最长长度相同的子序列,则仅输出按字典序最小的子序列。"}},{"title":"Sample Input","value":{"format":"MD","content":"\u003cpre class\u003d\"sio\"\u003e3\n2\nGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\n3\nGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA\nGATACTAGATACTAGATACTAGATACTAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA\nGATACCAGATACCAGATACCAGATACCAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA\n3\nCATCATCATCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC\nACATCATCATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\nAACATCATCATTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"MD","content":"\u003cpre class\u003d\"sio\"\u003eno significant commonalities\nAGATAC\nCATCATCAT\n\u003c/pre\u003e"}}]}