求 problem 1004 代码

[Summy1208]

http://acm.zju.edu.cn/show_problem.php?pid=1004

[Summy1208]

#include <iostream>
using namespace std;

char Src[500];
char Des[500];
char Stack[500];
char Result[1000];

int Len;

void Resolve(int nTop, int nSrc, int nDes, int nResult)
{
if (Stack[nTop] == Des[nDes])
{
Result[nResult++] = 'o';
nTop--;
++nDes;

if (nTop == 0 && nDes == Len)
{
cout<<Result<<'\n';
return;
}
else
Resolve(nTop, nSrc, nDes, nResult);
}
else
{
while (Stack[nTop] != Des[nDes])
{
Stack[++nTop] = Src[nSrc++];
Result[nResult++] = 'i';
}
Resolve(nTop, nSrc, nDes, nResult);
}
}

int main()
{
while(cin>>Src>>Des)
{
Len = strlen(Src);
cout<<"[\n";
if (Len == strlen(Des))
Resolve(0,0,0,0);
cout<<"]\n";
}
return 0;
}

小弟只能得到一个解 不知怎样回朔？

[mmmcd]

#include <stdio.h>
#include <string.h>
char s1[100],s2[100],stk[100],ans[200];
int l1,l2;

void output(int n)
{
int i;
for(i=0;i+1<n;i++)
{
printf("%c ",ans[i]);
}
printf("%c\n",ans[i]);
}

void go(int in,int out,int p,int top)
{
if(top<0)return;
if(in==l1 && out==l2)
{
output(p);
return;
}

if(in<l1)
{
stk[top]=s1[in];
ans[p]='i';
go(in+1,out,p+1,top+1);
}

if(top>0 && out<l2 && stk[top-1]==s2[out])
{
ans[p]='o';
go(in,out+1,p+1,top-1);
stk[top-1]=s2[out];
}
}

int main()
{
while(scanf("%s%s",s1,s2)==2)
{
l1=strlen(s1);
l2=strlen(s2);
printf("[\n");
if(l1==l2)go(0,0,0,0);
printf("]\n");
}
return 0;
}