11426 - GCD - Extreme (II)

All about problems in Volume CXIV. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

11426 - GCD - Extreme (II)

Postby paradise_737 » Sat Sep 05, 2009 4:41 am

hi guys i was wondering how to make an efficient algorithm that reduces the run time of this problem .

mine got 5.96 secs whichs sucks , the top on this problem got 0.50 ( which is wooow ) i wish he can explain how he did it .
paradise_737
New poster
 
Posts: 5
Joined: Sun Aug 23, 2009 7:26 am

Return to Volume CXIV

Who is online

Users browsing this forum: No registered users and 2 guests