UVA 10815Andy's First Dictionary
来源:互联网 发布:java小项目实例 编辑:程序博客网 时间:2024/06/08 04:59
Andy's First Dictionary
Input
The input file is a text with no more than 5000 lines. An input line has at most 200 characters. Inputis terminated by EOF.
Output
Your output should give a list of different words that appears in the input text, one in a line. Thewords should all be in lower case, sorted in alphabetical order. You can be sure that he number ofdistinct words in the text does not exceed 5000.
Sample
InputAdventures in DisneylandTwo blondes were going to Disneyland when they came to a fork in theroad. The sign read: "Disneyland Left."So they went home.
Sample Input
Adventures in DisneylandTwo blondes were going to Disneyland when they came to a fork in theroad. The sign read: "Disneyland Left."So they went home.
Sample Outp
utaadventuresblondescamedisneylandforkgoinghomeinleftreadroadsignsothetheytotwowentwerewhen
想法:上次代码队友写的,今天自己写下
代码:
#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<map>
using namespace std;
char s[50100][10010];
struct node
{
char ws[1010];
}w[50100];
bool cmp(node x,node y)
{
return strcmp(x.ws,y.ws)<0;
}
int main()
{
int i,j;
int count=0;
while(gets(s[count]))
{
//strlwr(s[count]);
//puts(s[count]);
for(i=0;i<strlen(s[count]);i++)
{
if(s[count][i]>='A'&&s[count][i]<='Z')
s[count][i]=s[count][i]-'A'+'a';
}
count++;
}
int flag=0;
int k=0,l=0;
for(i=0;i<count;i++)
{
for(j=0;j<strlen(s[i]);j++)
{
if(s[i][j]==' ')
{
flag=1;
}
if(s[i][j]>='a'&&s[i][j]<='z')
{
w[k].ws[l++]=s[i][j];
}
if(s[i][j]>='a'&&s[i][j]<='z'&&(s[i][j+1]<'a'||s[i][j+1]>'z'))
{ // printf("%d %s \n ",k,w[k].ws);
k++;l=0;
}
}
}
/*for(i=0;i<k;i++)
{
puts(w[i].ws);
}*/
sort(w,w+k,cmp);
for(i=0;i<k;i++)
{
if(strcmp(w[i].ws,w[i+1].ws)!=0)
{
printf("%s\n",w[i].ws);
}
}
return 0;
}
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<map>
using namespace std;
char s[50100][10010];
struct node
{
char ws[1010];
}w[50100];
bool cmp(node x,node y)
{
return strcmp(x.ws,y.ws)<0;
}
int main()
{
int i,j;
int count=0;
while(gets(s[count]))
{
//strlwr(s[count]);
//puts(s[count]);
for(i=0;i<strlen(s[count]);i++)
{
if(s[count][i]>='A'&&s[count][i]<='Z')
s[count][i]=s[count][i]-'A'+'a';
}
count++;
}
int flag=0;
int k=0,l=0;
for(i=0;i<count;i++)
{
for(j=0;j<strlen(s[i]);j++)
{
if(s[i][j]==' ')
{
flag=1;
}
if(s[i][j]>='a'&&s[i][j]<='z')
{
w[k].ws[l++]=s[i][j];
}
if(s[i][j]>='a'&&s[i][j]<='z'&&(s[i][j+1]<'a'||s[i][j+1]>'z'))
{ // printf("%d %s \n ",k,w[k].ws);
k++;l=0;
}
}
}
/*for(i=0;i<k;i++)
{
puts(w[i].ws);
}*/
sort(w,w+k,cmp);
for(i=0;i<k;i++)
{
if(strcmp(w[i].ws,w[i+1].ws)!=0)
{
printf("%s\n",w[i].ws);
}
}
return 0;
}
阅读全文
0 0
- UVa OJ 10815-Andy's First Dictionary
- uva 10815 Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- UVA 10815 - Andy's First Dictionary
- uva-10815 - Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- UVa-10815 - Andy's First Dictionary
- UVA 10815 - Andy's First Dictionary
- uva -- 10815 Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- uva 10815 Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- uva - 10815 - Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- Uva 10815 - Andy's First Dictionary
- 怎样将用户名和密码保存到Cookie中? (html部分)
- 2017年本博客Android进阶知识体系汇总
- 命名空间,引用,常量,可变参数例子
- Nexus环境搭建及简单介绍
- 动态规划解决字符串交错组成问题
- UVA 10815Andy's First Dictionary
- PAT1018. 锤子剪刀布
- Js的全局预处理、解析与执行
- python数据爬虫---拉钩网
- mysql中获取一天、一周、一月时间数据的各种sql语句写法
- javascript基础入门
- 进程和线程的关系
- ios中pod相关命令
- C基础知识