血的教训啊

F( 0 ) = 0;
F( 1 ) = 1;
F( N ) = F( N - 1 )  + F( N - 2 )   N >=2;

动态规划且是内存最少的解法 在求F(N)时F(M)计算的次数。（N>M）

#include <iostream>using namespace std;long long ch[2];int main(){ long long n,m; long long i = 0; while( cin>>n>>m && m >=0 && n > m) { if ( n >= 2 ) { if ( m <= 1 ) { i = 2; } else { i = m; } if ( m % 2 == 0 ) { ch[0] = 1; ch[1] = 0; } else { ch[0] = 0; ch[1] = 1; } for ( ; i <= n; i++ ) { ch[i%2] = ( ch[(i+1)%2] + ch[i%2] )%9376; } cout<<ch[(i+1)%2]%9376<<endl; } else { cout<<"1"<<endl; } } return 0;}