hdu 1894 String Compare 还蛮不错的题目 STL 中的string应用
来源:互联网 发布:淘宝店铺怎么卖话费 编辑:程序博客网 时间:2024/06/06 00:42
String Compare
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1789 Accepted Submission(s): 436
Problem Description
Maybe there are 750,000 words in English and some words are prefix of other words, for example: the word "acm" can be treat as one prefix of "acmicpc". What's more, most of such pairs of words have relationship between them. Now give you a dictionary, your work is to tell me how many such pairs.
There may be other characters in the word, for example '_','-',and so on.
Pay attention that 'A' and 'a' are not the same character!
There may be other characters in the word, for example '_','-',and so on.
Pay attention that 'A' and 'a' are not the same character!
Input
In the first line of the input file there is an Integer T, which means the number of test cases. Followed by T test cases.
For each test case, in the first line there is an integer N(0<N<=50000), followed N lines, each contains a word whose length is less than 30 and no space appears in any word. There are no same words in two different lines.
For each test case, in the first line there is an integer N(0<N<=50000), followed N lines, each contains a word whose length is less than 30 and no space appears in any word. There are no same words in two different lines.
Output
For each test case, tell me how many such pairs. If the number is larger than 11519, just divide it by 11519 and only output the remainder.
Sample Input
22acmicpcacm3aabcab
Sample Output
13
Author
Sempr|CrazyBird|hust07p43
Source
HDU 2008-4 Programming Contest
Recommend
lcy
题意
: 一个单词是另一个单词的前缀 问这样的一共有多少对
思路
:
1:本题用字典树会超时
2:本题完全可以不用string 但是我想用这个题学习下string的应用
3: If the number is larger than 11519, just divide it by 11519 and only output the remainder
要特别注意这句话 大于11519才mod 等于不mod 因为这里我错12次 阿弥陀佛
#include<stdio.h>#include<stdlib.h>#include<string>#include<string.h>#include<iostream>#include<algorithm>using namespace std;string a[100010];int main(){ int cas,i,j,n,cnt; cin>>cas; while(cas--) { cnt=0; cin>>n; for(i=0;i<n;i++) cin>>a[i]; sort(a,a+n); for(i=0;i<n-1;i++) { for(j=i+1;j<n;j++) { if(a[i].size()>=a[j].size()) break; if(a[i].compare(0,a[i].size(),a[j],0,a[i].size())==0)//将a[i]与b[i]中的与a[i]长度相等的地方进行比较 cnt++; else break; } } if(cnt>11519) cnt=cnt%11519; printf("%d\n",cnt); } return 0;}
- hdu 1894 String Compare 还蛮不错的题目 STL 中的string应用
- HDU 1894--String Compare【string】
- hdu 1894 String Compare
- Hdu 1894 String Compare
- STL string 的应用
- HDU String Compare
- Hdu 1894 String Compare 程序参考
- HDU 1894 String Compare (排序)
- C++中的string::compare的使用
- HDU-1113-STL的map<string,string>
- hdoj 1894 String Compare 【string】
- HDU 1238 Substrings 字符串水题,STL String 的应用
- string .Compare的用法
- String.Compare的用法
- STL string 型的应用
- string中的compare() 2011.08.09
- c++ STL::String::Compare (_Buf内容一致,compare不相等)
- C++ STL string应用
- Android和JavaScript互相调用
- malloc/free与new/delete的区别
- 安卓巴士Android开发神贴整理
- Java中的内置类型
- Google Android开发精华教程
- hdu 1894 String Compare 还蛮不错的题目 STL 中的string应用
- gridview 编辑,删除,更新的用法
- MaNGOS 下载,编译,配置和运行的基本步骤
- 优秀程序员和一般程序员差别在哪?
- 世界上最短的时钟代码!更短的,有木有?
- 解决循环引用的一个例子
- Android SQLite总结(一)
- Android自定义属性
- flex中使用RemoteObject与java通信(使用AS实现)