#include <stdio.h>
 
// 递归函数计算斐波那契数
long long fibonacci(int n) {
    if (n == 0) return 0;
    if (n == 1) return 1;
    return fibonacci(n - 1) + fibonacci(n - 2);
}
 
int main() {
    int n;
    printf("请输入要查找的斐波那契数列位置n: ");
    scanf("%d", &n);
 
    if (n < 0) {
        printf("错误：n不能为负数\n");
        return 1;
    }
 
    long long result = fibonacci(n);
    printf("斐波那契数列第%d位是: %lld\n", n, result);
 
    return 0;
}

I2luY2x1ZGUgPHN0ZGlvLmg+CgovLyDpgJLlvZLlh73mlbDorqHnrpfmlpDms6LpgqPlpZHmlbAKbG9uZyBsb25nIGZpYm9uYWNjaShpbnQgbikgewogICAgaWYgKG4gPT0gMCkgcmV0dXJuIDA7CiAgICBpZiAobiA9PSAxKSByZXR1cm4gMTsKICAgIHJldHVybiBmaWJvbmFjY2kobiAtIDEpICsgZmlib25hY2NpKG4gLSAyKTsKfQoKaW50IG1haW4oKSB7CiAgICBpbnQgbjsKICAgIHByaW50Zigi6K+36L6T5YWl6KaB5p+l5om+55qE5paQ5rOi6YKj5aWR5pWw5YiX5L2N572ubjogIik7CiAgICBzY2FuZigiJWQiLCAmbik7CiAgICAKICAgIGlmIChuIDwgMCkgewogICAgICAgIHByaW50Zigi6ZSZ6K+v77yabuS4jeiDveS4uui0n+aVsFxuIik7CiAgICAgICAgcmV0dXJuIDE7CiAgICB9CiAgICAKICAgIGxvbmcgbG9uZyByZXN1bHQgPSBmaWJvbmFjY2kobik7CiAgICBwcmludGYoIuaWkOazoumCo+WlkeaVsOWIl+esrCVk5L2N5pivOiAlbGxkXG4iLCBuLCByZXN1bHQpOwogICAgCiAgICByZXR1cm4gMDsKfQ==

Nw==

7