Hi everyone!

Sixth round of COCI will be held today Saturday, March 13th at 14:00 UTC. You can access the judging system here. If you are not familiar with COCI contest format, we encourage you to read the announcement.

The round was prepared by paula, dpaleka, pavkal5, bukefala, stjepanp and me.

Feel free to discuss the problems in the comment section after the contest ends.

Hope to see you later today!

Hi everyone!

Forth round of COCI will be held this Saturday, January 16th at 14:00 UTC. You can access the judging system here. If you are not familiar with COCI contest format, we encourage you to read the announcement.

The round was prepared by paula, Shtef, dpaleka, pavkal5 and me.

Feel free to discuss the problems in the comment section after the contest ends.

Hope to see you on Saturday!

Hi everyone!

Second round of COCI will be held this Saturday, November 14th at 14:00 UTC. You can access the judging system here. If you are not familiar with COCI contest format, we encourage you to read the announcement.

The round was prepared by paula, Gabrijel, dpaleka, bukefala, pavkal5 and me.

Feel free to discuss the problems in the comment section after the contest ends.

Hope to see you on Saturday!

What do you think about multiple test cases in one file?
For me, it's very annoying. Why authors are choosing that way of input? Is there some limit on number of test cases?

Hi!

There are a lot of competitive programming coaches who offer online lessons. What do you think, should Codeforces create some subpage where coach can provide information (like prices) about himself?

In chess world, popular sites have pages about that. For example,

https://lichess.org/coach

https://www.chess.com/coaches

Yesterday I found interesting solution for 850B - Arpa and a list of numbers.

Let G=gcd of all numbers after all operations.
First observation was if I have some prime number p which divides G, then I can easy in O(number of different numbers in array a) calculate minimum cost to make list good. Now question is only for which prime numbers I will calculate minimum cost.

I have some MAGIC constant and I will calculate minimum cost for first MAGIC prime numbers and MAGIC most frequent prime numbers which are not in first MAGIC primes. Frequency of some p is increased by 1 if p divides a[i].

First idea was to set MAGIC=12, this will pass all official test data, but there is counter-example. We can choose some prime P which is not in first 12 primes and put in array a numbers: P, 2P-1, 2P-1, 4P-1, 4P-1, 6P-1, 6P-1, ... and so on while numbers are less than 10^6.

But there is way how to avoid this problem. We can see that numbers in array in that example grow very fast so N will be small and that means that we can calculate minimum cost for more primes, so if I set
MAGIC=min(3*10^7/number_of_different_numbers_in_array, number_of_primes_less_than_10^6)
then algorithm will work on that example.

Is there any counter-example for this algorithm and if counter-example doesn't exist, why is that?
Here is my solution: 30086367

Hi! I would like you to introduce you to an application called ACStand.

ACStand is program in which you can display results of any AtCoder contest for some list of users which you made before. When I say results, I mean only points which users scored, without penalty. I will add penalty in near future.

Program has 2 modes, official and unofficial. In official mode, program for every user consider only submissions which were submitted during the contest, in unofficial it consider all submissions.

You can find installation details here.