UVa10183 - How Many Fibs?

#include <stdio.h>
#include <string.h>

#define MAX 150

char Fib[5 * MAX][MAX] = {"0", "1", "2"};
int Fib_len[MAX] = {1, 1};

void call_add(char *first, char *second, char *result);
void reverse(char *from, char *to);

int main()
{
	int count;
	int len = 0;
	char a[MAX], b[MAX];
	int a_len, b_len;
	int start, end;

	#ifndef ONLINE_JUDGE
        freopen("d:\\UVa\\uva_in.txt", "r", stdin);
	#endif

	for (count = 3; len <= 110; count++) {
		call_add(Fib[count - 2], Fib[count - 1], Fib[count]);
		len = strlen(Fib[count]);
		if (!Fib_len[len])
			Fib_len[len] = count;
	}
	count--;



	while (scanf("%s%s", a, b) && ((strcmp(a, "0") != 0) || (strcmp(b, "0") != 0))) {
		a_len = strlen(a);
		b_len = strlen(b);

		start = Fib_len[a_len];
		end = Fib_len[b_len];
		if (strcmp(Fib[start], a) < 0) {
			do {
				start++;
			} while (strlen(Fib[start]) == a_len && strcmp(Fib[start], a) < 0);
		}

		if (strcmp(Fib[end], b) <= 0) {
			do {
				end++;
			} while (strlen(Fib[end]) == b_len && strcmp(Fib[end], b) <= 0);
		}
		end--;

        printf("%d\n", end - start + 1);
	}


	return 0;
}



void reverse(char *from, char *to)
{
	int i, len = strlen(from);

	for (i = 0; i < len; i++)
		to[i] = from[len - 1 - i];
	to[len] = '\0';
}

void call_add(char *first, char *second, char *result)
{
	char F[MAX], S[MAX], Res[MAX];
	int f_len, s_len, sum, now, carry;

	f_len = strlen(first);
	s_len = strlen(second);
	reverse(first, F);
	reverse(second, S);

	for (now = 0, carry = 0; now < f_len && now < s_len; now++) {
		sum = (F[now] - '0') + (S[now] - '0') + carry;
		Res[now] = sum % 10 + '0';
		carry = sum / 10;
	}

	for (; now < f_len; now++) {
		sum = F[now] - '0' + carry;
		Res[now] = sum % 10 + '0';
		carry = sum / 10;
	}

	for (; now < s_len; now++) {
		sum = (S[now] - '0') + carry;
		Res[now] = sum % 10 + '0';
		carry = sum / 10;
	}

	if (carry)
		Res[now++] = carry + '0';
	Res[now] = '\0';
	reverse(Res, result);
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

kgduu

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值