Very interesting problems till F.Enjoyed solving all

A -> observation, Maths B -> Bit Manipulation. Greedy

back after 6 months

Can you explain in detail pls

Participating after 7 months,wish me good luck

Mochaforces

ee sala cup namde

Problem C is the reason for my headache today.

I used segment Trees to find product of a range % modulo

Was F dp + segment trees?

Was submitting C in last 30 seconds, but Checking if the site connection is secure take a minute

Easy video explanantion for problem E

Us

F missed the first line sides are 2^a[i] not a[i]

Am I the only one who was struggling with problem B ;-;

Easy video explanation for problem G(BRUTE FORCE WORKS !)

Easy video Explanation for problem F

Was feeling alone without cf contest ;

I doubt my mathematical skills after the contest

Ig the contest will start untill 2024

How to get rid of "Checking if the site connection is secure"?

I read Kazekage

Clicked me now, why all are LGM here

.

Participation is less due to ICC CWC Final

Problem B was difficult to understand

Video Explanation for Problem D

Screencast+Explanation | A-E

Screencast + Explanation (A-E)

Attack on Titan left the chat

Cf>>Leetcode Always!

Contest over,still my solution is in queue :))

Nice Div. 4 Contest

Me after solving A,B,C,D,E

DelayForces

Can anyone help me figuring out why I'm getting runtime error for problem C on test case 7.I'm trying from 3 hours still not able to figure it out.Your time will be worth a lot.Thanks in advance . Here's my code 188125909

ModuloForces

Finally contest after long time..

Salute to Codeforces for organizing 5 contest in a row !!. Thanks for such a lovely Christmas gift.

Cause he's world's best coder

Can anybody help me find out what's wrong in my solution to question A.Thanks in advance

https://mirror.codeforces.com/contest/1771/submission/184726214

haha lol!!

Me checking every 5 minutes, if my rating is increased by 0 or rating has not updated till now

Waiting for specialist to comment: Finally my first unrated round ;-;

What a speed!

Why unordered map gives tle on codeforces?

How to check if all rows and column in that submatrix is attacking by rook in log(n) time,beacuse it will take o(n) time

5 minutes delay for cooling down the excitement ;-;

Coders(>1600 rated) : Finally we can participate ;-;

Coders after attempting div 4 round: Coding is not too tough ;-;

was this first div 4 round

exited

they make us april fool my making it rated .lol

If we can't reach (x,y) in 1 or 2 move then we will first make move such that the x coordinate becomes equal to X coordinate of target(as y coordinate will be same so it will be valid) and in next move we will make y coordinate equal to Y coordinate of target (it will also valid as x coordinate will be same).So in minimum moves we can reach (x,y)

Your code's time complexity is o(n^2),where as given string size has limit upto 10^5. So expectime time complexity becomes o(nlogn).That's why it gives you tle

D was based on?

what was crux in problem b? any hint?

Saluting cf for organizing so much contests

C was tough one

So much contest this week :)
Intresting!!

Contest after long time.Eager to participate

I also think same-;

I wonder Why do only few number of programmers gave this contest and why does this post has huge number dislikes ?any specific reason;-;

Its great that cf is arranging two contest in two continuos days ;-;

Codeforces contest question's are really good as compared to all other platforms.

Will it contain any interactive problem?

Will it contain any interactive problem?

Problem B was really tricky

I hope everyone will raise their ratings after giving this contest

Why the contest is not rated? :( Rated contest gives more feel

Does the contest will be unrated now?

Does the contest will be unrated due to technical failure?

It happens sometimes,just try to refresh

Is rating below 2100 belongs to division 2? If so what is rating range for division 3?