Search found 60 matches

by Miguel Angel
Mon Feb 26, 2007 3:59 pm
Forum: Volume 111 (11100-11199)
Topic: 11184 - Joyful Ride
Replies: 11
Views: 7074

Well..I tried that problem during the contest..I guessed there was a solution when (n-4)%3 == 0, you can make the sample for 4, 7, 11 and you will find that the solution follows a pattern. Though I didn't get AC :p, so, perhaps I was missing something else?
by Miguel Angel
Thu Jan 11, 2007 7:54 pm
Forum: Volume 111 (11100-11199)
Topic: 11138 - Nuts and Bolts
Replies: 9
Views: 5367

???

I solved it with 1.6 secs, I used bipartite max flow...but how do you solve it with less than one second?? :-?
by Miguel Angel
Wed Apr 20, 2005 5:19 am
Forum: Volume 8 (800-899)
Topic: 802 - Lead or Gold
Replies: 20
Views: 10900

In fact

Yeap in fact wanted to say linear algebra but my mouth said another. I have already solved with Gauss Jordan, thanks :)
by Miguel Angel
Wed Feb 23, 2005 7:24 am
Forum: Volume 8 (800-899)
Topic: 802 - Lead or Gold
Replies: 20
Views: 10900

I don't think it will be linear programming, someone there to help me??:(
by Miguel Angel
Wed Feb 16, 2005 8:21 pm
Forum: Volume 8 (800-899)
Topic: 802 - Lead or Gold
Replies: 20
Views: 10900

802 - Lead or Gold

Can someone gimme a hint of how to solve it?, I simply have no clear idea about it:P
by Miguel Angel
Fri Oct 15, 2004 10:44 pm
Forum: Volume 107 (10700-10799)
Topic: 10732 - The Strange Research
Replies: 5
Views: 2674

Check out 0?

Well, the problem is quiet easy, though some tricky..I thought I have solved the problem too but then I realized I missed some case..You first check the combinations of signs and get the good ones..I missed one case a = 0, b = +.
by Miguel Angel
Sun Oct 10, 2004 3:23 am
Forum: Volume 107 (10700-10799)
Topic: 10739 - String to Palindrome
Replies: 11
Views: 6142

:)

DP solution in fact works very well for this problem, and you don't need so much memory as Eduard said :).
by Miguel Angel
Tue Sep 14, 2004 1:36 am
Forum: Algorithms
Topic: A number problem
Replies: 14
Views: 3528

But well, then you only need to store maximum 15 numbers(with B&B surely)..and yeap DP it's TOO weird to do!, DFS is the best solution!
by Miguel Angel
Fri Sep 10, 2004 10:55 pm
Forum: Algorithms
Topic: A number problem
Replies: 14
Views: 3528

:)

Yeap you are right!. 15625 in fact it's the biggest power of 5 that it's less than 20000, so for sure can extend till 6 zeros(for every 5), and then sort, so I should have realized about that..But then if the number of 19940, doesn't take that longest sequence, why to take it?..well well until you r...
by Miguel Angel
Fri Sep 10, 2004 8:39 pm
Forum: Algorithms
Topic: A number problem
Replies: 14
Views: 3528

I forgot

Till 40,000; but calculating till 20,000..There's no sense to make a number till a very big one of 9 digits, we may need at least 14 M operations to make 20,000 a number bigger than 9 digits, surely we can make 20,000 into 1, in 14 D operations;). The only "valuable" way it can decrease monotonicall...
by Miguel Angel
Fri Sep 10, 2004 7:57 pm
Forum: Algorithms
Topic: A number problem
Replies: 14
Views: 3528

Easy

Well, I think you elevated the complexity of this problem :). It's just DP, you need an array of [20,000][4], where [Num][Op] indicates the minimum number of operations as Op as first operation(ie. DMMS, the D) and number Num. You can see that with this model you can manage minimum length and lexico...
by Miguel Angel
Thu Jun 03, 2004 11:04 pm
Forum: Volume 106 (10600-10699)
Topic: 10613 - Mushroom Misery
Replies: 14
Views: 6201

Yeap, well if you think it as a big square first, is hard for sure..But you may agree the following, in the big square you can fit two rectangles of with w and height h, making a cross and covering the whole circle. If don't believe me, let's suppose it exist, if exist those 2 rectangles cross in 4 ...
by Miguel Angel
Sun May 23, 2004 11:45 pm
Forum: Volume 106 (10600-10699)
Topic: 10613 - Mushroom Misery
Replies: 14
Views: 6201

I think it's possible to make the circles just as 2 rectangles (like making a cross) and then solve with NlogN.
by Miguel Angel
Sat May 08, 2004 8:53 pm
Forum: Algorithms
Topic: About LCS in O(nlogn)
Replies: 4
Views: 3732

Egal..

Which is proportional to NlogN, in such case will be smth like O(M log N), given the two length of the strings. Anyway, that's not the case, there's a way to do it, based on balanced trees (on arrays) where you can perform operations in log N speed. The first word will be a set of finite characters ...
by Miguel Angel
Thu May 06, 2004 9:31 pm
Forum: Algorithms
Topic: 2-SAT
Replies: 2
Views: 1501

Well..

Already I don't..
the constraints can be seen as:

(a11 || a12) && ... && (an1 || an2)

But I already know how to solve it, though I haven't programmed :)

Go to advanced search