codeforce 5B Center Alignment

B. Center Alignment
time limit per test
1 second
memory limit per test
64 megabytes
input
standard input
output
standard output

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.


题目大意是给一些字符串,然后依次将他们居中打印出来。然后用一个最小的星星围成的矩形把这些包围起来。当不能恰好居中的时候比较麻烦,需要先中靠左输出,下次遇到不能恰好居中的就中偏右输出,交替进行。我会告诉你我这题交了7次么,瞎了。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;

void putc(int n, char c) {
    while (n--) cout << c;
}

int main() {
    string str[1005];
    char ctmp[1005];
    int cnt = 0;
    int longest = 0;
    while (cin.getline(ctmp, 1005)) {
        str[cnt] = ctmp;
        if (str[cnt].length() > longest) longest = str[cnt].length();
        cnt ++;
    }

    int err = 0;
    int left, right;

    putc(longest+2, '*');
    cout << endl;
    for (int i = 0; i < cnt; i++) {
        left = (longest - str[i].length()) / 2;
        right = longest - left - str[i].length();
        if (left != right) {
            left += (err % 2 == 0 ? 0 : 1);
            right -= (err % 2 == 0 ? 0 : 1);
            err++;
        }

        cout << '*';
        putc(left, ' ');
        cout << str[i];
        putc(right, ' ');
        cout << '*' << endl;
    }
    putc(longest+2, '*');
    cout << endl;

    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值