Common Boardi havenot come here for a long time and the problem set is still the same, those admins are too lazy !!!!!!!!! Well, you're being too cruel =) You know,... (+) this is not only because of the admins. Look at acm.uva.es - very many recent contests they have had where organized by some other universities, not by Valladolid. In Russia universities started having their contests at their own sites (for example, olmp.chat.ru) instead of sending their problems to timus. You personally could send some problems from your last NOI to timus, but you didn't, did you? Anyway, I can't but agree with you that admins are now not that active as before =) I suppose we all could be helpful to each other not only by posting ideas or finding bugs or tests for some solutios on the webboard, but by finding new problems elsewhere and bringing them here, even if they might be quite well-known. We could start right now, for example, discussing this problem (I was aksed about it by my chinese friend, Eddie He): given a set of points (xi,yi) find a circle with less possible area covering each of these points. I heard from my teacher, M.Medvedev, about Voronov diagrams, but I don't know exactly what they are and whether it's nessesary to use them here - it would be interesting to know the solution, or at least, idea. Of course, the solution should be O(n^2 log n) or less- it's quite easy to find one with complexity O(n^3) :) I suppose it can be n log n - some kind of smart sorting... If we find the solution we can also discuss data test and then perform a new problem to the problemset. I suggest everybody to post here any problems they find at any books, magazines or contests (except online contests at other sites, of course) - we could certainly increase the number of problems quite quickly! Good luck to everybody. Re: Well, you're being too cruel =) You know,... (+) Well, actually I've sent some probs to admin, but I haven't got any response from him. I think he is busy with his university works ! > this is not only because of the admins. > Look at acm.uva.es - very many recent contests they have had where > organized by some other universities, not by Valladolid. In Russia > universities started having their contests at their own sites (for > example, olmp.chat.ru) instead of sending their problems to timus. > You personally could send some problems from your last NOI to timus, > but you didn't, did you? > > Anyway, I can't but agree with you that admins are now not that > active as before =) > > I suppose we all could be helpful to each other not only by posting > ideas or finding bugs or tests for some solutios on the webboard, but > by finding new problems elsewhere and bringing them here, even if > they might be quite well-known. > > We could start right now, for example, discussing this problem (I was > aksed about it by my chinese friend, Eddie He): given a set of points > (xi,yi) find a circle with less possible area covering each of these > points. I heard from my teacher, M.Medvedev, about Voronov diagrams, > but I don't know exactly what they are and whether it's nessesary to > use them here - it would be interesting to know the solution, or at > least, idea. Of course, the solution should be O(n^2 log n) or less-
> it's quite easy to find one with complexity O(n^3) :) > I suppose it can be n log n - some kind of smart sorting... > > If we find the solution we can also discuss data test and then > perform a new problem to the problemset. > > I suggest everybody to post here any problems they find at any books, > magazines or contests (except online contests at other sites, of > course) - we could certainly increase the number of problems quite > quickly! > > Good luck to everybody. Re: Well, you're being too cruel =) You know,... (+) > Well, actually I've sent some probs to admin, but I haven't got any > response from him. I think he is busy with his university works ! Or maybe, he's too lazy !!! I agree with Quang Hiep! |