Search found 60 matches

by Miguel Angel
Wed Mar 03, 2004 8:30 pm
Forum: Off topic (General chit-chat)
Topic: Someone living in Berlin
Replies: 0
Views: 1401

Someone living in Berlin

I'll be traveling to Berlin on March, one week before ICPC. If someone lives there, pls PM :).
by Miguel Angel
Sun Feb 15, 2004 8:27 pm
Forum: Other words
Topic: World Finals Warmup 1 will run for 18 hours.
Replies: 10
Views: 3104

Can you..

Can you do a parallel contest, such in North and Central America can't be so early, the time the contest starts here is 2,3,4 or 5 am. I don't know if Asia have a similar problem.

Thanks :)
by Miguel Angel
Wed Jan 28, 2004 7:22 am
Forum: Volume 106 (10600-10699)
Topic: 10615 - Rooks
Replies: 12
Views: 4856

Yeap, correct mine gives 81..some suggestion?
by Miguel Angel
Wed Jan 28, 2004 12:51 am
Forum: Volume 106 (10600-10699)
Topic: 10615 - Rooks
Replies: 12
Views: 4856

10615 - Rooks

I do the following..
Take the trasversal with max number of * and took it away, until no rooks are found...why is this wrong?
by Miguel Angel
Mon Jan 26, 2004 7:25 pm
Forum: Algorithms
Topic: 2-SAT
Replies: 2
Views: 1619

2-SAT

I have done 2-SAT algorithm, but seems incorrect someone can help me. I'm using not the aproach of making a graph because of the size of vars. My algo is as following procedure 2SAT() { For var = 1 to total of variables if var found in Clauses then val(var) = true val(var') = false if not contradict...
by Miguel Angel
Fri Jan 16, 2004 6:47 pm
Forum: Algorithms
Topic: How to calculate the distance between 2 segments
Replies: 7
Views: 1694

It ouputs 995.001, I think it's correct.
by Miguel Angel
Thu Jan 15, 2004 6:56 pm
Forum: Algorithms
Topic: How to calculate the distance between 2 segments
Replies: 7
Views: 1694

It returns 5, I don't see way of 2?.
by Miguel Angel
Thu Jan 15, 2004 8:05 am
Forum: Algorithms
Topic: How to calculate the distance between 2 segments
Replies: 7
Views: 1694

How to calculate the distance between 2 segments

Hi! How to calculate the distance between 2 segments?, I follow the following approach: [cpp] double minDist(Line l1, Line l2) { if (intersect(l1,l2) && interPoint(l1,l2)) return 0.0; double a, b, c, d; a = minDist(l1, l2.i); b = minDist(l1, l2.j); c = minDist(l2, l1.i); d = minDist(l2, l1.j...
by Miguel Angel
Thu Jan 08, 2004 7:12 am
Forum: C++
Topic: End of Line in C/C++
Replies: 3
Views: 2797

An easy way

[cpp]
while (cin.peek()!='\n')
[/cpp]
by Miguel Angel
Fri Nov 21, 2003 8:41 am
Forum: Off topic (General chit-chat)
Topic: Participating in the ICPC regionals?
Replies: 22
Views: 8142

Our team passed to the world finals :P

No hard problems, but very large problems :P. We go to the World Finals :) for Mexico and Central America regional.
by Miguel Angel
Sun Aug 31, 2003 1:27 am
Forum: Volume 103 (10300-10399)
Topic: 10314 - Three Pigs
Replies: 20
Views: 10383

Could you PM a hard test case, i think i can give you the correct answer ;)
by Miguel Angel
Sun Aug 31, 2003 1:21 am
Forum: Volume 103 (10300-10399)
Topic: 10314 - Three Pigs
Replies: 20
Views: 10383

Of course can't solve that :roll:
by Miguel Angel
Sat Aug 30, 2003 6:38 pm
Forum: Volume 103 (10300-10399)
Topic: 10314 - Three Pigs
Replies: 20
Views: 10383

Yeap

My program solves all test cases you give here in short time. I don't know what's wrong.
by Miguel Angel
Fri Aug 29, 2003 9:04 pm
Forum: Volume 103 (10300-10399)
Topic: 10314 - Three Pigs
Replies: 20
Views: 10383

What's wrong??

Can anyone help me with my code, I don't know what is wrong, It gets WA at 0.04 s. It uses B&B, so it's impossible to fail, maybe to get TL, but WA. Main procedure here: [java] int dfs(int r, int c) { if (r<0 || r==n || c<0 || c==n) return 0; if (used[r][c]) return 0; if (map[r][c]==TRAP) return...
by Miguel Angel
Mon Aug 25, 2003 8:18 pm
Forum: Algorithms
Topic: Careers in algorithms?
Replies: 11
Views: 4501

It helps you..

I think it helps you: * To develop creative solutions * To apply knoweldge * To work under pressure * To work in team (ACM contest) * To be efficient and efective Which in some cases it's enough for some companies to apply for a good job :). Of course you won't live only from the IOI and ACM knoweld...

Go to advanced search