UVa-10361-Automatic Poetry
AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving :: String
// 10361 - Automatic Poetry #include <iostream> #include <cstdio> #include <cstring> #define MAXN 100 using namespace std; int main(void) { char c; int i, n; char s1[MAXN], s2[MAXN], s3[MAXN], s4[MAXN], s5[MAXN], line[MAXN]; while(cin >> n) { getchar(); while(n--) { memset(s1, 0, sizeof(s1)); memset(s2, 0, sizeof(s2)); memset(s3, 0, sizeof(s3)); memset(s4, 0, sizeof(s4)); memset(s5, 0, sizeof(s5)); memset(line, 0, sizeof(line)); for(i=0; (c=getchar()) && c!='<'; i++) s1[i] = c; s1[i] = '\0'; for(i=0; (c=getchar()) && c!='>'; i++) s2[i] = c; s2[i] = '\0'; for(i=0; (c=getchar()) && c!='<'; i++) s3[i] = c; s3[i] = '\0'; for(i=0; (c=getchar()) && c!='>'; i++) s4[i] = c; s4[i] = '\0'; for(i=0; (c=getchar()) && c!='\n'; i++) s5[i] = c; s5[i] = '\0'; for(i=0; (c=getchar()) && c!='.'; i++) line[i] = c; line[i] = '\0'; getchar(); getchar(); getchar(); cout << s1 << s2 << s3 << s4 << s5 << endl; cout << line << s4 << s3 << s2 << s5 << endl; } } return 0; }