HDOJ Hard Code 4813【2013长春区域赛A题-水】
来源:互联网 发布:listmap转json 编辑:程序博客网 时间:2024/06/08 02:44
Hard Code
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 959 Accepted Submission(s): 676
Problem Description
Some strange code is sent to Da Shan High School. It's said to be the prophet's note. The note is extremely hard to understand. However, Professor Meng is so smart that he successfully found the pattern of the code. That is, the length of the code is the product of two prime numbers. He tries to reallocate the code into a grid of size N*M, where M is the bigger prime. In specific, he writes down the letters of the code to the cells one by one, from left to right, and from top to button. In this way, he found the code eventually readable.
Professor Meng wants to know all the secrets of the note right now. But he doesn't take his computer with him. Can you help him?
Professor Meng wants to know all the secrets of the note right now. But he doesn't take his computer with him. Can you help him?
Input
The first line of the input is L (L ≤ 1000), which means the number of test cases.
For each test case, the first line contains two prime numbers, which indicates N, M (0 < N * M ≤ 1000) as describe above. The second line contains a string, i.e., the code, containing only lowercase letters. It’s guaranteed the length of the string equals to N * M.
For each test case, the first line contains two prime numbers, which indicates N, M (0 < N * M ≤ 1000) as describe above. The second line contains a string, i.e., the code, containing only lowercase letters. It’s guaranteed the length of the string equals to N * M.
Output
For each test case, output N lines, each line with M letters representing the readable code after the reallocation.
Sample Input
12 5klmbbileay
Sample Output
klmbbileay
Source
2013 Asia Regional Changchun
Recommend
liuyiding | We have carefully selected several similar problems for you: 5363 5362 5361 5360 5359
题意:就是让你把一个串按N行M列输出
水水更健康。
#include <stdio.h>#include <math.h>#include <vector>#include <queue>#include <string>#include <string.h>#include <stdlib.h>#include <iostream>#include <algorithm>using namespace std;int main(){ int t; scanf("%d",&t); while(t--){ int N,M; char s[1010]; scanf("%d%d",&N,&M); scanf("%s",s); int l=strlen(s); int k=0,x=0; for(int i=0;i<l;i++){ printf("%c",s[i]); if((i+1)%M==0){ printf("\n"); } } } return 0;}
0 0
- HDOJ Hard Code 4813【2013长春区域赛A题-水】
- HDU - 4813 Hard Code (长春赛区水题)
- HDU 4813 Hard Code(2013长春)
- HDOJ Hard Disk Drive 4788【2013成都区域赛H题-水】
- 2013长春区域赛小结
- 2013 长春区域赛总结
- 2013亚洲区域赛长春站总结
- UVALive 6711(2013长春区域赛)
- UVALive 6712(2013长春区域赛)
- ZOJ 3659 Conquer a New Region【长春区域赛E】
- HDOJ A hard puzzle
- hdoj.4813 Hard Code【水题】 2015/08/08
- 2015acm区域赛长春
- 2013 ACM/ICPC 亚洲区域赛长春赛区 总结
- HDOJ 1097 A hard puzzle
- HDOJ 1097 A hard puzzle
- 【HDOJ】1097 -> A hard puzzle
- hdoj 1097 A hard puzzle
- Summary for week4
- java集合(工具类Arrays)
- Linux 技巧:让进程在后台可靠运行的几种方法
- ubuntu启用root远程登录
- Windows Azure Platform体验(2):SQL Azure
- HDOJ Hard Code 4813【2013长春区域赛A题-水】
- Windows Azure Platform体验(1):Windows Azure
- 树莓派2引脚
- 左手代码,右手诗——那些年我写给老婆的诗
- 手动扩大栈内存
- 常见浏览器内核概述
- javascript基本知识学习第二天
- C++浅析——虚表和虚表Hook
- VMWare 虚拟机中无法启用键盘的解决办法(PS/2标准键盘)