fork download
copy 
  1. #include<cstdio>
  2.  
  3. int strlen(char* p) {
  4. 	int n = 0;
  5. 	while (*p++ != '\0')
  6. 		n++;
  7. 	return n;
  8. }
  9.  
  10. char table[12][2][5] = {
  11. 	{"a", "as" },
  12. 	{"i", "ios"},
  13. 	{"y", "ios"},
  14. 	{"l", "les"},
  15. 	{"n", "anes"},
  16. 	{"e", "anes"}, // ne
  17. 	{"o", "os"},
  18. 	{"r", "res"},
  19. 	{"t", "tas"},
  20. 	{"u", "us"},
  21. 	{"v", "ves"},
  22. 	{"w", "was"} };
  23.  
  24. int main(void) {
  25. 	int n;
  26. 	char letters[31];
  27. 	scanf("%d\n", &n);
  28. 	while (n--) {
  29. 		scanf("%s", letters);
  30.  
  31. 		int len = strlen(letters);
  32. 		for (int i = 0; i < len; i++) {
  33. 			if (i == len - 1) {
  34. 				bool found = false;
  35. 				for (int k = 0; k < 12; k++) {
  36. 					if (table[k][0][0] == letters[i]) {
  37. 						if (k == 5 && letters[i - 1] == 'n') {
  38. 							found = true;
  39. 							printf("%s\n", table[k][1]);
  40. 							break;
  41. 						}
  42. 						else {
  43. 							found = true;
  44. 							printf("%s\n", table[k][1]);
  45. 							break;
  46. 						}
  47. 					}
  48. 				}
  49.  
  50. 				if (!found) {
  51. 					printf("%cus\n", letters[i]);
  52. 				}
  53. 			}
  54. 			else if (i == len - 2) {
  55. 				if (letters[i] == 'n' && letters[i + 1] == 'e') {
  56. 					;
  57. 				}
  58. 				else {
  59. 					putchar(letters[i]);
  60. 				}
  61. 			} else {
  62. 				putchar(letters[i]);
  63. 			}
  64. 		}
  65. 	}
  66. 	return 0;
  67. }
  68.  
Success #stdin #stdout 0s 15232KB
comments (?)
stdin
copy 
1
pie
stdout
copy 
pianes
https://ideone.com/TG7lR9
language:
C++14 (gcc 8.3)
created:
5 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!