44E. Anfisa the Monkey

老题目，不更新，不值1400分，建议减分

#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> a((int)6e5);
vector<int> b((int)6e5), c[(int)6e5];
const int mod = 1e9 + 7;
string s;
signed main()
{int n,a,b;cin>>n>>a>>b;cin>>s;int len = s.length();int cou = len/n;int ff = 1;if (cou<a) ff = 0;if (cou==b&&len%n) ff= 0;if (cou>b) ff = 0;if (ff){int res = 0;int kk = len%n;for (int i=0;i<len;i++){cout<<s[i];res++;if (res==cou+1&&kk) {res = 0;kk--;cout<<endl;}if (kk==0&&res==cou){res = 0;cout<<endl;}}}else cout<<"No solution"<<endl;
}