1989B - Substring and Subsequence - CodeForces Solution


bitmasks brute force dp graphs greedy hashing strings trees

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
	x,y=list(input()),list(input())
	ans=len(y)+len(x)
	for i in range(len(y)):
		t=len(x)+len(y)
		p1=i
		for j in range(len(x)):
			if x[j]==y[p1]:
				t-=1
				p1+=1
			if p1==len(y):
				break
		ans=min(t,ans)
	print(ans)


Comments

Submit
0 Comments
More Questions

1720A - Burenka Plays with Fractions
3A - Shortest path of the king
1720C - Corners
574A - Bear and Elections
352B - Jeff and Periods
1244A - Pens and Pencils
1670A - Prof Slim
1189A - Keanu Reeves
678A - Johny Likes Numbers
1699C - The Third Problem
1697D - Guess The String
754B - Ilya and tic-tac-toe game
760A - Petr and a calendar
1573A - Countdown
166A - Rank List
1631B - Fun with Even Subarrays
727A - Transformation from A to B
822B - Crossword solving
1623A - Robot Cleaner
884B - Japanese Crosswords Strike Back
862B - Mahmoud and Ehab and the bipartiteness
429A - Xor-tree
1675C - Detective Task
950A - Left-handers Right-handers and Ambidexters
672B - Different is Good
1C - Ancient Berland Circus
721A - One-dimensional Japanese Crossword
1715B - Beautiful Array
60B - Serial Time
453A - Little Pony and Expected Maximum