UVA 题目10361 - Automatic Poetry (二)

2014-11-24 02:42:04 · 作者: · 浏览: 5
3[j] = a[i];
}
s3[j] = '\0';
//printf("%s\n",s3);
//第四个子串
for(i = i+1,j = 0;a[i] != '>';i++,j++){
s4[j] = a[i];
}
s4[j] = '\0';
//printf("%s\n",s4);
//第五个子串
for(i = i+1,j = 0;i < lena;i++,j++){
s5[j] = a[i];
}
s5[j] = '\0';
//printf("%s\n",s5);
//第二个字符串
for(i = 0,j = 0;b[i] != '.';i++,j++){
s[j] = b[i];
}
s[j] = '\0';
//printf("%s\n",s);
//输出
printf("%s%s%s%s%s\n",s1,s2,s3,s4,s5);
printf("%s%s%s%s%s\n",s,s4,s3,s2,s5);
}
}
return 0;
}

/*********************************
* 日期:2013-4-26
* 作者:SJF0115
* 题号: 题目10361 - Automatic Poetry
* 来源

* 结果:AC
* 来源:UVA
* 总结:
**********************************/
#include
#include
#define N 110
int main (){
int i,j,Case,lena,lenb;
char a[N],b[N],s[N],s1[N],s2[N],s3[N],s4[N],s5[N];
//freopen("C:\\Users\\XIAOSI\\Desktop\\acm.txt","r",stdin);
while(scanf("%d\n",&Case) != EOF){
while(Case--){
gets(a);
gets(b);
lena = strlen(a);
//第一个子串
for(j = 0,i = 0;a[i] != '<';i++,j++){
s1[j] = a[i];
}
s1[j] = '\0';
//printf("%s\n",s1);
//第二个子串
for(i = i+1,j = 0;a[i] != '>';i++,j++){
s2[j] = a[i];
}
s2[j] = '\0';
//printf("%s\n",s2);
//第三个子串
for(i = i+1,j = 0;a[i] != '<';i++,j++){
s3[j] = a[i];
}
s3[j] = '\0';
//printf("%s\n",s3);
//第四个子串
for(i = i+1,j = 0;a[i] != '>';i++,j++){
s4[j] = a[i];
}
s4[j] = '\0';
//printf("%s\n",s4);
//第五个子串
for(i = i+1,j = 0;i < lena;i++,j++){
s5[j] = a[i];
}
s5[j] = '\0';
//printf("%s\n",s5);
//第二个字符串
for(i = 0,j = 0;b[i] != '.';i++,j++){
s[j] = b[i];
}
s[j] = '\0';
//printf("%s\n",s);
//输出
printf("%s%s%s%s%s\n",s1,s2,s3,s4,s5);
printf("%s%s%s%s%s\n",s,s4,s3,s2,s5);
}
}
return 0;
}

[cpp]
#include
#include
using namespace std;

#define MAXN 102
string a1, a2;

void solve()
{
int p1 = a1.find('<', 0);
int p2 = a1.find('>', 0);
int p3 = a1.find('<', p2+1);
int p4 = a1.find('>', p2+1);
string s1 = a1.substr(0, p1);
string s2 = a1.substr(p1+1, p2-p1-1);
string s3 = a1.substr(p2+1, p3-p2-1);
string s4 = a1.substr(p3+1, p4-p3-1);
string s5 = a1.substr(p4+1);
cout< a2.replace(a2.length()-3, 3, s4+s3+s2+s5);
cout< }

int main()
{
int t; cin>>t;
cin.get();
while(t--)
{
getline(cin, a1);
getline(cin, a2);
solve();
}
}

#include
#include
using namespace std;

#define MAXN 102
string a1, a2;

void solve()
{
int p1 = a1.find('<', 0);
int p2 = a1.find('>', 0);
int p3 = a1.find('<', p2+1);
int p4 = a1.find('>', p2+1);
string s1 = a1.substr(0, p1);
string s2 = a1.substr(p1+1, p2-p1-1);
string s3 = a1.substr(p2+1, p3-p2-1);
string s4 = a1.substr(p3+1, p4-p3-1);
string s5 = a1.substr(p4+1);
cout< a2.replace(a2.length()-3, 3, s4+s3+s2+s5);
cout< }

int main()
{
int t; cin>>t;
cin.get();
while(t--)
{
getline(cin, a1);
getline(cin, a2);
solve();
}
}