L1-039. 古风排版
问题描述
代码
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,count = 0;
cin >> n;
getchar();
string str;
getline(cin,str);
int len = str.length();
int m = len / n;
if (m * n < len) {
m++;
}
char a[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
a[i][j] = ' ';
}
}
for (int i = m - 1; i >= 0; i--) {
for (int j = 0; j < n; j++) {
a[j][i] = str[count];
count++;
if (count == len)
break;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << a[i][j];
}
cout << endl;
}
return 0;
}