zoukankan      html  css  js  c++  java
  • Hotel

    Hotel
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
    Submit Status

    Description

    Last year summer Max traveled to California for his vacation. He had a great time there: took many photos, visited famous universities, enjoyed beautiful beaches and tasted various delicious foods. It is such a good trip that Max plans to travel there one more time this year. Max is satisfied with the accommodation of the hotel he booked last year but he lost the card of that hotel and can not remember quite clearly what its name is. So Max searched 
    in the web for the information of hotels in California ans got piles of choice. Could you help Max pick out those that might be the right hotel?
     

    Input

    Input may consist of several test data sets. For each data set, it can be format as below: For the first line, there is one string consisting of '*','?'and 'a'-'z'characters.This string represents the hotel name that Max can remember.The '*'and '?'is wildcard characters. '*' matches zero or more lowercase character (s),and '?'matches only one lowercase character. 

    In the next line there is one integer n(1<=n<=300)representing the number of hotel Max found ,and then n lines follow.Each line contains one string of lowercase character(s),the name of the hotel. 
    The length of every string doesn't exceed 50.
     

    Output

    For each test set. just simply one integer in a line telling the number of hotel in the list whose matches the one Max remembered.
     

    Sample Input

    herbert 2 amazon herbert ?ert* 2 amazon herbert * 2 amazon anything herbert? 2 amazon herber
     

    Sample Output

    1 0 2 0
     
     
     
     
     
     
    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    #include<string>
    using namespace std;
    bool pipei(string a,string b){
        for(int i=0;i<a.length();i++){
            if(a[i]=='*'){
                if(i==a.length()-1) return true;
                string c= a.substr(i+1);
                for(int j=i;j<b.length();j++){
                    if(pipei(c,b.substr(j))) return true;
                }
            }else{
    
                if(i>=b.length()) return false;if(a[i]=='?') continue;
                if(a[i]!=b[i]) return false;
                 
                
                       }
        }
        return true;
    }
    int main(){
        string a,b;
        while(cin>>a){
            int n;
            int ans=0;
            scanf("%d",&n);
            for(int i=0;i<n;i++){
                cin>>b;
                if(pipei(a,b)){
                    ans++;
                }
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
    View Code

    递归函数。

     
     
     
     
     
     
     
     
     
     
  • 相关阅读:
    ZOJ 3713 In 7-bit (题意不好理解,十进制、二进制、十六进制的转换问题)
    C++ cout 如何保留小数输出
    ZOJ 3705 Applications 模拟
    Google Code Jam Round 1A 2015 Problem B. Haircut 二分
    --算法分析与设计--课程作业--【顺序统计】--【采用链表法散列表】--【开放地址法(双重散列)】
    C++获取当前时间和计算程序运行时间的方法
    【STL__set_的应用】
    ZOJ 3601 Unrequited Love 【STL__pair_的应用】
    Linux概念
    fragment创建
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5693044.html
Copyright © 2011-2022 走看看