Submission #7467985

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int a, b;
int d[6] = {1, -1, 5, -5, 10, -10};
struct data{
	int v, step;
};
queue <data> q;

int main(){
	cin >> a >> b;
	if(a==b){
		cout << 0;
		return 0;
	}
	q.push((data){a, 0});
	while(!q.empty()){
		data u = q.front();
		q.pop();
		for(int i=0; i<6; i++){
			int t = u.v+d[i];
			if(t==b){
				cout << u.step+1 << endl;
				return 0;
			}
			q.push((data){t, u.step+1});
		}
	}
	return 0;
}

Submission Info

Judge Result