#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