zoukankan      html  css  js  c++  java
  • 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". 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 ' '. 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<cstdio>
     2 #include<stack>
     3 #include<algorithm>
     4 #include<iostream>
     5 #include<stack>
     6 #include<set>
     7 #include<map>
     8 using namespace std;
     9 map<string,int> ha;
    10 bool ischar(char &a){
    11     if(a>='A'&&a<='Z'){
    12         a=a-'A'+'a';
    13         return true;
    14     }
    15     if((a>='a'&&a<='z')||(a>='0'&&a<='9')){
    16         return true;
    17     }
    18     return false;
    19 }
    20 int main(){
    21     //freopen("D:\INPUT.txt","r",stdin);
    22     string s,ss;
    23     getline(cin,s);
    24 
    25     //cout<<s<<endl;
    26 
    27     int i;
    28     for(i=0;i<s.length();i++){
    29         ss="";
    30         //cout<<i<<" "<<s[i]<<endl;
    31         while(i<s.length()&&ischar(s[i])){
    32             ss=ss+s[i];
    33             i++;
    34         }
    35         if(ss!=""){
    36             ha[ss]++;
    37             //cout<<ss<<" "<<ha[ss]<<endl;
    38         }
    39 
    40     }
    41     map<string,int>::iterator it;
    42     int maxcount=0;
    43     for(it=ha.begin();it!=ha.end();it++){
    44         if(maxcount<it->second){
    45             maxcount=it->second;
    46             ss=it->first;
    47         }
    48     }
    49     cout<<ss<<" ";
    50     printf("%d
    ",maxcount);
    51     return 0;
    52 }

  • 相关阅读:
    linux下安装mysql
    python -- 相对路径、绝对路径、以及路径的获取
    Jekyll 使用入门
    argparse 使用指南
    requests快速入门
    Pandoc中的Markdown语法
    利用Github Pages建立仓库“门面”
    Anaconda使用入门
    Python连接SQL Server数据库
    SQL Server 部署CLR程序集错误`6218`
  • 原文地址:https://www.cnblogs.com/Deribs4/p/4781447.html
Copyright © 2011-2022 走看看