POJ 3366//基本的字符串处理!
2012-10-28 18:51
295 查看
Deli Deli
Mrs. Deli is running the delicatessen store "Deli Deli". Last year Mrs. Deli has decided to expand her business and build up an online store. She has hired a programmer who has implemented the online store. Recently some of her new online customers complained about the electronic bills. The programmer had forgotten to use the plural form in case that an item is purchased multiple times. Unfortunaly the programmer of Mrs. Deli is on holiday and now it is your task to implement this feature for Mrs. Deli. Here is a description how to make the plural form: If the word is in the list of irregular words replace it with the given plural. Else if the word ends in a consonant followed by "y", replace "y" with "ies". Else if the word ends in "o", "s", "ch", "sh" or "x", append "es" to the word. Else append "s" to the word. Input The first line of the input file consists of two integers L and N (0 ≤ L ≤ 20, 1 ≤ N ≤ 100). The following L lines contain the description of the irregular words and their plural form. Each line consists of two words separated by a space character, where the first word is the singular, the second word the plural form of some irregular word. After the list of irregular words, the following N lines contain one word each, which you have to make plural. You may assume that each word consists of at most 20 lowercase letters from the English alphabet ('a' to 'z'). Output Print N lines of output, where the ith line is the plural form of the ith input word. Sample Input 3 7 rice rice spaghetti spaghetti octopus octopi rice lobster spaghetti strawberry octopus peach turkey Sample Output rice lobsters spaghetti strawberries octopi peaches turkeys Source Ulm Local 2007 |
[Status] [Discuss]
Home Page
Go
Back
To top
/*题意:把单词的单数变成复数,规则是:特殊的给出来直接输出就行, 不规则变化按照所说的规则变化 就是简单的字符串处理 */ #include <iostream> #include<string> using namespace std; struct { string m; string n; } node[100]; int main() { int a,b,i,flag; string m[100],line; string::size_type len; cin >> a>> b; for(i=0; i<a; i++) cin >> node[i].m >> node[i].n; while(b--) { flag=0; cin>> line ; for(i=0; i<a; i++) if(node[i].m==line) { flag=1; cout<< node[i].n << endl; } if(!flag) { len=line.size(); if(line[len-1]=='x'||line[len-1]=='o'||line[len-1]=='s') line=line+"es"; else if(line[len-1]=='y'&&line[len-2]!='a'&&line[len-2]!='e'&&line[len-2]!='i'&&line[len-2]!='o'&&line[len-2]!='u') { line[len-1]='i'; line=line+"es"; } else if(line[len-1]=='h') { if(line[len-2]=='s'||line[len-2]=='c') line=line+"es"; } else line=line+"s"; cout << line << endl; } } return 0; }
相关文章推荐
- POJ 2503 二分 还有一些基本字符串的处理
- poj 2895-字符串的处理
- 【字符串处理】poj1936
- poj 3080 Blue Jeans【字符串处理+ 亮点是:字符串函数的使用】
- 流行编程语言的详细对比(3)--基本数据类型和字符串处理
- 【Objective-C】OC中字符串(NSString)的基本概念和常用处理方法
- POJ-2803 英文阅读+字符串处理
- 自己实现基本的C标准库字符串处理函数——实现strcpy
- POJ 2471 || SDUT 2357 Bullshit Bingo(字符串处理)
- POJ 1589 Unix ls 排序和字符串处理
- poj_3650 字符串处理
- 【字符串处理】poj3080
- 字符串及处理之二: 基本字符串类型及函数
- poj 2041 Unreliable Message 字符串处理
- PHP基本语法第四章-字符串的处理
- POJ 1035 Spell checker【字符串处理】
- 字符串处理,Poj(2121)
- POJ 1002(字符串处理)
- 自己实现基本的C标准库字符串处理函数——基本问题
- POJ 1002 487-3279 字符串处理