CF928A.Login Verification

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

When registering in a social network, users are allowed to create their own convenient login to make it easier to share contacts, print it on business cards, etc.

Login is an arbitrary sequence of lower and uppercase latin letters, digits and underline symbols («_»). However, in order to decrease the number of frauds and user-inattention related issues, it is prohibited to register a login if it is similar with an already existing login. More precisely, two logins ss and tt are considered similar if we can transform ss to tt via a sequence of operations of the following types:

  • transform lowercase letters to uppercase and vice versa;
  • change letter «O» (uppercase latin letter) to digit «0» and vice versa;
  • change digit «1» (one) to any letter among «l» (lowercase latin «L»), «I» (uppercase latin «i») and vice versa, or change one of these letters to other.

For example, logins «Codeforces» and «codef0rces» as well as «OO0OOO00O0OOO0O00OOO0OO_lol» and «OO0OOO0O00OOO0O00OO0OOO_1oI» are considered similar whereas «Codeforces» and «Code_forces» are not.

You're given a list of existing logins with no two similar amonst and a newly created user login. Check whether this new login is similar with any of the existing ones.

输入格式

The first line contains a non-empty string ss consisting of lower and uppercase latin letters, digits and underline symbols («_») with length not exceeding 5050 — the login itself.

The second line contains a single integer nn ( 1<=n<=10001<=n<=1000 ) — the number of existing logins.

The next nn lines describe the existing logins, following the same constraints as the user login (refer to the first line of the input). It's guaranteed that no two existing logins are similar.

输出格式

Print «Yes» (without quotes), if user can register via this login, i.e. none of the existing logins is similar with it.

Otherwise print «No» (without quotes).

输入输出样例

  • 输入#1

    1_wat
    2
    2_wat
    wat_1
    

    输出#1

    Yes
    
  • 输入#2

    000
    3
    00
    ooA
    oOo
    

    输出#2

    No
    
  • 输入#3

    _i_
    3
    __i_
    _1_
    I
    

    输出#3

    No
    
  • 输入#4

    La0
    3
    2a0
    La1
    1a0
    

    输出#4

    No
    
  • 输入#5

    abc
    1
    aBc
    

    输出#5

    No
    
  • 输入#6

    0Lil
    2
    LIL0
    0Ril
    

    输出#6

    Yes
    

说明/提示

In the second sample case the user wants to create a login consisting of three zeros. It's impossible due to collision with the third among the existing.

In the third sample case the new login is similar with the second one.

首页