PAT 甲级 1031 Hello World for U (20 分)(一开始没看懂题意)
Given any string of N (≥) 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 } 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
题意:
一开始没看懂题意,看懂以后一遍过。
尽可能围成正方形。在满足n1=n3,且n1<=n2的条件下,n1尽可能地大。
底部字符数量 n2 最少为3。n1 = n3 要尽量等于 n2 。也就是说,n1 = n3 = (n+2) / 3;因为 '/ 3' 会截掉小数部分,所以 n1 和 n3 总是小于或者等于 n2 。
AC代码:
#include<bits/stdc++.h>
using namespace std;
char a[];
int main(){
cin>>a;
int l=strlen(a);
int n1=(l+)/;
int n2=l-n1*;
//cout<<n1<<" "<<n2<<endl;
for(int i=;i<n1-;i++){
cout<<a[i];
for(int j=;j<=n2;j++){
cout<<" ";
}
cout<<a[l--i]<<endl;
}
for(int i=n1-;i<=n1+n2;i++){
cout<<a[i];
}
return ;
}
最新文章
- Chrome54安装最新版Flash版本办法
- 他答对一半(打一字)asp.net开源简答题项目
- 图片延迟加载(用jq自己写的方法)
- 如何导入大sql文件到虚拟主机mysql数据库
- RPC、SQL、NFS属于OSI的哪一层
- C#一般处理程序获取Session
- Android 图片处理效果集
- crm使用soap插入下拉框选项
- insertable = false, updatable = false的使用
- 在windows下运行spark
- linux 虚拟机模拟配置网络路由环境-简版
- C语言实现数据结构中的堆创建,堆排序
- Deep Learning for Information Retrieval
- 一个简单的安卓+Servlet图片上传例子
- VUE 利用webpack 给生产环境和发布环境配置不同的接口地址
- leetcode-978. 最长湍流子数组
- Sublime Text 3 Build 3143 可用License
- WPF 未能加载文件或程序集“CefSharp.Core.dll”或它的某一个依赖项
- MySQL客户端管理
- python中的partition、rpartition