若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1646: Phone List

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,431

题目描述

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.

输入

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.

输出

For each test case, output "YES" if the list is consistent, or "NO" otherwise.

样例输入

2
3
911
97625999
91125426
5
113
12340
123440
12345
98346

样例输出

NO
YES

参考代码

#include"stdio.h"
int f(const void *a,const void *b) 
{
    return strcmp((char *)a,(char *)b);
}
int main() 
{
    int n,m,i,j;
    char a[10000][11];
    scanf("%d",&n);
    while(n--) 
    {
        scanf("%d",&m);
        getchar();
        for (i=0;i<m;i++)
                    gets(a[i]);
        qsort(a,m,sizeof(char)*11,f);
        for (i=1;i<m;i++) 
        {
            for (j=0;a[i-1][j]!='';j++)
                if(a[i-1][j]!=a[i][j])
                    break;
            if(a[i-1][j]=='')
            {
                printf("NOn");
                break;
            }
            if(i==m-1)
                printf("YESn");
        }
    }
    return 0;
}

解析

暂无

hustoj

发表评论 取消回复

邮箱地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

Skip Dreams孤独患者 原站点
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist