zoukankan      html  css  js  c++  java
  • Andy's First Dictionary

    Description

    Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the words himself, he has a briliant idea. From his bookshelf he would pick one of his favourite story books, from which he would copy out all the distinct words. By arranging the words in alphabetical order, he is done! Of course, it is a really time-consuming job, and this is where a computer program is helpful.

    You are asked to write a program that lists all the different words in the input text. In this problem, a word is defined as a consecutive sequence of alphabets, in upper and/or lower case. Words with only one letter are also to be considered. Furthermore, your program must be CaSe InSeNsItIvE. For example, words like "Apple", "apple" or "APPLE" must be considered the same.

    Input

    The input file is a text with no more than 5000 lines. An input line has at most 200 characters. Input is terminated by EOF.

    Output

    Your output should give a list of different words that appears in the input text, one in a line. The words should all be in lower case, sorted in alphabetical order. You can be sure that he number of distinct words in the text does not exceed 5000.

    Sample Input

    Adventures in Disneyland
    
    Two blondes were going to Disneyland when they came to a fork in the
    road. The sign read: "Disneyland Left."
    
    So they went home.

    Sample Output

    a
    adventures
    blondes
    came
    disneyland
    fork
    going
    home
    in
    left
    read
    road
    sign
    so
    the
    they
    to
    two
    went
    were
    when

    HINT

    #include<stdio.h>
    #include<string.h>
    char a[5000];
    int t;
    void zhuanhuan()     //大小写转换
    {
    	int i;
    	for(i=0;i<t;i++)
    	{
    		if(a[i]>='A'&&a[i]<='Z')
    			a[i]=a[i]+32;
    	}
    }
    int main()
    {
    	char b[5000][200];
    	int i,j,m,n;
    	m=0;
    	int flag;
    	while(gets(a))//scanf("%s",a)!=EOF
    	{
    		j=0;
    		n=0;
    		t=strlen(a);
    		if(t==0)
    			continue;
    		zhuanhuan();
    		for(i=0;i<t;i++)
    		{
    			if((a[i]<='z'&& a[i]>='a'))
    				b[m][n++]=a[i];
    			else if(a[i]==' ')
    			{
    				b[m][n++]='';
    				m++;
    				n=0;
    			}
    		}
        	b[m++][n]='';
    	}
    	for(i=m-1;i>=0;i--)
    	{
    		for(j=0;j<i;j++)
    		{
    			if(strcmp(b[j],b[j+1])>0)
    			{
    				char w[30];
    				strcpy(w, b[j]);
    				strcpy(b[j],b[j+1]);
    				strcpy(b[j+1],w); 
    			}
    		}
    	}
    	for(i=0;i<m;i++)
    	{
    		flag=1;
    		for(j=0;j<i;j++)
    		{
    			if((strcmp(b[i],b[j]))==0)
    			{
    				flag=0;
    				break;
    			}
    
    		}
    		if(flag==1)
    			printf("%s
    ",b[i]);
    	}
    	//for(i=0;i<m;i++)
    	//	printf("%s
    ",b[i]);
    	return 0;
    }


  • 相关阅读:
    Script:Diagnostic ORA01000 maximum open cursors exceeded
    Script:Generating CREATE USER DDL Statements
    How many LMS processes for Oracle Rac 9i?
    ORA4030 PGA Usage Diagnostic Script
    Oracle Supplemental 补全日志介绍
    Oracle内部错误ORA600:[1112]
    Tune Very Large Hash Join
    How to increase System Change Number by manual
    Audit Logon above 9i
    Oracle学习笔记:创建logical standby
  • 原文地址:https://www.cnblogs.com/NYNU-ACM/p/4237330.html
Copyright © 2011-2022 走看看