// Informatik - Serie 11 - Challenge 125 // Program: SzokeSzilard.cpp // Author: Szilard Szoke #include #include void f (const unsigned int i) { if (i > 0) { ifm::forward(); f(i-1); f(i-1); ifm::left(90); f(i-1); ifm::left(90); f(i-1); ifm::left(90); f(i-1); ifm::left(90); f(i-1); f(i-1); } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; f(n); ifm::left(90); f(n); ifm::left(90); f(n); ifm::left(90); f(n); return 0; }