zoukankan      html  css  js  c++  java
  • Codeforces Beta Round #5 B. Center Alignment 模拟题

    B. Center Alignment

    题目连接:

    http://www.codeforces.com/contest/5/problem/B

    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

    This is

    Codeforces
    Beta
    Round
    5

    Sample Output


    • This is *
    •      *
      

    Codeforces

    • Beta *
    • Round *
    • 5    *
      

    Hint

    题意

    给你一堆字符串,让你居中

    如果恰好居中的话,那就居中

    如果不是的话,先偏左边,然后再偏右边去

    题解:

    模拟题,按照题意模拟就好了。

    代码

    #include<bits/stdc++.h>
    using namespace std;
    const int maxn = 2005;
    string s[maxn],s1;
    int mx,tot;
    int main()
    {
        while(getline(cin,s1))
        {
            s[tot++]=s1;
            mx = max((int)s1.size(),mx);
        }
        for(int i=0;i<mx+2;i++)
            cout<<"*";
        cout<<endl;
        int d = 0;
        for(int i=0;i<tot;i++)
        {
            cout<<"*";
            int len = (mx-s[i].size());
            if(len%2==1)d++;
            int l = len/2;
            int r = len/2;
            if(len%2==1&&d%2==1)r++;
            else if(len%2==1)l++;
            for(int j=0;j<l;j++)cout<<" ";
            cout<<s[i];
            for(int j=0;j<r;j++)cout<<" ";
            cout<<"*"<<endl;
        }
        for(int i=0;i<mx+2;i++)
            cout<<"*";
        cout<<endl;
    }
  • 相关阅读:
    获取Oracle、SqlServer、Access中表名、字段和主键(转)
    Oracle事务控制总结
    Oracle数据类型
    Oracle中的数据字典技术及常用数据字典总结
    asp.net中的<%%>形式的详细用法总结
    一道sql面试题的解答
    求ax(2)+bx+c=0的解
    求发票的下一个号码
    软件设计师2008年12月下午试题4(C语言 动态规划)
    软件设计师1991下午试题1(流程图解析)
  • 原文地址:https://www.cnblogs.com/qscqesze/p/5304189.html
Copyright © 2011-2022 走看看