## Adding Squares  Codechef October Long challenge Problem Code-

### problem Statement-

There are $N$ different vertical lines on the plane, $i$-th of which is defined by the equation $x={a}_{i}$ ($0\le {a}_{i}\le W$) and $M$ different horizontal lines, $i$-th of which is defined by the equation $y={b}_{i}$ ($0\le {b}_{i}\le H$). You must add one line of the form $y=k$ ($0\le k\le H$$k\ne {b}_{i}$ for every $1\le i\le M$) to the plane. What is the maximum possible number of squares with different areas you can obtain on the plane? (Squares can have other lines passing through them)

### Input:

• First line will contain $4$ integers $W$$H$$N$$M$
• Second line will contain $N$ different integers ${a}_{1},{a}_{2},...,{a}_{N}$
• Third line will contain $M$ different integers ${b}_{1},{b}_{2},...,{b}_{M}$

### Output:

Output the maximal possible number of squares with different area on the plane after adding a new line.

### Constraints

• $1\le W,H,N,M\le {10}^{5}$
• $N\le W+1$
• $M\le H$
• $0\le {a}_{i}\le W$ for every $1\le i\le N$
• $0\le {b}_{i}\le H$ for every $1\le i\le M$

• 50 points : $1\le H,W\le 1000$
• 50 points : Original constraints

### Sample Input:

10 10 3 3
3 6 8
1 6 10


### Sample Output:

3


### Explanation:

You can get $3$ different squares if you add a line $y=4$. The three squares are:

• Square with top-left corner at (6, 6) and bottom-right corner at (8, 4) with an area of 4.
• Square with top-left corner at (3, 4) and bottom-right corner at (6, 1) with an area of 9.
• Square with top-left corner at (3, 6) and bottom-right corner at (8, 1) with an area of 25.

### Solution -

Learn Bitset-
Follow the Link below for the bitset data structure and then follow my code.

### C++ bitset and its application - GeeksforGeeks

www.geeksforgeeks.org › c-bitset-and-its-application

### bitset - C++ Reference - Cplusplus.com

www.cplusplus.com › Reference › <bitset>

### codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

### Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1

### Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi