Data structure question Design and implement an algorithm to do so!! Vasya has f
ID: 3844002 • Letter: D
Question
Data structure questionDesign and implement an algorithm to do so!!
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 (1n,m104), 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. Data structure question
Design and implement an algorithm to do so!!
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 (1n,m104), 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.
Design and implement an algorithm to do so!!
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 (1n,m104), 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.
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 (1n,m104), 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. 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 (1n,m104), 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.
Explanation / Answer
Input :
Output :
Input :
Output :
program :-
struct node
{
int x;
int sp;
};
int vs[maxn];
int n,m;
int main()
{
cin>>n>>m;
queue<node> q;
q.push({n,0});
vs[n]=1;
while(!q.empty())
{
node now=q.front();
q.pop();
if(now.x==m)
{
cout<<now.sp<<endl;
return 0;
}
REP(i,2)
{
node next=now;
next.sp++;
if(i)
{
next.x*=2;
if(vs[next.x]||next.x>maxn-1||next.x<0)
continue;
vs[next.x]=1;
q.push(next);
}
else
{
next.x--;
if(vs[next.x]||next.x>maxn-1||next.x<0)
continue;
vs[next.x]=1;
q.push(next);
}
}
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.