CF21A.Jabber ID
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Jabber ID on the national Berland service «Babber» has a form
— is a sequence of Latin letters (lowercase or uppercase), digits or underscores characters «_», the length of is between 1 and 16, inclusive. — is a sequence of word separated by periods (characters «.»), where each word should contain only characters allowed for , the length of each word is between 1 and 16, inclusive. The length of is between 1 and 32, inclusive. — is a sequence of Latin letters (lowercase or uppercase), digits or underscores characters «_», the length of is between 1 and 16, inclusive.
The content of square brackets is optional — it can be present or can be absent.
There are the samples of correct Jabber IDs: mike@codeforces.com, 007@en.codeforces.com/contest.
Your task is to write program which checks if given string is a correct Jabber ID.
输入格式
The input contains of a single line. The line has the length between 1 and 100 characters, inclusive. Each characters has ASCII-code between 33 and 127, inclusive.
输出格式
Print YES or NO.
输入输出样例
输入#1
mike@codeforces.com
输出#1
YES
输入#2
john.smith@codeforces.ru/contest.icpc/12
输出#2
NO