题意:给定一个串和两个数字p、q,你只能把串分成p长和q长的部分,让你输出任意一种方案。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (100000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
#define first fi
#define second se
using namespace std;
int main()
{
int n, p, q;
Ri(n); Ri(p); Ri(q);
char str[110]; Rs(str); bool flag = false;
for(int i = 0; i <= n; i++)
{
for(int j = 0; j <= n; j++)
{
if(i * p + j * q == n)
{
Pi(i+j); int k = 0;
for(int k = 0; k < i; k++)
{
for(int l = k*p; l < (k+1)*p; l++)
printf("%c", str[l]);
printf("\n");
}
for(int k = 0; k < j; k++)
{
for(int l = i*p + k*q; l < (k+1)*q + i*p; l++)
printf("%c", str[l]);
printf("\n");
}
flag = true;
break;
}
}
if(flag)
break;
}
if(!flag)
Pi(-1);
return 0;
}