Forum: The Classroom
Topic: solve this
started by: kai

Posted by kai on Jan. 08 2001,02:52
< http://www.usd.edu/csci/acm/contest/progcon00/problems.html#G >
it's the pipe problem. we didn't get it and stuff.

------------------
What if there were no hypothetical questions?


Posted by Sithiee on Jan. 08 2001,08:40
they gave you the answer. look at the geometry picture. you just need to figure out the length of the bottom leg to know how far the smaller pipe is away horizontally. the horizontal length is ((R+r)^2 - (R-R)^2)^(1/2) and then you know the placing and should be able to figure it all out from there. height = biggest pipe, length = space between adjacent pipes + radiuses of two end pipes. easy as fuck. or maybe im not reading it right...
Posted by askheaves on Jan. 08 2001,13:49
You are correct, Sithee. I ran through the crap last night and the only tough part is recalling your trig enough to determine the horizontal leg as determined by the radii of adjacent circles, which I believe you have correct (little Pythagrian theorum).

So, you have your confirmation. After that, it's a matter of programming. That I would leave up to you.


Posted by aventari on Jan. 08 2001,17:26
Were you in the ACM contest too? A few friends and I were on the CSU San Marcos team in the regionals last November.
That was great fun!

6 hours to program solutions to 6 tough ass computer science problems. heh you're good if you can finish one of them :]

------------------
aventari
"Maintainer's Motto: If we can't fix it, it ain't broke. "


Posted by Sithiee on Jan. 10 2001,01:09
i was just looking at those again. these are supposed to be hard? im sorry, not to be full of myself or anything, but that is basic level shit. it doesnt test your ability to program solutions, but rather to just come up with them. a real problem would have been something like "make a dynamically stored list, that stores integers up to 30 places long" or somethin....thats easy shit right there though...
Powered by Ikonboard 3.1.4 © 2006 Ikonboard