Should we even consider using python in future for CP or just go ahead with C++?

can anyone tell me where the error is , Thanks !

#include <iostream>

#include<algorithm>

Why is it giving TLE ?

#include <bits/stdc++.h>
using namespace std;
const int maximum = 6100;

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()))

using System;
namespace Codechef__TLG_ 
{
    class Program 
    {

Actually BIT supports max/min queries and continuous sum( a[i] ~ a[i+L] ==> +x) queries.

We can implement by using 2 BIT.

Oops, should have reread my reply before posting, thanks for the correction.

'Almost every solution you can do with Segment Tree can also be done with Binary Index Trees.' Its true the other way round because BIT only supports sum queries

Can you please explain the reason behind taking the upper limit for binary search n (and not n-1)?

In my case taking upper limit to n-1 gives segmentat...

Sorting using end time.

#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long 

So most of the people used lower_bound. But I thought of using custom binary search function for clear understanding. Here you go:-

#include<bits/stdc++.h>

why is my solution not passing two test cases ?

a=[]

b=[]

result=[]

/* package codechef; // don't place package name! */

import java.util.*;

import java.lang.*;

Hey guys, I passed all test cases but two. Cant seem to figure out whats wrong with my solution. Am I missing any corner cases?

#include <bits/stdc++.h>

Got AC

#include <iostream>
#include <cstring>
 
using namespace std;
int N;

can someone tell me where my logic failes please ? thanks !

#include <iostream>

#include<algorithm>

using namespace std;