A1071. Speech Patterns (25)

People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such patterns can help to narrow down a speaker‘s identity, which is useful when validating, for example, whether it‘s still the same person behind an online avatar.

Now given a paragraph of text sampled from someone‘s speech, can you find the person‘s most commonly used word?

Input Specification:

Each input file contains one test case. For each case, there is one line of text no more than 1048576 characters in length, terminated by a carriage return ‘\n‘. The input contains at least one alphanumerical character, i.e., one character from the set [0-9 A-Z a-z].

Output Specification:

For each test case, print in one line the most commonly occurring word in the input text, followed by a space and the number of times it has occurred in the input. If there are more than one such words, print the lexicographically smallest one. The word should be printed in all lower case. Here a "word" is defined as a continuous sequence of alphanumerical characters separated by non-alphanumerical characters or the line beginning/end.

Note that words are case insensitive.

Sample Input:

Can1: "Can a can can a can?  It can!"

Sample Output:

can 5
 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 #include <iostream>
 4 #include <string.h>
 5
 6 #include <math.h>
 7 #include <algorithm>
 8 #include <vector>
 9 #include <set>
10 #include <string>
11 #include <map>
12 using namespace std;
13
14 bool check(char a)
15 {
16     if(a>=‘A‘&&a<=‘Z‘)return true;
17     if(a>=‘a‘&&a<=‘z‘)return true;
18     if(a>=‘0‘&&a<=‘9‘)return true;
19     return false;
20 }
21
22
23 int main(){
24    string a,b;
25    getline(cin,a);
26    map<string,int> count;
27    int i=0;
28    while(i<a.length())
29    {
30        b="";
31        while(i<a.length()&&check(a[i])==true)
32        {
33            if(a[i]>=‘A‘&&a[i]<=‘Z‘)a[i]=a[i]+‘a‘-‘A‘;
34            b+=a[i];
35            i++;
36        }
37        if(b!="")
38        {
39               if(count.find(b)!=count.end())
40               {
41                   count[b]++;
42               }else count[b]=1;
43        }
44        //过滤非有效字符
45       while(i<a.length()&&check(a[i])==false) i++;
46    }
47    string ans;
48    int max=0;
49    for(map<string,int>::iterator it=count.begin();it!=count.end();it++)
50    {
51        if(it->second>max)
52        {
53            max=it->second;
54         ans=it->first;
55        }
56    }
57    cout<<ans<<" "<<max<<endl;
58     return 0;
59 }
时间: 2024-11-05 17:26:18

A1071. Speech Patterns (25)的相关文章

C++ STL map A1071 Speech Patterns(25) (注意如何从字符串里 分割出单词,注意读取整行带空格的string 需要使用 getlint(cin,str) 函数)

#include <bits/stdc++.h> #include<math.h> #include <string> using namespace std; const int maxn = 40010;//最大学生人数 bool check(char c){ if(c >= '0' && c<= '9') return true; if(c >= 'A' && c<= 'Z') return true; if

PAT 1071. Speech Patterns (25)

1071. Speech Patterns (25) People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such patterns can help to narrow down a speaker's ident

pat1071. Speech Patterns (25)

1071. Speech Patterns (25) 时间限制 300 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 HOU, Qiming People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops&qu

1071. Speech Patterns (25)

map的使用 时间限制 300 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 HOU, Qiming People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such

PAT:1071. Speech Patterns (25) AC

#include<ctype.h> #include<iostream> #include<map> #include<string> using namespace std; bool check(char a) //判断是否为有效字符 { if(isdigit(a) || isalpha(a)) return true; return false; } int main() { map<string,int> count; //单词与次数的映

PAT (Advanced Level) 1071. Speech Patterns (25)

简单题. #include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<map> #include<stack> #include<queue> #include<string> #include<iostream> #include<algorithm> using namespace std;

PAT 1071 Speech Patterns[一般]

1071 Speech Patterns (25 分) People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such patterns can help to narrow down a speaker's iden

Design Patterns 25

尽管将一个系统分割成许多对象通常可以增加其可服用性, 但是对象间相互连接的激增又会降低其可复用性了. 大量的连接使得一个对象不可能在没有改变其他对象的支持下工作, 系统表现为一个不可分割的整体, 所以, 对系统的行为进行任何较大的改动就十分困难了. 中介者模式, 用一个中介对象来封装一系列的对象交互. 中介者使各对象不需要显式的相互引用, 从而使其耦合松散, 而且可以独立的改变他们之间的交互. 123456789101112131415161718192021222324252627282930

Speech Patterns (string)

People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such patterns can help to narrow down a speaker's identity, which is useful when v