Comments

for me, it is common that I make small mistakes and sit 2 hours straight trying to figure it out and fix.

They will not unban your account, mine was banned just because my "friend" posted blogs with very bad containment(he didn't even apology) and yet it's still is banned, although that happened 3 years ago.

On gelastropodioi results, 10 days ago
0

Why this code is so big???

What is the obstacle with solving problems on solving problems on your second account now?

On HBar26geoworld.world, 11 days ago
0

nah, I won't.

On ujjal1Note on Vector(STL), 2 weeks ago
0

"a lot of code".

On ujjal1Note on Vector(STL), 2 weeks ago
0

"I don't know why people have downvoted you". Okay bro I understood you.

On ujjal1Note on Vector(STL), 2 weeks ago
0

it is downvoted because the information here is mostly useless, how many times have you used insert or max_element function?

On piaoyunIs this a Div3?, 3 weeks ago
0

you need to solve hard problems every day, not only sometimes

bro you are newbie too.

On piaoyunIs this a Div3?, 3 weeks ago
0

bro you solved 1000 easy problems, for you to go further you need to solve hard ones, otherwise there will be no progress

On piaoyunIs this a Div3?, 3 weeks ago
0

at least you solved ABCDE, I couldn't even get the idea of D.

bro please answer honestly, are you a cheater or alt account user? You solved only 300 problems and you are expert.

bro got ragebaited in one message.

Small correction, WE all hope.

0

I’ll read this blog it later.

not good idea.

AI may be used in contests only for correcting some small mistakes, but if it generates the key idea and code, this is cheating. When person ask AI about some mistakes in his code, he will not just copy paste the code(because it is cheating), so naming the variable "votqi" by human is nearly impossible.

But if the person cheats, it will be justfull if he will be caught in a trap and banned, so why we must tell someone who cheats about the trap? All cheaters must be banned.

11:00 UTC will be perfect time for me.

betted all my money! Good luck!

I don't think other ways of gaining rating would be honest, because even in contests people use AI to solve problems, if there would another way(like solving problems for gaining rating), they probably will just read editorials and try to find the easiest way.

I consistently solve problems(hard ones), make some mashups with limited time, but there is no that feeling that I am actually improving.

what is merge sort?

you need to wait like 5-10 minutes for it to connect.

On ilexisHOW TO WRITE CLEAN CODE, 6 weeks ago
0

Pitiful, that don't work on me. After solving a problem i always find out that I am too lazy to think about editorial way.

mostly cheaters i guess.

use theme.cp site, and choose your level from level sheet and practice contests every day from there, their problems are very hard(even 800 ones).

As not a tester, I don't want to go to anyone's basement.

On kilobyte136SOO MANY CHEATERS!, 6 weeks ago
+4

despite solving 4 questions with a 288 penalty, I still ranked 10k WTH. by the end of the contest, i saw many profiles struggling with 800* questions days ago, and now they solved till Problem F?

Obviously there are many people participating on their alt accounts

Although your code works, there is an optimization on how to find primes in time complexity of O(n*log(log(n)) Sieve of Erathostenes:

vector<ll> prime(1e7+1),primes;
primes.push_back(1);
for(ll i=2;i<=1e7;i++)
{
    if(prime[i]==0)
    {
         primes.push_back(i);
         for(ll j=i*i;j<=1e7;j+=i)
         {
             prime[j]=1;
         }
    }
}

bro, you just need a copybook and a pen, draw a lot of tests and think for them, then try to divide them and you will find a pattern. That's how i solve most of the constructive alghorithms.

On CarVizfraud in the philipines!, 7 weeks ago
+6

and that's absolutely dishonest that he has more ratings than me.

0

just for one problem you need to build up a checker, validator, the correct solution make the problem text itself and translate it, then send it to the coordinator and if he doesn't approve it, debug it.

+4

For moment i thought that they messed up and added 2026 April Fools contest before 1st April, but then got rickrolled.

you can also do randomized 1200 rated problems when creating a mashup.

same here

solve problems, instead of posting some meaningless blogs

this is so good, sometimes my internet connection lags and this will save time, but can you also add a choice between the colors of the window? The black one don't really contrasts good with original codeforces window color.

Delete our operation system and that's all? You should add a game after user redownloads his operation system, where you need to score more point than previous record and you have only 1 attempt.

On HoH0HoDisappointed in myself, 2 months ago
0

actually this is my 4th time hitting specialist

She said that you were good, so if you are a good person you must stop insulting other people.

your rating is literally lower than his bro, so i don't think you should call him "Noob".

mine too please? Metall1cA

On HoH0HoDisappointed in myself, 3 months ago
0

bro everyone have this issue, it's not like it's due to your skill issue or smth like that, just stay calm and determined

On bestial-42-centroidsWhat, 3 months ago
+8

I absolutely HATE people who reply with "s." along with an image of their bitset waifu. Seriously, are you a runtime error? A segfault in the human language compiler? Imagine spending your precious CPU cycles crafting a beautiful explanation, laying out your thoughts with the clarity of a competitive programmer optimizing their bitsets, and the only response you get is "s." and with an image of their bitset waifu.

Like, excuse me, is your brain currently experiencing buffer overflow? Did you accidentally AND your listening skills with zero? I rephrased this explanation as a Codeforces editorial starring your beloved bitset waifu, you'd suddenly comprehend everything. Honestly, next time someone hits me with a "s." with an image of their bitset waifu, I'll just reply, "Sorry, buddy, didn't know your attention span had a time complexity of O(1)."

Do better.

bro, chill.

On HoH0HoDisappointed in myself, 3 months ago
0

Your problem is not that you are not clever or something like that, controversaly you are very smart, but you are applying hard solutions for problems that don't need it

good i want to participate

On Maxxx239I am finally a specialist!!, 3 months ago
0

probably it's reference to the George Orwell's book "1984".

On Maxxx239I am finally a specialist!!, 3 months ago
0

congratulate you all

it's all about what type of problem do you solve, like if you will solve only 800 rated problems you won't improve

On CaM1L_YBeing Pupil, 3 months ago
0

btw, have you ever solved problem C from div2,because I needed to solve a,b,c to reach pupil

On CaM1L_YBeing Pupil, 3 months ago
0

good, now tutorial for how to consistently solve A,B,C,D div2 problems?

On CarVizstop newbie/pupil hate!, 3 months ago
0

nah, you was!

i wish luck for both of us in the next contest i want expert title so bad

bro you are lucky to solve fast C, I misunderstand the given and thought that I needed to find a subsequence in a row and wasted 2 hours on it :(

0

from 1406-> to my max 1411

I had the same feeling with it being similar to problem B,but fastly realized that there I need a different approach.

Happy New Year!

bro,I have been stucked in Specialist because I don't have that specific test cases on some problems,like I solve 90% of problem but got stuck on some cases and it is really annoying

so it is pointless to dispute with you.

who said we just guess?

firstly what is the size of N?

I wonder why everyone is downvoting my comment,am I wrong? Then write in comments why you think that I am wrong,instead of just downvoting me because "a lot of people did".

oh yeah of course this is my skill issue and skill issue of 5000 other contestants

On AmirrzwMCodeforces Global Round 31, 5 months ago
0

Combination of C and D crushed like everyone in this contest

On AmirrzwMCodeforces Global Round 31, 5 months ago
0

srry,I sincerelly downvoted you,instead of dowvoting HIM.

Samples are very important in every codeforces problem, because it helps A LOT to imagine how to probably solve the problem and what unordinary cases there will probably be.

On MitproI finally reached Expert!, 5 months ago
0

Firstly, I want to congratulate you. This was probably huge aim for you. Secondly,I also want to become Expert and i can solve problem D in div 2 easily but when it come to solve it when contest is ongoing,my brain just stops working. Idk maybe it is psychological problem, but I just don't have enough courage to open it and solve

On ink65536New bot types on CF, 6 months ago
0

Then maybe we now need to registrate with phone number

On ink65536New bot types on CF, 6 months ago
0

I suggest making it that way that you can submit only like 10 submissions in every 10 minutes

On shshI hacked the winner of 2166 D2, 6 months ago
0

I have a question,how do you find the test that their submission dont bypass? Like you just make test generator and code to check his and your codes's output?

On dudozer_maksRate my setup, 13 months ago
0

how you connected keyboard to phone ,you made impossible thing possible!!!

On algoprinceHelp in this problem, 13 months ago
0

give link of this problem

On WhalicaHow to become Specialist?, 13 months ago
0

there is no receipt like "how to be specialist",sometimes in contest there will be question for an thing that you dont know also affect your luck. Just practice and dont worry about rating if you will continue practising you will be specialist

0

Sorry if you cant understand,i cant explain ideas very well

0

the idea that came to me while reading this problem is to do brute force,but if it will be stupid it will be TL. So, we can brute force every segment length of d, and we just need to find number of works at that time. We can count number of works in ans, but while we are brute forcing some works may be finished at that day,se we need to count number of finished works too in ans2. then lets create mx and mn to keep maximum work and minimum work on segment,if ans-ans2 is greater than mx,we update mx and store position,if ans-ans2 is smaller than mn,we update mn and store position. At the end just print it.My submission that passed is here:313211717

On AlperenTApril Fools Day Contest 2025, 14 months ago
+11

love first April contest ,cause this is only one contest where i can solve only one problem

On saraswati_panchamiHELP! HELP! HELP!, 14 months ago
0

dont worry this happens to everyone,results will not be so fast,you need just some patience,try to solve problems on your level,just remember that if you will pracrice every day you will improve

On Aritro_Speedrun!!!!, 14 months ago
0

you can do that,for reaching expert you just need to solve a,b,c fastly or mediumly on div 2 contest

yo not bad,also thanks I have been waiting for editorial to solve D

your first code found an victim and count its first car that go earlier than it,and if right after that is another victim your code just jump to it,did not fully checking previous,then you must check fully it,because one victim can be overtaken by some cars , not only one

On NoCap09Rating Obsession!, 15 months ago
0

everyone do that,cause it is like the question of life or death

https://www.youtube.com/watch?v=dQw4w9WgXcQ here it show some problems and solutions for sqrt decomposition

uou have forgotten to add,find easy problem make an fastly solution and dont checking it submit it,and after an 20 minutes finally solved it

i have the same situation i am solving 1300 and 1400,but one thing to up your rating is SOLVING THE PROBLEMS OF CONTEST AFTER ENDING. It is really important because it will improve your skills and you will know more than just skipping it after fail

i will go to specialist anyways. It didnt mean if it will be hard or not. It will just happen and i will solve problems until i will reach it

0

forgot to tell in the EDU there are similar task for two pointers

0

Firstly I want to say that you must try to slove it with two pointers,let them be l and r. At start both of them will be at 0.Then while gcd x(the gcd of subarray) will be over K you will move r to right and find gcd(A[r],x),also at the same time count h(lcm of subarray),if x is less than or equal to K you must divide h to lcm(A[l]+A[l+1]), then move l to right.Do it until l<n and if I a, right it will be faster than (N*N*log(N)).

On RPdreamerhow to be a pupil, 15 months ago
0

same problem,i can solve 1300-1500 rated problems on c2 ladders but on contest i cant do div2 C,so i am practising only on codeforces because its problems is much more harder and idea is not easy