九度1464:Hello World for U
题目1464:Hello World for U
时间限制:1 秒
内存限制:128 兆
特殊判题:否
提交:2967
解决:834
题目描述:
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.
输入:
There are multiple test cases.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.
输出:
For each test case, print the input string in the shape of U as specified in the description.
样例输入:
helloworld!
ac.jobdu.com样例输出:
h !
e d
l l
lowor
a m
c o
. c
jobdu.
来源:
2012年浙江大学计算机及软件工程研究生机试真题
思路:注意"n1 + n2 + n3 - 2 = N.",最好将n1,n2,n3都取得平均值,即n1=n2=(n+2)/3-1
#include<stdio.h> #include<string.h> char a[100]; int main() { int i,j,n,n1,n2,n3,m1,m2; while(scanf("%s",a)!=EOF) { n=strlen(a); n1=n2=(n+2)/3-1; n3=n-2*n1; for(i=0;i<n1;i++) { printf("%c",a[i]); for(j=0;j<n3-2;j++) printf(" "); printf("%c\n",a[n-i-1]); } m1=i;m2=n-i; for(i=m1;i<m2;i++) printf("%c",a[i]); puts(""); memset(a,0,sizeof(0)); } return 0; }
最后更新:2017-04-03 12:56:01
上一篇:
Android 可拖拽的GridView效果实现, 长按可拖拽和item实时交换
下一篇:
仿微信聊天表情发送
linux驱动开发--copy_to_user 、copy_from_user函数实现内核空间数据与用户空间数据的相互访问
Quartus中仿真时出现no simulation input file assignment specify
Apache Storm 官方文档 —— Hooks
android视频项目使用资源
Android分享到腾讯微博,信息,新浪微博等等,的实现方式
CyclicBarrier的使用
Ensemble learning: Boosting
《软件工艺师:专业、务实、自豪》一2.5 由传统开发方式向敏捷转型
Ansible 怎么可以缺少阿里云
向谷歌提出删除内容的请求都合理吗?未必