poj 3602-字符串模拟

D - Typographical Ligatures

Time Limit:1000MS     Memory Limit:131072KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  POJ 3602

Description

Typesetting involves the presentation of textual material in graphic form on paper or some other medium. Close as it is related to our daily life, typesetting exhibits certain complexities which may be unfamiliar and sometimes unimaginable to the layman. The use of typographical ligatures is one such complexity.

Compare the two appearances of the word “define” in Figure 7. Figure 7(a) illustrates the word typeset with the “fi” ligature as Knuth’s TeX does. The letters “f” and “i” are combined into a single glyph. Figure 7(b) shows the word typeset without the ligature as Microsoft Word does. The letters “f” and “i” remain separate. Other examples include the “ff”, “ffi”, “fl” and “ffl” ligatures, as shown in Figure 8. Perhaps the most notable ligature in active use is the “&” (ampersand), which originated from “et”, the Latin word for “and”.

define		define
(a)		(b)

Figure 7: The word “define” typeset with and without the “fi” ligature

effect

office

reflect

waffle

Figure 8: Examples of the “ff”, “ffi”, “fl” and “ffl” ligatures

Ligatures are primarily intended to improve spacing between letters. Despite that their impact on legibility is debated and that their use is declining, some people insist that they are an essential part of quality typesetting. In order to typeset ligatures, separate glyphs have to be used since ligatures generally differ from direct combinations of their constituent letters in most cases.

Given some text, count the number of glyphs that have to be used to typeset it. Only the “ff”, “fi”, “ffi”, “fl”, and “ffl” ligatures are considered. Note that they are case-sensitive. Ligatures are recognized following the leftmost longest rule—find the leftmost match, then the longest match if there are any ties. Each distinct letter, ligature or punctuation mark requires a separate glyph. However, if a letter appears only in ligatures and nowhere else, it shall not be assigned a glyph. Furthermore, left single and double quotes differ from their right counterparts. Spaces do not require a glyph.

Input

The input contains a single test case consisting of some text. The text is given on multiple lines not longer than 100 characters each. The text contains only letters (lowercase and uppercase), punctuation marks and spaces. Punctuation marks include periods, commas, semicolons, colons, single and double quotes, exclamation and question marks. Quotes are represented by “`” (left single quote), “'” (right single quote), “``” (left double quote) and “''” (right double quote), respectively. They are also recognized following the leftmost longest rule. The input ends where EOF is met.

Output

Print the number of glyphs that have to be used to typeset the given text.

Sample Input

```define, effect; office.
reflect? waffle!'''

Sample Output

23

代码：

#include<stdio.h>
#include<string.h>

char s[1000];
int count[1000];
int ff[7];
int len;

void solve(){
	int ans=0;
	memset(count,0,sizeof(count));
	memset(ff,0,sizeof(ff));
	for(int i=0;i<len;i++){
		if(s[i]=='f'){
			if(s[i+1]=='f' && (s[i+2]=='i' || s[i+2]=='l')){
				if(s[i+2]=='i'){
					ff[2]++;
				}
				if(s[i+2]=='l'){
					ff[4]++;
				}		
				i+=2;	
			}	
			else if(s[i+1]=='f'){
				ff[0]++;
				i+=1;			
			}
			else if(s[i+1]=='i' || s[i+1]=='l'){
				if(s[i+1]=='i')ff[1]++;
				if(s[i+1]=='l')ff[3]++;
				i++;			
			}	
			else count[s[i]]++;
		}
		else if(s[i]=='`' && s[i+1]=='`'){
			ff[6]++;
			i++;			

		}
		else if(s[i]=='\'' && s[i+1]=='\''){
			ff[5]++;
			i++;				

		}	
		else count[s[i]]++;
	}
	for(int i=0;i<=256;i++){
		if(count[i])ans++;
	}
	for(int i=0;i<7;i++)if(ff[i])ans++;
	printf("%d\n",ans);
}


int main(){
	char c;
	len=0;
	while(scanf("%c",&c)!=EOF){
		if(c==' ' || c=='\n')continue;
		s[len++]=c;			
	}
	//printf("%s",s);
	solve();
}