Problems
Contests
Topic
IDE
Events
PacketHub
Login
Description
Editorial
My Submission
1058.Phone Number
Look up all submission
Status
Time
Memory
Lang.
Submit Date
1058.Phone Number
Time Limit:1000MS Memory Limit:65535KB
Description
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.
Input
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.
Output
For each test case, if there exits a phone number that cannot be called, print "NO", otherwise print "YES" instead.
Sample test
Sample input
2 012 012345 2 12 012345 0
Sample output
NO YES
Note
Tags
Post editorial
Editorials
GNU C++ 9.3.0
GNU C 9.3.0
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
Login before submit
Test Input
Test Output
2 012 012345 2 12 012345 0
Please run you code firstly.
Console
IDE Setting
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题，选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数，设置为0则不限制。
0
80
100
120
Login before submit
