H11【选做•游戏】小蜜蜂

题目描述

测试用例 1	以文本方式显示 1 4↵	以文本方式显示 3↵	1秒	64M	0
测试用例 2	以文本方式显示 1 5↵	以文本方式显示 5↵	1秒	64M	0
测试用例 3	以文本方式显示 1 50↵	以文本方式显示 12586269025↵	1秒	64M	0
测试用例 4	以文本方式显示 2 50↵	以文本方式显示 7778742049↵	1秒	64M	0
测试用例 7	以文本方式显示 1 100↵	以文本方式显示 354224848179261915075↵	1秒	64M	0

解题思路

显然可行路线只和a-b的大小有关，和a、b具体值无关，为了方便理解我们不妨设a=0。f(n)表示到格子n的可行路线，则有f(n)=f(n-1)+f(n-2)，f(1)=1,f(2)=1。

则我们发现f(n)为斐波那契数列，并且方案数量即为f(b-a)，所以我们可以直接创建个数组，用for循环搞定

不过我们很快发现问题，斐波那契数列到99项有二十多位数，即使long long int都存不下。这时我们可以考虑用数组来模拟大数直接对其数位上的数字进行操作来实现大数加法

代码实现

正常解法

#define Max(a,b) (a>b?a:b)
#include <stdio.h> 
#include <string.h> 
void strAdd(char num1[30],char num2[30],char sumNum[30]){
	int isCarry=0；//表示是否进位
    int len1=strlen(num1),len2=strlen(num2),sum;
	for(int i=0;i<Max(len1,len2);i++){
        //如果有字符串到头了，要将字符串中的0转化为'0'
		num1[i]=num1[i]==0?'0':num1[i];
		num2[i]=num2[i]==0?'0':num2[i];
		sum=(num1[i]-'0')+(num2[i]-'0')+isCarry;
		isCarry=sum/10;
		sumNum[i]=sum%10+'0';
	}
    //判断最高位是否进位
	sumNum[Max(len1,len2)]=isCarry==1?'1':0;
} 
int main(){ 
    int a,b,n; 
 	char fn[100][30]={"1","2"}; 
    scanf("%d %d",&a,&b); 
  	n=b-a; 
 	for(int i=2;i<n;i++){ 
       strAdd(fn[i-2],fn[i-1],fn[i]); 
 	} //我们得到的字符串是个位在前，需要进行反转后才能得到正确结果输出
  	for(int left=0,right=strlen(fn[n-1])-1;left<right;left++,right--){ 
      	char temp=fn[n-1][left]; 
       	fn[n-1][left]=fn[n-1][right]; 
      	fn[n-1][right]=temp; 
   	} 
  	printf("%s\n",fn[n-1]); 
    return 0; 
} 

事实上，我们只要知道斐波那契数列前99项即可，所以这道题我们完全可以打表[狗头][狗头]

#include <stdio.h>    
int main(){   
    int a,b;   
    char fn[100][30]={"1","2","3","5","8","13","21","34","55","89","144","233","377","610","987","1597","2584","4181","6765","10946","17711","28657","46368","75025","121393","196418","317811","514229","832040","1346269","2178309","3524578","5702887","9227465","14930352","24157817","39088169","63245986","102334155","165580141","267914296","433494437","701408733","1134903170","1836311903","2971215073","4807526976","7778742049","12586269025","20365011074","32951280099","53316291173","86267571272","139583862445","225851433717","365435296162","591286729879","956722026041","1548008755920","2504730781961","4052739537881","6557470319842","10610209857723","17167680177565","27777890035288","44945570212853","72723460248141","117669030460994","190392490709135","308061521170129","498454011879264","806515533049393","1304969544928657","2111485077978050","3416454622906707","5527939700884757","8944394323791464","14472334024676221","23416728348467685","37889062373143906","61305790721611591","99194853094755497","160500643816367088","259695496911122585","420196140727489673","679891637638612258","1100087778366101931","1779979416004714189","2880067194370816120","4660046610375530309","7540113804746346429","12200160415121876738","19740274219868223167","31940434634990099905","51680708854858323072","83621143489848422977","135301852344706746049","218922995834555169026","354224848179261915075","573147844013817084101"};    
    scanf("%d %d",&a,&b); 
    printf("%s\n",fn[b-a-1]); 
    return 0;   
}