some colors look better than others so i just wanted to make a quick list of the hierarchy

are any of you guys interested in this idea if not we can just play on hypixel party games

thought it would be a good community bonding experience

anyways i was inspired by marlow to get back into pvpclub so if you guys wanna 1v1 maybe like next week comment or dm your username

Hello codeforces, welcome back to another cheater callout post.

Today, we have user Jochen_Solve. While this user is already getting skipped and further action may not be necessary, I decided to put this user to the test on my own.

After asking him to solve a problem I put in a mashup contest and edited, he left some interesting variable names in his code. The evidence is below for you to see.

If anyone would like permission to view the contest/submission themself, you can comment or dm me and I will give you access.

here is my unofficial rules:

you must either (any one of them):

currently live there

be born there

be ethnically from there

have citizenship for there

be in support of the country during a difficult time (war or such)

what do you guys think about these rules?

Hello again codeforces, we need to have a talk about the current state of contribution farming. I have noticed that lately, some users (that I will not explicitly name) have been farming upvotes, using the topic of AI and cheaters to do so, and it is simply something I cannot stand for. As codeforces' most truthful author, I want it to be clear that I will not post something agreeable simply for it to be agreeable. I make an effort to post thought provoking blogs that will spark creative thinking and interaction between commenters. When I see blogs doing the bare minimum yet being agreeable as possible to farm contribution, it makes my blood boil.

Some notable blogs that I see doing this:

AI is ruining Codeforces in a different way

Dead Codeforces Theory

Codeforces needs a Better Rules Page

hello codeforces! as tonga's first expert, i would like to announce the unnofficial first tongan computing olympiad. this will take place on march 19th, 2031.

these are all the topics that will be covered: dp, trees, binary search, chinese remainder theorem, combinatorics, breadth first search. all of the problems are guaranteed to cover at least 3 of these topics.

in person attendance at tonga will be mandatory.

a score of less than 99% on the entrance frq will result in immediate disqualification.

all of the problems will be interactive communication problems.

point distribution will be posted by march 19th, 2029.

if you have any questions or would like to become a problem writer, please comment below.

Hello my many admirers, today, I have news I must bring you.

The battle is over...

Kevin won.

Making any more blog posts puts me at risk of being banned. So, out of fear for my safety, I must retire from being on the forefront of our mission. We must cast our votes and find a new leader.

This may be my last post.

Flashback; Late 2025:

Kevin has made it present him and other elite members of the community are not stopping until all newbies have their lips cut off. Someone need to stand up.

I post my first blogs exposing the system that kept me away from first in my country. The war begins.

Kevin sends spies to Tonga, and we play a game of Bingo.

But the more I posted, the more clarity I had of their intention.

We must stand up.

Current Day:

To this day, I get downvote bombed, ban threats. It's clear my time is over. I tried to stop them from sordering my mouth shut, but I lost my voice.

My wings burned. Not because I flew too close to the sun, but because I flew under the chem trails.

It is your time my fellow newbies and pupils, we must rise. This is our platform, we cannot stand below the few.

cry, one of the few who speaks for the many, I choose you.

it doesnt seem alphabetical and it doesnt seem by rating or contribution

hello, i'm wondering how to confirm if a user that seems suspicious is a cheater (obviously theres no way to be sure, but just to be more confident). i saw apersonref's preformance on the last contest (div3), getting a WA1 on A, failing to solve E, and im not sure if im correct in calling them a cheater. if anyone has better advice in how to spot cheaters, would you be open to telling me? just what are some general signs and stuff?

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 "what".

Like, excuse me, is your brain currently experiencing buffer overflow? Did you accidentally AND your listening skills with zero? Maybe if 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 "what," I'll just reply, "Sorry, buddy, didn't know your attention span had a time complexity of O(1)."

Do better.

yooo i just made it back to specialist this feels so epic

now i can drop next contest

fellas took a whole day just to update my rating bro

cheater of the week: CarViz!!!

