正如题目中所暗示的一样,整个过程和Fibonacci数列很相像,但需要进行些许改动,就可以得到一个很类似的状态转移方程:rabbit[i]=rabbit[i-1]+rabbit[i-m],理解为当前月的成年兔子是上一个月已经成年的兔子加上这个月刚成年的兔子。而题目所求为d个月之后所有成年的和未成年的兔子,所求便是:rabbit[d]+rabbit[i],max(1,d-m+1)<=i<=d。
另外因为最终结果可能很大(最大就是题目给出的第三个样例),还要使用高精度方法才可以AC。
Run Time: 0.02sec
Run Memory: 304KB
Code length: 967Bytes
SubmitTime: 2012-02-04 23:48:39
// Problem#: 1029
// Submission#: 1205918
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <cstdio>
#include <string>
using namespace std;
string add( string& s1, string& s2 );
int main()
{
int i, m, d;
string sum, rabbit[ 101 ];
while ( scanf( "%d%d", &m, &d ) && m && d ) {
rabbit[ 1 ] = "1";
for ( i = 2; i <= d; i++ )
rabbit[ i ] = ( i > m ? add( rabbit[ i - 1 ], rabbit[ i - m ] ): rabbit[ i - 1 ] );
sum = rabbit[ d ];
for ( i = max( d - m + 1, 1 ); i <= d; i++ )
sum = add( sum, rabbit[ i ] );
printf( "%s\n", sum.c_str() );
}
return 0;
}
string add( string& s1, string& s2 ) {
int carry, sum;
string r = string( s1.size(), '0' );
s2 = string( s1.size() - s2.size(), '0' ) + s2;
carry = 0;
for ( int i = s1.size() - 1; i >= 0; i-- ) {
sum = ( s1[ i ] - '0' ) + ( s2[ i ] - '0' ) + carry;
r[ i ] = sum % 10 + '0';
carry = sum / 10;
}
if ( carry != 0 )
r = '1' + r;
return r;
}