Submission #6745422

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

int a,b,vh[50],ans=50;

void dfs(int x,int k) {
	if(k>ans) return ;
	if(x==b) ans=min(ans,k);
	if(x>=1&&!vh[x-1]) {
		vh[x-1]=1;
		dfs(x-1,k+1);
		vh[x-1]=0;
	}
	if(x<=b+9&&!vh[x+1]) {
		vh[x+1]=1;
		dfs(x+1,k+1);
		vh[x+1]=0;
	}
	if(x>=5&&!vh[x-5]) {
		vh[x-5]=1;
		dfs(x-5,k+1);
		vh[x-5]=0;
	}
	if(x<=b+5&&!vh[x+5]) {
		vh[x+5]=1;
		dfs(x+5,k+1);
		vh[x+5]=0;
	}
	if(x>=10&&!vh[x-10]) {
		vh[x-10]=1;
		dfs(x-10,k+1);
		vh[x-10]=0;
	}
	if(x<=b&&!vh[x+10]) {
		vh[x+10]=1;
		dfs(x+10,k+1);
		vh[x+10]=0;
	}
}

int main() {
	cin>>a>>b;
	
	dfs(a,0);
	
	cout<<ans<<endl;
	
	return 0;
}

Submission Info

Judge Result