Search found 251 matches

by serur
Sun Mar 26, 2006 8:42 pm
Forum: Volume 1 (100-199)
Topic: 195 - Anagram
Replies: 242
Views: 27780

I don't feel quite sure about that, but I remember hearing somewhere that that what you have done int your grouping funcction(namely, returned char *r- address of a temporary variable) is not good... though it may be not the case here, since OLE is caused by infinite loop... Hope this will be of som...
by serur
Sat Mar 25, 2006 1:52 pm
Forum: Volume 5 (500-599)
Topic: 598 - Bundling Newspapers
Replies: 25
Views: 9091

598

Hi fellows! I have a problem with handling input in "Bundling Newspapers- 598", namely: can't understand how to deal with the new-line character. Can someone explain to me completely the notion of a new-line character, as well as everything that one should know about them to solve problems, which st...
by serur
Sat Mar 25, 2006 12:04 am
Forum: Volume 1 (100-199)
Topic: 195 - Anagram
Replies: 242
Views: 27780

It seems to me you may mislay the possibility of input string being even longer than 100 characters, or if I am mistaken myself? Anyway, I got this one accepted a week ago and I used malloc- i..e. without any assumptions about the length, simple stupid backtracking and a trick about "alphabetical or...
by serur
Fri Mar 24, 2006 11:05 pm
Forum: Volume 2 (200-299)
Topic: 200 - Rare Order
Replies: 25
Views: 12905

to cyph1e:
I didn't scrutinize your code :D , but this problem should be easily solved using a queue,
think of it, I should fancy shouldn't be too difficult :)

Sau bol!
(Be healthy- from my native language :) )
by serur
Fri Mar 24, 2006 11:01 pm
Forum: Volume 2 (200-299)
Topic: 218 - Moth Eradication
Replies: 60
Views: 10989

218- Moth Eradication again...

Hi, fellows! I apologise for commencing a new discussion on "Moth Eradication" seeing that a great deal was said on it as it is, but I do hope that if supported by you it will be of considerable value for most of us. I've already read all that was written here ever since 2001, my code successfully p...
by serur
Sat Mar 18, 2006 2:07 am
Forum: Volume 5 (500-599)
Topic: 529 - Addition Chains
Replies: 32
Views: 4167

Ah...
by serur
Sat Mar 18, 2006 1:07 am
Forum: Volume 103 (10300-10399)
Topic: 10341 - Solve It
Replies: 64
Views: 35476

Thank You for your reply!
Exactly! It was just precision error and I didn't consider the case when all coefficients are zero :D
by serur
Mon Mar 13, 2006 9:43 pm
Forum: Volume 5 (500-599)
Topic: 529 - Addition Chains
Replies: 32
Views: 4167

529-addition chains

I know a great deal was said here about 529, where,in particular,IDA*(by the way, can anyone give me good URL about IDA*,IDS and the like?)was mentioned, and so on. I figured it out that m>=ln(n)(base 2) neccessarily, but this and all else that I derived from this appears to be insufficient!(the fac...
by serur
Thu Feb 23, 2006 11:58 pm
Forum: Volume 105 (10500-10599)
Topic: 10566 - Crossed Ladders
Replies: 39
Views: 11932

10566

hey guyis,
I solved Crossed Ladders as I thought duly:
kept dividing in two certain segments and so on- you know all about it.
But it passes sample I/O but I have still WA.
Someone help me,please
by serur
Thu Feb 23, 2006 11:48 pm
Forum: Volume 103 (10300-10399)
Topic: 10341 - Solve It
Replies: 64
Views: 35476

10341

on the one hand, hte solution is obvious: cos and exp are decreasing in [0.1], while sin and tan and t*t are increasing strictly, so there always one solution, provided that some certain equation holds. BUT THIS DOESNT WORK! it only passses sample inputs successfully, but I got WA still. Those smart...
by serur
Thu Feb 23, 2006 11:38 pm
Forum: Volume 103 (10300-10399)
Topic: 10341 - Solve It
Replies: 64
Views: 35476

10341(solve it)

Fellows,
what can be wrong with yhe standard "dividing-by-two" algorithm applied to the problem 10341? I still have WA, though this method applied to other similiar problems accepted.
Or rather would you mind sharing with me your source code for this problem if it got accepted?

Go to advanced search