Search found 104 matches

by BiK
Sat Nov 26, 2005 7:32 am
Forum: Volume 108 (10800-10899)
Topic: 10869 - Brownie Points II
Replies: 3
Views: 2198

I don't see how Stan can achieve a 7 for the sample test. For every vertical line he chooses, Olie can push him below 7 ?!
by BiK
Fri Oct 21, 2005 8:27 am
Forum: Volume 105 (10500-10599)
Topic: 10561 - Treblecross
Replies: 26
Views: 11138

Marian or everybody else,

Do you know some good books about Grundy-Sprague numbers?

Thanks
by BiK
Wed Jul 06, 2005 3:31 pm
Forum: C++
Topic: checking include files
Replies: 6
Views: 2820

Exatcly including all headers that define functions used in my source code is the point. Sometimes I forget the include files, compile the program with g++, the compiler does not complain because the needed include files are included from somewhere else and then I get a compile error from the judge....
by BiK
Wed Jul 06, 2005 2:47 pm
Forum: Volume 108 (10800-10899)
Topic: 10868 - Bungee Jumping
Replies: 13
Views: 4590

What conservation of energy do you mean and how do you use it to solve the problem? I have been thinking the following way: Bond will reach its downmost position when the force pulling him up becomes equal to the force pulling him down: w*9.81 = k*dl Thus, we determine dl - how much the rope is expa...
by BiK
Wed Jul 06, 2005 2:35 pm
Forum: Volume 108 (10800-10899)
Topic: 10869 - Brownie Points II
Replies: 3
Views: 2198

10869 - Brownie Points II

The n^2 algorithm most probably won't do. Is there a n*log(n) algorithm for this problem?
by BiK
Fri Jun 24, 2005 12:06 am
Forum: C++
Topic: checking include files
Replies: 6
Views: 2820

checking include files

I use g++ to compile my programs. With g++ it's not necessary to include all the needed header files from the standard library. This often causes compile errors. What option should I compile my programs with in order to enforce checking that all the necessary header files are included?

Thanks
by BiK
Sat May 28, 2005 4:09 pm
Forum: Other words
Topic: To the top finishers in the III Local Contest in Murcia
Replies: 10
Views: 4057

Thank you guys
by BiK
Sat May 28, 2005 4:08 pm
Forum: Volume 108 (10800-10899)
Topic: 10856 - Recover Factorial
Replies: 17
Views: 13578

10856 - Recover Factorial

How is this problem solved? It appears everybody but me solved it :(
by BiK
Tue May 24, 2005 1:27 pm
Forum: Other words
Topic: To the top finishers in the III Local Contest in Murcia
Replies: 10
Views: 4057

Thanks guys, I am still curious for some more info. With regard to speed, I wonder whether I come up with just too long solutions in order to write and debug them in less than half an hour. For example, for the last contest the number of lines for my programs (C++) are as follows: A - 59 lines B - 1...
by BiK
Mon May 23, 2005 4:42 pm
Forum: Other words
Topic: To the top finishers in the III Local Contest in Murcia
Replies: 10
Views: 4057

To the top finishers in the III Local Contest in Murcia

Hi guys, I just wondered how you were able to solve all the problems so quickly. Did you use code that was written before or you solved the problems from scratch? Did you know the problems beforehand? The problems were not that difficult but still what you did was really admirable. The winner solved...
by BiK
Wed Nov 10, 2004 8:35 pm
Forum: Volume 107 (10700-10799)
Topic: 10762 - Treasure Castle
Replies: 12
Views: 8829

10762 - Treasure Castle

I like this problem but unfortunately don't know how to solve it. Could you explain the idea of the solution?
by BiK
Mon Nov 08, 2004 5:58 pm
Forum: Volume 3 (300-399)
Topic: 361 - Cops and Robbers
Replies: 50
Views: 14156

I am also getting constantly WA altough I read everything in the forum very carefully. I tested my convex hull algorithm also with several other problems but I get only one answer here - WA.
by BiK
Sun Nov 07, 2004 8:50 pm
Forum: Volume 6 (600-699)
Topic: 681 - Convex Hull Finding
Replies: 60
Views: 20223

2nibbler & 2eduard:

Don't use floating point arithmetic. You can do everything with integer arithmetic.
by BiK
Sat Oct 23, 2004 11:08 pm
Forum: Algorithms
Topic: Three algorithmic problems
Replies: 0
Views: 943

Three algorithmic problems

Hi guys, I have recently wondered about efficient algorithms concerning three algorithmic problems: 1. Given a directed graph G = (V, E) find the symmetric complement G = (V, E') such that if (u,v) is in E then (u,v) and (v,u) are in E'. For any two vertices u, v in V there can be at most one edge i...
by BiK
Sat Oct 23, 2004 3:20 pm
Forum: Volume 107 (10700-10799)
Topic: 10740 - Not the Best
Replies: 23
Views: 12959

Isn't there a reference for the kth shortest path after all?

Go to advanced search