#include#include#includechar a[1000]={0},b[1000]={0};int lon1=0,lon2=0;int main(){int flag=1;gets(a);gets(b);int i,j;int n,m;n=strlen(a);m=strlen(b);//printf("%d\n",n);//printf("%d\n\n",m);for(i=1;i<=n;i++){flag=1;if(i<=m){for(j=0;j<i;j++)if(a[j]!=b[m-i+j]){flag=0;break;}if(flag){if(lon1<i)lon1=i;}}}for(i=1;i<=m;i++){flag=1;if(i<=n){for(j=0;j<i;j++)if(b[j]!=a[n-i+j]){flag=0;break;}if(flag){if(lon2
lon2)printf("%d\n",lon1);//for(i=0;i<lon1;i++)//printf("%c",a[i]);elseprintf("%d\n",lon2);//for(i=0;i<lon2;i++)//printf("%c",b[i]);system("pause");return 0;}
tyvj p1029 牛棚回声
最新推荐文章于 2023-08-16 21:12:47 发布