# Arithmetic Operators

### Problem Statement :

```The provided code stub reads two integers from STDIN,  a and b. Add code to print three lines where:

1.The first line contains the sum of the two numbers.
2.The second line contains the difference of the two numbers (first - second).
3.The third line contains the product of the two numbers.

Example:
a=3
b=5

Print the following:
8
-2
15

Input Format:
The first line contains the first integer, .
The second line contains the second integer, .

Constraints:
1<=a<=10^10
1<=b<=10^10

Output Format:
Print the three lines as explained above.```

### Solution :

```                            ```Solution in C :

if __name__ == '__main__':
a = int(input())
b = int(input())
c=a+b
d=a-b
e=a*b
print("%d\n%d\n%d"%(c,d,e))```
```

## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

## Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

## Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty