Submission #6912897

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int a,b;
int cnt=100;
bool v[110];
void dfs(int n,int t)
{
    if(n<=40&&n>=0&&!v[n])
    {
    if(t>cnt)
    return;
    if(n==b)
    {
    	cnt=min(cnt,t);
	    return;
	}
    v[n]=true;
    dfs(n-1,t+1);dfs(n+1,t+1);
    dfs(n+5,t+1);dfs(n-5,t+1);
    dfs(n+10,t+1);dfs(n-10,t+1);
    v[n]=false;        
    }

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

Submission Info

Judge Result