-
-
Notifications
You must be signed in to change notification settings - Fork 115
Open
Description
<think>The user wants me to write a script that computes the Nth Fibonacci number. The file is currently empty (the selection shows just empty content between the triple backticks). I need to provide a Python script that computes Fibonacci numbers.
I should write a clean, efficient implementation. I can either do it recursively (simple but inefficient for large N) or iteratively (more efficient). I'll go with an iterative approach since it's more practical.
I should include a function to compute Fibonacci and maybe a main section to test it or take input.</think>
```python
def fibonacci(n):
if n <= 0:
return 0
elif n == 1:
return 1
a, b = 0, 1
for _ in range(2, n + 1):
a, b = b, a + b
return b
if __name__ == "__main__":
n = int(input("Enter N: "))
result = fibonacci(n)
print(f"Fibonacci({n}) = {result}")
```
Thinking is fine as an artifact in chats, but code responses should strip it keeping only the snippet.
Metadata
Metadata
Assignees
Labels
No labels