uva1368 - DNA Consensus String
2013-07-13 18:26
274 查看
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #define maxlen 1100 using namespace std; char str[60][maxlen],ans[maxlen]; char dna[]= {'A','C','G','T'}; int n,m,t; int main () { scanf("%d",&t); while(t--) { scanf("%d%d",&m,&n); gets(ans); for(int i=0; i<m; ++i) { gets(str[i]); } int sum=0; for(int i=0; i<n; ++i) { int index=0; int temp=m+10; for(int k=4; k>=0; --k) { int ham=0; for(int j=0; j<m; ++j) { ham=ham+(dna[k]!=str[j][i]); } if(temp>=ham) { temp=ham; index=k; } } sum+=temp; ans[i]=dna[index]; } ans ='\0'; printf("%s\n%d\n",ans,sum); } }View Code
相关文章推荐
- UVa 1368 - DNA Consensus String
- Uva1368 - DNA Consensus String
- 小紫书 习题 3-7(UVA 1368) DNA序列(DNA Consensus String)
- uva 1368 DNA Consensus String 字符串
- DNA序列(DNA Consensus String, ACM/ICPC seoul 2006, UVa 1368)
- Seoul 2006 / UVa 1368 DNA Consensus String (字符串处理)
- (入门)uva 1368 DNA Consensus String
- UVA 1368 - DNA Consensus String
- uva 1368 - DNA Consensus String
- UVa 1368 DNA Consensus String(DNA序列)
- UVa 1368 - DNA Consensus String
- UVa1368 DNA Consensus String
- UVA - 1368 DNA Consensus String :简单字符串处理
- (uva)1368 DNA Consensus String(map)
- UVA - 1368 - DNA Consensus String (字符串处理)
- 3-7 DNA序列(DNA Consensus String, ACM/ICPC Seoul 2006, UVa1368)
- UVA 1368-DNA Consensus String
- UVa 1368 - DNA Consensus String(贪心)
- UVA - 1368 DNA Consensus String
- Problem 017 ——UVa 1368 -DNA Consensus String