POJ 2271 HTML_不见不散的结局是曲终人散_新浪博客
HTML
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 6548 | Accepted: 2162 |
Description
If you ever tried to read a html document on a Macintosh, you know how hard it is if no Netscape is installed.
Now, who can forget to install a HTML browser? This is very easy because most of the times you don't need one on a MAC because there is a Acrobate Reader which is native to MAC. But if you ever need one, what do you do?
Your task is to write a small html-browser. It should only display the content of the input-file and knows only the html commands (tags)
which is a linebreak and
which is a horizontal ruler. Then you should treat all tabulators, spaces and newlines as one space and display the resulting text with no more than 80 characters on a line.
Now, who can forget to install a HTML browser? This is very easy because most of the times you don't need one on a MAC because there is a Acrobate Reader which is native to MAC. But if you ever need one, what do you do?
Your task is to write a small html-browser. It should only display the content of the input-file and knows only the html commands (tags)
which is a linebreak and
which is a horizontal ruler. Then you should treat all tabulators, spaces and newlines as one space and display the resulting text with no more than 80 characters on a line.
Input
The input consists of a text you should display. This text consists of words and HTML tags separated by one or more spaces, tabulators or newlines.
A word is a sequence of letters, numbers and punctuation. For example, "abc,123" is one word, but "abc, 123" are two words, namely "abc," and "123". A word is always shorter than 81 characters and does not contain any '<' or '>'. All HTML tags are either
or
.
A word is a sequence of letters, numbers and punctuation. For example, "abc,123" is one word, but "abc, 123" are two words, namely "abc," and "123". A word is always shorter than 81 characters and does not contain any '<' or '>'. All HTML tags are either
or
.
Output
You should display the the resulting text using this rules:
If you read a word in the input and the resulting line does not get longer than 80 chars, print it, else print it on a new line.
If you read a
in the input, start a new line.
If you read a
in the input, start a new line unless you already are at the beginning of a line, display 80 characters of '-' and start a new line (again).
The last line is ended by a newline character.
If you read a word in the input and the resulting line does not get longer than 80 chars, print it, else print it on a new line.
If you read a
in the input, start a new line.
If you read a
in the input, start a new line unless you already are at the beginning of a line, display 80 characters of '-' and start a new line (again).
The last line is ended by a newline character.
Sample Input
Hallo, dies ist eine ziemlich lange Zeile, die in Html aber nicht umgebrochen wird.
Zwei
produzieren zwei Newlines. Es gibt auch noch das tag
was einen Trenner darstellt. Zwei
produzieren zwei Horizontal Rulers. Achtung mehrere Leerzeichen irritieren Html genauso wenig wie mehrere Leerzeilen.
Sample Output
Hallo, dies ist eine ziemlich lange Zeile, die in Html aber nicht umgebrochen wird. Zwei produzieren zwei Newlines. Es gibt auch noch das tag -------------------------------------------------------------------------------- was einen Trenner darstellt. Zwei -------------------------------------------------------------------------------- -------------------------------------------------------------------------------- produzieren zwei Horizontal Rulers. Achtung mehrere Leerzeichen irritieren Html genauso wenig wie mehrere Leerzeilen.
题意：给你一段文字，让你按格式输出，遇到了
换行，遇到
输出80个‘-’，每一行最多有80个字符，如果超过80个，就换行，最后输出文本以一个换行符结束；
代码如下：
#include
#include
using namespace std;
int main()
{
char str[10000];
int sum=0,len;//用来记录当前行有多少个字符；
while(~scanf("%s",str))
{
if(!strcmp(str,"
"))
{
sum=0;
puts("");
}
else if(!strcmp(str,"
"))
{
if(!sum)//
前没有其他的字符；
{
for(int i=0; i<80; i++)
printf("-");
puts("");
}
else//
前有其他的字符；
{
puts("");
for(int j=0; j<80; j++)
printf("-");
puts("");
}
sum=0;
}
else
{
len=strlen(str);
if(!sum)//最开始输入；