Бейсик:
DECLARE SUB F(n)
DECLARE SUB G(n)
SUB F(n)
IF n > 2 THEN
PRINT n
F(n - 1)
G(n - 2)
ELSE
PRINT n+2
END IF
END SUB
SUB G(n)
PRINT n
IF n > 2 THEN
G(n - 1)
F(n - 2)
ELSE
PRINT n+1
END IF
END SUB |
DECLARE SUB F(n)
DECLARE SUB G(n)
SUB F(n)
IF n > 2 THEN
PRINT n
F(n - 1)
G(n - 2)
ELSE
PRINT n+2
END IF
END SUB
SUB G(n)
PRINT n
IF n > 2 THEN
G(n - 1)
F(n - 2)
ELSE
PRINT n+1
END IF
END SUB
|
Python:
def F(n):
if n > 2:
print(n, end='')
F(n - 1)
G(n - 2)
else:
print(n+2, end='')
def G(n):
print(n, end='')
if n > 2:
G(n - 1)
F(n - 2)
else:
print(n+1, end='') |
def F(n):
if n > 2:
print(n, end='')
F(n - 1)
G(n - 2)
else:
print(n+2, end='')
def G(n):
print(n, end='')
if n > 2:
G(n - 1)
F(n - 2)
else:
print(n+1, end='')
|
С++:
void G(int n);
void F(int n) {
if (n > 2) {
std::cout << n;
F(n - 1);
G(n - 2);
}
else
std::cout << n+2;
}
void G(int n) {
std::cout << n;
if (n > 2) {
G(n - 1);
F(n - 2);
}
else
std::cout << n + 1;
} |
void G(int n);
void F(int n) {
if (n > 2) {
std::cout << n;
F(n - 1);
G(n - 2);
}
else
std::cout << n+2;
}
void G(int n) {
std::cout << n;
if (n > 2) {
G(n - 1);
F(n - 2);
}
else
std::cout << n + 1;
}
|