1764.cpp

哈尔滨工业大学ACM 竞赛网上在线试题集锦的源代码

/*  This Code is Submitted by wywcgs for Problem 1764 on 2005-03-09 at 12:21:37 */ 
#include <stdio.h>

int main()
{
    int a, b[21], length, flag, i;
    
    while(1){
        flag = 1;
        for(i = 0; i < 21; i++){
            b[i] = 0;
        }
        for(length = 0; (length < 21) && (flag != 0); length++){
            a = getchar();
            switch(a){
                case '\n':
                    flag  = 0;
                    length--;
                    break;
                case 'B': case 'F': case 'P': case 'V':
                    b[length] = 1;
                    break;
                case 'C': case 'G': case 'J': case 'K':
                case 'Q': case 'S': case 'X': case 'Z':
                    b[length] = 2;
                    break;
                case 'D': case 'T':
                    b[length] = 3;
                    break;
                case 'L':
                    b[length] = 4;
                    break;
                case 'M': case 'N':
                    b[length] = 5;
                    break;
                case 'R':
                    b[length] = 6;
                    break;
                case EOF:
                    return 0;
                default:
                    b[length] = 0;
                    break;
            }
        }
        for(i = 0; i < length; i++){
            if(i == 0){
                if(b[0] != 0){
                    printf("%d", b[0]);
                }
            }else{
                if((b[i] != b[i-1]) && (b[i] != 0)){
                    printf("%d", b[i]);
                }
            }
        }
        printf("\n");
    }

    return 0;
}