<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[GOSHYOU的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/GOSHYOU</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; GOSHYOU]]></copyright><item><title><![CDATA[常用的宏定义]]></title><link>https://blog.youkuaiyun.com/GOSHYOU/article/details/86479853</link><guid>https://blog.youkuaiyun.com/GOSHYOU/article/details/86479853</guid><author>GOSHYOU</author><pubDate>Mon, 14 Jan 2019 16:52:43 +0800</pubDate><description><![CDATA[比较两个数的大小：
#define MAX(a,b) a&amp;amp;amp;gt;b?a:b
#define MIN(a,b) a&amp;amp;amp;lt;b?a:b
比较三个数的大小：
#define MAX(a,b,c) (a&amp;amp;amp;gt;b?(a&amp;amp;amp;gt;c?a:c):(b&amp;amp;amp;gt;c?b:c))
#define MIN(a,b,c) (a&amp;amp;amp;lt;b?(a&amp;amp;amp;lt;c?a:c):(b]]></description><category></category></item><item><title><![CDATA[Tmad OJ 1133]]></title><link>https://blog.youkuaiyun.com/GOSHYOU/article/details/84984554</link><guid>https://blog.youkuaiyun.com/GOSHYOU/article/details/84984554</guid><author>GOSHYOU</author><pubDate>Thu, 13 Dec 2018 11:12:42 +0800</pubDate><description><![CDATA[#Tmad OJ 1133
DESCRIPTION
没时间编故事了，直接做题吧！问题很简单，现在有两个数n和m，我们有三种操作-1，+1，*2。问：最少需要操作多少次能把n变成m。（0&amp;amp;amp;amp;amp;amp;lt;=n,m&amp;amp;amp;amp;amp;amp;lt;=1000000）
INPUT
输入数据有多组，每行输入两个整数n和m
OUTPUT
每行输出一个数字代表最少操作次数
SAMPLE INPUT
5 17
SAMPLE OUTPUT
4

还...]]></description><category></category></item></channel></rss>