[2406]Power Strings (POJ) KMP
2014-09-11 22:40
429 查看
×
关闭划词翻译
复制
复制全部
| ||||
| Online Judge | Problem Set | Authors | Online Contests | User |
|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Problems Submit Problem Online Status Prob.ID: | Register Update your info Authors ranklist | Current Contest Past Contests Scheduled Contests Award Contest |
| Language: Default Power Strings
Given 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, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n). Input Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case. Output For each s you should print the largest n such that s = a^n for some string a. Sample Input 1 4 3 |
关闭划词翻译
复制
复制全部
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Power Strings 【poj-2406】【KMP】
- POJ 2406 Power Strings 求连续重复字串（kmp）
- Power Strings - POJ 2406 KMP
- Power Strings (poj 2406 KMP)
- Power Strings (poj 2406 KMP)
- [2406]Power Strings (POJ) KMP
- Power Strings (poj 2406 KMP)
- POJ 2406 Power Strings KMP求周期
- poj 2406 Power Strings (KMP)
- POJ 2406 Power Strings KMP求周期
- Power Strings(POJ-2406)(KMP简单循环节)
- POJ 2406 Power Strings （KMP）
- poj 2406 Power Strings (最小重复子串出现次数 kmp)
- poj 2406 Power Strings（KMP轮回串）
- 【KMP】 POJ 2406 Power Strings
- POJ 2406 Power Strings KMP 或者后缀数组
- poj 2406 && poj 1961 (KMP)
- poj2406--Power Strings（KMP求最小循环节）
- poj 2406 kmp
- POJ -2406 Power Strings（循环节，kmp专题）