2564.cpp

来自「HDOJ2501-2681acm解题报告」· C++ 代码 · 共 28 行

#include<iostream>
using namespace std;
int main()
{
	int n,m,i,j,k;
	char ch[500];
	while(scanf("%d",&n)!=EOF)
	{
		gets(ch);
		while(n--)
		{
			gets(ch);
			if(ch[0]<='z'&&ch[0]>='a')
				printf("%c",ch[0]-'a'+'A');
			else if(ch[0]<='Z'&&ch[0]>='A')
				printf("%c",ch[0]);
			for(i=1;i<strlen(ch);i++)
			{
				if(ch[i-1]==' '&&ch[i]<='z'&&ch[i]>='a')
					printf("%c",ch[i]-'a'+'A');
				else if(ch[i-1]==' '&&ch[i]<='Z'&&ch[i]>='A')
					printf("%c",ch[i]);
			}
			printf("\n");
		}
	}
}