HDU - 1200 To and Fro(水)
来源:互联网 发布:java 自定义构造函数 编辑:程序博客网 时间:2024/06/06 19:42
题目大意:有一个字符串,原串是从左到右,从上往下,写成了m列,k行
现在给你这个字符串,从第一行开始,奇数行从左往右,偶数行从右往左的出现顺序,然后要求你还原这个字符串
解题思路:找到规律,直接解决
#include <cstdio>#include <cstring>const int N = 210;char str[N];int n;void solve() { int len = strlen(str); int row = len / n; //flag == 1表示奇数行,start表示的是都到第几列了, interval表示间隔 int t = len, flag = 1, start = 0, interval = 1; int pos = start; if (row == 1) { printf("%s\n", str); return ; } while (t--) { printf("%c", str[pos]); if (flag) pos += 2 * n - 1; else pos += interval; if (pos >= len) { pos = ++start; flag = 1; n--; interval += 2; } else flag ^= 1; } printf("\n");}int main() { while (scanf("%d", &n) != EOF && n) { scanf("%s", str); solve(); } return 0;}
0 0
- HDU - 1200 To and Fro(水)
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- hdu-1200-To and Fro
- HDU-1200To and Fro
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- HDU 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu-1200 To and Fro
- vfork http://blog.csdn.net/tennysonsky/article/details/45847107
- 面试题22:栈的压入、弹出序列
- POJ1703 && POJ2942 &&POJ 1182 并查集 这个做法挺巧妙
- 数据库的优化
- Mysql数据库备份数据库与还原数据库
- HDU - 1200 To and Fro(水)
- Android Design: 九种常见Activity及代码解析之"Navigation Drawer Activity"
- SQL常用命令
- 查找二叉树
- EIP和目标地址的关系
- DirectX11 骷髅头示例Demo
- UVA 11177 凸多边形和圆交
- POJ - 2029 Get Many Persimmon Trees(暴力水题)
- Android控件布局属性全解