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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

//Informatik - Serie 5 - Challenge Aufgabe 127 // Programm: GulfiLaura.cpp // Bild von Lindenmayer // Autor: Laura Gulfi #include #include void y ( const unsigned int i); void x (const unsigned int i) { if (i >0) { ifm::save(); ifm::right(40); ifm::forward (4); y( i); ifm:: restore(); ifm::save(); ifm::left(40); ifm::forward (4); y( i); ifm:: restore(); } } void y (unsigned int i) {if(i>0) { ifm :: right (60); ifm::forward (2); ifm:: left (30); ifm ::forward(2); ifm :: left (30), ifm :: forward (2); x(i-1); } } int main () { unsigned int i; std ::cout << " Inserire il valore i = "; std::cin >> i; x(i); return 0; }