Общий форум @ Timus Online Judge

Online Judge

Задачи

Авторы

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

Общий форум

to Li Rui

Послано try try try 9 окт 2001 21:00

You can use complexity O(2^16) for Problem 1122

I use xor and get faster.but,how O(2^16),this is the number if states,at least O(E) ,sure?

Послано Chinese Li Rui 10 окт 2001 05:58

Thank you first.

Послано Chinese Li Rui 10 окт 2001 05:59

> You can use complexity O(2^16) for Problem 1122

Re: I use xor and get faster.but,how O(2^16),this is the number if states,at least O(E) ,sure?

Послано try try try 11 окт 2001 21:27

> You can search each one turn or not.
Remember : if one turn 2 times, it's the same to
turn 0 times .