Submission #1531939

---

Source Code Expand

import java.util.*;

public class Main{     
        
    public static void main(String[] args){
      
        Queue<Integer> q = new LinkedList<Integer>();
        Scanner sc = new Scanner(System.in);                                               
                        
        int a = sc.nextInt();
        int b = sc.nextInt();        
                               
        HashMap<Integer,Integer> hm = new HashMap<Integer,Integer>();
        
        hm.put(a,0);
        
        int m[] = new int[]{-10,-5,-1,1,5,10};

        q.add(a);
        
        while(!q.isEmpty() && !hm.containsKey(b)){
            int now = q.poll();
            for(int i = 0;i < m.length;i++){
                int next = now + m[i];
                if(hm.containsKey(next)) continue;
                q.add(next);
                hm.put(next,hm.get(now) + 1);
            }            
        }
        
        System.out.println(hm.get(b));
        
    }        
}       


        
        

Submission Info

Judge Result