zoukankan      html  css  js  c++  java
  • HDU4287

    Intelligent IME

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 5319    Accepted Submission(s): 2498


    Problem Description

      We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phone. To be specific, the number buttons may correspond to some English letters respectively, as shown below:
      2 : a, b, c    3 : d, e, f    4 : g, h, i    5 : j, k, l    6 : m, n, o    
      7 : p, q, r, s  8 : t, u, v    9 : w, x, y, z
      When we want to input the word “wing”, we press the button 9, 4, 6, 4, then the input method will choose from an embedded dictionary, all words matching the input number sequence, such as “wing”, “whoi”, “zhog”. Here comes our question, given a dictionary, how many words in it match some input number sequences?
     

    Input

      First is an integer T, indicating the number of test cases. Then T block follows, each of which is formatted like this:
      Two integer N (1 <= N <= 5000), M (1 <= M <= 5000), indicating the number of input number sequences and the number of words in the dictionary, respectively. Then comes N lines, each line contains a number sequence, consisting of no more than 6 digits. Then comes M lines, each line contains a letter string, consisting of no more than 6 lower letters. It is guaranteed that there are neither duplicated number sequences nor duplicated words.
     

    Output

      For each input block, output N integers, indicating how many words in the dictionary match the corresponding number sequence, each integer per line.
     

    Sample Input

    1 3 5 46 64448 74 go in night might gn
     

    Sample Output

    3 2 0
     

    Source

     
     1 //2017-09-29
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 const int N = 5500;
    10 
    11 int arr[N];
    12 int book[10000000];
    13 char str[10];
    14 
    15 int change(char ch){
    16     if('a' <= ch && ch <= 'c')return 2;
    17     if('d' <= ch && ch <= 'f')return 3;
    18     if('g' <= ch && ch <= 'i')return 4;
    19     if('j' <= ch && ch <= 'l')return 5;
    20     if('m' <= ch && ch <= 'o')return 6;
    21     if('p' <= ch && ch <= 's')return 7;
    22     if('t' <= ch && ch <= 'v')return 8;
    23     if('w' <= ch && ch <= 'z')return 9;
    24 }
    25 
    26 int main()
    27 {
    28     int T, n, m;
    29     scanf("%d", &T);
    30     while(T--){
    31         scanf("%d%d", &n, &m);
    32         for(int i = 0; i < n; i++){
    33             scanf("%d", &arr[i]);
    34             book[arr[i]] = 0;
    35         }
    36         for(int i = 0; i < m; i++){
    37             scanf("%s", str);
    38             int tmp = 0;
    39             for(int j = 0; str[j] != ''; j++){
    40                 tmp *= 10;
    41                 tmp += change(str[j]);
    42             }
    43             //printf("%s -> %d
    ", str, tmp);
    44             book[tmp]++;
    45         }
    46         for(int i = 0; i < n; i++){
    47             printf("%d
    ", book[arr[i]]);
    48         }
    49     }
    50 
    51     return 0;
    52 }
  • 相关阅读:
    nginx学习二:快速入门
    nginx学习一:http协议
    使用itext生成pdf的,各种布局
    关于java poi itext生成pdf文件的例子以及方法
    半透明全屏蒙层+全屏屏蔽+内容居中+css
    通过html文件生成PDF文件
    mybatis中文官网
    经典sql语句
    关于Cell中的各种值的类型判断
    bootstrap表格参数说明
  • 原文地址:https://www.cnblogs.com/Penn000/p/7616732.html
Copyright © 2011-2022 走看看