hdoj.4813 Hard Code【水题】 2015/08/08
来源:互联网 发布:js中的对象是什么 编辑:程序博客网 时间:2024/06/07 07:03
Hard Code
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 982 Accepted Submission(s): 697
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
注:水题,输出:m个字符一行,总共n行
#include<iostream>#include<cstdio>#include<cstring>using namespace std; int t,n,m; char str[1010];int main(){ cin>>t; while(t--){ scanf("%d %d",&n,&m); scanf("%s",str); int len = strlen(str); for( int i = 0 ; i < len ; ++i ){ printf("%c",str[i]); if( (i+1) % m == 0 ) printf("\n"); } } return 0;}
0 0
- hdoj.4813 Hard Code【水题】 2015/08/08
- HDU-#4813 Hard Code
- hdu 4813 Hard Code
- Hard Code 4813
- HDU 4813 Hard Code
- HDOJ Hard Code 4813【2013长春区域赛A题-水】
- HDU 4813-Hard Code-字符串
- - Hard Code
- HDU 4813——Hard Code
- HDU 4813 Hard Code(2013长春)
- hard code & hard working & hard night
- HDOJ A hard puzzle
- hard code || hardcode
- HDU4813-Hard Code
- 关于hard code
- hdu4813 Hard Code
- 什么是hard code
- HDU4813 Hard Code
- 使用VLC做流媒体服务器(直播形式)
- leetcode--Word Break II
- c语言time.h函数库小结
- [学习笔记]JavaScript基础--缓冲1
- TCP/IP详解学习笔记--TCP的坚持和保活定时器
- hdoj.4813 Hard Code【水题】 2015/08/08
- hash hdu1247 Hat’s Words
- 工厂设计模式
- 黑马程序员---struts2学习笔记之六(自定义拦截器)
- Android Gallery3D源码分析(二)
- NEUQ 1466: Huybery玩转模运算
- SDL播放yuv数据
- PageRank及其MapReduce实现
- [学习笔记]JavaScript基础--淡入淡出