PAT (Advanced Level) Practise 1092

最新推荐文章于 2019-01-14 18:19:32 发布

原创最新推荐文章于 2019-01-14 18:19:32 发布 · 294 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pat-A

PAT A 专栏收录该内容

8 篇文章

订阅专栏

本文介绍PAT(高级水平)练习题1092的解决方案，该题要求判断商店内的珠串是否包含所有顾客所需的珠子，并计算多余的珠子数量或缺失的数量。通过分析给出的珠子字符串，使用C语言实现算法。

PAT (Advanced Level) Practise 1092

1092. To Buy or Not to Buy (20)

Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the strings in whole pieces. Hence Eva must check whether a string in the shop contains all the beads she needs. She now comes to you for help: if the answer is “Yes”, please tell her the number of extra beads she has to buy; or if the answer is “No”, please tell her the number of beads missing from the string.

For the sake of simplicity, let’s use the characters in the ranges [0-9], [a-z], and [A-Z] to represent the colors. For example, the 3rd string in Figure 1 is the one that Eva would like to make. Then the 1st string is okay since it contains all the necessary beads with 8 extra ones; yet the 2nd one is not since there is no black bead and one less red bead.

这里写图片描述
Figure 1

Input Specification:

Each input file contains one test case. Each case gives in two lines the strings of no more than 1000 beads which belong to the shop owner and Eva, respectively.

Output Specification:

For each test case, print your answer in one line. If the answer is “Yes”, then also output the number of extra beads Eva has to buy; or if the answer is “No”, then also output the number of beads missing from the string. There must be exactly 1 space between the answer and the number.

Sample Input 1:
ppRYYGrrYBR2258
YrR8RrY
Sample Output 1:
Yes 8
Sample Input 2:
ppRYYGrrYB225
YrR8RrY
Sample Output 1:
No 2

编程实现

#include <stdio.h>

void get_bead(int beads[])
{
    char c;

    while ( (c = getchar()) != '\n' ) {
        if ( c >= '0' && c <= '9' ) 
                beads[c-'0']++;
        else if ( c >= 'a' && c <= 'z' )    
                beads[c-'a'+10]++;
        else if ( c >= 'A' && c <= 'Z' )
            beads[c-'A'+10+26]++;
    }
}

int main(void)
{
    int shop[62] = {0}, eva[62] = {0}; /* 0-9a-zA-Z */
    int i, diff, missing_beads = 0, extra_beads = 0;

    get_bead(shop);
    get_bead(eva);
    for ( i = 0; i < 62; i++ ) {
        diff = eva[i] - shop[i];
        if ( diff > 0 ) // missing
            missing_beads += diff;
        else if ( diff < 0 ) // exta
            extra_beads += -diff;
    }
    if ( missing_beads > 0 )
        printf("No %d\n", missing_beads);
    else 
        printf("Yes %d\n", extra_beads);

    return 0;
}