acm-Abbreviation

Abbreviation

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 1

描述

As we know, we often use a short sequence of characters in place of some words with a very long name. For example, ACM is an abbreviation of “Association for Computing Machinery”. Now we are using an acronymic method to get the abbreviation. An acronym is generated from a long name by capitalizing the first letter of every word in the name and concatenating them together. There is an exception: some words are ignored when generating the abbreviation. These words( case insensitive) meet the following rules:

 1. The common words “and”, “for”, and “the”.

 2. The words with length less than 3, such as “a”, “of”, “to”. Your job is to get the abbreviation of a given string by using the acronymic method.

输入

Input starts with an integer T (T <= 100), denoting the number of test cases. Each case contains a line with several words seperated by space(s). The length of each line is less than 100. And you can assume that there is at least one available word for each case.

输出

For each case, print the abbreviation of the word.

样例输入

5
Online Judge
Association for Computer Machinery
Institute of Electrical and Electronics Engineers
The Lord of the Rings
netease

样例输出

OJ
ACM
IEEE
LR
N

来源

第11届中山大学程序设计竞赛预选赛（2008年）

我的代码：

#include
#include
#include
using namespace std;
int main()
{
	int n;
	scanf("%d",&n);
	getchar();
	while(n--)
	{
		char ans[100];
		gets(ans);
		int len=strlen(ans);
		int i,j,k;
		for(i=0;i3)
			{
				if(ans[i]>'Z')
					ans[i]-=32;
				printf("%c",ans[i]);	
			}
			else if(j-i==3)
			{
				/*
				char cmp[4];
				cmp[0]=ans[i];
				cmp[1]=ans[i+1];
				cmp[2]=ans[i+2];
				for(k=0;k<3;k++)
					if(cmp[k]<'a')
						cmp[k]+=32;
				cmp[4]='\0';
				*/
				string cmp="";
				for(k=i;k<3+i;k++)
				{
					if(ans[k]<'a')
						ans[k]+=32;
					cmp+=ans[k];	
				}
				if(cmp!="for"&&cmp!="and"&&cmp!="the")//if(!strcmp(cmp,"for")==0&&!strcmp(cmp,"the")==0&&!strcmp(cmp,"and")==0)
				{
					if(cmp[0]>'Z')
						cmp[0]-=32;
					printf("%c",cmp[0]);	
				}
			}
			i=j;
		}
		printf("\n");
	}
	return 0;
}