题目描述
分析:
n1+n2+n3=N+2
n1=n3<=n2且n1,n3尽可能最大
3<=n2<=N
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string str="";
getline(cin,str);//读取字符串
int n1=(str.size()+2)/3,n2=str.size()+2-2*n1;//获取n1,n2
for(int i=0;i<n1-1;++i){
printf("%c",str[i]);
for(int j=0;j<n2-2;++j)
printf(" ");
printf("%c\n",str[str.size()-i-1]);
}
for(int i=0;i<n2;++i)
printf("%c",str[n1-1+i]);
return 0;
}