POJ训练计划3080_Blue Jeans(串处理/暴力)
2015-03-02 11:10
302 查看
Blue Jeans
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.
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
Sample Output
Source
South Central USA 2006
解题报告
真心不想写这解题报告。。。
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 11542 | Accepted: 4962 |
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.
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
3 2 GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA 3 GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA GATACTAGATACTAGATACTAGATACTAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA GATACCAGATACCAGATACCAGATACCAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA 3 CATCATCATCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ACATCATCATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AACATCATCATTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT
Sample Output
no significant commonalities AGATAC CATCATCAT
Source
South Central USA 2006
解题报告
真心不想写这解题报告。。。
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; char str[12][100],ch[100],ans[100]; int main() { int t,i,j,k,n,maxl,f; cin>>t; while(t--) { memset(str,0,sizeof(str)); memset(ans,0,sizeof(ans)); cin>>n; maxl=0,f=0; for(i=0; i<n; i++) cin>>str[i]; for(i=0; i<58; i++) { for(j=3; j<=60-i; j++) { strncpy(ch,str[0]+i,j); ch[j]=0; f=0; for(k=1; k<n; k++) { if(strstr(str[k],ch)==NULL) { f=1; break; } } if(!f) { if(j>maxl) { maxl=j; strcpy(ans,ch); } else if(j==maxl) { if(strcmp(ch,ans)<0) strcpy(ans,ch); } } } } if(maxl) cout<<ans<<endl; else cout<<"no significant commonalities"<<endl; } return 0; }
相关文章推荐
- POJ训练计划3080_Blue Jeans(串处理/暴力)
- POJ训练计划1035_Spell checker(串处理/暴力)
- POJ训练计划1035_Spell checker(串处理/暴力)
- POJ 3080 Blue Jeans KMP+暴力
- POJ 3080 Blue Jeans 三种暴力法
- POJ 3080--Blue Jeans【KMP && 暴力枚举】
- POJ-3080 Blue Jeans(纯暴力)
- POJ-3080 Blue Jeans 暴力
- POJ 3080 Blue Jeans(暴力枚举+KMP 类似POJ 3450)
- poj 3080 Blue Jeans 字符串,暴力
- poj 3080 Blue Jeans 暴力
- POJ 3080 Blue Jeans(字符串处理)
- POJ 3080 Blue Jeans (KMP || 暴力)
- POJ 3080 Blue Jeans (暴力)
- [poj 3080]Blue Jeans[暴力枚举子串]
- POJ3080——Blue Jeans(暴力+字符串匹配)
- poj 3080 Blue Jeans (多串最长公共子串 暴力)
- POJ 3080 Blue Jeans(暴力)
- [KMP或者暴力]POJ 3080 Blue Jeans
- poj 3080 Blue Jeans【字符串处理+ 亮点是:字符串函数的使用】