不小心秒杀了- -!是我第一个在OJ秒杀的非超级简单题。
#include <stdio.h>
#include <string.h>
#define N 110
void make_c1(char s[], char ss[][N], char c1[])
{
int k, p, j, c, in;
for (j = in = p = c = 0, k = 1; j != strlen(s)-1 && s[j] != '\n'; ++j) {
if (s[j] == '<')
in = 1;
if (in) {
if (s[j] != '<' && s[j] != '>')
ss[k][p++] = s[j];
else if (s[j] == '<' || s[j] == '>') {
ss[k][p] = '\0';
++k;
p = 0;
}
}
ss[k][p] = '\0';
if (s[j] != '<' && s[j] != '>')
c1[c++] = s[j];
}
c1[c] = '\0';
}
void make_c2(char s[], char ss[][N], char c2[])
{
int j, k;
for (j = k = 0; j != strlen(s)-1 && s[j] != '.'; ++j)
c2[k++] = s[j];
c2[k] = '\0';
strcat(c2, ss[4]);
strcat(c2, ss[3]);
strcat(c2, ss[2]);
strcat(c2, ss[5]);
}
int main(void)
{
int n, i, j;
char s[N], ss[10][N], c1[N], c2[N];
scanf("%d ", &n);
for (i = 0; i != n*2; ++i) {
fgets(s, N, stdin);
if ((i+1) & 1) {
make_c1(s, ss, c1);
puts(c1);
} else {
make_c2(s, ss, c2);
puts(c2);
}
}
return 0;
}