POJ 题目3630 Phone List(字符串,水)
2015-03-04 23:23
381 查看
Phone List
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:
Emergency 911
Alice 97 625 999
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
Sample Output
Source
Nordic 2007
ac代码
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 23729 | Accepted: 7293 |
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:
Emergency 911
Alice 97 625 999
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
2 3 911 97625999 91125426 5 113 12340 123440 12345 98346
Sample Output
NO YES
Source
Nordic 2007
ac代码
#include<stdio.h> #include<string.h> #include<math.h> #include<stdlib.h> #define min(a,b) (a>b?b:a) struct str { char s[20]; }b[10010]; int cmp(const void *a,const void *b) { return strcmp((*(struct str *)a).s,(*(struct str *)b).s); } int n; int jud() { int i,j,k; for(i=0;i<n-1;i++) { int len=strlen(b[i].s); for(j=0;j<len;j++) { if(b[i].s[j]!=b[i+1].s[j]) break; } if(j==len) return 1; } return 0; } int main() { int t; scanf("%d",&t); while(t--) { //int n; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%s",b[i].s); } qsort(b,n,sizeof(b[0]),cmp); int ans=jud(); if(ans) printf("NO\n"); else printf("YES\n"); } }
相关文章推荐
- poj 3630 Phone List 【字典树】【判断一个字符串集里面 是否存在一个字符串是另一个字符串前缀】
- 【原】 POJ 3630 Phone List Trie树 解题报告
- poj 3630 Phone List(依旧Trie~)
- poj 3630 Phone List
- POJ 3630 Phone List
- POJ 3630 Phone List【字典树】
- POJ 3630 Phone List
- poj --3630 Phone List 字典树
- poj 3630(Phone List )
- poj-3630 Phone List **
- [字典树 ] poj 3630 Phone list
- POJ-3630-Phone List-Trie树(键树、数字查找树、基数树)
- hdu 1671 & poj 3630 Phone List
- HDU 1671 & POJ 3630 Phone List
- poj 3630(Phone List)
- POJ——3630 Phone List
- POJ 3630 Phone List 字典树
- POJ 3630 Phone List/POJ 1056 【字典树】
- poj 3630 Phone List
- Poj 3630 Phone List