Search found 26 matches

by luishhh
Sat Jan 12, 2008 8:55 pm
Forum: Volume 113 (11300-11399)
Topic: 11394 - Digit Blocks
Replies: 18
Views: 9051

The answer for 55 is 2, the only two possibilities are 5 and 55
by luishhh
Tue Nov 13, 2007 11:06 pm
Forum: Volume 113 (11300-11399)
Topic: 11341 - Term Strategy
Replies: 20
Views: 7821

Is there any tricky i/o for this problem?
I use a very simple dp which gives WA

Edit: got AC, precision issue printing the output
by luishhh
Tue Nov 13, 2007 9:52 pm
Forum: Volume 113 (11300-11399)
Topic: 11349 - Symmetric Matrix
Replies: 43
Views: 19278

use long longs
by luishhh
Mon Oct 01, 2007 9:53 pm
Forum: Volume 112 (11200-11299)
Topic: 11298 - Dissecting a Hexagon
Replies: 25
Views: 8405

In my opinion, your test case is completely insane. Problemsetters should care more about the problem statement than about making stupid input for the judge. I don't think you can be proud of making some people spent their time to get AC in this problem.
by luishhh
Sun Sep 30, 2007 11:52 pm
Forum: Volume 112 (11200-11299)
Topic: 11298 - Dissecting a Hexagon
Replies: 25
Views: 8405

1) n Parallelogram, each with all sides equal.

2) n Parallelograms with equal area.
I got AC using the second hypothesis. So, if both are equivalent in this problem, please tell me how to dissect a hexagon in 6 rhombus with all equal sides, I don't find the solution.
by luishhh
Sun Sep 30, 2007 11:25 pm
Forum: Volume 112 (11200-11299)
Topic: 11298 - Dissecting a Hexagon
Replies: 25
Views: 8405

Are they parellelograms or rhombus? I honestly find your post confusing

EDIT: I got AC considering Parellelograms not neccesarily Rhombus, so forget the word Rhombus! Moreover there is a test case with n <= 0, could anybody explain me why there are such stupid cases?
by luishhh
Sat Sep 29, 2007 12:51 pm
Forum: Volume 111 (11100-11199)
Topic: 11195 - Another n-Queen Problem
Replies: 24
Views: 15693

Does anybody know a trick to compute n from a mask of the form (1<<n)? I suppose it will speedup my program because now I have a loop to compute it
by luishhh
Sun Apr 15, 2007 11:49 am
Forum: Volume 111 (11100-11199)
Topic: 11198 - Dancing Digits
Replies: 16
Views: 8107

Hi! Can anybody tell me what is the expected execution time for an AC solution in the cases kindly given above? (about half of the total time for the complete input in the judge?)
by luishhh
Sun Jan 07, 2007 11:21 pm
Forum: Volume 1 (100-199)
Topic: 105 - The Skyline Problem
Replies: 160
Views: 27831

Print "\n" and you'll get AC
by luishhh
Thu Oct 26, 2006 1:23 pm
Forum: Volume 111 (11100-11199)
Topic: 11137 - Ingenuous Cubrency
Replies: 16
Views: 9168

no, in fact there are only 5 results ok
does your code output the right answer for the sample input?
by luishhh
Tue Oct 24, 2006 5:14 pm
Forum: Volume 111 (11100-11199)
Topic: 11139 - Counting Quadrilaterals
Replies: 13
Views: 4782

Wow, great!, your solutions are more than enough for me, they completely satisfy my curiosity. In fact I remember thinking about using Pick in the contest for a second, as everybody usually does when faces a problem with lattice and figures, but I didn't know how to apply it (it was before I needed ...
by luishhh
Tue Oct 24, 2006 4:30 pm
Forum: Volume 111 (11100-11199)
Topic: 11139 - Counting Quadrilaterals
Replies: 13
Views: 4782

11139 Counting Quadrilaterals

Oh! This is a nice example of an easy-to-formulate and hard-to-solve problem. I tried it in the online contest and I wasted more than 2 hours, but yesterday I managed to finish it. Obviously, (see the ranklist) I used precomputation, I wrote a brute-force solution O(n^7) (can be O(n^6) if implemente...
by luishhh
Tue Oct 17, 2006 6:31 pm
Forum: Volume 111 (11100-11199)
Topic: 11119 - Chemical Attraction
Replies: 19
Views: 8512

11119 - Chemical Attraction

Hi all! I saw this problem was one of the most difficult in the last contest... but actually I do not know why, because I've just sent my code for problem 11121 to the problem 11119 by mistake, and it was AC!! It seems there is not only attraction between cations and anions but between any output an...
by luishhh
Mon Oct 16, 2006 8:09 pm
Forum: Volume 111 (11100-11199)
Topic: 11126 - Relaxed Golf
Replies: 4
Views: 1903

11126 - Relaxed Golf

Few people have solved this problem. I am using only backtracking with memoization, could it be enough? I keep getting WA, time: 3.3 seconds. This time would be the best in the ranklist, that's why I hesitate if my implementation has a bug or my entire approach to the problem is non-sense.
by luishhh
Mon Oct 02, 2006 5:27 pm
Forum: Volume 110 (11000-11099)
Topic: 11037 - Point of View in Flatland
Replies: 15
Views: 7848

Thank you very much for the link little joey,
In fact I had only a silly mistake, so the algorithm proved to be completely correct, it is almost the same as in the second official solution

Go to advanced search