codeforces 612 A. The Text Splitting

 1#include <cstdio>
 2#include <cstring>
 3#include <iostream>
 4#include <algorithm>
 5#include <vector>
 6#include <queue>
 7#include <set>
 8#include <map>
 9#include <string>
10#include <cmath>
11#include <cstdlib>
12#include <ctime>
13#define fst first
14#define sec second
15#define lson l,m,rt<<1
16#define rson m+1,r,rt<<1|1
17#define ms(a,x) memset(a,x,sizeof(a))
18typedef long long LL;
19#define pi pair < int ,int >
20#define MP make_pair

 1using namespace std;
 2const double eps = 1E-8;
 3const int dx4[4]={1,0,0,-1};
 4const int dy4[4]={0,-1,1,0};
 5const int inf = 0x3f3f3f3f;
 6const int N=105;
 7int n,p,q;
 8char st[N];
 9bool v[10005];
10int main()
11{
12	#ifndef  ONLINE_JUDGE 
13	freopen("code/in.txt","r",stdin);
14  #endif
15	cin>>n>>p>>q;
16	cin>>st;
17	ms(v,false);
18	int b,c;
19	for ( int i = 0 ; i*p<=105 ; i++ )
20	{
21	    for ( int j = 0 ; j*q <= 105 ; j++)
22	    {
23		v[i*p+j*q] = true;
24		if (i*p+j*q==n)
25		{
26		    b = i;
27		    c = j;
28		}
29	    }
30	}
31//	cout<<"b:"<<b<<endl;
32//	cout<<"c:"<<c<<endl;
33	if (!v[n])
34	{
35	    puts("-1");
36	}
37	else
38	{
39	    int cnt = 0 ;
40	    printf("%d\n",b+c);
41	    for ( int i = 1 ; i <=  b ; i++)
42	    {
43		for ( int i = 0 ; i < p ; i++)
44		    printf("%c",st[cnt]),cnt++;
45		printf("\n");
46	    }
47	    for ( int i =1 ; i <= c ; i++)
48	    {
49		for ( int i = 0 ; i < q ; i++)
50		    printf("%c",st[cnt]),cnt++;
51		printf("\n");
52	    }
53	}

1  #ifndef ONLINE_JUDGE  
2  fclose(stdin);
3  #endif
4    return 0;
5}