Uva1368

#include
#include
int main(){
    int m,n,distance=0,i,j,letter,number,times;
    char str[50][1001],answer[1001],count[4];
    scanf("%d",×);
    while(times--){
    distance=0;
    scanf("%d%d",&m,&n);
    getchar();//吃空格
    memset(str,0,sizeof(str));
    memset(answer,0,sizeof(answer));
    for(i=0;istr[i]);
    for(j=0;j//统计各个字母个数
        memset(count,0,sizeof(count));
        for(i=0;iswitch(str[i][j]){
                case 'A':{
                    count[0]++;
                    break;
                }
                case 'C':{
                    count[1]++;
                    break;
                }
                case 'G':{
                    count[2]++;
                    break;
                }
                case 'T':{
                    count[3]++;
                    break;
                }
            }
        }

        //找到最优的字母
        number=0;
        for(letter=3;letter>=0;letter--){
            if(count[letter]>=count[number])
                number=letter;
        }
        switch(number){
            case 0:{
                answer[j]='A';
                break;
            }
            case 1:{
                answer[j]='C';
                break;
            }
            case 2:{
                answer[j]='G';
                break;
            }
            case 3:{
                answer[j]='T';
                break;
            }
        }
        distance=distance+m-count[number];
    }
    printf("%s\n%d\n",answer,distance);
}    return 0;
}