Hard Code 4813
来源:互联网 发布:时时彩软件破解版 编辑:程序博客网 时间:2024/05/17 07:06
Hard Code
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1008 Accepted Submission(s): 714
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#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char a[1010];int main(){int n,m,i,s,j,t;scanf("%d",&t);while(t--){scanf("%d%d",&n,&m);s=n*m;scanf("%s",a);for(i=0,j=0;i<s;i++,j++){if(j==m){j=0;printf("\n");}printf("%c",a[i]);}printf("\n");}return 0;}
0 0
- HDU-#4813 Hard Code
- hdu 4813 Hard Code
- Hard Code 4813
- HDU 4813 Hard Code
- HDU 4813-Hard Code-字符串
- - Hard Code
- HDU 4813——Hard Code
- HDU 4813 Hard Code(2013长春)
- hard code & hard working & hard night
- hard code || hardcode
- HDU4813-Hard Code
- 关于hard code
- hdu4813 Hard Code
- 什么是hard code
- HDU4813 Hard Code
- HDU - 4813 Hard Code (长春赛区水题)
- hdoj.4813 Hard Code【水题】 2015/08/08
- hdu 4813 Hard Code (字符串水题)
- 实现ModelDriver接口的功能
- [bzoj3105]新Nim游戏 [bzoj2460]元素
- mysql数据库主从同步过程详述
- 大学就知道认真写博客-但现实总是偏离轨迹
- nyoj 14 会场安排问题
- Hard Code 4813
- php笔记
- 【Ajax技术】JQuery处理XML数据
- deeplearning库Caffe在windows下的配置
- TTL与RS-485电平转换芯片MAX485/MAX3485
- 【零基础】CentOS 7 64位系统下编译Hadoop2.7.0
- 利用ajax获取商品价格
- 线程小感
- 设置字符串中某些字符的特殊效果