Обсуждение @ 1375. Нонконформизм @ Timus Online Judge

Online Judge

Задачи

Авторы

Соревнования

Обсуждение задачи 1375. Нонконформизм

Is there a faster solution than O(N)?(-)

Послано SPIRiT 13 авг 2007 19:32

Re: Is there a faster solution than O(N)?(-)

Послано Denis Koshman 5 авг 2008 01:40

Probably yes because O(N) solution doesn't use primality of 'p'.

Re: Is there a faster solution than O(N)?(-)

Послано Cat36 31 окт 2008 20:56

Yes.
If you can sols the equation x*x = c (mod p) faster then O(P)

Re: Is there a faster solution than O(N)?(-)

Послано Cat36 31 окт 2008 21:01

Denis Koshman писал(a) 5 августа 2008 01:40

Probably yes because O(N) solution doesn't use primality of 'p'.

My O(N) solution uses primality of 'p'.