Studious Little Jhool | Editorial by aksingh007

This is an simple implementation if DP.
We use the following recurrence:
int res = 1 + min( rec(tot - 12) , rec(tot - 10) ),

```
 
import java.util.*;
 
class TestClass {
    public static void main(String args[] ) throws Exception {
        Scanner sc = new Scanner(System.in);
        int ans[][]=new int[115][2];
        int arr[]=new int[]{10,12};
        for(int i=1;i<10;i++)
            ans[i][0]=ans[i][1]=99999999;
        ans[0][0]=ans[0][1]=0;
        for(int i=10;i<115;i++)
            for(int j=0;j<2;j++){
                int a=0,b=0;
                if(i-arr[j]>=0)
                    a=ans[i-arr[j]][j];
                else
                    a=99999999;
                if(j-1>=0)
                    b=ans[i][j-1];
                else
                    b=99999999;
                    ans[i][j]=((1+a>b)?b:1+a);
            }
            //System.out.println(Arrays.deepToString(ans));
            int t=sc.nextInt();
            while(t-->0){
                int n=sc.nextInt();
                if(ans[n][1]<9999999)
                    System.out.println(ans[n][1]);
                    else
                    System.out.println("-1");
            }

}
}

```

Studious Little Jhool | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?