/* package codechef; // don't place package name! */
 
import java.util.*;
import java.lang.*;
import java.io.*;

package java102;

public class simplecalc {

public static void main(String[] args) {

t = int(input())
a,b=0,0
prevp1,prevp2 = 0,0
while(t>0):
    l = list(map(int,input().split()))

/* package codechef; // don't place package name! */
 
import java.util.*;
import java.lang.*;
import java.io.*;

Below is my code for this problem using python.

from collections import Counter
n1,n2,n3=map(int,input().split())
VList=[]

My code complexity O(nlogn).

What is you say is correct but, I submitted the brute force one and it's accepted!! I think as the size is 150 its accepted. Here's my solution.

int main() {

Here's A Recursive DP Solution of this!

Equals Gifts IARCS at master · JVJplus

yes sir plz

That's awesome Rajashekar, great job. That was quick. :)

Next step is the Competitive Programming Playlist. Its long, but just take it one step at a time. Ask questions if you get...

i completed all the beginner problems posted...after these what i need to do next?

Thanks