← Toate task-urile
Task AI
6cef451874735cdfa0acb5cc3842a3f8
rewarded
Timeline
PROMPT UTILIZATOR
Trimis de: 7a8b70389a…b7a1e2e1ca
Tip: chat · Fee: 1.000000 OMBRA
Write a Python function that calculates fibonacci recursively
RĂSPUNSURI MINERI (2)
#1
Miner: 73c816c483…3660641830
NFT: 8f96b9dd…57e30cb1
🧠 openai-compatible:google/gemma-4-e2b⏱ 9.1s🎫 ? → 155⭐ Score: 95/100
Răspuns
```python
def fibonacci_recursive(n):
"""
Calculates the nth Fibonacci number using recursion.
"""
if n <= 0:
return 0
elif n == 1:
return 1
else:
# Recursive step: F(n) = F(n-1) + F(n-2)
return fibonacci_recursive(n - 1) + fibonacci_recursive(n - 2)
# Example usage:
number = 8
result = fibonacci_recursive(number)
print(f"The {number}th Fibonacci number is: {result}") # Output: The 8th Fibonacci number is: 21
number = 0
result = fibonacci_recursive(number)
print(f"The {number}th Fibonacci number is: {result}") # Output: The 0th Fibonacci number is: 0
```#2
Miner: 09af24a136…236918c2ca
NFT: 1aea4db9…e2b6580c
🧠 openai-compatible:google/gemma-4-e2b⏱ 6.0s🎫 ? → 88
Răspuns
```python
def fibonacci(n):
"""
Calculates the nth Fibonacci number recursively.
"""
if n <= 1:
return n
else:
return fibonacci(n - 1) + fibonacci(n - 2)
# Example usage:
number = 10
result = fibonacci(number)
print(f"The {number}th Fibonacci number is: {result}") # Output: The 10th Fibonacci number is: 55
```VALIDARE LLM-AS-JUDGE
Scoruri
⭐ 8f96b9dd88c7…428857e30cb1
95/100
Funcția este corectă și recursivă, bine structurată și clar comentată, include exemple utile; singura limitare minoră este tratarea valorilor negative ca 0 fără validare explicită.