NEFU要崛起——第4场 B - Center Alignment

 
                                                      B - Center Alignment
                                        Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Description

Almost every text editor has a built-in function of center text alignment. The developers of the popular in Berland text editor «Textpad» decided to introduce this functionality into the fourth release of the product.

You are to implement the alignment in the shortest possible time. Good luck!

Input

The input file consists of one or more lines, each of the lines contains Latin letters, digits and/or spaces. The lines cannot start or end with a space. It is guaranteed that at least one of the lines has positive length. The length of each line and the total amount of the lines do not exceed 1000.

Output

Format the given text, aligning it center. Frame the whole text with characters «*» of the minimum size. If a line cannot be aligned perfectly (for example, the line has even length, while the width of the block is uneven), you should place such lines rounding down the distance to the left or to the right edge and bringing them closer left or right alternatively (you should start with bringing left). Study the sample tests carefully to understand the output format better.

Sample Input

Input
This  is

Codeforces
Beta
Round
5
Output
************
* This  is *
*          *
*Codeforces*
*   Beta   *
*  Round   *
*     5    *
************
Input
welcome to the
Codeforces
Beta
Round 5

and
good luck
Output
****************
*welcome to the*
*  Codeforces  *
*     Beta     *
*   Round 5    *
*              *
*      and     *
*  good luck   *
****************

 

 

 

 

 

题意:看看输入输出就明白了 输出个框框~        我懂得

 

代码:

 

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int mm=1111;
char s[mm][mm];
int i,n,m,ml,w,a,b;
void outc(int m,char c)
{
     while(m--)printf("%c",c);
}
int main()
{
    n=0;
    while(gets(s[n]))++n;
    for(ml=i=0;i<n;++i)
        ml=max(ml,(int)strlen(s[i]));
    outc(ml+2,'*');
    puts("");
    for(w=i=0;i<n;++i)
    {
        printf("*");
        m=ml-strlen(s[i]);
        a=m/2;
        if(m&1)a+=w,w=w^1;
        b=m-a;
        outc(a,' ');
        printf("%s",s[i]);
        outc(b,' ');
        printf("*\n");
    }
    outc(ml+2,'*');
    puts("");
    return 0;
}

来自 Pira  's source code
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值