Problem I. 169. (November 2007)
I. 169. We are given N thin rods. We fix one end of the first rod and let it rotate around this hub with angular velocity of 1. One end of the next rod is attached to the free end of the previous rod, and is rotating with relative angular velocity of i (compared to the previous rod). This way we get a chain of connected rods. At the beginning, all rods are pointing to the same direction.
Your program should draw the path of the free end of the last rod. The input for your program should be the number of rods N (1N10) and 2N nonnegative integers: the length Li (1Li100) and relative angular velocity i of the ith rod.
See the examples.
The source code of your program (i169.pas, i169.cpp, ...) together with a short documentation (i169.txt, i169.pdf, ...) should be submitted, also containing a short description of your solution and the developer environment to use.
Deadline expired on 17 December 2007.
Sorry, the solution is available only in Hungarian. Google translation
A feladat mintamegoldásaként egy Pascal programot közlünk: