Search found 88 matches
- Fri Oct 22, 2004 11:47 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10655 - Contemplation - Algebra
- Replies: 42
- Views: 11305
I am really ashamed that I didn't find this. I already solved similar problems, so this should have been easy for me I'm ashamed I didn't think about it in contest time when I knew that Xn = pXn-1 + qXn-2. i am ashamed too, but just the opposite reason you are. i could NEVER solve this problem if y...
- Thu Oct 21, 2004 9:34 pm
- Forum: Volume 8 (800-899)
- Topic: 850 - Crypt Kicker II
- Replies: 77
- Views: 38669
1 vtz ud xnm xugm itr pyy jttk gmv xt otgm xt xnm puk ti xnm fprxq xnm ceuob lrtzv ita hegfd tsmr xnm ypwq ktj frtjrpgguvj otvxmdxd prm iev prmvx xnmq awerwaerwrwa now is the time for all good men to come to the aid of the party the quick brown fox jumps over the lazy dog programming contests are f...
- Wed Oct 20, 2004 4:53 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10090 - Marbles
- Replies: 43
- Views: 23467
- Sun Oct 17, 2004 9:52 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10104 - Euclid Problem
- Replies: 29
- Views: 10891
- Sun Oct 17, 2004 8:34 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10006 - Carmichael Numbers
- Replies: 66
- Views: 22308
i precalcuate the prime but did not precalculate the charmical number . i check every time. it is Accepted but it takes large time 1.450 sec. when i got n , i check whether it is prime or not. next check from 2 to n-1 if i got any other answer than a^n mod n= a, i break the loop. to calculate a^n mo...
- Wed Oct 13, 2004 9:21 pm
- Forum: Volume 5 (500-599)
- Topic: 589 - Pushing Boxes
- Replies: 14
- Views: 5864
- Tue Oct 12, 2004 11:12 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10602 - Editor Nottoobad
- Replies: 19
- Views: 11747
- Mon Oct 11, 2004 11:51 pm
- Forum: Algorithms
- Topic: Geometric graphs and constrained MST
- Replies: 5
- Views: 1986
CDiMa, i am very very interested about your Algorithm. would you please explain it more clearly. i can't recover your hints :oops: i have hardly managed to Accpeted this code within timelimit. My Accepted code run more than 6sec :roll: i have no knowledge how the other people solved this prolbem in ...
- Mon Oct 11, 2004 11:34 am
- Forum: Volume 1 (100-199)
- Topic: 168 - Theseus and the Minotaur
- Replies: 64
- Views: 9057
- Mon Oct 11, 2004 11:29 am
- Forum: Volume 1 (100-199)
- Topic: 168 - Theseus and the Minotaur
- Replies: 64
- Views: 9057
- Mon Oct 11, 2004 2:01 am
- Forum: Volume 1 (100-199)
- Topic: 164 - String Computer
- Replies: 120
- Views: 13553
Stupid judge
It is very annoying about the behavior of the judge for this problem 164. i got many WA and after that i have to read the board to do The backtracking as C-D-I and got ACC. isn't it silly? i just change some if-else statement's order. and also C-D-I is ordered when i backtrack , it is not actually t...
- Sun Jun 06, 2004 6:54 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10498 - Happiness
- Replies: 18
- Views: 10029
- Fri May 21, 2004 6:35 am
- Forum: Volume 104 (10400-10499)
- Topic: 10453 - Make Palindrome
- Replies: 38
- Views: 16278
Noim, I was not sure if you had got accepted because of this sentence: Quote: first i have determined the lcs string for the input string and the reverse of input string---------> this is my quotation. This would give an LCS of abcd from abcdcbad, the lcs of abcdcbad and it's reverse string is NOT ...
- Wed May 19, 2004 7:22 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10453 - Make Palindrome
- Replies: 38
- Views: 16278
- Mon May 17, 2004 5:25 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10453 - Make Palindrome
- Replies: 38
- Views: 16278