C. Ntarsis' Set | Codeforces Round 887 (Div. 2) | Codeforces | DCC NIT-A

Codeforces Round 887 (Div. 2) || C. Ntarsis' Set Solution || Chetan Saini
Problem : codeforces.com...
Solution : codeforces.com...
We highly recommend you to go through the question once, try to solve it by yourself and in case you get stuck revert back to this video for detailed explanation and solution to the problem.
Welcome to NIT Agartala’s Developers & Coders Club channel. Do subscribe our channel to get more such updates and also like the video if you find it helpful. Also comment down below sharing your thoughts, all constructive criticisms are welcomed.
Happy Coding!

[@Rahulkumar-fb8fi]

Thank you so much for this helpful video, please keep posting 🙏

[@harshitmakhija6817]

This video is indeed helpful, thanks :)

[@nitishkushwaha3821]

just brilliant surely 1600 question i guess.

[@sarthakgupta5168]

great explanation buddy please improve audio

[@muhammadosamafahim7019]

can you please tell how 1e12 can be the maximum value of the number which can be left out ?

[@DCCNITA]

In the worst case scenario, there will be total N = 1e5 elements and every element between 1 to N is there. (Like : 1,2,3,...,1e5) And value of K is 1e5. So, after K days, N*K elements will be removed, which means we will get our answer after N*K surely. So that is 1e10, but for not making tight values, I made that 1e12.

[@khalilshaik6161]

I initially had the same doubt : we are continuously decreasing mid, that makes a difference.

[@muhammadosamafahim7019]

very intutitive approach yrrr

[@DCCNITA]

Thanks ❣

[@utkarshsharma1185]

Thanks for explanation, my java code in-case anyone finding it hard to read the code mentioned in the video. while (t-- >0){ int n = fs.nextInt(); int k = fs.nextInt(); int arr[] = new int[n]; int ones= 0; for(int i=0;i

[@ahsanhabibswassow8407]

if (mid < 0) return false; can you please explain? Thanks((:

[@rajmittal5394]

One small suggestion, in start 9 min there is nothing much . Just stick to the main part don't make such long video of just one question .

[@phamdacthanh3298]

Thanks, nice video explaination

[@DCCNITA]

Thanks ❣

[@mohitmalik4610]

very good explanation thanks

[@DCCNITA]

Thanks ❣

[@NileshKumar-dv8jg]

🔥🔥🔥🔥

[@DCCNITA]

Thanks ❣

[@mukundshah1314]

Why we adding x in tot..tot shouldnt be the max of x

[@DCCNITA]

X is the total number of days on which that particular a[i] will contribute in that range. So, just suppose for 5 days, some a[i] is contributing, then for these 5 days all elements from 0 to i will contribute. After that, we will check that for how many days a[i-1] is contributing. This is after changes of last 5. So we adding all numbers.

[@Vikassharma-rq5bh]

Not getting clear explanation second time.I think this question is not for me at this moment.😅

[@utsavaggrawal2697]

nice explanation thank you

[@DCCNITA]

Thanks ❣

[@GauravSingh-wi5pc]

in check function there is not need to check if (mid

[@mohitmalik4610]

yes beacuse a[0] = 1

[@DCCNITA]

Ya, I added a[0] = 1 later. So ...

[@muhammadosamafahim7019]

Also why lo is set to 1 ?

[@DCCNITA]

Because the minimum element is 1.

[@muhammadosamafahim7019]

@@DCCNITA oh okay I set it to 0 and still it ran

[@prabhu__why_not]

ox days

[@CodeTillEternity]

i didnt got it maybe i am really dumb

[@utkarshsharma1185]

just chill bhai

[@CodeTillEternity]

@@utkarshsharma1185 hnji

[@xarma]

nice

[@DCCNITA]

Thanks ❣

[@witty_reflections6]

Orz

[@DCCNITA]

Thanks ❣