Description

Each employee of a bureaucracy has a job description - a few paragraphs that describe the responsibilities of the job. The employee's job description, combined with other factors, such as seniority, is used to determine his or her salary.

The Hay Point system frees the Human Resources department from having to make an intelligent judgement as to the value of the employee; the job description is merely scanned for words and phrases that indicate responsibility. In particular, job descriptions that indicate control over a large budget or management over a large number of people yield high Hay Point scores.

You are to implement a simplified Hay Point system. You will be given a Hay Point dictionary and a number of job descriptions. For each job description you are to compute the salary associated with the job, according to the system.

Input

The first line of input contains 2 positive integers: m <= 1000, the number of words in the Hay Point dictionary, and n <= 100, the number of job descriptions. m lines follow; each contains a word (a string of up to 16 lower-case letters) and a dollar value (a real number between 0 and 1,000,000). Following the dictionary are the n job descriptions. Each job description consists of one or more lines of text; for your convenience the text has been converted to lower case and has no characters other than letters, numbers, and spaces. Each job description is terminated by a line containing a period.

Output

For each job description, output the corresponding salary computed as the sum of the Hay Point values for all words that appear in the description. Words that do not appear in the dictionary have a value of 0.

Sample Input

7 2
administer 100000
spending 200000
manage 50000
responsibility 25000
expertise 100
skill 50
money 75000
the incumbent will administer the spending of kindergarden milk money
and exercise responsibility for making change he or she will share
responsibility for the task of managing the money with the assistant
whose skill and expertise shall ensure the successful spending exercise
.
this individual must have the skill to perform a heart transplant and
expertise in rocket science
.

Sample Output

700150
150
这题很水的，直接定义一string类数组，然后再从文段查找记录就行，直接看代码

 1#include<iostream>
 2#include<string>
 3using namespace std;
 4struct{
 5string s;
 6int money;
 7}dictionary[1000];
 8string description[10000];
 9int main()
10{
11    //freopen("in.txt","r",stdin);
12    //freopen("out.txt","w",stdout);
13    int m,n,temp,sum;
14    while(cin>>m>>n)
15    {
16                    for(int i=0;i<m;i++)
17                    cin>>dictionary[i].s>>dictionary[i].money;
18                    for(int i=0;i<n;i++)
19                    {
20                            sum=0;
21                            int j;
22                            for(j=0;;j++)
23                            {
24                                         cin>>description[j];
25                                         if(description[j]==".")
26                                         break;
27                            }
28                            temp=j;
29                            for(int i=0;i<m;i++)
30                            {
31                                    for(int j=0;j<temp;j++)
32                                    if(dictionary[i].s==description[j])
33                                    sum+=dictionary[i].money;
34                            }
35                            cout<<sum<<endl;
36                    }
37    }
38    //system("PAUSE");
39    return 0;
40}        
41

Description

If a tree falls in the forest, and there's nobody there to hear, does it make a sound? This classic conundrum was coined by George Berkeley (1685-1753), the Bishop and influential Irish philosopher whose primary philosophical achievement is the advancement of what has come to be called subjective idealism. He wrote a number of works, of which the most widely-read are Treatise Concerning the Principles of Human Knowledge (1710) and Three Dialogues between Hylas and Philonous (1713) (Philonous, the "lover of the mind," representing Berkeley himself).

Input

A forest contains T trees numbered from 1 to T and P people numbered from 1 to P. Standard input consists of a line containing P and T followed by several lines, containing a pair of integers i and j, indicating that person i has heard tree j fall. People may have different opinions as to which trees, according to Berkeley, have made a sound.

Input contains multiple test cases. Subsequent test cases are separated with a single blank line.

Output

How many different opinions are represented in the input? Two people hold the same opinion only if they hear exactly the same set of trees. You may assume that P < 100 and T < 100.

Sample Input

3 4
1 2
3 3
1 3
2 2
3 2
2 4

Sample Output

2

 1#include<stdio.h>
 2#include<stdlib.h>
 3int main()
 4{
 5int n,m,a,b,i,j,k;
 6int s[100][100],arr[100];
 7int flag,sum;
 8char str[100];
 9while(scanf("%d%d",&n,&m)!=EOF)
10{
11sum=0;
12for(i=0;i<n;i++)
13{
14arr[i]=0;
15for(j=0;j<m;j++)
16s[i][j]=0;
17}
18getchar(); 
19while (gets(str)!=NULL) 
20{
21    if (str[0]=='\0') 
22           break;
23      sscanf(str,"%d %d",&a,&b); 
24    s[a-1][b-1]=1;
25}
26for(i=0;i<n;i++)
27{
28if(arr[i]==0)
29{
30sum++;
31for(j=i+1;j<n;j++)
32{
33flag=0;
34if(arr[j]==0)
35{
36for(k=0;k<m;k++)
37if(s[i][k]!=s[j][k])
38{
39flag=1;
40break; 
41}
42if(flag==0) 
43arr[j]=1;
44}
45}
46}
47}
48printf("%d\n",sum); 
49} 
50}