甜晨流年

Time limit1000 msMemory limit32768 kBThe 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 th...

Time limit1000 msMemory limit32768 kB一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？ Input输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有多少种花样。花...

Time limit3000 msMemory limit65536 kBGiven 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 concatenatio...

Time limit3000 msMemory limit30000 kBFor 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 ...

Time limit2000 msMemory limit65536 kBThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. The...

从头到尾彻底理解KMP         此文转自神的博客  http://blog.csdn.net/v_july_v/article/details/7041827#1. 引言    ...

Time limit5000 msMemory limit32768 kBGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to...