## Search found 49 matches

Sat Jan 05, 2008 3:16 am
Forum: Volume 113 (11300-11399)
Topic: 11318 - Marble Game
Replies: 10
Views: 3404
Hello!, can anyone give me the correct output for this input: 12 4 10 2 3 2 4 4 5 32 100 4 0 2 0 3 4 0 2 0 4 5 77 78 100 101 99 5 10 11 12 13 23 6 0 2 0 0 4 0 6 12 13 412 43 0 1 7 0 1 0 1 0 1 2 20 100 10 20 30 40 50 60 70 80 90 100 10 20 30 40 50 60 70 80 90 30 234 42 22 22 10 2 2 2 2 2 44 44 100 12...
Thu Jan 03, 2008 2:55 am
Forum: Volume 113 (11300-11399)
Topic: 11312 - Flipping Frustration
Replies: 4
Views: 2084
"The hardest part of this problem is how to fit the tricky boundary. " I see, i have more than 20 WA.... and i still cant realize an efficient way to know if my numbers will not exceed the number of pages of the book, i mean, i have the minimum x and y ( the minimum sum ) , such that doing x left f...
Sun Dec 30, 2007 8:17 pm
Forum: Volume 113 (11300-11399)
Topic: 11372 - Arranging a Contest
Replies: 13
Views: 4593
I can tell you my approach that is similar. You will never use more than 2 problems having the same difficulty and category ( this is the important step ), because you will never need 2 problems having the same difficulty as the problem statement says. You have 3 difficulty levels, and 4 category's ...
Sun Dec 30, 2007 4:41 am
Forum: Volume 113 (11300-11399)
Topic: 11371 - Number Theory for Newbies
Replies: 65
Views: 22750
"...and the 9999999991 is greater than 2^64!" == FALSE
Fri Dec 28, 2007 9:12 pm
Forum: Volume 113 (11300-11399)
Topic: 11363 - Cuckoo Hashing
Replies: 2
Views: 1268
uau ... i see thanks! Eric.
Thu Dec 27, 2007 4:12 pm
Forum: Volume 113 (11300-11399)
Topic: 11363 - Cuckoo Hashing
Replies: 2
Views: 1268

### 11363 - Cuckoo Hashing

Im not sure why, but this problem makes me remember this one -> http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php?p=3644 The only thing i have is that if i construct a graph with the used numbers in each hash table and at any moment i get a cycle i can say that re-hashing is needed, bu...
Mon Dec 24, 2007 3:56 am
Forum: Volume 113 (11300-11399)
Topic: 11315 - Attacker
Replies: 10
Views: 3230
Hello, i have seen there is a called Bentley's algorithm to get the union of n rectangles in O ( n log n ) ... but i havent found any tutorial or source to read about it.... could anyone give me some link? or some hints, if the idea is not so difficult?, thanks. Eric.
Mon Nov 26, 2007 6:59 pm
Forum: Volume 113 (11300-11399)
Topic: 11361 - Investigating Div-Sum Property
Replies: 16
Views: 6887
I cant get the "kind of DP" idea.... can anyone give me some hints?? thanks. eric
Sat Nov 24, 2007 8:50 pm
Forum: Volume 113 (11300-11399)
Topic: 11353 - A Different Kind of Sorting
Replies: 17
Views: 7555
I see.. i suppose my problem is that i look for the quantity of primes ( in the descomposition ) after running sieve... now i realize everything can be done "on the fly" of sieve.. thanks.
Sat Nov 24, 2007 5:23 pm
Forum: Volume 113 (11300-11399)
Topic: 11353 - A Different Kind of Sorting
Replies: 17
Views: 7555
Well, i got a TLE coding the same, so i tought a way to obtain first all the primes ( using sieve ), and after that, knowing all the primes between 2 and 2*10^6 in an array, looking for the quantity of primes in each descomposition. Anyway, my code runs in 4.5 sec... and if my memory dont fail, the ...
Thu Aug 09, 2007 7:43 pm
Forum: Volume 112 (11200-11299)
Topic: 11257 - New Marketing Plan
Replies: 23
Views: 8273
Hello, i would like to implement the sclo approach... but i cant realise a nice algorithm to get the angle bisectors... would anyone please give me a pseudo code, hint or some page to read about??... do anyone knows a good book of computational geometry?? thanks. eric.
Sun Aug 05, 2007 12:22 am
Forum: Volume 112 (11200-11299)
Topic: 11257 - New Marketing Plan
Replies: 23
Views: 8273
Hello... im thincking a O( n^3*log) solution ... but of course this complexity wouldnt be enough for mf's posted problem.. so i wanted to ask you mf if you could tell us a little more about your idea... Another question... is there any algorithm that can tell as if a point is inside a convex polygon...
Fri Aug 03, 2007 2:47 pm
Forum: Volume 112 (11200-11299)
Topic: 11245 - Anti-Arithmetic-Sequence
Replies: 18
Views: 5906
Thanks... no i did not find the solution por non primes... jeje i solved the problem but just finding the pattern (for primes... ).. and now i see you are right.. its number theory ... thank you. eric.
Thu Aug 02, 2007 11:46 pm
Forum: Volume 112 (11200-11299)
Topic: 11245 - Anti-Arithmetic-Sequence
Replies: 18
Views: 5906
Hello... i have found a kind of pattern and solved the problem... but i would like to know why my solution function... can anyone give some hints to think about?
I dont give the pattern but i suppose the majority have done it in this way... Thanks ! eric.
Wed Aug 01, 2007 1:53 am
Forum: Volume 111 (11100-11199)
Topic: 11168 - Airport
Replies: 19
Views: 8997
hello, i have been trying to solve this problem.. but i got many WA's because of overflowing... after i solved that problem... and testing rio's cases of this thread i thought i would have no problems.. but now im getting time limit exceeded... is it for my O(n^2) convex hull algorithm?.. in my comp...