CodeForces 612A The Text Splitting
2016-04-22 23:46
369 查看
题意:
给你一个字符串,让你分割成长度为p,或者长度为q的串
问你如何分割
思路:直接暴力枚举..
Description
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
Input
Output
Input
Output
Input
Output
Input
Output
给你一个字符串,让你分割成长度为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"); }
Description
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
Input
5 2 3 Hello
Output
2 He llo
Input
10 9 5 Codeforces
Output
2 Codef orces
Input
6 4 5 Privet
Output
-1
Input
8 1 1 abacabac
Output
8 a b a c a b a c
相关文章推荐
- 图解javascript中this指向
- 几个Android开发中遇到的问题
- Leetcode #51&52 N-Queens I&II N皇后问题 1&2 解题报告
- 在linux中给你的应用做压力测试
- Java中的反射机制
- Caffe源码阅读(1) 全连接层
- 在Oracle中索引的使用
- Android网络通信
- 第 3 章 表格和按钮
- XAMPP环境下配置Phalcon框架
- Win10系统自带输入法的人机交互设计
- 264. Ugly Number II
- End_Of_My_College_Life
- FLume:通过端口监控flume的运行程序
- android:向res/drawable里面添加图片+制作.9.png
- 浅谈dp 动态规划(1)
- Caffe源码阅读(2) 卷积层
- 【BZOJ-1031】字符加密Cipher 后缀数组
- 用户场景描述
- 个人工作总结04