2543.The Text Splitting

Time Limit: 1s Memory Limit: 256MB

You are given the string s of length n and the numbers p,q. Split the string s to pieces of length p and q.

For example, the string "Hello" for p=2, q=3 can be split to the two strings "Hel" and "lo" or to the two strings "He" and "llo".

Note it is allowed to split the string s to the strings only of length p or to the strings only of length q (see the second sample test).

Input Format(From the terminal/stdin)

The first line contains three positive integers n,p,q (1 \le p,q \le n \le 100).

The second line contains the string s consists of lowercase and uppercase latin letters and digits.

Output Format(To the terminal/stdout)

If it's impossible to split the string s to the strings of length p and q print the only number "-1".

Otherwise in the first line print integer k - the number of strings in partition of s.

Each of the next k lines should contain the strings in partition. Each string should be of the length p or q. The string should be in order of their appearing in string s - from left to right.

If there are several solutions print any of them.

Sample Input 1

Copy 
5 2 3
Hello
 · · \n
     \n

Sample Output 1

Copy 
2
He
llo
 \n
  \n
   \n

Sample Input 2

Copy 
10 9 5
Codeforces
  · · \n
          \n

Sample Output 2

Copy 
2
Codef
orces
 \n
     \n
     \n

Sample Input 3

Copy 
6 4 5
Privet
 · · \n
      \n

Sample Output 3

Copy 
-1
  \n

Sample Input 4

Copy 
8 1 1
abacabac
 · · \n
        \n

Sample Output 4

Copy 
8
a
b
a
c
a
b
a
c
 \n
 \n
 \n
 \n
 \n
 \n
 \n
 \n
 \n

Submit

请先 登录
 Submit
题解(0)
© 2025 FAQs