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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

//Use n=5 #include #include #include //POST: funktion für y void y(unsigned int n); //POST: funktion für x void x(const unsigned int n) { if (n==0) ifm::right(90); else { for(int i=0; i<12; ++i) { y(n-1); ifm::left(60); x(n-1); x(n-1); } } } void y(const unsigned int n) { if (n==0) { ifm::forward(); ifm::left(90); ifm::forward(); } else { for(int i=0; i<12;++i) { y(n-1); ifm::right(60); x(n-1); x(n-1); } } } int main() { int n; std::cin >> n; for(int i=0; i<1;++i) { ifm::save(); x(n-1); ifm::right(30); y(n-1); y(n-1); ifm::left(90); } }