Search found 39 matches

by aminallam
Tue Mar 28, 2006 2:35 pm
Forum: Volume 110 (11000-11099)
Topic: 11016 - Square Counting
Replies: 19
Views: 7471

I need a good article about plane-sweeping, that will help me solve this problem.
by aminallam
Mon Mar 27, 2006 3:36 pm
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 18294

[quote]That's right. For each row, I first compute the hash of the first 1
by aminallam
Sun Mar 26, 2006 3:24 pm
Forum: Volume 110 (11000-11099)
Topic: 11017 - A Greener World
Replies: 11
Views: 3844

Solved now. I did mention that I should use long long.
I wonder how someone like me has decided to participate in ACM contests. :cry:
by aminallam
Sat Mar 25, 2006 9:10 pm
Forum: Volume 110 (11000-11099)
Topic: 11017 - A Greener World
Replies: 11
Views: 3844

Thanks, now I got the trick, and my output for sample input is correct, but I get WA. I do not use any floating point computations except in computing the area, and this is the part I suspect: double reqarea = area2*d*d*sin(theta*pi/180.0)/2.0; cout << nump << " " << setiosflags(ios::fixed) << setpr...
by aminallam
Sat Mar 25, 2006 6:13 pm
Forum: Volume 110 (11000-11099)
Topic: 11017 - A Greener World
Replies: 11
Views: 3844

Thank you very much for your co-operation.
by aminallam
Fri Mar 24, 2006 9:25 pm
Forum: Volume 110 (11000-11099)
Topic: 11010 - Tic-Tac-Tough
Replies: 20
Views: 7275

1) Give rank (0,1, or 2) for each game. 2) Sort the games according to rank (most important first). 3) Traverse the sorted list in order, giving one game for Johnny, and next game for Mary, etc, until finished. (Note that if the game has rank=i with respect to Johnny, it will have the also rank=i wi...
by aminallam
Fri Mar 24, 2006 7:17 pm
Forum: Volume 110 (11000-11099)
Topic: 11014 - Make a Crystal
Replies: 16
Views: 6975

[Garbage Deleted]
by aminallam
Fri Mar 24, 2006 5:25 pm
Forum: Volume 110 (11000-11099)
Topic: 11006 - Wheel Good
Replies: 12
Views: 5355

Thank you very much Mr. Misof. It is nice to see you here. Thanks Mr. tobby.
by aminallam
Fri Mar 24, 2006 5:17 pm
Forum: Volume 110 (11000-11099)
Topic: 11017 - A Greener World
Replies: 11
Views: 3844

I have failed to compute # of green + red points using pick theorem. I have multiplied all xs, ys by 2, then divide result by 2, but this gives only approximation. I need a hint please!
by aminallam
Fri Mar 24, 2006 11:13 am
Forum: Volume 110 (11000-11099)
Topic: 11006 - Wheel Good
Replies: 12
Views: 5355

Can you give me a hint or small input/output for this problem?
by aminallam
Fri Mar 24, 2006 11:07 am
Forum: Volume 110 (11000-11099)
Topic: 11010 - Tic-Tac-Tough
Replies: 20
Views: 7275

Thank you very much. I have applied your scoring function and got AC. It was only mis-interpretation, when I said "start playing" I meant that after each one choses his games, it does not matter who will play first (because he is now restricted to his chosen games only). Thank you. I noticed that ou...
by aminallam
Fri Mar 24, 2006 12:06 am
Forum: Volume 110 (11000-11099)
Topic: 11010 - Tic-Tac-Tough
Replies: 20
Views: 7275

Mr. arsalan_mousavian, Please explain the bug you have overcomed: i forgot to switch the player that starts the board when the final state is draw I assume that Johnny will choose the first board every time, then Mary chooses .. etc. I do not see anything in the problem indicating otherwise. Also, I...
by aminallam
Thu Mar 23, 2006 6:14 pm
Forum: Volume 110 (11000-11099)
Topic: 11006 - Wheel Good
Replies: 12
Views: 5355

Please help me to solve this problem. I have made wrong algorithms. What should I do to solve it?
by aminallam
Thu Mar 23, 2006 4:54 pm
Forum: Volume 110 (11000-11099)
Topic: 11014 - Make a Crystal
Replies: 16
Views: 6975

Mr. Kalinov. Can you describe how to make this effitiently?
(I am sorry for annoyance, but I am not very good at these tricks of discrete math)
by aminallam
Wed Mar 22, 2006 10:35 pm
Forum: Volume 110 (11000-11099)
Topic: 11014 - Make a Crystal
Replies: 16
Views: 6975

Thank you very much Mr. Cho and Mr. Kalinov for your explanations.

Go to advanced search