Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// Informatik Extra Aufgabe // Prog: SedlmairStefan.cpp // Autor: Stefan Sedlmair #include #include void f (const unsigned int i) { if (i == 0) ifm::forward(); // F else { for(int e=i ; e > 0 ; --e) { ifm::right(45); ifm::forward(100); ifm::left(90); ifm::forward(10); ifm::right(45); } f(i-1); } } void d (const unsigned int i) { if (i==0) ifm::left(20); else { ifm::right(60); d(i-1); ifm::forward(100); f(1); ifm::forward(100); } } void w (const unsigned int i) { if (i == 0) ifm::restore(); else { ifm::save(); ifm::forward(500); f(i); ifm::left(20); d(i); ifm::right(60); } } int main () { std::cout << "Please enter number of iterations:\n"; unsigned int n; std::cin >> n; for (int e=n ; e > 0; --e) { f(e); ifm::left(20); d(e); ifm::right(60); w(e); } return 0; }