CP_Code_Prectice/A-Add Odd or Subtract Even at main · pranta2003/CP_Code_Prectice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
///////////////          PRANTA KUMER PANDIT            ///////////////
//                      Test Case Based Template                          //
//                                                                        //
//     BANGLADESH UNIVERSITY OF BUSINESS AND TECHNOLOGY (BUBT)           //
//                          INTAKE 52                                     //
//                      DEPARTMENT OF CSE                                 //
//                                                                        //
//||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||//
//                  WELCOME TO ISHAN'S PARADISE                           //
//        (-.-) Training to be a Secret Tool of Next ICPC (-.-)           //

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define all(x) (x).begin(), (x).end()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a) * (b)) / gcd(a,b)
#define optimize() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);


void ishan() {
    int a, b;
    cin >> a >> b;
   //int sum1=b-a;
    if(a == b ) cout<<"0\n";
    else if(a < b ){
        if((b-a)%2==1){
            //sum1+=1;
                                   cout<<"1\n";
        }
        //else if(sum1 % 2 == 1)
        else
        {
           // sum1+=2;
           cout<<"2\n";
        }
    }
    else {
      if((a-b)%2==0){
            //sum1-=1;
                       cout<<"1\n";

        }
       // else if(sum1 % 2 == 1)
       else
        {
           // sum1-=2;
                       cout<<"2\n";

        }
    }
   // cout<<sum1<<endl;
}
int main() {
    optimize();
    int lol;
    cin >> lol;
    while (lol--) {
        ishan();
    }
    return 0;
}

//                          THANK YOU                            //