#include int strcomp(char s1[], char s2[], int i); main() { char line[100], out1[100]="", out2[100]=""; int i, j, p=0, q=1; while (gets(line)!=NULL) { for(i=0, j=0 ; line[i] ; i++) { if (strcomp(line, "<", i)) { out1[j++]='<'; i+=3; } else if (strcomp(line, ">", i)) { out1[j++]='>'; i+=3; } else out1[j++]=line[i]; } out1[j]='\0'; for(i=0, j=0 ; out1[i] ; i++) { if (out1[i]=='<' && out1[i+1]!='!' && !strcomp(out1,"') {q=1, p=0;} if (q || out1[i]=='\n') out2[j++]=out1[i]; } out2[j]='\0'; puts(out2); } } /* funkcija strcomp proverava da li se u stringu s1 */ /* na poziciji i, nalazi string s2 i ako je tako */ /* vraca 1 u suprotnom vraca 0 */ int strcomp(char s1[], char s2[], int i) { int j,p=1; char a,b; for (j=0 ; s2[j] && p ; i++, j++) { if (s1[i]>='a' && s1[i]<='z') a=s1[i]-('a'-'A'); else a=s1[i]; if (s2[j]>='a' && s2[j]<='z') b=s2[j]-('a'-'A'); else b=s2[j]; p=(a==b); } if (p) return (1); else return (0); }