#include <bits/stdc++.h> using namespace std; string s1,s2; int main(){ int x, y, len, len1, len2, ans=0, max=0; cin>>s1>>s2; len1 = s1.size(); len2 = s2.size(); max = min(len1, len2); s1 += s1; s2 += s2; for(int i=1; i<=len1; i++){ for(int j=1; j<=len2; j++){ len = 0; x = i; y = j; while(len<max && s1[x++]==s2[y++]) len++; if (len > ans) ans = len; } } cout<<ans<<endl; return 0; }

你好！我是DeepSeek部署，很高兴见到你！ 我可以帮你写代码、读文件、写作各种创意内容，请把你的任务交给我吧~ 请输入你的问题

最后声明：这是我小号的东西，大号搬过来，1000%不犯法

很快地攻克

#include <bits/stdc++.h> using namespace std; string s1,s2; int main(){ int x, y, len, len1, len2, ans=0, max=0; cin>>s1>>s2; len1 = s1.size(); len2 = s2.size(); max = min(len1, len2); s1 += s1; s2 += s2; for(int i=1; i<=len1; i++){ for(int j=1; j<=len2; j++){ len = 0; x = i; y = j; while(len<max && s1[x++]==s2[y++]) len++; if (len > ans) ans = len; } } cout<<ans<<endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ string a,b,aa,bb; char c; bool boo=1; int sum=0,big=0,k,he=0; cin>>aa>>bb; if(aa.size()>bb.size()) a=aa,b=bb; else b=aa,a=bb; for(int i=0;i<b.size();i++){ k=i; c=b[k]; for(int j=0;j<a.size()&&boo;j++){ while(a[j]c){ sum+=1; j+=1; if(ja.size()){ j=0; boo=0; } k+=1; he+=1; if(kb.size()){ k=0; } if(heb.size()){ boo=0; break; } c=b[k]; } } if(sum>big) big=sum; sum=0; boo=1; he=0; } cout<<big; return 0; }

#include <bits/stdc++.h> using namespace std; string s1,s2; int main(){ int x, y, len, len1, len2, ans=0, max=0; cin>>s1>>s2; len1 = s1.size(); len2 = s2.size(); max = min(len1, len2); s1 += s1; s2 += s2; for(int i=1; i<=len1; i++){ for(int j=1; j<=len2; j++){ len = 0; x = i; y = j; while(len<max && s1[x++]==s2[y++]) len++; if (len > ans) ans = len; } } cout<<ans<<endl; return 0; }

#include <bits/stdc++.h> using namespace std; string s1,s2; int main(){ int x, y, len, len1, len2, ans=0, max=0; cin>>s1>>s2; len1 = s1.size(); len2 = s2.size(); max = min(len1, len2); s1 += s1; s2 += s2; for(int i=1; i<=len1; i++){ for(int j=1; j<=len2; j++){ len = 0; x = i; y = j; while(len<max && s1[x++]==s2[y++]){ len++; if (len > ans){ ans = len; } } } } cout << ans << endl; return 0; }

#include<iostream> using namespace std; string s1,s2; int main(){ int x, y, len, len1, len2, ans=0, max=0; cin>>s1>>s2; len1 = s1.size(); len2 = s2.size(); max = min(len1, len2); s1 += s1; s2 += s2; for(int i=1; i<=len1; i++){ for(int j=1; j<=len2; j++){ len = 0; x = i; y = j; while(len<max && s1[x++]==s2[y++]){ len++; if (len > ans){ ans = len; } } } } cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; string s1,s2; int main(){ int x, y, len, len1, len2, ans=0, max=0; cin>>s1>>s2; len1 = s1.size(); len2 = s2.size(); max = min(len1, len2); s1 += s1; s2 += s2; for(int i=1; i<=len1; i++){ for(int j=1; j<=len2; j++){ len = 0; x = i; y = j; while(len<max && s1[x++]==s2[y++]){ len++; if (len > ans){ ans = len; } } } } cout << ans << endl; return 0; }