topcoder-srm-233-div2
2013-01-06 16:05
423 查看
#include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; class JustifyText{ public: vector<string> format( vector<string> text ){ /*find the max length*/ int max_length = 0; for(int i=0; i<text.size(); ++i ) if( text[i].length() > max_length ) max_length = text[i].length(); vector<string> result = text; /*padding every string*/ for(int i=0; i<result.size(); ++i) if( result[i].length() < max_length ){ reverse( result[i].begin(), result[i].end() ); for( int k=result[i].length(); k<max_length; ++k ) result[i].push_back(' '); reverse( result[i].begin(), result[i].end() ); } return result; } private: };
相关文章推荐
- topcoder SRM 591 DIV2 TheArithmeticProgression
- TopCoder SRM 595 Div2 第3题
- 【TopCoder SRM 157 DIV 1】 Salary 解题报告
- Topcoder SRM 598 div2
- Topcoder SRM 146 Div2 1000(dfs搜索,经典过桥问题,很有意思)
- Topcoder SRM 661 (Div.1) 250 MissingLCM - 数论
- topcoder srm 400 div1
- TopCoder SRM 633 Div2 Problem 500 - Jumping
- TopCoder SRM 602 Div1 第1题
- Topcoder SRM 562 DIV2 900 RandomOption
- Topcoder SRM 152 Div2 1000(状态压缩呀)
- TopCoder SRM 512 DIV1 MysteriousRestaurant
- TopCoder——SRM 516 DIV 2
- Topcoder SRM144 div2 1100
- TopCoder SRM 701 div1. 900 FibonacciStringSum - 矩阵乘法
- topcoder SRM400 div2 1000point(pass system test)
- TopCoder 300 points 1-SRM 144 DIV 1 90/300 30%
- Topcoder SRM 663 DIV 1
- TopCoder SRM480 DIV1 Practise
- Topcoder SRM 583 DIV2 SwappingDigits