2341.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

#define debug 0
#define NMAX 10001
#define INF 1000000001
#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>

char str[NMAX];
int endflag;
int sum;

int checkend(char cs)
{
	switch (cs)
	{
	case '.':
	case '!':
	case '?':return 1;
	default: return 0;
	}
	return 0;
}
void solve()
{
	endflag=1;
	char cs;
	if(scanf("%c",&cs)==EOF)
		return ;
	while(1)
	{
		if(isalpha(cs))
		{
			if(endflag==1)
			{
				endflag=0;
				if(islower(cs))
					sum++;
			}
			while(1)
			{
				if(scanf("%c",&cs)==EOF)
					return ;
				if(isupper(cs))
					sum++;
				if(!isalpha(cs))
					break;
			}
		}
		if(checkend(cs))
		{
			endflag=1;
		}
		if(scanf("%c",&cs)==EOF)
			return ;

			
	}
}
main()
{
#if debug
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
#endif
	solve();
	printf("%d",sum);
#if debug
	fclose(stdin);
	fclose(stdout);
#endif;
	return 1;
}