Bergers.cpp

// Problem
// Chef is fond of burgers and decided to make as many burgers as possible.

// Chef has AA patties and BB buns. To make 11 burger, Chef needs 11 patty and 11 bun.
// Find the maximum number of burgers that Chef can make.

// Input Format
// The first line of input will contain an integer TT — the number of test cases. The description of TT test cases follows.
// The first and only line of each test case contains two space-separated integers AA and BB, the number of patties and buns respectively.
// Output Format
// For each test case, output the maximum number of burgers that Chef can make.

// Constraints
// 1 \leq T \leq 10001≤T≤1000
// 1 \leq A, B \leq 10^51≤A,B≤10 
// 5
 
// Sample 1:
// Input
// Output
// 4
// 2 2
// 2 3
// 3 2
// 23 17
// 2
// 2
// 2
// 17
// Explanation:
// Test case 11: Chef has 22 patties and 22 buns, and therefore Chef can make 22 burgers.

// Test case 22: Chef has 22 patties and 33 buns. Chef can make at most 22 burgers by using 22 patties and 22 buns.

// Test case 33: Chef has 33 patties and 22 buns. Chef can make at most 22 burgers by using 22 patties and 22 buns.

// Test case 44: Chef has 2323 patties and 1717 buns. Chef can make at most 1717 burgers by using 1717 patties and 1717 buns.
#include <iostream>
using namespace std;

int main() {
    int t;
    cin>>t;
    while(t--)
    {
        int x,y;
        cin>>x>>y;
        if(x<=y)
        cout<<x<<endl;
        else if(x==y)
        cout<<x<<endl;
        else
        cout<<y<<endl;
    }
	// your code goes here
	return 0;
}