Codeforces Round 802 (Div-2) | Solutions | A-B-C-D

[@ankitsinha4454]

Congratulations for your perseverance man.. wishing you all the best for all future endeavors!!!

[@PravinShankhapal1]

Congo for CM

[@rishav144]

unfortunately , he slipped to expert now...Also left Doing contests and KZbin live stream as well .... 😣

[@judgebot7353]

bro please come back . We're eagerly waiting for your tutorials 🥺

[@devteams9715]

only channel which is continuously covering all CF contest. Thank you, keep going. Congrats for CM and 5K

[@yashkhatwani3198]

Amazing explanation bhaiya and you are so calm while explaining its nice

[@alokdhal6648]

Really great way of explaining 😃...Keep posting ...and inform before hand which contest poblems you will upsolve so that i will never miss that contest

[@TECHADVICETEAM]

Congrats for 5k and CM!!!

[@camlot6326]

Congratulations sir for becoming Candidate master

[@aocpc_community]

Yóh, broh. Your teaching skills are amazing 🤓! I could understand the main part of the problems, but in problem D I couldn't figure out clearly why you applied BINARY SEARCH OVER THE ANSWER and the idea behind that. 🤔

[@ssv6055]

yeah bhaiya...where are you ?

[@programmertik2046]

As you explained in C that we should consider making alll elements as ( maximum-minimum) In the third test case 4 -4 4 -4 why arent you considering (-8) as (4-(-4))=8 so we should make all -8 right ??

[@Cicada-ru6sh]

wo edge case ha

[@theresweet984]

seems your T-shirt never gonna change :')

[@udaykiran4404]

Sir can say CP books for beginner please

[@mayankdutta2832]

amazing bro !

[@shreyashachoudhary480]

Congrats man!

[@alltechpoint8508]

Thanks for editorial

[@pranav9068]

This time I was able to visualise the process but was not able to physically code it

[@saurabhkumarsingh9550]

Please make more videos 🙏🏻

[@abhishekprajapat415]

Nice video. It will be better if you can make your camera video smaller. I have a small 13inch screen hence a wider view of the whiteboard and screen will be much appreciated.

[@giraffe4375]

Thank you

[@kailasanischal6790]

Why is this giving wrong for B... n=no of dgts,m=number int ans=0,max=0; int firstdgt=(int)(m/((int)Math.pow(10,n-1))); if(firstdgt!=9){ max=(int)Math.pow(10,n)-1; } else{ for (int i = n; i >=0; i--) { max+=(long)Math.pow(10,i); } } ans=max-m; out.println(ans);

[@shivi3157]

👀🔥

[@Sksahu_123]

congrats man for cm

[@girishbhargava6367]

Congrats for becoming a candidate master once again. Just one advice, instead of using so much header files, you can use #include. It doesn't look good for a CM to not include so many individual header files. 🤪🤪🤪🤪🤪🤪

[@camlot6326]

its slow down compilation time, as it has to process much more file, so many coder use all required libraries instead of bits/stdc++

[@girishbhargava6367]

@@camlot6326 okay man, thanks for this knowledge.

[@EpsilonCodes]

@@camlot6326 not necessarily, you can precompile headers.

[@aasthagoyal5059]

In last que what we are trying to find by binary search...also if anyone can share logic also

[@xarma]

congo for CM

[@fawazelahi2171]

In question b , if it's 91 ,then what?

[@NiketBahety]

10

[@TonyStark-lj9vw]

@@NiketBahety its 20

[@NiketBahety]

@@TonyStark-lj9vw actually it can be anything from 10 20 30 .....90

[@TonyStark-lj9vw]

@@NiketBahety bruh i was just saying because we are considering all 1s case so it will be 20

[@NiketBahety]

@@TonyStark-lj9vw ohh alright 👍

[@01utpalraj95]

I think 4th is more easier than c

[@xarma]

sure thing

[@champion5946]

Problem B: Python import sys import math def gt(): return map(int, sys.stdin.readline().strip().split()) # x = list(map(int,input().split())) t = int(input()) while t>0: n = int(input()) m = int(input()) s1 = "9" * n s2 = "1" * (n+1) if str(m)==s1: print(int(s2)-m) else: s3 = "1"*(n-1) s3 += "2" if m

[@amanagrahari8511]

1023 ko 1111 me kaise bdlenge , plz advise me

[@BCS_VickyGupta]

we cant do that as bcoz the size will be different btw it will be 11111 (five one not four).., Instead of converting to 11111 try to convert it into 9999 you'll get the same size digit

[@BCS_VickyGupta]

we cant do that as bcoz the size will be different btw it will be 11111 (five one not four).., Instead of converting to 11111 try to convert it into 9999 you'll get the same size digit

[@yogeshagarwal8537]

I was even not able to solve problem C manually🥲🥲