poj 3080 Blue Jeans
来源:互联网 发布:淘宝客推广位是什么 编辑:程序博客网 时间:2024/04/27 22:54
Description
The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated.
As an IBM researcher, you have been tasked with writing a program that will find commonalities amongst given snippets of DNA that can be correlated with individual survey information to identify new genetic markers.
A DNA base sequence is noted by listing the nitrogen bases in the order in which they are found in the molecule. There are four bases: adenine (A), thymine (T), guanine (G), and cytosine (C). A 6-base DNA sequence could be represented as TAGACC.
Given a set of DNA base sequences, determine the longest series of bases that occurs in all of the sequences.
As an IBM researcher, you have been tasked with writing a program that will find commonalities amongst given snippets of DNA that can be correlated with individual survey information to identify new genetic markers.
A DNA base sequence is noted by listing the nitrogen bases in the order in which they are found in the molecule. There are four bases: adenine (A), thymine (T), guanine (G), and cytosine (C). A 6-base DNA sequence could be represented as TAGACC.
Given a set of DNA base sequences, determine the longest series of bases that occurs in all of the sequences.
Input
Input to this problem will begin with a line containing a single integer n indicating the number of datasets. Each dataset consists of the following components:
- A single positive integer m (2 <= m <= 10) indicating the number of base sequences in this dataset.
- m lines each containing a single base sequence consisting of 60 bases.
Output
For each dataset in the input, output the longest base subsequence common to all of the given base sequences. If the longest common subsequence is less than three bases in length, display the string "no significant commonalities" instead. If multiple subsequences of the same longest length exist, output only the subsequence that comes first in alphabetical order.
Sample Input
32GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA3GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATAGATACTAGATACTAGATACTAGATACTAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAAGATACCAGATACCAGATACCAGATACCAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA3CATCATCATCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCACATCATCATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACATCATCATTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT
Sample Output
no significant commonalitiesAGATACCATCATCAT
#include <iostream>#include <cstdio>#include <cstring>#include <map>#include <cstdlib>#include <queue>#include <stack>#include <cmath>#define LL long long#define INF 0x3f3f3f3fusing namespace std;map<string,string> S;int main(){ char str[60]; while(gets(str) && str[0]) { char *p = str; char *q = strchr(str,' '); *q = 0; q++; int len1 = strlen(p); int len2 = strlen(q); string key,val; key.resize(len1); val.resize(len2); for(int i=0; i<len1; i++) key[i] = p[i]; for(int i=0; i<len2; i++) val[i] = q[i]; S[val] = key; } while(cin>>str) { int len = strlen(str); string key; key.resize(len); for(int i=0; i<len; i++) key[i] = str[i]; if(S[key].size()) cout<<S[key]<<endl; else printf("eh\n"); } return 0;}
0 0
- poj 3080 Blue Jeans
- poj 3080 Blue Jeans
- poj 3080 Blue Jeans
- poj 3080 Blue Jeans
- poj 3080 Blue Jeans
- POJ 3080 Blue Jeans
- POJ 3080 Blue Jeans
- POJ 3080 Blue Jeans
- POJ 3080 Blue Jeans
- Poj 3080 Blue Jeans
- POJ 3080 Blue Jeans
- POJ 3080 Blue Jeans
- POJ 3080 Blue Jeans
- poj 3080 Blue Jeans
- poj 3080 Blue jeans
- POJ 3080 Blue Jeans
- POJ 3080 Blue Jeans
- POJ 3080-Blue Jeans
- redis技术之旅三
- LeetCode Integer to Roman
- ReadString在UNICODE下中文乱码的解决办法(CHS)
- nodejs,async同步执行方法
- 量化投资:数据挖掘技术与实践(MATLAB版)——互动出版网
- poj 3080 Blue Jeans
- cocos2d-x-3.4 无法打开包含文件extensions/ExtensionExport.h
- ZigBee帧结构汇总(应用层(APS)、网络层(NWK),MAC层,物理层(PHY))
- hdu 1403 Longest Common Substring(求公共子串长度)
- iOS应用如何跳转到设置界面
- 常见第三方库及其功能简介
- div+css3做的小图标
- Android BaseAdapter 更新数据 notifyDataSetInvalidated() notifyDataSetChanged()
- hive的数据类型和数据模型