Submission #6505070

---

Source Code Expand

#include<iostream>
#include<queue>
using namespace std;
struct data
{
	int t;
	int cnt;
};
const int d[6] = {1 , -1 , 5 , -5 , 10 , -10};
bool flag[50] = {0};
int main()
{
	queue<data> s;
	int a , b;
	cin >> a >> b;
	data temp;
	temp.t = a;
	temp.cnt = 0;
	flag[a] = true;//走过了 
	if(a == b)
	{
		cout << 0 << endl;
		return 0;
	}
	s.push(temp);
	while(!s.empty())
	{
    	data now = s.front();
    	s.pop();//取当前队头元素出来
	    if(now.t == b)
		{
    	    //输出或者终止代码
    	    cout << now.cnt << endl;
    	    return 0;
    	}
	    for (int i = 0 ; i < 6 ; i++)
		{
			data next;
			next.t = now.t + d[i];
			next.cnt = now.cnt + 1;
    	    if(next.t >= 0 && next.t <= 40 &&! flag[next.t])
    	    {
    	    	s.push(next);//next入队等待访问
    	    	flag[next.t] = true;
			}
        	    
    	}
	}
	return 0;
}

Submission Info

Judge Result