uva1368 - DNA Consensus String
来源:互联网 发布:php 获取客户端ip 编辑:程序博客网 时间:2024/06/05 19:17
链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4114
code
#include<stdio.h>char DNAs[55][1005];char result[1005];int main(){int caseN;scanf("%d",&caseN);while(caseN--){int m,n;scanf("%d %d",&m,&n);for(int i = 0 ; i < m ; i ++)scanf("%s",DNAs[i]);int numberA,numberC,numberT,numberG;int diff = 0;for(int j = 0 ; j < n ; j ++){numberA = numberC = numberG = numberT = 0;for(int i = 0 ; i < m; i ++){switch(DNAs[i][j]){case 'A': numberA++; break;case 'C': numberC++; break;case 'G': numberG++; break;case 'T': numberT++; break;}}char ch;if(numberA >= numberC && numberA >= numberG && numberA >= numberT){ch = 'A'; diff += m - numberA;}if(numberC > numberA && numberC >= numberG && numberC >= numberT){ch = 'C'; diff += m - numberC;}if(numberG > numberC && numberG > numberA && numberG >= numberT){ch = 'G'; diff += m - numberG;}if(numberT > numberC && numberT > numberG && numberT > numberA){ch = 'T'; diff += m - numberT;}result[j] = ch;}for(int i = 0 ; i < n ; i ++)printf("%c",result[i]);printf("\n%d\n", diff);}return 0;}
注意事项:
1)一开始对题目的理解没对位,以为是很复杂的字符串比较,后来从其他人那学习了方法,其实只要计算每一列出现最多的字母是哪一个,然后由这些出现最多字母组成的字符串肯定就是距离所有距离最短的字符串。
0 0
- uva1368 - DNA Consensus String
- Uva1368 DNA Consensus String
- Uva1368 - DNA Consensus String
- UVA1368- DNA Consensus String
- UVA1368 - DNA Consensus String
- uva1368 - DNA Consensus String
- uva1368 - DNA Consensus String
- [UVA1368]DNA Consensus String
- UVa1368 DNA Consensus String
- UVa1368 DNA Consensus String
- UVa1368 DNA Consensus String
- UVa1368 - DNA Consensus String
- UVa1368-DNA Consensus String
- UVa1368 DNA Consensus string AC
- 3.7 DNA Consensus String UVA1368
- UVa1368-DNA Consensus String-DNA序列
- UVa1368——DNA Consensus String
- 习题3-7 UVa1368 DNA Consensus String
- CCF 201403-4无线网络 (二维最短路)
- [华为MU203] 使用AT命令实现网络访问
- Can't open framebuffer device /dev/fb0 ------[TQ2440-QT-first]
- 计算机系统结构的总体概述
- 9-4第二次简单实验
- uva1368 - DNA Consensus String
- linux怎样从vi退出到shell
- 马戏团叠罗汉-之最长递增子序列
- 段中的实际数据大小与占用空间大小问题
- 读取视频文件
- OpenCV学习:找出人脸,同时比较两张图片中的人脸相似度
- 【转】android如何添加权限
- mysql 中文乱码总结
- CCF 201503-4网络延时 (树的直径)