### littlejuruo's blog

By littlejuruo, 2 months ago,

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!

• -63

 » 2 months ago, # |   +8 Sorry, I think your problem isn't proper not only due to the quality but also due to your informal manner of writing, and you'd better to improve your cp level first and prevent others from knowing your ideas.
•  » » 2 months ago, # ^ |   -14 BUT you are not MikeMirzayanov and you don't have the right to comment on my own problems!!
•  » » » 2 months ago, # ^ |   +8 but why would you even leak your problems even before it's out lmao
•  » » 2 months ago, # ^ |   +8 They're probably a troll lol. Don't waste your time with them.
•  » » » 5 weeks ago, # ^ |   +3 Yeah idk why some people seriously reply to these trolls