UVA - 1368 - DNA Consensus String (字符串处理)
来源:互联网 发布:linux 将多个文件压缩 编辑:程序博客网 时间:2024/05/16 09:01
题意:给n串m长的DNA序列,要求从这n串序列中得出一个最相似的序列,若出现次数相同,按字典序,并输出与所给序列不同的总数
#include<stdio.h>#include<string.h>char dna[55][1005], res[1005];int main(){ int T; scanf("%d", &T); while(T--){ int n, m; int sum = 0, i, j; int maxn = 0, imax; scanf("%d%d",&n,&m); for(int i=0;i<n;i++) scanf("%s",dna[i]); for(i = 0; i < m; i++){ int a[4] = {0}; for(j = 0; j < n; j++){ switch(dna[j][i]){ case 'A': a[0]++; break; case 'C': a[1]++; break; case 'G': a[2]++; break; case 'T': a[3]++; break; } } for(j = 0; j < 4; j++){ if(a[j] > maxn){ maxn = a[j]; imax = j; } } sum = sum+n-maxn; maxn = 0; switch(imax){ case 0: res[i] = 'A'; break; case 1: res[i] = 'C'; break; case 2: res[i] = 'G'; break; case 3: res[i] = 'T'; break; } } res[i] = '\0'; printf("%s\n%d\n", res, sum); } return 0;}
0 0
- uva 1368 - DNA Consensus String(字符串处理)
- UVA - 1368 - DNA Consensus String (字符串处理)
- uva - 1368 - DNA Consensus String(字符串)
- 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(检索)
- 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
- 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
- Mybatis返回Map的一种实现
- Android代码混淆
- pycharm4.5.1 注册码 破解
- CVPR 2012 papers
- 黑马程序员_C语言基础_循环结构使用区别,9*9口诀表
- UVA - 1368 - DNA Consensus String (字符串处理)
- 开发规范
- Android面试题Activity部分
- ==和equals的区别
- CVPR 2011 papers
- 个人创业楷模:一个人,一个网站,5.75亿美元卖掉
- 支持客户感想
- vxworks解决64位的除法或者发生 undefined reference to `__udivsi3'的错误
- leetcode: Product of Array Except Self