Submission #6541076

---

Source Code Expand

#include <iostream>
#include <queue>
using namespace std;
struct num{
	int now;
	int cnt;
};
int a,b;
bool flag[50];
int main(){
	cin>>a>>b;
	flag[a] = true;
	queue<num> bfs;
	num temp;
	temp.now = a;
	temp.cnt = 0;
	bfs.push(temp);
	while(!bfs.empty()){
    	num m=bfs.front();
    	bfs.pop();
    	if(m.now == b){
        	cout<<m.cnt<<endl;
        	return 0;
    	}
    	if(m.now+10 <= 40 && !flag[m.now+10]){
    		flag[m.now+10] = true;
    		temp.now = m.now+10;
    		temp.cnt = m.cnt+1;
    		bfs.push(temp);
		}
		if(m.now-10 >= 0 && !flag[m.now-10]){
    		flag[m.now-10] = true;
    		temp.now = m.now-10;
    		temp.cnt = m.cnt+1;
    		bfs.push(temp);
		}
		if(m.now+5 <= 40 && !flag[m.now+5]){
    		flag[m.now+5] = true;
    		temp.now = m.now+5;
    		temp.cnt = m.cnt+1;
    		bfs.push(temp);
		}
		if(m.now-5 >= 0 && !flag[m.now-5]){
    		flag[m.now-5] = true;
    		temp.now = m.now-5;
    		temp.cnt = m.cnt+1;
    		bfs.push(temp);
		}
		if(m.now+1 <= 40 && !flag[m.now+1]){
    		flag[m.now+1] = true;
    		temp.now = m.now+1;
    		temp.cnt = m.cnt+1;
    		bfs.push(temp);
		}
		if(m.now-1 >= 0 && !flag[m.now-1]){
    		flag[m.now-1] = true;
    		temp.now = m.now-1;
    		temp.cnt = m.cnt+1;
    		bfs.push(temp);
		}
	}
	cout<<0;
	return 0;
}

Submission Info

Judge Result