程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> HDU1804 Deli Deli

HDU1804 Deli Deli

編輯:C++入門知識

Deli Deli

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1399 Accepted Submission(s): 761

Problem Description 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:

1. If the word is in the list of irregular words replace it with the given plural.
2. Else if the word ends in a consonant followed by "y", replace "y" with "ies".
3. Else if the word ends in "o", "s", "ch", "sh" or "x", append "es" to the word.
4. 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

這題WA得想吐,一直沒找到錯哪,然後重寫一遍又過了,這題真惡心。

#include 
#include 
struct Node{
	char str1[22], str2[22];
} irr[22];
char str[26]; int len, m, n;

int find(){
	for(int i = 0; i < m; ++i)
		if(!strcmp(str, irr[i].str1)) return i;
	return -1;
}

bool yuanyin(char ch){
	char *yuan = "aeiou";
	for(int i = 0; i < 5; ++i)
		if(ch == yuan[i]) return true;
	return false;
}

void check(){
	int flag = find();
	if(flag > -1){
		puts(irr[flag].str2); return;
	}
	if(str[len-1] == 'o' || str[len-1] == 's' || str[len-1] == 'x'){
		strcat(str, "es"); puts(str); return;
	}
	if(len > 1 && (str[len-1] == 'h' && (str[len-2] == 's' || str[len-2] == 'c'))){
		strcat(str, "es"); puts(str); return;
	}
	if(len > 1 && str[len-1] == 'y' && !yuanyin(str[len-2])){
		str[len-1] = '\0'; strcat(str, "ies"); puts(str); return;		
	}
	strcat(str, "s"); puts(str);
}

int main(){
	while(scanf("%d%d", &m, &n) == 2){
		for(int i = 0; i < m; ++i)
			scanf("%s%s", irr[i].str1, irr[i].str2);
		while(n--){
			scanf("%s", str);
			len = strlen(str);
			check();
		}
	}
	return 0;
}


  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved