Submission #7022895

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
queue<int> dl;
int a,b,d[100];
int jx[7]={0,1,-1,5,-5,10,-10};
bool pan[100];
void bfs()
{
	while(!dl.empty())
	{
		for(int i=1;i<=6;i++)
		{
			int xx=dl.front()+jx[i];
			if(xx>0&&xx<=60&&!pan[xx])
			{
				d[xx]=d[dl.front()]+1;
				dl.push(xx);
				pan[xx]=1;
				if(xx==b)
				{
					cout<<d[xx]<<endl;
					return;
				}
			}
		}
		dl.pop();
	}
}
int main()
{
	cin>>a>>b;
	if(a==b)
	{cout<<0<<endl;return 0;}
	dl.push(a);
	bfs();
}

Submission Info

Judge Result