## Search found 3 matches

Thu Oct 02, 2003 7:56 am
Forum: Volume 105 (10500-10599)
Replies: 35
Views: 15966

### Solving that

Hi, I've just solved it. I was reading messages posted here and I aggree that problem should be better explained. I'm sure about that because it's an easy problem and there was too few accepted answers. I think it could be better exemplifieded. My solution: The input is '0.dddddd...', let L be the l...
Mon Oct 14, 2002 2:53 am
Forum: Volume 2 (200-299)
Topic: 221 - Urban Elevations
Replies: 10
Views: 2515

### Re: P221

Hi, again,

I discovered... the problem permits 0 width builds... :|

[]'s
Gatis
Thu May 30, 2002 7:34 pm
Forum: Volume 2 (200-299)
Topic: 221 - Urban Elevations
Replies: 10
Views: 2515

### P221

Hi, all, I've been trying to solve the 221 problem. I Think I can solve it use a simple algorithm, as follow: [cpp] visitBuild(b, xMin, xMax, height) { if (xMin >= xMain) return; if (b.front intersects [xMin; xMax]) && (b.height > heigth) { b.visited = true;[/code] //There are 3 cases. // here only ...