Fibonacci sequence 求余数

#include <iostream>
using namespace std;
int f(int n);

int main()
{
    int n;
    cin>>n;
    double number = 1.0 * f(n);
    cout<<number<<endl;
    cout<< number / 10007<<endl;
    double leftNum = number / 10007 - (int)number / 10007;
    cout<<leftNum;

    return 0;
}

int f(int n)
{
    if(n == 1 || n == 2)
        return (1);
    else
    {
        return f(n - 1) + f(n - 2);
    }
}