字符串
文章平均质量分 76
拥抱技术
学习就像谈恋爱!
展开
-
Count the string
Count the stringTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 5 Accepted Submission(s) : 2Problem DescriptionIt is well known原创 2014-04-04 21:34:58 · 1239 阅读 · 0 评论 -
http://poj.org/problem?id=1035
Spell checkerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19066 Accepted: 6970DescriptionYou, as a member of a development team for a new spell check原创 2014-08-03 10:21:46 · 697 阅读 · 0 评论 -
http://poj.org/problem?id=1598
Excuses, Excuses!Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3658 Accepted: 1272DescriptionJudge Ito is having a problem with people subpoenaed for原创 2014-07-28 18:02:49 · 593 阅读 · 0 评论 -
http://poj.org/problem?id=3337
Expression EvaluatorTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1925 Accepted: 594DescriptionThis problem is about evaluating some C-style expressio原创 2014-07-29 10:33:47 · 599 阅读 · 0 评论 -
http://poj.org/problem?id=1503
Integer InquiryTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29577 Accepted: 11509DescriptionOne of the first users of BIT's new supercomputer was Chi原创 2014-07-29 13:52:00 · 628 阅读 · 0 评论 -
http://poj.org/problem?id=2408
#include #include #include #include using namespace std;typedef struct { char s[100]; char re_s[100];}word;word data[30005];int cnt = 0;typedef struct { int num; int start;}p原创 2014-07-25 19:52:50 · 693 阅读 · 0 评论 -
统计难题
统计难题Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131070/65535K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 2Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只原创 2014-04-03 08:14:15 · 699 阅读 · 0 评论 -
Hat’s Words
Hat’s WordsTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6 Accepted Submission(s) : 2Problem DescriptionA hat’s word is a word原创 2014-04-05 13:20:30 · 1189 阅读 · 0 评论 -
亲和串
亲和串Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 14 Accepted Submission(s) : 3Problem Description人随着岁数的增长是越大越聪明还是越大越笨,这是一个值得全世原创 2014-04-05 16:19:14 · 1470 阅读 · 0 评论 -
Number Sequence
Number SequenceTime Limit : 10000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 5 Accepted Submission(s) : 4Problem DescriptionGiven two sequenc原创 2014-04-04 19:57:51 · 682 阅读 · 0 评论 -
Oulipo
OulipoTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 11 Accepted Submission(s) : 4Problem DescriptionThe French author Georg原创 2014-04-03 23:01:56 · 1004 阅读 · 0 评论 -
TEX Quotes
TEX QuotesTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 3Problem DescriptionTEX is a typesetting la原创 2014-04-02 20:19:03 · 904 阅读 · 0 评论 -
Phone List
Phone ListTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 12 Accepted Submission(s) : 3Problem DescriptionGiven a list of p原创 2014-04-02 21:11:04 · 725 阅读 · 0 评论 -
Message Decowding
Message DecowdingTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 4 Accepted Submission(s) : 4Problem DescriptionThe cows are th原创 2014-04-02 19:42:35 · 794 阅读 · 0 评论 -
Period 和 字符串周期
PeriodTime Limit : 6000/3000ms (Java/Other) Memory Limit : 60000/30000K (Java/Other)Total Submission(s) : 16 Accepted Submission(s) : 3Problem DescriptionFor each prefix of a given原创 2014-04-05 17:37:22 · 1785 阅读 · 0 评论 -
KMP 算法
KMP 算法 与 朴素算法相比少了不必要的重复工作,比如ABABCD串在C处失配应从第二个A处匹配,不是第一个A处匹配。所以KMP的关键是状态转移表(预处理时间是0(M)),总的时间复杂度是0(M + N)。状态转移就是模式串每个位置的最大相等子串。前提:#include #include #include using namespace std;char w[10010];原创 2014-04-03 23:58:37 · 1020 阅读 · 0 评论