ACM 10295 - Hay Points

#include <stdio.h>
#include <string.h>
#include <ctype.h>

struct word
{
    char str[20];
    int point;     
};

struct word w[1000];
char str[200];
char word[20];
int main()
{
   int m, n, i, j, k;
   scanf("%d%d", &m, &n);
   for (i = 0; i < m ; i ++)
       scanf("%s %d", w[i].str, &w[i].point);
   for (i = 0; i < n; i ++)
   {
       int point = 0;
       while (gets(str))
       {
           if (str[0] == '.') break;
           int index = 0;
           for (j = 0; str[j]; j ++)
           {
               if (isalpha(str[j]))
                   word[index ++] = str[j];
               if (!isalpha(str[j]) || str[j + 1] == '\0')
               {
                   word[index] = '\0';
                   for (k = 0; k < m; k ++)
                       if (strcmp(word, w[k].str) == 0)
                       { point += w[k].point; break; }
                   index = 0;   
               }      
           }    
       }
       printf("%d\n", point);
       
   }
    return 0;
}

回目錄
回首頁