Codeforces Round 977 (Div 2) | Video Solutions - A to C1 | by Harsh Gupta | TLE Eliminators

[@TLE_Eliminators]

Please fill the feedback form of the PCD: forms.gle/wu9uLbb24R8sow6C9

[@nownow1025]

Very good explanation for B. Very useful modulo concept

[@nownow1025]

In leetcode

[@ayushbhowate42]

Best Explanations bro !!!

[@itsshree7939]

In B, what if the modulo achieved is from the bigger number in that case we cannot make smaller cnt from the bigger number pls clarify

[@depressd-boy.]

is there any problem ; i can't practics problem ; TLE eliminators webside;;;
help me

[@swayamprakashkar9664]

When tle 12.0 is launching?

[@shaiksameer263]

C2 I have done using segment tree with values l, r and flat

[@grid4477]

can you share your approach clearly bro? I was stuck on C2 for more than an hour.

[@karthikgutti9370]

can you explain the time complexity of problem B?

[@AppMaruf]

Problem B:
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int tc;
cin>>tc;
while(tc--){
ll n,x;
cin>>n>>x;
vl a(n);
for(int i=0;i>a[i];
ll ans=0;
sort(all(a));
mll m;
for(int i=0;i

[@aritradhabal]

Can we store vector b in a set and match the order with a

[@mohammadrizabul]

done in same way , create unique array of el of b and then match with a by using map

[@viratdhoni1879]

Bhai koi problem b smjha do code ke saath