hdu1316 斐波纳契 大数 二分

hdu1316

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;

char a[105],b[105];
char F[495][110];

int cmp(char a[],char b[])
{
	int lenA=strlen(a),lenB=strlen(b),i,j;
	if(lenA<lenB)	return 1;
     // if(lenB>lenA)	return -1;    bug
  if(lenB<lenA) return -1;for(i=lenA-1;i>=0;i--){if(a[i]<b[i]) return 1;if(a[i]>b[i]) return -1;}return 0;}int bsearch_preTOx(char x[]){int mid,low=1,high=490;while(low<high){mid=low+(high-low)/2;if(cmp(F[mid],x)<=0) high=mid;else low=mid+1;}return
 low-1;}int bsearch_nextTOx(char x[]){int mid,low=1,high=490;while(low<high){mid=low+(high-low+1)