字符串
文章平均质量分 80
sunshine668
这个作者很懒,什么都没留下…
展开
-
hdu 1073 Online Judge
Problem DescriptionIgnatius is building an Online Judge, now he has worked out all the problems except the Judge System. The system has to read data from correct output file and user's result file转载 2014-03-30 00:00:26 · 365 阅读 · 0 评论 -
hdu 1088 Write a simple HTML Browser
Problem DescriptionIf you ever tried to read a html document on a Macintosh, you know how hard it is if no Netscape is installed. Now, who can forget to install a HTML browser? This is very easy转载 2014-03-30 00:05:52 · 354 阅读 · 0 评论 -
HDU1039:Easier Done Than Said?
Problem DescriptionPassword security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Some sites use random computer-ge转载 2014-03-29 22:37:19 · 302 阅读 · 0 评论 -
hdu1062 Text Reverse
Problem DescriptionIgnatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words and then output them. Input转载 2014-03-29 23:13:41 · 408 阅读 · 0 评论 -
POJ 3461 Oulipo
DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:Tout avait Pair nor原创 2014-07-22 08:52:56 · 400 阅读 · 0 评论 -
Power Strings
DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponen原创 2014-07-04 15:52:55 · 411 阅读 · 0 评论 -
hdu 2054A == B ?
#include#includeusing namespace std;char a[100000],b[100000];bool is (char *p){ for(; *p != '\0' ; p++) if(*p == '.')return true; return false;}void det (char *p){ for(; *p != '\0' ;原创 2014-08-01 15:27:17 · 359 阅读 · 0 评论 -
UVA 1993 This cheeseburger you don't need
DescriptionYoda: May the Force be with you.Master Yoda is the oldest member of the Jedi Council. He conducts preparatory classes of little Younglings up to the moment they get a mentor原创 2014-07-28 20:57:38 · 340 阅读 · 0 评论 -
kmp算法
#include#include#include#include#include#includeusing namespace std;char s[1000],c[100];int next[1000];void getn(){ int i=0,j=-1; next[0]=-1; while(c[i]) { if(j==-1||原创 2016-02-25 20:27:02 · 257 阅读 · 0 评论