浙江省赛problem 1003

Code Formatter

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 31   Accepted Submission(s) : 9

Problem Description

Some companies have special requirements for source code format, and it is also good for programmers to keep consistent code style. You are asked to write a simple code formatter for the company to help the poor programmers.

The first thing you need to do is to check whether the source code contains tabs (represented as the escape character '\t'), since different terminals have different ways to display tabs, it's better not to use them, but replace them with spaces. The code formatter should replace each tab of the source code with 4(four) blank spaces.

Then you need to remove trailing spaces of the source file. Trailing spaces are one or more consecutive whitespaces right before the EOL (end of line, represented as the escape character '\n'), and they usually have no meaning in most programming language, so they can be safely removed.

Input

The input contains multiple test cases!

The first line is an integer N indicating the number of test cases. Each test case is the source which contains not more than 100 lines given to you to format. A single line containing only "##" marks the end of a test case.

Output

For each test case, output a log of the formatter in two lines of the following format:

#A tab(s) replaced #B trailing space(s) removed Where #A is the number of tabs replaced and #B is the number of trailing spaces removed.

Sample Input

2include <stdio.h>int main(){int a,b;while(scanf("%d %d",&a, &b) != EOF) printf("%d\n",a+b);                     }####

Sample Output

4 tab(s) replaced
22 trailing space(s) removed
0 tab(s) replaced
0 trailing space(s) removed

Note

In order to show the whitespaces precisely, all the characters in sample input areunderlined. They are not the underscore character.

 

 

Source

Zhejiang Provincial Programming Contest 2007

字符查找水

题目大意：统计一段字符（或者说几个字符串，因为内有换行）中的tab数，和后缀空格数，并按格式输出。

题目分析：本题有一坑点，请注意problem description里第二段的最后一句，在以下程序里的体现是我注释五个星号的地方。就这一点需要仔细，其余水。

#include<iostream>#include<string>using namespace std;int main(){    int tab,ts,t;    string c;    cin>>t;    while(t--)    {        tab=ts=0;        while(getline(cin,c,'\n'))//&&(c[0]!='#'||c[1]!='#'))        {            if(c.size()==2)            {                if(c[0]=='#'&&c[1]=='#')break;            }            for(int i=0; i<c.size(); i++)            {                if(c[i]=='\t')tab++;            }            for(int i=c.size()-1; i>=0; i--)            {                if(c[i]==' ')ts++;                else if(c[i]=='\t')//*****                {                    ts+=4;                }                else break;            }        }        cout<<tab<<" tab(s) replaced"<<endl;        cout<<ts<<" trailing space(s) removed"<<endl;    }    return 0;}

本题核心算法：单个字符查找…………