题意:
就是做一个表格;
每格最多10个字符;
给你三天的课,叫你做这三天的课程表;
每节课都是由不超过五个单词构成;
每个单词长度在1 - 10之内;
如果一格放不下,就换到下一格;
一格的几个单词长度加起来不超过10;
就入题上的图一样
做法就是模拟;
此代码只是个人模拟,并没有什么技术含量,只是纪念
#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#define maxn 100100
#define INF 1e7
#define ll long long
#define x first
#define y second
using namespace std;
typedef pair<int, ll> P;
string week[5][5];
int query(string sr)
{
if (sr == "Tuesday") return 0;
else if (sr == "Thursday") return 1;
else return 2;
}
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i)
{
getchar(); //gets要把换行符'\n'吃掉
int num;
char str[maxn/100];
string sr;
gets(str);
cin >> sr >> num;
int x = query(sr);
for (int i = 0; i < strlen(str); ++i)
week[x][num - 1] += str[i];
}
for (int j = 0; j < 4; ++j)
{
printf("+----------+----------+----------+\n");
int len[3] = {0}; //记录用去的长度
int c = 1;
while(1)
{
printf("|");
for (int i = 0; i < 3; ++i)
{
string sx = week[i][j];
if (len[i] + 10 < sx. size()) //判断剩余字符串长度是否大于10个
{
if (sx[len[i] + 10] != ' ') //判断第11个是否是' '(数组从 0 开始)
{
int k = 10;
while (sx[len[i] + k] != ' ') --k; //如果第11个不是' ',就向前推
for (int m = len[i]; m < len[i] + k; ++m)
cout << sx[m];
for (int m = k; m < 10; ++m)
printf(" ");
len[i] = len[i] + k + 1; //只加上用去的字符串长度
}
else //如果是空格,就直接将前面的全部输出
{
for (int k = len[i]; k < len[i] + 10; ++k)
cout << sx[k];
len[i] += 11;
}
}
else
{
if (len[i] < sx.size()) //如果长度不足10个并且还有剩下
{
for (int k = len[i]; k < sx.size(); ++k)
cout << sx[k];
for (int k = sx.size(); k < len[i] + 10; ++k)
printf(" ");
}
else //没有剩下的字符串了
printf(" ");
len[i] += 11;
}
printf("|");
}
printf("\n");
int flag = 0;
for (int k = 0; k < 3; ++k) //判断是否已经将所有的字符串输出完了
{
if (len[k] < week[k][j].size())
flag = 1;
}
if (!flag) break;
}
}
printf("+----------+----------+----------+\n");
return 0;
}