Educational Codeforces Round 4 A. The Text Splitting 水题
2015-12-28 10:32
441 查看
A. The Text Splitting
题目连接:
http://www.codeforces.com/contest/612/problem/ADescription
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
The first line contains three positive integers n, p, q (1 ≤ p, q ≤ n ≤ 100).The second line contains the string s consists of lowercase and uppercase latin letters and digits.
Output
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
5 2 3Hello
Sample Output
2He
llo
Hint
题意
给你一个字符串,让你分割成长度为p,或者长度为q的串问你如何分割
题解:
数据范围很小,所以直接暴力枚举就好了代码
#include<bits/stdc++.h> using namespace std; string s; int main() { int n,p,q; cin>>n>>p>>q; cin>>s; for(int i=0;i<150;i++) { for(int j=0;j<150;j++) { if(i*p+j*q==s.size()) { cout<<i+j<<endl; for(int k=0;k<i;k++) { for(int t=0;t<p;t++) cout<<s[k*p+t]; cout<<endl; } for(int k=0;k<j;k++) { for(int t=0;t<q;t++) cout<<s[i*p+k*q+t]; cout<<endl; } return 0; } } } return puts("-1"); }
相关文章推荐
- 将[4,3,2,5,4,3]分割成[4,3,2]、[5,4,3]两个List的算法
- JSP中<base href="<%=basePath%>">作用
- 自定义progressBar(进度条)
- SpringMVC 定时任务执行两次问题的解决方案
- iOS生成同时支持armv7,armv7s,i386的静态库.a文件
- 多窗口类似支付宝,百度云的保护页面,当软件进入后台后,生成保护页面来验证,验证成功以后继续操作
- Apache Stratos探究:为什么要使用 Apache Stratos
- Android AysncTask的使用
- 准备跳槽了
- SAS学习笔记6
- Java线程篇(六):线程池
- GC基本算法及C++GC机制
- 禅道程序员的10条原则
- Jboss 数据源配置参数
- SpeedyCloud-云计算之旅
- POJ 3254 状态压缩DP
- Java线程篇(五):Timer和TimerTask
- win7下使用cpan安装Perl模块
- Nodejs socket.io 实现私聊:如何给指定客户端发送消息,不是群广播
- vs2008中C++项目编译过程中越来越慢