evidence:

1. he is too good! he is gaining rating too fast!

2. he solves an inhuman amount of problems.

3. he is very inconsistent. in round 1073, he only solved a and b.

hope this helps!

is anyone else locked in and ready to learn for tomorrow im very excited (i will be doing it sunday to avoid crashes like what happened to me last contest in silver unfortunately but i hope its fun for you guys in gold and plat)

farmer john has n cows some cows moo what is the average density of a cow

hello speedforces! one of the primary issues i have with contests is the uncertainty of placement/rank. in edu scoring, placement/rank can be especially uncertain when you have negs on lower problems (as in the case in the recent div3). not only this, but it HEAVILY discourages entering contests late, as it almost guarantees you will have the highest penalty for your solves. to minorly help both of these and make div3/div4 contests more welcoming, what if your penalty was determined by only one problem, your latest solve (or maybe not depending on how many negs you have)?

me, and many other pupils are able to solve div2C, and with reasonable speed (i vary, and i will admit when i go fast it is a decently high placement, like top 2k, but that doesnt invalidate my question) but still struggle to even get out of low-mid pupil preformances. im just wondering if this has always been the standard or is because codeforces has gotten more competitive. the jump from div2c to div2d is decently big, at least algorithmically, so for solving a-c every contest to end up in pupil can be demotivating if i didnt enjoy solving regardless.

like bro the given test cases wont even work for my code so its kinda scary its either i get it first try (because im the goat) or i give up

guys I dropped from specialist I'm quitting codeforces

contest more like trolltest

I have nothing to live for anymore

hey im looking for any sort of website or something that can find a contest (div2) that two users have not had any submissions on so they can virtual contest it and 1v1 for a higher score.

i just got 11 rr thanks

bro im usually good at binary problems this d genuinely cooked me bro anyways how did you guys do i think i did pretty good at least in the beginning

I would like to thank the codeforces community for welcoming me back in with open arms. A month ago, I thought my status in this community would never repair, but I should have known better.

As a conclusion, I will lay down my civil duties of protecting the codeforces blogs from negativity towards the platform. I think the community has already shown there is no need for monitoring.

I hope to see this upwards trend in voting follow on my posts. I think it wont be long before I surpass Kevin114514.

BLESS UNCLE tourist

wait genuinely it says it fails test 4 but when I run it on test 4 manually it passes

359461785

Hello codeforces! A while back I presented myself with a challenge to build a random function from only random bits. However, in the process of doing so, I realized that not only was this much more difficult than I expected, I ended up wondering whether it is possible at all. So here's what I did and the challenges I faced before asking you for a solution:

Creating 1/powers of 2 is trivial, since flipping n coins can create 2^n random possibilities.

Similarly, the same thing would be possible with dice, for example flipping two die and then multiplying one dice by 6 and adding them together can yield a 1/36 chance.

This seems to be limited to the factors given though, a dice can create 1/12 or 1/18 as well, using mod.

I don't want to have to flip potentially infinite coins. So, I can't get a 1/8 chance and then reroll on an 8 to get a 1/7 chance.

I first attempted to use different flips of powers of two using the binary representation. For example, for a 1/7 chance I thought to flip 4, then 2, then 1 coin. However, it seems this distribution is not even, you have to play plinko to get 0 or 7.

So my next idea was to create a super large value from say 1000 coins and then divide to the value. Effectively a 1/7 chance but, not perfect either way. This just minimizes rerolls, since it minimzies the ratio when creating a 1/n chance since as a value k gets bigger 2^k % n is smaller relative to 2^k.

Apologies if this is a solved problem, or if this is a well known unsolved problem. This was on my mind for a while now.

i keep seeing it at the top of the div4 leaderboard on their e solutions

great minds must really think alike

whichever school in india they are learning from show me i need to learn from there

like after we all finish the div2 we could lowkey take a break and have a post div2 party on hypixel party games would be kinda tuff is anyone else down lmk your usernames

ign: w04h