def maxpre(str1, str2):
num = 0
for i in range(len(str1)):
if str1[i] == str2[i]:
num +=1
else:
break
return num
def main():
s = input()
t = input()
num = 0
temp = 0
for i in range(len(s)):
t = t[1:] + t[0]
temp+=1
if num < maxpre(s, t):
num = maxpre(s,t)
ans = temp
print(ans)
if __name__ == '__main__':
main()
码蹄集 强行匹配 python
最新推荐文章于 2023-05-11 19:03:31 发布