THE MOON STINKS, LHQing EATS THE SH*TTY MOON!

THE MOON STINKS, LHQing EATS THE SH*TTY MOON!

THE MOON STINKS, LHQing EATS THE SH*TTY MOON!

THE MOON STINKS, LHQing EATS THE SH*TTY MOON!

THE MOON STINKS, LHQing EATS THE SH*TTY MOON!

THE MOON STINKS, LHQing EATS THE SH*TTY MOON!

THE MOON STINKS, LHQing EATS THE SH*TTY MOON!

THE MOON STINKS, LHQing EATS THE SH*TTY MOON!

THE MOON STINKS, LHQing EATS THE SH*TTY MOON!

Maybe you should be more cautious with your curiosity. It will give you bad consequences in the near future.

But as you have clicked in here, let me tell you about the three very important lessons that I learnt in contests:

1. Problem A is the easiest.

2. The last problem is the hardest.

3. Always be cautious with your curiosity (Yes, I am talking to you).

Do the three things above and you maybe become legendary grandmaster. Else you will drop (or stay!) in newbie forever.

Wow! Only 360 days are left until 2024! Why don't Codeforces hold a contest now called "Good Bye 2023: 2024 is NEAR"?

Change the normal starting time of contests to 18:05 UTC+8 please, so that every Chinese will be able to participate and there will be more Chinese LGMs. Otherwise, many people cannot stay up and need to refrain from participating. Thanks!

MikeMirzayanov

Please upvote to show support!

MikeMirzayanov

My friend told me that if you want to propose a contest, click the button. But I can't find the button, so I decided to write it here.

CF Round 1000 (Div.1+Div.2, the highest quality round ever created!)

A. A Plus B

Given two integers, output A Plus B.

B. Game of AI(Easy Ver.)

The only line contains two positive integers k and M (1≤k≤5000, 2≤M≤109 ). It is guaranteed that 218 is a divisor of M−1 and M is a prime number.

You need to calculate the answer for n=k.

Output a single integer — the number of different pairs of sequences for n=k modulo M.

C. Game of AI(Hard Ver.)

The only line contains two positive integers k and M (1≤k≤105, 2≤M≤109 ). It is guaranteed that 218 is a divisor of M−1 and M is a prime number.

Output k lines, where the i-th line contains a non-negative integer, which is the answer for n=i modulo M.

MikeMirzayanov I think 3 problems are ENOUGH! Please accept my proposal!!!!!!! HOPE everyone enjoyed my own problems!

MikeMirzayanov

Why can't other platforms get the problems from CF using Remotejudge? We only want to study. Besides, don't change the plugin again and again. Yesterday the RemoteJudge fixed the error, but today MikeMirzayanov changed it again, which sucks.

PLEASE!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! Why the heck do you suddenly thought of changing the plugin MikeMirzayanov??????????????? Fix this immediately!

Division 4 are for alts. They are very strong. *1700 problems cannot show their true strength. We should set the last problem to *2100 or higher!

Last time I wrote a blog to call for Div.5. However, some freaking damn people made it heavily downvoted. As a result, I want Div.4 to be easier.

You know, why set G to *1500 when there are only pupils and newbies attending the contest? You should set G to 1300 and lower. Round 784 is a good example of Div.4, but now this has vanished!!!

Please make the next Div.4 easier. Specifically, put the problems like *800 *800 *800 *800 *1000 *1200 *1300.

THANKS

There is div.4, but I think it is not enough. Too hard! We need to have a div.5. MikeMirzayanov What do you think? Setters of div.4, say your opinion. SlavicG Errichto

as the green setter, say too:tibinyte

We are going to go to CSP (a Chinese Olympic informatics Contest) on Saturday. Good luck, every Chinese oier!