Problem L Neelu in Wanderland, could it be solved using FFT?

Frequently pressing the submit button hurts my hand.

We are also struggling to submit.

Both are same!

a + b = (a | b) + (a & b)

No. When you open problem at that time if you submit problem then you get full point. points will be deducted according to how much time you take to submit problem. Your solution will be judged after coding phase finished.

please predict mine Sakhiya07!

I don't know proof but solution look like this series. If a(n) = 1, then first player win, otherwise second player win.

Orz

Is there any requirement(rating or anything) for coach mode?

In your code l is integer and r is integer and their product can be exceed range of integer that's why you are getting wrong answer.

There is always answer 1 but if all elements of array are same,answer is n(size of array).

How to solve E?

For A

1

8

1 1 2 2 2 8 16 32

There is no testcases so that maybe

Really i can't believe it.

what is vandermonde matrix? I don't know about it if anyone know tell me.

thanks got it.

How Can you explain i can't get it still?

For Problem E

First

Second

First code is not working for 2 testcases so i added one if for k==n that is second code and Second code is not working for 3 testcases. I can't understand how it is possible can anyone help me?

How cycle size is exactly gcd(n,m)? Is there any proof of it?

There is one more condition that LIS should be consecutive in given sorted array.

So I request to Mike to make you Coordinator.

1

6 3

4 1 4 1 1 3

I did not like this but simple like you. My submission

Can you share your code?

How could you get this formula?I saw same question in one educational round but i don't know proof behind this formula?

Yes,You are right.

5 3 0 0 0 2

My code give 3 output instead of 5 and accepted. My submission

How to solve D?

How to solve B?

E is similar to this problem.

Can You explain me how to solve in O(n)? Thanks in advance.

Yeah,I have rating above 1600.I am still specialist!!!

using dp mean using LIS or something else?

same to you...