Search found 8 matches
- Sun Oct 30, 2005 4:32 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10951 - Polynomial GCD
- Replies: 7
- Views: 3974
Thanks for your help, but it seems to me, that answer for case 6: 4 1 2 3 3 1 5 1 1 4 3 4 2 will be 3 1 1 2 1, but not 0 1. I think 3 1 1 2 1 divide both 4 1 2 3 3 1 and 5 1 1 4 3 4 2 with no remainder. Plz explain. PS. I've just changed module of ring 1500 for prime number(53) for correctness of in...
- Sat Oct 29, 2005 8:33 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10951 - Polynomial GCD
- Replies: 7
- Views: 3974
- Sat Oct 29, 2005 8:25 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10951 - Polynomial GCD
- Replies: 7
- Views: 3974
10951 - Polynomial GCD
Someone who have gotten AC give me plz some test cases
- Tue Oct 18, 2005 12:07 am
- Forum: Volume 109 (10900-10999)
- Topic: 10936 - Land surveyor's job
- Replies: 10
- Views: 6535
- Wed Jul 06, 2005 12:47 pm
- Forum: Volume 3 (300-399)
- Topic: 307 - Sticks
- Replies: 56
- Views: 19062
- Tue Jul 05, 2005 8:10 am
- Forum: Volume 106 (10600-10699)
- Topic: 10605 - Mines For Diamonds
- Replies: 22
- Views: 7930
10605 TLE
I always get TLE on this problem.
Using brute forse on each step I try go from one diamante to another or go to exit(when i go to exit i find another unused diamonde and use recursion again).
How can i prune it?
Give me some hints.Plz.
Using brute forse on each step I try go from one diamante to another or go to exit(when i go to exit i find another unused diamonde and use recursion again).
How can i prune it?
Give me some hints.Plz.
- Mon Mar 28, 2005 3:58 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10492 - Optimal Mastermind Strategy
- Replies: 12
- Views: 3969
10492 Some Tests and Answers
Hello! Can anyone give me several tests for 10492 with answers? plz.
- Mon Sep 13, 2004 5:44 pm
- Forum: C++
- Topic: C++ compiler ?
- Replies: 2
- Views: 2013
C++ compiler ?
What kind of C++ compiler(version) is using by Online-Judge?
And where can i download it?
Plz help
And where can i download it?
Plz help
