1031. Hello World for U (20)-PAT甲级真题
来源:互联网 发布:广州拓飞涉密数据恢复 编辑:程序博客网 时间:2024/05/29 07:04
1031. Hello World for U (20)
Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, “helloworld” can be printed as:
h d
e l
l r
lowo
That is, the characters must be printed in the original order, starting top-down from the left vertical line with n1 characters, then left to right along the bottom line with n2 characters, and finally bottom-up along the vertical line with n3 characters. And more, we would like U to be as squared as possible — that is, it must be satisfied that n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N } with n1 + n2 + n3 – 2 = N.Input Specification:
Each input file contains one test case. Each case contains one string with no less than 5 and no more than 80 characters in a line. The string contains no white space.Output Specification:
For each test case, print the input string in the shape of U as specified in the description.Sample Input:
helloworld!Sample Output:
h !
e d
l l
lowor
分析:这道题就是把一个字符串编程U型输出,n1,n3就是左右两边竖着的,这两个值相等,n2就是U型底部的,要大于n1,n2。
既然这样的话,就先把整个字符串平均分成3部分。因为要求n2>=n1,n1还要尽可能大,也就是n%3这多出来的不能给侧面,只可能给n2,所以。
n1=n/3,n2=n/3+n%3
#include <cstdio>#include <string.h>using namespace std;int main() { char c[81]; char u[30][30]; memset(u, ' ', sizeof(u)); scanf("%s", c); int n = strlen(c) + 2; int n1 = n / 3; int n2 = n1 + n % 3; int index = 0; for(int i = 0; i < n1; i++) { u[i][0] = c[index++]; } for(int i = 1; i <= n2 - 2; i++) { u[n1-1][i] = c[index++]; } for(int i = n1 - 1; i >= 0; i--) { u[i][n2-1] = c[index++]; } for(int i = 0; i < n1; i++) { for(int j = 0; j < n2; j++) { printf("%c", u[i][j]); } printf("\n"); } return 0;}
- 1031. Hello World for U (20)-PAT甲级真题
- 1031. Hello World for U (20)-PAT甲级真题
- PAT甲级真题及训练集(11)--1031. Hello World for U (20)
- [PAT-甲级]1031.Hello World for U
- PAT甲级.1031. Hello World for U (20)
- 1031. Hello World for U (20) PAT 甲级
- 【PAT甲级】1031. Hello World for U (20)
- PAT甲级练习1031. Hello World for U (20)
- PAT甲级1031. Hello World for U (20)
- PAT 甲级 1031. Hello World for U (20)
- PAT甲级 1031. Hello World for U (20)
- PAT(甲级)Hello World for U (20)
- 1031. Hello World for U (20)-PAT
- 【PAT】1031. Hello World for U (20)
- PAT 1031. Hello World for U (20)
- PAT 1031. Hello World for U (20)
- PAT 1031. Hello World for U (20)
- pat 1031. Hello World for U (20)
- 【第三届蓝桥杯】转方阵
- 发布到百度平台遇到的问题
- IntelliJ Idea 2017 免费激活方法
- AnimationDrawable资源的使用
- Android 热修复以及阿里AndFix方案使用
- 1031. Hello World for U (20)-PAT甲级真题
- 决策树算法(一)-相关概念
- 智能小车48:不用volatile,编译器会优化什么?
- 腾讯微博列表展示的功能实现
- ROS学习笔记 进不去目录 beginner_tutorials
- 如何解决fpga high fanout问题
- mysql explain执行计划详解
- OpenCV-Python-Tutorial[4]
- 使用memcache的方式存储session内容