[2010山东省第一届ACM大学生程序设计竞赛]——Phone Number

最新推荐文章于 2022-07-06 22:43:58 发布

ltree98

最新推荐文章于 2022-07-06 22:43:58 发布

阅读量2.1k

点赞数

分类专栏： ACM-竞赛 ACM-字符串处理漫漫刷题路文章标签： Phone Number 2010山东省第一届ACM大学生程序设计省赛

本文链接：https://blog.csdn.net/lttree/article/details/23600489

版权

博客详细介绍了2010年山东省第一届ACM大学生程序设计竞赛中关于Phone Number的问题，讨论如何判断是否存在无法拨打的电话号码。通过字符串比较，检查一个字符串是否为另一个字符串的前缀来解决此问题。

摘要由CSDN通过智能技术生成

Phone Number
题目描述
We know that if a phone number A is another phone number B’s prefix, B is not able to be called. For an example, A is 123 while B is 12345, after pressing 123, we call A, and not able to call B.
Given N phone numbers, your task is to find whether there exits two numbers A and B that A is B’s prefix.

输入
The input consists of several test cases.
The first line of input in each test case contains one integer N (0<N<1001), represent the number of phone numbers.
The next line contains N integers, describing the phone numbers.

The last case is followed by a line containing one zero.

输出

For each test case, if there exits a phone number that cannot be called, print “NO”, otherwise print “YES” instead.