Comments

i think im too old for it(passout +1.5yoe) , but will try for sure.

what was the idea in D

for 3 2 1 and if you are at 3 you go to p(3) that is 1 and then p(1) that is 3 it took only two steps right

could someone please explain the bfs solution for problem D, also what will be maximum number of steps to reach a cycle in a permutation of length n where we move from a random number x in permutation to permutation[x] 1 indexing similalry moving forward

On night.watchman → CP vs Chess, 2 years ago
0

cf peak — 1402 , chess.com peak — 1350

afaik upsolving the contest matters a lot in progress

0

i want @umnik screencast for this contest with musikk

um_nik is 1 hour ahead of us(iykyk)

you have to precompute in order to save time, so you can precompute till 2e5 in a vector and then give the answer in o(1) for each query

umnik stream was too oppp, checkout here — https://www.youtube.com/watch?v=fSsMFDV3WuM

so basically u r saying ill be stuck pupil forever

0

can someone tell on which test case my solution of e got hacked

0

can we solve f without fenwick tree

ill go into my dream company from the cp skills

On awoo → Codeforces Round 916 (Div. 3), 3 years ago
+1

back to back cf round , yayyyy

in c, i was thinking about finding upper bound for the numbers in array a for the bi and swap it , and check whether we can get x combinations or not, can we solve it like that

yea but eventually one must code it out to get AC, when we say Algorithm, it might be possible someone is able to write the algo on paper but can't code it out

yea understood, thanks a lot

bro but in sample test case 4 for 179 why do we need 27 , by nc2 it can be wo also right because 20 c2 is 190 more than 179

you must be getting negative bro, as b has more than 4k submissions and you are 1870 :/

number 893 iykyk

thanks for the blog, i was really thinking of giving up from last few months but guess what after this blog nothing changes , i'm still thinking to give up xD

yea ig this is true, according to me until or unless you are less than 1600 it doesn't matter much, i mean i am max specialist but i struggle sometimes in even solving leetcode medium, so what's the point?

Can someone tell what all type of content the cp guys want to see , and what duration also how much frequent they want some channel to upload videos. are they interested in leetcode content or not, or any types of preferences?

+3

yea even my solution also got hacked, how can i know for which test case my solution is failing

overkilled it

when u implement a good high school maths concept , (similarity for finding the smaller parallel side of trapezium), in cf contest, the feel is different!!

you can't judge someone like this, everyone gets a eureka moment often in life and just want to share it because he/she is very happy about it, if you can't admire there is no point in being rude

things we do for contribution

+1

swapforces iykyk

for mathura there is a google form on the website, you have to submit the ss there

yea amrita mine got confirmed , I checked with them, mathura still showing pending.

both amritapuri and mathura

I make payment 5 days ago but on icpc site, it is still showing pending, should i contact them or it will get accepted in few days

Is team leader and team coach same which they are asking in google form

what about gwalior-pune?

hoping to become master some day xD , till then feeling orange for some time!