uva 10361 - Automatic Poetry
2013-07-30 15:03
330 查看
#include<cstdio> #include<cstring> struct S { int len; char s[105]; }s2,s4; int main() { #ifdef LOCAL freopen("in.txt","r",stdin); #endif // LOCAL int N; char str1[105],str2[105]; scanf("%d",&N); getchar(); while(N--) { s2.len = s4.len = 0; int t[4]; gets(str1); int len_str1= strlen(str1); int ans = 1; for(int i = 0; i < len_str1; i++) { if(ans == 1&&str1[i] == '<') { t[0] = i; ans++; while(str1[++i]!='>') s2.s[s2.len++] = str1[i]; t[1] = i; s2.s[s2.len] = '\0'; } if(ans == 2&&str1[i]=='<') { t[2] = i; while(str1[++i]!='>') s4.s[s4.len++] = str1[i]; t[3] = i; s4.s[s4.len] = '\0'; } } int c = 1; for(int i = 0; i <len_str1; i++) { if(c == 1&&str1[i]=='<') { printf("%s",s2.s); c++; i = i + s2.len + 1; } else if(c == 2&&str1[i]=='<') { printf("%s",s4.s); i = i + s4.len +1; } else printf("%c",str1[i]); } printf("\n"); gets(str2); int len_str2= strlen(str2); for(int i = 0; i < len_str2; i++) { if(str2[i]!='.')printf("%c",str2[i]); else { printf("%s",s4.s); for(int j = ++t[1]; j < t[2]; j++) printf("%c",str1[j]); printf("%s",s2.s); for(int j = ++t[3]; j < len_str1; j++) printf("%c",str1[j]); break; } } printf("\n"); } return 0; }
相关文章推荐
- UVA10361 - Automatic Poetry
- UVA10361 - Automatic Poetry
- UVA 10361 Automatic Poetry
- UVA 10361-Automatic Poetry
- UVa 10361 - Automatic Poetry
- UVa 10361 Automatic Poetry (字符串处理&两种读入方式)
- UVA 10361 解题报告
- UVA 10361-Automatic Poetry(模拟)
- UVA 10361 - Automatic Poetry(字符串)
- uva10361 Automatic Poetry(getline 的用法)
- UVA - 10361 Automatic Poetry
- UVA 10361 Automatic Poetry
- uva10361--String
- uva-10361-Automatic Poetry
- UVa-10361 Automatic Poetry
- uva 10361 Automatic Poetry
- UVA 10361 (13.08.01)
- uva 10361
- Volume 1. Elementary Problem Solving :: String Uva 401,10010,10361,537,409
- UVa-10361-Automatic Poetry