Pinot

import java.util.*;

public class pinot2 {

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);

        int qty = input.nextInt();

        int[] a = new int[qty];
        int[] b = new int[qty];
		int[] ans = new int[qty];

        for (int i = 0; i < qty; i++) {
           a[i] = input.nextInt();
           b[i] = input.nextInt();
		}

		int test = 1;
		int a1 = 1;
		int b1 = 1;
		int whole = 1;
		int remain = 1;

        for (int i = 0; i < qty; i++) {
			ans[i] = 0;
			a1 = a[i];
			b1 = b[i];
			remain = 1;

			while (remain > 0 ) {

				whole = Math.max(a1, b1) / Math.min(a1, b1);
				remain = Math.max(a1, b1) % Math.min(a1, b1);
				ans[i] += whole;

				if (a1 > b1) a1 = a1 - (whole * b1);

				else b1 = b1 - (whole * a1);

			}

			System.out.println(ans[i]);
		}
		input.close(); 
    }
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED