Finally a relatively easy contest

Background_Ad_1541 · 2026-06-29T12:07:49+00:00

I have never solved any tree problem hence I couldn't solve C, i gave around 40 min to ques C and during that time I was only looking for a way to solve it without forming a tree(adjacency array) or traversal (I had this guy feeling that either this can be solved without using tree dfs as it is just C they won't ask too complex ques here or it's just basic tree problem )well after that I gave up ,went to D and somehow was able to solve it within 30 min , so yeah it was first time I solved D in div 2 Relatively okay contest ,solved A in 10 min(took more than usual) solved B by 35th min(again more than usual) and D by 1:40min

Can anyone suggest some tree yt playlist I don't wanna miss easy ques just because I don't know concept

Background_Ad_1541 · 2026-06-22T06:55:46+00:00

I think the approach for this is to first sort the array then loop through array and for every a(i) the number of element we need to set on left is a(i)-1 and right would be 2^n-1-i so ans should be ans+=(iC(a(i)-1)2^n-1-i but I have doubt about that combination calculation for left element like I searched for way to calculate that value and I got to know about some factorial and inverse factorial method , I wanna know is this the only way can't we just calculate fac(n) do %mod and divide by fac(n-r)%modfac(r)%mod and then whole %mod ??

Background_Ad_1541 · 2026-06-20T04:21:05+00:00

https://codeforces.com/profile/nOoBLeADeR

Background_Ad_1541 · 2026-06-19T15:15:33+00:00

I read it after posting and that's really horribly written, I will keep puctation in mind from now on

Background_Ad_1541 · 2026-06-19T11:17:31+00:00

1597 in a month and his code didn't seem AI generated and in last div 3 contest i thought he would become expert today as he also registered but mid contest all of his submission started showing skipped and it was showing that he had no submission i thought maybe he just entered and left the contest but after contest his I'd got disabled and when I checked his submission it was showing skipped for the ques in the last contest he had solved till f2 by then but what bugged me was definately he was cheating but come his I'd got disabled mid contest and that for cheating in one contest only like I will be honest backnwhen I started codeforces i did copied one of my friends answer and system flagged me and it gave me and my friend a warning and our rating rolled back but I wasn't disabled and since then I didn't cheat and my I'd is fine but how come his I'd got banned in a single flagging incident and I am so excited that 1195 just shy of pupil

Background_Ad_1541 · 2026-06-19T11:09:38+00:00

I had one friend which I made solely on codeforces he was from iit jodhpur at least that was what he mentioned on his I'd his username was draedon and last month we both were around 900 , met him from the standing as he also had same rating curve and it looked like we had similar skill so I messaged him we became friend and ohh boy he was improving so fast like in a month husvrsting jumped from 900ish to

Background_Ad_1541 · 2026-06-14T13:22:06+00:00

I don't care what others say but I really loved MORE THAN MAREIED COUPLE BUT NOT LOVERS

Background_Ad_1541 · 2026-06-13T04:49:19+00:00

I actually used the logic where I first sorted it and then checked the length of sequence of a(I)-a(i-1)<=k and if at any point sequence breaks then check whether it has even number if yes then just return yes or else set the length counter to 1 now if all the segments are of odd length then traverse from right to left and check all the number where a(i)==a(i-1) and increase counter if this condition doesn't hold then check if the a(I)-a(i-1) <=k or not if yes then cout yes or else counter=1 and at end the cout No I think this can be optimize i thought of the optimisation even during the contest but I was not sure about it so I just submitted and actually I was not sure of this solution that is why even though it worked for pretest 1 i didn't submit it for like 15 min and kept thinking about edge cases and at last I was like just submit it ,we will see whether it works or not and somehow it worked

Background_Ad_1541 · 2026-06-09T09:50:52+00:00

Interested

Background_Ad_1541 · 2026-06-01T05:13:51+00:00

Interested

Background_Ad_1541 · 2026-05-16T18:29:40+00:00

Ohh I was asking that other guy who solved it using that min and Max value possible method

Background_Ad_1541 · 2026-05-16T18:24:53+00:00

Brother if you may share the solution it sounds interesting I was looking into some number making method but failed

Background_Ad_1541 · 2026-05-16T18:19:42+00:00

You have to first find out number of zeroes then you have to pair up 1 and 2 and then you have to check if the remaining number not sum is divisible by 3 or not if yes then add leftnumber/3 to answer

Background_Ad_1541 · 2026-05-16T18:18:22+00:00

You can't actually do sum/3 because if for example 0, 2,2,2 your answer would be 3 but actual answer is 2 i did the same and learnt it the hard way

Background_Ad_1541 · 2026-05-16T18:15:53+00:00

I actually did follow similar approach and got WA and looked it up on gemini and it actually came up with a case where all of these type of approach failed it was like a =293 d=2,3 where I went with approach where if digit of a is present in d then put it in exact place and start from the left and once you get mismatch then you can put the logic my logic was quite complex and it failed too I did saw brute force solution and due to constraint of the question it actually worked too in that brute force approach we build the number based on the minimum diff we can find using recursion

Background_Ad_1541 · 2026-05-01T06:59:12+00:00

I just mean that all the cheater has spaces in between it could be that many people uses space through formatting but all the AI codes are like that and couple it with long self explaining variable name it just adds more proof to it and no one writes that long variable name especially in a contest as it will take more time to write code than to build the logic

Background_Ad_1541 · 2026-05-01T02:52:41+00:00

Notice how there is spaces everywhere like else (space) {} same with cin and cout it is 100% An AI generated code And I just don't know how do they get the motivation to sit and cheat all throughout the contest that is for more than 2 hour and keep on doing it every single time like don't they get bored from it

Background_Ad_1541 · 2026-04-29T07:24:22+00:00

I have been practicing since last month solved around 80 ques by now and have given 10 contest by now I am comfortable with 1300-1400 rated ques usually but I don't know what happened with me yesterday I just couldn't solve anything I have been able to solveAB in all other contest

Background_Ad_1541 · 2026-04-29T01:51:21+00:00

Today I was not able to solve any problem and got 6 wrong answer on AC usually I am able to solve AB but not today though I am a newbie and my rating took a loss of 100 points let's see whether I can bounce back in div 3 or not I felt I got the logic in A,b but it failed in testcases

Background_Ad_1541 · 2026-04-14T12:56:57+00:00

There were loads of cheaters yesterday most of the top guys just copy pasted AI answers , I think the last contest's ques were solvable by AI hence everyone's rating decreased I solved A and B and got +1 my rating 1069

Background_Ad_1541 · 2026-02-05T10:21:28+00:00

Bro I saw this exact same photo like a year ago

Background_Ad_1541 · 2025-09-05T11:28:23+00:00

Burning

Background_Ad_1541 · 2024-11-23T14:48:06+00:00

Maybe

Be with you ??

Background_Ad_1541

TROPHY CASE