# Period

Problem Statement

Solution:

1. compute KMP function f for the input string
2. for each i<n, if $i \mod i-f(i) = 0$ and $f(i)\neq 0$ print $i$ with $k=i/(i-f(i))$

The hardest thing here is to prove that this procedure is correct.