几许情愁的博客

DescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was...

#include<stdio.h>#include<string.h>#include<algorithm>#include<queue>#include<math.h>#include<map>#include<stack>#define inf 0x3f3f3f3f3f3fusing name

Problem Description It's time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative songs. To make the programs...

  Problem Description For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic st...

Problem Description The 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 a...

Problem Description CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distresse...

int get_minstring(char *s)//最小表示法{ int len = strlen(s); int i = 0, j = 1, k = 0; while(i<len && j<len && k<len) { int t=s[(i+k)%len]-s[(j+k)%len]; ...

#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<map>#include<queue>#include<vector>#include<stack>#defin

Problem Description You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any ...

Problem Description It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this st...

题目链接：http://acm.fzu.edu.cn/problem.php?pid=1926；与一般的KMP不同，这是一个单词一个单词比较#include<cstring>#include<cstdio>#include<string>#include<algorithm>#include<math.h>#inclu...