codeforces 520B Two Buttons BFS
2015-07-14 13:40
330 查看
B. Two Buttons
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Vasya has found a strange device. On the front panel of a device there are: a red button, a blue button and a display showing some positive integer. After clicking the red button, device multiplies the displayed number by two. After clicking the blue button,
device subtracts one from the number on the display. If at some point the number stops being positive, the device breaks down. The display can show arbitrarily large numbers. Initially, the display shows number
n.
Bob wants to get number m on the display. What minimum number of clicks he has to make in order to achieve this result?
Input
The first and the only line of the input contains two distinct integers
n and m (1 ≤ n, m ≤ 104), separated by a space .
Output
Print a single number — the minimum number of times one needs to push the button required to get the number
m out of number n.
Sample test(s)
Input
Output
Input
Output
Note
In the first example you need to push the blue button once, and then push the red button once.
In the second example, doubling the number is unnecessary, so we need to push the blue button nine times.
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Vasya has found a strange device. On the front panel of a device there are: a red button, a blue button and a display showing some positive integer. After clicking the red button, device multiplies the displayed number by two. After clicking the blue button,
device subtracts one from the number on the display. If at some point the number stops being positive, the device breaks down. The display can show arbitrarily large numbers. Initially, the display shows number
n.
Bob wants to get number m on the display. What minimum number of clicks he has to make in order to achieve this result?
Input
The first and the only line of the input contains two distinct integers
n and m (1 ≤ n, m ≤ 104), separated by a space .
Output
Print a single number — the minimum number of times one needs to push the button required to get the number
m out of number n.
Sample test(s)
Input
4 6
Output
2
Input
10 1
Output
9
Note
In the first example you need to push the blue button once, and then push the red button once.
In the second example, doubling the number is unnecessary, so we need to push the blue button nine times.
#include<vector> #include<cstdio> #include<iostream> #include<cstring> #include<string> #include<algorithm> #include<cmath> #include<stack> #include<queue> #include<set> #define mem(a,x) memset(a,x,sizeof(a)) #define inf 0x3f3f3f3f typedef long long ll; using namespace std; inline int in() { int res=0;char c; while((c=getchar())<'0' || c>'9'); while(c>='0' && c<='9')res=res*10+c-'0',c=getchar(); return res; } int vis[10009]; void bfs(int n,int m) { queue<int> q; q.push(n); vis =0; while(!q.empty()) { int now=q.front(); q.pop(); int tmp=now-1; if(tmp>0 && vis[tmp]==inf) { vis[tmp]=vis[now]+1; if(tmp==m)return; q.push(tmp); } tmp=now*2; if(tmp>0 && vis[tmp]==inf) { vis[tmp]=vis[now]+1; if(tmp==m)return; q.push(tmp); } } } int main() { int n=in(),m=in(); mem(vis,inf); bfs(n,m); cout<<vis[m]; return 0; }
相关文章推荐
- Navicat:excel数据导入mysql数据库
- 第二篇:opencv纠错,R6010-abort() has been called
- C++ 11新特性:移动构造函数和移动赋值操作符
- 跑步
- display:flex 多栏多列布局
- css3倒影
- 使用Bootstrap框架制作响应式移动网页
- 机器视觉系统中相机的分辨率怎么选择?
- 排序算法
- Nginx配置文件详细说明
- BMP文件的读取与显示
- Android编译时出现“commands commence before first target”
- 定义窄字符串,变形为宽字符串
- Codeforces Round #308 (Div. 2) 题解
- [LeetCode] Balanced Binary Tree
- BMP文件的读取与显示
- 大话设计模式(十 会修电脑不会修收音机?——聊设计模式原则)
- JSON 基础知识
- 个人常用iOS第三方库以及XCode插件介绍
- 机器视觉光源按形状怎么分类?