biu________的博客

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 distressed and t

#include<iostream>#include<cstring>#include<cstdio>using namespace std;int next[1005];void tonext(char b[],int blen){ int k=-1,i; next[0]=-1; for(i=1;i<blen;i++)...

https://vjudge.net/contest/70325?utm_source=qq&utm_medium=social#problem/BProblem Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter ‘e’. He

Given 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 find a number K which make a[K] = b[1], a[K + 1] = b[2], …… , a[K