Trie树
关注
分享
扫一扫
文章平均质量分 86
Grit_ICPC
Dielts
展开
-
迷之好奇 SDUTOJ 3039
迷之好奇Time Limit: 2000ms Memory limit: 65536K 有疑问？点这里^_^题目描述FF得到了一个有n个数字的集合。不要问我为什么，有钱，任性。FF很好奇的想知道，对于数字x，集合中有多少个数字可以在x前面添加任意数字得到。如，x = 123，则在x前面添加数字可以得到4123，5123等。输入 多组输入。对原创 2015-07-28 16:09:04 · 976 阅读 · 0 评论 -
Poj 2503 Babelfish(map+串的处理)
BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 36520 Accepted: 15587DescriptionYou have just moved from Waterloo to a big city. The people here原创 2015-08-07 15:19:12 · 458 阅读 · 0 评论 -
Message Flood SDUT
Message FloodTime Limit: 1500ms Memory limit: 65536K 有疑问？点这里^_^题目描述Well, how do you feel about mobile phone? Your answer would probably be something like that "It's so convenient and be原创 2015-07-28 16:58:57 · 416 阅读 · 0 评论 -
POJ 2513 Colored Sticks (Tire+欧拉路+并查集)
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 32788 Accepted: 8639DescriptionYou are given a bunch of wooden sticks. Each endpoint of e原创 2015-08-11 21:35:11 · 541 阅读 · 0 评论 -
POJ 2418 Hardwood Species (字典树||MAP)
Hardwood SpeciesTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 20684 Accepted: 8108DescriptionHardwoods are the botanical group of trees that have broad原创 2015-08-12 11:32:08 · 594 阅读 · 0 评论 -
数据结构实验之查找三：树的种类统计 (STL)
我只想说你这题意能不能说清楚点。。- -！。害的我WA了老多。我本以为是每次都是输出相同的this is an ...的。 #include#include#include#includeusing namespace std;char s[10000],str[100000];int main(){ int n,m,i,j,k,l;原创 2015-12-11 10:42:47 · 901 阅读 · 0 评论