UVA - 10183 How Many Fibs? （大数）

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1124点击打开链接

Recall the definition of the Fibonacci numbers:f1 := 1f2 := 2fn := fn−1 + fn−2 (n ≥ 3)Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].InputThe input contains several test cases. Each test case consists of two non-negative integer numbers aand b. Input is terminated by a = b = 0. Otherwise, a ≤ b ≤ 10100. The numbers a and b are givenwith no superfluous leading zeros.OutputFor each test case output on a single line the number of Fibonacci numbers fi with a ≤ fi ≤ b.Sample Input10 1001234567890 98765432100 0Sample Output54

字符串模拟加法 然后暴力即可

#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
string fib[1111];
string cal(string s1,string s2)
{
	reverse(s1.begin(),s1.end());
	reverse(s2.begin(),s2.end());
	string s;
	int jw=0;
	int i;
	for(i=0;i<min(s1.length(),s2.length());i++)
	{
		int mid=s1[i]-'0'+s2[i]-'0'+jw;
		jw=mid/10;
		s+=mid%10+'0';
	}
	while(i<s1.length())
	{
		int mid=s1[i]-'0'+jw;
		jw=mid/10;
		s+=mid%10+'0';
		i++;
	}
	while(i<s2.length())
	{
		int mid=s2[i]-'0'+jw;
		jw=mid/10;
		s+=mid%10+'0';
		i++;
	}
	if(jw!=0)
		s+=jw+'0';
	reverse(s.begin(),s.end());
	return s;
}
int scmp(string s1,string s2)
{
	if(s1.length()>s2.length())
		return 1;
	else if(s1.length()<s2.length())
		return -1;
	else
	{
		for(int i=0;i<s1.length();i++)
		{
			if(s1[i]>s2[i])
				return 1;
			else if(s1[i]<s2[i])
				return -1;
		}
		return 0;
	}
}
int main()
{
	fib[0]=fib[1]="1";
	for(int i=2;i<1111;i++)
	{
		fib[i]=cal(fib[i-1],fib[i-2]);
	}
	string s1,s2;
	while(cin >>s1 >>s2)
	{
		int ans=0;
		if(s1=="0"&&s2=="0")
			break;
		for(int i=1;i<1111;i++)
		{
			if((scmp(fib[i],s1)==1||scmp(fib[i],s1)==0)&&(scmp(s2,fib[i])==1||scmp(s2,fib[i])==0))
				{
					//cout << fib[i] <<endl;
					ans++;
				}
		}
		cout <<ans <<endl;
	}
}