fork download
  1. #include<stdio.h>
  2. int stringLength(char *s);
  3. void printString(char *s);
  4. void noVowelString(char *s);
  5. void stringAppend(char *s1,char *s2);
  6. int process(char *r);
  7. void stringCompare(char *s1,char *s2);
  8. int main()
  9. {
  10. int t,c1,c2,a,i;
  11. char input[10],string[15],str[30],*s,*s1,*s2;
  12. scanf("%d",&t);
  13. for(c1=1;c1<=t;c1++)
  14. {
  15. scanf("%s",input);
  16. a= process(&input[0]);
  17. if( a == 1 || a == 2)
  18. { scanf("%s",string);
  19. s= &string[0];
  20. if(a==1) {printString(s);}
  21. if(a==2) {noVowelString(s);}
  22. }
  23. if( a == 3 || a == 4)
  24. { scanf("%s",str);
  25. scanf("%s",string);
  26. s1 = &str[0]; s2 = &string[0];
  27. if(a==3) {stringAppend(s1,s2);}
  28. if(a==4);{stringCompare(s1,s2);}
  29. }
  30. }
  31. return 0;
  32. }
  33. int stringLength(char *s)
  34. {
  35. int n;
  36. for(n=0;*(s+n) != '\0';n++) ;
  37. return (n);
  38. }
  39. void printString(char *s)
  40. {
  41. int n;
  42. for(n=0;*(s+n)!='\0';n++)
  43. printf("%c",*(s+n));
  44. }
  45. void noVowelString(char *s)
  46. {
  47. int l,n,t=0,m;
  48. l = stringLength(s);
  49. for(n=0;*(s+n) != 0;n++)
  50. {
  51. if(*(s+n) == 'a' || *(s+n) == 'e' || *(s+n) == 'i' || *(s+n) == 'o' || *(s+n) == 'u' || *(s+n) == 'A' || *(s+n) == 'E' || *(s+n) == 'I' || *(s+n) == 'O' || *(s+n) == 'U')
  52. {
  53. for(m=n;*(s+m+1) != 0;m++)
  54. {
  55. *(s+m) = *(s+m+1);
  56. }
  57. t += 1;
  58. *(s+l-t) = '\0';
  59. n = n - 1;
  60. }
  61. }
  62. printString(s);
  63. }
  64. void stringAppend(char *s1,char *s2)
  65. {
  66. int l1,n;
  67. l1 = stringLength(s1);
  68. for(n=0;*(s2+n) != 0;n++)
  69. {
  70. *(s1+l1+n) = *(s2+n);
  71. }
  72. printString(s1);
  73. }
  74. int process(char *r)
  75. {
  76. int a;
  77. if(*r == 'p')
  78. { if(*(r+1) == 'r' && *(r+2) == 'i' && *(r+3) == 'n' && *(r+4) == 't' )
  79. a=1;
  80. }
  81. if(*r == 'n')
  82. { if(*(r+1) == 'o' && *(r+2) == 'v' && *(r+3) == 'o' && *(r+4) == 'w' && *(r+5) == 'e' && *(r+6) == 'l')
  83. a=2;
  84. }
  85. if(*r == 'a')
  86. { if(*(r+1) == 'p' && *(r+2) == 'p' && *(r+3) == 'e' && *(r+4) == 'n' && *(r+5) == 'd')
  87. a=3;
  88. }
  89. if(*r == 'c')
  90. { if(*(r+1) == 'o' && *(r+2) == 'm' && *(r+3) == 'p' && *(r+4) == 'a' && *(r+5) == 'r' && *(r+6) == 'e')
  91. a=4;
  92. }
  93. return (a);
  94. }
  95. void stringCompare(char *s1,char *s2)
  96. {
  97. int l1,l2,i;
  98. l1=stringLength(s1);
  99. l2=stringLength(s2);
  100. if(l1 > l2) {printString(s1);}
  101. if(l1 < l2) {printString(s2);}
  102. if(l1 == l2)
  103. {
  104. for(i=0; *(s1+i) != 0;i++)
  105. {
  106. if( (int) *(s1+i) > (int) *(s2+i) ) {printString(s2);break;}
  107. if( (int) *(s1+i) < (int) *(s2+i) ) {printString(s1);break;}
  108. }
  109. if( i == l1) {printString(s1);}
  110. }
  111. }
Success #stdin #stdout 0s 2252KB
stdin
1
print
apple
stdout
apple