Counting DNA Nucleotides

#include <stdio.h>
void main ()
{
	char s[9999];
	int i=0;
	int cnt_a=0;
	int cnt_c=0;
	int cnt_g=0;
	int cnt_t=0;
	puts("输入:\n");
	gets(s);
	for(i=0;s[i]!='\0';i++)
	{
		if (s[i] == 'A')
			cnt_a++;
		if (s[i] == 'C')
			cnt_c++;
		if (s[i] == 'G')
			cnt_g++;
		if (s[i] == 'T')
			cnt_t++;
	}
	printf("统计结果:%d %d %d %d",cnt_a,cnt_c,cnt_g,cnt_t);
}  

Problem
A string is simply an ordered collection of symbols selected from some alphabet and formed into a word; the length of a string is the number of symbols that it contains.
An example of a length 21 DNA string (whose alphabet contains the symbols 'A', 'C', 'G', and 'T') is "ATGCTTCAGAAAGGTCTTACG."
Given: A DNA string s of length at most 1000 nt.
Return: Four integers (separated by spaces) counting the respective number of times that the symbols 'A', 'C', 'G', and 'T' occur in s.
Sample Dataset
AGCTTTTCATTCTGACTGCAACGGGCAATATGTCTCTGTGTGGATTAAAAAAAGAGTGTCTGATAGCAGC
Sample Output

20 12 17 21



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值