// Informatik - Serie 11 - Challenge 125 // Program: DietlicherRemo.cpp // Autor: Remo Dietlicher #include #include void x (const unsigned int i); void f (const unsigned int i) { if (i == 0) ifm::forward(); else { f(i-1); ifm::save(); ifm::forward(); ifm::left(30); ifm::forward(); f(i-1); ifm::restore(); ifm::save(); ifm::right(30); ifm::forward(); f(i-1); ifm::restore(); x(i-1); } return; } void x (unsigned int i) { if (i == 0) ifm::forward(); else { x(i-1); f(i-1); } } int main () { int n; std::cout << "number of iterations? "; std::cin >> n; f(n); return 0; }