Если у кого ещё такая проблема есть, то это,как вариант, связано с нечетным n  (последний человек ни разу не дежурит)

Which algorithm?? Help

Thanks YOU!!

Below test helped me to pass test 5 after WA verdict:
5 6 4
0 6
0 3
0 7
0 8
department 1 10 1
department 2 10 1
department 3 10 1
department 4 10 1
department 0 7 10
department 0 500000000 1000000000

As you can check manually, correct answer is:
1000000014
1000000017
1000000014
1000000018
1000000019

try 1 10000
answer 25007071.3178118650

There is solution for all n <= 10^5 though I still can not fast enough generate answer

According to my calculations the largest such sequence can be 344001 for the constraints of the problem.

answer for every n exists
there is no possibility to output “impossible”

You have to use BigInteger, you can't simply use Long Long bc the answer can go up to 2^(1600)

Thanks

Centers of circles form a regular polygon with side length 2. Now, consider the formula to find circumradius of a regular polygon and add 1 because you were connecting circle centres, but not their tangent points to the circle.

i also have wa#6

Same here... got stuck in Test-16 .

It can be solved using O(log(n) + log(k)) rows.

Do it like that:

1) put AA right before # to the left. This is 00 written base 26.

2) go right until you encounter -. Put + there and then go left until you hit #. Increase that number (it will become AB). Then go right again.

3) if you encounter # while walking right, go left and compute coordinate of last - mathematically using cells to the left as memory with base-26 2-digit arithmetics. For arbitrary k and n it will be more than 2 of course, that's why it's O(log(k)+log(n)), but not a constant.

4) like in case of 2 run right/left by putting - instead of + until result becomes zero (decrease it with every - set).

5) Find rightmost - and paint everything to the left with +

6) Find - and stop there

Though, I heard in this forum that the checker is wrong as it stops when there are n-1 pluses, but not when invalid state/character pair is met. So, actually you will have to use O(n) states to calculate 'n' and then bring back this value to calculation area inside read/write head :)

My solution for each k output 604 lines.