twh233的算法blog

传送门 剪花布条 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 20743    Accepted Submission(s): 12946 Problem Description 一块花布

Censor frog is now a editor to censor so-called sensitive words (敏感词). She has a long text p . Her job is relatively simple -- just to find the first occurence of sensitive word w and remove it. fr

传送门 Eqs Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 16694   Accepted: 8193 Description Consider equations having the following form:  a1x13+ a2x2

题目链接：http://codeforces.com/contest/727/problem/E  题目大意：有g个长度为k的互不相同的字符串，从中选择n个按照顺时针顺序写下形成一个环s。给出s(长度为n*k)和g个字符串，求是否有一种选择方案可以得到s(可以从任意位置开始)。  数据范围：1 ≤ n ≤ 10^5, 1 ≤ k ≤ 10^5, n*k ≤ 10^6, n ≤ g ≤ 10^5