← 返回 capitalone 的题目列表Ordered Fragment Pairs String-Counting Problem
类型：online_judge
A string-counting problem that asks for the number of ordered fragment pairs whose concatenation exactly equals a given password.
Example
Input
password: 'secret', fragments: ['sec', 'ret', 'sec', 'ret']
Output
2