Phone List(C++ vector容器)
来源:互联网 发布:linux中的cut命令 编辑:程序博客网 时间:2024/06/06 19:33
Phone List
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12940 Accepted Submission(s): 4405
Problem Description
Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:
1. Emergency 911
2. Alice 97 625 999
3. Bob 91 12 54 26
In this case, it’s not possible to call Bob, because the central would direct your call to the emergency line as soon as you had dialled the first three digits of Bob’s phone number. So this list would not be consistent.
1. Emergency 911
2. Alice 97 625 999
3. Bob 91 12 54 26
In this case, it’s not possible to call Bob, because the central would direct your call to the emergency line as soon as you had dialled the first three digits of Bob’s phone number. So this list would not be consistent.
Input
The first line of input gives a single integer, 1 <= t <= 40, the number of test cases. Each test case starts with n, the number of phone numbers, on a separate line, 1 <= n <= 10000. Then follows n lines with one unique phone number on each line. A phone number is a sequence of at most ten digits.
Output
For each test case, output “YES” if the list is consistent, or “NO” otherwise.
Sample Input
2391197625999911254265113123401234401234598346
Sample Output
NOYES
Source
2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(3)
#include<cstdio>#include<vector>#include<iostream>#include<algorithm>#include<cstring>using namespace std;int main(){ int t,n,i,flag; string s; cin>>t; while(t--) { vector<string>vec; cin>>n; flag=0; for(i=1;i<=n;i++) { cin>>s; vec.push_back(s); } sort(vec.begin(),vec.end()); for(i=0;i<n-1;i++) { if(vec[i+1].find(vec[i])==0)//从开始找的! { cout<<"NO"<<endl; flag=1; } if(flag) { break; } } if(!flag) { cout<<"YES"<<endl; } }}
0 0
- Phone List(C++ vector容器)
- c++STL之顺序容器(vector、deque、list)分析
- C++--vector<>容器,List<>链表,map<>容器的用法
- vector 容器类 (C++)
- 容器:C++vector用法 VS C#list用法
- 顺序容器(Vector和List)
- c++容器(vector、list、deque)
- c++容器1(vector、list、deque)
- c++容器(vector、list、deque)
- c++容器(vector、list、deque)
- c++容器(vector、list、deque)
- 顺序性容器(vector&list&deque)
- 顺序容器list vector
- 容器vector&list
- 顺序容器:如何选用容器(list,vector,deque)
- 序列容器:vector,deque,list
- STL容器区别vector,list
- C++容器 vector list map
- 伙伴算法
- Android 开发经验谈-很少有人会告诉你的Android开发基本常识
- HDU-3952-Fruit Ninja
- 关于UILabel的宽高自适应
- IT职业生涯
- Phone List(C++ vector容器)
- TexView 设置最大字数 超过部分显示省略号
- 最大堆及其操作函数
- 后来者如何居上
- 连接BAE3.0数据库成功!
- 详细解释CNN卷积神经网络各层的参数和链接个数的计算
- MVC4 WebAPI(一)
- 2012年5月SAT香港真题解析
- WebService的WSDL文档结构