hdu 4813(2013长春现场赛A题)
2015-10-02 16:22
483 查看
把一个字符串分成N个字符串 每个字符串长度为m
Sample Input
1
2 5 // n m
klmbbileay
Sample Output
klmbb
ileay
# include <iostream> # include <cstdio> # include <cstring> # include <algorithm> # include <string> # include <cmath> # include <queue> # include <list> # define LL long long using namespace std ; char s[2000] ; int main() { //freopen("in.txt","r",stdin) ; int T ; scanf("%d" , &T) ; while(T--) { int n , m ; scanf("%d %d" , &n ,&m) ; int i , j ; int cnt = 0 ; scanf("%s" , s) ; for (i = 0 ; i < n ; i++) { for (j = 0 ; j < m ; j++) printf("%c" , s[cnt++]) ; printf("\n") ; } } return 0; }View Code
相关文章推荐
- Hibernate懒加载
- Python基础
- 03 crawler
- ocp-33
- [LeetCode][JavaScript]Reverse Linked List II
- 栈——括号匹配
- ocp-32
- HDU 2100 模拟
- leetcode 288: Unique Word Abbreviation
- Add Two Numbers - leetcode002
- 应用服务器性能优化
- ios动画
- GO RPC
- 零基础学python-19.8 生成器表达式:当迭代器遇上列表解析
- ocp-31
- mac Xcode/iOS license
- 【kmp字符串匹配】hdu 1686 Oulipo
- IOS视图切换
- NGUI点击事件的添加
- 零基础学python-19.8 生成器表达式:当迭代器遇上列表解析