520B - Two Buttons - CodeForces Solution


dfs and similar graphs greedy implementation math shortest paths *1400

Please click on ads to support us..

Python Code:

arr = [x for x in input().split()]

n = int(arr[0])
m = int(arr[1])

if (n > m) :
	print(n - m)
else :
	cnt = 0
	while (m > n):
		if (m % 2 == 0):
			m /= 2
		else :
			m += 1
		cnt += 1
	cnt += n - m
	print(int(cnt))


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